{"id":"W4403560623","doi":"10.1007/s10878-024-01207-w","title":"The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; Brock University","funders":"","keywords":"Theory of computation; Hamiltonian path; Combinatorics; Grid; Mathematics; Hamiltonian (control theory); Hamiltonian path problem; Simple (philosophy); Path (computing); Lattice graph; Discrete mathematics; Simple graph; Graph; Longest path problem; Computer science; Chordal graph; Line graph; Algorithm; Voltage graph; Mathematical optimization; Geometry","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.0002584064,0.0004166396,0.0005592787,0.001228796,0.001268587,0.001881665,0.0009251627,0.001183665,0.01197734],"category_scores_gemma":[0.00306801,0.0006188184,0.000480059,0.00137795,0.001553498,0.001976628,0.001022754,0.0008568848,0.0006028024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006844925,"about_ca_system_score_gemma":0.000735521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003026676,"about_ca_topic_score_gemma":0.004137676,"domain_scores_codex":[0.99978,0.00004904458,0.000009408715,0.00006800334,0.00003815926,0.0000554662],"domain_scores_gemma":[0.9980364,0.001085576,0.0003447463,0.0001296842,0.0001451368,0.000258419],"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.0008530541,0.0002498564,0.007545708,0.0009070769,0.0001528095,0.001146914,0.001021744,0.08816405,0.01304956,0.8247213,0.01501799,0.04716999],"study_design_scores_gemma":[0.0001711251,0.0001404177,0.005397195,0.00008364263,0.00008755538,0.0005394087,0.000816598,0.1454431,0.002329224,0.8401415,0.004808764,0.00004151013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9001177,0.0003899531,0.0601895,0.0006812309,0.00008913207,0.0001230291,0.0009871025,0.0002879036,0.03713438],"genre_scores_gemma":[0.9756519,0.0002874491,0.01839072,0.0001572553,0.00002754176,0.00009128726,0.0007032873,0.00007033892,0.004620301],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01197734,"threshold_uncertainty_score":0.04006821,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01073584881264525,"score_gpt":0.2803335710840392,"score_spread":0.2695977222713939,"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."}}