{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001824446,0.0001500519,0.0002404239,0.0004663928,0.0002341573,0.0004435136,0.0008570652,0.00009623176,0.00000612826],"category_scores_gemma":[0.0007919106,0.0001092899,0.0002049014,0.001687988,0.0000724672,0.0008709814,0.00008510429,0.0003514851,0.000001321666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001105448,"about_ca_system_score_gemma":0.0002874386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004700282,"about_ca_topic_score_gemma":0.000001646588,"domain_scores_codex":[0.9980482,0.000252508,0.0005996149,0.0002358199,0.0005287282,0.0003350687],"domain_scores_gemma":[0.9977935,0.0009212336,0.0002401578,0.0003248767,0.000589271,0.0001309804],"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.0002722581,0.0001163492,0.0001441216,0.00004222163,0.00009000633,0.00007489929,0.0009216378,0.03890212,0.0004034714,0.9443879,0.00646146,0.008183513],"study_design_scores_gemma":[0.001206478,0.0004967092,0.00004576907,0.00008592472,0.00001223246,0.00002862869,0.00004936756,0.2017748,0.0006634495,0.7877598,0.007732298,0.00014454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004631953,0.002088209,0.9821454,0.002103726,0.008327377,0.0005232021,0.00001192704,0.00007263138,0.00009563001],"genre_scores_gemma":[0.8269367,0.003423481,0.1676655,0.0003818906,0.001264591,0.0000957031,0.0000223396,0.0001144632,0.00009537257],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8223047,"threshold_uncertainty_score":0.4456713,"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."}}