{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OF3DQFDD7Z62DMO4FYM7QLDJDY","short_pith_number":"pith:OF3DQFDD","schema_version":"1.0","canonical_sha256":"7176381463fe7da1b1dc2e19f82c691e10c4cfff9f7d1cb20a7d9f9661e93520","source":{"kind":"arxiv","id":"1707.05064","version":3},"attestation_state":"computed","paper":{"title":"Asymptotic degree distribution in preferential attachment graph models with multiple type edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"\\'Agnes Backhausz, Bence Rozner","submitted_at":"2017-07-17T09:52:52Z","abstract_excerpt":"We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the $N$-type case, we define the (generalized) degree of a given vertex as $\\boldsymbol{d}=(d_{1},d_{2},\\dots,d_{N})$, where $d_{k}\\in\\mathbb{Z}_{0}^{+}$ is the number of type $k$ edges connected to it. We prove the existence of an a.s.\\ asymptotic degree distribution for a general family of preferential attachment random graph models with multi-type edges. More precisely, we show that the proportion of vertices with (genera"},"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":"1707.05064","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-17T09:52:52Z","cross_cats_sorted":[],"title_canon_sha256":"bbceb30c9964f29362c331e3113757176e82690ebe97844c9ccf25ede9c7ef1c","abstract_canon_sha256":"aad2be9f90f6452c6596584e0f373e068206eb22017f4674e285696d2abf39d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:42.939102Z","signature_b64":"cg5bAanEbSzRH6B4McIP8x9AzHvYQZf6mD30Js8CVm08MC7RgN/KFlXRXV8CYD2zCwbMxhEkVDq2AGYVLmo0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7176381463fe7da1b1dc2e19f82c691e10c4cfff9f7d1cb20a7d9f9661e93520","last_reissued_at":"2026-05-17T23:50:42.938518Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:42.938518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic degree distribution in preferential attachment graph models with multiple type edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"\\'Agnes Backhausz, Bence Rozner","submitted_at":"2017-07-17T09:52:52Z","abstract_excerpt":"We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the $N$-type case, we define the (generalized) degree of a given vertex as $\\boldsymbol{d}=(d_{1},d_{2},\\dots,d_{N})$, where $d_{k}\\in\\mathbb{Z}_{0}^{+}$ is the number of type $k$ edges connected to it. We prove the existence of an a.s.\\ asymptotic degree distribution for a general family of preferential attachment random graph models with multi-type edges. More precisely, we show that the proportion of vertices with (genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05064","kind":"arxiv","version":3},"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":"1707.05064","created_at":"2026-05-17T23:50:42.938617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05064v3","created_at":"2026-05-17T23:50:42.938617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05064","created_at":"2026-05-17T23:50:42.938617+00:00"},{"alias_kind":"pith_short_12","alias_value":"OF3DQFDD7Z62","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OF3DQFDD7Z62DMO4","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OF3DQFDD","created_at":"2026-05-18T12:31:34.259226+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/OF3DQFDD7Z62DMO4FYM7QLDJDY","json":"https://pith.science/pith/OF3DQFDD7Z62DMO4FYM7QLDJDY.json","graph_json":"https://pith.science/api/pith-number/OF3DQFDD7Z62DMO4FYM7QLDJDY/graph.json","events_json":"https://pith.science/api/pith-number/OF3DQFDD7Z62DMO4FYM7QLDJDY/events.json","paper":"https://pith.science/paper/OF3DQFDD"},"agent_actions":{"view_html":"https://pith.science/pith/OF3DQFDD7Z62DMO4FYM7QLDJDY","download_json":"https://pith.science/pith/OF3DQFDD7Z62DMO4FYM7QLDJDY.json","view_paper":"https://pith.science/paper/OF3DQFDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05064&json=true","fetch_graph":"https://pith.science/api/pith-number/OF3DQFDD7Z62DMO4FYM7QLDJDY/graph.json","fetch_events":"https://pith.science/api/pith-number/OF3DQFDD7Z62DMO4FYM7QLDJDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OF3DQFDD7Z62DMO4FYM7QLDJDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OF3DQFDD7Z62DMO4FYM7QLDJDY/action/storage_attestation","attest_author":"https://pith.science/pith/OF3DQFDD7Z62DMO4FYM7QLDJDY/action/author_attestation","sign_citation":"https://pith.science/pith/OF3DQFDD7Z62DMO4FYM7QLDJDY/action/citation_signature","submit_replication":"https://pith.science/pith/OF3DQFDD7Z62DMO4FYM7QLDJDY/action/replication_record"}},"created_at":"2026-05-17T23:50:42.938617+00:00","updated_at":"2026-05-17T23:50:42.938617+00:00"}