{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MZU2X2ZWMYEZRKBZPPLV6UEKYQ","short_pith_number":"pith:MZU2X2ZW","schema_version":"1.0","canonical_sha256":"6669abeb36660998a8397bd75f508ac4311d9fed0039a9793bf5afe424916bb3","source":{"kind":"arxiv","id":"1708.07177","version":1},"attestation_state":"computed","paper":{"title":"The distribution of shortest path lengths in a class of node duplication network models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Chanania Steinbock, Eytan Katzav, Ofer Biham","submitted_at":"2017-08-23T20:18:44Z","abstract_excerpt":"We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability $p$ to each one of i"},"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":"1708.07177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-08-23T20:18:44Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"5af0c39ce0319afc44a6705eba77e5177532bd37979c5ed962eafa849bd159fc","abstract_canon_sha256":"2560ad3f9c9fd74e5dce13439476fbb4c219366b07363453cd75ee411fcecbc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:08.236433Z","signature_b64":"OqsH9NDhU4gWb1JHTjWFxo7KD0M3YEml6y3fJFTADCAdvgMMdEea/HUbt9iUCG2H5tiwOBo9w9HdDaut6ykQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6669abeb36660998a8397bd75f508ac4311d9fed0039a9793bf5afe424916bb3","last_reissued_at":"2026-05-18T00:36:08.235727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:08.235727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The distribution of shortest path lengths in a class of node duplication network models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Chanania Steinbock, Eytan Katzav, Ofer Biham","submitted_at":"2017-08-23T20:18:44Z","abstract_excerpt":"We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability $p$ to each one of i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07177","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":"1708.07177","created_at":"2026-05-18T00:36:08.235839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07177v1","created_at":"2026-05-18T00:36:08.235839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07177","created_at":"2026-05-18T00:36:08.235839+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZU2X2ZWMYEZ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZU2X2ZWMYEZRKBZ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZU2X2ZW","created_at":"2026-05-18T12:31:31.346846+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/MZU2X2ZWMYEZRKBZPPLV6UEKYQ","json":"https://pith.science/pith/MZU2X2ZWMYEZRKBZPPLV6UEKYQ.json","graph_json":"https://pith.science/api/pith-number/MZU2X2ZWMYEZRKBZPPLV6UEKYQ/graph.json","events_json":"https://pith.science/api/pith-number/MZU2X2ZWMYEZRKBZPPLV6UEKYQ/events.json","paper":"https://pith.science/paper/MZU2X2ZW"},"agent_actions":{"view_html":"https://pith.science/pith/MZU2X2ZWMYEZRKBZPPLV6UEKYQ","download_json":"https://pith.science/pith/MZU2X2ZWMYEZRKBZPPLV6UEKYQ.json","view_paper":"https://pith.science/paper/MZU2X2ZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07177&json=true","fetch_graph":"https://pith.science/api/pith-number/MZU2X2ZWMYEZRKBZPPLV6UEKYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MZU2X2ZWMYEZRKBZPPLV6UEKYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZU2X2ZWMYEZRKBZPPLV6UEKYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZU2X2ZWMYEZRKBZPPLV6UEKYQ/action/storage_attestation","attest_author":"https://pith.science/pith/MZU2X2ZWMYEZRKBZPPLV6UEKYQ/action/author_attestation","sign_citation":"https://pith.science/pith/MZU2X2ZWMYEZRKBZPPLV6UEKYQ/action/citation_signature","submit_replication":"https://pith.science/pith/MZU2X2ZWMYEZRKBZPPLV6UEKYQ/action/replication_record"}},"created_at":"2026-05-18T00:36:08.235839+00:00","updated_at":"2026-05-18T00:36:08.235839+00:00"}