{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AH654KD7BIDVN4MUXFVC4IGQKO","short_pith_number":"pith:AH654KD7","canonical_record":{"source":{"id":"1312.5525","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-19T13:01:35Z","cross_cats_sorted":[],"title_canon_sha256":"c91d26c91dbfd7987814ea06e987c36bd830bb9ed85a2b798b8497b2357bf81b","abstract_canon_sha256":"9500b714135193c8e20d8007a7a685eb6106b65f28491ff85f535f05d39e9e13"},"schema_version":"1.0"},"canonical_sha256":"01fdde287f0a0756f194b96a2e20d053aba5bad657a5f04b7201ec2881d3606d","source":{"kind":"arxiv","id":"1312.5525","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5525","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5525v2","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5525","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"AH654KD7BIDV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AH654KD7BIDVN4MU","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AH654KD7","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AH654KD7BIDVN4MUXFVC4IGQKO","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5525","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-19T13:01:35Z","cross_cats_sorted":[],"title_canon_sha256":"c91d26c91dbfd7987814ea06e987c36bd830bb9ed85a2b798b8497b2357bf81b","abstract_canon_sha256":"9500b714135193c8e20d8007a7a685eb6106b65f28491ff85f535f05d39e9e13"},"schema_version":"1.0"},"canonical_sha256":"01fdde287f0a0756f194b96a2e20d053aba5bad657a5f04b7201ec2881d3606d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:32.396059Z","signature_b64":"s9ZSUX5CRl+nFgv2BpT30785Nkkcv110x70idH0TpyDh/1H0MOhbUH6Ke51c5Xhp84xYCGB+AB/HrhBUcb7VDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01fdde287f0a0756f194b96a2e20d053aba5bad657a5f04b7201ec2881d3606d","last_reissued_at":"2026-05-18T01:09:32.395416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:32.395416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5525","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-18T01:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ogopzagv7oQX9jSqeYjz3Dtrx7sPKTyJGwZRUwWKUgzvOm6bZUsVACNOvKiN4g7vgeW9vbYdItlbvECWOMqLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:12:11.500495Z"},"content_sha256":"6df97c114ad31c5214aaa5311257123c2d4d48da466b0198d2845c58762c3509","schema_version":"1.0","event_id":"sha256:6df97c114ad31c5214aaa5311257123c2d4d48da466b0198d2845c58762c3509"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AH654KD7BIDVN4MUXFVC4IGQKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The vertex-cut-tree of Galton-Watson trees converging to a stable tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Daphn\\'e Dieuleveut","submitted_at":"2013-12-19T13:01:35Z","abstract_excerpt":"We consider a fragmentation of discrete trees where the internal vertices are deleted independently at a rate proportional to their degree. Informally, the associated cut-tree represents the genealogy of the nested connected components created by this process. We essentially work in the setting of Galton-Watson trees with offspring distribution belonging to the domain of attraction of a stable law of index $\\alpha\\in(1,2)$. Our main result is that, for a sequence of such trees $\\mathcal{T}_n$ conditioned to have size $n$, the corresponding rescaled cut-trees converge in distribution to the sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5525","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-18T01:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jr0ebXYlOXiZ13n8B1GdxDnM+NeVDa6WRz3x4p+3vuvhteaoqkmNlLf2BouFdS61uQLfeGa5Z4rrPQ6BtVIDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:12:11.501163Z"},"content_sha256":"c6160e1fdbaec1d55d32944da77474e5b727f284639b96bda535114cbf9b4806","schema_version":"1.0","event_id":"sha256:c6160e1fdbaec1d55d32944da77474e5b727f284639b96bda535114cbf9b4806"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO/bundle.json","state_url":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AH654KD7BIDVN4MUXFVC4IGQKO/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-12T09:12:11Z","links":{"resolver":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO","bundle":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO/bundle.json","state":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AH654KD7BIDVN4MUXFVC4IGQKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AH654KD7BIDVN4MUXFVC4IGQKO","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":"9500b714135193c8e20d8007a7a685eb6106b65f28491ff85f535f05d39e9e13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-19T13:01:35Z","title_canon_sha256":"c91d26c91dbfd7987814ea06e987c36bd830bb9ed85a2b798b8497b2357bf81b"},"schema_version":"1.0","source":{"id":"1312.5525","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5525","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5525v2","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5525","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"AH654KD7BIDV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AH654KD7BIDVN4MU","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AH654KD7","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:c6160e1fdbaec1d55d32944da77474e5b727f284639b96bda535114cbf9b4806","target":"graph","created_at":"2026-05-18T01:09:32Z","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 consider a fragmentation of discrete trees where the internal vertices are deleted independently at a rate proportional to their degree. Informally, the associated cut-tree represents the genealogy of the nested connected components created by this process. We essentially work in the setting of Galton-Watson trees with offspring distribution belonging to the domain of attraction of a stable law of index $\\alpha\\in(1,2)$. Our main result is that, for a sequence of such trees $\\mathcal{T}_n$ conditioned to have size $n$, the corresponding rescaled cut-trees converge in distribution to the sta","authors_text":"Daphn\\'e Dieuleveut","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-19T13:01:35Z","title":"The vertex-cut-tree of Galton-Watson trees converging to a stable tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5525","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:6df97c114ad31c5214aaa5311257123c2d4d48da466b0198d2845c58762c3509","target":"record","created_at":"2026-05-18T01:09:32Z","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":"9500b714135193c8e20d8007a7a685eb6106b65f28491ff85f535f05d39e9e13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-19T13:01:35Z","title_canon_sha256":"c91d26c91dbfd7987814ea06e987c36bd830bb9ed85a2b798b8497b2357bf81b"},"schema_version":"1.0","source":{"id":"1312.5525","kind":"arxiv","version":2}},"canonical_sha256":"01fdde287f0a0756f194b96a2e20d053aba5bad657a5f04b7201ec2881d3606d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01fdde287f0a0756f194b96a2e20d053aba5bad657a5f04b7201ec2881d3606d","first_computed_at":"2026-05-18T01:09:32.395416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:32.395416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s9ZSUX5CRl+nFgv2BpT30785Nkkcv110x70idH0TpyDh/1H0MOhbUH6Ke51c5Xhp84xYCGB+AB/HrhBUcb7VDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:32.396059Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5525","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6df97c114ad31c5214aaa5311257123c2d4d48da466b0198d2845c58762c3509","sha256:c6160e1fdbaec1d55d32944da77474e5b727f284639b96bda535114cbf9b4806"],"state_sha256":"860e89707b5b1c544ffc4ca0fbfd4dad7f95bc088adbb6754f92653e5f6903ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJ4SgGHOPaiH4mCxMLc+xZ+ot3r+mII7WXExkZyvKCSMZj3U4MYXmYTykutWV9gVE+G0j9Wx4muyR8w4Z5BBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:12:11.504233Z","bundle_sha256":"f2f7aa395abce786129b406b9de96894c894b53ec3f2eb28044b8716da014a10"}}