{"id":"W7128646609","doi":"10.1109/focs63196.2025.00068","title":"Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices","year":2025,"lang":"","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear subspace; Ball (mathematics); Reduction (mathematics); Subspace topology; Completeness (order theory); Lattice problem; Hardness of approximation; Randomized algorithm; Property testing","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001371532,0.0002713402,0.0005693682,0.0005510513,0.0001625345,0.000200737,0.0008384261,0.0001526968,0.00007388434],"category_scores_gemma":[0.0002103339,0.0002733534,0.00009503567,0.002294181,0.0006868982,0.0005153189,0.001036609,0.0003627712,0.000001901598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006978836,"about_ca_system_score_gemma":0.0002369333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001475017,"about_ca_topic_score_gemma":0.002185638,"domain_scores_codex":[0.9975171,0.0002554334,0.0006925354,0.0007979456,0.0002819452,0.0004550031],"domain_scores_gemma":[0.9981872,0.0007045264,0.0001818808,0.0007337535,0.00009854532,0.00009413288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004998448,0.0007102488,0.3776838,0.0009090482,0.00007136635,0.00001413257,0.003173578,0.0001012344,0.0001812776,0.4661011,0.0001386487,0.1508656],"study_design_scores_gemma":[0.001438725,0.000236603,0.4174271,0.0008505139,0.00004277021,0.00000610565,0.0007857446,0.4791011,0.004799374,0.09354848,0.001215251,0.0005482595],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9295474,0.003208675,0.05659417,0.001401642,0.0008415548,0.0004953612,0.00001284047,0.00005459057,0.007843769],"genre_scores_gemma":[0.9728997,0.0003018986,0.02629244,0.00008194451,0.00001510721,0.000007605755,0.000001008619,0.000004554367,0.0003957419],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4789999,"threshold_uncertainty_score":0.9999719,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03119295982353141,"score_gpt":0.2880982432880844,"score_spread":0.256905283464553,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}