{"id":"W2784736218","doi":"10.1016/j.disc.2018.02.020","title":"On the Hamilton–Waterloo Problem with cycle lengths of distinct parities","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Mathematics; Factorization; Graph; BETA (programming language); Hamiltonian path; Complete graph; Computer science; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.001444305,0.001298965,0.00170188,0.001407172,0.002161205,0.003392521,0.002900972,0.0040534,0.0174492],"category_scores_gemma":[0.01303031,0.0009376625,0.0008608707,0.002638118,0.003253567,0.006682617,0.002737549,0.003857382,0.001140849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002797535,"about_ca_system_score_gemma":0.002420167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007200756,"about_ca_topic_score_gemma":0.006575624,"domain_scores_codex":[0.9987563,0.0004441406,0.00004345233,0.0002791739,0.0002184684,0.0002584885],"domain_scores_gemma":[0.9928999,0.005379526,0.0005329927,0.000440751,0.0003391365,0.0004077039],"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.000176329,0.00009274923,0.0003497839,0.000186657,0.00003519629,0.0001607515,0.0002318002,0.03543029,0.0007664129,0.934521,0.01137865,0.01667029],"study_design_scores_gemma":[0.00004758264,0.00001392367,0.00008757866,0.00002129599,0.000009041228,0.00003039358,0.00007608066,0.05150305,0.0001819755,0.9462128,0.001800867,0.00001552323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4090602,0.003143458,0.404701,0.01749382,0.0008792661,0.0003298737,0.001945532,0.0004155893,0.1620313],"genre_scores_gemma":[0.8379873,0.002526012,0.09898106,0.0020937,0.00117877,0.0004024863,0.001601857,0.0004164627,0.05481236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0174492,"threshold_uncertainty_score":0.05837339,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0105022115662468,"score_gpt":0.2015890767946226,"score_spread":0.1910868652283758,"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."}}