{"id":"W2402386276","doi":"","title":"Resolvably Decomposing Complete Equipartite Graphs Minus a One-Factor into Cycles of Uniform Even Length.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factor (programming language); Combinatorics; Discrete mathematics; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004456012,0.0006978183,0.0004401151,0.0008340529,0.00112608,0.001952732,0.001090587,0.000825809,0.01443664],"category_scores_gemma":[0.002717905,0.0004863254,0.0008788142,0.0008110594,0.001413406,0.003870667,0.002220514,0.002600352,0.002546368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005598862,"about_ca_system_score_gemma":0.0006901957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001088971,"about_ca_topic_score_gemma":0.002244693,"domain_scores_codex":[0.9994486,0.0001092494,0.00002813079,0.0001322277,0.0001273596,0.0001544209],"domain_scores_gemma":[0.9981244,0.0006731594,0.0001668615,0.0005663647,0.0002106717,0.0002585394],"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.0004959712,0.0002166305,0.00062339,0.0002924672,0.00004946618,0.0005167283,0.0008954691,0.007933088,0.01979177,0.8738703,0.01112059,0.08419421],"study_design_scores_gemma":[0.00004718926,0.00007248522,0.0003970444,0.00005639182,0.0000376882,0.0003321681,0.0002946565,0.01067615,0.007389901,0.9640649,0.01660208,0.00002944575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3871463,0.001097605,0.4534434,0.001107063,0.0004334561,0.0003223818,0.001499059,0.001512369,0.1534385],"genre_scores_gemma":[0.828134,0.0009057307,0.1209866,0.0007615878,0.0002629405,0.0001813874,0.00287011,0.0009212305,0.04497653],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01443664,"threshold_uncertainty_score":0.04829532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03150782474623839,"score_gpt":0.2879144236497921,"score_spread":0.2564065989035538,"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."}}