{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TROJJCZ2532UXYBMBKD6QLLX3E","short_pith_number":"pith:TROJJCZ2","canonical_record":{"source":{"id":"1601.06448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-24T23:33:07Z","cross_cats_sorted":["cs.DM","cs.IT","cs.SI","math.IT","math.ST","stat.TH"],"title_canon_sha256":"f21f258a86ee347c1df2098daaaba46751f277c6167843519cf36e90f943e112","abstract_canon_sha256":"648bd851d5e1c0a416f42de993ef859458c9212ced0837c44c2cfec1f0894d8b"},"schema_version":"1.0"},"canonical_sha256":"9c5c948b3aeef54be02c0a87e82d77d9373fbc26d7c59428a627a172a25152de","source":{"kind":"arxiv","id":"1601.06448","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06448","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06448v2","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06448","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"pith_short_12","alias_value":"TROJJCZ2532U","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TROJJCZ2532UXYBM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TROJJCZ2","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TROJJCZ2532UXYBMBKD6QLLX3E","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-24T23:33:07Z","cross_cats_sorted":["cs.DM","cs.IT","cs.SI","math.IT","math.ST","stat.TH"],"title_canon_sha256":"f21f258a86ee347c1df2098daaaba46751f277c6167843519cf36e90f943e112","abstract_canon_sha256":"648bd851d5e1c0a416f42de993ef859458c9212ced0837c44c2cfec1f0894d8b"},"schema_version":"1.0"},"canonical_sha256":"9c5c948b3aeef54be02c0a87e82d77d9373fbc26d7c59428a627a172a25152de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:08.664587Z","signature_b64":"kve1LqPcvnw81kWruNnj9gTJ4243G2ixPF1eEdiJYxKmbbkgvzZ5mdQaAkOmZHMXv7vhTZ/Bz9coggN6IAntDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c5c948b3aeef54be02c0a87e82d77d9373fbc26d7c59428a627a172a25152de","last_reissued_at":"2026-05-18T01:01:08.664010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:08.664010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06448","source_version":2,"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-18T01:01:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lb+KFADJJP3dddA25pa7gkrtcLBDdxqw1PQhLgXy120z9l1qAK56gyJ7oydt9qRLYRkv+WAtH/zNJgSYFvLkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:27:43.051913Z"},"content_sha256":"5feca752497067b1a219bc6d05195d698df6b29c98c5591183a4f1ea9a08564b","schema_version":"1.0","event_id":"sha256:5feca752497067b1a219bc6d05195d698df6b29c98c5591183a4f1ea9a08564b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TROJJCZ2532UXYBMBKD6QLLX3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of centrality in sublinear preferential attachment trees via the CMJ branching process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","cs.SI","math.IT","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Po-Ling Loh, Varun Jog","submitted_at":"2016-01-24T23:33:07Z","abstract_excerpt":"We investigate centrality and root-inference properties in a class of growing random graphs known as sublinear preferential attachment trees. We show that a continuous time branching processes called the Crump-Mode-Jagers (CMJ) branching process is well-suited to analyze such random trees, and prove that almost surely, a unique terminal tree centroid emerges, having the property that it becomes more central than any other fixed vertex in the limit of the random growth process. Our result generalizes and extends previous work establishing persistent centrality in uniform and linear preferential"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06448","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"},"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-18T01:01:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4Q/MIs4Nf6dl6eR+YD6CwyLpNakdzQsYdgwl98IuyLbXzFk1ysmbsFV+TgQaDFxCmJMxaj1eHt2iW9lvKrzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:27:43.052255Z"},"content_sha256":"cab4dca7e7222af809257163fc470cc8fe521a232c7aa967293b8a3a56922d67","schema_version":"1.0","event_id":"sha256:cab4dca7e7222af809257163fc470cc8fe521a232c7aa967293b8a3a56922d67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TROJJCZ2532UXYBMBKD6QLLX3E/bundle.json","state_url":"https://pith.science/pith/TROJJCZ2532UXYBMBKD6QLLX3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TROJJCZ2532UXYBMBKD6QLLX3E/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-02T10:27:43Z","links":{"resolver":"https://pith.science/pith/TROJJCZ2532UXYBMBKD6QLLX3E","bundle":"https://pith.science/pith/TROJJCZ2532UXYBMBKD6QLLX3E/bundle.json","state":"https://pith.science/pith/TROJJCZ2532UXYBMBKD6QLLX3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TROJJCZ2532UXYBMBKD6QLLX3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TROJJCZ2532UXYBMBKD6QLLX3E","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":"648bd851d5e1c0a416f42de993ef859458c9212ced0837c44c2cfec1f0894d8b","cross_cats_sorted":["cs.DM","cs.IT","cs.SI","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-24T23:33:07Z","title_canon_sha256":"f21f258a86ee347c1df2098daaaba46751f277c6167843519cf36e90f943e112"},"schema_version":"1.0","source":{"id":"1601.06448","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06448","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06448v2","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06448","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"pith_short_12","alias_value":"TROJJCZ2532U","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TROJJCZ2532UXYBM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TROJJCZ2","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:cab4dca7e7222af809257163fc470cc8fe521a232c7aa967293b8a3a56922d67","target":"graph","created_at":"2026-05-18T01:01:08Z","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 investigate centrality and root-inference properties in a class of growing random graphs known as sublinear preferential attachment trees. We show that a continuous time branching processes called the Crump-Mode-Jagers (CMJ) branching process is well-suited to analyze such random trees, and prove that almost surely, a unique terminal tree centroid emerges, having the property that it becomes more central than any other fixed vertex in the limit of the random growth process. Our result generalizes and extends previous work establishing persistent centrality in uniform and linear preferential","authors_text":"Po-Ling Loh, Varun Jog","cross_cats":["cs.DM","cs.IT","cs.SI","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-24T23:33:07Z","title":"Analysis of centrality in sublinear preferential attachment trees via the CMJ branching process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06448","kind":"arxiv","version":2},"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:5feca752497067b1a219bc6d05195d698df6b29c98c5591183a4f1ea9a08564b","target":"record","created_at":"2026-05-18T01:01:08Z","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":"648bd851d5e1c0a416f42de993ef859458c9212ced0837c44c2cfec1f0894d8b","cross_cats_sorted":["cs.DM","cs.IT","cs.SI","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-24T23:33:07Z","title_canon_sha256":"f21f258a86ee347c1df2098daaaba46751f277c6167843519cf36e90f943e112"},"schema_version":"1.0","source":{"id":"1601.06448","kind":"arxiv","version":2}},"canonical_sha256":"9c5c948b3aeef54be02c0a87e82d77d9373fbc26d7c59428a627a172a25152de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c5c948b3aeef54be02c0a87e82d77d9373fbc26d7c59428a627a172a25152de","first_computed_at":"2026-05-18T01:01:08.664010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:08.664010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kve1LqPcvnw81kWruNnj9gTJ4243G2ixPF1eEdiJYxKmbbkgvzZ5mdQaAkOmZHMXv7vhTZ/Bz9coggN6IAntDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:08.664587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06448","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5feca752497067b1a219bc6d05195d698df6b29c98c5591183a4f1ea9a08564b","sha256:cab4dca7e7222af809257163fc470cc8fe521a232c7aa967293b8a3a56922d67"],"state_sha256":"bfa88e768eae185609b28a7a87743dd8b39c547eb91a2b57b9479c5282e27d7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anzzcmNG84VL8tKyBnjszxur9az/lEJMUiu+cK2sWUFDqANtq7371jn8S6luJV+bzUsPKWaKdHCH/DAtUR/XCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:27:43.054113Z","bundle_sha256":"ec6613357a0a40214a5656df772535da76f6581178c47279dc8280d7d9289d21"}}