{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV","short_pith_number":"pith:QQ4Q4CG7","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"},"canonical_sha256":"84390e08dffa248ee2cf943cc5213ccd7bc19435083f10cfc1d65008f36d05b2","source":{"kind":"arxiv","id":"1611.02333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02333","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02333v1","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02333","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"QQ4Q4CG77ISI","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QQ4Q4CG77ISI5YWP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QQ4Q4CG7","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV","target":"record","payload":{"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"},"canonical_sha256":"84390e08dffa248ee2cf943cc5213ccd7bc19435083f10cfc1d65008f36d05b2","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"},"source_kind":"arxiv","source_id":"1611.02333","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vZgU0Ui6HZ0zbOI+1Wd+mJuWwcSo0HeWyZWcO3L9fBtwoduIlRAF/04uO+ThESOSnHw2zBYfsyqbMoXPNhPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:16:06.359591Z"},"content_sha256":"eeecafb15665e93c89b3c6d38663c08182da6ef37bb09eb4b05a16ff2f28b5d1","schema_version":"1.0","event_id":"sha256:eeecafb15665e93c89b3c6d38663c08182da6ef37bb09eb4b05a16ff2f28b5d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1iBt15QMTxM8ABLVcWGztGojnJofL8XUz8HXfUBuVNr8Hs978LANMyR9+j/mjr5isCHACPQgHPkYMyVmA9MBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:16:06.359923Z"},"content_sha256":"a23b39b97dbace8123d1730c5cd9fb53159fa9f2c0475d07fa8a948e157b5de1","schema_version":"1.0","event_id":"sha256:a23b39b97dbace8123d1730c5cd9fb53159fa9f2c0475d07fa8a948e157b5de1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/bundle.json","state_url":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T08:16:06Z","links":{"resolver":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV","bundle":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/bundle.json","state":"https://pith.science/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QQ4Q4CG77ISI5YWPSQ6MKIJ4ZV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c2b5b315ce91e5ab8db8120eafbd0275934b092a73765ada900c98d7b25b0864","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-07T22:51:26Z","title_canon_sha256":"124a213898736bbcb844409e34b4e3309776f1b335e53d88767493194d212223"},"schema_version":"1.0","source":{"id":"1611.02333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02333","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02333v1","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02333","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"QQ4Q4CG77ISI","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QQ4Q4CG77ISI5YWP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QQ4Q4CG7","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:a23b39b97dbace8123d1730c5cd9fb53159fa9f2c0475d07fa8a948e157b5de1","target":"graph","created_at":"2026-05-18T00:59:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Franz Rembart, Matthias Winkel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-07T22:51:26Z","title":"A binary embedding of the stable line-breaking construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02333","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eeecafb15665e93c89b3c6d38663c08182da6ef37bb09eb4b05a16ff2f28b5d1","target":"record","created_at":"2026-05-18T00:59:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c2b5b315ce91e5ab8db8120eafbd0275934b092a73765ada900c98d7b25b0864","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-07T22:51:26Z","title_canon_sha256":"124a213898736bbcb844409e34b4e3309776f1b335e53d88767493194d212223"},"schema_version":"1.0","source":{"id":"1611.02333","kind":"arxiv","version":1}},"canonical_sha256":"84390e08dffa248ee2cf943cc5213ccd7bc19435083f10cfc1d65008f36d05b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84390e08dffa248ee2cf943cc5213ccd7bc19435083f10cfc1d65008f36d05b2","first_computed_at":"2026-05-18T00:59:52.416007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:52.416007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C2n2PWJCe2FAFX0EPj2SELX95uAgNyJGdI0crb16HU9p8Omk9OmiEeYIRB3L1ECZkuJzm24zbZROUKiXk63vBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:52.416716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeecafb15665e93c89b3c6d38663c08182da6ef37bb09eb4b05a16ff2f28b5d1","sha256:a23b39b97dbace8123d1730c5cd9fb53159fa9f2c0475d07fa8a948e157b5de1"],"state_sha256":"8f7b10824dbd858287e58e3b9b1aed8c50e8d75ae0f08164e8f75bb52c882a93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YrcpnwVCgEgiOA/FVrOeojEWKUslnQ1rh4wdEF3EYBImKJ8AxcHYpzjmtDqdJjPOE3kUdtkowU8OJTZcNh6SBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:16:06.361879Z","bundle_sha256":"ebfceede562a7d57c0873e0f5016bc382b80ea7df4a67f5227b0a4af7074d432"}}