{"id":"W2400973841","doi":"","title":"Multidecomposition of K n - F into Graph-Pairs of Order 5 where F is a Hamilton Cycle or an (almost) 1-Factor.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Factor (programming language); Order (exchange); Graph; Hamiltonian path; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001721718,0.0001837018,0.0003035233,0.0001315531,0.00004645282,0.00001414043,0.0002406273,0.0001705146,0.0002030146],"category_scores_gemma":[0.00001726099,0.0001699686,0.00009218449,0.0003768123,0.0000802143,0.0002546125,0.00001947999,0.0002106559,0.00001255088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001471168,"about_ca_system_score_gemma":0.00001797754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002287851,"about_ca_topic_score_gemma":0.0001775639,"domain_scores_codex":[0.9990185,0.00005557164,0.000373371,0.0001783485,0.0001821457,0.0001921019],"domain_scores_gemma":[0.9991421,0.00006598526,0.00009516816,0.0004692013,0.0001279194,0.00009969713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001751811,0.0005387539,0.01595066,0.0008800926,0.0002397808,0.00001108973,0.01352515,0.0004509905,0.8418729,0.1231889,0.0007211349,0.002445408],"study_design_scores_gemma":[0.004425987,0.001063959,0.02605586,0.0004419212,0.0001097519,0.00003352038,0.001612279,0.01298883,0.6222923,0.3267692,0.003021816,0.001184589],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9969161,0.00009918699,0.00004302467,0.000009392916,0.002011085,0.0001937301,0.00002030912,0.0001410038,0.0005662129],"genre_scores_gemma":[0.9994372,0.00002245011,0.0004281061,0.000008048236,0.000009791237,0.00001514598,0.00001062239,0.00004014009,0.00002848326],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2195806,"threshold_uncertainty_score":0.693112,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00560351716376274,"score_gpt":0.2240817192644587,"score_spread":0.218478202100696,"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."}}