{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XDDLE6QNSIOOSTQSDBIMMB64EU","short_pith_number":"pith:XDDLE6QN","canonical_record":{"source":{"id":"1410.1435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-06T16:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"278e1e1d1618ba414553e067b8d1bdcb7e438fb8cb94c7b9b5205aa03614b1a9","abstract_canon_sha256":"14279f40b10d096e7d880f916def0b05bb8892f1930a7ca69c9d291698ddde82"},"schema_version":"1.0"},"canonical_sha256":"b8c6b27a0d921ce94e121850c607dc25351155c24653e330357e78ba44b7e3f0","source":{"kind":"arxiv","id":"1410.1435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1435","created_at":"2026-05-18T02:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1435v1","created_at":"2026-05-18T02:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1435","created_at":"2026-05-18T02:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"XDDLE6QNSIOO","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XDDLE6QNSIOOSTQS","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XDDLE6QN","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XDDLE6QNSIOOSTQSDBIMMB64EU","target":"record","payload":{"canonical_record":{"source":{"id":"1410.1435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-06T16:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"278e1e1d1618ba414553e067b8d1bdcb7e438fb8cb94c7b9b5205aa03614b1a9","abstract_canon_sha256":"14279f40b10d096e7d880f916def0b05bb8892f1930a7ca69c9d291698ddde82"},"schema_version":"1.0"},"canonical_sha256":"b8c6b27a0d921ce94e121850c607dc25351155c24653e330357e78ba44b7e3f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:02.092062Z","signature_b64":"W0x/ZEor3yKrYNuWWx0eMY9fAD/EcG1Xy5V6zXjxV12pqhOrksMmxA+rwQC6BdP+eA6i8dANTcYFt9qhDVNuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8c6b27a0d921ce94e121850c607dc25351155c24653e330357e78ba44b7e3f0","last_reissued_at":"2026-05-18T02:41:02.091600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:02.091600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.1435","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-18T02:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FTZ8lzJ8Slb9yeOkGDxC3AgfpEkrzShk6KPcKLs9ix/noEdrBRiRGqFmyZgbEwanwhUUFsq2FMYY5Ep4aTHBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:17:04.674832Z"},"content_sha256":"47f98d02e7d1ec276e0fd82f7856af314e8dadee51a7fa62e8b5318320bba9ef","schema_version":"1.0","event_id":"sha256:47f98d02e7d1ec276e0fd82f7856af314e8dadee51a7fa62e8b5318320bba9ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XDDLE6QNSIOOSTQSDBIMMB64EU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compatible Hamilton cycles in Dirac graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee, Michael Krivelevich","submitted_at":"2014-10-06T16:14:31Z","abstract_excerpt":"A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once. A celebrated theorem of Dirac from 1952 asserts that every graph on $n\\ge 3$ vertices with minimum degree at least $n/2$ is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we obtain the following strengthening of this result. Given a graph $G=(V,E)$, an {\\em incompatibility system} $\\mathcal{F}$ over $G$ is a family $\\mathcal{F}=\\{F_v\\}_{v\\in V}$ such that for every $v\\in V$, the set $F_v$ is a set of unordered pairs $F_v \\subseteq \\{\\{e,e'\\}: e\\ne e'\\in E, e\\cap e'=\\{v\\}\\}$. An incompa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1435","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-18T02:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otcC0kWdPqZq4O4NIxBT9/un5gV9JaRaAgUPLHYEnyt+dH7mQ2IBjMNsJw7Nd1UjvvjOZ3SnplrUpSgrffUyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:17:04.675236Z"},"content_sha256":"fece6a4925fd69b11567cd14b607b335aa442861622d57822f303148b01d0248","schema_version":"1.0","event_id":"sha256:fece6a4925fd69b11567cd14b607b335aa442861622d57822f303148b01d0248"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDDLE6QNSIOOSTQSDBIMMB64EU/bundle.json","state_url":"https://pith.science/pith/XDDLE6QNSIOOSTQSDBIMMB64EU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDDLE6QNSIOOSTQSDBIMMB64EU/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-29T23:17:04Z","links":{"resolver":"https://pith.science/pith/XDDLE6QNSIOOSTQSDBIMMB64EU","bundle":"https://pith.science/pith/XDDLE6QNSIOOSTQSDBIMMB64EU/bundle.json","state":"https://pith.science/pith/XDDLE6QNSIOOSTQSDBIMMB64EU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDDLE6QNSIOOSTQSDBIMMB64EU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XDDLE6QNSIOOSTQSDBIMMB64EU","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":"14279f40b10d096e7d880f916def0b05bb8892f1930a7ca69c9d291698ddde82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-06T16:14:31Z","title_canon_sha256":"278e1e1d1618ba414553e067b8d1bdcb7e438fb8cb94c7b9b5205aa03614b1a9"},"schema_version":"1.0","source":{"id":"1410.1435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1435","created_at":"2026-05-18T02:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1435v1","created_at":"2026-05-18T02:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1435","created_at":"2026-05-18T02:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"XDDLE6QNSIOO","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XDDLE6QNSIOOSTQS","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XDDLE6QN","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:fece6a4925fd69b11567cd14b607b335aa442861622d57822f303148b01d0248","target":"graph","created_at":"2026-05-18T02:41:02Z","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 Hamiltonian if it contains a cycle passing through every vertex exactly once. A celebrated theorem of Dirac from 1952 asserts that every graph on $n\\ge 3$ vertices with minimum degree at least $n/2$ is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we obtain the following strengthening of this result. Given a graph $G=(V,E)$, an {\\em incompatibility system} $\\mathcal{F}$ over $G$ is a family $\\mathcal{F}=\\{F_v\\}_{v\\in V}$ such that for every $v\\in V$, the set $F_v$ is a set of unordered pairs $F_v \\subseteq \\{\\{e,e'\\}: e\\ne e'\\in E, e\\cap e'=\\{v\\}\\}$. An incompa","authors_text":"Benny Sudakov, Choongbum Lee, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-06T16:14:31Z","title":"Compatible Hamilton cycles in Dirac graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1435","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:47f98d02e7d1ec276e0fd82f7856af314e8dadee51a7fa62e8b5318320bba9ef","target":"record","created_at":"2026-05-18T02:41:02Z","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":"14279f40b10d096e7d880f916def0b05bb8892f1930a7ca69c9d291698ddde82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-06T16:14:31Z","title_canon_sha256":"278e1e1d1618ba414553e067b8d1bdcb7e438fb8cb94c7b9b5205aa03614b1a9"},"schema_version":"1.0","source":{"id":"1410.1435","kind":"arxiv","version":1}},"canonical_sha256":"b8c6b27a0d921ce94e121850c607dc25351155c24653e330357e78ba44b7e3f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8c6b27a0d921ce94e121850c607dc25351155c24653e330357e78ba44b7e3f0","first_computed_at":"2026-05-18T02:41:02.091600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:02.091600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W0x/ZEor3yKrYNuWWx0eMY9fAD/EcG1Xy5V6zXjxV12pqhOrksMmxA+rwQC6BdP+eA6i8dANTcYFt9qhDVNuCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:02.092062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47f98d02e7d1ec276e0fd82f7856af314e8dadee51a7fa62e8b5318320bba9ef","sha256:fece6a4925fd69b11567cd14b607b335aa442861622d57822f303148b01d0248"],"state_sha256":"6b7e5880cf65d2e291002a047fa5a966b6f00be337215fde34cdd5175f13528f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EmAh+amYanv3Zy7XuVWPWD3EIzLcbnGl0EBdUdj2zZtPlm6KnSBaBOzW04a5Vx+UiKZod71EQNiii/Wc2xqxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T23:17:04.678665Z","bundle_sha256":"b128c9344666fa090f70d8aad5c10ee16c098f199c2e110d139769d7dff6a763"}}