{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KDCI4ISYBAWUS7YYFK66KJ4XCN","short_pith_number":"pith:KDCI4ISY","canonical_record":{"source":{"id":"1409.7106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-09-24T21:18:03Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"8e3d9c6be8e000569cc477b9b9fa14bddfa5bbe1da1a056552176e3b8d86b2e5","abstract_canon_sha256":"b2d140992d3d34615ec35005fbd100dfeb04304cef453550b5525e828a25c548"},"schema_version":"1.0"},"canonical_sha256":"50c48e2258082d497f182abde52797134223145390734dcbd9aabf962d3d94f0","source":{"kind":"arxiv","id":"1409.7106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7106","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7106v1","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7106","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"KDCI4ISYBAWU","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KDCI4ISYBAWUS7YY","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KDCI4ISY","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KDCI4ISYBAWUS7YYFK66KJ4XCN","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-09-24T21:18:03Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"8e3d9c6be8e000569cc477b9b9fa14bddfa5bbe1da1a056552176e3b8d86b2e5","abstract_canon_sha256":"b2d140992d3d34615ec35005fbd100dfeb04304cef453550b5525e828a25c548"},"schema_version":"1.0"},"canonical_sha256":"50c48e2258082d497f182abde52797134223145390734dcbd9aabf962d3d94f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:33.694222Z","signature_b64":"FpxJrmq+Zaau28THebhkdwKxzN567RFs0OfyzpcFhocQ348ZhL62gziGxntDiY0+DVOJT6mMXvy1qXyirHp9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50c48e2258082d497f182abde52797134223145390734dcbd9aabf962d3d94f0","last_reissued_at":"2026-05-18T02:30:33.693825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:33.693825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7106","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-18T02:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0uqm1pCLOchykXWSVvGyqDKWZas/kLCek4u2deq6yUK/swHDiivlpd13699zyLkGDyVJVAiniHK/hETvYNqSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:04:37.506383Z"},"content_sha256":"3bd46078ad33a6b5c493c4522486df51b32e311723c1c87c3e0221d99ca4bb48","schema_version":"1.0","event_id":"sha256:3bd46078ad33a6b5c493c4522486df51b32e311723c1c87c3e0221d99ca4bb48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KDCI4ISYBAWUS7YYFK66KJ4XCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fragmentation of Random Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cond-mat.stat-mech","authors_text":"E. Ben-Naim, Z. Kalay","submitted_at":"2014-09-24T21:18:03Z","abstract_excerpt":"We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees, namely, a forest. We study statistical properties of trees and nodes in this heterogeneous forest, and find that the fraction of remaining nodes m characterizes the system in the limit N --> infty. We obtain analytically the size density phi_s "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7106","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-18T02:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rd05krNoK/3Y0TgmEgF/dT4HnyHZhzinZ+yN5z4hp9Aejp7qpFnflud/yTLatEIbst/wwO0KpEAEdHUyicTNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:04:37.506897Z"},"content_sha256":"2aa0cbdeef3d147c9d2df4cbd2e0e72715dfd965ecb52c4c5a1d2a250f5c755b","schema_version":"1.0","event_id":"sha256:2aa0cbdeef3d147c9d2df4cbd2e0e72715dfd965ecb52c4c5a1d2a250f5c755b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDCI4ISYBAWUS7YYFK66KJ4XCN/bundle.json","state_url":"https://pith.science/pith/KDCI4ISYBAWUS7YYFK66KJ4XCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDCI4ISYBAWUS7YYFK66KJ4XCN/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-05-27T17:04:37Z","links":{"resolver":"https://pith.science/pith/KDCI4ISYBAWUS7YYFK66KJ4XCN","bundle":"https://pith.science/pith/KDCI4ISYBAWUS7YYFK66KJ4XCN/bundle.json","state":"https://pith.science/pith/KDCI4ISYBAWUS7YYFK66KJ4XCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDCI4ISYBAWUS7YYFK66KJ4XCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KDCI4ISYBAWUS7YYFK66KJ4XCN","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":"b2d140992d3d34615ec35005fbd100dfeb04304cef453550b5525e828a25c548","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-09-24T21:18:03Z","title_canon_sha256":"8e3d9c6be8e000569cc477b9b9fa14bddfa5bbe1da1a056552176e3b8d86b2e5"},"schema_version":"1.0","source":{"id":"1409.7106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7106","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7106v1","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7106","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"KDCI4ISYBAWU","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KDCI4ISYBAWUS7YY","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KDCI4ISY","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:2aa0cbdeef3d147c9d2df4cbd2e0e72715dfd965ecb52c4c5a1d2a250f5c755b","target":"graph","created_at":"2026-05-18T02:30:33Z","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 study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees, namely, a forest. We study statistical properties of trees and nodes in this heterogeneous forest, and find that the fraction of remaining nodes m characterizes the system in the limit N --> infty. We obtain analytically the size density phi_s ","authors_text":"E. Ben-Naim, Z. Kalay","cross_cats":["math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-09-24T21:18:03Z","title":"Fragmentation of Random Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7106","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:3bd46078ad33a6b5c493c4522486df51b32e311723c1c87c3e0221d99ca4bb48","target":"record","created_at":"2026-05-18T02:30:33Z","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":"b2d140992d3d34615ec35005fbd100dfeb04304cef453550b5525e828a25c548","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-09-24T21:18:03Z","title_canon_sha256":"8e3d9c6be8e000569cc477b9b9fa14bddfa5bbe1da1a056552176e3b8d86b2e5"},"schema_version":"1.0","source":{"id":"1409.7106","kind":"arxiv","version":1}},"canonical_sha256":"50c48e2258082d497f182abde52797134223145390734dcbd9aabf962d3d94f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50c48e2258082d497f182abde52797134223145390734dcbd9aabf962d3d94f0","first_computed_at":"2026-05-18T02:30:33.693825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:33.693825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FpxJrmq+Zaau28THebhkdwKxzN567RFs0OfyzpcFhocQ348ZhL62gziGxntDiY0+DVOJT6mMXvy1qXyirHp9Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:33.694222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bd46078ad33a6b5c493c4522486df51b32e311723c1c87c3e0221d99ca4bb48","sha256:2aa0cbdeef3d147c9d2df4cbd2e0e72715dfd965ecb52c4c5a1d2a250f5c755b"],"state_sha256":"181b2e9c490646eb7515404b8425cf6d228516458eea4daf6d31d8d8c4c28eb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klwPcpE/wn7PKLjlaZFKHLODCWovlD/vRrafTmPWV/UuHtLfk0zCOXHdQNMT4NjXNYpIqTFb18Q+tMe1luuTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:04:37.509472Z","bundle_sha256":"3274b5bfc2b6f40f4120c1cd7adf9fbcff2c07d1808db9e11a9ad91bf572ae39"}}