{"id":"W2362639613","doi":"","title":"The Shortest Path Search Based on Improved Cellular Automata Extend Model","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Simulation and Modeling Applications","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Shortest path problem; Computer science; K shortest path routing; Constrained Shortest Path First; Yen's algorithm; Node (physics); Shortest Path Faster Algorithm; Path (computing); Euclidean shortest path; Pathfinding; Cellular automaton; Search algorithm; Theoretical computer science; Algorithm; Dijkstra's algorithm; Computer network; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001233971,0.000166848,0.00009739559,0.00007241506,0.0003984516,0.0001231362,0.0003571415,0.0000691906,0.000005183096],"category_scores_gemma":[2.566918e-7,0.0001453266,0.00007015165,0.0002325674,0.00004299121,0.00003782906,0.00003292399,0.0001703542,0.0001199251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006859352,"about_ca_system_score_gemma":0.00003539772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000166078,"about_ca_topic_score_gemma":0.000007459391,"domain_scores_codex":[0.9990367,0.00001201487,0.0002672745,0.0002751882,0.0001362341,0.0002725836],"domain_scores_gemma":[0.9990703,0.0001079162,0.00002369516,0.000655574,0.00007685925,0.00006563496],"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.000001375425,0.00006837472,0.000009592153,0.00000546102,0.000005307385,1.038861e-7,0.00001588699,0.9485903,0.02459854,0.004051216,0.00310863,0.01954519],"study_design_scores_gemma":[0.0002053962,0.000005344612,0.0001390823,0.000004279303,0.00000824269,6.163962e-7,0.000003565932,0.9122309,0.003663218,0.0007639472,0.08282745,0.000147976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004286295,0.00007797727,0.9908839,0.00038072,0.00001421415,0.0007804513,0.0000422085,0.0007469219,0.002787317],"genre_scores_gemma":[0.9106995,0.000009235787,0.0874847,0.0001822027,0.0001664822,0.0009313064,0.0001886352,0.00005312079,0.0002848098],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9064132,"threshold_uncertainty_score":0.5926249,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008053692082706574,"score_gpt":0.2161655751508401,"score_spread":0.2081118830681335,"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."}}