{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SGKZB6B7HBG7DKRGYSQB7EHTNY","short_pith_number":"pith:SGKZB6B7","canonical_record":{"source":{"id":"1709.07514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-09-21T20:59:57Z","cross_cats_sorted":[],"title_canon_sha256":"8e3cbdccd4570f69809df5cf38359f545024d5aeeb5e1ba1904205ea984e4ddd","abstract_canon_sha256":"24e538891f823c53bb4be474d6b02d106a6d4a12e436b642dc7bf334eabfc0e1"},"schema_version":"1.0"},"canonical_sha256":"919590f83f384df1aa26c4a01f90f36e333ab6356cb6b8a208e5bce17c3cb1ab","source":{"kind":"arxiv","id":"1709.07514","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07514","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07514v2","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07514","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"SGKZB6B7HBG7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SGKZB6B7HBG7DKRG","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SGKZB6B7","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SGKZB6B7HBG7DKRGYSQB7EHTNY","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-09-21T20:59:57Z","cross_cats_sorted":[],"title_canon_sha256":"8e3cbdccd4570f69809df5cf38359f545024d5aeeb5e1ba1904205ea984e4ddd","abstract_canon_sha256":"24e538891f823c53bb4be474d6b02d106a6d4a12e436b642dc7bf334eabfc0e1"},"schema_version":"1.0"},"canonical_sha256":"919590f83f384df1aa26c4a01f90f36e333ab6356cb6b8a208e5bce17c3cb1ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:50.477372Z","signature_b64":"Ekh7iIF6lyP0F6LdRjQRZjShFhT7v4Tpq6HiC0myx78yHw/pCZ2co9z+xl3tPzS38gVJG689r3fIg8hARBBzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"919590f83f384df1aa26c4a01f90f36e333ab6356cb6b8a208e5bce17c3cb1ab","last_reissued_at":"2026-05-18T00:11:50.476714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:50.476714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07514","source_version":2,"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:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkT+eVhjhsN6gvY2HL3BZRKCN4vZdCwLVWybArq/AkA1BCymxJO2jkFYKln6GlI2dalY6ySO/56kqXcbi8VnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:59:28.632107Z"},"content_sha256":"61feaa14d5322bccb0627dbb12c5fb771585ed7132de7784e44ef78c2f71a1ce","schema_version":"1.0","event_id":"sha256:61feaa14d5322bccb0627dbb12c5fb771585ed7132de7784e44ef78c2f71a1ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SGKZB6B7HBG7DKRGYSQB7EHTNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Critical random forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dominic Yeo, James Martin","submitted_at":"2017-09-21T20:59:57Z","abstract_excerpt":"Let $F(N,m)$ denote a random forest on a set of $N$ vertices, chosen uniformly from all forests with $m$ edges. Let $F(N,p)$ denote the forest obtained by conditioning the Erdos-Renyi graph $G(N,p)$ to be acyclic. We describe scaling limits for the largest components of $F(N,p)$ and $F(N,m)$, in the critical window $p=N^{-1}+O(N^{-4/3})$ or $m=N/2+O(N^{2/3})$. Aldous described a scaling limit for the largest components of $G(N,p)$ within the critical window in terms of the excursion lengths of a reflected Brownian motion with time-dependent drift. Our scaling limit for critical random forests "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07514","kind":"arxiv","version":2},"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:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXy3EX+6AvLci+NLoSYsD4PsL+zR40hI8Mk3VLNWl1w4zTL4T1iCPlD1J+mQgdZAkwl6oFj2MhbHU8kfbyrtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:59:28.632848Z"},"content_sha256":"fa471fc083605d1f3e453a0ccb587a6963116e21e6e85f8ab8abad638d64d75e","schema_version":"1.0","event_id":"sha256:fa471fc083605d1f3e453a0ccb587a6963116e21e6e85f8ab8abad638d64d75e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGKZB6B7HBG7DKRGYSQB7EHTNY/bundle.json","state_url":"https://pith.science/pith/SGKZB6B7HBG7DKRGYSQB7EHTNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGKZB6B7HBG7DKRGYSQB7EHTNY/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-31T02:59:28Z","links":{"resolver":"https://pith.science/pith/SGKZB6B7HBG7DKRGYSQB7EHTNY","bundle":"https://pith.science/pith/SGKZB6B7HBG7DKRGYSQB7EHTNY/bundle.json","state":"https://pith.science/pith/SGKZB6B7HBG7DKRGYSQB7EHTNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGKZB6B7HBG7DKRGYSQB7EHTNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SGKZB6B7HBG7DKRGYSQB7EHTNY","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":"24e538891f823c53bb4be474d6b02d106a6d4a12e436b642dc7bf334eabfc0e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-09-21T20:59:57Z","title_canon_sha256":"8e3cbdccd4570f69809df5cf38359f545024d5aeeb5e1ba1904205ea984e4ddd"},"schema_version":"1.0","source":{"id":"1709.07514","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07514","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07514v2","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07514","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"SGKZB6B7HBG7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SGKZB6B7HBG7DKRG","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SGKZB6B7","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:fa471fc083605d1f3e453a0ccb587a6963116e21e6e85f8ab8abad638d64d75e","target":"graph","created_at":"2026-05-18T00:11:50Z","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":"Let $F(N,m)$ denote a random forest on a set of $N$ vertices, chosen uniformly from all forests with $m$ edges. Let $F(N,p)$ denote the forest obtained by conditioning the Erdos-Renyi graph $G(N,p)$ to be acyclic. We describe scaling limits for the largest components of $F(N,p)$ and $F(N,m)$, in the critical window $p=N^{-1}+O(N^{-4/3})$ or $m=N/2+O(N^{2/3})$. Aldous described a scaling limit for the largest components of $G(N,p)$ within the critical window in terms of the excursion lengths of a reflected Brownian motion with time-dependent drift. Our scaling limit for critical random forests ","authors_text":"Dominic Yeo, James Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-09-21T20:59:57Z","title":"Critical random forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07514","kind":"arxiv","version":2},"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:61feaa14d5322bccb0627dbb12c5fb771585ed7132de7784e44ef78c2f71a1ce","target":"record","created_at":"2026-05-18T00:11:50Z","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":"24e538891f823c53bb4be474d6b02d106a6d4a12e436b642dc7bf334eabfc0e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-09-21T20:59:57Z","title_canon_sha256":"8e3cbdccd4570f69809df5cf38359f545024d5aeeb5e1ba1904205ea984e4ddd"},"schema_version":"1.0","source":{"id":"1709.07514","kind":"arxiv","version":2}},"canonical_sha256":"919590f83f384df1aa26c4a01f90f36e333ab6356cb6b8a208e5bce17c3cb1ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"919590f83f384df1aa26c4a01f90f36e333ab6356cb6b8a208e5bce17c3cb1ab","first_computed_at":"2026-05-18T00:11:50.476714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:50.476714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ekh7iIF6lyP0F6LdRjQRZjShFhT7v4Tpq6HiC0myx78yHw/pCZ2co9z+xl3tPzS38gVJG689r3fIg8hARBBzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:50.477372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07514","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61feaa14d5322bccb0627dbb12c5fb771585ed7132de7784e44ef78c2f71a1ce","sha256:fa471fc083605d1f3e453a0ccb587a6963116e21e6e85f8ab8abad638d64d75e"],"state_sha256":"7c9fb9fb5ef09b6feccf8298a78a7060f46ee16d303c1af14ce6799bba309770"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcgLgd/QYtHoZCbyNsNHOhTP+2f40bG1rTwbdZDj397mx0e9NpCPx7+5pkG9xMJpDfbTLdeRh95ibUWd1PgiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:59:28.636515Z","bundle_sha256":"9eeec8336670041d686896611ebe625f952953292c8dabfbb2528cce9f90695e"}}