{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AH654KD7BIDVN4MUXFVC4IGQKO","short_pith_number":"pith:AH654KD7","schema_version":"1.0","canonical_sha256":"01fdde287f0a0756f194b96a2e20d053aba5bad657a5f04b7201ec2881d3606d","source":{"kind":"arxiv","id":"1312.5525","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.5525","created_at":"2026-05-18T01:09:32.395533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.5525v2","created_at":"2026-05-18T01:09:32.395533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5525","created_at":"2026-05-18T01:09:32.395533+00:00"},{"alias_kind":"pith_short_12","alias_value":"AH654KD7BIDV","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AH654KD7BIDVN4MU","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AH654KD7","created_at":"2026-05-18T12:27:38.830355+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/AH654KD7BIDVN4MUXFVC4IGQKO","json":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO.json","graph_json":"https://pith.science/api/pith-number/AH654KD7BIDVN4MUXFVC4IGQKO/graph.json","events_json":"https://pith.science/api/pith-number/AH654KD7BIDVN4MUXFVC4IGQKO/events.json","paper":"https://pith.science/paper/AH654KD7"},"agent_actions":{"view_html":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO","download_json":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO.json","view_paper":"https://pith.science/paper/AH654KD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.5525&json=true","fetch_graph":"https://pith.science/api/pith-number/AH654KD7BIDVN4MUXFVC4IGQKO/graph.json","fetch_events":"https://pith.science/api/pith-number/AH654KD7BIDVN4MUXFVC4IGQKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO/action/storage_attestation","attest_author":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO/action/author_attestation","sign_citation":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO/action/citation_signature","submit_replication":"https://pith.science/pith/AH654KD7BIDVN4MUXFVC4IGQKO/action/replication_record"}},"created_at":"2026-05-18T01:09:32.395533+00:00","updated_at":"2026-05-18T01:09:32.395533+00:00"}