{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DW6HIILYHYRLDMUAS6VIJZTEPF","short_pith_number":"pith:DW6HIILY","schema_version":"1.0","canonical_sha256":"1dbc7421783e22b1b28097aa84e6647969d9cec9a079838b9b2ebb7eecc16d8d","source":{"kind":"arxiv","id":"1710.02159","version":1},"attestation_state":"computed","paper":{"title":"Preferential Attachment and Vertex Arrival Times","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.SI","math.ST","physics.soc-ph","stat.TH"],"primary_cat":"math.PR","authors_text":"Benjamin Bloem-Reddy, Peter Orbanz","submitted_at":"2017-10-05T18:01:09Z","abstract_excerpt":"We study preferential attachment mechanisms in random graphs that are parameterized by (i) a constant bias affecting the degree-biased distribution on the vertex set and (ii) the distribution of times at which new vertices are created by the model. The class of random graphs so defined admits a representation theorem reminiscent of residual allocation, or \"stick-breaking\" schemes. We characterize how the vertex arrival times affect the asymptotic degree distribution, and relate the latter to neutral-to-the-left processes. Our random graphs generate edges \"one end at a time\", which sets up a on"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1710.02159","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.PR","submitted_at":"2017-10-05T18:01:09Z","cross_cats_sorted":["cs.SI","math.ST","physics.soc-ph","stat.TH"],"title_canon_sha256":"e1769891a51099923b673503464dec5231fb09c891831940aac21dfcfade0047","abstract_canon_sha256":"bc3d0ddb0891c7cbbc12a2d557d9a4be3cfd28518ad7873f14135eea889759c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:34.314511Z","signature_b64":"HnEL1//up0cg6PuHLS9xDaKAamLU7wZbV4QhlBkT0HqfjXQd8XNKMrBoTVY/pogoHG9wvtmOFrGbf+TKUGlCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dbc7421783e22b1b28097aa84e6647969d9cec9a079838b9b2ebb7eecc16d8d","last_reissued_at":"2026-05-18T00:33:34.313780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:34.313780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preferential Attachment and Vertex Arrival Times","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.SI","math.ST","physics.soc-ph","stat.TH"],"primary_cat":"math.PR","authors_text":"Benjamin Bloem-Reddy, Peter Orbanz","submitted_at":"2017-10-05T18:01:09Z","abstract_excerpt":"We study preferential attachment mechanisms in random graphs that are parameterized by (i) a constant bias affecting the degree-biased distribution on the vertex set and (ii) the distribution of times at which new vertices are created by the model. The class of random graphs so defined admits a representation theorem reminiscent of residual allocation, or \"stick-breaking\" schemes. We characterize how the vertex arrival times affect the asymptotic degree distribution, and relate the latter to neutral-to-the-left processes. Our random graphs generate edges \"one end at a time\", which sets up a on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02159","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.02159","created_at":"2026-05-18T00:33:34.313904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02159v1","created_at":"2026-05-18T00:33:34.313904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02159","created_at":"2026-05-18T00:33:34.313904+00:00"},{"alias_kind":"pith_short_12","alias_value":"DW6HIILYHYRL","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DW6HIILYHYRLDMUA","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DW6HIILY","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DW6HIILYHYRLDMUAS6VIJZTEPF","json":"https://pith.science/pith/DW6HIILYHYRLDMUAS6VIJZTEPF.json","graph_json":"https://pith.science/api/pith-number/DW6HIILYHYRLDMUAS6VIJZTEPF/graph.json","events_json":"https://pith.science/api/pith-number/DW6HIILYHYRLDMUAS6VIJZTEPF/events.json","paper":"https://pith.science/paper/DW6HIILY"},"agent_actions":{"view_html":"https://pith.science/pith/DW6HIILYHYRLDMUAS6VIJZTEPF","download_json":"https://pith.science/pith/DW6HIILYHYRLDMUAS6VIJZTEPF.json","view_paper":"https://pith.science/paper/DW6HIILY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02159&json=true","fetch_graph":"https://pith.science/api/pith-number/DW6HIILYHYRLDMUAS6VIJZTEPF/graph.json","fetch_events":"https://pith.science/api/pith-number/DW6HIILYHYRLDMUAS6VIJZTEPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DW6HIILYHYRLDMUAS6VIJZTEPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DW6HIILYHYRLDMUAS6VIJZTEPF/action/storage_attestation","attest_author":"https://pith.science/pith/DW6HIILYHYRLDMUAS6VIJZTEPF/action/author_attestation","sign_citation":"https://pith.science/pith/DW6HIILYHYRLDMUAS6VIJZTEPF/action/citation_signature","submit_replication":"https://pith.science/pith/DW6HIILYHYRLDMUAS6VIJZTEPF/action/replication_record"}},"created_at":"2026-05-18T00:33:34.313904+00:00","updated_at":"2026-05-18T00:33:34.313904+00:00"}