{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UKXAVHRJ53EANTVFT7R6CCQM5M","short_pith_number":"pith:UKXAVHRJ","canonical_record":{"source":{"id":"1902.01745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T15:40:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"27725022eb5ddfd67570133c6186b766976bba2b548a79f0d3b235a3d5098d0c","abstract_canon_sha256":"4e62f1b87ce6436d6628cd0a8aa7dc44bb37da2fdc6027d4df0d49a23719a038"},"schema_version":"1.0"},"canonical_sha256":"a2ae0a9e29eec806cea59fe3e10a0ceb0f0df1e669e428949e590fcd79e5a29b","source":{"kind":"arxiv","id":"1902.01745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01745","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01745v1","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01745","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"UKXAVHRJ53EA","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UKXAVHRJ53EANTVF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UKXAVHRJ","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UKXAVHRJ53EANTVFT7R6CCQM5M","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T15:40:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"27725022eb5ddfd67570133c6186b766976bba2b548a79f0d3b235a3d5098d0c","abstract_canon_sha256":"4e62f1b87ce6436d6628cd0a8aa7dc44bb37da2fdc6027d4df0d49a23719a038"},"schema_version":"1.0"},"canonical_sha256":"a2ae0a9e29eec806cea59fe3e10a0ceb0f0df1e669e428949e590fcd79e5a29b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:46.834193Z","signature_b64":"UZi0yW2bGzJEMLJhmIWfmhAytoI2bIT2QcNrWoww92cOq+jltUJUnCqGZxLOcNYEg9ATLOhCk38d500W25lADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2ae0a9e29eec806cea59fe3e10a0ceb0f0df1e669e428949e590fcd79e5a29b","last_reissued_at":"2026-05-17T23:54:46.833599Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:46.833599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01745","source_version":1,"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:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YagwV8Mja4Mh9GckKs/7jBGrX76Z8Bzvtbi1uc9V7lZ5VVHzFBzGmEsA5HHLPK6REi7itCvTiptcXYOIUPILCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:58:45.061207Z"},"content_sha256":"5682e08c290954036998fd2273a628c1181ded69656583afd6821ed0227f8777","schema_version":"1.0","event_id":"sha256:5682e08c290954036998fd2273a628c1181ded69656583afd6821ed0227f8777"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UKXAVHRJ53EANTVFT7R6CCQM5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamiltonicity below Dirac's condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Bart M.P. Jansen, Jesper Nederlof, L\\'aszl\\'o Kozma","submitted_at":"2019-02-05T15:40:47Z","abstract_excerpt":"Dirac's theorem (1952) is a classical result of graph theory, stating that an $n$-vertex graph ($n \\geq 3$) is Hamiltonian if every vertex has degree at least $n/2$. Both the value $n/2$ and the requirement for every vertex to have high degree are necessary for the theorem to hold.\n  In this work we give efficient algorithms for determining Hamiltonicity when either of the two conditions are relaxed. More precisely, we show that the Hamiltonian cycle problem can be solved in time $c^k \\cdot n^{O(1)}$, for some fixed constant $c$, if at least $n-k$ vertices have degree at least $n/2$, or if all"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01745","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":""},"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:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87qkibT519ZwsdpquJ0zjI9XXE4HTsIJqHbeNWK/F/kJHEnrCr1OkhyiqvOIgdXgcC2paAEuUMMTlYmkQr4zAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:58:45.061577Z"},"content_sha256":"dbd79d9694e5a4a427ab27c2d1ffbc1d72f1d7b7642e670eaa1342054527c7e7","schema_version":"1.0","event_id":"sha256:dbd79d9694e5a4a427ab27c2d1ffbc1d72f1d7b7642e670eaa1342054527c7e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKXAVHRJ53EANTVFT7R6CCQM5M/bundle.json","state_url":"https://pith.science/pith/UKXAVHRJ53EANTVFT7R6CCQM5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKXAVHRJ53EANTVFT7R6CCQM5M/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-06-05T16:58:45Z","links":{"resolver":"https://pith.science/pith/UKXAVHRJ53EANTVFT7R6CCQM5M","bundle":"https://pith.science/pith/UKXAVHRJ53EANTVFT7R6CCQM5M/bundle.json","state":"https://pith.science/pith/UKXAVHRJ53EANTVFT7R6CCQM5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKXAVHRJ53EANTVFT7R6CCQM5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UKXAVHRJ53EANTVFT7R6CCQM5M","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":"4e62f1b87ce6436d6628cd0a8aa7dc44bb37da2fdc6027d4df0d49a23719a038","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T15:40:47Z","title_canon_sha256":"27725022eb5ddfd67570133c6186b766976bba2b548a79f0d3b235a3d5098d0c"},"schema_version":"1.0","source":{"id":"1902.01745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01745","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01745v1","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01745","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"UKXAVHRJ53EA","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UKXAVHRJ53EANTVF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UKXAVHRJ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:dbd79d9694e5a4a427ab27c2d1ffbc1d72f1d7b7642e670eaa1342054527c7e7","target":"graph","created_at":"2026-05-17T23:54:46Z","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":"Dirac's theorem (1952) is a classical result of graph theory, stating that an $n$-vertex graph ($n \\geq 3$) is Hamiltonian if every vertex has degree at least $n/2$. Both the value $n/2$ and the requirement for every vertex to have high degree are necessary for the theorem to hold.\n  In this work we give efficient algorithms for determining Hamiltonicity when either of the two conditions are relaxed. More precisely, we show that the Hamiltonian cycle problem can be solved in time $c^k \\cdot n^{O(1)}$, for some fixed constant $c$, if at least $n-k$ vertices have degree at least $n/2$, or if all","authors_text":"Bart M.P. Jansen, Jesper Nederlof, L\\'aszl\\'o Kozma","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T15:40:47Z","title":"Hamiltonicity below Dirac's condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01745","kind":"arxiv","version":1},"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:5682e08c290954036998fd2273a628c1181ded69656583afd6821ed0227f8777","target":"record","created_at":"2026-05-17T23:54:46Z","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":"4e62f1b87ce6436d6628cd0a8aa7dc44bb37da2fdc6027d4df0d49a23719a038","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T15:40:47Z","title_canon_sha256":"27725022eb5ddfd67570133c6186b766976bba2b548a79f0d3b235a3d5098d0c"},"schema_version":"1.0","source":{"id":"1902.01745","kind":"arxiv","version":1}},"canonical_sha256":"a2ae0a9e29eec806cea59fe3e10a0ceb0f0df1e669e428949e590fcd79e5a29b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2ae0a9e29eec806cea59fe3e10a0ceb0f0df1e669e428949e590fcd79e5a29b","first_computed_at":"2026-05-17T23:54:46.833599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:46.833599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UZi0yW2bGzJEMLJhmIWfmhAytoI2bIT2QcNrWoww92cOq+jltUJUnCqGZxLOcNYEg9ATLOhCk38d500W25lADA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:46.834193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5682e08c290954036998fd2273a628c1181ded69656583afd6821ed0227f8777","sha256:dbd79d9694e5a4a427ab27c2d1ffbc1d72f1d7b7642e670eaa1342054527c7e7"],"state_sha256":"d272869a6d3e8b6d217238eed9dfd9b8358325a1cb2abb19c314c91a8b2c08b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fK47uVRG+abkM8Gb69tnDXkWvXsOgg7Du9zzsG7t2u0oRRo2hFiug7d4UL00aKgnoOdtLPJzMO+p4Qy8swaMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:58:45.063608Z","bundle_sha256":"b0b753316a2a68b1a08e82125fec38da5f53d633e089c82e4ae8dfa89aeaf432"}}