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 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 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00604 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…