{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UKRMPHJLKFYTFSHB7OMJKCYEPW","short_pith_number":"pith:UKRMPHJL","schema_version":"1.0","canonical_sha256":"a2a2c79d2b517132c8e1fb98950b047dbe22752320b60879366eafbb2f46f767","source":{"kind":"arxiv","id":"1702.06110","version":1},"attestation_state":"computed","paper":{"title":"Density Independent Algorithms for Sparsifying $k$-Step Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani","submitted_at":"2017-02-20T18:50:26Z","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"},"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":"1702.06110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T18:50:26Z","cross_cats_sorted":[],"title_canon_sha256":"02536e364fe6125a64dc0c9d6ed8970f31cc0173d5cd674e643a8a82bf044fe3","abstract_canon_sha256":"dceebe2372a8322aed5e37c794fe6ef18302aec6b0e9f6fd2ebbfcc6c03fa923"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:24.303258Z","signature_b64":"EiaGGq0w8b8okXLSCEeDRg+chGQu8BxPWk8pSjanraeEC+9x4QHR6rEoX6a0L2dWyR4Dzw4o0nkJyi6MPMiuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a2c79d2b517132c8e1fb98950b047dbe22752320b60879366eafbb2f46f767","last_reissued_at":"2026-05-18T00:50:24.302610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:24.302610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density Independent Algorithms for Sparsifying $k$-Step Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani","submitted_at":"2017-02-20T18:50:26Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06110","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":"1702.06110","created_at":"2026-05-18T00:50:24.302729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06110v1","created_at":"2026-05-18T00:50:24.302729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06110","created_at":"2026-05-18T00:50:24.302729+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKRMPHJLKFYT","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKRMPHJLKFYTFSHB","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKRMPHJL","created_at":"2026-05-18T12:31:46.661854+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/UKRMPHJLKFYTFSHB7OMJKCYEPW","json":"https://pith.science/pith/UKRMPHJLKFYTFSHB7OMJKCYEPW.json","graph_json":"https://pith.science/api/pith-number/UKRMPHJLKFYTFSHB7OMJKCYEPW/graph.json","events_json":"https://pith.science/api/pith-number/UKRMPHJLKFYTFSHB7OMJKCYEPW/events.json","paper":"https://pith.science/paper/UKRMPHJL"},"agent_actions":{"view_html":"https://pith.science/pith/UKRMPHJLKFYTFSHB7OMJKCYEPW","download_json":"https://pith.science/pith/UKRMPHJLKFYTFSHB7OMJKCYEPW.json","view_paper":"https://pith.science/paper/UKRMPHJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06110&json=true","fetch_graph":"https://pith.science/api/pith-number/UKRMPHJLKFYTFSHB7OMJKCYEPW/graph.json","fetch_events":"https://pith.science/api/pith-number/UKRMPHJLKFYTFSHB7OMJKCYEPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKRMPHJLKFYTFSHB7OMJKCYEPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKRMPHJLKFYTFSHB7OMJKCYEPW/action/storage_attestation","attest_author":"https://pith.science/pith/UKRMPHJLKFYTFSHB7OMJKCYEPW/action/author_attestation","sign_citation":"https://pith.science/pith/UKRMPHJLKFYTFSHB7OMJKCYEPW/action/citation_signature","submit_replication":"https://pith.science/pith/UKRMPHJLKFYTFSHB7OMJKCYEPW/action/replication_record"}},"created_at":"2026-05-18T00:50:24.302729+00:00","updated_at":"2026-05-18T00:50:24.302729+00:00"}