{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:T7UHAC4BOFKYLZUZTB4I6YFZAK","short_pith_number":"pith:T7UHAC4B","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"},"canonical_sha256":"9fe8700b81715585e69998788f60b902a24a2b61f8619e86b576ccfd1fc4604b","source":{"kind":"arxiv","id":"1007.0370","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0370","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0370v2","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0370","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"T7UHAC4BOFKY","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"T7UHAC4BOFKYLZUZ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"T7UHAC4B","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:T7UHAC4BOFKYLZUZTB4I6YFZAK","target":"record","payload":{"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"},"canonical_sha256":"9fe8700b81715585e69998788f60b902a24a2b61f8619e86b576ccfd1fc4604b","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"},"source_kind":"arxiv","source_id":"1007.0370","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-18T03:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/264BAB6308/H77rAzWFwQnGaFX40XLeLmGK4di5Vc5O0FHs6sjS6BnaeWGkrCVhLlHb1+MKTc4I6gmx3i2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:29:22.721849Z"},"content_sha256":"9eb57832806fb8c0d9d7746a4d7a9bf4e9d6cdcd17bca3bd6c10a38bac75c36b","schema_version":"1.0","event_id":"sha256:9eb57832806fb8c0d9d7746a4d7a9bf4e9d6cdcd17bca3bd6c10a38bac75c36b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:T7UHAC4BOFKYLZUZTB4I6YFZAK","target":"graph","payload":{"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"},"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-18T03:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xcXiGLfSJqzwppMRbrN4E/w8jjO/H3Fcq9xD3jGNXLmoBNQkQOEaGfNveHZP0J/Ih4+tCOnEttys3aimLkHECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:29:22.722587Z"},"content_sha256":"4771468df9d27f930250e4967600dab3e7ae2caa58ce9749ea59078f9a7e4155","schema_version":"1.0","event_id":"sha256:4771468df9d27f930250e4967600dab3e7ae2caa58ce9749ea59078f9a7e4155"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/bundle.json","state_url":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/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-07T16:29:22Z","links":{"resolver":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK","bundle":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/bundle.json","state":"https://pith.science/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7UHAC4BOFKYLZUZTB4I6YFZAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:T7UHAC4BOFKYLZUZTB4I6YFZAK","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":"93ee908db43e60143ec2a7d005b57c72b3584d898d70cfac1ed9986b324314ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-02T14:17:15Z","title_canon_sha256":"0fcfcf7588f371e8f2e92659e1400f489242f04607ac08019f60e0262bac8cf0"},"schema_version":"1.0","source":{"id":"1007.0370","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0370","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0370v2","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0370","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"T7UHAC4BOFKY","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"T7UHAC4BOFKYLZUZ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"T7UHAC4B","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:4771468df9d27f930250e4967600dab3e7ae2caa58ce9749ea59078f9a7e4155","target":"graph","created_at":"2026-05-18T03:52:28Z","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 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","authors_text":"Hui He (MAPMO), Jean-Francois Delmas (CERMICS), Romain Abraham (MAPMO)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-02T14:17:15Z","title":"Pruning Galton-Watson Trees and Tree-valued Markov Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0370","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:9eb57832806fb8c0d9d7746a4d7a9bf4e9d6cdcd17bca3bd6c10a38bac75c36b","target":"record","created_at":"2026-05-18T03:52:28Z","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":"93ee908db43e60143ec2a7d005b57c72b3584d898d70cfac1ed9986b324314ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-02T14:17:15Z","title_canon_sha256":"0fcfcf7588f371e8f2e92659e1400f489242f04607ac08019f60e0262bac8cf0"},"schema_version":"1.0","source":{"id":"1007.0370","kind":"arxiv","version":2}},"canonical_sha256":"9fe8700b81715585e69998788f60b902a24a2b61f8619e86b576ccfd1fc4604b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fe8700b81715585e69998788f60b902a24a2b61f8619e86b576ccfd1fc4604b","first_computed_at":"2026-05-18T03:52:28.602877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:28.602877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NmAVNbyo49PEkaLJiDqBdLv//uGVurHu8nm7y38x9WMd0ekJ68C5wnSoEOjQT6Jslpr/6nH0jjysODwHa+4GAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:28.603609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.0370","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9eb57832806fb8c0d9d7746a4d7a9bf4e9d6cdcd17bca3bd6c10a38bac75c36b","sha256:4771468df9d27f930250e4967600dab3e7ae2caa58ce9749ea59078f9a7e4155"],"state_sha256":"be257c5e9d4267143e856d9db25264268f1e7dbabab12741a97754345654af37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2oDhhvu6nEHajhY1i/BoFMYONSkdhdnHsR/q32N75bQOPLtlN4FAlnM8U1j8p1WwZJx5Vefn/3YtLHFbX8lvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:29:22.726423Z","bundle_sha256":"28f22b9ad4ed5eea3f775dc1c9f6450e40f1dfc308a737bf0d0f7a21fe85fee6"}}