{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Y2NG3ZKINW7FS4MVHGNB6DCNHE","short_pith_number":"pith:Y2NG3ZKI","schema_version":"1.0","canonical_sha256":"c69a6de5486dbe597195399a1f0c4d393fd89bb213396a3ea329f612a6e00a00","source":{"kind":"arxiv","id":"1107.2433","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.2433","created_at":"2026-05-18T04:09:46.816881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2433v2","created_at":"2026-05-18T04:09:46.816881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2433","created_at":"2026-05-18T04:09:46.816881+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2NG3ZKINW7F","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2NG3ZKINW7FS4MV","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2NG3ZKI","created_at":"2026-05-18T12:26:47.523578+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/Y2NG3ZKINW7FS4MVHGNB6DCNHE","json":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE.json","graph_json":"https://pith.science/api/pith-number/Y2NG3ZKINW7FS4MVHGNB6DCNHE/graph.json","events_json":"https://pith.science/api/pith-number/Y2NG3ZKINW7FS4MVHGNB6DCNHE/events.json","paper":"https://pith.science/paper/Y2NG3ZKI"},"agent_actions":{"view_html":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE","download_json":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE.json","view_paper":"https://pith.science/paper/Y2NG3ZKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2433&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2NG3ZKINW7FS4MVHGNB6DCNHE/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2NG3ZKINW7FS4MVHGNB6DCNHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/action/storage_attestation","attest_author":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/action/author_attestation","sign_citation":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/action/citation_signature","submit_replication":"https://pith.science/pith/Y2NG3ZKINW7FS4MVHGNB6DCNHE/action/replication_record"}},"created_at":"2026-05-18T04:09:46.816881+00:00","updated_at":"2026-05-18T04:09:46.816881+00:00"}