{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2JSKJQ23D5EDHJQCZ5TUB7YIIL","short_pith_number":"pith:2JSKJQ23","schema_version":"1.0","canonical_sha256":"d264a4c35b1f4833a602cf6740ff0842d3ef61445d4f54fba0366571ba49667f","source":{"kind":"arxiv","id":"1205.5925","version":1},"attestation_state":"computed","paper":{"title":"Multiple Random Walks to Uncover Short Paths in Power Law Networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bruno Ribeiro, Don Towsley, Prithwish Basu","submitted_at":"2012-05-26T22:57:01Z","abstract_excerpt":"Consider the following routing problem in the context of a large scale network $G$, with particular interest paid to power law networks, although our results do not assume a particular degree distribution. A small number of nodes want to exchange messages and are looking for short paths on $G$. These nodes do not have access to the topology of $G$ but are allowed to crawl the network within a limited budget. Only crawlers whose sample paths cross are allowed to exchange topological information. In this work we study the use of random walks (RWs) to crawl $G$. We show that the ability of RWs to"},"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":"1205.5925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SI","submitted_at":"2012-05-26T22:57:01Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"a56ef525f8087186e4106bc266a429ffaf14d3ce8542a22b8ec665fd4ec7592b","abstract_canon_sha256":"ed95977ba02efa296d2e562ca690cec5c486c508d488b456a7377e0463c6cac5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:09.373038Z","signature_b64":"QMVlIxweaxznlkLrV0lbQzAgjLjBhZbjoFNngWIu/lJuruKYcgVqnJ8z33wpTi1qxfg8dRElSiYyGW5qgad7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d264a4c35b1f4833a602cf6740ff0842d3ef61445d4f54fba0366571ba49667f","last_reissued_at":"2026-05-18T02:21:09.372586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:09.372586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple Random Walks to Uncover Short Paths in Power Law Networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bruno Ribeiro, Don Towsley, Prithwish Basu","submitted_at":"2012-05-26T22:57:01Z","abstract_excerpt":"Consider the following routing problem in the context of a large scale network $G$, with particular interest paid to power law networks, although our results do not assume a particular degree distribution. A small number of nodes want to exchange messages and are looking for short paths on $G$. These nodes do not have access to the topology of $G$ but are allowed to crawl the network within a limited budget. Only crawlers whose sample paths cross are allowed to exchange topological information. In this work we study the use of random walks (RWs) to crawl $G$. We show that the ability of RWs to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5925","kind":"arxiv","version":1},"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":"1205.5925","created_at":"2026-05-18T02:21:09.372656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.5925v1","created_at":"2026-05-18T02:21:09.372656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5925","created_at":"2026-05-18T02:21:09.372656+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JSKJQ23D5ED","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JSKJQ23D5EDHJQC","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JSKJQ23","created_at":"2026-05-18T12:26:50.516681+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/2JSKJQ23D5EDHJQCZ5TUB7YIIL","json":"https://pith.science/pith/2JSKJQ23D5EDHJQCZ5TUB7YIIL.json","graph_json":"https://pith.science/api/pith-number/2JSKJQ23D5EDHJQCZ5TUB7YIIL/graph.json","events_json":"https://pith.science/api/pith-number/2JSKJQ23D5EDHJQCZ5TUB7YIIL/events.json","paper":"https://pith.science/paper/2JSKJQ23"},"agent_actions":{"view_html":"https://pith.science/pith/2JSKJQ23D5EDHJQCZ5TUB7YIIL","download_json":"https://pith.science/pith/2JSKJQ23D5EDHJQCZ5TUB7YIIL.json","view_paper":"https://pith.science/paper/2JSKJQ23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.5925&json=true","fetch_graph":"https://pith.science/api/pith-number/2JSKJQ23D5EDHJQCZ5TUB7YIIL/graph.json","fetch_events":"https://pith.science/api/pith-number/2JSKJQ23D5EDHJQCZ5TUB7YIIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JSKJQ23D5EDHJQCZ5TUB7YIIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JSKJQ23D5EDHJQCZ5TUB7YIIL/action/storage_attestation","attest_author":"https://pith.science/pith/2JSKJQ23D5EDHJQCZ5TUB7YIIL/action/author_attestation","sign_citation":"https://pith.science/pith/2JSKJQ23D5EDHJQCZ5TUB7YIIL/action/citation_signature","submit_replication":"https://pith.science/pith/2JSKJQ23D5EDHJQCZ5TUB7YIIL/action/replication_record"}},"created_at":"2026-05-18T02:21:09.372656+00:00","updated_at":"2026-05-18T02:21:09.372656+00:00"}