{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:I3ZRUTPE45SU3SML34LPYEUIWG","short_pith_number":"pith:I3ZRUTPE","canonical_record":{"source":{"id":"1504.07328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-28T01:53:19Z","cross_cats_sorted":[],"title_canon_sha256":"796e87fbb4ada975d9bde52debc5201f11f604210baddf5dcc94661fd5b27e9b","abstract_canon_sha256":"0ce66d734c0cda4adaa3536cf5875ae82a815e18863f2e1515e4defdf696c6d0"},"schema_version":"1.0"},"canonical_sha256":"46f31a4de4e7654dc98bdf16fc1288b1a1f2e40b8ff5cf638b64c075d098ca17","source":{"kind":"arxiv","id":"1504.07328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07328","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07328v1","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07328","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"I3ZRUTPE45SU","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I3ZRUTPE45SU3SML","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I3ZRUTPE","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:I3ZRUTPE45SU3SML34LPYEUIWG","target":"record","payload":{"canonical_record":{"source":{"id":"1504.07328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-28T01:53:19Z","cross_cats_sorted":[],"title_canon_sha256":"796e87fbb4ada975d9bde52debc5201f11f604210baddf5dcc94661fd5b27e9b","abstract_canon_sha256":"0ce66d734c0cda4adaa3536cf5875ae82a815e18863f2e1515e4defdf696c6d0"},"schema_version":"1.0"},"canonical_sha256":"46f31a4de4e7654dc98bdf16fc1288b1a1f2e40b8ff5cf638b64c075d098ca17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:35.146573Z","signature_b64":"G49iDrIClEK/pERGDZfxpkHvg2T8kHgD+OtJCuXqw8yKyrHNicM4anzXzbvUCwaapENIdjXLV5dezbWyxAOkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46f31a4de4e7654dc98bdf16fc1288b1a1f2e40b8ff5cf638b64c075d098ca17","last_reissued_at":"2026-05-18T02:17:35.145933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:35.145933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.07328","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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qOFVHyZ25UlDK0Ds+xmk/ou1Ko2yIWzbWblMDms5Ig5bhYcBlSVaIfiszTVSvhMbkdUB68qSc7JMUdIeK5o6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:22:35.419001Z"},"content_sha256":"6a22c2caec79f02a8f733efa350826567bc10bfc4161835d8b53c07230927879","schema_version":"1.0","event_id":"sha256:6a22c2caec79f02a8f733efa350826567bc10bfc4161835d8b53c07230927879"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:I3ZRUTPE45SU3SML34LPYEUIWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Normality of Degree Counts in a Preferential Attachment Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gennady Samorodnitsky, Sidney Resnick","submitted_at":"2015-04-28T01:53:19Z","abstract_excerpt":"Preferential attachment is a widely adopted paradigm for understanding the dynamics of social networks. Formal statistical inference,for instance GLM techniques, and model verification methods will require knowing test statistics are asymptotically normal even though node or count based network data is nothing like classical data from independently replicated experiments. We therefore study asymptotic normality of degree counts for a sequence of growing simple undirected preferential attachment graphs. The methods of proof rely on identifying martingales and then exploiting the martingale cent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07328","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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJBEluRopRlHTyUz7v4IJGo2RNA69V9Pj3lpbhbhjbnXoO1rer6MQN4e7uzWJdsqe/acB30F/+vu5gk2uQ8uDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:22:35.419811Z"},"content_sha256":"81fdfedee62cb3be4380a6b78449845a192c4fd4c162777ce1af384e08944f75","schema_version":"1.0","event_id":"sha256:81fdfedee62cb3be4380a6b78449845a192c4fd4c162777ce1af384e08944f75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3ZRUTPE45SU3SML34LPYEUIWG/bundle.json","state_url":"https://pith.science/pith/I3ZRUTPE45SU3SML34LPYEUIWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3ZRUTPE45SU3SML34LPYEUIWG/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-31T11:22:35Z","links":{"resolver":"https://pith.science/pith/I3ZRUTPE45SU3SML34LPYEUIWG","bundle":"https://pith.science/pith/I3ZRUTPE45SU3SML34LPYEUIWG/bundle.json","state":"https://pith.science/pith/I3ZRUTPE45SU3SML34LPYEUIWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3ZRUTPE45SU3SML34LPYEUIWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:I3ZRUTPE45SU3SML34LPYEUIWG","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":"0ce66d734c0cda4adaa3536cf5875ae82a815e18863f2e1515e4defdf696c6d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-28T01:53:19Z","title_canon_sha256":"796e87fbb4ada975d9bde52debc5201f11f604210baddf5dcc94661fd5b27e9b"},"schema_version":"1.0","source":{"id":"1504.07328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07328","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07328v1","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07328","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"I3ZRUTPE45SU","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I3ZRUTPE45SU3SML","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I3ZRUTPE","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:81fdfedee62cb3be4380a6b78449845a192c4fd4c162777ce1af384e08944f75","target":"graph","created_at":"2026-05-18T02:17:35Z","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":"Preferential attachment is a widely adopted paradigm for understanding the dynamics of social networks. Formal statistical inference,for instance GLM techniques, and model verification methods will require knowing test statistics are asymptotically normal even though node or count based network data is nothing like classical data from independently replicated experiments. We therefore study asymptotic normality of degree counts for a sequence of growing simple undirected preferential attachment graphs. The methods of proof rely on identifying martingales and then exploiting the martingale cent","authors_text":"Gennady Samorodnitsky, Sidney Resnick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-28T01:53:19Z","title":"Asymptotic Normality of Degree Counts in a Preferential Attachment Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07328","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:6a22c2caec79f02a8f733efa350826567bc10bfc4161835d8b53c07230927879","target":"record","created_at":"2026-05-18T02:17:35Z","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":"0ce66d734c0cda4adaa3536cf5875ae82a815e18863f2e1515e4defdf696c6d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-28T01:53:19Z","title_canon_sha256":"796e87fbb4ada975d9bde52debc5201f11f604210baddf5dcc94661fd5b27e9b"},"schema_version":"1.0","source":{"id":"1504.07328","kind":"arxiv","version":1}},"canonical_sha256":"46f31a4de4e7654dc98bdf16fc1288b1a1f2e40b8ff5cf638b64c075d098ca17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46f31a4de4e7654dc98bdf16fc1288b1a1f2e40b8ff5cf638b64c075d098ca17","first_computed_at":"2026-05-18T02:17:35.145933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:35.145933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G49iDrIClEK/pERGDZfxpkHvg2T8kHgD+OtJCuXqw8yKyrHNicM4anzXzbvUCwaapENIdjXLV5dezbWyxAOkBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:35.146573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a22c2caec79f02a8f733efa350826567bc10bfc4161835d8b53c07230927879","sha256:81fdfedee62cb3be4380a6b78449845a192c4fd4c162777ce1af384e08944f75"],"state_sha256":"2ff408b5f00dc76192f96dfcc2cc4029fec129ba79f1edb27b3c73f247524b40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DeJXRsPA36bMnXWQyfcL6EfXDb4UnnJax6n7z5vOw02ORrdOpBtwAEL4fz6ZTuT+qbnPAtepi3dtVhbqr6qTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:22:35.423903Z","bundle_sha256":"1be602aba391b51e30fd869a1a0a3a4b7c1524c18e081968b317f55a219dc96b"}}