{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ODLUPMCWL6CWPYCCCMPUPZ4QCR","short_pith_number":"pith:ODLUPMCW","schema_version":"1.0","canonical_sha256":"70d747b0565f8567e042131f47e790144107aa2a68aa1f6265f814e93634ab46","source":{"kind":"arxiv","id":"2403.17370","version":1},"attestation_state":"computed","paper":{"title":"Formal Verification of the Empty Hexagon Number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CG","authors_text":"Bernardo Subercaseaux, Cayden Codel, James Gallicchio, Marijn J. H. Heule, Mario Carneiro, Wojciech Nawrocki","submitted_at":"2024-03-26T04:09:35Z","abstract_excerpt":"A recent breakthrough in computer-assisted mathematics showed that every set of $30$ points in the plane in general position (i.e., without three on a common line) contains an empty convex hexagon, thus closing a line of research dating back to the 1930s. Through a combination of geometric insights and automated reasoning techniques, Heule and Scheucher constructed a CNF formula $\\phi_n$, with $O(n^4)$ clauses, whose unsatisfiability implies that no set of $n$ points in general position can avoid an empty convex hexagon. An unsatisfiability proof for n = 30 was then found with a SAT solver usi"},"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":"2403.17370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-03-26T04:09:35Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b92ffa5a324cb1f04c90d90fd33c32a5ef69523f4bb91ea6836e2c6540e1333d","abstract_canon_sha256":"984d8a74688aa3b18d09cd01028647b958fae229f5090ccb0268f4164499667e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:00:49.691503Z","signature_b64":"q/EaMYjZiCXTmSVn5saq8WfV8GwKLKWYUHxBaJX6k24hQhSkIMR7OIs1RDtDJLPm/VBlM5eDY2SItcBzEiOMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70d747b0565f8567e042131f47e790144107aa2a68aa1f6265f814e93634ab46","last_reissued_at":"2026-07-05T08:00:49.691040Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:00:49.691040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Verification of the Empty Hexagon Number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CG","authors_text":"Bernardo Subercaseaux, Cayden Codel, James Gallicchio, Marijn J. H. Heule, Mario Carneiro, Wojciech Nawrocki","submitted_at":"2024-03-26T04:09:35Z","abstract_excerpt":"A recent breakthrough in computer-assisted mathematics showed that every set of $30$ points in the plane in general position (i.e., without three on a common line) contains an empty convex hexagon, thus closing a line of research dating back to the 1930s. Through a combination of geometric insights and automated reasoning techniques, Heule and Scheucher constructed a CNF formula $\\phi_n$, with $O(n^4)$ clauses, whose unsatisfiability implies that no set of $n$ points in general position can avoid an empty convex hexagon. An unsatisfiability proof for n = 30 was then found with a SAT solver usi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.17370","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/2403.17370/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":"2403.17370","created_at":"2026-07-05T08:00:49.691095+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.17370v1","created_at":"2026-07-05T08:00:49.691095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.17370","created_at":"2026-07-05T08:00:49.691095+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODLUPMCWL6CW","created_at":"2026-07-05T08:00:49.691095+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODLUPMCWL6CWPYCC","created_at":"2026-07-05T08:00:49.691095+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODLUPMCW","created_at":"2026-07-05T08:00:49.691095+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20120","citing_title":"Combinatorial Geometry of Erd\\H{o}s--Szekeres Type Problems: SAT/ASP Modeling and Linear Subreduction","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODLUPMCWL6CWPYCCCMPUPZ4QCR","json":"https://pith.science/pith/ODLUPMCWL6CWPYCCCMPUPZ4QCR.json","graph_json":"https://pith.science/api/pith-number/ODLUPMCWL6CWPYCCCMPUPZ4QCR/graph.json","events_json":"https://pith.science/api/pith-number/ODLUPMCWL6CWPYCCCMPUPZ4QCR/events.json","paper":"https://pith.science/paper/ODLUPMCW"},"agent_actions":{"view_html":"https://pith.science/pith/ODLUPMCWL6CWPYCCCMPUPZ4QCR","download_json":"https://pith.science/pith/ODLUPMCWL6CWPYCCCMPUPZ4QCR.json","view_paper":"https://pith.science/paper/ODLUPMCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.17370&json=true","fetch_graph":"https://pith.science/api/pith-number/ODLUPMCWL6CWPYCCCMPUPZ4QCR/graph.json","fetch_events":"https://pith.science/api/pith-number/ODLUPMCWL6CWPYCCCMPUPZ4QCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODLUPMCWL6CWPYCCCMPUPZ4QCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODLUPMCWL6CWPYCCCMPUPZ4QCR/action/storage_attestation","attest_author":"https://pith.science/pith/ODLUPMCWL6CWPYCCCMPUPZ4QCR/action/author_attestation","sign_citation":"https://pith.science/pith/ODLUPMCWL6CWPYCCCMPUPZ4QCR/action/citation_signature","submit_replication":"https://pith.science/pith/ODLUPMCWL6CWPYCCCMPUPZ4QCR/action/replication_record"}},"created_at":"2026-07-05T08:00:49.691095+00:00","updated_at":"2026-07-05T08:00:49.691095+00:00"}