{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GWELDXLHWYFXV6FFY2ORGXXAW7","short_pith_number":"pith:GWELDXLH","schema_version":"1.0","canonical_sha256":"3588b1dd67b60b7af8a5c69d135ee0b7c0f5258fc1ae98e43710bbf1136f90ac","source":{"kind":"arxiv","id":"1609.08739","version":2},"attestation_state":"computed","paper":{"title":"Approximate Sparse Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Piotr Indyk, Sariel Har-Peled, Sepideh Mahabadi","submitted_at":"2016-09-28T02:36:46Z","abstract_excerpt":"In the Sparse Linear Regression (SLR) problem, given a $d \\times n$ matrix $M$ and a $d$-dimensional query $q$, the goal is to compute a $k$-sparse $n$-dimensional vector $\\tau$ such that the error $||M \\tau-q||$ is minimized. This problem is equivalent to the following geometric problem: given a set $P$ of $n$ points and a query point $q$ in $d$ dimensions, find the closest $k$-dimensional subspace to $q$, that is spanned by a subset of $k$ points in $P$. In this paper, we present data-structures/algorithms and conditional lower bounds for several variants of this problem (such as finding the"},"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":"1609.08739","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-09-28T02:36:46Z","cross_cats_sorted":[],"title_canon_sha256":"a66744bae4206dfef137ad15a305bf6f33c5ad67ab8ffb7f0fa28e2b636d2281","abstract_canon_sha256":"836daafa90bfaf38f99a44169b446b5abb8c080ec79fef3e7e183c9961a70025"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:19.703599Z","signature_b64":"zDyQLM6GAE0H2PSaxVqdu/3udRA4QEwZv+LnWtW3ku7bM95K0rH7LLZe7F/JyFybU4ysHK5jTIgvEAPwrJoOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3588b1dd67b60b7af8a5c69d135ee0b7c0f5258fc1ae98e43710bbf1136f90ac","last_reissued_at":"2026-05-18T00:17:19.703030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:19.703030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Sparse Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Piotr Indyk, Sariel Har-Peled, Sepideh Mahabadi","submitted_at":"2016-09-28T02:36:46Z","abstract_excerpt":"In the Sparse Linear Regression (SLR) problem, given a $d \\times n$ matrix $M$ and a $d$-dimensional query $q$, the goal is to compute a $k$-sparse $n$-dimensional vector $\\tau$ such that the error $||M \\tau-q||$ is minimized. This problem is equivalent to the following geometric problem: given a set $P$ of $n$ points and a query point $q$ in $d$ dimensions, find the closest $k$-dimensional subspace to $q$, that is spanned by a subset of $k$ points in $P$. In this paper, we present data-structures/algorithms and conditional lower bounds for several variants of this problem (such as finding the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08739","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":""},"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":"1609.08739","created_at":"2026-05-18T00:17:19.703122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08739v2","created_at":"2026-05-18T00:17:19.703122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08739","created_at":"2026-05-18T00:17:19.703122+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWELDXLHWYFX","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWELDXLHWYFXV6FF","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWELDXLH","created_at":"2026-05-18T12:30:19.053100+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/GWELDXLHWYFXV6FFY2ORGXXAW7","json":"https://pith.science/pith/GWELDXLHWYFXV6FFY2ORGXXAW7.json","graph_json":"https://pith.science/api/pith-number/GWELDXLHWYFXV6FFY2ORGXXAW7/graph.json","events_json":"https://pith.science/api/pith-number/GWELDXLHWYFXV6FFY2ORGXXAW7/events.json","paper":"https://pith.science/paper/GWELDXLH"},"agent_actions":{"view_html":"https://pith.science/pith/GWELDXLHWYFXV6FFY2ORGXXAW7","download_json":"https://pith.science/pith/GWELDXLHWYFXV6FFY2ORGXXAW7.json","view_paper":"https://pith.science/paper/GWELDXLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08739&json=true","fetch_graph":"https://pith.science/api/pith-number/GWELDXLHWYFXV6FFY2ORGXXAW7/graph.json","fetch_events":"https://pith.science/api/pith-number/GWELDXLHWYFXV6FFY2ORGXXAW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWELDXLHWYFXV6FFY2ORGXXAW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWELDXLHWYFXV6FFY2ORGXXAW7/action/storage_attestation","attest_author":"https://pith.science/pith/GWELDXLHWYFXV6FFY2ORGXXAW7/action/author_attestation","sign_citation":"https://pith.science/pith/GWELDXLHWYFXV6FFY2ORGXXAW7/action/citation_signature","submit_replication":"https://pith.science/pith/GWELDXLHWYFXV6FFY2ORGXXAW7/action/replication_record"}},"created_at":"2026-05-18T00:17:19.703122+00:00","updated_at":"2026-05-18T00:17:19.703122+00:00"}