{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MJFOCVW5EOZLZR2FWRDCKRGXYC","short_pith_number":"pith:MJFOCVW5","schema_version":"1.0","canonical_sha256":"624ae156dd23b2bcc745b4462544d7c08e84c4555032f493233d84bf367a8f61","source":{"kind":"arxiv","id":"1201.6529","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.6529","created_at":"2026-05-18T03:45:00.737699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6529v4","created_at":"2026-05-18T03:45:00.737699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6529","created_at":"2026-05-18T03:45:00.737699+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJFOCVW5EOZL","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJFOCVW5EOZLZR2F","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJFOCVW5","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03045","citing_title":"TCD-Arena: Assessing Robustness of Time Series Causal Discovery Methods Against Assumption Violations","ref_index":252,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC","json":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC.json","graph_json":"https://pith.science/api/pith-number/MJFOCVW5EOZLZR2FWRDCKRGXYC/graph.json","events_json":"https://pith.science/api/pith-number/MJFOCVW5EOZLZR2FWRDCKRGXYC/events.json","paper":"https://pith.science/paper/MJFOCVW5"},"agent_actions":{"view_html":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC","download_json":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC.json","view_paper":"https://pith.science/paper/MJFOCVW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6529&json=true","fetch_graph":"https://pith.science/api/pith-number/MJFOCVW5EOZLZR2FWRDCKRGXYC/graph.json","fetch_events":"https://pith.science/api/pith-number/MJFOCVW5EOZLZR2FWRDCKRGXYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/action/storage_attestation","attest_author":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/action/author_attestation","sign_citation":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/action/citation_signature","submit_replication":"https://pith.science/pith/MJFOCVW5EOZLZR2FWRDCKRGXYC/action/replication_record"}},"created_at":"2026-05-18T03:45:00.737699+00:00","updated_at":"2026-05-18T03:45:00.737699+00:00"}