{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M6HJV2OBA4MRDWDMS7MB3QMY4P","short_pith_number":"pith:M6HJV2OB","schema_version":"1.0","canonical_sha256":"678e9ae9c1071911d86c97d81dc198e3e7b9dde352bc47e380b513926520dd4e","source":{"kind":"arxiv","id":"1610.01662","version":1},"attestation_state":"computed","paper":{"title":"Densification and Structural Transitions in Networks that Grow by Node Copying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"cond-mat.stat-mech","authors_text":"P. L. Krapivsky, R. Lambiotte, S. Redner, U. Bhat","submitted_at":"2016-10-05T21:37:21Z","abstract_excerpt":"We introduce a growing network model---the copying model---in which a new node attaches to a randomly selected target node and, in addition, independently to each of the neighbors of the target with copying probability $p$. When $p<\\frac{1}{2}$, this algorithm generates sparse networks, in which the average node degree is finite. A power-law degree distribution also arises, with a non-universal exponent whose value is determined by a transcendental equation in $p$. In the sparse regime, the network is \"normal\", e.g., the relative fluctuations in the number of links are asymptotically negligibl"},"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":"1610.01662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2016-10-05T21:37:21Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"dd920f5cbcf988c95284c849513ff229e5363154830fa6eb208741537a405908","abstract_canon_sha256":"48e2041a568cf618065556eb241d8248159258d278dc5881d765e0360a5597e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:07.345638Z","signature_b64":"2CqBoiBqn0HXRS/1ras5pfbjEKwQA6tPZkf6/gZkY3WcjNQg7sSA5TEwf5fvKe4b0xMqeMtJnEqK1zw5zRV2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"678e9ae9c1071911d86c97d81dc198e3e7b9dde352bc47e380b513926520dd4e","last_reissued_at":"2026-05-18T00:55:07.344908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:07.344908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Densification and Structural Transitions in Networks that Grow by Node Copying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"cond-mat.stat-mech","authors_text":"P. L. Krapivsky, R. Lambiotte, S. Redner, U. Bhat","submitted_at":"2016-10-05T21:37:21Z","abstract_excerpt":"We introduce a growing network model---the copying model---in which a new node attaches to a randomly selected target node and, in addition, independently to each of the neighbors of the target with copying probability $p$. When $p<\\frac{1}{2}$, this algorithm generates sparse networks, in which the average node degree is finite. A power-law degree distribution also arises, with a non-universal exponent whose value is determined by a transcendental equation in $p$. In the sparse regime, the network is \"normal\", e.g., the relative fluctuations in the number of links are asymptotically negligibl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01662","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":"1610.01662","created_at":"2026-05-18T00:55:07.345011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01662v1","created_at":"2026-05-18T00:55:07.345011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01662","created_at":"2026-05-18T00:55:07.345011+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6HJV2OBA4MR","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6HJV2OBA4MRDWDM","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6HJV2OB","created_at":"2026-05-18T12:30:29.479603+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/M6HJV2OBA4MRDWDMS7MB3QMY4P","json":"https://pith.science/pith/M6HJV2OBA4MRDWDMS7MB3QMY4P.json","graph_json":"https://pith.science/api/pith-number/M6HJV2OBA4MRDWDMS7MB3QMY4P/graph.json","events_json":"https://pith.science/api/pith-number/M6HJV2OBA4MRDWDMS7MB3QMY4P/events.json","paper":"https://pith.science/paper/M6HJV2OB"},"agent_actions":{"view_html":"https://pith.science/pith/M6HJV2OBA4MRDWDMS7MB3QMY4P","download_json":"https://pith.science/pith/M6HJV2OBA4MRDWDMS7MB3QMY4P.json","view_paper":"https://pith.science/paper/M6HJV2OB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01662&json=true","fetch_graph":"https://pith.science/api/pith-number/M6HJV2OBA4MRDWDMS7MB3QMY4P/graph.json","fetch_events":"https://pith.science/api/pith-number/M6HJV2OBA4MRDWDMS7MB3QMY4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6HJV2OBA4MRDWDMS7MB3QMY4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6HJV2OBA4MRDWDMS7MB3QMY4P/action/storage_attestation","attest_author":"https://pith.science/pith/M6HJV2OBA4MRDWDMS7MB3QMY4P/action/author_attestation","sign_citation":"https://pith.science/pith/M6HJV2OBA4MRDWDMS7MB3QMY4P/action/citation_signature","submit_replication":"https://pith.science/pith/M6HJV2OBA4MRDWDMS7MB3QMY4P/action/replication_record"}},"created_at":"2026-05-18T00:55:07.345011+00:00","updated_at":"2026-05-18T00:55:07.345011+00:00"}