{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CA3Z2WVLRXLFUFGW6WYIVPWSYN","short_pith_number":"pith:CA3Z2WVL","schema_version":"1.0","canonical_sha256":"10379d5aab8dd65a14d6f5b08abed2c34a7d1c63d523c92fd3850f152ccb3e27","source":{"kind":"arxiv","id":"1402.4754","version":2},"attestation_state":"computed","paper":{"title":"Solution to a problem of Bollob\\'as and H\\\"aggkvist on Hamilton cycles in regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Daniela K\\\"uhn, Deryk Osthus, Katherine Staden","submitted_at":"2014-02-19T18:18:16Z","abstract_excerpt":"We prove that, for large $n$, every $3$-connected $D$-regular graph on $n$ vertices with $D \\geq n/4$ is Hamiltonian. This is best possible and confirms a conjecture posed independently by Bollob\\'as and H\\\"aggkvist in the 1970s. The proof builds on a structural decomposition result proved recently by the same authors."},"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":"1402.4754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-19T18:18:16Z","cross_cats_sorted":[],"title_canon_sha256":"6a0cb0cacd519db441728d16a0523cfeda155af449222ee477678940cc7f3143","abstract_canon_sha256":"775bc23c49400a7de3a5e9ddd545973fc81f7d05132dcbd5367117b5ccc7ea7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:16.335130Z","signature_b64":"EuqAtUtuJxMFgZL+vNDF1swP33itd/yBKzbsvAUDU3haRBeTxbuJLL7OPbxsSQwEtuRZ2gpIEb6l3b4ASQKCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10379d5aab8dd65a14d6f5b08abed2c34a7d1c63d523c92fd3850f152ccb3e27","last_reissued_at":"2026-05-18T01:21:16.334441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:16.334441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solution to a problem of Bollob\\'as and H\\\"aggkvist on Hamilton cycles in regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Daniela K\\\"uhn, Deryk Osthus, Katherine Staden","submitted_at":"2014-02-19T18:18:16Z","abstract_excerpt":"We prove that, for large $n$, every $3$-connected $D$-regular graph on $n$ vertices with $D \\geq n/4$ is Hamiltonian. This is best possible and confirms a conjecture posed independently by Bollob\\'as and H\\\"aggkvist in the 1970s. The proof builds on a structural decomposition result proved recently by the same authors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4754","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.4754","created_at":"2026-05-18T01:21:16.334555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4754v2","created_at":"2026-05-18T01:21:16.334555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4754","created_at":"2026-05-18T01:21:16.334555+00:00"},{"alias_kind":"pith_short_12","alias_value":"CA3Z2WVLRXLF","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CA3Z2WVLRXLFUFGW","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CA3Z2WVL","created_at":"2026-05-18T12:28:22.404517+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/CA3Z2WVLRXLFUFGW6WYIVPWSYN","json":"https://pith.science/pith/CA3Z2WVLRXLFUFGW6WYIVPWSYN.json","graph_json":"https://pith.science/api/pith-number/CA3Z2WVLRXLFUFGW6WYIVPWSYN/graph.json","events_json":"https://pith.science/api/pith-number/CA3Z2WVLRXLFUFGW6WYIVPWSYN/events.json","paper":"https://pith.science/paper/CA3Z2WVL"},"agent_actions":{"view_html":"https://pith.science/pith/CA3Z2WVLRXLFUFGW6WYIVPWSYN","download_json":"https://pith.science/pith/CA3Z2WVLRXLFUFGW6WYIVPWSYN.json","view_paper":"https://pith.science/paper/CA3Z2WVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4754&json=true","fetch_graph":"https://pith.science/api/pith-number/CA3Z2WVLRXLFUFGW6WYIVPWSYN/graph.json","fetch_events":"https://pith.science/api/pith-number/CA3Z2WVLRXLFUFGW6WYIVPWSYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CA3Z2WVLRXLFUFGW6WYIVPWSYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CA3Z2WVLRXLFUFGW6WYIVPWSYN/action/storage_attestation","attest_author":"https://pith.science/pith/CA3Z2WVLRXLFUFGW6WYIVPWSYN/action/author_attestation","sign_citation":"https://pith.science/pith/CA3Z2WVLRXLFUFGW6WYIVPWSYN/action/citation_signature","submit_replication":"https://pith.science/pith/CA3Z2WVLRXLFUFGW6WYIVPWSYN/action/replication_record"}},"created_at":"2026-05-18T01:21:16.334555+00:00","updated_at":"2026-05-18T01:21:16.334555+00:00"}