{"id":"W7104183500","doi":"","title":"Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Johns Hopkins University; National Science Foundation","keywords":"Code word; Soundness; Equivalence (formal languages); Constant (computer programming); Code (set theory); Simple (philosophy); Decoding methods; Upper and lower bounds","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000804541,0.0004723683,0.0006050793,0.0001857032,0.001292143,0.0002974278,0.001023147,0.0002167699,0.00004658538],"category_scores_gemma":[0.0003232577,0.0004448411,0.0001850782,0.00133144,0.001919726,0.0008535326,0.0007173631,0.0004564211,0.00002494594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001115319,"about_ca_system_score_gemma":0.0006756527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001436775,"about_ca_topic_score_gemma":0.0009076026,"domain_scores_codex":[0.9966429,0.0001939653,0.0007294653,0.001365956,0.0003222401,0.0007454562],"domain_scores_gemma":[0.9966261,0.001098869,0.0002140185,0.00129227,0.0005170243,0.0002517421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002405503,0.002058448,0.5555741,0.003303866,0.0008704285,0.00006222496,0.007516353,0.002307393,0.0007798618,0.3116753,0.003627171,0.1098193],"study_design_scores_gemma":[0.003799931,0.003774395,0.1695778,0.001533995,0.0003552163,0.00006930711,0.0009101238,0.734811,0.004327716,0.04218993,0.03694649,0.001704026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.358349,0.0009601429,0.635345,0.003631693,0.0005461744,0.0007143584,0.00005718295,0.0001217078,0.0002746826],"genre_scores_gemma":[0.9374343,0.0003893982,0.05968824,0.0007847641,0.0001249676,0.0001547546,0.00001168155,0.00001934652,0.00139254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7325037,"threshold_uncertainty_score":0.9998003,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04180053756089817,"score_gpt":0.3092755671036367,"score_spread":0.2674750295427386,"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."}}