{"id":"W2810042661","doi":"10.37236/8040","title":"$2$-Neighbour-Transitive Codes with Small Blocks of Imprimitivity","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transitive relation; Combinatorics; Mathematics; Hamming graph; Corollary; Transitive closure; Partition (number theory); Alphabet; Affine transformation; Discrete mathematics; Hamming distance; Hamming code; Block code; Algorithm; Pure mathematics; Decoding methods","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.0003636192,0.0003456267,0.0005540929,0.001068028,0.0009522453,0.00117897,0.0006470236,0.0006260038,0.002008428],"category_scores_gemma":[0.002909953,0.0003483463,0.0006143182,0.0008363875,0.002062738,0.0009278047,0.001231538,0.000716315,0.0003778997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000525891,"about_ca_system_score_gemma":0.0005090078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303827,"about_ca_topic_score_gemma":0.001500601,"domain_scores_codex":[0.9989266,0.0001666974,0.0001022369,0.0002181723,0.0003570783,0.0002291564],"domain_scores_gemma":[0.9969336,0.001029871,0.0006471267,0.0008311776,0.0002447658,0.0003134309],"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.0008184512,0.00009180999,0.009181915,0.0002265373,0.00006366865,0.001281601,0.001520863,0.03195594,0.03332151,0.8715672,0.001931148,0.0480393],"study_design_scores_gemma":[0.00008919767,0.0004319013,0.01271601,0.00009199086,0.00008519211,0.003680994,0.0006159695,0.08590303,0.0292292,0.8536357,0.01337871,0.0001421405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9404345,0.0003076419,0.03812889,0.0001287765,0.00003548003,0.00003677094,0.000292794,0.00009766881,0.02053751],"genre_scores_gemma":[0.9893701,0.0001334111,0.00735238,0.00004984538,0.00003014207,0.00003651537,0.0003068957,0.00002818217,0.002692534],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.002008428,"threshold_uncertainty_score":0.006718874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01501799337883426,"score_gpt":0.2166902646668627,"score_spread":0.2016722712880284,"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."}}