{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X5BXC3AIJ6V5XCBZNSSBWD7PIX","short_pith_number":"pith:X5BXC3AI","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"},"canonical_sha256":"bf43716c084fabdb88396ca41b0fef45e8b96f6aeded6774279359ce83c4f12b","source":{"kind":"arxiv","id":"1806.01757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01757","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01757v2","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01757","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"X5BXC3AIJ6V5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X5BXC3AIJ6V5XCBZ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X5BXC3AI","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X5BXC3AIJ6V5XCBZNSSBWD7PIX","target":"record","payload":{"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"},"canonical_sha256":"bf43716c084fabdb88396ca41b0fef45e8b96f6aeded6774279359ce83c4f12b","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"},"source_kind":"arxiv","source_id":"1806.01757","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-18T00:13:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68KIVq/kp/exZ903+cvmBTBcJ3zaJt11uAC1rKZZDDFIiLN+fMmS7uM1gYUjXTiJ5sNYq5oYfFeUNCF6swIAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:42:53.513442Z"},"content_sha256":"a4f5a572db3eac3e252d2adf588cd774bc49cf1671dfe8628d8ac20be24f1ee6","schema_version":"1.0","event_id":"sha256:a4f5a572db3eac3e252d2adf588cd774bc49cf1671dfe8628d8ac20be24f1ee6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X5BXC3AIJ6V5XCBZNSSBWD7PIX","target":"graph","payload":{"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"},"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-18T00:13:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GatjV4pKCwIEkH+opWmzA+G+r8AE0TN73SVgpLzeTwAgv0wACBf4QBSNSOnk3BcFFkE1fL/ijcYBAJ3m+OjuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:42:53.514195Z"},"content_sha256":"8eb38bff6e3fae996ad3f9eabd48523c9d251b84e543d95a7b3614c4fbe5b995","schema_version":"1.0","event_id":"sha256:8eb38bff6e3fae996ad3f9eabd48523c9d251b84e543d95a7b3614c4fbe5b995"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/bundle.json","state_url":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/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-31T19:42:53Z","links":{"resolver":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX","bundle":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/bundle.json","state":"https://pith.science/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5BXC3AIJ6V5XCBZNSSBWD7PIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X5BXC3AIJ6V5XCBZNSSBWD7PIX","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":"abb8f85bf1a2abd1506f0ba2503b53e93f6f6c2761fe2bef46d17f4d51d8f46a","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2018-06-05T15:54:50Z","title_canon_sha256":"2d7aca188d173b6083108ee8aa043e0a33e60ddb6fa8a65d2b43ff58dbb2b9d6"},"schema_version":"1.0","source":{"id":"1806.01757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01757","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01757v2","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01757","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"X5BXC3AIJ6V5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X5BXC3AIJ6V5XCBZ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X5BXC3AI","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:8eb38bff6e3fae996ad3f9eabd48523c9d251b84e543d95a7b3614c4fbe5b995","target":"graph","created_at":"2026-05-18T00:13:43Z","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":"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","authors_text":"Bruce D. Spencer, Minhui Zheng","cross_cats":["cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2018-06-05T15:54:50Z","title":"Estimating Shortest Path Length Distributions via Random Walk Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01757","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:a4f5a572db3eac3e252d2adf588cd774bc49cf1671dfe8628d8ac20be24f1ee6","target":"record","created_at":"2026-05-18T00:13:43Z","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":"abb8f85bf1a2abd1506f0ba2503b53e93f6f6c2761fe2bef46d17f4d51d8f46a","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2018-06-05T15:54:50Z","title_canon_sha256":"2d7aca188d173b6083108ee8aa043e0a33e60ddb6fa8a65d2b43ff58dbb2b9d6"},"schema_version":"1.0","source":{"id":"1806.01757","kind":"arxiv","version":2}},"canonical_sha256":"bf43716c084fabdb88396ca41b0fef45e8b96f6aeded6774279359ce83c4f12b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf43716c084fabdb88396ca41b0fef45e8b96f6aeded6774279359ce83c4f12b","first_computed_at":"2026-05-18T00:13:43.976163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:43.976163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RmS0nBJqNZ3qPKkkjGgNEDiz+6CyZeuFAC2/xC1O5Avq6Vsgrh0VZiQrr+6GmABWn7dTErR/GqUGJn8/KlyGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:43.976860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4f5a572db3eac3e252d2adf588cd774bc49cf1671dfe8628d8ac20be24f1ee6","sha256:8eb38bff6e3fae996ad3f9eabd48523c9d251b84e543d95a7b3614c4fbe5b995"],"state_sha256":"21201db0361a824a4e2ba146e2874f45e5893396ffa1a68e3fff7be10b83c030"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJbeZkHBbWppijxCVYWx+aby+AvvwNI/Wqb+xCy409lLFBuqf1ELTgcySBqr2EQy3St7g0TOZd1hmASp16XQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:42:53.518607Z","bundle_sha256":"2b91eb745ada8533e935d56c9d48377693267757b1f85b007024bcef423248b5"}}