{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EXW3T3NJL7NWR6NMBMSM67JVTL","short_pith_number":"pith:EXW3T3NJ","canonical_record":{"source":{"id":"1603.08806","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-29T15:16:59Z","cross_cats_sorted":[],"title_canon_sha256":"04c248a9ef1c174a5cea940145b864c42587f5af67435a88107ccfaeaf08d721","abstract_canon_sha256":"93b16d12bed2c64f754a675b902d038eb0ea76fdea24d486bcb078131e7462ae"},"schema_version":"1.0"},"canonical_sha256":"25edb9eda95fdb68f9ac0b24cf7d359ae86d6a1a8c6a47bd6ebb9231338c679f","source":{"kind":"arxiv","id":"1603.08806","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08806","created_at":"2026-07-05T00:57:03Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08806v5","created_at":"2026-07-05T00:57:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08806","created_at":"2026-07-05T00:57:03Z"},{"alias_kind":"pith_short_12","alias_value":"EXW3T3NJL7NW","created_at":"2026-07-05T00:57:03Z"},{"alias_kind":"pith_short_16","alias_value":"EXW3T3NJL7NWR6NM","created_at":"2026-07-05T00:57:03Z"},{"alias_kind":"pith_short_8","alias_value":"EXW3T3NJ","created_at":"2026-07-05T00:57:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EXW3T3NJL7NWR6NMBMSM67JVTL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.08806","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-29T15:16:59Z","cross_cats_sorted":[],"title_canon_sha256":"04c248a9ef1c174a5cea940145b864c42587f5af67435a88107ccfaeaf08d721","abstract_canon_sha256":"93b16d12bed2c64f754a675b902d038eb0ea76fdea24d486bcb078131e7462ae"},"schema_version":"1.0"},"canonical_sha256":"25edb9eda95fdb68f9ac0b24cf7d359ae86d6a1a8c6a47bd6ebb9231338c679f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:57:03.063499Z","signature_b64":"2T/HJmwGBAwu3erDfYE1+2z5iq2XCATA0zCy4ZMUzTtmNHrBGC4CR0tWbBXLcP/+E/bePnKBZ0W8xR4UoOP1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25edb9eda95fdb68f9ac0b24cf7d359ae86d6a1a8c6a47bd6ebb9231338c679f","last_reissued_at":"2026-07-05T00:57:03.063129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:57:03.063129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.08806","source_version":5,"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-07-05T00:57:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCeOWknlgedxXTxoKzk3diGgxbprDFdtYyRJojY/B4FibHznKDD9bOUid4bzq6zDay6si+AD8uKIRD9IoUH7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:45:36.803165Z"},"content_sha256":"ecfdb265138bef4fd4ef1efd0e211c3502876f548e38604740a5abd333a0f792","schema_version":"1.0","event_id":"sha256:ecfdb265138bef4fd4ef1efd0e211c3502876f548e38604740a5abd333a0f792"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EXW3T3NJL7NWR6NMBMSM67JVTL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Preferential Attachment Process Approaching the Rado Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Elwes","submitted_at":"2016-03-29T15:16:59Z","abstract_excerpt":"We consider a simple Preferential Attachment graph process, which begins with a finite graph, and in which a new $(t+1)$st vertex is added at each subsequent time step $t$, and connected to each previous vertex $u \\leq t$ with probability $\\frac{d_u(t)}{t}$ where $d_u(t)$ is the degree of $u$ at time $t$. We analyse the graph obtained as the infinite limit of this process, and show that so long as the initial finite graph is neither edgeless nor complete, with probability 1 the outcome will be a copy of the Rado graph augmented with a finite number of either isolated or universal vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08806","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1603.08806/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:57:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6zTZ3TrAalFYDHC48qnviB0nDJXHasWt7smhJgkDGnTsiO1xj6p4XBrN24Ww/F5DO5S8uT+L5onlpQ9AIalDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:45:36.803673Z"},"content_sha256":"0113973a2b4a5c7eaa43f6aa5f78c765770de92b37f182a52093a5c820097a44","schema_version":"1.0","event_id":"sha256:0113973a2b4a5c7eaa43f6aa5f78c765770de92b37f182a52093a5c820097a44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXW3T3NJL7NWR6NMBMSM67JVTL/bundle.json","state_url":"https://pith.science/pith/EXW3T3NJL7NWR6NMBMSM67JVTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXW3T3NJL7NWR6NMBMSM67JVTL/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-08-16T13:45:36Z","links":{"resolver":"https://pith.science/pith/EXW3T3NJL7NWR6NMBMSM67JVTL","bundle":"https://pith.science/pith/EXW3T3NJL7NWR6NMBMSM67JVTL/bundle.json","state":"https://pith.science/pith/EXW3T3NJL7NWR6NMBMSM67JVTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXW3T3NJL7NWR6NMBMSM67JVTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EXW3T3NJL7NWR6NMBMSM67JVTL","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":"93b16d12bed2c64f754a675b902d038eb0ea76fdea24d486bcb078131e7462ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-29T15:16:59Z","title_canon_sha256":"04c248a9ef1c174a5cea940145b864c42587f5af67435a88107ccfaeaf08d721"},"schema_version":"1.0","source":{"id":"1603.08806","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08806","created_at":"2026-07-05T00:57:03Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08806v5","created_at":"2026-07-05T00:57:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08806","created_at":"2026-07-05T00:57:03Z"},{"alias_kind":"pith_short_12","alias_value":"EXW3T3NJL7NW","created_at":"2026-07-05T00:57:03Z"},{"alias_kind":"pith_short_16","alias_value":"EXW3T3NJL7NWR6NM","created_at":"2026-07-05T00:57:03Z"},{"alias_kind":"pith_short_8","alias_value":"EXW3T3NJ","created_at":"2026-07-05T00:57:03Z"}],"graph_snapshots":[{"event_id":"sha256:0113973a2b4a5c7eaa43f6aa5f78c765770de92b37f182a52093a5c820097a44","target":"graph","created_at":"2026-07-05T00:57:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1603.08806/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a simple Preferential Attachment graph process, which begins with a finite graph, and in which a new $(t+1)$st vertex is added at each subsequent time step $t$, and connected to each previous vertex $u \\leq t$ with probability $\\frac{d_u(t)}{t}$ where $d_u(t)$ is the degree of $u$ at time $t$. We analyse the graph obtained as the infinite limit of this process, and show that so long as the initial finite graph is neither edgeless nor complete, with probability 1 the outcome will be a copy of the Rado graph augmented with a finite number of either isolated or universal vertices.","authors_text":"Richard Elwes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-29T15:16:59Z","title":"A Preferential Attachment Process Approaching the Rado Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08806","kind":"arxiv","version":5},"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:ecfdb265138bef4fd4ef1efd0e211c3502876f548e38604740a5abd333a0f792","target":"record","created_at":"2026-07-05T00:57:03Z","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":"93b16d12bed2c64f754a675b902d038eb0ea76fdea24d486bcb078131e7462ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-29T15:16:59Z","title_canon_sha256":"04c248a9ef1c174a5cea940145b864c42587f5af67435a88107ccfaeaf08d721"},"schema_version":"1.0","source":{"id":"1603.08806","kind":"arxiv","version":5}},"canonical_sha256":"25edb9eda95fdb68f9ac0b24cf7d359ae86d6a1a8c6a47bd6ebb9231338c679f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25edb9eda95fdb68f9ac0b24cf7d359ae86d6a1a8c6a47bd6ebb9231338c679f","first_computed_at":"2026-07-05T00:57:03.063129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:57:03.063129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2T/HJmwGBAwu3erDfYE1+2z5iq2XCATA0zCy4ZMUzTtmNHrBGC4CR0tWbBXLcP/+E/bePnKBZ0W8xR4UoOP1Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:57:03.063499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08806","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecfdb265138bef4fd4ef1efd0e211c3502876f548e38604740a5abd333a0f792","sha256:0113973a2b4a5c7eaa43f6aa5f78c765770de92b37f182a52093a5c820097a44"],"state_sha256":"d81431260f0b03a1b938ef5e3dfc636b88e3398b1fc861864e5b7f3324a4b3bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y60y2c8BERRrkkhe1QvZxdMleGYdTCKK+Sp7a5jjJO8ZUM7keDo3cNNsJfeqiyR+yDMS67JkZ5+QfIkDu1eHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:45:36.806789Z","bundle_sha256":"f3709fca77177be625721bfbba33d2cdf4558de29215c7356f67407c5fcef551"}}