{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00389496,0.001136788,0.001865176,0.001166158,0.001628501,0.003872833,0.002940929,0.002706726,0.008001473],"category_scores_gemma":[0.03007859,0.0006953355,0.001441402,0.001732643,0.005759649,0.01362136,0.006747338,0.008118578,0.0018488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002891083,"about_ca_system_score_gemma":0.00298148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001446882,"about_ca_topic_score_gemma":0.0007399424,"domain_scores_codex":[0.9918417,0.001932597,0.000502402,0.00163934,0.002563033,0.001520959],"domain_scores_gemma":[0.9660667,0.02315965,0.001782662,0.006161112,0.001756313,0.001073535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009138726,0.0002670157,0.0005694237,0.0003453265,0.00003132165,0.0001986428,0.0009693912,0.0344157,0.008961018,0.9074205,0.004260863,0.04164707],"study_design_scores_gemma":[0.0001319729,0.0002873568,0.0002769427,0.00008123727,0.00003238723,0.0003016072,0.0001923265,0.1268729,0.0067852,0.8605378,0.004415562,0.00008475202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2257553,0.002616385,0.71445,0.004426692,0.0002079472,0.0004113654,0.001225103,0.001674168,0.04923311],"genre_scores_gemma":[0.8810504,0.001567437,0.1036063,0.001931745,0.0003700407,0.0005142172,0.0009712015,0.0006572399,0.009331393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008001473,"threshold_uncertainty_score":0.02676761,"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."}}