{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NVQK22PQC6R52YV6UOJNXKSE7T","short_pith_number":"pith:NVQK22PQ","schema_version":"1.0","canonical_sha256":"6d60ad69f017a3dd62bea392dbaa44fcf22f81e2647ea3116c1004eb76d94b24","source":{"kind":"arxiv","id":"1401.6236","version":1},"attestation_state":"computed","paper":{"title":"Preconditioning in Expectation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Anup Rao, Jakub W. Pachocki, Michael B. Cohen, Rasmus Kyng, Richard Peng","submitted_at":"2014-01-24T01:37:37Z","abstract_excerpt":"We show that preconditioners constructed by random sampling can perform well without meeting the standard requirements of iterative methods. When applied to graph Laplacians, this leads to ultra-sparsifiers that in expectation behave as the nearly-optimal ones given by [Kolla-Makarychev-Saberi-Teng STOC`10]. Combining this with the recursive preconditioning framework by [Spielman-Teng STOC`04] and improved embedding algorithms, this leads to algorithms that solve symmetric diagonally dominant linear systems and electrical flow problems in expected time close to $m\\log^{1/2}n$ ."},"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":"1401.6236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-24T01:37:37Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"9cb14a16837d98dd8ca34221ce434944b1be0e8f33ea2cb9aa220c8d0ddd9ba1","abstract_canon_sha256":"1951d7e69245e93f3afa7756c3ebf1d797cc93be1c0f460d67546c8b765887b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:12.786992Z","signature_b64":"51Xc4lPSPmM/nl+o+AkTMXR2HBeZHVZCQOAuoBQ65qW097L3PKabSIHQ/zgYJmcF1Biy152XqwpGY0DM4HAYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d60ad69f017a3dd62bea392dbaa44fcf22f81e2647ea3116c1004eb76d94b24","last_reissued_at":"2026-05-18T03:01:12.786188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:12.786188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preconditioning in Expectation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Anup Rao, Jakub W. Pachocki, Michael B. Cohen, Rasmus Kyng, Richard Peng","submitted_at":"2014-01-24T01:37:37Z","abstract_excerpt":"We show that preconditioners constructed by random sampling can perform well without meeting the standard requirements of iterative methods. When applied to graph Laplacians, this leads to ultra-sparsifiers that in expectation behave as the nearly-optimal ones given by [Kolla-Makarychev-Saberi-Teng STOC`10]. Combining this with the recursive preconditioning framework by [Spielman-Teng STOC`04] and improved embedding algorithms, this leads to algorithms that solve symmetric diagonally dominant linear systems and electrical flow problems in expected time close to $m\\log^{1/2}n$ ."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6236","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":"1401.6236","created_at":"2026-05-18T03:01:12.786309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6236v1","created_at":"2026-05-18T03:01:12.786309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6236","created_at":"2026-05-18T03:01:12.786309+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVQK22PQC6R5","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVQK22PQC6R52YV6","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVQK22PQ","created_at":"2026-05-18T12:28:41.024544+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/NVQK22PQC6R52YV6UOJNXKSE7T","json":"https://pith.science/pith/NVQK22PQC6R52YV6UOJNXKSE7T.json","graph_json":"https://pith.science/api/pith-number/NVQK22PQC6R52YV6UOJNXKSE7T/graph.json","events_json":"https://pith.science/api/pith-number/NVQK22PQC6R52YV6UOJNXKSE7T/events.json","paper":"https://pith.science/paper/NVQK22PQ"},"agent_actions":{"view_html":"https://pith.science/pith/NVQK22PQC6R52YV6UOJNXKSE7T","download_json":"https://pith.science/pith/NVQK22PQC6R52YV6UOJNXKSE7T.json","view_paper":"https://pith.science/paper/NVQK22PQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6236&json=true","fetch_graph":"https://pith.science/api/pith-number/NVQK22PQC6R52YV6UOJNXKSE7T/graph.json","fetch_events":"https://pith.science/api/pith-number/NVQK22PQC6R52YV6UOJNXKSE7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVQK22PQC6R52YV6UOJNXKSE7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVQK22PQC6R52YV6UOJNXKSE7T/action/storage_attestation","attest_author":"https://pith.science/pith/NVQK22PQC6R52YV6UOJNXKSE7T/action/author_attestation","sign_citation":"https://pith.science/pith/NVQK22PQC6R52YV6UOJNXKSE7T/action/citation_signature","submit_replication":"https://pith.science/pith/NVQK22PQC6R52YV6UOJNXKSE7T/action/replication_record"}},"created_at":"2026-05-18T03:01:12.786309+00:00","updated_at":"2026-05-18T03:01:12.786309+00:00"}