{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X5BXC3AIJ6V5XCBZNSSBWD7PIX","short_pith_number":"pith:X5BXC3AI","schema_version":"1.0","canonical_sha256":"bf43716c084fabdb88396ca41b0fef45e8b96f6aeded6774279359ce83c4f12b","source":{"kind":"arxiv","id":"1806.01757","version":2},"attestation_state":"computed","paper":{"title":"Estimating Shortest Path Length Distributions via Random Walk Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.AP","authors_text":"Bruce D. Spencer, Minhui Zheng","submitted_at":"2018-06-05T15:54:50Z","abstract_excerpt":"In a network, the shortest paths between nodes are of great importance as they allow the fastest and strongest interaction between nodes. However measuring the shortest paths between all nodes in a large network is computationally expensive. In this paper we propose a method to estimate the shortest path length (SPL) distribution of a network by random walk sampling. To deal with the unequal inclusion probabilities of dyads (pairs of nodes) in the sample, we generalize the usage of Hansen-Hurwitz estimator and Horvitz-Thompson estimator (and their ratio forms) and apply them to the sampled dya"},"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":"1806.01757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2018-06-05T15:54:50Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"2d7aca188d173b6083108ee8aa043e0a33e60ddb6fa8a65d2b43ff58dbb2b9d6","abstract_canon_sha256":"abb8f85bf1a2abd1506f0ba2503b53e93f6f6c2761fe2bef46d17f4d51d8f46a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:43.976860Z","signature_b64":"RmS0nBJqNZ3qPKkkjGgNEDiz+6CyZeuFAC2/xC1O5Avq6Vsgrh0VZiQrr+6GmABWn7dTErR/GqUGJn8/KlyGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf43716c084fabdb88396ca41b0fef45e8b96f6aeded6774279359ce83c4f12b","last_reissued_at":"2026-05-18T00:13:43.976163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:43.976163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating Shortest Path Length Distributions via Random Walk Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.AP","authors_text":"Bruce D. Spencer, Minhui Zheng","submitted_at":"2018-06-05T15:54:50Z","abstract_excerpt":"In a network, the shortest paths between nodes are of great importance as they allow the fastest and strongest interaction between nodes. However measuring the shortest paths between all nodes in a large network is computationally expensive. In this paper we propose a method to estimate the shortest path length (SPL) distribution of a network by random walk sampling. To deal with the unequal inclusion probabilities of dyads (pairs of nodes) in the sample, we generalize the usage of Hansen-Hurwitz estimator and Horvitz-Thompson estimator (and their ratio forms) and apply them to the sampled dya"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01757","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":"1806.01757","created_at":"2026-05-18T00:13:43.976277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01757v2","created_at":"2026-05-18T00:13:43.976277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01757","created_at":"2026-05-18T00:13:43.976277+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5BXC3AIJ6V5","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5BXC3AIJ6V5XCBZ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5BXC3AI","created_at":"2026-05-18T12:33:01.666342+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/X5BXC3AIJ6V5XCBZNSSBWD7PIX","json":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX.json","graph_json":"https://pith.science/api/pith-number/X5BXC3AIJ6V5XCBZNSSBWD7PIX/graph.json","events_json":"https://pith.science/api/pith-number/X5BXC3AIJ6V5XCBZNSSBWD7PIX/events.json","paper":"https://pith.science/paper/X5BXC3AI"},"agent_actions":{"view_html":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX","download_json":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX.json","view_paper":"https://pith.science/paper/X5BXC3AI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01757&json=true","fetch_graph":"https://pith.science/api/pith-number/X5BXC3AIJ6V5XCBZNSSBWD7PIX/graph.json","fetch_events":"https://pith.science/api/pith-number/X5BXC3AIJ6V5XCBZNSSBWD7PIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/action/storage_attestation","attest_author":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/action/author_attestation","sign_citation":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/action/citation_signature","submit_replication":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/action/replication_record"}},"created_at":"2026-05-18T00:13:43.976277+00:00","updated_at":"2026-05-18T00:13:43.976277+00:00"}