{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BN37IOV6XP5LKMVE5CVA6PZNZ7","short_pith_number":"pith:BN37IOV6","canonical_record":{"source":{"id":"1110.6455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-28T20:19:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0f3501bc920c57991af4f2b752044de670d9621990c8f3ba0a5dd19ab20bff03","abstract_canon_sha256":"f0ca59f0d4070ff946ea683e3f5c7f004879819ee5e1fb48278688376f6afb83"},"schema_version":"1.0"},"canonical_sha256":"0b77f43abebbfab532a4e8aa0f3f2dcfe92ea06bb7d2959a2e894df5ea1df5a4","source":{"kind":"arxiv","id":"1110.6455","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.6455","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"arxiv_version","alias_value":"1110.6455v3","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6455","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"pith_short_12","alias_value":"BN37IOV6XP5L","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BN37IOV6XP5LKMVE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BN37IOV6","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BN37IOV6XP5LKMVE5CVA6PZNZ7","target":"record","payload":{"canonical_record":{"source":{"id":"1110.6455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-28T20:19:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0f3501bc920c57991af4f2b752044de670d9621990c8f3ba0a5dd19ab20bff03","abstract_canon_sha256":"f0ca59f0d4070ff946ea683e3f5c7f004879819ee5e1fb48278688376f6afb83"},"schema_version":"1.0"},"canonical_sha256":"0b77f43abebbfab532a4e8aa0f3f2dcfe92ea06bb7d2959a2e894df5ea1df5a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:26.502685Z","signature_b64":"60jgicM7QkMi70xxZ1uhQVfxaWBaWn5goRpzD5kEuGZ9J2iHDuVR4ekyzxFFUIw9tTCcIsNuNCJt7WFvxauXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b77f43abebbfab532a4e8aa0f3f2dcfe92ea06bb7d2959a2e894df5ea1df5a4","last_reissued_at":"2026-05-18T02:43:26.501986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:26.501986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.6455","source_version":3,"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-18T02:43:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1tculdrIUfC5ABYKuNTNXZ2VjWYOB+2DpApQ3cUNYfu/d0AmK2GL94XlHBxWFZNTyU1NLDZokroec/aMSOd9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:48:35.737545Z"},"content_sha256":"e196aef4c84f32aa48169173c3e086767251cde503fa779394ecc4c4b71293ec","schema_version":"1.0","event_id":"sha256:e196aef4c84f32aa48169173c3e086767251cde503fa779394ecc4c4b71293ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BN37IOV6XP5LKMVE5CVA6PZNZ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cutting down trees with a Markov chainsaw","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Cecilia Holmgren, Louigi Addario-Berry, Nicolas Broutin","submitted_at":"2011-10-28T20:19:49Z","abstract_excerpt":"We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on a coupling which yields a precise, nonasymptotic distributional result for the case of uniformly random rooted labeled trees (or, equivalently, Poisson Galton-Watson trees conditioned on their size). Our approach also provides a new, random reversible transformation between Brownian excursion and Brownian bridge."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.6455","kind":"arxiv","version":3},"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-18T02:43:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TjuvBGgur5qu2I0p98q/BzQiG3WQYNPB4x9n6obSG+/mh/4BMY8ibhh5EGzGX3XDiG2SSiPUinrVBJkFoKTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:48:35.738298Z"},"content_sha256":"57b3d20f3c8ba3395f1e77086323ebc3a37775dd980b2b480c52693ed275fae3","schema_version":"1.0","event_id":"sha256:57b3d20f3c8ba3395f1e77086323ebc3a37775dd980b2b480c52693ed275fae3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BN37IOV6XP5LKMVE5CVA6PZNZ7/bundle.json","state_url":"https://pith.science/pith/BN37IOV6XP5LKMVE5CVA6PZNZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BN37IOV6XP5LKMVE5CVA6PZNZ7/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-08T19:48:35Z","links":{"resolver":"https://pith.science/pith/BN37IOV6XP5LKMVE5CVA6PZNZ7","bundle":"https://pith.science/pith/BN37IOV6XP5LKMVE5CVA6PZNZ7/bundle.json","state":"https://pith.science/pith/BN37IOV6XP5LKMVE5CVA6PZNZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BN37IOV6XP5LKMVE5CVA6PZNZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BN37IOV6XP5LKMVE5CVA6PZNZ7","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":"f0ca59f0d4070ff946ea683e3f5c7f004879819ee5e1fb48278688376f6afb83","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-28T20:19:49Z","title_canon_sha256":"0f3501bc920c57991af4f2b752044de670d9621990c8f3ba0a5dd19ab20bff03"},"schema_version":"1.0","source":{"id":"1110.6455","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.6455","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"arxiv_version","alias_value":"1110.6455v3","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6455","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"pith_short_12","alias_value":"BN37IOV6XP5L","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BN37IOV6XP5LKMVE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BN37IOV6","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:57b3d20f3c8ba3395f1e77086323ebc3a37775dd980b2b480c52693ed275fae3","target":"graph","created_at":"2026-05-18T02:43:26Z","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 provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on a coupling which yields a precise, nonasymptotic distributional result for the case of uniformly random rooted labeled trees (or, equivalently, Poisson Galton-Watson trees conditioned on their size). Our approach also provides a new, random reversible transformation between Brownian excursion and Brownian bridge.","authors_text":"Cecilia Holmgren, Louigi Addario-Berry, Nicolas Broutin","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-28T20:19:49Z","title":"Cutting down trees with a Markov chainsaw"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.6455","kind":"arxiv","version":3},"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:e196aef4c84f32aa48169173c3e086767251cde503fa779394ecc4c4b71293ec","target":"record","created_at":"2026-05-18T02:43:26Z","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":"f0ca59f0d4070ff946ea683e3f5c7f004879819ee5e1fb48278688376f6afb83","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-28T20:19:49Z","title_canon_sha256":"0f3501bc920c57991af4f2b752044de670d9621990c8f3ba0a5dd19ab20bff03"},"schema_version":"1.0","source":{"id":"1110.6455","kind":"arxiv","version":3}},"canonical_sha256":"0b77f43abebbfab532a4e8aa0f3f2dcfe92ea06bb7d2959a2e894df5ea1df5a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b77f43abebbfab532a4e8aa0f3f2dcfe92ea06bb7d2959a2e894df5ea1df5a4","first_computed_at":"2026-05-18T02:43:26.501986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:26.501986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"60jgicM7QkMi70xxZ1uhQVfxaWBaWn5goRpzD5kEuGZ9J2iHDuVR4ekyzxFFUIw9tTCcIsNuNCJt7WFvxauXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:26.502685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.6455","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e196aef4c84f32aa48169173c3e086767251cde503fa779394ecc4c4b71293ec","sha256:57b3d20f3c8ba3395f1e77086323ebc3a37775dd980b2b480c52693ed275fae3"],"state_sha256":"5dfa2d0521563fe36c62e099fbdd95f36dc339e3fc45f1de42708f708c739e4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wxh69G3d/ruUlc43rOK4EYuODnG1M6jFbBUci0w+Dk0SUe6uDFlgS8KymF0e89gERWjbxyGHOIHjZVzlDiscCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:48:35.742598Z","bundle_sha256":"87b31b609b2380b3ff3cf907d80943237ea0c738fb8bb0ec7b4475c9318b22d9"}}