{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GKIUH2I6QOEGMGOEPHVEJQCXU3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1668b6fcc7bffe84af17a9ad6d27ffdbf2331d5761b02ecd4675b367cacbfc41","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-12T04:30:16Z","title_canon_sha256":"120d0e00cde6df9333cb4acbb4df57662812792c77415c5aab8d66f4c2d3f32a"},"schema_version":"1.0","source":{"id":"1302.2698","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2698","created_at":"2026-05-18T01:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2698v4","created_at":"2026-05-18T01:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2698","created_at":"2026-05-18T01:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"GKIUH2I6QOEG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GKIUH2I6QOEGMGOE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GKIUH2I6","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:9516410ddf45bcb3ffb14482a10e3c1fa0e927e941615d4711329c72b2f72fef","target":"graph","created_at":"2026-05-18T01:25:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Brendan D. McKay, Carol T. Zamfirescu, Mohammadreza Jooyandeh, Patric R. J. \\\"Osterg{\\aa}rd, Ville H. Pettersson","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-12T04:30:16Z","title":"Planar Hypohamiltonian Graphs on 40 Vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2698","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7379d25bb34b3dc7dd6f6c693b422ff2784863219d737d1a73e8a1ee9b0bd04b","target":"record","created_at":"2026-05-18T01:25:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1668b6fcc7bffe84af17a9ad6d27ffdbf2331d5761b02ecd4675b367cacbfc41","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-12T04:30:16Z","title_canon_sha256":"120d0e00cde6df9333cb4acbb4df57662812792c77415c5aab8d66f4c2d3f32a"},"schema_version":"1.0","source":{"id":"1302.2698","kind":"arxiv","version":4}},"canonical_sha256":"329143e91e83886619c479ea44c057a6c369e4ab4a785f24c5ac89b47382b13b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"329143e91e83886619c479ea44c057a6c369e4ab4a785f24c5ac89b47382b13b","first_computed_at":"2026-05-18T01:25:16.468380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:16.468380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/gWjlF8qcWiJh1PGR/OgY6CvLNTShw+G3dYCdzeIxDMlXa7OgeqmtaEtHUGCOcIwc6IqgbtDDdWoTF0fWt2dBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:16.468859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2698","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7379d25bb34b3dc7dd6f6c693b422ff2784863219d737d1a73e8a1ee9b0bd04b","sha256:9516410ddf45bcb3ffb14482a10e3c1fa0e927e941615d4711329c72b2f72fef"],"state_sha256":"ca56b8003291e5f2d2eb761e84d5267c6a3c930f17a50e82b322ba1398ff2d3d"}