{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MJFOCVW5EOZLZR2FWRDCKRGXYC","short_pith_number":"pith:MJFOCVW5","canonical_record":{"source":{"id":"1201.6529","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-31T12:55:53Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"35883a5a9556f7f981fa5978acf4ec9d6a33b611161408d7ccebf8e6694e48ab","abstract_canon_sha256":"2e801d8cf1f9a2007b1761fe90c98f524fe5809b2c53fa3a9c4ae8f094ee8992"},"schema_version":"1.0"},"canonical_sha256":"624ae156dd23b2bcc745b4462544d7c08e84c4555032f493233d84bf367a8f61","source":{"kind":"arxiv","id":"1201.6529","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6529","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6529v4","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6529","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"MJFOCVW5EOZL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MJFOCVW5EOZLZR2F","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MJFOCVW5","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MJFOCVW5EOZLZR2FWRDCKRGXYC","target":"record","payload":{"canonical_record":{"source":{"id":"1201.6529","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-31T12:55:53Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"35883a5a9556f7f981fa5978acf4ec9d6a33b611161408d7ccebf8e6694e48ab","abstract_canon_sha256":"2e801d8cf1f9a2007b1761fe90c98f524fe5809b2c53fa3a9c4ae8f094ee8992"},"schema_version":"1.0"},"canonical_sha256":"624ae156dd23b2bcc745b4462544d7c08e84c4555032f493233d84bf367a8f61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:00.738380Z","signature_b64":"Tg2p2GJVSAeS5dxz0H2jCxLZStdyK+6tjryY+P1FzMJMr2OwmWFQhIilswSTJzJmXgRGBRmAlBUktgoc0mWLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"624ae156dd23b2bcc745b4462544d7c08e84c4555032f493233d84bf367a8f61","last_reissued_at":"2026-05-18T03:45:00.737555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:00.737555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.6529","source_version":4,"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:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HeoHOQhnzq4qIWHlK0DsJC7L346psKkCefmpgY6XPVobapR6f96dNIke32xziH7909KC5QACM3wd6DNWLeAqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:00:14.237483Z"},"content_sha256":"e94e200743ce33814b70f8951ae3d794bcf7254b2724b235023a7f45b5d6b17e","schema_version":"1.0","event_id":"sha256:e94e200743ce33814b70f8951ae3d794bcf7254b2724b235023a7f45b5d6b17e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MJFOCVW5EOZLZR2FWRDCKRGXYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The phase transition in random graphs - a simple proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Michael Krivelevich","submitted_at":"2012-01-31T12:55:53Z","abstract_excerpt":"The classical result of Erdos and Renyi shows that the random graph G(n,p) experiences sharp phase transition around p=1/n - for any \\epsilon>0 and p=(1-\\epsilon)/n, all connected components of G(n,p) are typically of size O(log n), while for p=(1+\\epsilon)/n, with high probability there exists a connected component of size linear in n. We provide a very simple proof of this fundamental result; in fact, we prove that in the supercritical regime p=(1+\\epsilon)/n, the random graph G(n,p) contains typically a path of linear length. We also discuss applications of our technique to other random gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6529","kind":"arxiv","version":4},"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:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mN6nGCtpXEXYMi+w5SCdNDz6rYIrPZjW4c6dONCsgMnOin5U+JdvqSMFYlQh50S6De7pbjOWJgpiZ20x+rTTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:00:14.237876Z"},"content_sha256":"1016e8eb44897440838fd3114ede751d8ecb4553c016fb298153bbed50a75f93","schema_version":"1.0","event_id":"sha256:1016e8eb44897440838fd3114ede751d8ecb4553c016fb298153bbed50a75f93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/bundle.json","state_url":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/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-30T05:00:14Z","links":{"resolver":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC","bundle":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/bundle.json","state":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MJFOCVW5EOZLZR2FWRDCKRGXYC","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":"2e801d8cf1f9a2007b1761fe90c98f524fe5809b2c53fa3a9c4ae8f094ee8992","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-31T12:55:53Z","title_canon_sha256":"35883a5a9556f7f981fa5978acf4ec9d6a33b611161408d7ccebf8e6694e48ab"},"schema_version":"1.0","source":{"id":"1201.6529","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6529","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6529v4","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6529","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"MJFOCVW5EOZL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MJFOCVW5EOZLZR2F","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MJFOCVW5","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:1016e8eb44897440838fd3114ede751d8ecb4553c016fb298153bbed50a75f93","target":"graph","created_at":"2026-05-18T03:45:00Z","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":"The classical result of Erdos and Renyi shows that the random graph G(n,p) experiences sharp phase transition around p=1/n - for any \\epsilon>0 and p=(1-\\epsilon)/n, all connected components of G(n,p) are typically of size O(log n), while for p=(1+\\epsilon)/n, with high probability there exists a connected component of size linear in n. We provide a very simple proof of this fundamental result; in fact, we prove that in the supercritical regime p=(1+\\epsilon)/n, the random graph G(n,p) contains typically a path of linear length. We also discuss applications of our technique to other random gra","authors_text":"Benny Sudakov, Michael Krivelevich","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-31T12:55:53Z","title":"The phase transition in random graphs - a simple proof"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6529","kind":"arxiv","version":4},"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:e94e200743ce33814b70f8951ae3d794bcf7254b2724b235023a7f45b5d6b17e","target":"record","created_at":"2026-05-18T03:45:00Z","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":"2e801d8cf1f9a2007b1761fe90c98f524fe5809b2c53fa3a9c4ae8f094ee8992","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-31T12:55:53Z","title_canon_sha256":"35883a5a9556f7f981fa5978acf4ec9d6a33b611161408d7ccebf8e6694e48ab"},"schema_version":"1.0","source":{"id":"1201.6529","kind":"arxiv","version":4}},"canonical_sha256":"624ae156dd23b2bcc745b4462544d7c08e84c4555032f493233d84bf367a8f61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"624ae156dd23b2bcc745b4462544d7c08e84c4555032f493233d84bf367a8f61","first_computed_at":"2026-05-18T03:45:00.737555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:00.737555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tg2p2GJVSAeS5dxz0H2jCxLZStdyK+6tjryY+P1FzMJMr2OwmWFQhIilswSTJzJmXgRGBRmAlBUktgoc0mWLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:00.738380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6529","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e94e200743ce33814b70f8951ae3d794bcf7254b2724b235023a7f45b5d6b17e","sha256:1016e8eb44897440838fd3114ede751d8ecb4553c016fb298153bbed50a75f93"],"state_sha256":"d38b0b708c7468fb252290f97acfecce4b26293f5b630c7c442b8eeb08769fb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQEKix4wEzzdS1ustyQ6L9d02fWpvSIuHpQbZ7Zjxcd6AdUZA9dzDCB6llIWhpYAfM6o4Ph7XWY9LopC1LYtCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:00:14.240028Z","bundle_sha256":"e9006b0520df19b11f917812fdc9f651f7c5e7862fbd741d35214354c4f3582f"}}