{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RSVVARZLELAI2DOMGJDXOLHJSS","short_pith_number":"pith:RSVVARZL","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"},"canonical_sha256":"8cab50472b22c08d0dcc3247772ce9949b17f84ff0e4bef128f454c2cceb6b60","source":{"kind":"arxiv","id":"1703.03639","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03639","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03639v3","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03639","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"pith_short_12","alias_value":"RSVVARZLELAI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RSVVARZLELAI2DOM","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RSVVARZL","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RSVVARZLELAI2DOMGJDXOLHJSS","target":"record","payload":{"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"},"canonical_sha256":"8cab50472b22c08d0dcc3247772ce9949b17f84ff0e4bef128f454c2cceb6b60","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"},"source_kind":"arxiv","source_id":"1703.03639","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-18T00:25:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/PCvMTT7Uoc1e+mA8gXGO/Yu4ZsmCrGJzA2QQ7ZVdynTImYCXP8zt56qsRzNkZJi74QTFeCf4ZkAvtnwdSjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:08:29.240801Z"},"content_sha256":"8a3b2ca6ca76cf3ccf39bcaa053b6164b448ce48066b36a7d9bfad172b50a0cd","schema_version":"1.0","event_id":"sha256:8a3b2ca6ca76cf3ccf39bcaa053b6164b448ce48066b36a7d9bfad172b50a0cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RSVVARZLELAI2DOMGJDXOLHJSS","target":"graph","payload":{"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"},"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-18T00:25:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YuTXHBJA/PjE75j1yeURNPsgD7RRL5NtXthsuUwKqm/YGestRkQkHT01H0JOfZafDiIffiIhI904sgCwNZEkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:08:29.241151Z"},"content_sha256":"7899a77cb807ae7d04a7c175dbc2a2608b9a58423c382101f1dde4998ff45c79","schema_version":"1.0","event_id":"sha256:7899a77cb807ae7d04a7c175dbc2a2608b9a58423c382101f1dde4998ff45c79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS/bundle.json","state_url":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSVVARZLELAI2DOMGJDXOLHJSS/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-06-04T06:08:29Z","links":{"resolver":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS","bundle":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS/bundle.json","state":"https://pith.science/pith/RSVVARZLELAI2DOMGJDXOLHJSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSVVARZLELAI2DOMGJDXOLHJSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RSVVARZLELAI2DOMGJDXOLHJSS","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":"b8e63831ec7e90b786755f459655086f2caad059a2e960b7b9004405bc433fd7","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T11:58:18Z","title_canon_sha256":"5892e55bbba76ea2c55327983fa69691d9b255ca6bf74bcdc9361f1cf1c32c27"},"schema_version":"1.0","source":{"id":"1703.03639","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03639","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03639v3","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03639","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"pith_short_12","alias_value":"RSVVARZLELAI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RSVVARZLELAI2DOM","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RSVVARZL","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:7899a77cb807ae7d04a7c175dbc2a2608b9a58423c382101f1dde4998ff45c79","target":"graph","created_at":"2026-05-18T00:25:42Z","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":"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","authors_text":"Felix Joos, Guillem Perarnau","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T11:58:18Z","title":"Critical percolation on random regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03639","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:8a3b2ca6ca76cf3ccf39bcaa053b6164b448ce48066b36a7d9bfad172b50a0cd","target":"record","created_at":"2026-05-18T00:25:42Z","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":"b8e63831ec7e90b786755f459655086f2caad059a2e960b7b9004405bc433fd7","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T11:58:18Z","title_canon_sha256":"5892e55bbba76ea2c55327983fa69691d9b255ca6bf74bcdc9361f1cf1c32c27"},"schema_version":"1.0","source":{"id":"1703.03639","kind":"arxiv","version":3}},"canonical_sha256":"8cab50472b22c08d0dcc3247772ce9949b17f84ff0e4bef128f454c2cceb6b60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cab50472b22c08d0dcc3247772ce9949b17f84ff0e4bef128f454c2cceb6b60","first_computed_at":"2026-05-18T00:25:42.223077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:42.223077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hVc1Bl34UrWUHliWIHCXtsP9oNOcn9Ecv/X3LXzMj0VWVG9T3+7IEQlklMdMwxZOwe2SYN4mmyHy9/xVNJNRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:42.223715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.03639","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a3b2ca6ca76cf3ccf39bcaa053b6164b448ce48066b36a7d9bfad172b50a0cd","sha256:7899a77cb807ae7d04a7c175dbc2a2608b9a58423c382101f1dde4998ff45c79"],"state_sha256":"697d3d008c1ccb86cf153397fc927cb31963a6a5ac68c742defa8925620bb0c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GlWvPB326pWbLRtSGeKsdYEdFmhliZPeM8a7VvU+4CZ8H/5HnOYsjIFCOrGwiM0itSug0sTRH5fRjVwgdvrACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:08:29.243213Z","bundle_sha256":"913554d7969520e1698af3ca7a73555baf3b8ee2d02dd5c6ad524ee7b2cd2fc8"}}