{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SZNVKXO2JCR42Y6BJFQ2EKOV6F","short_pith_number":"pith:SZNVKXO2","schema_version":"1.0","canonical_sha256":"965b555dda48a3cd63c14961a229d5f160d0d0da68e78529730694c54fe89e21","source":{"kind":"arxiv","id":"1606.07425","version":2},"attestation_state":"computed","paper":{"title":"Generalized Preconditioning and Network Flow Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jonah Sherman","submitted_at":"2016-06-23T19:56:35Z","abstract_excerpt":"We consider approximation algorithms for the problem of finding $x$ of minimal norm $\\|x\\|$ satisfying a linear system $\\mathbf{A} x = \\mathbf{b}$, where the norm $\\|\\cdot \\|$ is arbitrary and generally non-Euclidean. We show a simple general technique for composing solvers, converting iterative solvers with residual error $\\|\\mathbf{A} x - \\mathbf{b}\\| \\leq t^{-\\Omega(1)}$ into solvers with residual error $\\exp(-\\Omega(t))$, at the cost of an increase in $\\|x\\|$, by recursively invoking the solver on the residual problem $\\tilde{\\mathbf{b}} = \\mathbf{b} - \\mathbf{A} x$. Convergence of the com"},"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":"1606.07425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-23T19:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"de3e2294f4a0b15fea3b88929889ac5e357020eae6d6aba40441117b26e41bf2","abstract_canon_sha256":"6001cfc402101c057290a6d56010d8ca8c8e8ec9e132479966d339e64caa378c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:54.376114Z","signature_b64":"cretc+5tNzgo3ImfEqVSLK4RT7OtCTihMGYQLzhwVz85sjfQEUkyNfGp1B71UGhejSPZZUMm6/mtZxCqOPKyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"965b555dda48a3cd63c14961a229d5f160d0d0da68e78529730694c54fe89e21","last_reissued_at":"2026-05-18T01:11:54.375778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:54.375778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Preconditioning and Network Flow Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jonah Sherman","submitted_at":"2016-06-23T19:56:35Z","abstract_excerpt":"We consider approximation algorithms for the problem of finding $x$ of minimal norm $\\|x\\|$ satisfying a linear system $\\mathbf{A} x = \\mathbf{b}$, where the norm $\\|\\cdot \\|$ is arbitrary and generally non-Euclidean. We show a simple general technique for composing solvers, converting iterative solvers with residual error $\\|\\mathbf{A} x - \\mathbf{b}\\| \\leq t^{-\\Omega(1)}$ into solvers with residual error $\\exp(-\\Omega(t))$, at the cost of an increase in $\\|x\\|$, by recursively invoking the solver on the residual problem $\\tilde{\\mathbf{b}} = \\mathbf{b} - \\mathbf{A} x$. Convergence of the com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07425","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":"1606.07425","created_at":"2026-05-18T01:11:54.375833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07425v2","created_at":"2026-05-18T01:11:54.375833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07425","created_at":"2026-05-18T01:11:54.375833+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZNVKXO2JCR4","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZNVKXO2JCR42Y6B","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZNVKXO2","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10340","citing_title":"Flows in Almost Linear Time via Adaptive Preconditioning","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZNVKXO2JCR42Y6BJFQ2EKOV6F","json":"https://pith.science/pith/SZNVKXO2JCR42Y6BJFQ2EKOV6F.json","graph_json":"https://pith.science/api/pith-number/SZNVKXO2JCR42Y6BJFQ2EKOV6F/graph.json","events_json":"https://pith.science/api/pith-number/SZNVKXO2JCR42Y6BJFQ2EKOV6F/events.json","paper":"https://pith.science/paper/SZNVKXO2"},"agent_actions":{"view_html":"https://pith.science/pith/SZNVKXO2JCR42Y6BJFQ2EKOV6F","download_json":"https://pith.science/pith/SZNVKXO2JCR42Y6BJFQ2EKOV6F.json","view_paper":"https://pith.science/paper/SZNVKXO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07425&json=true","fetch_graph":"https://pith.science/api/pith-number/SZNVKXO2JCR42Y6BJFQ2EKOV6F/graph.json","fetch_events":"https://pith.science/api/pith-number/SZNVKXO2JCR42Y6BJFQ2EKOV6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZNVKXO2JCR42Y6BJFQ2EKOV6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZNVKXO2JCR42Y6BJFQ2EKOV6F/action/storage_attestation","attest_author":"https://pith.science/pith/SZNVKXO2JCR42Y6BJFQ2EKOV6F/action/author_attestation","sign_citation":"https://pith.science/pith/SZNVKXO2JCR42Y6BJFQ2EKOV6F/action/citation_signature","submit_replication":"https://pith.science/pith/SZNVKXO2JCR42Y6BJFQ2EKOV6F/action/replication_record"}},"created_at":"2026-05-18T01:11:54.375833+00:00","updated_at":"2026-05-18T01:11:54.375833+00:00"}