{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:O6VK3XTWQSFB27R4OJMK2BQGH6","short_pith_number":"pith:O6VK3XTW","canonical_record":{"source":{"id":"1412.4832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-15T23:15:40Z","cross_cats_sorted":[],"title_canon_sha256":"d5acad2b5884a63cc74e9b62380802735dcdf618a65651eb74c378172741d956","abstract_canon_sha256":"1a96a89206c13d0f6f68c19afab5715fc662189f8450126a900bef10dc7d3522"},"schema_version":"1.0"},"canonical_sha256":"77aaadde76848a1d7e3c7258ad06063f81106761c43e2ffcf991700c3b2e88de","source":{"kind":"arxiv","id":"1412.4832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4832","created_at":"2026-05-18T02:31:10Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4832v1","created_at":"2026-05-18T02:31:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4832","created_at":"2026-05-18T02:31:10Z"},{"alias_kind":"pith_short_12","alias_value":"O6VK3XTWQSFB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O6VK3XTWQSFB27R4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O6VK3XTW","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:O6VK3XTWQSFB27R4OJMK2BQGH6","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-15T23:15:40Z","cross_cats_sorted":[],"title_canon_sha256":"d5acad2b5884a63cc74e9b62380802735dcdf618a65651eb74c378172741d956","abstract_canon_sha256":"1a96a89206c13d0f6f68c19afab5715fc662189f8450126a900bef10dc7d3522"},"schema_version":"1.0"},"canonical_sha256":"77aaadde76848a1d7e3c7258ad06063f81106761c43e2ffcf991700c3b2e88de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:10.378717Z","signature_b64":"rC9EcCvMkZGx2XAe4zmwo/TtcItoQsvmadD0iK7oQMbx5zGyBd2JToHQBw2NWDEyV6YaKFkZcS1Ne/gbnow/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77aaadde76848a1d7e3c7258ad06063f81106761c43e2ffcf991700c3b2e88de","last_reissued_at":"2026-05-18T02:31:10.378257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:10.378257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4832","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kTjnSvQeyAFVFUlXaxR9GioKTrFESc7AnevfXnixwefNlL+y3KO/EVadIiOmgSGg/eIKi4klbGh/03ylYD1FDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:53:53.770691Z"},"content_sha256":"8b12113a5ca0f26d3a541a74465b3dcf9d82a6be267ec98f59deeaf078fb348a","schema_version":"1.0","event_id":"sha256:8b12113a5ca0f26d3a541a74465b3dcf9d82a6be267ec98f59deeaf078fb348a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:O6VK3XTWQSFB27R4OJMK2BQGH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable Selection is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dean Foster, Howard Karloff, Justin Thaler","submitted_at":"2014-12-15T23:15:40Z","abstract_excerpt":"Variable selection for sparse linear regression is the problem of finding, given an m x p matrix B and a target vector y, a sparse vector x such that Bx approximately equals y. Assuming a standard complexity hypothesis, we show that no polynomial-time algorithm can find a k'-sparse x with ||Bx-y||^2<=h(m,p), where k'=k*2^{log^{1-delta} p} and h(m,p)<=p^(C_1)*m^(1-C_2), where delta>0, C_1>0,C_2>0 are arbitrary. This is true even under the promise that there is an unknown k-sparse vector x^* satisfying Bx^*=y. We prove a similar result for a statistical version of the problem in which the data a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4832","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kBBleKNTSTrA8vzQKriQpC5WsxvqhMg25rXLuuUNclQ1EOPJZ/IMgZ3tkyrey2Gg0MQL976119E+MleMpIzFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:53:53.771037Z"},"content_sha256":"4b1c9a3a04500337ff695467d973710d0d8520ababc565e94a44bf96cd017aff","schema_version":"1.0","event_id":"sha256:4b1c9a3a04500337ff695467d973710d0d8520ababc565e94a44bf96cd017aff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6VK3XTWQSFB27R4OJMK2BQGH6/bundle.json","state_url":"https://pith.science/pith/O6VK3XTWQSFB27R4OJMK2BQGH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6VK3XTWQSFB27R4OJMK2BQGH6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T21:53:53Z","links":{"resolver":"https://pith.science/pith/O6VK3XTWQSFB27R4OJMK2BQGH6","bundle":"https://pith.science/pith/O6VK3XTWQSFB27R4OJMK2BQGH6/bundle.json","state":"https://pith.science/pith/O6VK3XTWQSFB27R4OJMK2BQGH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6VK3XTWQSFB27R4OJMK2BQGH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:O6VK3XTWQSFB27R4OJMK2BQGH6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1a96a89206c13d0f6f68c19afab5715fc662189f8450126a900bef10dc7d3522","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-15T23:15:40Z","title_canon_sha256":"d5acad2b5884a63cc74e9b62380802735dcdf618a65651eb74c378172741d956"},"schema_version":"1.0","source":{"id":"1412.4832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4832","created_at":"2026-05-18T02:31:10Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4832v1","created_at":"2026-05-18T02:31:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4832","created_at":"2026-05-18T02:31:10Z"},{"alias_kind":"pith_short_12","alias_value":"O6VK3XTWQSFB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O6VK3XTWQSFB27R4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O6VK3XTW","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:4b1c9a3a04500337ff695467d973710d0d8520ababc565e94a44bf96cd017aff","target":"graph","created_at":"2026-05-18T02:31:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Variable selection for sparse linear regression is the problem of finding, given an m x p matrix B and a target vector y, a sparse vector x such that Bx approximately equals y. Assuming a standard complexity hypothesis, we show that no polynomial-time algorithm can find a k'-sparse x with ||Bx-y||^2<=h(m,p), where k'=k*2^{log^{1-delta} p} and h(m,p)<=p^(C_1)*m^(1-C_2), where delta>0, C_1>0,C_2>0 are arbitrary. This is true even under the promise that there is an unknown k-sparse vector x^* satisfying Bx^*=y. We prove a similar result for a statistical version of the problem in which the data a","authors_text":"Dean Foster, Howard Karloff, Justin Thaler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-15T23:15:40Z","title":"Variable Selection is Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4832","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8b12113a5ca0f26d3a541a74465b3dcf9d82a6be267ec98f59deeaf078fb348a","target":"record","created_at":"2026-05-18T02:31:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1a96a89206c13d0f6f68c19afab5715fc662189f8450126a900bef10dc7d3522","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-15T23:15:40Z","title_canon_sha256":"d5acad2b5884a63cc74e9b62380802735dcdf618a65651eb74c378172741d956"},"schema_version":"1.0","source":{"id":"1412.4832","kind":"arxiv","version":1}},"canonical_sha256":"77aaadde76848a1d7e3c7258ad06063f81106761c43e2ffcf991700c3b2e88de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77aaadde76848a1d7e3c7258ad06063f81106761c43e2ffcf991700c3b2e88de","first_computed_at":"2026-05-18T02:31:10.378257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:10.378257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rC9EcCvMkZGx2XAe4zmwo/TtcItoQsvmadD0iK7oQMbx5zGyBd2JToHQBw2NWDEyV6YaKFkZcS1Ne/gbnow/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:10.378717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b12113a5ca0f26d3a541a74465b3dcf9d82a6be267ec98f59deeaf078fb348a","sha256:4b1c9a3a04500337ff695467d973710d0d8520ababc565e94a44bf96cd017aff"],"state_sha256":"1b96993620fb11ca0deacf05d748f2bddcf8de9f4990bcfabf635d874ac47aa7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nQvAyztWMWHHRTzHlP2ZtRM5PE69vwD2y1E8F9od4tXoM2fV2DDA9/9TGqwX776fPx8Rfhy9FRbOwgMyK6qDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:53:53.773068Z","bundle_sha256":"5321d9e83f8a942c3723be8242505b3f346bfffe4bed8af02d3f249d715e4c74"}}