{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4NIRMDXFHIXSLWVZHQPNPWFKE2","short_pith_number":"pith:4NIRMDXF","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"},"canonical_sha256":"e351160ee53a2f25dab93c1ed7d8aa26ab139fe084055c5f8a833d888891da16","source":{"kind":"arxiv","id":"1504.00754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00754","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00754v2","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00754","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"pith_short_12","alias_value":"4NIRMDXFHIXS","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4NIRMDXFHIXSLWVZ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4NIRMDXF","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4NIRMDXFHIXSLWVZHQPNPWFKE2","target":"record","payload":{"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"},"canonical_sha256":"e351160ee53a2f25dab93c1ed7d8aa26ab139fe084055c5f8a833d888891da16","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"},"source_kind":"arxiv","source_id":"1504.00754","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCdsjTHNiy5nlODcW9UKoW1e/GiyPI5UdsyB3meFosxhx4QzcvyXyL/dkimx+HMiOQ95TT8GJz7I07NUwqW/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:50:11.573906Z"},"content_sha256":"0ee49db7d26f94df328235529c4494823256243c781870158af01710e52e94fc","schema_version":"1.0","event_id":"sha256:0ee49db7d26f94df328235529c4494823256243c781870158af01710e52e94fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4NIRMDXFHIXSLWVZHQPNPWFKE2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcZrPL0E+ktOHKvpgbS5JeoUwu3CJDkNKDqWgVeDqvQZeG+0pUJRUBWXxBSMxgOwE/vIs345FLZ2i/hTnB8oDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:50:11.574536Z"},"content_sha256":"2c32e52c08e6de29996296bb6bf896bd2b61030b4e7a78ab22a8a8a41fee06c6","schema_version":"1.0","event_id":"sha256:2c32e52c08e6de29996296bb6bf896bd2b61030b4e7a78ab22a8a8a41fee06c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/bundle.json","state_url":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T06:50:11Z","links":{"resolver":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2","bundle":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/bundle.json","state":"https://pith.science/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NIRMDXFHIXSLWVZHQPNPWFKE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4NIRMDXFHIXSLWVZHQPNPWFKE2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5829c8088d32a1909ca5df3d0cf0a7a7b13de6fa66c382f4641826b246f6bb19","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-04-03T06:35:17Z","title_canon_sha256":"3680d11d2b4e44ec6d624ccf8bcd90cb8684b9480da845ff05d669ddf3c10de4"},"schema_version":"1.0","source":{"id":"1504.00754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00754","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00754v2","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00754","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"pith_short_12","alias_value":"4NIRMDXFHIXS","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4NIRMDXFHIXSLWVZ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4NIRMDXF","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:2c32e52c08e6de29996296bb6bf896bd2b61030b4e7a78ab22a8a8a41fee06c6","target":"graph","created_at":"2026-05-18T01:35:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Daniel ben-Avraham, Eytan Katzav, Mor Nitzan, Nathan Ross, Ofer Biham, P.L. Krapivsky, Reimer K\\\"uhn","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-04-03T06:35:17Z","title":"Analytical results for the distribution of shortest path lengths in random networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00754","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0ee49db7d26f94df328235529c4494823256243c781870158af01710e52e94fc","target":"record","created_at":"2026-05-18T01:35:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5829c8088d32a1909ca5df3d0cf0a7a7b13de6fa66c382f4641826b246f6bb19","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-04-03T06:35:17Z","title_canon_sha256":"3680d11d2b4e44ec6d624ccf8bcd90cb8684b9480da845ff05d669ddf3c10de4"},"schema_version":"1.0","source":{"id":"1504.00754","kind":"arxiv","version":2}},"canonical_sha256":"e351160ee53a2f25dab93c1ed7d8aa26ab139fe084055c5f8a833d888891da16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e351160ee53a2f25dab93c1ed7d8aa26ab139fe084055c5f8a833d888891da16","first_computed_at":"2026-05-18T01:35:20.280196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:20.280196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vOgEF3WM6C25es60CSHi9iYpjVVWHxVKn177QGr0r7JbclZ7qtS1txbQmgD4R9kFLaifjTGgml8xmRuRQ2k5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:20.280952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ee49db7d26f94df328235529c4494823256243c781870158af01710e52e94fc","sha256:2c32e52c08e6de29996296bb6bf896bd2b61030b4e7a78ab22a8a8a41fee06c6"],"state_sha256":"da8d26af7b44a729dced3fd84f0faf4e38d13db4ebe3519cf27ad53ca517fb53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1mBDW5WQ8OrB+U+6hjeI1CkOF7cVXjD87sTfJjCjDxNcAQTQmIKPB/hfDSvdMQMgzUBOA8+LccDvzXxkre2vBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:50:11.577835Z","bundle_sha256":"5646ac5b978996c2219b8191180e680822ef4ee9d18a85558e58ab007695dd0b"}}