{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Y2C6DFYBWQAXRHSLBAMNRUB56F","short_pith_number":"pith:Y2C6DFYB","schema_version":"1.0","canonical_sha256":"c685e19701b401789e4b0818d8d03df1415f0098f9cf7eae298469d894364b91","source":{"kind":"arxiv","id":"1207.0312","version":3},"attestation_state":"computed","paper":{"title":"Long paths and cycles in random subgraphs of graphs with large minimum degree","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":"2012-07-02T09:15:38Z","abstract_excerpt":"For a given finite graph $G$ of minimum degree at least $k$, let $G_{p}$ be a random subgraph of $G$ obtained by taking each edge independently with probability $p$. We prove that (i) if $p \\ge \\omega/k$ for a function $\\omega=\\omega(k)$ that tends to infinity as $k$ does, then $G_p$ asymptotically almost surely contains a cycle (and thus a path) of length at least $(1-o(1))k$, and (ii) if $p \\ge (1+o(1))\\ln k/k$, then $G_p$ asymptotically almost surely contains a path of length at least $k$. Our theorems extend classical results on paths and cycles in the binomial random graph, obtained by ta"},"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":"1207.0312","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-02T09:15:38Z","cross_cats_sorted":[],"title_canon_sha256":"2e2b37d5f5f340e798c444f4ff8ff810319b68a56dad86d4c6f1a22b67b79469","abstract_canon_sha256":"2a9444418efe1900b9aeb83249e822fe5a59af56a6d78aac2715bcf198f7c76b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:54.246833Z","signature_b64":"UuwEP0HtDNjJSB4wcCL7wyOUO0iASrYCdhmovkreTMXRe3oH0mYvFSH5Rr1fd0NKJiQwIqZNkNWHz7rrDebtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c685e19701b401789e4b0818d8d03df1415f0098f9cf7eae298469d894364b91","last_reissued_at":"2026-05-18T03:24:54.246153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:54.246153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long paths and cycles in random subgraphs of graphs with large minimum degree","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":"2012-07-02T09:15:38Z","abstract_excerpt":"For a given finite graph $G$ of minimum degree at least $k$, let $G_{p}$ be a random subgraph of $G$ obtained by taking each edge independently with probability $p$. We prove that (i) if $p \\ge \\omega/k$ for a function $\\omega=\\omega(k)$ that tends to infinity as $k$ does, then $G_p$ asymptotically almost surely contains a cycle (and thus a path) of length at least $(1-o(1))k$, and (ii) if $p \\ge (1+o(1))\\ln k/k$, then $G_p$ asymptotically almost surely contains a path of length at least $k$. Our theorems extend classical results on paths and cycles in the binomial random graph, obtained by ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0312","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":"1207.0312","created_at":"2026-05-18T03:24:54.246247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0312v3","created_at":"2026-05-18T03:24:54.246247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0312","created_at":"2026-05-18T03:24:54.246247+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2C6DFYBWQAX","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2C6DFYBWQAXRHSL","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2C6DFYB","created_at":"2026-05-18T12:27:27.928770+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/Y2C6DFYBWQAXRHSLBAMNRUB56F","json":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F.json","graph_json":"https://pith.science/api/pith-number/Y2C6DFYBWQAXRHSLBAMNRUB56F/graph.json","events_json":"https://pith.science/api/pith-number/Y2C6DFYBWQAXRHSLBAMNRUB56F/events.json","paper":"https://pith.science/paper/Y2C6DFYB"},"agent_actions":{"view_html":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F","download_json":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F.json","view_paper":"https://pith.science/paper/Y2C6DFYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0312&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2C6DFYBWQAXRHSLBAMNRUB56F/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2C6DFYBWQAXRHSLBAMNRUB56F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/action/storage_attestation","attest_author":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/action/author_attestation","sign_citation":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/action/citation_signature","submit_replication":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/action/replication_record"}},"created_at":"2026-05-18T03:24:54.246247+00:00","updated_at":"2026-05-18T03:24:54.246247+00:00"}