{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NX6OCVZTL7E26V3SC7A636YTS3","short_pith_number":"pith:NX6OCVZT","schema_version":"1.0","canonical_sha256":"6dfce157335fc9af577217c1edfb1396e3ae411f5668ae72898c539fda778221","source":{"kind":"arxiv","id":"1704.02064","version":1},"attestation_state":"computed","paper":{"title":"Scaling limit of random forests with prescribed degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Tao Lei","submitted_at":"2017-04-07T01:24:53Z","abstract_excerpt":"In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the number of vertices tends to infinity in terms of Gromov-Hausdorff-Prokhorov topology. This work falls into the general framework of showing convergence of random combinatorial structures to certain Gromov-Hausdorff scaling limits, described in terms of the Brownian Continuum Random Tree, pioneered by the work of Aldous. In fact we identify the limiting rand"},"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":"1704.02064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-07T01:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"7196929e8cc3da3fa8def0297bf5ff920d101fa9aebdc06eabc711f0a84c200e","abstract_canon_sha256":"3754f1ab7831ea8bd5473ab7913ed3202d00347429fb6bd00cc51c7e778af58a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:50.908477Z","signature_b64":"Pkcw74jEyFeYFLlXrf2guVEoCzMiiG6EtABNTHVY5Km4EoDrULXyU5h9GP4OSfqB8Q2k0oAqxkK+FzIVfN08Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dfce157335fc9af577217c1edfb1396e3ae411f5668ae72898c539fda778221","last_reissued_at":"2026-05-18T00:46:50.907886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:50.907886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling limit of random forests with prescribed degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Tao Lei","submitted_at":"2017-04-07T01:24:53Z","abstract_excerpt":"In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the number of vertices tends to infinity in terms of Gromov-Hausdorff-Prokhorov topology. This work falls into the general framework of showing convergence of random combinatorial structures to certain Gromov-Hausdorff scaling limits, described in terms of the Brownian Continuum Random Tree, pioneered by the work of Aldous. In fact we identify the limiting rand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02064","kind":"arxiv","version":1},"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":"1704.02064","created_at":"2026-05-18T00:46:50.907969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02064v1","created_at":"2026-05-18T00:46:50.907969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02064","created_at":"2026-05-18T00:46:50.907969+00:00"},{"alias_kind":"pith_short_12","alias_value":"NX6OCVZTL7E2","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NX6OCVZTL7E26V3S","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NX6OCVZT","created_at":"2026-05-18T12:31:34.259226+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/NX6OCVZTL7E26V3SC7A636YTS3","json":"https://pith.science/pith/NX6OCVZTL7E26V3SC7A636YTS3.json","graph_json":"https://pith.science/api/pith-number/NX6OCVZTL7E26V3SC7A636YTS3/graph.json","events_json":"https://pith.science/api/pith-number/NX6OCVZTL7E26V3SC7A636YTS3/events.json","paper":"https://pith.science/paper/NX6OCVZT"},"agent_actions":{"view_html":"https://pith.science/pith/NX6OCVZTL7E26V3SC7A636YTS3","download_json":"https://pith.science/pith/NX6OCVZTL7E26V3SC7A636YTS3.json","view_paper":"https://pith.science/paper/NX6OCVZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02064&json=true","fetch_graph":"https://pith.science/api/pith-number/NX6OCVZTL7E26V3SC7A636YTS3/graph.json","fetch_events":"https://pith.science/api/pith-number/NX6OCVZTL7E26V3SC7A636YTS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NX6OCVZTL7E26V3SC7A636YTS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NX6OCVZTL7E26V3SC7A636YTS3/action/storage_attestation","attest_author":"https://pith.science/pith/NX6OCVZTL7E26V3SC7A636YTS3/action/author_attestation","sign_citation":"https://pith.science/pith/NX6OCVZTL7E26V3SC7A636YTS3/action/citation_signature","submit_replication":"https://pith.science/pith/NX6OCVZTL7E26V3SC7A636YTS3/action/replication_record"}},"created_at":"2026-05-18T00:46:50.907969+00:00","updated_at":"2026-05-18T00:46:50.907969+00:00"}