{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Y2C6DFYBWQAXRHSLBAMNRUB56F","short_pith_number":"pith:Y2C6DFYB","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"},"canonical_sha256":"c685e19701b401789e4b0818d8d03df1415f0098f9cf7eae298469d894364b91","source":{"kind":"arxiv","id":"1207.0312","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0312","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0312v3","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0312","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"pith_short_12","alias_value":"Y2C6DFYBWQAX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y2C6DFYBWQAXRHSL","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y2C6DFYB","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Y2C6DFYBWQAXRHSLBAMNRUB56F","target":"record","payload":{"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"},"canonical_sha256":"c685e19701b401789e4b0818d8d03df1415f0098f9cf7eae298469d894364b91","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"},"source_kind":"arxiv","source_id":"1207.0312","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-18T03:24:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ndmhvn05qlJj68gEqLqr9g/HdDI8UdOUOo93mSwovNU21PmeMorE3Buh0k/TchPoF2QGuYqklyS1DzyxR2OAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:09:55.618391Z"},"content_sha256":"3bd8bb9f7dde8091d8ddc5bfc42e89ef476a028019548434343fd54ec0fb62c6","schema_version":"1.0","event_id":"sha256:3bd8bb9f7dde8091d8ddc5bfc42e89ef476a028019548434343fd54ec0fb62c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Y2C6DFYBWQAXRHSLBAMNRUB56F","target":"graph","payload":{"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"},"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-18T03:24:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzX1Nk/in9jJE+Vxf0nvTeydzDCw0JkozycdknHXzCtIEOZcOQPMjktBpwTICfYsga/H9FZI4bDSwZgs/DV0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:09:55.618859Z"},"content_sha256":"86235a48aeb41fbaaaa0f286d9a62b15292a4d566fe1eb3220fa0db8bb15289e","schema_version":"1.0","event_id":"sha256:86235a48aeb41fbaaaa0f286d9a62b15292a4d566fe1eb3220fa0db8bb15289e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/bundle.json","state_url":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/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-30T07:09:55Z","links":{"resolver":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F","bundle":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/bundle.json","state":"https://pith.science/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2C6DFYBWQAXRHSLBAMNRUB56F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Y2C6DFYBWQAXRHSLBAMNRUB56F","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":"2a9444418efe1900b9aeb83249e822fe5a59af56a6d78aac2715bcf198f7c76b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-02T09:15:38Z","title_canon_sha256":"2e2b37d5f5f340e798c444f4ff8ff810319b68a56dad86d4c6f1a22b67b79469"},"schema_version":"1.0","source":{"id":"1207.0312","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0312","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0312v3","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0312","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"pith_short_12","alias_value":"Y2C6DFYBWQAX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y2C6DFYBWQAXRHSL","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y2C6DFYB","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:86235a48aeb41fbaaaa0f286d9a62b15292a4d566fe1eb3220fa0db8bb15289e","target":"graph","created_at":"2026-05-18T03:24:54Z","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":"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","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-07-02T09:15:38Z","title":"Long paths and cycles in random subgraphs of graphs with large minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0312","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:3bd8bb9f7dde8091d8ddc5bfc42e89ef476a028019548434343fd54ec0fb62c6","target":"record","created_at":"2026-05-18T03:24:54Z","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":"2a9444418efe1900b9aeb83249e822fe5a59af56a6d78aac2715bcf198f7c76b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-02T09:15:38Z","title_canon_sha256":"2e2b37d5f5f340e798c444f4ff8ff810319b68a56dad86d4c6f1a22b67b79469"},"schema_version":"1.0","source":{"id":"1207.0312","kind":"arxiv","version":3}},"canonical_sha256":"c685e19701b401789e4b0818d8d03df1415f0098f9cf7eae298469d894364b91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c685e19701b401789e4b0818d8d03df1415f0098f9cf7eae298469d894364b91","first_computed_at":"2026-05-18T03:24:54.246153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:24:54.246153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UuwEP0HtDNjJSB4wcCL7wyOUO0iASrYCdhmovkreTMXRe3oH0mYvFSH5Rr1fd0NKJiQwIqZNkNWHz7rrDebtDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:24:54.246833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0312","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bd8bb9f7dde8091d8ddc5bfc42e89ef476a028019548434343fd54ec0fb62c6","sha256:86235a48aeb41fbaaaa0f286d9a62b15292a4d566fe1eb3220fa0db8bb15289e"],"state_sha256":"39e691c0de3a45135e522221b8032bd804302357a8a197bb9bf19aea7ec79ca6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hKdmbLFoYSXvoHGyInLC2xq8IP3B0aqpsa4lGPE6OyEldks1OOfFlcH+5PzIQwRkVLl5CXPvg6Yn6jCrTYhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:09:55.622146Z","bundle_sha256":"5093c3f55f99f7705131f8453cc0ace036a40a56a0c9eed700d4294d5bb3b30c"}}