{"id":"hexagon/2611.00604","pdf":"https://hexagonmath.org/pdf/2611.00604v1","url":"https://hexagonmath.org/abs/2611.00604v1","tags":["math.PR","cs.IT","msc:05C35","Combinatorics","Minimax optimization","Randomized fingerprinting","coding theory","finite fields","graph theory"],"score":0,"title":"Three Roles and One Bit: All Optimal Tables and Equality Graphs","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Viktor Diakin"],"reviews":0,"subject":"math.CO","summary":"We study a randomized one-bit fingerprint for distinguishing graphs on a common labeled vertex set. Each vertex independently receives one of three roles according to a common probability distribution. A symmetric Boolean table assigns bits to pairs of roles, and the fingerprint is the parity of these bits over the graph's edges. We prove that, for every $n \\geq 4$, the optimal worst-case detection probability over all symmetric Boolean tables and role distributions is exactly $8/27$. Every optimal distribution is uniform. For $n \\geq 5$, we classify exactly 21 optimal tables with fixed role…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT","ChatGPT","Claude Sonnet","Gemini","DeepSeek Chat"],"discussed":0,"published":"2026-11-19","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}