{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P3WZRASLL264F3RIT3RTWUQ2E2","short_pith_number":"pith:P3WZRASL","canonical_record":{"source":{"id":"1408.4332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-19T13:36:24Z","cross_cats_sorted":[],"title_canon_sha256":"6d0668e4da2060070b68281022efa04b647ab687ec6f89b8fd38bdb4f7eb68bd","abstract_canon_sha256":"0dba117f823529221e372ed213e476cb8f841298f219d8fa6add1c659d4e5db1"},"schema_version":"1.0"},"canonical_sha256":"7eed98824b5ebdc2ee289ee33b521a26a12efc808136ab89bc0bd537de3f4f99","source":{"kind":"arxiv","id":"1408.4332","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4332","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4332v1","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4332","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"P3WZRASLL264","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P3WZRASLL264F3RI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P3WZRASL","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P3WZRASLL264F3RIT3RTWUQ2E2","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-19T13:36:24Z","cross_cats_sorted":[],"title_canon_sha256":"6d0668e4da2060070b68281022efa04b647ab687ec6f89b8fd38bdb4f7eb68bd","abstract_canon_sha256":"0dba117f823529221e372ed213e476cb8f841298f219d8fa6add1c659d4e5db1"},"schema_version":"1.0"},"canonical_sha256":"7eed98824b5ebdc2ee289ee33b521a26a12efc808136ab89bc0bd537de3f4f99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:46.023098Z","signature_b64":"X59nyIDAHQNketPPmfwktDupyOxqee6J1qFay8ujr3UqxoiF3lEOw5AB1fLWQ5FX3A/nj7orDf0amrAXLVQwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7eed98824b5ebdc2ee289ee33b521a26a12efc808136ab89bc0bd537de3f4f99","last_reissued_at":"2026-05-18T01:04:46.022417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:46.022417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4332","source_version":1,"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-18T01:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/R7nhSmIW6HvBFJ16pI0dbx/45gUOR+LLPCkUF0a+fxQkZn7OMp1L5fyakBGQgoAkO9/Yd+o0XASfznGM8y8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:06:59.216779Z"},"content_sha256":"2601d511a79b76b47cf254652e4c11b42749a324fdc7eb73580b526dcb86f74b","schema_version":"1.0","event_id":"sha256:2601d511a79b76b47cf254652e4c11b42749a324fdc7eb73580b526dcb86f74b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P3WZRASLL264F3RIT3RTWUQ2E2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The threshold probability for long cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Humberto Naves, Roman Glebov","submitted_at":"2014-08-19T13:36:24Z","abstract_excerpt":"For a given graph $G$ of minimum degree at least $k$, let $G_p$ denote the random spanning subgraph of $G$ obtained by retaining each edge independently with probability $p=p(k)$. We prove that if $p \\ge \\frac{\\log k + \\log \\log k + \\omega_k(1)}{k}$, where $\\omega_k(1)$ is any function tending to infinity with $k$, then $G_p$ asymptotically almost surely contains a cycle of length at least $k+1$. When we take $G$ to be the complete graph on $k+1$ vertices, our theorem coincides with the classic result on the threshold probability for the existence of a Hamilton cycle in the binomial random gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4332","kind":"arxiv","version":1},"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-18T01:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qewQ6jreLXZoHHn2mayidQk0MMYDEZnyUFjHeWo81DzKfvrmqpviUE7OCjUjdu1CE/HnPGBfDYFl12Pw2OfxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:06:59.217417Z"},"content_sha256":"b565c7db5b27db652239e1f3d9a054c900ca29bad838f230c6126dcad91131de","schema_version":"1.0","event_id":"sha256:b565c7db5b27db652239e1f3d9a054c900ca29bad838f230c6126dcad91131de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3WZRASLL264F3RIT3RTWUQ2E2/bundle.json","state_url":"https://pith.science/pith/P3WZRASLL264F3RIT3RTWUQ2E2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3WZRASLL264F3RIT3RTWUQ2E2/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-30T00:06:59Z","links":{"resolver":"https://pith.science/pith/P3WZRASLL264F3RIT3RTWUQ2E2","bundle":"https://pith.science/pith/P3WZRASLL264F3RIT3RTWUQ2E2/bundle.json","state":"https://pith.science/pith/P3WZRASLL264F3RIT3RTWUQ2E2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3WZRASLL264F3RIT3RTWUQ2E2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P3WZRASLL264F3RIT3RTWUQ2E2","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":"0dba117f823529221e372ed213e476cb8f841298f219d8fa6add1c659d4e5db1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-19T13:36:24Z","title_canon_sha256":"6d0668e4da2060070b68281022efa04b647ab687ec6f89b8fd38bdb4f7eb68bd"},"schema_version":"1.0","source":{"id":"1408.4332","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4332","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4332v1","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4332","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"P3WZRASLL264","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P3WZRASLL264F3RI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P3WZRASL","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:b565c7db5b27db652239e1f3d9a054c900ca29bad838f230c6126dcad91131de","target":"graph","created_at":"2026-05-18T01:04:46Z","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 graph $G$ of minimum degree at least $k$, let $G_p$ denote the random spanning subgraph of $G$ obtained by retaining each edge independently with probability $p=p(k)$. We prove that if $p \\ge \\frac{\\log k + \\log \\log k + \\omega_k(1)}{k}$, where $\\omega_k(1)$ is any function tending to infinity with $k$, then $G_p$ asymptotically almost surely contains a cycle of length at least $k+1$. When we take $G$ to be the complete graph on $k+1$ vertices, our theorem coincides with the classic result on the threshold probability for the existence of a Hamilton cycle in the binomial random gra","authors_text":"Benny Sudakov, Humberto Naves, Roman Glebov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-19T13:36:24Z","title":"The threshold probability for long cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4332","kind":"arxiv","version":1},"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:2601d511a79b76b47cf254652e4c11b42749a324fdc7eb73580b526dcb86f74b","target":"record","created_at":"2026-05-18T01:04:46Z","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":"0dba117f823529221e372ed213e476cb8f841298f219d8fa6add1c659d4e5db1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-19T13:36:24Z","title_canon_sha256":"6d0668e4da2060070b68281022efa04b647ab687ec6f89b8fd38bdb4f7eb68bd"},"schema_version":"1.0","source":{"id":"1408.4332","kind":"arxiv","version":1}},"canonical_sha256":"7eed98824b5ebdc2ee289ee33b521a26a12efc808136ab89bc0bd537de3f4f99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7eed98824b5ebdc2ee289ee33b521a26a12efc808136ab89bc0bd537de3f4f99","first_computed_at":"2026-05-18T01:04:46.022417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:46.022417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X59nyIDAHQNketPPmfwktDupyOxqee6J1qFay8ujr3UqxoiF3lEOw5AB1fLWQ5FX3A/nj7orDf0amrAXLVQwDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:46.023098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4332","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2601d511a79b76b47cf254652e4c11b42749a324fdc7eb73580b526dcb86f74b","sha256:b565c7db5b27db652239e1f3d9a054c900ca29bad838f230c6126dcad91131de"],"state_sha256":"a1dd7ed73c3c21c85895759ed3ee9f7a86e5c8ee3c5e53860df1ee949c5b44b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/2I2CO6bJI0F6kLe+lx66DtRSIeqIio+Y+TelcHdRpoDlW3G3XpHstNegNQPGY6R/lTfb+O4U6xCbKDPs/WBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:06:59.220889Z","bundle_sha256":"aa4ef9a647cba903a1084f78f709f827af53bfe41cef0b3dacbd93106fe8e4f9"}}