{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZAYJTA7WWXDH7KTSPGRC3BYZPG","short_pith_number":"pith:ZAYJTA7W","schema_version":"1.0","canonical_sha256":"c8309983f6b5c67faa7279a22d871979b468eb1c1ad422bc861daeaae79acc0a","source":{"kind":"arxiv","id":"2104.14516","version":1},"attestation_state":"computed","paper":{"title":"Constructions in combinatorics via neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner","submitted_at":"2021-04-29T17:32:56Z","abstract_excerpt":"We demonstrate how by using a reinforcement learning algorithm, the deep cross-entropy method, one can find explicit constructions and counterexamples to several open conjectures in extremal combinatorics and graph theory. Amongst the conjectures we refute are a question of Brualdi and Cao about maximizing permanents of pattern avoiding matrices, and several problems related to the adjacency and distance eigenvalues of graphs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2104.14516","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-29T17:32:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d3a11f47e9728190ee738116aa15b45214df8808c8bd488fad5cdbee02dbb113","abstract_canon_sha256":"43d982ac940322704f39fa8614eedd0dd78d9aa78da1c98bdc3f3407e58e4bd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:17.416427Z","signature_b64":"LOKI3GBw6Ox6yXzOw9CD0+JegdLBfU/OuFpSo4mOHvA0JextrZjWMLvOP6Few5YFKIjrS5CcWNpWYVzwazn1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8309983f6b5c67faa7279a22d871979b468eb1c1ad422bc861daeaae79acc0a","last_reissued_at":"2026-07-05T02:36:17.415981Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:17.415981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions in combinatorics via neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner","submitted_at":"2021-04-29T17:32:56Z","abstract_excerpt":"We demonstrate how by using a reinforcement learning algorithm, the deep cross-entropy method, one can find explicit constructions and counterexamples to several open conjectures in extremal combinatorics and graph theory. Amongst the conjectures we refute are a question of Brualdi and Cao about maximizing permanents of pattern avoiding matrices, and several problems related to the adjacency and distance eigenvalues of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.14516","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.14516/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2104.14516","created_at":"2026-07-05T02:36:17.416044+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.14516v1","created_at":"2026-07-05T02:36:17.416044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14516","created_at":"2026-07-05T02:36:17.416044+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAYJTA7WWXDH","created_at":"2026-07-05T02:36:17.416044+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAYJTA7WWXDH7KTS","created_at":"2026-07-05T02:36:17.416044+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAYJTA7W","created_at":"2026-07-05T02:36:17.416044+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26399","citing_title":"Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26660","citing_title":"Generating Special Triangulations with Transformers","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2409.19379","citing_title":"Automated conjecturing with \\emph{TxGraffiti}","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2602.03433","citing_title":"When control meets large language models: From words to dynamics","ref_index":108,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19063","citing_title":"Mapping Uncharted Symmetries: Machine Discovery in Combinatorics","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2511.02864","citing_title":"Mathematical exploration and discovery at scale","ref_index":296,"is_internal_anchor":false},{"citing_arxiv_id":"2601.13209","citing_title":"AI for Mathematics: Progress, Challenges, and Prospects","ref_index":139,"is_internal_anchor":false},{"citing_arxiv_id":"2601.11482","citing_title":"A Genetic Algorithm for Generating Extreme Examples in Arithmetic Dynamics","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2602.17276","citing_title":"RLGT: A reinforcement learning framework for extremal graph theory","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07240","citing_title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06107","citing_title":"Artificial Intelligence and the Structure of Mathematics","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16188","citing_title":"Some results on small ordered and cyclic Ramsey numbers","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZAYJTA7WWXDH7KTSPGRC3BYZPG","json":"https://pith.science/pith/ZAYJTA7WWXDH7KTSPGRC3BYZPG.json","graph_json":"https://pith.science/api/pith-number/ZAYJTA7WWXDH7KTSPGRC3BYZPG/graph.json","events_json":"https://pith.science/api/pith-number/ZAYJTA7WWXDH7KTSPGRC3BYZPG/events.json","paper":"https://pith.science/paper/ZAYJTA7W"},"agent_actions":{"view_html":"https://pith.science/pith/ZAYJTA7WWXDH7KTSPGRC3BYZPG","download_json":"https://pith.science/pith/ZAYJTA7WWXDH7KTSPGRC3BYZPG.json","view_paper":"https://pith.science/paper/ZAYJTA7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.14516&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAYJTA7WWXDH7KTSPGRC3BYZPG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAYJTA7WWXDH7KTSPGRC3BYZPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAYJTA7WWXDH7KTSPGRC3BYZPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAYJTA7WWXDH7KTSPGRC3BYZPG/action/storage_attestation","attest_author":"https://pith.science/pith/ZAYJTA7WWXDH7KTSPGRC3BYZPG/action/author_attestation","sign_citation":"https://pith.science/pith/ZAYJTA7WWXDH7KTSPGRC3BYZPG/action/citation_signature","submit_replication":"https://pith.science/pith/ZAYJTA7WWXDH7KTSPGRC3BYZPG/action/replication_record"}},"created_at":"2026-07-05T02:36:17.416044+00:00","updated_at":"2026-07-05T02:36:17.416044+00:00"}