{"id":"W2045559318","doi":"10.1007/s00373-003-0527-y","title":"On a Decomposition of Complete Graphs","year":2003,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Prime power; Discrete mathematics; Graph; Strongly regular graph; Prime (order theory); Pathwidth; Line 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":[],"consensus_categories":[],"category_scores_codex":[0.0001281136,0.0001171945,0.0001683166,0.0001395723,0.00006220676,0.00001285928,0.00005996603,0.00005754464,0.000008848868],"category_scores_gemma":[0.000005713356,0.0001141458,0.00006711537,0.0003201448,0.00003854163,0.00003952307,0.00000473117,0.00008863088,0.000003635403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006851483,"about_ca_system_score_gemma":0.000003171216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002786684,"about_ca_topic_score_gemma":5.294829e-7,"domain_scores_codex":[0.999445,0.00004272408,0.0001663625,0.0001038709,0.0001012631,0.0001407415],"domain_scores_gemma":[0.9996759,0.00005518977,0.00002907907,0.0001532601,0.00002603413,0.0000604837],"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.000005227601,0.00003909341,0.001162136,0.00006332767,0.00002685163,0.000001973047,0.00008017806,0.00009183463,0.00127118,0.9968459,0.0002513666,0.0001609472],"study_design_scores_gemma":[0.0005157677,0.0001622761,0.00206826,0.00004311783,0.00001607477,0.00001253953,0.00007198613,0.0003418178,0.002867226,0.9923828,0.001349501,0.0001686819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9837166,0.0007425561,0.0003121799,0.00000308658,0.0005029551,0.00009559895,0.000008223655,0.00009545763,0.01452336],"genre_scores_gemma":[0.9998039,0.0001089644,0.00002714417,0.00001551722,0.000001541091,0.000009456314,0.000003480386,0.00001404064,0.00001594017],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01608734,"threshold_uncertainty_score":0.4654732,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007840884330635641,"score_gpt":0.1961483299234149,"score_spread":0.1883074455927793,"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."}}