{"id":"W2969368018","doi":"10.37236/8954","title":"On the 486-Vertex Distance-Regular Graphs of Koolen-Riebeek and Soicher","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Hrvatska Zaklada za Znanost","keywords":"Combinatorics; Mathematics; Antipodal point; Hamming graph; Bipartite graph; Strongly regular graph; Vertex (graph theory); Graph; Discrete mathematics; Line graph; Pathwidth; Geometry; Hamming code; Block code; Algorithm","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":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004551722,0.0004157635,0.0009048348,0.0001738476,0.0001821677,0.00008678088,0.001921367,0.0002602865,0.00004555771],"category_scores_gemma":[0.001768921,0.0002361185,0.000421217,0.0004777494,0.0004445922,0.00006484069,0.0006347357,0.004577285,0.00000557799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003488214,"about_ca_system_score_gemma":0.0008495918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005508516,"about_ca_topic_score_gemma":0.000005244548,"domain_scores_codex":[0.9957452,0.0009747313,0.0009351282,0.0002753855,0.001360479,0.0007090603],"domain_scores_gemma":[0.9932815,0.003726848,0.001356462,0.001000147,0.0004999904,0.0001350053],"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.0003755706,0.0002201171,0.00003750412,0.0002693091,0.0006039895,0.00001500364,0.0009861435,0.00001529866,0.0001975473,0.9938282,0.003236237,0.0002150143],"study_design_scores_gemma":[0.0007875345,0.0008745966,0.00005992632,0.0003281457,0.0002646862,0.00004714023,0.0003254675,0.0002512737,0.001160644,0.9948701,0.0008138962,0.0002166404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9594618,0.01419126,0.01020623,0.01126981,0.0008878971,0.001165769,0.00002565107,0.00004495964,0.002746586],"genre_scores_gemma":[0.9971001,0.002253006,0.00002556431,0.000108784,0.00007701891,0.00001246247,0.000001599793,0.00008439837,0.0003371294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0376382,"threshold_uncertainty_score":0.9977192,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04629424485708431,"score_gpt":0.3031744434899581,"score_spread":0.2568801986328738,"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."}}