{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DWN2GKXLTP7MNHOM7TNBCL5POA","short_pith_number":"pith:DWN2GKXL","canonical_record":{"source":{"id":"1704.05568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T00:36:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8a9f957457978b9586484b4b0c05f8c7ba6fa746ffa1f39fbffd3293cae8447b","abstract_canon_sha256":"3aeb79e8eea3b40295524c088bcca5c5b11606415b70e56b9d0f71fd75636da1"},"schema_version":"1.0"},"canonical_sha256":"1d9ba32aeb9bfec69dccfcda112faf701662cbf8a2d44e60d47afbad66a34d78","source":{"kind":"arxiv","id":"1704.05568","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05568","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05568v1","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05568","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"DWN2GKXLTP7M","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DWN2GKXLTP7MNHOM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DWN2GKXL","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DWN2GKXLTP7MNHOM7TNBCL5POA","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T00:36:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8a9f957457978b9586484b4b0c05f8c7ba6fa746ffa1f39fbffd3293cae8447b","abstract_canon_sha256":"3aeb79e8eea3b40295524c088bcca5c5b11606415b70e56b9d0f71fd75636da1"},"schema_version":"1.0"},"canonical_sha256":"1d9ba32aeb9bfec69dccfcda112faf701662cbf8a2d44e60d47afbad66a34d78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:07.120134Z","signature_b64":"JQbqA7/FSQhGNgpMD+DodyXqT/yMvnWDExS5H9YkAtRGq8C6PqfYryXcgkYkXGmmYAMD8S03tiz1Xwih2NNrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d9ba32aeb9bfec69dccfcda112faf701662cbf8a2d44e60d47afbad66a34d78","last_reissued_at":"2026-05-18T00:46:07.119580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:07.119580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05568","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-18T00:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R7OlC9jfldVP5vnT2dNKTeS6vu8+8myTfSOU9/81tHJ+mUnKFNnNw2grCiIHurEjCU78xCnX0GTn/eWcpR0ICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:25:33.783933Z"},"content_sha256":"dea579c24fc2ccbf07f0bd51175c2d221efa0f42745af0d21683481a25088e4e","schema_version":"1.0","event_id":"sha256:dea579c24fc2ccbf07f0bd51175c2d221efa0f42745af0d21683481a25088e4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DWN2GKXLTP7MNHOM7TNBCL5POA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the growth of a superlinear preferential attachment scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Shankar C. Venkataramani, Sunder Sethuraman","submitted_at":"2017-04-19T00:36:07Z","abstract_excerpt":"We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known that the graph evolution condenses, that is a.s. in the limit graph there will be a single random node with infinite degree, while all others have finite degree.\n  In this note, we establish a.s. law of large numbers type limits and fluctuation results, as $n\\uparrow\\infty$, for the counts of the number of nodes with degree $k\\geq 1$ at time $n\\geq 1$. These"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05568","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-18T00:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHkfQ43ZX5ywxTaDjkSa3JkXezgiYNOQACG4SMnak4X1wDoonPdOEdBVdJhfAXRJ6Y0VW/U6Vg9fBl+2y1cNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:25:33.784273Z"},"content_sha256":"1cff05600607cbbc227ad9a797d4ef5fdb9b4a4d39f161a74939b90de4b9884f","schema_version":"1.0","event_id":"sha256:1cff05600607cbbc227ad9a797d4ef5fdb9b4a4d39f161a74939b90de4b9884f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWN2GKXLTP7MNHOM7TNBCL5POA/bundle.json","state_url":"https://pith.science/pith/DWN2GKXLTP7MNHOM7TNBCL5POA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWN2GKXLTP7MNHOM7TNBCL5POA/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-30T07:25:33Z","links":{"resolver":"https://pith.science/pith/DWN2GKXLTP7MNHOM7TNBCL5POA","bundle":"https://pith.science/pith/DWN2GKXLTP7MNHOM7TNBCL5POA/bundle.json","state":"https://pith.science/pith/DWN2GKXLTP7MNHOM7TNBCL5POA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWN2GKXLTP7MNHOM7TNBCL5POA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DWN2GKXLTP7MNHOM7TNBCL5POA","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":"3aeb79e8eea3b40295524c088bcca5c5b11606415b70e56b9d0f71fd75636da1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T00:36:07Z","title_canon_sha256":"8a9f957457978b9586484b4b0c05f8c7ba6fa746ffa1f39fbffd3293cae8447b"},"schema_version":"1.0","source":{"id":"1704.05568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05568","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05568v1","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05568","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"DWN2GKXLTP7M","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DWN2GKXLTP7MNHOM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DWN2GKXL","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:1cff05600607cbbc227ad9a797d4ef5fdb9b4a4d39f161a74939b90de4b9884f","target":"graph","created_at":"2026-05-18T00:46:07Z","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 an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known that the graph evolution condenses, that is a.s. in the limit graph there will be a single random node with infinite degree, while all others have finite degree.\n  In this note, we establish a.s. law of large numbers type limits and fluctuation results, as $n\\uparrow\\infty$, for the counts of the number of nodes with degree $k\\geq 1$ at time $n\\geq 1$. These","authors_text":"Shankar C. Venkataramani, Sunder Sethuraman","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T00:36:07Z","title":"On the growth of a superlinear preferential attachment scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05568","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:dea579c24fc2ccbf07f0bd51175c2d221efa0f42745af0d21683481a25088e4e","target":"record","created_at":"2026-05-18T00:46:07Z","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":"3aeb79e8eea3b40295524c088bcca5c5b11606415b70e56b9d0f71fd75636da1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T00:36:07Z","title_canon_sha256":"8a9f957457978b9586484b4b0c05f8c7ba6fa746ffa1f39fbffd3293cae8447b"},"schema_version":"1.0","source":{"id":"1704.05568","kind":"arxiv","version":1}},"canonical_sha256":"1d9ba32aeb9bfec69dccfcda112faf701662cbf8a2d44e60d47afbad66a34d78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d9ba32aeb9bfec69dccfcda112faf701662cbf8a2d44e60d47afbad66a34d78","first_computed_at":"2026-05-18T00:46:07.119580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:07.119580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JQbqA7/FSQhGNgpMD+DodyXqT/yMvnWDExS5H9YkAtRGq8C6PqfYryXcgkYkXGmmYAMD8S03tiz1Xwih2NNrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:07.120134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dea579c24fc2ccbf07f0bd51175c2d221efa0f42745af0d21683481a25088e4e","sha256:1cff05600607cbbc227ad9a797d4ef5fdb9b4a4d39f161a74939b90de4b9884f"],"state_sha256":"faa060bc30a7ba4b4b0f3d36112fb0fe39b977576645b9f5326d77b6e4bb423e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FshsLtiU4Zq//JcVjzEwsQBRBDoBsCP8sWDqzSq/NwkS7wUqbg9ehgB421P0LGgsgDTqhtUoSmJP7HcueYytDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T07:25:33.786149Z","bundle_sha256":"8e5dab0a579d25e4fa2a7b61e56cc67ba508acdd07d220eba92df651f75c4699"}}