{"id":"W2069390698","doi":"10.1007/s10801-009-0191-2","title":"Bounds on permutation codes of distance four","year":2009,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamming distance; Permutation (music); Bit-reversal permutation; Minimum distance; Partial permutation; Permutation graph; Hamming code; Discrete mathematics; Set (abstract data type); Hamming graph; Upper and lower bounds; Cyclic permutation; Hamming bound; Symmetric group; Block code; Algorithm; Decoding methods; Graph; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0003240521,0.0001048326,0.000251134,0.0001397323,0.00003521778,0.00002093969,0.0001581028,0.00005703555,0.000008978656],"category_scores_gemma":[0.00005082953,0.00009368948,0.0001166954,0.0002604639,0.00001996038,0.0001370089,0.000003287209,0.0001937037,0.000003246369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006864798,"about_ca_system_score_gemma":0.00001890923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.265449e-7,"about_ca_topic_score_gemma":3.360271e-7,"domain_scores_codex":[0.9990865,0.00003784271,0.0004196473,0.00005207824,0.0002828881,0.0001210293],"domain_scores_gemma":[0.9993964,0.00008402964,0.0001997435,0.0001229632,0.0001323892,0.00006441113],"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.0001144529,0.0002604103,0.001213642,0.000158433,0.0001270503,0.00007285335,0.001259658,0.004620067,0.006478496,0.9761705,0.002574043,0.006950365],"study_design_scores_gemma":[0.002141758,0.002153396,0.03274024,0.0005293792,0.00009091273,0.0002416954,0.0004937663,0.00273276,0.01331752,0.9374582,0.007672091,0.0004282666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9913456,0.0007743452,0.003352597,0.00008376155,0.001076628,0.00004856741,0.000002314737,0.00002801568,0.003288108],"genre_scores_gemma":[0.9997321,0.00006916079,0.00003742978,0.00002257316,0.00006291387,4.365333e-7,5.961328e-7,0.00001083865,0.00006391939],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03871231,"threshold_uncertainty_score":0.3820546,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007109176898238282,"score_gpt":0.2014739093087451,"score_spread":0.1943647324105068,"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."}}