{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4NIRMDXFHIXSLWVZHQPNPWFKE2","short_pith_number":"pith:4NIRMDXF","schema_version":"1.0","canonical_sha256":"e351160ee53a2f25dab93c1ed7d8aa26ab139fe084055c5f8a833d888891da16","source":{"kind":"arxiv","id":"1504.00754","version":2},"attestation_state":"computed","paper":{"title":"Analytical results for the distribution of shortest path lengths in random networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Daniel ben-Avraham, Eytan Katzav, Mor Nitzan, Nathan Ross, Ofer Biham, P.L. Krapivsky, Reimer K\\\"uhn","submitted_at":"2015-04-03T06:35:17Z","abstract_excerpt":"We present two complementary analytical approaches for calculating the distribution of shortest path lengths in Erdos-R\\'enyi networks, based on recursion equations for the shells around a reference node and for the paths originating from it. The results are in agreement with numerical simulations for a broad range of network sizes and connectivities. The average and standard deviation of the distribution are also obtained. In the case that the mean degree scales as $N^{\\alpha}$ with the network size, the distribution becomes extremely narrow in the asymptotic limit, namely almost all pairs of"},"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":"1504.00754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-04-03T06:35:17Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"3680d11d2b4e44ec6d624ccf8bcd90cb8684b9480da845ff05d669ddf3c10de4","abstract_canon_sha256":"5829c8088d32a1909ca5df3d0cf0a7a7b13de6fa66c382f4641826b246f6bb19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:20.280952Z","signature_b64":"vOgEF3WM6C25es60CSHi9iYpjVVWHxVKn177QGr0r7JbclZ7qtS1txbQmgD4R9kFLaifjTGgml8xmRuRQ2k5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e351160ee53a2f25dab93c1ed7d8aa26ab139fe084055c5f8a833d888891da16","last_reissued_at":"2026-05-18T01:35:20.280196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:20.280196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analytical results for the distribution of shortest path lengths in random networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Daniel ben-Avraham, Eytan Katzav, Mor Nitzan, Nathan Ross, Ofer Biham, P.L. Krapivsky, Reimer K\\\"uhn","submitted_at":"2015-04-03T06:35:17Z","abstract_excerpt":"We present two complementary analytical approaches for calculating the distribution of shortest path lengths in Erdos-R\\'enyi networks, based on recursion equations for the shells around a reference node and for the paths originating from it. The results are in agreement with numerical simulations for a broad range of network sizes and connectivities. The average and standard deviation of the distribution are also obtained. In the case that the mean degree scales as $N^{\\alpha}$ with the network size, the distribution becomes extremely narrow in the asymptotic limit, namely almost all pairs of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00754","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":"1504.00754","created_at":"2026-05-18T01:35:20.280327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00754v2","created_at":"2026-05-18T01:35:20.280327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00754","created_at":"2026-05-18T01:35:20.280327+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NIRMDXFHIXS","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NIRMDXFHIXSLWVZ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NIRMDXF","created_at":"2026-05-18T12:29:05.191682+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/4NIRMDXFHIXSLWVZHQPNPWFKE2","json":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2.json","graph_json":"https://pith.science/api/pith-number/4NIRMDXFHIXSLWVZHQPNPWFKE2/graph.json","events_json":"https://pith.science/api/pith-number/4NIRMDXFHIXSLWVZHQPNPWFKE2/events.json","paper":"https://pith.science/paper/4NIRMDXF"},"agent_actions":{"view_html":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2","download_json":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2.json","view_paper":"https://pith.science/paper/4NIRMDXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00754&json=true","fetch_graph":"https://pith.science/api/pith-number/4NIRMDXFHIXSLWVZHQPNPWFKE2/graph.json","fetch_events":"https://pith.science/api/pith-number/4NIRMDXFHIXSLWVZHQPNPWFKE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/action/storage_attestation","attest_author":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/action/author_attestation","sign_citation":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/action/citation_signature","submit_replication":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/action/replication_record"}},"created_at":"2026-05-18T01:35:20.280327+00:00","updated_at":"2026-05-18T01:35:20.280327+00:00"}