{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IPLHV2EWH6FQP5OBP2RHCCISY2","short_pith_number":"pith:IPLHV2EW","canonical_record":{"source":{"id":"1305.2880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T18:09:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"80ed522c7ba5cf37f38dac83a3a617f6d842ddaec75efabe1d6dfdadbed85a40","abstract_canon_sha256":"b0c9225a1ab081da2a52149f59ee0fcfeb858a1ad0d482bc0d65740cba249708"},"schema_version":"1.0"},"canonical_sha256":"43d67ae8963f8b07f5c17ea2710912c696dcf5a58cc34552ad8f9dc9b64228de","source":{"kind":"arxiv","id":"1305.2880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2880","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2880v1","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2880","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"IPLHV2EWH6FQ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IPLHV2EWH6FQP5OB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IPLHV2EW","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IPLHV2EWH6FQP5OBP2RHCCISY2","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T18:09:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"80ed522c7ba5cf37f38dac83a3a617f6d842ddaec75efabe1d6dfdadbed85a40","abstract_canon_sha256":"b0c9225a1ab081da2a52149f59ee0fcfeb858a1ad0d482bc0d65740cba249708"},"schema_version":"1.0"},"canonical_sha256":"43d67ae8963f8b07f5c17ea2710912c696dcf5a58cc34552ad8f9dc9b64228de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:47.023670Z","signature_b64":"uKY0i+PUJ3GCqzFwmjpQPSEv/YrZ+tPfGMsCFI3eQSlbgc+pL9F+0nx2dLcdpbqXQKMMuNom0vB8sKX4G7tzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43d67ae8963f8b07f5c17ea2710912c696dcf5a58cc34552ad8f9dc9b64228de","last_reissued_at":"2026-05-18T03:25:47.023002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:47.023002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2880","source_version":1,"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:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoplrMxhId7EPgI2GJe0GvU4ratmM4DC3Jdm4t1E6oXjzRV66jHl5nURep2MQCLxyN6oYVawKyJVawKYhwaXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:28:47.409690Z"},"content_sha256":"94c3244a7db2415e111811c37e4dcbb4591159f7d5fbbafe6b05ba1c7df9e4cf","schema_version":"1.0","event_id":"sha256:94c3244a7db2415e111811c37e4dcbb4591159f7d5fbbafe6b05ba1c7df9e4cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IPLHV2EWH6FQP5OBP2RHCCISY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple isolation of nodes in recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alois Panholzer, Markus Kuba","submitted_at":"2013-05-13T18:09:46Z","abstract_excerpt":"We introduce the problem of isolating several nodes in random recursive trees by successively removing random edges, and study the number of random cuts that are necessary for the isolation. In particular, we analyze the number of random cuts required to isolate $\\ell$ selected nodes in a size-n random recursive tree for three different selection rules, namely (i) isolating all of the nodes labelled 1,2,...,$\\ell$ (thus nodes located close to the root of the tree), (ii) isolating all of the nodes labelled n+1-$\\ell$,n+2-$\\ell$,...,n (thus nodes located at the fringe of the tree), and (iii) iso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2880","kind":"arxiv","version":1},"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:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5cWN+RiY7ZR/X5s2s8/sHB0N+Ka0iJfTSKTlhnhFZFeEplT3tyDMk9wzr0fishhy+Jc1Itr2zcY57r7t6kSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:28:47.410036Z"},"content_sha256":"ee30d82f1cccc632e633c5981b43717f8903574f828fcb4619ff20be02c116c1","schema_version":"1.0","event_id":"sha256:ee30d82f1cccc632e633c5981b43717f8903574f828fcb4619ff20be02c116c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPLHV2EWH6FQP5OBP2RHCCISY2/bundle.json","state_url":"https://pith.science/pith/IPLHV2EWH6FQP5OBP2RHCCISY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPLHV2EWH6FQP5OBP2RHCCISY2/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-03T06:28:47Z","links":{"resolver":"https://pith.science/pith/IPLHV2EWH6FQP5OBP2RHCCISY2","bundle":"https://pith.science/pith/IPLHV2EWH6FQP5OBP2RHCCISY2/bundle.json","state":"https://pith.science/pith/IPLHV2EWH6FQP5OBP2RHCCISY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPLHV2EWH6FQP5OBP2RHCCISY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IPLHV2EWH6FQP5OBP2RHCCISY2","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":"b0c9225a1ab081da2a52149f59ee0fcfeb858a1ad0d482bc0d65740cba249708","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T18:09:46Z","title_canon_sha256":"80ed522c7ba5cf37f38dac83a3a617f6d842ddaec75efabe1d6dfdadbed85a40"},"schema_version":"1.0","source":{"id":"1305.2880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2880","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2880v1","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2880","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"IPLHV2EWH6FQ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IPLHV2EWH6FQP5OB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IPLHV2EW","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ee30d82f1cccc632e633c5981b43717f8903574f828fcb4619ff20be02c116c1","target":"graph","created_at":"2026-05-18T03:25:47Z","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 introduce the problem of isolating several nodes in random recursive trees by successively removing random edges, and study the number of random cuts that are necessary for the isolation. In particular, we analyze the number of random cuts required to isolate $\\ell$ selected nodes in a size-n random recursive tree for three different selection rules, namely (i) isolating all of the nodes labelled 1,2,...,$\\ell$ (thus nodes located close to the root of the tree), (ii) isolating all of the nodes labelled n+1-$\\ell$,n+2-$\\ell$,...,n (thus nodes located at the fringe of the tree), and (iii) iso","authors_text":"Alois Panholzer, Markus Kuba","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T18:09:46Z","title":"Multiple isolation of nodes in recursive trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2880","kind":"arxiv","version":1},"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:94c3244a7db2415e111811c37e4dcbb4591159f7d5fbbafe6b05ba1c7df9e4cf","target":"record","created_at":"2026-05-18T03:25:47Z","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":"b0c9225a1ab081da2a52149f59ee0fcfeb858a1ad0d482bc0d65740cba249708","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T18:09:46Z","title_canon_sha256":"80ed522c7ba5cf37f38dac83a3a617f6d842ddaec75efabe1d6dfdadbed85a40"},"schema_version":"1.0","source":{"id":"1305.2880","kind":"arxiv","version":1}},"canonical_sha256":"43d67ae8963f8b07f5c17ea2710912c696dcf5a58cc34552ad8f9dc9b64228de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43d67ae8963f8b07f5c17ea2710912c696dcf5a58cc34552ad8f9dc9b64228de","first_computed_at":"2026-05-18T03:25:47.023002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:47.023002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uKY0i+PUJ3GCqzFwmjpQPSEv/YrZ+tPfGMsCFI3eQSlbgc+pL9F+0nx2dLcdpbqXQKMMuNom0vB8sKX4G7tzBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:47.023670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94c3244a7db2415e111811c37e4dcbb4591159f7d5fbbafe6b05ba1c7df9e4cf","sha256:ee30d82f1cccc632e633c5981b43717f8903574f828fcb4619ff20be02c116c1"],"state_sha256":"1d79934a771d27dbfad622397569d21b99a5d7b6268957164daace49dd68d42b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xb8qMR6tsQunGFMQc8CQuHHqfZG2n8MfuNy5PTGoPH2lmg/ZowJ3DaGDtsIDak6VeRthY06ozGC3cAD3UMGvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:28:47.412062Z","bundle_sha256":"47ce3c76b04b327398805c1391bc3e1a6282d37e15f5cf6a985533b236a7fafc"}}