{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2RYDRCVJODMSTUMIUGCIHCJINI","short_pith_number":"pith:2RYDRCVJ","schema_version":"1.0","canonical_sha256":"d470388aa970d929d188a1848389286a2b9a2ec1f7a4f3f0ea1a6be5a53d4762","source":{"kind":"arxiv","id":"2004.07470","version":1},"attestation_state":"computed","paper":{"title":"Faster Dynamic Matrix Inverse for Faster LPs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hengjie Zhang, Omri Weinstein, Shunhua Jiang, Zhao Song","submitted_at":"2020-04-16T06:02:37Z","abstract_excerpt":"Motivated by recent Linear Programming solvers, we design dynamic data structures for maintaining the inverse of an $n\\times n$ real matrix under $\\textit{low-rank}$ updates, with polynomially faster amortized running time. Our data structure is based on a recursive application of the Woodbury-Morrison identity for implementing $\\textit{cascading}$ low-rank updates, combined with recent sketching technology. Our techniques and amortized analysis of multi-level partial updates, may be of broader interest to dynamic matrix problems.\n  This data structure leads to the fastest known LP solver for "},"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":"2004.07470","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-16T06:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"9d031b069ed7542a2bb2b445df85401ccc740886d7c377e34db801ccd07f3f2a","abstract_canon_sha256":"194a6ee7f8ab47c8e909a4c45fc3cc684cb38bccc465f499fb2e9ae80455c826"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:33.481040Z","signature_b64":"g+se8s3Wwap15Ga8IfV7FIuI9ndXav+US7L8LoIBMct9JjzM/Yu3TCTkOJhQfQXBoGd3dHMecKupwth77JtFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d470388aa970d929d188a1848389286a2b9a2ec1f7a4f3f0ea1a6be5a53d4762","last_reissued_at":"2026-07-05T00:55:33.480419Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:33.480419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Dynamic Matrix Inverse for Faster LPs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hengjie Zhang, Omri Weinstein, Shunhua Jiang, Zhao Song","submitted_at":"2020-04-16T06:02:37Z","abstract_excerpt":"Motivated by recent Linear Programming solvers, we design dynamic data structures for maintaining the inverse of an $n\\times n$ real matrix under $\\textit{low-rank}$ updates, with polynomially faster amortized running time. Our data structure is based on a recursive application of the Woodbury-Morrison identity for implementing $\\textit{cascading}$ low-rank updates, combined with recent sketching technology. Our techniques and amortized analysis of multi-level partial updates, may be of broader interest to dynamic matrix problems.\n  This data structure leads to the fastest known LP solver for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07470","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.07470/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2004.07470","created_at":"2026-07-05T00:55:33.480500+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.07470v1","created_at":"2026-07-05T00:55:33.480500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07470","created_at":"2026-07-05T00:55:33.480500+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RYDRCVJODMS","created_at":"2026-07-05T00:55:33.480500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RYDRCVJODMSTUMI","created_at":"2026-07-05T00:55:33.480500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RYDRCVJ","created_at":"2026-07-05T00:55:33.480500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00315","citing_title":"Feasibilism, Explication, and the Cobham-Edmonds Thesis","ref_index":88,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24488","citing_title":"Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI","json":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI.json","graph_json":"https://pith.science/api/pith-number/2RYDRCVJODMSTUMIUGCIHCJINI/graph.json","events_json":"https://pith.science/api/pith-number/2RYDRCVJODMSTUMIUGCIHCJINI/events.json","paper":"https://pith.science/paper/2RYDRCVJ"},"agent_actions":{"view_html":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI","download_json":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI.json","view_paper":"https://pith.science/paper/2RYDRCVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.07470&json=true","fetch_graph":"https://pith.science/api/pith-number/2RYDRCVJODMSTUMIUGCIHCJINI/graph.json","fetch_events":"https://pith.science/api/pith-number/2RYDRCVJODMSTUMIUGCIHCJINI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI/action/storage_attestation","attest_author":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI/action/author_attestation","sign_citation":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI/action/citation_signature","submit_replication":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI/action/replication_record"}},"created_at":"2026-07-05T00:55:33.480500+00:00","updated_at":"2026-07-05T00:55:33.480500+00:00"}