{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y2NG3ZKINW7FS4MVHGNB6DCNHE","short_pith_number":"pith:Y2NG3ZKI","canonical_record":{"source":{"id":"1107.2433","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-12T23:06:02Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"221d9731e732967f2664e27ac45320cdfee51218adec383a0b76d2e43d425342","abstract_canon_sha256":"007e3f289968ac1d03a775677ce76b99550eb13b3a88f51851153266f27ea25a"},"schema_version":"1.0"},"canonical_sha256":"c69a6de5486dbe597195399a1f0c4d393fd89bb213396a3ea329f612a6e00a00","source":{"kind":"arxiv","id":"1107.2433","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2433","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2433v2","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2433","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"Y2NG3ZKINW7F","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y2NG3ZKINW7FS4MV","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y2NG3ZKI","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y2NG3ZKINW7FS4MVHGNB6DCNHE","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2433","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-12T23:06:02Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"221d9731e732967f2664e27ac45320cdfee51218adec383a0b76d2e43d425342","abstract_canon_sha256":"007e3f289968ac1d03a775677ce76b99550eb13b3a88f51851153266f27ea25a"},"schema_version":"1.0"},"canonical_sha256":"c69a6de5486dbe597195399a1f0c4d393fd89bb213396a3ea329f612a6e00a00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:46.817294Z","signature_b64":"JfNb6Dm77yXMUBqEYYB1arNBkoGVtrK4H6XNfQK+tMfB2lvZj9U3pn6QEJf5M1whOCO5V9xqTbGsrcFgSS4LDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c69a6de5486dbe597195399a1f0c4d393fd89bb213396a3ea329f612a6e00a00","last_reissued_at":"2026-05-18T04:09:46.816802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:46.816802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2433","source_version":2,"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-18T04:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVupdMxKowCVeK3jshj1jgEBQ/RUBCDLxyYZ9+iz0AHqqHyVngunr03XErFREnAsPy+1L7jDvA4NbTC9tpWtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:14:58.794903Z"},"content_sha256":"7e9b6226419872961302ca0b664aad2332b49a5943b89e9d5170c070bc69ec4b","schema_version":"1.0","event_id":"sha256:7e9b6226419872961302ca0b664aad2332b49a5943b89e9d5170c070bc69ec4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y2NG3ZKINW7FS4MVHGNB6DCNHE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ancestral branching, cut-and-paste algorithms and associated tree and partition-valued processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Harry Crane","submitted_at":"2011-07-12T23:06:02Z","abstract_excerpt":"We introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated family of Markovian transition kernels whose finite-dimensional transition probabilities can be written in closed-form as the product over partition-valued Markov kernels. The associated tree-valued Markov process is infinitely exchangeable provided its associated partition-valued kernel is infinitely exchangeable. We also identify a transition procedure on part"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2433","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"},"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-18T04:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9kmi39+du8/bRZjarG6w5qvPUc/+0ZMFdI2njAA4XgCsayEMwcEeMb5Me8rcPY5FFNF95I0MreIcl2H1tzIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:14:58.795715Z"},"content_sha256":"a84eba6ec53cd1d62aabbeff69838187dc6ca640eff65fe009a6bf4e27207f41","schema_version":"1.0","event_id":"sha256:a84eba6ec53cd1d62aabbeff69838187dc6ca640eff65fe009a6bf4e27207f41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/bundle.json","state_url":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/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-05-24T00:14:58Z","links":{"resolver":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE","bundle":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/bundle.json","state":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y2NG3ZKINW7FS4MVHGNB6DCNHE","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":"007e3f289968ac1d03a775677ce76b99550eb13b3a88f51851153266f27ea25a","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-12T23:06:02Z","title_canon_sha256":"221d9731e732967f2664e27ac45320cdfee51218adec383a0b76d2e43d425342"},"schema_version":"1.0","source":{"id":"1107.2433","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2433","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2433v2","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2433","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"Y2NG3ZKINW7F","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y2NG3ZKINW7FS4MV","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y2NG3ZKI","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:a84eba6ec53cd1d62aabbeff69838187dc6ca640eff65fe009a6bf4e27207f41","target":"graph","created_at":"2026-05-18T04:09:46Z","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 introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated family of Markovian transition kernels whose finite-dimensional transition probabilities can be written in closed-form as the product over partition-valued Markov kernels. The associated tree-valued Markov process is infinitely exchangeable provided its associated partition-valued kernel is infinitely exchangeable. We also identify a transition procedure on part","authors_text":"Harry Crane","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-12T23:06:02Z","title":"Ancestral branching, cut-and-paste algorithms and associated tree and partition-valued processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2433","kind":"arxiv","version":2},"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:7e9b6226419872961302ca0b664aad2332b49a5943b89e9d5170c070bc69ec4b","target":"record","created_at":"2026-05-18T04:09:46Z","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":"007e3f289968ac1d03a775677ce76b99550eb13b3a88f51851153266f27ea25a","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-12T23:06:02Z","title_canon_sha256":"221d9731e732967f2664e27ac45320cdfee51218adec383a0b76d2e43d425342"},"schema_version":"1.0","source":{"id":"1107.2433","kind":"arxiv","version":2}},"canonical_sha256":"c69a6de5486dbe597195399a1f0c4d393fd89bb213396a3ea329f612a6e00a00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c69a6de5486dbe597195399a1f0c4d393fd89bb213396a3ea329f612a6e00a00","first_computed_at":"2026-05-18T04:09:46.816802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:46.816802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JfNb6Dm77yXMUBqEYYB1arNBkoGVtrK4H6XNfQK+tMfB2lvZj9U3pn6QEJf5M1whOCO5V9xqTbGsrcFgSS4LDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:46.817294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2433","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e9b6226419872961302ca0b664aad2332b49a5943b89e9d5170c070bc69ec4b","sha256:a84eba6ec53cd1d62aabbeff69838187dc6ca640eff65fe009a6bf4e27207f41"],"state_sha256":"ed87b86cf7649c709f2666fa7bd639a573fae1f13329a5d1964c856a109924f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZT3uiUnJmZKabISLSbLgd85VlYl5iMWEcH3g1MHQVrKYW1gu49umH8FFV8j6l1G6pGXMuRwy2al/w3hR4LTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:14:58.799914Z","bundle_sha256":"00e5b1e831455443965e53b73c5b31507b7fd4c48d09263208293c55a21277fe"}}