{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:APZMYHS6TX4QQLRM6NTTJNXWJ4","short_pith_number":"pith:APZMYHS6","schema_version":"1.0","canonical_sha256":"03f2cc1e5e9df9082e2cf36734b6f64f0d72599815fc1506471e573c5ab98637","source":{"kind":"arxiv","id":"1608.03270","version":2},"attestation_state":"computed","paper":{"title":"Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Adrian Vladu, John Peebles, Jon Kelner, Michael B. Cohen, Richard Peng","submitted_at":"2016-08-10T19:58:57Z","abstract_excerpt":"In this paper, we provide faster algorithms for computing various fundamental quantities associated with random walks on a directed graph, including the stationary distribution, personalized PageRank vectors, hitting times, and escape probabilities. In particular, on a directed graph with $n$ vertices and $m$ edges, we show how to compute each quantity in time $\\tilde{O}(m^{3/4}n+mn^{2/3})$, where the $\\tilde{O}$ notation suppresses polylogarithmic factors in $n$, the desired accuracy, and the appropriate condition number (i.e. the mixing time or restart probability).\n  Our result improves upo"},"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":"1608.03270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T19:58:57Z","cross_cats_sorted":[],"title_canon_sha256":"3838011efb92f438754e7fdae9bdd8df8a4e49fbbbbad3b1cf9f1d3ed2e902be","abstract_canon_sha256":"dd7c992c09c1f4351acbe5edb9f40a970e49390cfe33a9ffa1acef24de66a611"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:33.855396Z","signature_b64":"LfbiX0MwAYvBUDwekoKyIHfwzusWWcXJj1Bul4PpwD1qZT1K1uK0c52rlCcOrNP7c4PBKqauh7RZtQu1LQsOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03f2cc1e5e9df9082e2cf36734b6f64f0d72599815fc1506471e573c5ab98637","last_reissued_at":"2026-05-18T01:00:33.854779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:33.854779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Adrian Vladu, John Peebles, Jon Kelner, Michael B. Cohen, Richard Peng","submitted_at":"2016-08-10T19:58:57Z","abstract_excerpt":"In this paper, we provide faster algorithms for computing various fundamental quantities associated with random walks on a directed graph, including the stationary distribution, personalized PageRank vectors, hitting times, and escape probabilities. In particular, on a directed graph with $n$ vertices and $m$ edges, we show how to compute each quantity in time $\\tilde{O}(m^{3/4}n+mn^{2/3})$, where the $\\tilde{O}$ notation suppresses polylogarithmic factors in $n$, the desired accuracy, and the appropriate condition number (i.e. the mixing time or restart probability).\n  Our result improves upo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03270","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":"1608.03270","created_at":"2026-05-18T01:00:33.854864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03270v2","created_at":"2026-05-18T01:00:33.854864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03270","created_at":"2026-05-18T01:00:33.854864+00:00"},{"alias_kind":"pith_short_12","alias_value":"APZMYHS6TX4Q","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"APZMYHS6TX4QQLRM","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"APZMYHS6","created_at":"2026-05-18T12:30:07.202191+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/APZMYHS6TX4QQLRM6NTTJNXWJ4","json":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4.json","graph_json":"https://pith.science/api/pith-number/APZMYHS6TX4QQLRM6NTTJNXWJ4/graph.json","events_json":"https://pith.science/api/pith-number/APZMYHS6TX4QQLRM6NTTJNXWJ4/events.json","paper":"https://pith.science/paper/APZMYHS6"},"agent_actions":{"view_html":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4","download_json":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4.json","view_paper":"https://pith.science/paper/APZMYHS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03270&json=true","fetch_graph":"https://pith.science/api/pith-number/APZMYHS6TX4QQLRM6NTTJNXWJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/APZMYHS6TX4QQLRM6NTTJNXWJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/action/storage_attestation","attest_author":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/action/author_attestation","sign_citation":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/action/citation_signature","submit_replication":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/action/replication_record"}},"created_at":"2026-05-18T01:00:33.854864+00:00","updated_at":"2026-05-18T01:00:33.854864+00:00"}