{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RSVVARZLELAI2DOMGJDXOLHJSS","short_pith_number":"pith:RSVVARZL","schema_version":"1.0","canonical_sha256":"8cab50472b22c08d0dcc3247772ce9949b17f84ff0e4bef128f454c2cceb6b60","source":{"kind":"arxiv","id":"1703.03639","version":3},"attestation_state":"computed","paper":{"title":"Critical percolation on random regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Felix Joos, Guillem Perarnau","submitted_at":"2017-03-10T11:58:18Z","abstract_excerpt":"We show that for all $d\\in \\{3,\\ldots,n-1\\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\\Theta(n^{2/3})$, with high probability. This extends known results for fixed $d\\geq 3$ and for $d=n-1$, confirming a prediction of Nachmias and Peres on a question of Benjamini. As a corollary, for the largest component of the percolated random $d$-regular graph, we also determine the diameter and the mixing time of the lazy random walk. In contrast to previous approaches, our proof is based on a simple application of the"},"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":"1703.03639","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T11:58:18Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"5892e55bbba76ea2c55327983fa69691d9b255ca6bf74bcdc9361f1cf1c32c27","abstract_canon_sha256":"b8e63831ec7e90b786755f459655086f2caad059a2e960b7b9004405bc433fd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:42.223715Z","signature_b64":"hVc1Bl34UrWUHliWIHCXtsP9oNOcn9Ecv/X3LXzMj0VWVG9T3+7IEQlklMdMwxZOwe2SYN4mmyHy9/xVNJNRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cab50472b22c08d0dcc3247772ce9949b17f84ff0e4bef128f454c2cceb6b60","last_reissued_at":"2026-05-18T00:25:42.223077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:42.223077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Critical percolation on random regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Felix Joos, Guillem Perarnau","submitted_at":"2017-03-10T11:58:18Z","abstract_excerpt":"We show that for all $d\\in \\{3,\\ldots,n-1\\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\\Theta(n^{2/3})$, with high probability. This extends known results for fixed $d\\geq 3$ and for $d=n-1$, confirming a prediction of Nachmias and Peres on a question of Benjamini. As a corollary, for the largest component of the percolated random $d$-regular graph, we also determine the diameter and the mixing time of the lazy random walk. In contrast to previous approaches, our proof is based on a simple application of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03639","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":"1703.03639","created_at":"2026-05-18T00:25:42.223173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03639v3","created_at":"2026-05-18T00:25:42.223173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03639","created_at":"2026-05-18T00:25:42.223173+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSVVARZLELAI","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSVVARZLELAI2DOM","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSVVARZL","created_at":"2026-05-18T12:31:39.905425+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/RSVVARZLELAI2DOMGJDXOLHJSS","json":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS.json","graph_json":"https://pith.science/api/pith-number/RSVVARZLELAI2DOMGJDXOLHJSS/graph.json","events_json":"https://pith.science/api/pith-number/RSVVARZLELAI2DOMGJDXOLHJSS/events.json","paper":"https://pith.science/paper/RSVVARZL"},"agent_actions":{"view_html":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS","download_json":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS.json","view_paper":"https://pith.science/paper/RSVVARZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03639&json=true","fetch_graph":"https://pith.science/api/pith-number/RSVVARZLELAI2DOMGJDXOLHJSS/graph.json","fetch_events":"https://pith.science/api/pith-number/RSVVARZLELAI2DOMGJDXOLHJSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS/action/storage_attestation","attest_author":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS/action/author_attestation","sign_citation":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS/action/citation_signature","submit_replication":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS/action/replication_record"}},"created_at":"2026-05-18T00:25:42.223173+00:00","updated_at":"2026-05-18T00:25:42.223173+00:00"}