{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UKRMPHJLKFYTFSHB7OMJKCYEPW","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":"dceebe2372a8322aed5e37c794fe6ef18302aec6b0e9f6fd2ebbfcc6c03fa923","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T18:50:26Z","title_canon_sha256":"02536e364fe6125a64dc0c9d6ed8970f31cc0173d5cd674e643a8a82bf044fe3"},"schema_version":"1.0","source":{"id":"1702.06110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06110","created_at":"2026-05-18T00:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06110v1","created_at":"2026-05-18T00:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06110","created_at":"2026-05-18T00:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"UKRMPHJLKFYT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UKRMPHJLKFYTFSHB","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UKRMPHJL","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:ce8572108e375179d45649ade0f77053d5f0e4b38bafc4fe61148a1959ba91ff","target":"graph","created_at":"2026-05-18T00:50:24Z","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":"We give faster algorithms for producing sparse approximations of the transition matrices of $k$-step random walks on undirected, weighted graphs. These transition matrices also form graphs, and arise as intermediate objects in a variety of graph algorithms. Our improvements are based on a better understanding of processes that sample such walks, as well as tighter bounds on key weights underlying these sampling processes. On a graph with $n$ vertices and $m$ edges, our algorithm produces a graph with about $n\\log{n}$ edges that approximates the $k$-step random walk graph in about $m + n \\log^4","authors_text":"Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T18:50:26Z","title":"Density Independent Algorithms for Sparsifying $k$-Step Random Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06110","kind":"arxiv","version":1},"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:96552d5d52113efff289583e225eb2fe37d0a60755db90a1deb4076e7b6afba0","target":"record","created_at":"2026-05-18T00:50:24Z","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":"dceebe2372a8322aed5e37c794fe6ef18302aec6b0e9f6fd2ebbfcc6c03fa923","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T18:50:26Z","title_canon_sha256":"02536e364fe6125a64dc0c9d6ed8970f31cc0173d5cd674e643a8a82bf044fe3"},"schema_version":"1.0","source":{"id":"1702.06110","kind":"arxiv","version":1}},"canonical_sha256":"a2a2c79d2b517132c8e1fb98950b047dbe22752320b60879366eafbb2f46f767","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2a2c79d2b517132c8e1fb98950b047dbe22752320b60879366eafbb2f46f767","first_computed_at":"2026-05-18T00:50:24.302610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:24.302610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EiaGGq0w8b8okXLSCEeDRg+chGQu8BxPWk8pSjanraeEC+9x4QHR6rEoX6a0L2dWyR4Dzw4o0nkJyi6MPMiuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:24.303258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96552d5d52113efff289583e225eb2fe37d0a60755db90a1deb4076e7b6afba0","sha256:ce8572108e375179d45649ade0f77053d5f0e4b38bafc4fe61148a1959ba91ff"],"state_sha256":"dffa03dd9e69ff4c786eaab52fb099519c53d5236ec4d428c15ee5e2243501b8"}