{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RBDB67YKZ2HUTZU4XSPLCLH2NJ","short_pith_number":"pith:RBDB67YK","schema_version":"1.0","canonical_sha256":"88461f7f0ace8f49e69cbc9eb12cfa6a71753df0b0fd52b2b622be4b09c78735","source":{"kind":"arxiv","id":"1412.6333","version":4},"attestation_state":"computed","paper":{"title":"The continuum random tree is the scaling limit of unlabelled unrooted trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Benedikt Stufler","submitted_at":"2014-12-19T13:21:43Z","abstract_excerpt":"We prove that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov-Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This proves a conjecture by Aldous. Moreover, we establish Benjamini-Schramm convergence of this model of random trees."},"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":"1412.6333","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-19T13:21:43Z","cross_cats_sorted":[],"title_canon_sha256":"a74840ba013f3c4d2e664a03caba2c765a97dc54cb115de331951c163fd12fdc","abstract_canon_sha256":"b22834571447e176538270d540e39fed34f3c865200f13e947796faddb7e4c6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:04.477155Z","signature_b64":"ULtQ91UrkjR8enUIV8DN5e7jUUl7FYN8++sDyoiAala8NOKs++1xwKJ+km+gTztIpl2tXn+rqHUAcRzl1jPgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88461f7f0ace8f49e69cbc9eb12cfa6a71753df0b0fd52b2b622be4b09c78735","last_reissued_at":"2026-05-18T00:55:04.476652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:04.476652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The continuum random tree is the scaling limit of unlabelled unrooted trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Benedikt Stufler","submitted_at":"2014-12-19T13:21:43Z","abstract_excerpt":"We prove that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov-Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This proves a conjecture by Aldous. Moreover, we establish Benjamini-Schramm convergence of this model of random trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6333","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":"1412.6333","created_at":"2026-05-18T00:55:04.476736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6333v4","created_at":"2026-05-18T00:55:04.476736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6333","created_at":"2026-05-18T00:55:04.476736+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBDB67YKZ2HU","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBDB67YKZ2HUTZU4","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBDB67YK","created_at":"2026-05-18T12:28:46.137349+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/RBDB67YKZ2HUTZU4XSPLCLH2NJ","json":"https://pith.science/pith/RBDB67YKZ2HUTZU4XSPLCLH2NJ.json","graph_json":"https://pith.science/api/pith-number/RBDB67YKZ2HUTZU4XSPLCLH2NJ/graph.json","events_json":"https://pith.science/api/pith-number/RBDB67YKZ2HUTZU4XSPLCLH2NJ/events.json","paper":"https://pith.science/paper/RBDB67YK"},"agent_actions":{"view_html":"https://pith.science/pith/RBDB67YKZ2HUTZU4XSPLCLH2NJ","download_json":"https://pith.science/pith/RBDB67YKZ2HUTZU4XSPLCLH2NJ.json","view_paper":"https://pith.science/paper/RBDB67YK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6333&json=true","fetch_graph":"https://pith.science/api/pith-number/RBDB67YKZ2HUTZU4XSPLCLH2NJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RBDB67YKZ2HUTZU4XSPLCLH2NJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBDB67YKZ2HUTZU4XSPLCLH2NJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBDB67YKZ2HUTZU4XSPLCLH2NJ/action/storage_attestation","attest_author":"https://pith.science/pith/RBDB67YKZ2HUTZU4XSPLCLH2NJ/action/author_attestation","sign_citation":"https://pith.science/pith/RBDB67YKZ2HUTZU4XSPLCLH2NJ/action/citation_signature","submit_replication":"https://pith.science/pith/RBDB67YKZ2HUTZU4XSPLCLH2NJ/action/replication_record"}},"created_at":"2026-05-18T00:55:04.476736+00:00","updated_at":"2026-05-18T00:55:04.476736+00:00"}