{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114901,0.0007671144,0.0006262252,0.0007692406,0.001968419,0.001215521,0.0007109159,0.0004936515,0.007291045],"category_scores_gemma":[0.00323115,0.0005165774,0.001116423,0.0006098502,0.002460189,0.004511765,0.001560819,0.001755402,0.0009476854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009611841,"about_ca_system_score_gemma":0.0008429262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002446639,"about_ca_topic_score_gemma":0.003470529,"domain_scores_codex":[0.9983878,0.0002417459,0.0001070489,0.0006438423,0.0003090724,0.0003105829],"domain_scores_gemma":[0.9967793,0.0008360347,0.0004749842,0.000957111,0.0005529002,0.00039973],"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.0001775858,0.00004328051,0.0006702385,0.0001178093,0.00001412623,0.0002253175,0.0005228755,0.005121406,0.004602483,0.9627639,0.002010068,0.02373091],"study_design_scores_gemma":[0.00003675742,0.0002123243,0.0008618526,0.00007023695,0.00002807039,0.0006802455,0.0003182839,0.01690061,0.005808552,0.9488652,0.02616278,0.00005511084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2631846,0.00143705,0.6620816,0.0006471637,0.0003568519,0.0002279501,0.001019708,0.0004358322,0.07060921],"genre_scores_gemma":[0.7233858,0.0009617009,0.2516498,0.0003921353,0.0002759616,0.000170129,0.001232002,0.0001490811,0.02178345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007291045,"threshold_uncertainty_score":0.024391,"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."}}