{"id":"W2767999306","doi":"10.37236/1898","title":"Sequentially Perfect and Uniform One-Factorizations of the Complete Graph","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Factorization; Disjoint sets; Graph; Hamiltonian path; Complete graph; Discrete mathematics; Perfect power; Integer (computer science); Algorithm; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005868995,0.0001022947,0.0001879628,0.00007007319,0.0001225952,0.0000189967,0.0003479777,0.00004316957,0.000009108058],"category_scores_gemma":[0.00001766742,0.00006257041,0.0001148496,0.0003367655,0.00007067228,0.0001100037,0.00002231139,0.000427697,0.000001037701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000105549,"about_ca_system_score_gemma":0.00008374976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002337071,"about_ca_topic_score_gemma":0.00001199591,"domain_scores_codex":[0.9990699,0.0000936178,0.0003242056,0.00004244115,0.0002253248,0.0002444678],"domain_scores_gemma":[0.9994332,0.00007550701,0.0001692943,0.0001853283,0.00009920646,0.00003741854],"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.00001098731,0.00003461542,0.0004069415,0.00002804359,0.0001801653,2.909948e-7,0.0004693102,0.004734904,0.006371077,0.9874718,0.00007427903,0.0002176172],"study_design_scores_gemma":[0.002013965,0.0006430244,0.004503774,0.0001853497,0.0004120786,0.0004459748,0.0004369079,0.004261492,0.02324702,0.9439142,0.01954802,0.0003881884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9831001,0.004413578,0.009527541,0.0002463209,0.0005752982,0.00014101,0.0000035063,0.00002345604,0.001969163],"genre_scores_gemma":[0.9992205,0.0006217681,0.000005839842,0.00001311786,0.0000686175,9.927271e-7,3.36632e-7,0.0000155567,0.00005325306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04355757,"threshold_uncertainty_score":0.2551547,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007111906554473927,"score_gpt":0.1797280156676221,"score_spread":0.1726161091131482,"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."}}