{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:S46RSENO2IOVYQLTOPR7V4V25G","short_pith_number":"pith:S46RSENO","schema_version":"1.0","canonical_sha256":"973d1911aed21d5c417373e3faf2bae9b2216b27389b4043a42a12ec40e3201f","source":{"kind":"arxiv","id":"2111.01848","version":2},"attestation_state":"computed","paper":{"title":"Improved Iteration Complexities for Overconstrained $p$-Norm Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati, Yang P. Liu","submitted_at":"2021-11-02T19:10:19Z","abstract_excerpt":"In this paper we obtain improved iteration complexities for solving $\\ell_p$ regression. We provide methods which given any full-rank $\\mathbf{A} \\in \\mathbb{R}^{n \\times d}$ with $n \\geq d$, $b \\in \\mathbb{R}^n$, and $p \\geq 2$ solve $\\min_{x \\in \\mathbb{R}^d} \\left\\|\\mathbf{A} x - b\\right\\|_p$ to high precision in time dominated by that of solving $\\widetilde{O}_p(d^{\\frac{p-2}{3p-2}})$ linear systems in $\\mathbf{A}^\\top \\mathbf{D} \\mathbf{A}$ for positive diagonal matrices $\\mathbf{D}$. This improves upon the previous best iteration complexity of $\\widetilde{O}_p(n^{\\frac{p-2}{3p-2}})$ (Adi"},"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":"2111.01848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-02T19:10:19Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2378e651f370c619ddd14f15cc8d49199303a080fbc705590bf91eaaa9a8a934","abstract_canon_sha256":"70c44a2cc5fe6f385f748f68c57737eb791108133ce0510cba3446733b7df0bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:30:42.472517Z","signature_b64":"5yeE8HwG7LihT2KXzBfC55n0P++gSDEmx2+J8R4dphoP84zqeoaQO0Cb5LEFtLvNQktt4desrttqVCgPk0JiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"973d1911aed21d5c417373e3faf2bae9b2216b27389b4043a42a12ec40e3201f","last_reissued_at":"2026-07-05T03:30:42.472034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:30:42.472034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Iteration Complexities for Overconstrained $p$-Norm Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati, Yang P. Liu","submitted_at":"2021-11-02T19:10:19Z","abstract_excerpt":"In this paper we obtain improved iteration complexities for solving $\\ell_p$ regression. We provide methods which given any full-rank $\\mathbf{A} \\in \\mathbb{R}^{n \\times d}$ with $n \\geq d$, $b \\in \\mathbb{R}^n$, and $p \\geq 2$ solve $\\min_{x \\in \\mathbb{R}^d} \\left\\|\\mathbf{A} x - b\\right\\|_p$ to high precision in time dominated by that of solving $\\widetilde{O}_p(d^{\\frac{p-2}{3p-2}})$ linear systems in $\\mathbf{A}^\\top \\mathbf{D} \\mathbf{A}$ for positive diagonal matrices $\\mathbf{D}$. This improves upon the previous best iteration complexity of $\\widetilde{O}_p(n^{\\frac{p-2}{3p-2}})$ (Adi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.01848","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.01848/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":"2111.01848","created_at":"2026-07-05T03:30:42.472091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.01848v2","created_at":"2026-07-05T03:30:42.472091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.01848","created_at":"2026-07-05T03:30:42.472091+00:00"},{"alias_kind":"pith_short_12","alias_value":"S46RSENO2IOV","created_at":"2026-07-05T03:30:42.472091+00:00"},{"alias_kind":"pith_short_16","alias_value":"S46RSENO2IOVYQLT","created_at":"2026-07-05T03:30:42.472091+00:00"},{"alias_kind":"pith_short_8","alias_value":"S46RSENO","created_at":"2026-07-05T03:30:42.472091+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00252","citing_title":"Distributionally Robust Linear Regression With Block Lewis Weights","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S46RSENO2IOVYQLTOPR7V4V25G","json":"https://pith.science/pith/S46RSENO2IOVYQLTOPR7V4V25G.json","graph_json":"https://pith.science/api/pith-number/S46RSENO2IOVYQLTOPR7V4V25G/graph.json","events_json":"https://pith.science/api/pith-number/S46RSENO2IOVYQLTOPR7V4V25G/events.json","paper":"https://pith.science/paper/S46RSENO"},"agent_actions":{"view_html":"https://pith.science/pith/S46RSENO2IOVYQLTOPR7V4V25G","download_json":"https://pith.science/pith/S46RSENO2IOVYQLTOPR7V4V25G.json","view_paper":"https://pith.science/paper/S46RSENO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.01848&json=true","fetch_graph":"https://pith.science/api/pith-number/S46RSENO2IOVYQLTOPR7V4V25G/graph.json","fetch_events":"https://pith.science/api/pith-number/S46RSENO2IOVYQLTOPR7V4V25G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S46RSENO2IOVYQLTOPR7V4V25G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S46RSENO2IOVYQLTOPR7V4V25G/action/storage_attestation","attest_author":"https://pith.science/pith/S46RSENO2IOVYQLTOPR7V4V25G/action/author_attestation","sign_citation":"https://pith.science/pith/S46RSENO2IOVYQLTOPR7V4V25G/action/citation_signature","submit_replication":"https://pith.science/pith/S46RSENO2IOVYQLTOPR7V4V25G/action/replication_record"}},"created_at":"2026-07-05T03:30:42.472091+00:00","updated_at":"2026-07-05T03:30:42.472091+00:00"}