{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004563107,0.0002870083,0.0004569763,0.0004095847,0.0002738119,0.0001872236,0.002036507,0.0001136772,0.00005667824],"category_scores_gemma":[0.0001153797,0.0002883031,0.0001687456,0.001092378,0.0003197715,0.001395251,0.0008744822,0.0003451845,0.0001783352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001101238,"about_ca_system_score_gemma":0.00009598223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002895535,"about_ca_topic_score_gemma":0.00002545009,"domain_scores_codex":[0.9971009,0.0002452833,0.0005778638,0.0005888499,0.0007384032,0.0007486932],"domain_scores_gemma":[0.997161,0.0005627185,0.0002544141,0.001313271,0.0004106134,0.0002980177],"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.00002435067,0.0002005232,0.00330357,0.00005532001,0.00006643147,0.000009638504,0.001036408,0.00002669032,0.04189479,0.9426763,0.0002298705,0.01047612],"study_design_scores_gemma":[0.0008518792,0.0003034704,0.01100255,0.00009825556,0.000007296223,0.000007323757,0.00005908054,0.004187479,0.01998544,0.9625728,0.000577206,0.0003472768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9901834,0.0003405881,0.005844751,0.0004832539,0.0007139161,0.0006047199,0.0000075692,0.0002132411,0.001608522],"genre_scores_gemma":[0.9772886,0.00002811014,0.02243635,0.00007498617,0.000006809304,0.00005511856,0.000004903016,0.00003243827,0.00007267827],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02190934,"threshold_uncertainty_score":0.9999569,"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."}}