{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002514789,0.0002167127,0.0002845428,0.0002889864,0.000162987,0.0001207465,0.001717229,0.00009897551,0.00004544278],"category_scores_gemma":[0.000652007,0.0001719188,0.0001100597,0.001402987,0.0003239916,0.0003944061,0.0002738019,0.0002118709,0.000004302014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006983005,"about_ca_system_score_gemma":0.0002211409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002195888,"about_ca_topic_score_gemma":0.000007104926,"domain_scores_codex":[0.998275,0.00002184614,0.0005845747,0.0004703485,0.0004067338,0.0002414275],"domain_scores_gemma":[0.997552,0.0001134615,0.000514495,0.0003527273,0.001417322,0.00005004456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004307538,0.00009965798,0.00009799941,0.00003634688,0.00001200701,1.149193e-7,0.0002016983,0.455905,0.004519061,0.5084692,0.00003113188,0.0305848],"study_design_scores_gemma":[0.0000428699,0.00005856456,0.0001107444,0.0001251571,0.000008202372,4.050479e-7,0.0001097803,0.6306039,0.3329724,0.03585588,0.000009023931,0.0001030494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001438049,0.00001760351,0.9887503,0.001558071,0.0003689804,0.0004046084,0.000004503626,0.00008226251,0.007375584],"genre_scores_gemma":[0.724167,0.00001367095,0.2754322,0.0001728479,0.00001570344,0.00001676412,8.205675e-7,0.000008888513,0.0001721026],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.722729,"threshold_uncertainty_score":0.7010643,"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."}}