{"id":"W1566220351","doi":"10.1002/jcd.21312","title":"On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Complete bipartite graph; Hamiltonian path; Graph; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.001112106,0.0006131618,0.000747433,0.0006462563,0.001337966,0.001443192,0.0009810046,0.001353205,0.01455541],"category_scores_gemma":[0.00446623,0.000492378,0.0008209645,0.0009540742,0.001623694,0.004481867,0.001324689,0.001256304,0.0009028673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001862522,"about_ca_system_score_gemma":0.001588305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01212431,"about_ca_topic_score_gemma":0.01457494,"domain_scores_codex":[0.9988092,0.0003866301,0.0000440795,0.0002295009,0.0001948532,0.0003358319],"domain_scores_gemma":[0.996987,0.002169463,0.0002015846,0.0002903896,0.0001884296,0.0001631319],"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.0005183685,0.0002660582,0.001204371,0.0003580195,0.00005959154,0.0004291555,0.000618785,0.06314137,0.005159191,0.8545773,0.02026131,0.05340628],"study_design_scores_gemma":[0.0001578884,0.0001017836,0.0003463574,0.0000641427,0.0000266734,0.0001527236,0.0003662375,0.1413196,0.002566856,0.8424328,0.01242444,0.00004039905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3710374,0.001306987,0.5331441,0.003262687,0.0001889041,0.0006015187,0.001525693,0.0004619524,0.08847069],"genre_scores_gemma":[0.8266492,0.001198697,0.1396848,0.0007823418,0.0002248207,0.0003627819,0.001483221,0.0001999405,0.02941424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01455541,"threshold_uncertainty_score":0.04869276,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02960879203051143,"score_gpt":0.2273490084058673,"score_spread":0.1977402163753559,"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."}}