{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FQCOUBP6LOZ4MUXF7CUPTJBL47","short_pith_number":"pith:FQCOUBP6","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"},"canonical_sha256":"2c04ea05fe5bb3c652e5f8a8f9a42be7c30982ef5a7295d028723c0f81af2d23","source":{"kind":"arxiv","id":"1503.01752","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01752","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01752v3","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01752","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"FQCOUBP6LOZ4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FQCOUBP6LOZ4MUXF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FQCOUBP6","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FQCOUBP6LOZ4MUXF7CUPTJBL47","target":"record","payload":{"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"},"canonical_sha256":"2c04ea05fe5bb3c652e5f8a8f9a42be7c30982ef5a7295d028723c0f81af2d23","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"},"source_kind":"arxiv","source_id":"1503.01752","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGu0JmL5TV0r+IItpUP/JaFsaKUYls85GaVPXq2Qfj+QMzfDgZENsutNNgP/aPJKY4apMKJ8KiKkArO795gDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T04:38:45.157995Z"},"content_sha256":"4b4a3d3409f4957ced0fa9c694b7f48a30c9c0c0de606973177b059860ff2a42","schema_version":"1.0","event_id":"sha256:4b4a3d3409f4957ced0fa9c694b7f48a30c9c0c0de606973177b059860ff2a42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FQCOUBP6LOZ4MUXF7CUPTJBL47","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dsl6sc7fma3Uk1lsNJen7+kWjAPxR0OxooKVJ4PfNe9YC0yhdROPa5WBRD+fpVLsbcCruu0RczeK3HVWwry9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T04:38:45.159143Z"},"content_sha256":"7dee0f1f2989a5fa0c16c3a390ac9df7c43b6153448cf846b9d087208139a270","schema_version":"1.0","event_id":"sha256:7dee0f1f2989a5fa0c16c3a390ac9df7c43b6153448cf846b9d087208139a270"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/bundle.json","state_url":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T04:38:45Z","links":{"resolver":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47","bundle":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/bundle.json","state":"https://pith.science/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQCOUBP6LOZ4MUXF7CUPTJBL47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FQCOUBP6LOZ4MUXF7CUPTJBL47","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"799d81d4121aedd29ff01915ea27c0381dcc6fd5067fac999be99a49c5f4b353","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-05T20:12:13Z","title_canon_sha256":"cf8fbe03b74adcbf0453c0a737133131df32712e595c8972cc7926696b7c5e1e"},"schema_version":"1.0","source":{"id":"1503.01752","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01752","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01752v3","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01752","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"FQCOUBP6LOZ4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FQCOUBP6LOZ4MUXF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FQCOUBP6","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:7dee0f1f2989a5fa0c16c3a390ac9df7c43b6153448cf846b9d087208139a270","target":"graph","created_at":"2026-05-18T01:30:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Aaron Sidford, Yin Tat Lee","cross_cats":["cs.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-05T20:12:13Z","title":"Efficient Inverse Maintenance and Faster Algorithms for Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01752","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b4a3d3409f4957ced0fa9c694b7f48a30c9c0c0de606973177b059860ff2a42","target":"record","created_at":"2026-05-18T01:30:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"799d81d4121aedd29ff01915ea27c0381dcc6fd5067fac999be99a49c5f4b353","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-05T20:12:13Z","title_canon_sha256":"cf8fbe03b74adcbf0453c0a737133131df32712e595c8972cc7926696b7c5e1e"},"schema_version":"1.0","source":{"id":"1503.01752","kind":"arxiv","version":3}},"canonical_sha256":"2c04ea05fe5bb3c652e5f8a8f9a42be7c30982ef5a7295d028723c0f81af2d23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c04ea05fe5bb3c652e5f8a8f9a42be7c30982ef5a7295d028723c0f81af2d23","first_computed_at":"2026-05-18T01:30:15.249818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:15.249818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wt501n2sgMhHJTNPDfOUgiFMnKOJ6/lJPnh5LbCUJYaUwRpZc1MOFqxsAT/DbQp9Ri7sPkWlbPRF4XLfc04JDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:15.250321Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01752","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b4a3d3409f4957ced0fa9c694b7f48a30c9c0c0de606973177b059860ff2a42","sha256:7dee0f1f2989a5fa0c16c3a390ac9df7c43b6153448cf846b9d087208139a270"],"state_sha256":"6b0dccf539654d522197adfd0418c11d118a53397f6e70b091beeea99bd3aa19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/XcLl+VFd9U6uO8Amf3JbCQSRr6LTNBtLvk6B/rPXpB4mapxcdnxZ9cavgDCG09/P3uyAluCbQ0YXCt+SS3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T04:38:45.165123Z","bundle_sha256":"a3ec24b64079711c79e1e9054cd1100bc4fd67024a25c3069eb8d6140686829d"}}