{"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":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001904138,0.0003519556,0.0007676881,0.000196809,0.0001348732,0.0001073801,0.002882129,0.0001695245,0.000004266163],"category_scores_gemma":[0.000065576,0.000231486,0.0004465398,0.0006905039,0.0002064373,0.0001377025,0.0005652118,0.002739023,8.151417e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001682444,"about_ca_system_score_gemma":0.001558018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000113616,"about_ca_topic_score_gemma":0.000009161955,"domain_scores_codex":[0.9974104,0.0004896187,0.0005972463,0.0003103814,0.0006295542,0.000562781],"domain_scores_gemma":[0.9966848,0.0005453184,0.001293233,0.0007164092,0.0006274885,0.000132724],"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.0002489481,0.0002197899,0.0001265288,0.00007378012,0.0006115952,0.00003829651,0.00155717,0.0003065013,0.0006363233,0.9939612,0.00004415877,0.002175704],"study_design_scores_gemma":[0.0007859913,0.002031639,0.0003680374,0.0002270046,0.0002611286,0.0002132161,0.00008466894,0.0007178666,0.009417141,0.9852552,0.0003472655,0.0002907834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.173074,0.002746116,0.8205726,0.002107716,0.0004762255,0.0002182301,0.000005248524,0.00004502566,0.0007548292],"genre_scores_gemma":[0.9985619,0.0006881932,0.0005056254,0.0001053917,0.00009824081,0.000003936916,9.27513e-7,0.00002133564,0.00001444342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8254879,"threshold_uncertainty_score":0.9995617,"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."}}