{"id":"W2728231354","doi":"10.1007/978-3-319-62389-4_37","title":"Bend Complexity and Hamiltonian Cycles in Grid Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hamiltonian path; Transpose; Hamiltonian path problem; Hamiltonian (control theory); Grid; Computer science; Computational complexity theory; Combinatorics; Graph; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Geometry; Physics; Mathematical optimization; Quantum mechanics","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.0002703186,0.0005692586,0.0006040193,0.0016563,0.0008626218,0.00213711,0.0009951447,0.001086079,0.007440642],"category_scores_gemma":[0.002914904,0.0005833397,0.0005652649,0.002150429,0.001687668,0.003595157,0.001176296,0.002169142,0.0005690199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00113974,"about_ca_system_score_gemma":0.0004187981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001533007,"about_ca_topic_score_gemma":0.001496162,"domain_scores_codex":[0.9996849,0.00006912322,0.00001313668,0.00006406738,0.0001189857,0.00004980919],"domain_scores_gemma":[0.9985693,0.0009067846,0.0001702264,0.0001008607,0.0001087384,0.0001442281],"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.0000553426,0.00003369213,0.0005129786,0.0001217062,0.00001553626,0.00007742493,0.0002513836,0.02106031,0.001136851,0.951517,0.004960306,0.02025749],"study_design_scores_gemma":[0.000006575275,0.000006399364,0.0002573042,0.00001234232,0.000005055429,0.00004325637,0.00004986842,0.01262254,0.0001695952,0.984528,0.002292404,0.000006519951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5509737,0.007989086,0.2064023,0.004902434,0.0005212727,0.0001532397,0.001227016,0.0003301031,0.227501],"genre_scores_gemma":[0.9331746,0.004524725,0.0266137,0.000432601,0.000626917,0.0001656681,0.0008533131,0.000194095,0.03341428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007440642,"threshold_uncertainty_score":0.0248915,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02927127404288834,"score_gpt":0.2694253609652324,"score_spread":0.2401540869223441,"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."}}