{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MI32TG4P2IXZHSOULTK75LF73R","short_pith_number":"pith:MI32TG4P","schema_version":"1.0","canonical_sha256":"6237a99b8fd22f93c9d45cd5feacbfdc7c0e97a5ca94dd629f86b8b920eba2a1","source":{"kind":"arxiv","id":"1211.1343","version":4},"attestation_state":"computed","paper":{"title":"The dual tree of a recursive triangulation of the disk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Henning Sulzbach, Nicolas Broutin","submitted_at":"2012-11-06T18:31:12Z","abstract_excerpt":"In the recursive lamination of the disk, one tries to add chords one after another at random; a chord is kept and inserted if it does not intersect any of the previously inserted ones. Curien and Le Gall [Ann. Probab. 39 (2011) 2224-2270] have proved that the set of chords converges to a limit triangulation of the disk encoded by a continuous process $\\mathscr{M}$. Based on a new approach resembling ideas from the so-called contraction method in function spaces, we prove that, when properly rescaled, the planar dual of the discrete lamination converges almost surely in the Gromov-Hausdorff sen"},"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":"1211.1343","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-06T18:31:12Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"69ca7f0e34a076c509c5bc1fd5a1ac21612e359b800587a4abc7856456125cc6","abstract_canon_sha256":"b2ea4dbb1e410e37607f5fe4500359ace0ca0bd2b4c111f7cfc6637f9bcd3a30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:30.249346Z","signature_b64":"b+M2aooRjuM4EASnyWjqzlnD/jLR3jel8cbVw0FMp3omWgnRVTBfPNCbX5vhMTd5ZPZAOEpawyC0Ymyfg15ZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6237a99b8fd22f93c9d45cd5feacbfdc7c0e97a5ca94dd629f86b8b920eba2a1","last_reissued_at":"2026-05-18T02:22:30.248901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:30.248901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The dual tree of a recursive triangulation of the disk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Henning Sulzbach, Nicolas Broutin","submitted_at":"2012-11-06T18:31:12Z","abstract_excerpt":"In the recursive lamination of the disk, one tries to add chords one after another at random; a chord is kept and inserted if it does not intersect any of the previously inserted ones. Curien and Le Gall [Ann. Probab. 39 (2011) 2224-2270] have proved that the set of chords converges to a limit triangulation of the disk encoded by a continuous process $\\mathscr{M}$. Based on a new approach resembling ideas from the so-called contraction method in function spaces, we prove that, when properly rescaled, the planar dual of the discrete lamination converges almost surely in the Gromov-Hausdorff sen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1343","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":"1211.1343","created_at":"2026-05-18T02:22:30.248960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1343v4","created_at":"2026-05-18T02:22:30.248960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1343","created_at":"2026-05-18T02:22:30.248960+00:00"},{"alias_kind":"pith_short_12","alias_value":"MI32TG4P2IXZ","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MI32TG4P2IXZHSOU","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MI32TG4P","created_at":"2026-05-18T12:27:14.488303+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/MI32TG4P2IXZHSOULTK75LF73R","json":"https://pith.science/pith/MI32TG4P2IXZHSOULTK75LF73R.json","graph_json":"https://pith.science/api/pith-number/MI32TG4P2IXZHSOULTK75LF73R/graph.json","events_json":"https://pith.science/api/pith-number/MI32TG4P2IXZHSOULTK75LF73R/events.json","paper":"https://pith.science/paper/MI32TG4P"},"agent_actions":{"view_html":"https://pith.science/pith/MI32TG4P2IXZHSOULTK75LF73R","download_json":"https://pith.science/pith/MI32TG4P2IXZHSOULTK75LF73R.json","view_paper":"https://pith.science/paper/MI32TG4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1343&json=true","fetch_graph":"https://pith.science/api/pith-number/MI32TG4P2IXZHSOULTK75LF73R/graph.json","fetch_events":"https://pith.science/api/pith-number/MI32TG4P2IXZHSOULTK75LF73R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MI32TG4P2IXZHSOULTK75LF73R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MI32TG4P2IXZHSOULTK75LF73R/action/storage_attestation","attest_author":"https://pith.science/pith/MI32TG4P2IXZHSOULTK75LF73R/action/author_attestation","sign_citation":"https://pith.science/pith/MI32TG4P2IXZHSOULTK75LF73R/action/citation_signature","submit_replication":"https://pith.science/pith/MI32TG4P2IXZHSOULTK75LF73R/action/replication_record"}},"created_at":"2026-05-18T02:22:30.248960+00:00","updated_at":"2026-05-18T02:22:30.248960+00:00"}