{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002817269,0.0004570989,0.0004263052,0.001115243,0.001229026,0.001063266,0.0006469279,0.0006538962,0.003023425],"category_scores_gemma":[0.001337323,0.0003064864,0.0005049875,0.0009765616,0.002263048,0.001908578,0.0009434498,0.0009789147,0.000561143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009457411,"about_ca_system_score_gemma":0.0004794599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002387886,"about_ca_topic_score_gemma":0.002137007,"domain_scores_codex":[0.9996302,0.00009752349,0.00001182018,0.00006988152,0.0001128607,0.00007773916],"domain_scores_gemma":[0.9994138,0.0002290401,0.0001155597,0.00008496186,0.00007261915,0.00008395978],"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.00008522486,0.00002072889,0.0005084575,0.00005668198,0.000009737947,0.0001341044,0.0004194961,0.009819252,0.003237127,0.9750899,0.0007461368,0.009873076],"study_design_scores_gemma":[0.00003840241,0.0000538815,0.001303303,0.00003850439,0.00002923848,0.0003182074,0.000523271,0.02100871,0.004561328,0.9621277,0.009950265,0.0000471866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.8530428,0.000612283,0.06014803,0.0006689433,0.0000707911,0.0000507652,0.0001758669,0.0001313702,0.08509922],"genre_scores_gemma":[0.9681165,0.0006683908,0.02117644,0.0001659168,0.00005704357,0.0000404464,0.0002037977,0.00007301984,0.009498605],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.003023425,"threshold_uncertainty_score":0.01011431,"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."}}