{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:E4IB2RSQ22XCTZKADHM7EUBHJ2","short_pith_number":"pith:E4IB2RSQ","schema_version":"1.0","canonical_sha256":"27101d4650d6ae29e54019d9f250274e96acc666c9c8f59414ac16bd48304a7b","source":{"kind":"arxiv","id":"2302.00248","version":1},"attestation_state":"computed","paper":{"title":"A Nearly-Optimal Bound for Fast Regression with $\\ell_\\infty$ Guarantee","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Junze Yin, Lichen Zhang, Mingquan Ye, Zhao Song","submitted_at":"2023-02-01T05:22:40Z","abstract_excerpt":"Given a matrix $A\\in \\mathbb{R}^{n\\times d}$ and a vector $b\\in \\mathbb{R}^n$, we consider the regression problem with $\\ell_\\infty$ guarantees: finding a vector $x'\\in \\mathbb{R}^d$ such that $ \\|x'-x^*\\|_\\infty \\leq \\frac{\\epsilon}{\\sqrt{d}}\\cdot \\|Ax^*-b\\|_2\\cdot \\|A^\\dagger\\|$ where $x^*=\\arg\\min_{x\\in \\mathbb{R}^d}\\|Ax-b\\|_2$. One popular approach for solving such $\\ell_2$ regression problem is via sketching: picking a structured random matrix $S\\in \\mathbb{R}^{m\\times n}$ with $m\\ll n$ and $SA$ can be quickly computed, solve the ``sketched'' regression problem $\\arg\\min_{x\\in \\mathbb{R}^"},"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":"2302.00248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-01T05:22:40Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"33c9689fadc40dc33c65f706f6621e2b33e68772951225970a9ac379dc12c8d9","abstract_canon_sha256":"5d5b5f8ad0c7785b06bd05ae65e4ac6c7f145e4991077c35bef3c1b00beef936"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:01.309597Z","signature_b64":"fkl1idYPaQPh40oIb/YXPlRyzRuWx6wO8CHFt042u48hYaRRrmw1irP+hh7clOlkZpS0mzZMneYX6VByw4FjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27101d4650d6ae29e54019d9f250274e96acc666c9c8f59414ac16bd48304a7b","last_reissued_at":"2026-07-05T05:38:01.309219Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:01.309219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nearly-Optimal Bound for Fast Regression with $\\ell_\\infty$ Guarantee","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Junze Yin, Lichen Zhang, Mingquan Ye, Zhao Song","submitted_at":"2023-02-01T05:22:40Z","abstract_excerpt":"Given a matrix $A\\in \\mathbb{R}^{n\\times d}$ and a vector $b\\in \\mathbb{R}^n$, we consider the regression problem with $\\ell_\\infty$ guarantees: finding a vector $x'\\in \\mathbb{R}^d$ such that $ \\|x'-x^*\\|_\\infty \\leq \\frac{\\epsilon}{\\sqrt{d}}\\cdot \\|Ax^*-b\\|_2\\cdot \\|A^\\dagger\\|$ where $x^*=\\arg\\min_{x\\in \\mathbb{R}^d}\\|Ax-b\\|_2$. One popular approach for solving such $\\ell_2$ regression problem is via sketching: picking a structured random matrix $S\\in \\mathbb{R}^{m\\times n}$ with $m\\ll n$ and $SA$ can be quickly computed, solve the ``sketched'' regression problem $\\arg\\min_{x\\in \\mathbb{R}^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00248","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/2302.00248/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":"2302.00248","created_at":"2026-07-05T05:38:01.309277+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.00248v1","created_at":"2026-07-05T05:38:01.309277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00248","created_at":"2026-07-05T05:38:01.309277+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4IB2RSQ22XC","created_at":"2026-07-05T05:38:01.309277+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4IB2RSQ22XCTZKA","created_at":"2026-07-05T05:38:01.309277+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4IB2RSQ","created_at":"2026-07-05T05:38:01.309277+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.11892","citing_title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","ref_index":168,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E4IB2RSQ22XCTZKADHM7EUBHJ2","json":"https://pith.science/pith/E4IB2RSQ22XCTZKADHM7EUBHJ2.json","graph_json":"https://pith.science/api/pith-number/E4IB2RSQ22XCTZKADHM7EUBHJ2/graph.json","events_json":"https://pith.science/api/pith-number/E4IB2RSQ22XCTZKADHM7EUBHJ2/events.json","paper":"https://pith.science/paper/E4IB2RSQ"},"agent_actions":{"view_html":"https://pith.science/pith/E4IB2RSQ22XCTZKADHM7EUBHJ2","download_json":"https://pith.science/pith/E4IB2RSQ22XCTZKADHM7EUBHJ2.json","view_paper":"https://pith.science/paper/E4IB2RSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.00248&json=true","fetch_graph":"https://pith.science/api/pith-number/E4IB2RSQ22XCTZKADHM7EUBHJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/E4IB2RSQ22XCTZKADHM7EUBHJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4IB2RSQ22XCTZKADHM7EUBHJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4IB2RSQ22XCTZKADHM7EUBHJ2/action/storage_attestation","attest_author":"https://pith.science/pith/E4IB2RSQ22XCTZKADHM7EUBHJ2/action/author_attestation","sign_citation":"https://pith.science/pith/E4IB2RSQ22XCTZKADHM7EUBHJ2/action/citation_signature","submit_replication":"https://pith.science/pith/E4IB2RSQ22XCTZKADHM7EUBHJ2/action/replication_record"}},"created_at":"2026-07-05T05:38:01.309277+00:00","updated_at":"2026-07-05T05:38:01.309277+00:00"}