{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FWSSRDNZALVVS5OHCC4ALLYMXW","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":"1d37e5f9a2d7b6f16a2ec4918c74bb36bf16feeda6c4cfe48f32dc88fdf82b69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-10T22:35:21Z","title_canon_sha256":"1733cdbb7934e764538968647ad3256e1a7320c3df1d57c08a44a179f6537df3"},"schema_version":"1.0","source":{"id":"1201.2202","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2202","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2202v2","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2202","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"FWSSRDNZALVV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FWSSRDNZALVVS5OH","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FWSSRDNZ","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:cc3dd968e0b914f3ccb424660631b388e4e95311160c2f14ebed6913d92edc3b","target":"graph","created_at":"2026-05-18T03:45:10Z","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 which passes through every vertex of the graph exactly once. A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $n/2$ is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we extend Dirac's theorem in two directions and show that Dirac graphs are robustly Hamiltonian in a very strong sense. First, we consider a random subgraph of a Dirac graph obtained by taking each edge independently with probability $p$, and prove that there exists a constant $C$ such that if $p \\ge C \\lo","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":"2012-01-10T22:35:21Z","title":"Robust Hamiltonicity of Dirac graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2202","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:5ff36e3c909a3bbf2fec5bd045b980ea7dd14849c09b4baed810d619ec2d30e3","target":"record","created_at":"2026-05-18T03:45:10Z","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":"1d37e5f9a2d7b6f16a2ec4918c74bb36bf16feeda6c4cfe48f32dc88fdf82b69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-10T22:35:21Z","title_canon_sha256":"1733cdbb7934e764538968647ad3256e1a7320c3df1d57c08a44a179f6537df3"},"schema_version":"1.0","source":{"id":"1201.2202","kind":"arxiv","version":2}},"canonical_sha256":"2da5288db902eb5975c710b805af0cbda749ab0d0366e3c76b7e624676a2c051","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2da5288db902eb5975c710b805af0cbda749ab0d0366e3c76b7e624676a2c051","first_computed_at":"2026-05-18T03:45:10.708813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:10.708813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CF0PHVei5+0r90e/70IbYK7DRD87A5zn39+2PJtg9tQ/S3hEwQbHsz23mbE/TQrqZP8KEEgZK32IXqy/RjHDAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:10.709361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2202","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ff36e3c909a3bbf2fec5bd045b980ea7dd14849c09b4baed810d619ec2d30e3","sha256:cc3dd968e0b914f3ccb424660631b388e4e95311160c2f14ebed6913d92edc3b"],"state_sha256":"ecc355107d9086ecc7107f569694b6baf5c6d1cdd4fb8f2be7eed916a238bc8c"}