{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WTFXB4H4ANEX5XEUZXWXKLP2UM","short_pith_number":"pith:WTFXB4H4","canonical_record":{"source":{"id":"1203.5758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-26T18:41:28Z","cross_cats_sorted":[],"title_canon_sha256":"e8fd1a05b206845c3d63cb8126677daa317d10f68d4f47374b5aa3f992686a2a","abstract_canon_sha256":"724fe66004c8b8d86800cfe4b4b41e3d535f1ce5eb58d7313a2393357d47c05f"},"schema_version":"1.0"},"canonical_sha256":"b4cb70f0fc03497edc94cded752dfaa32e63fcb82db595f9dfe2d9a5dd507582","source":{"kind":"arxiv","id":"1203.5758","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5758","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5758v2","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5758","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"WTFXB4H4ANEX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WTFXB4H4ANEX5XEU","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WTFXB4H4","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WTFXB4H4ANEX5XEUZXWXKLP2UM","target":"record","payload":{"canonical_record":{"source":{"id":"1203.5758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-26T18:41:28Z","cross_cats_sorted":[],"title_canon_sha256":"e8fd1a05b206845c3d63cb8126677daa317d10f68d4f47374b5aa3f992686a2a","abstract_canon_sha256":"724fe66004c8b8d86800cfe4b4b41e3d535f1ce5eb58d7313a2393357d47c05f"},"schema_version":"1.0"},"canonical_sha256":"b4cb70f0fc03497edc94cded752dfaa32e63fcb82db595f9dfe2d9a5dd507582","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:53.869486Z","signature_b64":"2XwgwNWg2zksHaRAMM30ABbDPWdQNSqscLED7dc9NVrbPE2t1icWqLV/rDDas+VBiRJ8+XKMkHQYIFiM13HWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4cb70f0fc03497edc94cded752dfaa32e63fcb82db595f9dfe2d9a5dd507582","last_reissued_at":"2026-05-18T03:30:53.868737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:53.868737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.5758","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-18T03:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71xNFXhZe/jjyq33AWgOjbL6jqKFUxl44+NiewD2mUir6Q3PnYUY6CLwX/K1tgKQgBA+VfoC8jfF4CtXfIcXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:21:10.165584Z"},"content_sha256":"abb678069ce965fbae74bb66b6f504e42f950475dc835ff4abcc84459482fc3f","schema_version":"1.0","event_id":"sha256:abb678069ce965fbae74bb66b6f504e42f950475dc835ff4abcc84459482fc3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WTFXB4H4ANEX5XEUZXWXKLP2UM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a preferential attachment and generalized P\\'{o}lya's urn model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andrea Collevecchio, Codina Cotar, Marco LiCalzi","submitted_at":"2012-03-26T18:41:28Z","abstract_excerpt":"We study a general preferential attachment and Polya's urn model. At each step a new vertex is introduced, which can be connected to at most one existing vertex. If it is disconnected, it becomes a pioneer vertex. Given that it is not disconnected, it joins an existing pioneer vertex with probability proportional to a function of the degree of that vertex. This function is allowed to be vertex-dependent, and is called the reinforcement function. We prove that there can be at most three phases in this model, depending on the behavior of the reinforcement function. Consider the set whose element"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5758","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-18T03:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"py3MYZ4gu+C/LVYU8B/l6O/5AWOW0MiNSuuBZ7beESzoJdt34k1/g4ahHJAM0YzHf/Eq2Ue4rySVU94djAAHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:21:10.166340Z"},"content_sha256":"412d2593f0f0cf12612a1589d4080f7ae61af25b6321635d5ab08ead054f4479","schema_version":"1.0","event_id":"sha256:412d2593f0f0cf12612a1589d4080f7ae61af25b6321635d5ab08ead054f4479"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTFXB4H4ANEX5XEUZXWXKLP2UM/bundle.json","state_url":"https://pith.science/pith/WTFXB4H4ANEX5XEUZXWXKLP2UM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTFXB4H4ANEX5XEUZXWXKLP2UM/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-25T15:21:10Z","links":{"resolver":"https://pith.science/pith/WTFXB4H4ANEX5XEUZXWXKLP2UM","bundle":"https://pith.science/pith/WTFXB4H4ANEX5XEUZXWXKLP2UM/bundle.json","state":"https://pith.science/pith/WTFXB4H4ANEX5XEUZXWXKLP2UM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTFXB4H4ANEX5XEUZXWXKLP2UM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WTFXB4H4ANEX5XEUZXWXKLP2UM","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":"724fe66004c8b8d86800cfe4b4b41e3d535f1ce5eb58d7313a2393357d47c05f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-26T18:41:28Z","title_canon_sha256":"e8fd1a05b206845c3d63cb8126677daa317d10f68d4f47374b5aa3f992686a2a"},"schema_version":"1.0","source":{"id":"1203.5758","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5758","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5758v2","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5758","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"WTFXB4H4ANEX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WTFXB4H4ANEX5XEU","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WTFXB4H4","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:412d2593f0f0cf12612a1589d4080f7ae61af25b6321635d5ab08ead054f4479","target":"graph","created_at":"2026-05-18T03:30:53Z","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 study a general preferential attachment and Polya's urn model. At each step a new vertex is introduced, which can be connected to at most one existing vertex. If it is disconnected, it becomes a pioneer vertex. Given that it is not disconnected, it joins an existing pioneer vertex with probability proportional to a function of the degree of that vertex. This function is allowed to be vertex-dependent, and is called the reinforcement function. We prove that there can be at most three phases in this model, depending on the behavior of the reinforcement function. Consider the set whose element","authors_text":"Andrea Collevecchio, Codina Cotar, Marco LiCalzi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-26T18:41:28Z","title":"On a preferential attachment and generalized P\\'{o}lya's urn model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5758","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:abb678069ce965fbae74bb66b6f504e42f950475dc835ff4abcc84459482fc3f","target":"record","created_at":"2026-05-18T03:30:53Z","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":"724fe66004c8b8d86800cfe4b4b41e3d535f1ce5eb58d7313a2393357d47c05f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-26T18:41:28Z","title_canon_sha256":"e8fd1a05b206845c3d63cb8126677daa317d10f68d4f47374b5aa3f992686a2a"},"schema_version":"1.0","source":{"id":"1203.5758","kind":"arxiv","version":2}},"canonical_sha256":"b4cb70f0fc03497edc94cded752dfaa32e63fcb82db595f9dfe2d9a5dd507582","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4cb70f0fc03497edc94cded752dfaa32e63fcb82db595f9dfe2d9a5dd507582","first_computed_at":"2026-05-18T03:30:53.868737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:53.868737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2XwgwNWg2zksHaRAMM30ABbDPWdQNSqscLED7dc9NVrbPE2t1icWqLV/rDDas+VBiRJ8+XKMkHQYIFiM13HWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:53.869486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5758","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abb678069ce965fbae74bb66b6f504e42f950475dc835ff4abcc84459482fc3f","sha256:412d2593f0f0cf12612a1589d4080f7ae61af25b6321635d5ab08ead054f4479"],"state_sha256":"f52e46fd0831199e39aed6522a866c7f196333c3a974929263a31c114a9d0fec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUYsFrGvyjWS5Lgw7MV0+EiJvaOuc2v3j7dIXnj/ecF0VesBeSIaeMLrbnDWAfvfjamEFsHubH4qxYQo/YN0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:21:10.170256Z","bundle_sha256":"0a8fdf319dae86a3547c8be21229cbd82b14593c9d63442b648f30087978eb63"}}