Combinatorial constructions and counterexamples with neural networks
The deep cross-entropy method (reinforcement learning) finds constructions and counterexamples to open conjectures in extremal combinatorics and graph theory, including a Brualdi–Cao question about permanents. The counterexamples are verifiable; source checked was only the arXiv paper, with no institutional announcement.
Technology: Deep cross-entropy (reinforcement learning)
Publication: Preprint · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: direct test
- Tested: The deep cross-entropy method found explicit constructions and counterexamples, verifiable by checking, including a refutation of a Brualdi and Cao question.
- Still unknown: Not reported in the arXiv abstract read.
- AI role: Reinforcement learning (deep cross-entropy method) searched for constructions and counterexamples.
Evidence sources: https://arxiv.org/abs/2104.14516
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.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
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.