{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004070984,0.00204394,0.002515418,0.00128029,0.002220621,0.006104021,0.003277349,0.002621744,0.008484778],"category_scores_gemma":[0.03459249,0.001233668,0.00369857,0.002279013,0.005879619,0.01274492,0.006016494,0.01124724,0.001887942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003193292,"about_ca_system_score_gemma":0.00308265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002433958,"about_ca_topic_score_gemma":0.001923818,"domain_scores_codex":[0.9923502,0.002257928,0.0003954166,0.002120031,0.001977306,0.0008990277],"domain_scores_gemma":[0.9548645,0.03548724,0.002192229,0.004899421,0.001567421,0.0009891237],"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.0009970611,0.0005254223,0.00418897,0.001252267,0.0002217513,0.0003077064,0.001237083,0.2253576,0.008551572,0.6543807,0.02128882,0.08169113],"study_design_scores_gemma":[0.0001254502,0.000129049,0.0004233009,0.000070526,0.00005347105,0.0001989168,0.0002317802,0.2128886,0.006116861,0.7751058,0.004603972,0.00005210319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1768573,0.002091927,0.7762586,0.01299879,0.0003323545,0.0002444989,0.001964072,0.001767053,0.02748545],"genre_scores_gemma":[0.7585166,0.002291883,0.2184543,0.002564358,0.001189313,0.0007457504,0.002907061,0.001003379,0.01232748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008484778,"threshold_uncertainty_score":0.02838445,"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."}}