{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AFO2I34TDVL5JKA3GJYD3JMARC","short_pith_number":"pith:AFO2I34T","schema_version":"1.0","canonical_sha256":"015da46f931d57d4a81b32703da58088b0c07b84e239963c5e54dd6a047295b5","source":{"kind":"arxiv","id":"1305.3534","version":2},"attestation_state":"computed","paper":{"title":"The CRT is the scaling limit of random dissections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"B\\'en\\'edicte Haas, Igor Kortchemski, Nicolas Curien","submitted_at":"2013-05-15T16:26:01Z","abstract_excerpt":"We study the graph structure of large random dissections of polygons sampled according to Boltzmann weights, which encompasses the case of uniform dissections or uniform $p$-angulations. As their number of vertices $n$ goes to infinity, we show that these random graphs, rescaled by $n^{-1/2}$, converge in the Gromov--Hausdorff sense towards a multiple of Aldous' Brownian tree when the weights decrease sufficiently fast. The scaling constant depends on the Boltzmann weights in a rather amusing and intriguing way, and is computed by making use of a Markov chain which compares the length of geode"},"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":"1305.3534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-05-15T16:26:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"83ed989e0086d6b24f5518e0d77562875146668f6443b5aff3ccc5d2b43bd423","abstract_canon_sha256":"a3aa796ea12687b7bf6e139badcf62f8a01f5ab35051cb46789bce6ee6aaaa21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:18.537139Z","signature_b64":"F1kYo0+nejy8Kixru9nD+awEx5BVLUG0AgbLGECYWP/5z4uIXyO01FQepNFU203yIo7iTJFAUcijcgkRhfhICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"015da46f931d57d4a81b32703da58088b0c07b84e239963c5e54dd6a047295b5","last_reissued_at":"2026-05-18T02:59:18.536593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:18.536593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The CRT is the scaling limit of random dissections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"B\\'en\\'edicte Haas, Igor Kortchemski, Nicolas Curien","submitted_at":"2013-05-15T16:26:01Z","abstract_excerpt":"We study the graph structure of large random dissections of polygons sampled according to Boltzmann weights, which encompasses the case of uniform dissections or uniform $p$-angulations. As their number of vertices $n$ goes to infinity, we show that these random graphs, rescaled by $n^{-1/2}$, converge in the Gromov--Hausdorff sense towards a multiple of Aldous' Brownian tree when the weights decrease sufficiently fast. The scaling constant depends on the Boltzmann weights in a rather amusing and intriguing way, and is computed by making use of a Markov chain which compares the length of geode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3534","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.3534","created_at":"2026-05-18T02:59:18.536670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3534v2","created_at":"2026-05-18T02:59:18.536670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3534","created_at":"2026-05-18T02:59:18.536670+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFO2I34TDVL5","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFO2I34TDVL5JKA3","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFO2I34T","created_at":"2026-05-18T12:27:38.830355+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/AFO2I34TDVL5JKA3GJYD3JMARC","json":"https://pith.science/pith/AFO2I34TDVL5JKA3GJYD3JMARC.json","graph_json":"https://pith.science/api/pith-number/AFO2I34TDVL5JKA3GJYD3JMARC/graph.json","events_json":"https://pith.science/api/pith-number/AFO2I34TDVL5JKA3GJYD3JMARC/events.json","paper":"https://pith.science/paper/AFO2I34T"},"agent_actions":{"view_html":"https://pith.science/pith/AFO2I34TDVL5JKA3GJYD3JMARC","download_json":"https://pith.science/pith/AFO2I34TDVL5JKA3GJYD3JMARC.json","view_paper":"https://pith.science/paper/AFO2I34T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3534&json=true","fetch_graph":"https://pith.science/api/pith-number/AFO2I34TDVL5JKA3GJYD3JMARC/graph.json","fetch_events":"https://pith.science/api/pith-number/AFO2I34TDVL5JKA3GJYD3JMARC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFO2I34TDVL5JKA3GJYD3JMARC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFO2I34TDVL5JKA3GJYD3JMARC/action/storage_attestation","attest_author":"https://pith.science/pith/AFO2I34TDVL5JKA3GJYD3JMARC/action/author_attestation","sign_citation":"https://pith.science/pith/AFO2I34TDVL5JKA3GJYD3JMARC/action/citation_signature","submit_replication":"https://pith.science/pith/AFO2I34TDVL5JKA3GJYD3JMARC/action/replication_record"}},"created_at":"2026-05-18T02:59:18.536670+00:00","updated_at":"2026-05-18T02:59:18.536670+00:00"}