{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:V6PEW6CCZN3LXY4VPUXVDP4CDN","short_pith_number":"pith:V6PEW6CC","schema_version":"1.0","canonical_sha256":"af9e4b7842cb76bbe3957d2f51bf821b54e3db6f6e299b1c2e3cab635499cb0f","source":{"kind":"arxiv","id":"2111.01997","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Edward Pyne, Salil Vadhan","submitted_at":"2021-11-03T03:30:30Z","abstract_excerpt":"Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \\in V$, and a walk length $t\\in \\mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\\pm \\varepsilon.$ A randomized algorithm can solve this problem by carrying out $O(1/\\varepsilon^2)$ random walks of length $t$ from $u$ and outputting the fraction that end at $v$.\n  In this paper, we study deterministic algorithms for this problem that are also restricted to carrying out walks of length $t$ from $u$ and seeing which ones end at $v$. Specifically"},"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":"2111.01997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-11-03T03:30:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"17f68e2155c43520d23a9a8c8f3e7f9d009cb78c10e58809776474507191c985","abstract_canon_sha256":"762853c7e96841e2bc013194687c74a8ea60fdc555874cbe1d45e70110ca25e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:45.478769Z","signature_b64":"49TDZUwPX/vqZubeHMbmevlMNcKRdqvuLhfZNihODEKXcFyIqghfwMgiuryQUaib/hu8HVI18mtHBk73DwSRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af9e4b7842cb76bbe3957d2f51bf821b54e3db6f6e299b1c2e3cab635499cb0f","last_reissued_at":"2026-07-05T03:28:45.478407Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:45.478407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Edward Pyne, Salil Vadhan","submitted_at":"2021-11-03T03:30:30Z","abstract_excerpt":"Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \\in V$, and a walk length $t\\in \\mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\\pm \\varepsilon.$ A randomized algorithm can solve this problem by carrying out $O(1/\\varepsilon^2)$ random walks of length $t$ from $u$ and outputting the fraction that end at $v$.\n  In this paper, we study deterministic algorithms for this problem that are also restricted to carrying out walks of length $t$ from $u$ and seeing which ones end at $v$. Specifically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.01997","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.01997/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2111.01997","created_at":"2026-07-05T03:28:45.478462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.01997v1","created_at":"2026-07-05T03:28:45.478462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.01997","created_at":"2026-07-05T03:28:45.478462+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6PEW6CCZN3L","created_at":"2026-07-05T03:28:45.478462+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6PEW6CCZN3LXY4V","created_at":"2026-07-05T03:28:45.478462+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6PEW6CC","created_at":"2026-07-05T03:28:45.478462+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/V6PEW6CCZN3LXY4VPUXVDP4CDN","json":"https://pith.science/pith/V6PEW6CCZN3LXY4VPUXVDP4CDN.json","graph_json":"https://pith.science/api/pith-number/V6PEW6CCZN3LXY4VPUXVDP4CDN/graph.json","events_json":"https://pith.science/api/pith-number/V6PEW6CCZN3LXY4VPUXVDP4CDN/events.json","paper":"https://pith.science/paper/V6PEW6CC"},"agent_actions":{"view_html":"https://pith.science/pith/V6PEW6CCZN3LXY4VPUXVDP4CDN","download_json":"https://pith.science/pith/V6PEW6CCZN3LXY4VPUXVDP4CDN.json","view_paper":"https://pith.science/paper/V6PEW6CC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.01997&json=true","fetch_graph":"https://pith.science/api/pith-number/V6PEW6CCZN3LXY4VPUXVDP4CDN/graph.json","fetch_events":"https://pith.science/api/pith-number/V6PEW6CCZN3LXY4VPUXVDP4CDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6PEW6CCZN3LXY4VPUXVDP4CDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6PEW6CCZN3LXY4VPUXVDP4CDN/action/storage_attestation","attest_author":"https://pith.science/pith/V6PEW6CCZN3LXY4VPUXVDP4CDN/action/author_attestation","sign_citation":"https://pith.science/pith/V6PEW6CCZN3LXY4VPUXVDP4CDN/action/citation_signature","submit_replication":"https://pith.science/pith/V6PEW6CCZN3LXY4VPUXVDP4CDN/action/replication_record"}},"created_at":"2026-07-05T03:28:45.478462+00:00","updated_at":"2026-07-05T03:28:45.478462+00:00"}