{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PALNP5AQXDFQ3PXCBLMZHG3247","short_pith_number":"pith:PALNP5AQ","canonical_record":{"source":{"id":"1602.07171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-23T14:44:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c864377f106d06d2345572ebaec73e7e390fec9f643660abd8c3116c6a68984a","abstract_canon_sha256":"db43951b29355c36a2dc517a7bd08cc17eff33d5110a2e5e21bd3a9935ea5367"},"schema_version":"1.0"},"canonical_sha256":"7816d7f410b8cb0dbee20ad9939b7ae7d0ba1dfbaaa39fdc4e21c1aad7bf85ca","source":{"kind":"arxiv","id":"1602.07171","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07171","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07171v2","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07171","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"PALNP5AQXDFQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PALNP5AQXDFQ3PXC","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PALNP5AQ","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PALNP5AQXDFQ3PXCBLMZHG3247","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-23T14:44:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c864377f106d06d2345572ebaec73e7e390fec9f643660abd8c3116c6a68984a","abstract_canon_sha256":"db43951b29355c36a2dc517a7bd08cc17eff33d5110a2e5e21bd3a9935ea5367"},"schema_version":"1.0"},"canonical_sha256":"7816d7f410b8cb0dbee20ad9939b7ae7d0ba1dfbaaa39fdc4e21c1aad7bf85ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:54.897652Z","signature_b64":"+VLhvh5O09UKVWuzkVpoimXhZ59GkaQCbEeqdHUuXfcNDH21UJ7BiirPx8ueVGL6WvujfTL6VO1k/RMeQkj8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7816d7f410b8cb0dbee20ad9939b7ae7d0ba1dfbaaa39fdc4e21c1aad7bf85ca","last_reissued_at":"2026-05-17T23:58:54.897077Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:54.897077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07171","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERy5rt/2Hy78FWjTyMTzrkMQYIn1GQHzm8qWY/OH9h/kTolup4oHS4Ms4kd8uGPvRekL4b1ISdZD2CUCUQ3ADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:54:31.928872Z"},"content_sha256":"d2b5ea9242ec71bf9a2088bd131374c9774ea7702c1b93b9bef92e1f4e3c91b8","schema_version":"1.0","event_id":"sha256:d2b5ea9242ec71bf9a2088bd131374c9774ea7702c1b93b9bef92e1f4e3c91b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PALNP5AQXDFQ3PXCBLMZHG3247","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved bounds for hypohamiltonian graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carol T. Zamfirescu, Jan Goedgebeur","submitted_at":"2016-02-23T14:44:55Z","abstract_excerpt":"A graph $G$ is hypohamiltonian if $G$ is non-hamiltonian and $G - v$ is hamiltonian for every $v \\in V(G)$. In the following, every graph is assumed to be hypohamiltonian. Aldred, Wormald, and McKay gave a list of all graphs of order at most 17. In this article, we present an algorithm to generate all graphs of a given order and apply it to prove that there exist exactly 14 graphs of order 18 and 34 graphs of order 19. We also extend their results in the cubic case. Furthermore, we show that (i) the smallest graph of girth 6 has order 25, (ii) the smallest planar graph has order at least 23, ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07171","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"THN7MI5NVNYlr8cK5+VIzdS6pYeMizWdXBiUA7Mmms5sVkxsvpz6IrNtTN9dM7g7HYPTuJ4BQSxCGa0gnUFiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:54:31.929581Z"},"content_sha256":"46bc64ea7ed760996ea3d750d6f351a32d910a38bdea4197668cd08102db4088","schema_version":"1.0","event_id":"sha256:46bc64ea7ed760996ea3d750d6f351a32d910a38bdea4197668cd08102db4088"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PALNP5AQXDFQ3PXCBLMZHG3247/bundle.json","state_url":"https://pith.science/pith/PALNP5AQXDFQ3PXCBLMZHG3247/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PALNP5AQXDFQ3PXCBLMZHG3247/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T00:54:31Z","links":{"resolver":"https://pith.science/pith/PALNP5AQXDFQ3PXCBLMZHG3247","bundle":"https://pith.science/pith/PALNP5AQXDFQ3PXCBLMZHG3247/bundle.json","state":"https://pith.science/pith/PALNP5AQXDFQ3PXCBLMZHG3247/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PALNP5AQXDFQ3PXCBLMZHG3247/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PALNP5AQXDFQ3PXCBLMZHG3247","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":"db43951b29355c36a2dc517a7bd08cc17eff33d5110a2e5e21bd3a9935ea5367","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-23T14:44:55Z","title_canon_sha256":"c864377f106d06d2345572ebaec73e7e390fec9f643660abd8c3116c6a68984a"},"schema_version":"1.0","source":{"id":"1602.07171","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07171","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07171v2","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07171","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"PALNP5AQXDFQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PALNP5AQXDFQ3PXC","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PALNP5AQ","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:46bc64ea7ed760996ea3d750d6f351a32d910a38bdea4197668cd08102db4088","target":"graph","created_at":"2026-05-17T23:58:54Z","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 $G$ is hypohamiltonian if $G$ is non-hamiltonian and $G - v$ is hamiltonian for every $v \\in V(G)$. In the following, every graph is assumed to be hypohamiltonian. Aldred, Wormald, and McKay gave a list of all graphs of order at most 17. In this article, we present an algorithm to generate all graphs of a given order and apply it to prove that there exist exactly 14 graphs of order 18 and 34 graphs of order 19. We also extend their results in the cubic case. Furthermore, we show that (i) the smallest graph of girth 6 has order 25, (ii) the smallest planar graph has order at least 23, (","authors_text":"Carol T. Zamfirescu, Jan Goedgebeur","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-23T14:44:55Z","title":"Improved bounds for hypohamiltonian graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07171","kind":"arxiv","version":2},"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:d2b5ea9242ec71bf9a2088bd131374c9774ea7702c1b93b9bef92e1f4e3c91b8","target":"record","created_at":"2026-05-17T23:58:54Z","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":"db43951b29355c36a2dc517a7bd08cc17eff33d5110a2e5e21bd3a9935ea5367","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-23T14:44:55Z","title_canon_sha256":"c864377f106d06d2345572ebaec73e7e390fec9f643660abd8c3116c6a68984a"},"schema_version":"1.0","source":{"id":"1602.07171","kind":"arxiv","version":2}},"canonical_sha256":"7816d7f410b8cb0dbee20ad9939b7ae7d0ba1dfbaaa39fdc4e21c1aad7bf85ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7816d7f410b8cb0dbee20ad9939b7ae7d0ba1dfbaaa39fdc4e21c1aad7bf85ca","first_computed_at":"2026-05-17T23:58:54.897077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:54.897077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+VLhvh5O09UKVWuzkVpoimXhZ59GkaQCbEeqdHUuXfcNDH21UJ7BiirPx8ueVGL6WvujfTL6VO1k/RMeQkj8Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:54.897652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07171","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2b5ea9242ec71bf9a2088bd131374c9774ea7702c1b93b9bef92e1f4e3c91b8","sha256:46bc64ea7ed760996ea3d750d6f351a32d910a38bdea4197668cd08102db4088"],"state_sha256":"578b5ff75decb3591abaf35a20e374ac05dbc84c4104fedce0aa2deafbfc03a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LonIjP23osk8xgyla9GFXm/OpejlNQLebOIPMZ2wbfSWjpil4jn9Y2lRhjlh+cCJCcyQ2rXkNdPmK/uQ/RJYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:54:31.933455Z","bundle_sha256":"21f2e7871570b994ab97dfa2f68cb79e910380ee91883fa16f45243ac218ae5c"}}