{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FQCOUBP6LOZ4MUXF7CUPTJBL47","short_pith_number":"pith:FQCOUBP6","schema_version":"1.0","canonical_sha256":"2c04ea05fe5bb3c652e5f8a8f9a42be7c30982ef5a7295d028723c0f81af2d23","source":{"kind":"arxiv","id":"1503.01752","version":3},"attestation_state":"computed","paper":{"title":"Efficient Inverse Maintenance and Faster Algorithms for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Yin Tat Lee","submitted_at":"2015-03-05T20:12:13Z","abstract_excerpt":"In this paper, we consider the following inverse maintenance problem: given $A \\in \\mathbb{R}^{n\\times d}$ and a number of rounds $r$, we receive a $n\\times n$ diagonal matrix $D^{(k)}$ at round $k$ and we wish to maintain an efficient linear system solver for $A^{T}D^{(k)}A$ under the assumption $D^{(k)}$ does not change too rapidly. This inverse maintenance problem is the computational bottleneck in solving multiple optimization problems. We show how to solve this problem with $\\tilde{O}(nnz(A)+d^{\\omega})$ preprocessing time and amortized $\\tilde{O}(nnz(A)+d^{2})$ time per round, improving "},"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":"1503.01752","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-05T20:12:13Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"cf8fbe03b74adcbf0453c0a737133131df32712e595c8972cc7926696b7c5e1e","abstract_canon_sha256":"799d81d4121aedd29ff01915ea27c0381dcc6fd5067fac999be99a49c5f4b353"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:15.250321Z","signature_b64":"wt501n2sgMhHJTNPDfOUgiFMnKOJ6/lJPnh5LbCUJYaUwRpZc1MOFqxsAT/DbQp9Ri7sPkWlbPRF4XLfc04JDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c04ea05fe5bb3c652e5f8a8f9a42be7c30982ef5a7295d028723c0f81af2d23","last_reissued_at":"2026-05-18T01:30:15.249818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:15.249818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Inverse Maintenance and Faster Algorithms for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Yin Tat Lee","submitted_at":"2015-03-05T20:12:13Z","abstract_excerpt":"In this paper, we consider the following inverse maintenance problem: given $A \\in \\mathbb{R}^{n\\times d}$ and a number of rounds $r$, we receive a $n\\times n$ diagonal matrix $D^{(k)}$ at round $k$ and we wish to maintain an efficient linear system solver for $A^{T}D^{(k)}A$ under the assumption $D^{(k)}$ does not change too rapidly. This inverse maintenance problem is the computational bottleneck in solving multiple optimization problems. We show how to solve this problem with $\\tilde{O}(nnz(A)+d^{\\omega})$ preprocessing time and amortized $\\tilde{O}(nnz(A)+d^{2})$ time per round, improving "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01752","kind":"arxiv","version":3},"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":"1503.01752","created_at":"2026-05-18T01:30:15.249898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01752v3","created_at":"2026-05-18T01:30:15.249898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01752","created_at":"2026-05-18T01:30:15.249898+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQCOUBP6LOZ4","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQCOUBP6LOZ4MUXF","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQCOUBP6","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04438","citing_title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47","json":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47.json","graph_json":"https://pith.science/api/pith-number/FQCOUBP6LOZ4MUXF7CUPTJBL47/graph.json","events_json":"https://pith.science/api/pith-number/FQCOUBP6LOZ4MUXF7CUPTJBL47/events.json","paper":"https://pith.science/paper/FQCOUBP6"},"agent_actions":{"view_html":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47","download_json":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47.json","view_paper":"https://pith.science/paper/FQCOUBP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01752&json=true","fetch_graph":"https://pith.science/api/pith-number/FQCOUBP6LOZ4MUXF7CUPTJBL47/graph.json","fetch_events":"https://pith.science/api/pith-number/FQCOUBP6LOZ4MUXF7CUPTJBL47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/action/storage_attestation","attest_author":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/action/author_attestation","sign_citation":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/action/citation_signature","submit_replication":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/action/replication_record"}},"created_at":"2026-05-18T01:30:15.249898+00:00","updated_at":"2026-05-18T01:30:15.249898+00:00"}