{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z2QQVNQILNBCFVYH7ABC4LIHOB","short_pith_number":"pith:Z2QQVNQI","schema_version":"1.0","canonical_sha256":"cea10ab6085b4222d707f8022e2d077042d8c6d96d9112371b00ce3431eb0ede","source":{"kind":"arxiv","id":"1812.06295","version":1},"attestation_state":"computed","paper":{"title":"Efficient Structured Matrix Recovery and Nearly-Linear Time Algorithms for Solving Inverse Symmetric $M$-Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati, Kirankumar Shiragur","submitted_at":"2018-12-15T14:37:28Z","abstract_excerpt":"In this paper we show how to recover a spectral approximations to broad classes of structured matrices using only a polylogarithmic number of adaptive linear measurements to either the matrix or its inverse. Leveraging this result we obtain faster algorithms for variety of linear algebraic problems. Key results include:\n  $\\bullet$ A nearly linear time algorithm for solving the inverse of symmetric $M$-matrices, a strict superset of Laplacians and SDD matrices.\n  $\\bullet$ An $\\tilde{O}(n^2)$ time algorithm for solving $n \\times n$ linear systems that are constant spectral approximations of La"},"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":"1812.06295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-15T14:37:28Z","cross_cats_sorted":["math.OC","math.ST","stat.TH"],"title_canon_sha256":"346a05b9b5bb07397fc7a8f7f8c7d694b452e5a8ed7ab0e49ef516f06a2f6db7","abstract_canon_sha256":"3949531f6b8ad357439806186349405450e7442235e6eb525a7933f5dbb62902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:10.648188Z","signature_b64":"MHTCkhZ75QnH7B0zdvG1erqC9EsHf1l07hstgYO8KCw0at8hupsIlWTYWp0X3QWpozpG2SX+D5eNKy7ZVyqnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea10ab6085b4222d707f8022e2d077042d8c6d96d9112371b00ce3431eb0ede","last_reissued_at":"2026-05-17T23:58:10.647492Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:10.647492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Structured Matrix Recovery and Nearly-Linear Time Algorithms for Solving Inverse Symmetric $M$-Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati, Kirankumar Shiragur","submitted_at":"2018-12-15T14:37:28Z","abstract_excerpt":"In this paper we show how to recover a spectral approximations to broad classes of structured matrices using only a polylogarithmic number of adaptive linear measurements to either the matrix or its inverse. Leveraging this result we obtain faster algorithms for variety of linear algebraic problems. Key results include:\n  $\\bullet$ A nearly linear time algorithm for solving the inverse of symmetric $M$-matrices, a strict superset of Laplacians and SDD matrices.\n  $\\bullet$ An $\\tilde{O}(n^2)$ time algorithm for solving $n \\times n$ linear systems that are constant spectral approximations of La"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06295","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":"1812.06295","created_at":"2026-05-17T23:58:10.647590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06295v1","created_at":"2026-05-17T23:58:10.647590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06295","created_at":"2026-05-17T23:58:10.647590+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2QQVNQILNBC","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2QQVNQILNBCFVYH","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2QQVNQI","created_at":"2026-05-18T12:33:04.347982+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/Z2QQVNQILNBCFVYH7ABC4LIHOB","json":"https://pith.science/pith/Z2QQVNQILNBCFVYH7ABC4LIHOB.json","graph_json":"https://pith.science/api/pith-number/Z2QQVNQILNBCFVYH7ABC4LIHOB/graph.json","events_json":"https://pith.science/api/pith-number/Z2QQVNQILNBCFVYH7ABC4LIHOB/events.json","paper":"https://pith.science/paper/Z2QQVNQI"},"agent_actions":{"view_html":"https://pith.science/pith/Z2QQVNQILNBCFVYH7ABC4LIHOB","download_json":"https://pith.science/pith/Z2QQVNQILNBCFVYH7ABC4LIHOB.json","view_paper":"https://pith.science/paper/Z2QQVNQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06295&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2QQVNQILNBCFVYH7ABC4LIHOB/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2QQVNQILNBCFVYH7ABC4LIHOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2QQVNQILNBCFVYH7ABC4LIHOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2QQVNQILNBCFVYH7ABC4LIHOB/action/storage_attestation","attest_author":"https://pith.science/pith/Z2QQVNQILNBCFVYH7ABC4LIHOB/action/author_attestation","sign_citation":"https://pith.science/pith/Z2QQVNQILNBCFVYH7ABC4LIHOB/action/citation_signature","submit_replication":"https://pith.science/pith/Z2QQVNQILNBCFVYH7ABC4LIHOB/action/replication_record"}},"created_at":"2026-05-17T23:58:10.647590+00:00","updated_at":"2026-05-17T23:58:10.647590+00:00"}