{"id":"W2964105682","doi":"10.1007/978-3-319-46310-0_8","title":"Hoffman’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association Schemes","year":2017,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Association scheme; Mathematics; Combinatorics; Disjoint sets; Upper and lower bounds; Adjacency matrix; Vertex (graph theory); Discrete mathematics; Hadamard transform; Graph","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.001030842,0.0005426664,0.0008121023,0.0005344847,0.0002030459,0.0003694547,0.0003427357,0.0005994836,0.00001564899],"category_scores_gemma":[0.0005801964,0.0006053446,0.000115104,0.00004475727,0.0001051591,0.0001970054,0.00008517452,0.000549646,0.00001632336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002409599,"about_ca_system_score_gemma":0.00003397834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003619634,"about_ca_topic_score_gemma":0.00002572296,"domain_scores_codex":[0.9979684,0.00000361552,0.0007728559,0.0003739422,0.0004056219,0.0004755725],"domain_scores_gemma":[0.9984205,0.0003351919,0.0005580588,0.0002734588,0.0002992447,0.0001134855],"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.000009441567,0.00002454632,0.0003189711,0.005910534,0.0002621326,0.000008578116,0.0008539383,0.000007397327,0.0001062053,0.9882309,0.002701069,0.00156628],"study_design_scores_gemma":[0.0007639526,0.00009205396,0.0002246806,0.001780484,0.0003547058,0.00001945408,0.0001160999,0.007043859,0.0003511702,0.8987522,0.08932579,0.001175624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.02017842,0.008691969,0.1246748,0.0001002036,0.003622491,0.007858049,0.003368788,0.001381656,0.8301236],"genre_scores_gemma":[0.1206034,0.008279867,0.3390468,0.00007303697,0.001677384,0.001050349,0.0003369652,0.001680368,0.5272518],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3028718,"threshold_uncertainty_score":0.9996398,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01063055089202842,"score_gpt":0.2176528313383885,"score_spread":0.2070222804463601,"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."}}