{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FSS5YHE4DRCYVRWCNKHDTF5Q36","short_pith_number":"pith:FSS5YHE4","schema_version":"1.0","canonical_sha256":"2ca5dc1c9c1c458ac6c26a8e3997b0dfa098a1669dc11690ee0badc7ccb8a28d","source":{"kind":"arxiv","id":"1201.1363","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Random Walk Sampling in Distributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Atish Das Sarma, Gopal Pandurangan","submitted_at":"2012-01-06T08:16:45Z","abstract_excerpt":"Performing random walks in networks is a fundamental primitive that has found numerous applications in communication networks such as token management, load balancing, network topology discovery and construction, search, and peer-to-peer membership management. While several such algorithms are ubiquitous, and use numerous random walk samples, the walks themselves have always been performed naively.\n  In this paper, we focus on the problem of performing random walk sampling efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds and messag"},"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":"1201.1363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-06T08:16:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8d84e6745012589f9464f6169dd2210c3dc05e66547f1f1532fda6b87de56398","abstract_canon_sha256":"e7d1324b1adb9b9f176bf064c8721856f0fc1d799ae5945ce1397381dc53fdc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:52.945811Z","signature_b64":"h/EVK3XSs8m9+mkZcB+mEzT0S2B2UsInA4yWdj5DChAL6oXL6A8r+6M1n9LyGRa2uvS7tk2yBwIRuK/Lzt6qDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ca5dc1c9c1c458ac6c26a8e3997b0dfa098a1669dc11690ee0badc7ccb8a28d","last_reissued_at":"2026-05-18T04:04:52.945196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:52.945196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Random Walk Sampling in Distributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Atish Das Sarma, Gopal Pandurangan","submitted_at":"2012-01-06T08:16:45Z","abstract_excerpt":"Performing random walks in networks is a fundamental primitive that has found numerous applications in communication networks such as token management, load balancing, network topology discovery and construction, search, and peer-to-peer membership management. While several such algorithms are ubiquitous, and use numerous random walk samples, the walks themselves have always been performed naively.\n  In this paper, we focus on the problem of performing random walk sampling efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds and messag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1363","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":"1201.1363","created_at":"2026-05-18T04:04:52.945282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1363v2","created_at":"2026-05-18T04:04:52.945282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1363","created_at":"2026-05-18T04:04:52.945282+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSS5YHE4DRCY","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSS5YHE4DRCYVRWC","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSS5YHE4","created_at":"2026-05-18T12:27:06.952714+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/FSS5YHE4DRCYVRWCNKHDTF5Q36","json":"https://pith.science/pith/FSS5YHE4DRCYVRWCNKHDTF5Q36.json","graph_json":"https://pith.science/api/pith-number/FSS5YHE4DRCYVRWCNKHDTF5Q36/graph.json","events_json":"https://pith.science/api/pith-number/FSS5YHE4DRCYVRWCNKHDTF5Q36/events.json","paper":"https://pith.science/paper/FSS5YHE4"},"agent_actions":{"view_html":"https://pith.science/pith/FSS5YHE4DRCYVRWCNKHDTF5Q36","download_json":"https://pith.science/pith/FSS5YHE4DRCYVRWCNKHDTF5Q36.json","view_paper":"https://pith.science/paper/FSS5YHE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1363&json=true","fetch_graph":"https://pith.science/api/pith-number/FSS5YHE4DRCYVRWCNKHDTF5Q36/graph.json","fetch_events":"https://pith.science/api/pith-number/FSS5YHE4DRCYVRWCNKHDTF5Q36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSS5YHE4DRCYVRWCNKHDTF5Q36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSS5YHE4DRCYVRWCNKHDTF5Q36/action/storage_attestation","attest_author":"https://pith.science/pith/FSS5YHE4DRCYVRWCNKHDTF5Q36/action/author_attestation","sign_citation":"https://pith.science/pith/FSS5YHE4DRCYVRWCNKHDTF5Q36/action/citation_signature","submit_replication":"https://pith.science/pith/FSS5YHE4DRCYVRWCNKHDTF5Q36/action/replication_record"}},"created_at":"2026-05-18T04:04:52.945282+00:00","updated_at":"2026-05-18T04:04:52.945282+00:00"}