{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003872654,0.0002938829,0.0003073885,0.0001575841,0.0002042728,0.0001433554,0.000774927,0.0003320392,0.000005486562],"category_scores_gemma":[0.00007891494,0.0002390709,0.00006910392,0.00004526357,0.001316469,0.000007090111,0.0008886973,0.0003564987,0.000002307034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002358117,"about_ca_system_score_gemma":0.00008205308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004323597,"about_ca_topic_score_gemma":0.0007135243,"domain_scores_codex":[0.9982862,0.00002263567,0.000236471,0.0009057937,0.0001806065,0.0003683068],"domain_scores_gemma":[0.9991488,0.00004550572,0.0001422636,0.000523348,0.00005130354,0.00008881687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006934279,0.0000733738,0.02044176,0.00009359508,0.00003109537,0.0001467472,0.0001864651,0.001374633,0.02857774,0.004705993,0.00006416211,0.9442351],"study_design_scores_gemma":[0.002841254,0.002679052,0.2498503,0.001837019,0.00004522521,0.0004156074,0.000001667746,0.02815101,0.03564873,0.6315716,0.04207333,0.004885154],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6415715,0.006993902,0.3193382,0.001477085,0.004630307,0.001305587,0.000109717,0.0000963502,0.02447736],"genre_scores_gemma":[0.9819341,0.0001712993,0.01658499,0.0005727027,0.0005669999,0.000002004493,0.00003509207,0.00001490217,0.0001179632],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9393499,"threshold_uncertainty_score":0.9749029,"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."}}