{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:T7UHAC4BOFKYLZUZTB4I6YFZAK","short_pith_number":"pith:T7UHAC4B","schema_version":"1.0","canonical_sha256":"9fe8700b81715585e69998788f60b902a24a2b61f8619e86b576ccfd1fc4604b","source":{"kind":"arxiv","id":"1007.0370","version":2},"attestation_state":"computed","paper":{"title":"Pruning Galton-Watson Trees and Tree-valued Markov Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Hui He (MAPMO), Jean-Francois Delmas (CERMICS), Romain Abraham (MAPMO)","submitted_at":"2010-07-02T14:17:15Z","abstract_excerpt":"We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\\{{\\cal G}(u)\\}$ by pruning Galton-Watson trees and an analogous process $\\{{\\cal G}^*(u)\\}$ by pruning a critical or subcritical Galton-Watson tree conditioned to be infinite. Under a mild condition on offspring distributions, we show that the process $\\{{\\cal G}(u)\\}$ run until its ascension time has a representation in terms of $\\{{\\cal G}^*(u)\\}$. A similar result was obtained by Aldous and Pitman (1998) in the special cas"},"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":"1007.0370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-02T14:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"0fcfcf7588f371e8f2e92659e1400f489242f04607ac08019f60e0262bac8cf0","abstract_canon_sha256":"93ee908db43e60143ec2a7d005b57c72b3584d898d70cfac1ed9986b324314ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:28.603609Z","signature_b64":"NmAVNbyo49PEkaLJiDqBdLv//uGVurHu8nm7y38x9WMd0ekJ68C5wnSoEOjQT6Jslpr/6nH0jjysODwHa+4GAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fe8700b81715585e69998788f60b902a24a2b61f8619e86b576ccfd1fc4604b","last_reissued_at":"2026-05-18T03:52:28.602877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:28.602877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pruning Galton-Watson Trees and Tree-valued Markov Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Hui He (MAPMO), Jean-Francois Delmas (CERMICS), Romain Abraham (MAPMO)","submitted_at":"2010-07-02T14:17:15Z","abstract_excerpt":"We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\\{{\\cal G}(u)\\}$ by pruning Galton-Watson trees and an analogous process $\\{{\\cal G}^*(u)\\}$ by pruning a critical or subcritical Galton-Watson tree conditioned to be infinite. Under a mild condition on offspring distributions, we show that the process $\\{{\\cal G}(u)\\}$ run until its ascension time has a representation in terms of $\\{{\\cal G}^*(u)\\}$. A similar result was obtained by Aldous and Pitman (1998) in the special cas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0370","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":"1007.0370","created_at":"2026-05-18T03:52:28.602986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.0370v2","created_at":"2026-05-18T03:52:28.602986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0370","created_at":"2026-05-18T03:52:28.602986+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7UHAC4BOFKY","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7UHAC4BOFKYLZUZ","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7UHAC4B","created_at":"2026-05-18T12:26:13.927090+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/T7UHAC4BOFKYLZUZTB4I6YFZAK","json":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK.json","graph_json":"https://pith.science/api/pith-number/T7UHAC4BOFKYLZUZTB4I6YFZAK/graph.json","events_json":"https://pith.science/api/pith-number/T7UHAC4BOFKYLZUZTB4I6YFZAK/events.json","paper":"https://pith.science/paper/T7UHAC4B"},"agent_actions":{"view_html":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK","download_json":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK.json","view_paper":"https://pith.science/paper/T7UHAC4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.0370&json=true","fetch_graph":"https://pith.science/api/pith-number/T7UHAC4BOFKYLZUZTB4I6YFZAK/graph.json","fetch_events":"https://pith.science/api/pith-number/T7UHAC4BOFKYLZUZTB4I6YFZAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/action/storage_attestation","attest_author":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/action/author_attestation","sign_citation":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/action/citation_signature","submit_replication":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/action/replication_record"}},"created_at":"2026-05-18T03:52:28.602986+00:00","updated_at":"2026-05-18T03:52:28.602986+00:00"}