{"id":"W2883399088","doi":"10.1016/j.jcta.2019.105173","title":"Minimal binary 2-neighbour-transitive codes","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Australian Research Council","keywords":"Transitive relation; Mathematics; Combinatorics; Alphabet; Permutation (music); Mathematical proof; Discrete mathematics; Transitive closure; Binary number; Permutation group; Class (philosophy); Cyclic permutation; Symmetric group; Computer science; Arithmetic","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003222866,0.0005271201,0.001124983,0.0005368232,0.0001937009,0.000492111,0.003015773,0.0004640322,0.00009892959],"category_scores_gemma":[0.0002164912,0.0004644743,0.0009639415,0.0004125288,0.0003085312,0.001027043,0.001280796,0.001654618,0.00001911912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001006907,"about_ca_system_score_gemma":0.0006737065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002179602,"about_ca_topic_score_gemma":2.893854e-7,"domain_scores_codex":[0.9960877,0.001182788,0.001007982,0.0004842402,0.0007804301,0.0004568834],"domain_scores_gemma":[0.9957982,0.0008543191,0.001385733,0.0009997074,0.0007329136,0.0002291488],"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.002210393,0.0002561356,0.00007108009,0.0001248675,0.0004556959,0.0002406461,0.002278416,0.0002651607,0.0007432899,0.9907416,0.0008112979,0.001801416],"study_design_scores_gemma":[0.001238337,0.001955367,0.0002700052,0.0005287135,0.0001313125,0.0002410838,0.0003520054,0.0001233587,0.002284324,0.983853,0.00848046,0.0005419626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5618155,0.006200597,0.2781393,0.003311764,0.1282464,0.001273214,0.0001120043,0.0004582159,0.02044299],"genre_scores_gemma":[0.9934071,0.0002731556,0.004443195,0.0001592305,0.001467364,0.000007371358,0.000003982158,0.00003901124,0.0001996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4315916,"threshold_uncertainty_score":0.9997807,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01077805819466981,"score_gpt":0.2373821752603489,"score_spread":0.2266041170656791,"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."}}