AI assists a minimax result for one-bit graph fingerprints
Source check: Source checked. Not independent scientific confirmation.
Finding: The preprint reports an optimal worst-case distinguishing probability of 8/27 for a specified family of randomized graph fingerprints with three vertex roles and symmetric Boolean tables. It also classifies optimal tables.
Technology: GPT-6.2 Astra Max; GPT-6 (Mira)
Family GPT-6: profile · models page
Publication: Preprint · Test context: direct test. Catalog categories, not an evidence grade.
- AI contribution
- The provenance statement credits Astra Max with the initial construction and minimax theorem and GPT-6 with parts of the classification.
- Test and result
- The manuscript reports computational checks alongside the mathematical argument.
- Limitation / still unknown
- Independent confirmation and the priority of overlapping results were not established.
Evidence sources and annotation context
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
Evidence sources: https://hexagonmath.org/2611.00604v1
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: paper. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
No follow-up recorded; this is not a claim that no follow-up exists. Follow-up review scope and date are not recorded. No source-supported relationships recorded.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.