{"id":"W4313342923","doi":"10.1007/978-3-031-22105-7_41","title":"The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; Toronto Metropolitan University","funders":"","keywords":"Square tiling; Hamiltonian path; Combinatorics; Hamiltonian (control theory); Mathematics; Path (computing); Graph; Hamiltonian path problem; Discrete mathematics; Grid; Square (algebra); Topology (electrical circuits); Geometry; Computer science","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.00009608408,0.0003290178,0.000364726,0.0007759453,0.001099863,0.001289833,0.0005405443,0.000767506,0.01061215],"category_scores_gemma":[0.0008128692,0.0004262769,0.0004178191,0.001213509,0.0009846485,0.001500854,0.0007218107,0.000804882,0.0008992227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004376159,"about_ca_system_score_gemma":0.0004174142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001555765,"about_ca_topic_score_gemma":0.002236906,"domain_scores_codex":[0.9998991,0.00001705953,0.000004349721,0.00003573453,0.00002196671,0.00002176788],"domain_scores_gemma":[0.9995881,0.0001935194,0.00006111104,0.00004596405,0.00005057266,0.00006082138],"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.0002014169,0.00005012778,0.0007919716,0.0004238473,0.00003695697,0.0004614732,0.0005959606,0.0120003,0.01160717,0.9158777,0.01263016,0.04532295],"study_design_scores_gemma":[0.00005191318,0.00006460324,0.001680972,0.00004052766,0.00003630912,0.0004601015,0.0003375621,0.02307791,0.002749618,0.9573856,0.01409287,0.00002205582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6391969,0.001192052,0.1422956,0.0009995988,0.0004158246,0.000205532,0.001461934,0.0007859027,0.2134467],"genre_scores_gemma":[0.927904,0.0008598759,0.0387234,0.0002822908,0.00009166806,0.0001703193,0.000988448,0.0001975076,0.03078252],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01061215,"threshold_uncertainty_score":0.03550118,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0135981814281214,"score_gpt":0.2322437240287475,"score_spread":0.2186455426006261,"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."}}