{"id":"W2099012813","doi":"10.1139/x04-030","title":"Projecting vector-based road networks with a shortest path algorithm","year":2004,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Remote Sensing and LiDAR Applications","field":"Environmental Science","cited_by":54,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sensitivity (control systems); Computer science; Forest road; Shortest path problem; Network planning and design; Transport engineering; Path (computing); Variety (cybernetics); Node (physics); Data mining; Operations research; Algorithm; Engineering; Artificial intelligence; Geography; Telecommunications; Theoretical computer science","routes":{"ca_aff":false,"ca_fund":true,"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.0009664514,0.00009223966,0.0001182895,0.0001842714,0.0004570916,0.0001207538,0.0002975001,0.00006088152,0.00009377523],"category_scores_gemma":[0.00008726969,0.00007169705,0.00004680435,0.0007735167,0.0004000882,0.0001063443,0.00001476762,0.0006367032,0.00004127395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007401084,"about_ca_system_score_gemma":0.001246695,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.07304922,"about_ca_topic_score_gemma":0.2471204,"domain_scores_codex":[0.9984962,0.00007296036,0.0001963582,0.0001654255,0.0004961239,0.0005728829],"domain_scores_gemma":[0.9988158,0.0000563122,0.00007506052,0.0002199295,0.0001082949,0.0007246551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00003638672,0.00008930128,0.2308132,0.00000571193,0.000034501,0.001147877,0.0008842105,0.6236424,0.0002062259,0.0001577282,0.002477034,0.1405054],"study_design_scores_gemma":[0.001369376,0.001299717,0.9390619,0.0003393488,0.0000222995,0.000908361,0.0006825725,0.03847568,0.0003486557,0.0007450482,0.01636645,0.000380534],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9654415,0.00009502259,0.02566755,0.001434075,0.00007052891,0.0002950008,0.000003960823,0.00000935863,0.006983043],"genre_scores_gemma":[0.9916058,0.000003158579,0.008068509,0.00004873135,0.0001551398,0.000001942434,0.000002663573,0.00001862589,0.00009547299],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7082487,"threshold_uncertainty_score":0.9331234,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02602293257246115,"score_gpt":0.2809837670364035,"score_spread":0.2549608344639424,"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."}}