{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002859565,0.0005004401,0.0008529855,0.0005647934,0.0005430031,0.0008459855,0.001174315,0.0007543665,0.002427326],"category_scores_gemma":[0.001039343,0.0002440254,0.0008818373,0.0007173626,0.0005317362,0.001935484,0.000660892,0.0008704409,0.0003552543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008592935,"about_ca_system_score_gemma":0.001353314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01528067,"about_ca_topic_score_gemma":0.008739715,"domain_scores_codex":[0.9997042,0.00005442994,0.00001974266,0.00008013343,0.0001005932,0.00004083439],"domain_scores_gemma":[0.9997419,0.00009905815,0.00002126584,0.00003678496,0.00008436206,0.00001676389],"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.00008452655,0.00002812018,0.0009315801,0.00009735323,0.00004241091,0.0001356414,0.0001142634,0.8737648,0.005889242,0.07809097,0.001498741,0.03932234],"study_design_scores_gemma":[0.00001269301,0.00001715973,0.00006842161,0.000004302362,0.00001141536,0.00003073393,0.000008427482,0.9896248,0.0006131463,0.007942497,0.001659429,0.000006969399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03419323,0.0004445764,0.9582549,0.0001805756,0.00006608834,0.00004595406,0.000121763,0.0003668762,0.006326023],"genre_scores_gemma":[0.7420198,0.0009015526,0.2464617,0.0000805931,0.00005947252,0.0002593309,0.0004315083,0.00008732095,0.009698823],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01528067,"threshold_uncertainty_score":0.03038347,"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."}}