{"id":"W4410127734","doi":"10.3390/f16050780","title":"An Open-Source Tree Bucking Optimizer Based on Dynamic Programming","year":2025,"lang":"en","type":"article","venue":"Forests","topic":"Forest Biomass Utilization and Management","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Natural Resources Canada; Canadian Forest Service","funders":"Mitacs","keywords":"Computer science; Open source; Tree (set theory); Dynamic programming; Programming language; Mathematics; Algorithm; Software","routes":{"ca_aff":true,"ca_fund":true,"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.0006146737,0.001345895,0.0009449454,0.0005868308,0.0003770584,0.0008605927,0.001035165,0.0008185196,0.02155606],"category_scores_gemma":[0.002129518,0.0005076255,0.001115856,0.0006781343,0.0003238283,0.0006309788,0.0008393283,0.001235616,0.00560389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004746341,"about_ca_system_score_gemma":0.001370725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003928479,"about_ca_topic_score_gemma":0.006678734,"domain_scores_codex":[0.9997013,0.00005790805,0.00001843376,0.00007597829,0.00009534094,0.00005095262],"domain_scores_gemma":[0.9993722,0.0004156971,0.00004526886,0.00004441958,0.00009104428,0.00003148372],"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.0004640887,0.0002632053,0.005216367,0.001703796,0.0003411187,0.0003932923,0.0002500055,0.6325482,0.01805031,0.01993276,0.08645709,0.2343798],"study_design_scores_gemma":[0.0001291748,0.0001231465,0.001290247,0.00006112603,0.00005637954,0.0001121525,0.00003741798,0.9401329,0.007704622,0.007516379,0.04279049,0.00004604689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02881138,0.001112038,0.8579084,0.0002692526,0.0002236384,0.0003253485,0.007020421,0.07720432,0.02712518],"genre_scores_gemma":[0.1844056,0.0008897884,0.7518712,0.0005150018,0.00009779863,0.001524101,0.01264297,0.02676511,0.02128839],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02155606,"threshold_uncertainty_score":0.07211214,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007742257241547531,"score_gpt":0.2594816944176582,"score_spread":0.2517394371761107,"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."}}