{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004926005,0.0007165665,0.000594737,0.001220154,0.0007967265,0.001473471,0.0004245758,0.0004953192,0.006030337],"category_scores_gemma":[0.00227745,0.0004936852,0.0006746211,0.0005600525,0.0009087555,0.001861542,0.0008435007,0.000774444,0.0007613199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005729077,"about_ca_system_score_gemma":0.0007363443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001521952,"about_ca_topic_score_gemma":0.002845811,"domain_scores_codex":[0.9992216,0.0001343452,0.00004450311,0.0002144146,0.0001462137,0.0002390114],"domain_scores_gemma":[0.9973692,0.0007953058,0.0005724151,0.0003820813,0.0004424412,0.0004385921],"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.002212779,0.0004878446,0.01041103,0.0009799168,0.0002457502,0.002207742,0.001197638,0.08350175,0.1326115,0.6222969,0.01071707,0.1331301],"study_design_scores_gemma":[0.0003554675,0.0009876477,0.00778336,0.000341091,0.0003070816,0.002378461,0.001175086,0.1653453,0.0641797,0.7142209,0.04278209,0.0001438531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.742185,0.0005280467,0.2279532,0.0003496954,0.00009793113,0.0002863687,0.001177852,0.0002369485,0.02718494],"genre_scores_gemma":[0.8865744,0.0004221381,0.09996545,0.0002128709,0.00006343334,0.0002237315,0.00155674,0.00009438128,0.01088681],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006030337,"threshold_uncertainty_score":0.02017355,"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."}}