{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4K6LL5YWS434YZUICS2JEVMEPY","short_pith_number":"pith:4K6LL5YW","schema_version":"1.0","canonical_sha256":"e2bcb5f7169737cc668814b49255847e388ea96265310647180b73d5353ade79","source":{"kind":"arxiv","id":"1407.0343","version":2},"attestation_state":"computed","paper":{"title":"Expected degree of finite preferential attachment networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.AO"],"primary_cat":"cs.SI","authors_text":"Michael Small","submitted_at":"2014-06-30T07:48:29Z","abstract_excerpt":"We provide an analytic expression for the quantity described in the title. Namely, we perform a preferential attachment growth process to generate a scale-free network. At each stage we add a new node with $m$ new links. Let $k$ denote the degree of a node, and $N$ the number of nodes in the network. The degree distribution is assumed to converge to a power-law (for $k\\geq m$) of the form $k^{-\\gamma}$ and we obtain an exact implicit relationship for $\\gamma$, $m$ and $N$. We verify this with numerical calculations over several orders of magnitude. Although this expression is exact, it provide"},"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":"1407.0343","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-30T07:48:29Z","cross_cats_sorted":["nlin.AO"],"title_canon_sha256":"75deedf220ade849a5e299d10665bb9a5e2f8fd29aa5b6c49300a5d60cef874e","abstract_canon_sha256":"fdd17710364a48fcbb018ee6448a51a6aa161319e8cb98c08664f670fc6714c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:22.963548Z","signature_b64":"XIxbYioFzrFOJGXsMWGBLuqscIcY7wTFVhUJuW0AsgTKqt6utZAeUVg5AyDrDyHUuOymr5RxWjebIjl8uF8MBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2bcb5f7169737cc668814b49255847e388ea96265310647180b73d5353ade79","last_reissued_at":"2026-05-18T02:45:22.963135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:22.963135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expected degree of finite preferential attachment networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.AO"],"primary_cat":"cs.SI","authors_text":"Michael Small","submitted_at":"2014-06-30T07:48:29Z","abstract_excerpt":"We provide an analytic expression for the quantity described in the title. Namely, we perform a preferential attachment growth process to generate a scale-free network. At each stage we add a new node with $m$ new links. Let $k$ denote the degree of a node, and $N$ the number of nodes in the network. The degree distribution is assumed to converge to a power-law (for $k\\geq m$) of the form $k^{-\\gamma}$ and we obtain an exact implicit relationship for $\\gamma$, $m$ and $N$. We verify this with numerical calculations over several orders of magnitude. Although this expression is exact, it provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0343","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":"1407.0343","created_at":"2026-05-18T02:45:22.963190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0343v2","created_at":"2026-05-18T02:45:22.963190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0343","created_at":"2026-05-18T02:45:22.963190+00:00"},{"alias_kind":"pith_short_12","alias_value":"4K6LL5YWS434","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4K6LL5YWS434YZUI","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4K6LL5YW","created_at":"2026-05-18T12:28:14.216126+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/4K6LL5YWS434YZUICS2JEVMEPY","json":"https://pith.science/pith/4K6LL5YWS434YZUICS2JEVMEPY.json","graph_json":"https://pith.science/api/pith-number/4K6LL5YWS434YZUICS2JEVMEPY/graph.json","events_json":"https://pith.science/api/pith-number/4K6LL5YWS434YZUICS2JEVMEPY/events.json","paper":"https://pith.science/paper/4K6LL5YW"},"agent_actions":{"view_html":"https://pith.science/pith/4K6LL5YWS434YZUICS2JEVMEPY","download_json":"https://pith.science/pith/4K6LL5YWS434YZUICS2JEVMEPY.json","view_paper":"https://pith.science/paper/4K6LL5YW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0343&json=true","fetch_graph":"https://pith.science/api/pith-number/4K6LL5YWS434YZUICS2JEVMEPY/graph.json","fetch_events":"https://pith.science/api/pith-number/4K6LL5YWS434YZUICS2JEVMEPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4K6LL5YWS434YZUICS2JEVMEPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4K6LL5YWS434YZUICS2JEVMEPY/action/storage_attestation","attest_author":"https://pith.science/pith/4K6LL5YWS434YZUICS2JEVMEPY/action/author_attestation","sign_citation":"https://pith.science/pith/4K6LL5YWS434YZUICS2JEVMEPY/action/citation_signature","submit_replication":"https://pith.science/pith/4K6LL5YWS434YZUICS2JEVMEPY/action/replication_record"}},"created_at":"2026-05-18T02:45:22.963190+00:00","updated_at":"2026-05-18T02:45:22.963190+00:00"}