{"id":"W4402028590","doi":"10.1609/aaai.v39i25.34894","title":"Scenario-Based Robust Optimization of Tree Structures","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canadian Institute for International Peace and Security","funders":"Agence Nationale de la Recherche","keywords":"Regret; Mathematics; Huffman coding; Binary search tree; Tree (set theory); Combinatorics; Time complexity; Upper and lower bounds; Context (archaeology); Discrete mathematics; Algorithm; Computer science; Binary tree; Data compression; Statistics","routes":{"ca_aff":true,"ca_fund":false,"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.003276432,0.001304168,0.001485533,0.001028468,0.0005607693,0.002031126,0.001828425,0.001572777,0.004222676],"category_scores_gemma":[0.01248771,0.0006696768,0.001329002,0.001642049,0.001355278,0.003419105,0.001865265,0.002303404,0.0004850095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002391036,"about_ca_system_score_gemma":0.001941973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002263652,"about_ca_topic_score_gemma":0.001911468,"domain_scores_codex":[0.9978332,0.001015594,0.00006244094,0.0003500652,0.0004280968,0.000310594],"domain_scores_gemma":[0.9928893,0.005285287,0.0006113522,0.000441405,0.0004390636,0.000333493],"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.00003462919,0.00002874477,0.0001675127,0.00004182231,0.00002489636,0.00003238334,0.0000210055,0.9617541,0.0003998614,0.03064581,0.0006486233,0.006200579],"study_design_scores_gemma":[0.000009177445,0.0000405891,0.00006860815,0.00001054257,0.000006885071,0.00002219385,0.00001693941,0.9604341,0.0002835145,0.03845319,0.0006472646,0.000006932271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01807975,0.0003202311,0.976676,0.0004040094,0.00003726376,0.0000901154,0.0002525046,0.0001880467,0.00395191],"genre_scores_gemma":[0.6602845,0.0008306832,0.3336561,0.0002862657,0.00008870627,0.0004115529,0.0006854032,0.0002480781,0.003508671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004222676,"threshold_uncertainty_score":0.01734829,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04830929575138374,"score_gpt":0.2929786294864005,"score_spread":0.2446693337350167,"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."}}