{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FPLLCMKSA4DNVRCYDLINSFT4MB","short_pith_number":"pith:FPLLCMKS","canonical_record":{"source":{"id":"1403.0397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-03-03T11:27:06Z","cross_cats_sorted":[],"title_canon_sha256":"179b45a9a765ad240225b4c167848f869612917c3809ef54c30a33e44a56a2a7","abstract_canon_sha256":"dd64a5b264f41a998d85f1625704124c29964801e03ef0324a185a1f1bf943e0"},"schema_version":"1.0"},"canonical_sha256":"2bd6b131520706dac4581ad0d9167c604b8392e7f5df510d95fc36c300c68e4d","source":{"kind":"arxiv","id":"1403.0397","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0397","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0397v2","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0397","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"FPLLCMKSA4DN","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FPLLCMKSA4DNVRCY","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FPLLCMKS","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FPLLCMKSA4DNVRCYDLINSFT4MB","target":"record","payload":{"canonical_record":{"source":{"id":"1403.0397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-03-03T11:27:06Z","cross_cats_sorted":[],"title_canon_sha256":"179b45a9a765ad240225b4c167848f869612917c3809ef54c30a33e44a56a2a7","abstract_canon_sha256":"dd64a5b264f41a998d85f1625704124c29964801e03ef0324a185a1f1bf943e0"},"schema_version":"1.0"},"canonical_sha256":"2bd6b131520706dac4581ad0d9167c604b8392e7f5df510d95fc36c300c68e4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:17.061488Z","signature_b64":"G80t7WnBaADlZF1Zs5dy101thqmX7FGZ2821FYduVu4Lc/0HSQX2RgPu9xhbf7MygM05BtpjNGRbECbJRUV1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bd6b131520706dac4581ad0d9167c604b8392e7f5df510d95fc36c300c68e4d","last_reissued_at":"2026-05-18T00:46:17.061037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:17.061037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.0397","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-18T00:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYb1Qtr/TESDk5U5EqnEDCVPGgl1GLRiXrPbNqxWNlEfMT8NO+4erGMpZfOL0u0AzkDUgb7t2IynsY2OyMn7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:28:45.723263Z"},"content_sha256":"7c283049a68653cde754f227239adcead55d142086e89c11c12d049ee70d2aff","schema_version":"1.0","event_id":"sha256:7c283049a68653cde754f227239adcead55d142086e89c11c12d049ee70d2aff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FPLLCMKSA4DNVRCYDLINSFT4MB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tree-valued Markov processes associated with an admissible family of branching mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Hongwei Bi, Hui He","submitted_at":"2014-03-03T11:27:06Z","abstract_excerpt":"By studying an admissible family of branching mechanisms introduced in Li (2014), we obtain a pruning procedure on L\\'evy trees. Then we could construct a decreasing L\\'evy-CRT-valued process $\\{{\\mathcal T}_t\\}$ by pruning L\\'evy trees and an analogous process $\\{{\\mathcal T}^*_t\\}$ by pruning a critical L\\'evy tree conditioned to be infinite. Under a regular condition on the admissible family of branching mechanisms, we show that the law of $\\{{\\mathcal T}_t\\}$ at the ascension time can be represented by $\\{{\\mathcal T}^*_t\\}$. The results generalize those studied in Abraham and Delmas (2012"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0397","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-18T00:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdXjU45LW+dJeO3i4K7puzKrRt/0N/OxBMNlJHS60Bhvkxz7WyaQHkNFU/N/0UK5Afj77C/TvmG/77E9GNzBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:28:45.723756Z"},"content_sha256":"ce14ebe69a95b1b6b155a2727289850c994db33d1448214a444dc62078c023d1","schema_version":"1.0","event_id":"sha256:ce14ebe69a95b1b6b155a2727289850c994db33d1448214a444dc62078c023d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPLLCMKSA4DNVRCYDLINSFT4MB/bundle.json","state_url":"https://pith.science/pith/FPLLCMKSA4DNVRCYDLINSFT4MB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPLLCMKSA4DNVRCYDLINSFT4MB/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-24T23:28:45Z","links":{"resolver":"https://pith.science/pith/FPLLCMKSA4DNVRCYDLINSFT4MB","bundle":"https://pith.science/pith/FPLLCMKSA4DNVRCYDLINSFT4MB/bundle.json","state":"https://pith.science/pith/FPLLCMKSA4DNVRCYDLINSFT4MB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPLLCMKSA4DNVRCYDLINSFT4MB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FPLLCMKSA4DNVRCYDLINSFT4MB","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":"dd64a5b264f41a998d85f1625704124c29964801e03ef0324a185a1f1bf943e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-03-03T11:27:06Z","title_canon_sha256":"179b45a9a765ad240225b4c167848f869612917c3809ef54c30a33e44a56a2a7"},"schema_version":"1.0","source":{"id":"1403.0397","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0397","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0397v2","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0397","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"FPLLCMKSA4DN","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FPLLCMKSA4DNVRCY","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FPLLCMKS","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:ce14ebe69a95b1b6b155a2727289850c994db33d1448214a444dc62078c023d1","target":"graph","created_at":"2026-05-18T00:46:17Z","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":"By studying an admissible family of branching mechanisms introduced in Li (2014), we obtain a pruning procedure on L\\'evy trees. Then we could construct a decreasing L\\'evy-CRT-valued process $\\{{\\mathcal T}_t\\}$ by pruning L\\'evy trees and an analogous process $\\{{\\mathcal T}^*_t\\}$ by pruning a critical L\\'evy tree conditioned to be infinite. Under a regular condition on the admissible family of branching mechanisms, we show that the law of $\\{{\\mathcal T}_t\\}$ at the ascension time can be represented by $\\{{\\mathcal T}^*_t\\}$. The results generalize those studied in Abraham and Delmas (2012","authors_text":"Hongwei Bi, Hui He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-03-03T11:27:06Z","title":"A tree-valued Markov processes associated with an admissible family of branching mechanisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0397","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:7c283049a68653cde754f227239adcead55d142086e89c11c12d049ee70d2aff","target":"record","created_at":"2026-05-18T00:46:17Z","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":"dd64a5b264f41a998d85f1625704124c29964801e03ef0324a185a1f1bf943e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-03-03T11:27:06Z","title_canon_sha256":"179b45a9a765ad240225b4c167848f869612917c3809ef54c30a33e44a56a2a7"},"schema_version":"1.0","source":{"id":"1403.0397","kind":"arxiv","version":2}},"canonical_sha256":"2bd6b131520706dac4581ad0d9167c604b8392e7f5df510d95fc36c300c68e4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bd6b131520706dac4581ad0d9167c604b8392e7f5df510d95fc36c300c68e4d","first_computed_at":"2026-05-18T00:46:17.061037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:17.061037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G80t7WnBaADlZF1Zs5dy101thqmX7FGZ2821FYduVu4Lc/0HSQX2RgPu9xhbf7MygM05BtpjNGRbECbJRUV1Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:17.061488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0397","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c283049a68653cde754f227239adcead55d142086e89c11c12d049ee70d2aff","sha256:ce14ebe69a95b1b6b155a2727289850c994db33d1448214a444dc62078c023d1"],"state_sha256":"2f1bb4fae23e38b3fbf6a945df2a1e2ac552aeae0caa1cbf0764d0ee01c7556f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8jfrqDTz6jyYLzw19wOnlKuxfWEOHxNcEOQH0hsI3KBrhVR59COuTaosm7jhIKBmFaQrQxuH7KwbdkjTHJRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:28:45.726353Z","bundle_sha256":"077fd6d380bd5dbc7c9e4cd4e2c09e680fbf7528ad19d79b7100d0e7596848e2"}}