{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OR4PUHMPGJBDQYISSS7ZNSUTTN","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":"9f8e6156ec18de977cb60163a2f6646eb2dfa9346817712b16cf3e115c1e46eb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-17T07:51:52Z","title_canon_sha256":"4360b9a9ab51853c85da3431549a717c69a871cd95c3cee8a699da54648b7b34"},"schema_version":"1.0","source":{"id":"1706.05487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05487","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05487v1","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05487","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"OR4PUHMPGJBD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OR4PUHMPGJBDQYIS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OR4PUHMP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:b21ace47a3d3a248fcdc74c89c96c55b2335cf921e239ea6e7ff50c793eebc58","target":"graph","created_at":"2026-05-18T00:42:09Z","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 linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree and the standard preferential attachment tree. An application is given to the sum over all pairs of nodes of the common number of ancestors.","authors_text":"Svante Janson","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-17T07:51:52Z","title":"Random recursive trees and preferential attachment trees are random split trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05487","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:0fcf6797f2063dc6a20bc685764000def9a4805ba1bdeb7ad978b3e3a83c08f7","target":"record","created_at":"2026-05-18T00:42:09Z","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":"9f8e6156ec18de977cb60163a2f6646eb2dfa9346817712b16cf3e115c1e46eb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-17T07:51:52Z","title_canon_sha256":"4360b9a9ab51853c85da3431549a717c69a871cd95c3cee8a699da54648b7b34"},"schema_version":"1.0","source":{"id":"1706.05487","kind":"arxiv","version":1}},"canonical_sha256":"7478fa1d8f324238611294bf96ca939b648b4bdcce046ce825b777932112102e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7478fa1d8f324238611294bf96ca939b648b4bdcce046ce825b777932112102e","first_computed_at":"2026-05-18T00:42:09.681492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:09.681492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ef0dNjY4zRuDsLENt+l3gHZeZpZ2Mk9Ox8t42NAOe7gmkUT7Wj7x0dlOzhFpdy0OG59cQ6BaofPLM8a5q5x3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:09.682007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fcf6797f2063dc6a20bc685764000def9a4805ba1bdeb7ad978b3e3a83c08f7","sha256:b21ace47a3d3a248fcdc74c89c96c55b2335cf921e239ea6e7ff50c793eebc58"],"state_sha256":"901e028548e84cfafd927260ead3a391f2eafdc3f4661fc1206559730ac149a5"}