{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:RC34LMNE2B5YGEGHO33ZDW3ZQM","short_pith_number":"pith:RC34LMNE","schema_version":"1.0","canonical_sha256":"88b7c5b1a4d07b8310c776f791db79833580ed8b681e2cad6df9e3cbc37034aa","source":{"kind":"arxiv","id":"1012.5550","version":2},"attestation_state":"computed","paper":{"title":"Vertices of high degree in the preferential attachment tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Graham Brightwell, Malwina J. Luczak","submitted_at":"2010-12-26T23:47:51Z","abstract_excerpt":"We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to one existing vertex, chosen with probability proportional to its degree. We investigate the number $D_t(\\ell)$ of vertices of each degree $\\ell$ at each time $t$, focussing particularly on the case where $\\ell$ is a growing function of $t$. We show that $D_t(\\ell)$ is concentrated around its mean, which is approximately $4t/\\ell^3$, for all $\\ell \\le (t/\\log t)^{-1/3}$; this is best possible up to a logarithmic factor."},"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":"1012.5550","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-12-26T23:47:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e73e913712cd906943f99f26f411f2db12ee8672f0324ffad63be8dd70191b06","abstract_canon_sha256":"548459c79e19f972e4b9cbf3b72445400d54575b2d13192aed302669ee820d6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:43.489712Z","signature_b64":"vpm+cBh9K2CjuGHkFoFfzczJ6Wca6tD+wm0Cbt/Ek0vOGPozwSXayFhjuF5QFWc4v1dlIwXZet2YxwcxEXckCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b7c5b1a4d07b8310c776f791db79833580ed8b681e2cad6df9e3cbc37034aa","last_reissued_at":"2026-05-18T04:03:43.488719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:43.488719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertices of high degree in the preferential attachment tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Graham Brightwell, Malwina J. Luczak","submitted_at":"2010-12-26T23:47:51Z","abstract_excerpt":"We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to one existing vertex, chosen with probability proportional to its degree. We investigate the number $D_t(\\ell)$ of vertices of each degree $\\ell$ at each time $t$, focussing particularly on the case where $\\ell$ is a growing function of $t$. We show that $D_t(\\ell)$ is concentrated around its mean, which is approximately $4t/\\ell^3$, for all $\\ell \\le (t/\\log t)^{-1/3}$; this is best possible up to a logarithmic factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5550","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.5550","created_at":"2026-05-18T04:03:43.488801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5550v2","created_at":"2026-05-18T04:03:43.488801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5550","created_at":"2026-05-18T04:03:43.488801+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC34LMNE2B5Y","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC34LMNE2B5YGEGH","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC34LMNE","created_at":"2026-05-18T12:26:13.927090+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/RC34LMNE2B5YGEGHO33ZDW3ZQM","json":"https://pith.science/pith/RC34LMNE2B5YGEGHO33ZDW3ZQM.json","graph_json":"https://pith.science/api/pith-number/RC34LMNE2B5YGEGHO33ZDW3ZQM/graph.json","events_json":"https://pith.science/api/pith-number/RC34LMNE2B5YGEGHO33ZDW3ZQM/events.json","paper":"https://pith.science/paper/RC34LMNE"},"agent_actions":{"view_html":"https://pith.science/pith/RC34LMNE2B5YGEGHO33ZDW3ZQM","download_json":"https://pith.science/pith/RC34LMNE2B5YGEGHO33ZDW3ZQM.json","view_paper":"https://pith.science/paper/RC34LMNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5550&json=true","fetch_graph":"https://pith.science/api/pith-number/RC34LMNE2B5YGEGHO33ZDW3ZQM/graph.json","fetch_events":"https://pith.science/api/pith-number/RC34LMNE2B5YGEGHO33ZDW3ZQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC34LMNE2B5YGEGHO33ZDW3ZQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC34LMNE2B5YGEGHO33ZDW3ZQM/action/storage_attestation","attest_author":"https://pith.science/pith/RC34LMNE2B5YGEGHO33ZDW3ZQM/action/author_attestation","sign_citation":"https://pith.science/pith/RC34LMNE2B5YGEGHO33ZDW3ZQM/action/citation_signature","submit_replication":"https://pith.science/pith/RC34LMNE2B5YGEGHO33ZDW3ZQM/action/replication_record"}},"created_at":"2026-05-18T04:03:43.488801+00:00","updated_at":"2026-05-18T04:03:43.488801+00:00"}