{"id":"W2760174128","doi":"10.1007/978-3-319-77510-4_7","title":"Computing Shortest Paths with Cellular Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Shortest path problem; Cellular automaton; Combinatorics; Vertex (graph theory); Discrete mathematics; Distance; Mathematics; Computer science; Graph; Algorithm","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.0002573706,0.0005004687,0.0004693168,0.00021184,0.0006352582,0.0002849902,0.0008172147,0.0002023987,0.0002517446],"category_scores_gemma":[0.000004715305,0.0004879405,0.0001086783,0.0002096713,0.0003976412,0.0003187576,0.0005377935,0.0003252295,0.0002835171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003732193,"about_ca_system_score_gemma":0.0001175824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003468388,"about_ca_topic_score_gemma":0.00004827588,"domain_scores_codex":[0.9974411,0.00004071926,0.0005628308,0.001031507,0.0005583778,0.0003655102],"domain_scores_gemma":[0.9982625,0.00008050723,0.0004163036,0.0007764487,0.0002672689,0.0001969522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001021902,0.0001042419,0.00003626099,0.0001123967,0.0001299838,0.00004508457,0.001020558,0.0004296987,0.0001331141,0.9340125,0.009367512,0.0545984],"study_design_scores_gemma":[0.0004068497,0.0003204996,0.0006635588,0.0002368717,0.00008007641,0.0000916735,0.00003315179,0.742001,0.0001053594,0.1885104,0.06649919,0.001051322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001751755,0.0003143404,0.909076,0.0003460462,0.0003396942,0.0005095582,0.00003251713,0.0006673418,0.08696279],"genre_scores_gemma":[0.6503149,0.0002807972,0.2864959,0.000704938,0.001356138,0.00005237512,0.001772946,0.0002372597,0.05878477],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7455021,"threshold_uncertainty_score":0.9997572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04104906656706336,"score_gpt":0.2571781149077312,"score_spread":0.2161290483406678,"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."}}