{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV","short_pith_number":"pith:QQ4Q4CG7","schema_version":"1.0","canonical_sha256":"84390e08dffa248ee2cf943cc5213ccd7bc19435083f10cfc1d65008f36d05b2","source":{"kind":"arxiv","id":"1611.02333","version":1},"attestation_state":"computed","paper":{"title":"A binary embedding of the stable line-breaking construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Franz Rembart, Matthias Winkel","submitted_at":"2016-11-07T22:51:26Z","abstract_excerpt":"We embed Duquesne and Le Gall's stable tree into a binary compact continuum random tree (CRT) in a way that solves an open problem posed by Goldschmidt and Haas. This CRT can be obtained by applying a recursive construction method of compact CRTs as presented in earlier work to a specific distribution of a random string of beads, i.e. a random interval equipped with a random discrete measure. We also express this CRT as a tree built by replacing all branch points of a stable tree by rescaled i.i.d. copies of a Ford CRT. Some of these developments are carried out in a space of infinity-marked m"},"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":"1611.02333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-07T22:51:26Z","cross_cats_sorted":[],"title_canon_sha256":"124a213898736bbcb844409e34b4e3309776f1b335e53d88767493194d212223","abstract_canon_sha256":"c2b5b315ce91e5ab8db8120eafbd0275934b092a73765ada900c98d7b25b0864"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:52.416716Z","signature_b64":"C2n2PWJCe2FAFX0EPj2SELX95uAgNyJGdI0crb16HU9p8Omk9OmiEeYIRB3L1ECZkuJzm24zbZROUKiXk63vBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84390e08dffa248ee2cf943cc5213ccd7bc19435083f10cfc1d65008f36d05b2","last_reissued_at":"2026-05-18T00:59:52.416007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:52.416007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A binary embedding of the stable line-breaking construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Franz Rembart, Matthias Winkel","submitted_at":"2016-11-07T22:51:26Z","abstract_excerpt":"We embed Duquesne and Le Gall's stable tree into a binary compact continuum random tree (CRT) in a way that solves an open problem posed by Goldschmidt and Haas. This CRT can be obtained by applying a recursive construction method of compact CRTs as presented in earlier work to a specific distribution of a random string of beads, i.e. a random interval equipped with a random discrete measure. We also express this CRT as a tree built by replacing all branch points of a stable tree by rescaled i.i.d. copies of a Ford CRT. Some of these developments are carried out in a space of infinity-marked m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02333","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":"1611.02333","created_at":"2026-05-18T00:59:52.416109+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02333v1","created_at":"2026-05-18T00:59:52.416109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02333","created_at":"2026-05-18T00:59:52.416109+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQ4Q4CG77ISI","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQ4Q4CG77ISI5YWP","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQ4Q4CG7","created_at":"2026-05-18T12:30:41.710351+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/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV","json":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV.json","graph_json":"https://pith.science/api/pith-number/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/graph.json","events_json":"https://pith.science/api/pith-number/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/events.json","paper":"https://pith.science/paper/QQ4Q4CG7"},"agent_actions":{"view_html":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV","download_json":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV.json","view_paper":"https://pith.science/paper/QQ4Q4CG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02333&json=true","fetch_graph":"https://pith.science/api/pith-number/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/graph.json","fetch_events":"https://pith.science/api/pith-number/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/action/storage_attestation","attest_author":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/action/author_attestation","sign_citation":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/action/citation_signature","submit_replication":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/action/replication_record"}},"created_at":"2026-05-18T00:59:52.416109+00:00","updated_at":"2026-05-18T00:59:52.416109+00:00"}