{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FSWOMXKZ4JD67ISM5AWNKD6ILQ","short_pith_number":"pith:FSWOMXKZ","schema_version":"1.0","canonical_sha256":"2cace65d59e247efa24ce82cd50fc85c3b0cd5dd8b668413834fde065c94aa2f","source":{"kind":"arxiv","id":"1401.0933","version":1},"attestation_state":"computed","paper":{"title":"On the degree distribution of a growing network model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linda Farczadi, Nicholas Wormald","submitted_at":"2014-01-05T19:44:55Z","abstract_excerpt":"In this note we make some specific observations on the distribution of the degree of a given vertex in certain model of randomly growing networks. The rule for network growth is the following. Starting with an initial graph of minimum degree at least $k$, new vertices are added one by one. Each new vertex $v$ first chooses a random vertex $w$ to join to, where the probability of choosing $w$ is proportional to its degree. Then $k$ edges are added from $v$ to randomly chosen neighbours of $w$."},"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":"1401.0933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-05T19:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"157250ef343eab40044123c5fe3be804c42f7346cf4f57583903d8d5056e284e","abstract_canon_sha256":"4787e0f945f5033eac6a481d0f42fd3baad49ccd95a24f9483d1762c968c6d72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:11.483370Z","signature_b64":"remprCZa/5wbxVB2L/RRuwVZqjHGLZLm//wHeV8CuNkzT+UNVWPfCx2149Og5eM1d2KEwG2ZxGYV6/3muAs6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cace65d59e247efa24ce82cd50fc85c3b0cd5dd8b668413834fde065c94aa2f","last_reissued_at":"2026-05-18T03:03:11.482695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:11.482695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the degree distribution of a growing network model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linda Farczadi, Nicholas Wormald","submitted_at":"2014-01-05T19:44:55Z","abstract_excerpt":"In this note we make some specific observations on the distribution of the degree of a given vertex in certain model of randomly growing networks. The rule for network growth is the following. Starting with an initial graph of minimum degree at least $k$, new vertices are added one by one. Each new vertex $v$ first chooses a random vertex $w$ to join to, where the probability of choosing $w$ is proportional to its degree. Then $k$ edges are added from $v$ to randomly chosen neighbours of $w$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0933","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":"1401.0933","created_at":"2026-05-18T03:03:11.482817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0933v1","created_at":"2026-05-18T03:03:11.482817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0933","created_at":"2026-05-18T03:03:11.482817+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSWOMXKZ4JD6","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSWOMXKZ4JD67ISM","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSWOMXKZ","created_at":"2026-05-18T12:28:28.263976+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/FSWOMXKZ4JD67ISM5AWNKD6ILQ","json":"https://pith.science/pith/FSWOMXKZ4JD67ISM5AWNKD6ILQ.json","graph_json":"https://pith.science/api/pith-number/FSWOMXKZ4JD67ISM5AWNKD6ILQ/graph.json","events_json":"https://pith.science/api/pith-number/FSWOMXKZ4JD67ISM5AWNKD6ILQ/events.json","paper":"https://pith.science/paper/FSWOMXKZ"},"agent_actions":{"view_html":"https://pith.science/pith/FSWOMXKZ4JD67ISM5AWNKD6ILQ","download_json":"https://pith.science/pith/FSWOMXKZ4JD67ISM5AWNKD6ILQ.json","view_paper":"https://pith.science/paper/FSWOMXKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0933&json=true","fetch_graph":"https://pith.science/api/pith-number/FSWOMXKZ4JD67ISM5AWNKD6ILQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FSWOMXKZ4JD67ISM5AWNKD6ILQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSWOMXKZ4JD67ISM5AWNKD6ILQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSWOMXKZ4JD67ISM5AWNKD6ILQ/action/storage_attestation","attest_author":"https://pith.science/pith/FSWOMXKZ4JD67ISM5AWNKD6ILQ/action/author_attestation","sign_citation":"https://pith.science/pith/FSWOMXKZ4JD67ISM5AWNKD6ILQ/action/citation_signature","submit_replication":"https://pith.science/pith/FSWOMXKZ4JD67ISM5AWNKD6ILQ/action/replication_record"}},"created_at":"2026-05-18T03:03:11.482817+00:00","updated_at":"2026-05-18T03:03:11.482817+00:00"}