{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:APZMYHS6TX4QQLRM6NTTJNXWJ4","short_pith_number":"pith:APZMYHS6","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"},"canonical_sha256":"03f2cc1e5e9df9082e2cf36734b6f64f0d72599815fc1506471e573c5ab98637","source":{"kind":"arxiv","id":"1608.03270","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03270","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03270v2","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03270","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"APZMYHS6TX4Q","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"APZMYHS6TX4QQLRM","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"APZMYHS6","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:APZMYHS6TX4QQLRM6NTTJNXWJ4","target":"record","payload":{"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"},"canonical_sha256":"03f2cc1e5e9df9082e2cf36734b6f64f0d72599815fc1506471e573c5ab98637","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"},"source_kind":"arxiv","source_id":"1608.03270","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-18T01:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6hWTHJ6+M539TasMA4Tlt2X2KKBT+MJkVsai7PtO2BLgMMXrAM/aQXYEVaA/YOSClN8ez0Tkbyu7lgGQ9BPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:14:41.842065Z"},"content_sha256":"6fd6b7798d5412728d52c0483c441f9daa05191d5fa6cc11365722502d684c09","schema_version":"1.0","event_id":"sha256:6fd6b7798d5412728d52c0483c441f9daa05191d5fa6cc11365722502d684c09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:APZMYHS6TX4QQLRM6NTTJNXWJ4","target":"graph","payload":{"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"},"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-18T01:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/HlOkLCsq1s9BFBEFYlwdAiNe+PzG4XA/3QOfnWOUpRu+l0qpdoBy7WUd3hCm5YK7xFs2COZstuNKMXpTTaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:14:41.842419Z"},"content_sha256":"43390174cd10ea4551db127e1a66be5ca5a2de9af3846207a2e0541f1cc0696b","schema_version":"1.0","event_id":"sha256:43390174cd10ea4551db127e1a66be5ca5a2de9af3846207a2e0541f1cc0696b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/bundle.json","state_url":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/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-06-03T01:14:41Z","links":{"resolver":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4","bundle":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/bundle.json","state":"https://pith.science/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APZMYHS6TX4QQLRM6NTTJNXWJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:APZMYHS6TX4QQLRM6NTTJNXWJ4","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":"dd7c992c09c1f4351acbe5edb9f40a970e49390cfe33a9ffa1acef24de66a611","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T19:58:57Z","title_canon_sha256":"3838011efb92f438754e7fdae9bdd8df8a4e49fbbbbad3b1cf9f1d3ed2e902be"},"schema_version":"1.0","source":{"id":"1608.03270","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03270","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03270v2","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03270","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"APZMYHS6TX4Q","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"APZMYHS6TX4QQLRM","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"APZMYHS6","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:43390174cd10ea4551db127e1a66be5ca5a2de9af3846207a2e0541f1cc0696b","target":"graph","created_at":"2026-05-18T01:00:33Z","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 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","authors_text":"Aaron Sidford, Adrian Vladu, John Peebles, Jon Kelner, Michael B. Cohen, Richard Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T19:58:57Z","title":"Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03270","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:6fd6b7798d5412728d52c0483c441f9daa05191d5fa6cc11365722502d684c09","target":"record","created_at":"2026-05-18T01:00:33Z","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":"dd7c992c09c1f4351acbe5edb9f40a970e49390cfe33a9ffa1acef24de66a611","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T19:58:57Z","title_canon_sha256":"3838011efb92f438754e7fdae9bdd8df8a4e49fbbbbad3b1cf9f1d3ed2e902be"},"schema_version":"1.0","source":{"id":"1608.03270","kind":"arxiv","version":2}},"canonical_sha256":"03f2cc1e5e9df9082e2cf36734b6f64f0d72599815fc1506471e573c5ab98637","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03f2cc1e5e9df9082e2cf36734b6f64f0d72599815fc1506471e573c5ab98637","first_computed_at":"2026-05-18T01:00:33.854779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:33.854779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LfbiX0MwAYvBUDwekoKyIHfwzusWWcXJj1Bul4PpwD1qZT1K1uK0c52rlCcOrNP7c4PBKqauh7RZtQu1LQsOBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:33.855396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03270","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fd6b7798d5412728d52c0483c441f9daa05191d5fa6cc11365722502d684c09","sha256:43390174cd10ea4551db127e1a66be5ca5a2de9af3846207a2e0541f1cc0696b"],"state_sha256":"c00662be93df5fd5eeb688f026b6e51e46ef65e58104ad7a1fb31bd437d4ef41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BIBO2v6fp5lSbydA9gfm4U5Mq7PZ1aNj0Vc8gChr27B75x9+1WNnjdqtgAifGrfjV4bzJtSszR1Pb/5eMu1eDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:14:41.844401Z","bundle_sha256":"4a892b171f02ba0d8dfa102402bf10f63113f875c00cdff63fc8b7f9bb897e4f"}}