{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5SRH7YXLU5LFSIPFZ42SUH4C5A","short_pith_number":"pith:5SRH7YXL","schema_version":"1.0","canonical_sha256":"eca27fe2eba7565921e5cf352a1f82e823368665d66ad2dd3d8fd508e7f5445a","source":{"kind":"arxiv","id":"1711.04952","version":2},"attestation_state":"computed","paper":{"title":"Sparse High-Dimensional Linear Regression. Algorithmic Barriers and a Local Search Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"David Gamarnik, Ilias Zadik","submitted_at":"2017-11-14T05:20:20Z","abstract_excerpt":"We consider a sparse high dimensional regression model where the goal is to recover a $k$-sparse unknown vector $\\beta^*$ from $n$ noisy linear observations of the form $Y=X\\beta^*+W \\in \\mathbb{R}^n$ where $X \\in \\mathbb{R}^{n \\times p}$ has iid $N(0,1)$ entries and $W \\in \\mathbb{R}^n$ has iid $N(0,\\sigma^2)$ entries. Under certain assumptions on the parameters, an intriguing assymptotic gap appears between the minimum value of $n$, call it $n^*$, for which the recovery is information theoretically possible, and the minimum value of $n$, call it $n_{\\mathrm{alg}}$, for which an efficient alg"},"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":"1711.04952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-14T05:20:20Z","cross_cats_sorted":["math.PR","stat.ML","stat.TH"],"title_canon_sha256":"1b27bff46194be86d736640caee13a6b26d9ad684e9c95b352c216b572773742","abstract_canon_sha256":"947f0da556579690969695fd046bdab21a4fc7de905cddb770762c25308c2c8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:06:03.701993Z","signature_b64":"1pAjmEwpuZ4qLW//oD1CrTh5hUbMpRwTmFX5wM+V/3TVHMy7B3Ib7Q2Rm4ZGqUt6sZjfiJAbxFrZT61NWymlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eca27fe2eba7565921e5cf352a1f82e823368665d66ad2dd3d8fd508e7f5445a","last_reissued_at":"2026-07-05T00:06:03.701585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:06:03.701585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse High-Dimensional Linear Regression. Algorithmic Barriers and a Local Search Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"David Gamarnik, Ilias Zadik","submitted_at":"2017-11-14T05:20:20Z","abstract_excerpt":"We consider a sparse high dimensional regression model where the goal is to recover a $k$-sparse unknown vector $\\beta^*$ from $n$ noisy linear observations of the form $Y=X\\beta^*+W \\in \\mathbb{R}^n$ where $X \\in \\mathbb{R}^{n \\times p}$ has iid $N(0,1)$ entries and $W \\in \\mathbb{R}^n$ has iid $N(0,\\sigma^2)$ entries. Under certain assumptions on the parameters, an intriguing assymptotic gap appears between the minimum value of $n$, call it $n^*$, for which the recovery is information theoretically possible, and the minimum value of $n$, call it $n_{\\mathrm{alg}}$, for which an efficient alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04952","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/1711.04952/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":"1711.04952","created_at":"2026-07-05T00:06:03.701635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04952v2","created_at":"2026-07-05T00:06:03.701635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04952","created_at":"2026-07-05T00:06:03.701635+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SRH7YXLU5LF","created_at":"2026-07-05T00:06:03.701635+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SRH7YXLU5LFSIPF","created_at":"2026-07-05T00:06:03.701635+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SRH7YXL","created_at":"2026-07-05T00:06:03.701635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.11636","citing_title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5SRH7YXLU5LFSIPFZ42SUH4C5A","json":"https://pith.science/pith/5SRH7YXLU5LFSIPFZ42SUH4C5A.json","graph_json":"https://pith.science/api/pith-number/5SRH7YXLU5LFSIPFZ42SUH4C5A/graph.json","events_json":"https://pith.science/api/pith-number/5SRH7YXLU5LFSIPFZ42SUH4C5A/events.json","paper":"https://pith.science/paper/5SRH7YXL"},"agent_actions":{"view_html":"https://pith.science/pith/5SRH7YXLU5LFSIPFZ42SUH4C5A","download_json":"https://pith.science/pith/5SRH7YXLU5LFSIPFZ42SUH4C5A.json","view_paper":"https://pith.science/paper/5SRH7YXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04952&json=true","fetch_graph":"https://pith.science/api/pith-number/5SRH7YXLU5LFSIPFZ42SUH4C5A/graph.json","fetch_events":"https://pith.science/api/pith-number/5SRH7YXLU5LFSIPFZ42SUH4C5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SRH7YXLU5LFSIPFZ42SUH4C5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SRH7YXLU5LFSIPFZ42SUH4C5A/action/storage_attestation","attest_author":"https://pith.science/pith/5SRH7YXLU5LFSIPFZ42SUH4C5A/action/author_attestation","sign_citation":"https://pith.science/pith/5SRH7YXLU5LFSIPFZ42SUH4C5A/action/citation_signature","submit_replication":"https://pith.science/pith/5SRH7YXLU5LFSIPFZ42SUH4C5A/action/replication_record"}},"created_at":"2026-07-05T00:06:03.701635+00:00","updated_at":"2026-07-05T00:06:03.701635+00:00"}