{"id":"W2109322256","doi":"10.1139/x06-051","title":"Determining optimal road class and road deactivation strategies using dynamic programming","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Forest Biomass Utilization and Management","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Forest road; Dynamic programming; Total cost; Upgrade; Time horizon; Transport engineering; Flow network; Class (philosophy); Operations research; Environmental science; Computer science; Engineering; Mathematics; Geography; Business; Mathematical optimization; Forestry","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.0005138911,0.0001005942,0.0001237487,0.0007719515,0.0001940314,0.0003706626,0.0001417834,0.00006711442,0.0000157077],"category_scores_gemma":[0.0000389448,0.0001008683,0.00003317951,0.0003532299,0.0001262404,0.0004320829,0.00001453124,0.0002612311,0.000001952371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003502499,"about_ca_system_score_gemma":0.0003811624,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004063585,"about_ca_topic_score_gemma":0.1446615,"domain_scores_codex":[0.9988661,0.00004037756,0.0002773309,0.00009468363,0.0002756366,0.0004458062],"domain_scores_gemma":[0.9993768,0.00002103482,0.00005268636,0.0000923245,0.0001970649,0.0002600269],"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.00002907092,0.00003292864,0.1925966,0.0003679198,0.0001374937,0.0008657066,0.0008699264,0.5260006,0.00473722,0.009056032,0.0009634356,0.2643431],"study_design_scores_gemma":[0.0006056489,0.0002178354,0.6110955,0.000290224,0.00002400669,0.0002529507,0.002699897,0.3685052,0.0003722888,0.0008602613,0.0147487,0.0003275854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9914144,0.0004124484,0.006170875,0.00005390499,0.0001235552,0.0001391981,0.00000184895,0.00001670297,0.001667077],"genre_scores_gemma":[0.997411,0.00001729953,0.002393969,0.000003582572,0.00007980982,0.000003117832,0.000005272067,0.00002383315,0.00006216606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4184989,"threshold_uncertainty_score":0.8709462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0328092264176297,"score_gpt":0.301607009063433,"score_spread":0.2687977826458033,"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."}}