{"id":"W4301206442","doi":"10.48550/arxiv.1010.1481","title":"A Simple Deterministic Reduction for the Gap Minimum Distance of Code\\n Problem","year":2010,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Reduction (mathematics); Mathematics; Constant (computer programming); Simple (philosophy); Coding (social sciences); Minimum distance; Code (set theory); Discrete mathematics; Finite field; Combinatorics; Algorithm; Computer science; Statistics; Geometry","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.001418337,0.001097493,0.001112562,0.0007527938,0.002019441,0.002703646,0.00350506,0.002399114,0.009461836],"category_scores_gemma":[0.008575101,0.0006075563,0.002387076,0.001051453,0.00249328,0.004578306,0.006408486,0.006421932,0.002216271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002787078,"about_ca_system_score_gemma":0.003616936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002159861,"about_ca_topic_score_gemma":0.002881044,"domain_scores_codex":[0.9968606,0.0007011632,0.0001257699,0.0008744974,0.0009307117,0.0005072788],"domain_scores_gemma":[0.9949582,0.002931129,0.0002084107,0.001351762,0.0002970611,0.0002533975],"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.000535536,0.0004206225,0.0009516674,0.0007277381,0.0001305319,0.0002725923,0.0005329071,0.07693967,0.01102437,0.7569385,0.03849512,0.1130308],"study_design_scores_gemma":[0.0002053576,0.0001672818,0.0005154621,0.00006982871,0.00009299558,0.0003240458,0.0001074283,0.18638,0.01012971,0.7831268,0.01880703,0.00007408501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07029248,0.0007363663,0.8512647,0.007672063,0.000713549,0.0005060422,0.001527705,0.002429693,0.06485741],"genre_scores_gemma":[0.5919453,0.0006805192,0.3712789,0.002601796,0.0005669662,0.001011626,0.002319427,0.001246797,0.0283487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009461836,"threshold_uncertainty_score":0.03165305,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1028429319806388,"score_gpt":0.2227120243502111,"score_spread":0.1198690923695724,"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."}}