{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00238318,0.000586716,0.0006497444,0.0008668255,0.001086982,0.0008250586,0.004068397,0.000302241,0.00004012684],"category_scores_gemma":[0.0001385916,0.0004605387,0.0003431236,0.001401945,0.0004498162,0.0004334723,0.001054836,0.00104295,0.000006785821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003950093,"about_ca_system_score_gemma":0.000414312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002295148,"about_ca_topic_score_gemma":0.0013794,"domain_scores_codex":[0.9951983,0.0001434879,0.0008986294,0.001757145,0.0009845706,0.001017867],"domain_scores_gemma":[0.9958972,0.001486041,0.00044373,0.001727827,0.0002970064,0.0001481555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000696075,0.00009596047,0.0003663719,0.0001090241,0.00008210639,0.0002468668,0.005799409,0.03360934,0.0001329541,0.4225368,0.003689717,0.5332618],"study_design_scores_gemma":[0.0005907647,0.0004816515,0.0001292195,0.0002425238,0.000008217558,0.00009984176,0.000003064559,0.4931536,0.0001572051,0.4015434,0.1026857,0.0009047272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002784671,0.001301074,0.9871985,0.001301718,0.007349785,0.00123237,0.00004423603,0.0001632077,0.001130642],"genre_scores_gemma":[0.8282251,0.001704445,0.1442146,0.01822316,0.00392999,0.001145031,0.0001399091,0.0003882379,0.002029479],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8429839,"threshold_uncertainty_score":0.9997846,"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."}}