{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Q7DBY3AVLBNJWKNHKJ2MZ4F4IL","short_pith_number":"pith:Q7DBY3AV","schema_version":"1.0","canonical_sha256":"87c61c6c15585a9b29a75274ccf0bc42fb5527198a282acfdd0ba7659fc960ae","source":{"kind":"arxiv","id":"1108.2502","version":3},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.2502","created_at":"2026-05-18T04:04:43.563471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2502v3","created_at":"2026-05-18T04:04:43.563471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2502","created_at":"2026-05-18T04:04:43.563471+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7DBY3AVLBNJ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7DBY3AVLBNJWKNH","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7DBY3AV","created_at":"2026-05-18T12:26:39.201973+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/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL","json":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL.json","graph_json":"https://pith.science/api/pith-number/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/graph.json","events_json":"https://pith.science/api/pith-number/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/events.json","paper":"https://pith.science/paper/Q7DBY3AV"},"agent_actions":{"view_html":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL","download_json":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL.json","view_paper":"https://pith.science/paper/Q7DBY3AV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2502&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/action/storage_attestation","attest_author":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/action/author_attestation","sign_citation":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/action/citation_signature","submit_replication":"https://pith.science/pith/Q7DBY3AVLBNJWKNHKJ2MZ4F4IL/action/replication_record"}},"created_at":"2026-05-18T04:04:43.563471+00:00","updated_at":"2026-05-18T04:04:43.563471+00:00"}