{"id":"W1800155867","doi":"10.1002/jcd.10019","title":"Decomposition of the complete graph plus a 1‐factor into cycles of equal length","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Graph; Decomposition; Factor (programming language); Order (exchange); Discrete mathematics; Computer science; Chemistry","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.000547585,0.0001331914,0.0004024714,0.0001414659,0.00005770342,0.00001405765,0.0002774085,0.00008864898,0.00002033339],"category_scores_gemma":[0.00007381821,0.00009837105,0.0002804503,0.0002555136,0.00007605731,0.000135157,0.00001189175,0.0002164535,0.000001240336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005740598,"about_ca_system_score_gemma":0.00005790349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006839552,"about_ca_topic_score_gemma":0.000001458762,"domain_scores_codex":[0.998462,0.0003289291,0.0006716603,0.00005809146,0.000338586,0.0001407204],"domain_scores_gemma":[0.9989871,0.0002132595,0.0003805209,0.0001779258,0.0001730414,0.00006811028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002810848,0.0002002655,0.001287928,0.0003087167,0.0004465394,0.000009148271,0.002293754,0.007653522,0.5047317,0.4820111,0.0004451677,0.0003310612],"study_design_scores_gemma":[0.005785862,0.001145293,0.00459479,0.0006854981,0.000221637,0.0001475353,0.0005953728,0.0006655325,0.4895265,0.4944327,0.001755284,0.00044393],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9828283,0.0004560752,0.0102489,0.00000968334,0.005657569,0.0001432968,0.000008048747,0.00001462298,0.0006334595],"genre_scores_gemma":[0.9995914,0.00002119931,0.0002499242,0.000003848325,0.0001113907,0.000001448998,3.620626e-7,0.00001775574,0.000002672136],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01676305,"threshold_uncertainty_score":0.4011455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02309675830683337,"score_gpt":0.2451734210967549,"score_spread":0.2220766627899215,"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."}}