{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Q7DBY3AVLBNJWKNHKJ2MZ4F4IL","short_pith_number":"pith:Q7DBY3AV","canonical_record":{"source":{"id":"1108.2502","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-11T19:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"f6b1d5a27b3b99ffa43171674f4a64cfd14a06435839015fd9b525c18fa08316","abstract_canon_sha256":"e183a3914fb36725057f2d7fdfad23b4bc95a242de3f24d8088e4b76e053e1bb"},"schema_version":"1.0"},"canonical_sha256":"87c61c6c15585a9b29a75274ccf0bc42fb5527198a282acfdd0ba7659fc960ae","source":{"kind":"arxiv","id":"1108.2502","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2502","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2502v3","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2502","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"Q7DBY3AVLBNJ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q7DBY3AVLBNJWKNH","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q7DBY3AV","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Q7DBY3AVLBNJWKNHKJ2MZ4F4IL","target":"record","payload":{"canonical_record":{"source":{"id":"1108.2502","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-11T19:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"f6b1d5a27b3b99ffa43171674f4a64cfd14a06435839015fd9b525c18fa08316","abstract_canon_sha256":"e183a3914fb36725057f2d7fdfad23b4bc95a242de3f24d8088e4b76e053e1bb"},"schema_version":"1.0"},"canonical_sha256":"87c61c6c15585a9b29a75274ccf0bc42fb5527198a282acfdd0ba7659fc960ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:43.563872Z","signature_b64":"W+VWdDxMGs15DGSaVrM//LMJEU9Dvqd27nHzc2ow9nC5M6Xp993fi/cgH+H3d8NumOD08/uiWh5pSz4uXN/0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87c61c6c15585a9b29a75274ccf0bc42fb5527198a282acfdd0ba7659fc960ae","last_reissued_at":"2026-05-18T04:04:43.563414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:43.563414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.2502","source_version":3,"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-18T04:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zOBpqM8DksUC1rto3NEjUxGD5tD4TlIGf2eMsrV7RFj5jGhyIlHhztER1/2hJcTDptqQbOFVY3ktv0LzPETdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:51:15.976377Z"},"content_sha256":"41f201de48acd7371c9c476941841a70de0f0360a014633faaf7ccc87f658a4f","schema_version":"1.0","event_id":"sha256:41f201de48acd7371c9c476941841a70de0f0360a014633faaf7ccc87f658a4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Q7DBY3AVLBNJWKNHKJ2MZ4F4IL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dirac's theorem for random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee","submitted_at":"2011-08-11T19:41:34Z","abstract_excerpt":"A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $\\lceil n/2 \\rceil$ is Hamiltonian. In this paper we extend this result to random graphs. Motivated by the study of resilience of random graph properties we prove that if $p \\gg \\log n /n$, then a.a.s. every subgraph of $G(n,p)$ with minimum degree at least $(1/2+o(1))np$ is Hamiltonian. Our result improves on previously known bounds, and answers an open problem of Sudakov and Vu. Both, the range of edge probability $p$ and the value of the constant 1/2 are asymptotically best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2502","kind":"arxiv","version":3},"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-18T04:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"keIfJmwAN5ya2vz2N4psHD8BMmbuJjrwgYmspeCXN9KtZT6WVL08SEPB0NFPSKwM5kofnBPQUSKxUKZK7XzIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:51:15.976717Z"},"content_sha256":"84b369c0b25909a2b3b131813fe50d9ef7b36adc2e193c96c26bf24e3458d30c","schema_version":"1.0","event_id":"sha256:84b369c0b25909a2b3b131813fe50d9ef7b36adc2e193c96c26bf24e3458d30c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/bundle.json","state_url":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/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-02T00:51:15Z","links":{"resolver":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL","bundle":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/bundle.json","state":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Q7DBY3AVLBNJWKNHKJ2MZ4F4IL","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":"e183a3914fb36725057f2d7fdfad23b4bc95a242de3f24d8088e4b76e053e1bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-11T19:41:34Z","title_canon_sha256":"f6b1d5a27b3b99ffa43171674f4a64cfd14a06435839015fd9b525c18fa08316"},"schema_version":"1.0","source":{"id":"1108.2502","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2502","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2502v3","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2502","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"Q7DBY3AVLBNJ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q7DBY3AVLBNJWKNH","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q7DBY3AV","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:84b369c0b25909a2b3b131813fe50d9ef7b36adc2e193c96c26bf24e3458d30c","target":"graph","created_at":"2026-05-18T04:04:43Z","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 classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $\\lceil n/2 \\rceil$ is Hamiltonian. In this paper we extend this result to random graphs. Motivated by the study of resilience of random graph properties we prove that if $p \\gg \\log n /n$, then a.a.s. every subgraph of $G(n,p)$ with minimum degree at least $(1/2+o(1))np$ is Hamiltonian. Our result improves on previously known bounds, and answers an open problem of Sudakov and Vu. Both, the range of edge probability $p$ and the value of the constant 1/2 are asymptotically best possible.","authors_text":"Benny Sudakov, Choongbum Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-11T19:41:34Z","title":"Dirac's theorem for random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2502","kind":"arxiv","version":3},"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:41f201de48acd7371c9c476941841a70de0f0360a014633faaf7ccc87f658a4f","target":"record","created_at":"2026-05-18T04:04:43Z","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":"e183a3914fb36725057f2d7fdfad23b4bc95a242de3f24d8088e4b76e053e1bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-11T19:41:34Z","title_canon_sha256":"f6b1d5a27b3b99ffa43171674f4a64cfd14a06435839015fd9b525c18fa08316"},"schema_version":"1.0","source":{"id":"1108.2502","kind":"arxiv","version":3}},"canonical_sha256":"87c61c6c15585a9b29a75274ccf0bc42fb5527198a282acfdd0ba7659fc960ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87c61c6c15585a9b29a75274ccf0bc42fb5527198a282acfdd0ba7659fc960ae","first_computed_at":"2026-05-18T04:04:43.563414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:43.563414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W+VWdDxMGs15DGSaVrM//LMJEU9Dvqd27nHzc2ow9nC5M6Xp993fi/cgH+H3d8NumOD08/uiWh5pSz4uXN/0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:43.563872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2502","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41f201de48acd7371c9c476941841a70de0f0360a014633faaf7ccc87f658a4f","sha256:84b369c0b25909a2b3b131813fe50d9ef7b36adc2e193c96c26bf24e3458d30c"],"state_sha256":"a3fa3fc78b6feb4c7941c8149bf60a11a147735cb0f6e1dc670bfee231315619"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQtNcQiLGUTpRBb60aObSbkacog6Vr8XkU5p4N6OWeg/nqu16exvSpOtTeO35FDKOKWA1TlVuv8eM95/u2HTDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:51:15.978677Z","bundle_sha256":"ed51bdebd39173e98a830a993cdd9968d59a7a6e7dc2645cd7054136686be99c"}}