{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GKIUH2I6QOEGMGOEPHVEJQCXU3","short_pith_number":"pith:GKIUH2I6","schema_version":"1.0","canonical_sha256":"329143e91e83886619c479ea44c057a6c369e4ab4a785f24c5ac89b47382b13b","source":{"kind":"arxiv","id":"1302.2698","version":4},"attestation_state":"computed","paper":{"title":"Planar Hypohamiltonian Graphs on 40 Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Carol T. Zamfirescu, Mohammadreza Jooyandeh, Patric R. J. \\\"Osterg{\\aa}rd, Ville H. Pettersson","submitted_at":"2013-02-12T04:30:16Z","abstract_excerpt":"A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a Hamiltonian graph. Until now, the smallest known planar hypohamiltonian graph had 42 vertices, a result due to Araya and Wiener. That result is here improved upon by 25 planar hypohamiltonian graphs of order 40, which are found through computer-aided generation of certain families of planar graphs with girth 4 and a fixed number of 4-faces. It is further shown that planar hypohamiltonian graphs exist for all orders greater than or equal to 42. If Hamiltonian cycles are replaced by Hamiltonian pat"},"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":"1302.2698","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-12T04:30:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"120d0e00cde6df9333cb4acbb4df57662812792c77415c5aab8d66f4c2d3f32a","abstract_canon_sha256":"1668b6fcc7bffe84af17a9ad6d27ffdbf2331d5761b02ecd4675b367cacbfc41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:16.468859Z","signature_b64":"/gWjlF8qcWiJh1PGR/OgY6CvLNTShw+G3dYCdzeIxDMlXa7OgeqmtaEtHUGCOcIwc6IqgbtDDdWoTF0fWt2dBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"329143e91e83886619c479ea44c057a6c369e4ab4a785f24c5ac89b47382b13b","last_reissued_at":"2026-05-18T01:25:16.468380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:16.468380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar Hypohamiltonian Graphs on 40 Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Carol T. Zamfirescu, Mohammadreza Jooyandeh, Patric R. J. \\\"Osterg{\\aa}rd, Ville H. Pettersson","submitted_at":"2013-02-12T04:30:16Z","abstract_excerpt":"A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a Hamiltonian graph. Until now, the smallest known planar hypohamiltonian graph had 42 vertices, a result due to Araya and Wiener. That result is here improved upon by 25 planar hypohamiltonian graphs of order 40, which are found through computer-aided generation of certain families of planar graphs with girth 4 and a fixed number of 4-faces. It is further shown that planar hypohamiltonian graphs exist for all orders greater than or equal to 42. If Hamiltonian cycles are replaced by Hamiltonian pat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2698","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1302.2698","created_at":"2026-05-18T01:25:16.468451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2698v4","created_at":"2026-05-18T01:25:16.468451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2698","created_at":"2026-05-18T01:25:16.468451+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKIUH2I6QOEG","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKIUH2I6QOEGMGOE","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKIUH2I6","created_at":"2026-05-18T12:27:45.050594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GKIUH2I6QOEGMGOEPHVEJQCXU3","json":"https://pith.science/pith/GKIUH2I6QOEGMGOEPHVEJQCXU3.json","graph_json":"https://pith.science/api/pith-number/GKIUH2I6QOEGMGOEPHVEJQCXU3/graph.json","events_json":"https://pith.science/api/pith-number/GKIUH2I6QOEGMGOEPHVEJQCXU3/events.json","paper":"https://pith.science/paper/GKIUH2I6"},"agent_actions":{"view_html":"https://pith.science/pith/GKIUH2I6QOEGMGOEPHVEJQCXU3","download_json":"https://pith.science/pith/GKIUH2I6QOEGMGOEPHVEJQCXU3.json","view_paper":"https://pith.science/paper/GKIUH2I6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2698&json=true","fetch_graph":"https://pith.science/api/pith-number/GKIUH2I6QOEGMGOEPHVEJQCXU3/graph.json","fetch_events":"https://pith.science/api/pith-number/GKIUH2I6QOEGMGOEPHVEJQCXU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKIUH2I6QOEGMGOEPHVEJQCXU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKIUH2I6QOEGMGOEPHVEJQCXU3/action/storage_attestation","attest_author":"https://pith.science/pith/GKIUH2I6QOEGMGOEPHVEJQCXU3/action/author_attestation","sign_citation":"https://pith.science/pith/GKIUH2I6QOEGMGOEPHVEJQCXU3/action/citation_signature","submit_replication":"https://pith.science/pith/GKIUH2I6QOEGMGOEPHVEJQCXU3/action/replication_record"}},"created_at":"2026-05-18T01:25:16.468451+00:00","updated_at":"2026-05-18T01:25:16.468451+00:00"}