{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002641537,0.001045329,0.001101541,0.001033563,0.0005893582,0.00229122,0.001415809,0.0008675044,0.00729576],"category_scores_gemma":[0.002520448,0.0005749486,0.0009542965,0.002018224,0.0007308495,0.002819644,0.001503549,0.001382451,0.001811138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291745,"about_ca_system_score_gemma":0.0009014455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0024623,"about_ca_topic_score_gemma":0.003878321,"domain_scores_codex":[0.9996914,0.00005186552,0.0000260234,0.0000949442,0.00009685458,0.00003896023],"domain_scores_gemma":[0.9995164,0.0002707081,0.00002618425,0.00008947463,0.00007146061,0.00002569733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008241051,0.00004141083,0.0006094546,0.0004755819,0.00007707407,0.0000679804,0.0001470873,0.3856835,0.004177754,0.3534882,0.01115774,0.2439918],"study_design_scores_gemma":[0.00001079327,0.00001291626,0.0001052595,0.00004526281,0.00001608994,0.00004066008,0.00003676757,0.4491808,0.002035065,0.5352498,0.0132511,0.0000155889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02748046,0.002917602,0.9406067,0.0005750353,0.0003518667,0.00005896114,0.0005489461,0.001584503,0.02587589],"genre_scores_gemma":[0.3385355,0.004391874,0.6397653,0.0001763503,0.0001946105,0.0002089774,0.001651111,0.0004894616,0.01458692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00729576,"threshold_uncertainty_score":0.02440673,"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."}}