{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140849,0.0001445329,0.0002310993,0.00008806917,0.00009835201,0.00004626118,0.0002248674,0.0000818312,0.00002584971],"category_scores_gemma":[0.00006195607,0.0000853623,0.0001926089,0.0001170819,0.00002491642,0.0002182049,0.000005354952,0.0002076097,0.00001499341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004729462,"about_ca_system_score_gemma":0.00001364124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.966192e-7,"about_ca_topic_score_gemma":1.730943e-7,"domain_scores_codex":[0.9989591,0.0001113018,0.0003732393,0.00004610157,0.0002163489,0.0002939423],"domain_scores_gemma":[0.9990178,0.0004974484,0.0001345998,0.0001404656,0.00008406907,0.000125608],"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.0002497113,0.0002230477,0.001172105,0.0001093041,0.0003421444,0.000003210462,0.004206532,0.001529067,0.02501577,0.9410272,0.02589636,0.0002255433],"study_design_scores_gemma":[0.004940276,0.002628986,0.001756243,0.0004960118,0.000327681,0.00008859132,0.001014979,0.0006617213,0.2689094,0.561756,0.1564675,0.0009525478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9832208,0.0002691181,0.002953759,0.00004668246,0.01211133,0.0003222501,0.000004581304,0.00004458183,0.001026885],"genre_scores_gemma":[0.998895,0.000009182828,0.00008242179,0.00001976154,0.0008735233,0.00001377689,6.590863e-7,0.00002982124,0.00007588493],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3792712,"threshold_uncertainty_score":0.3480974,"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."}}