{"id":"W3037639738","doi":"10.1609/socs.v11i1.18537","title":"A Guide to Budgeted Tree Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative deepening depth-first search; Tree (set theory); Heuristic; Mathematical optimization; Search tree; Incremental heuristic search; Exponential function; Exponential growth; Computer science; Search algorithm; Depth-first search; Mathematics; Beam search; Algorithm; Combinatorics","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.0005986888,0.0001221842,0.0001376623,0.0001310276,0.0001422472,0.0003049316,0.001530769,0.00006407312,0.00007678892],"category_scores_gemma":[0.0003291555,0.0001047642,0.0001118639,0.0007674368,0.00005814712,0.0002920313,0.000849212,0.0002279304,0.00004704465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002410605,"about_ca_system_score_gemma":0.0001867705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006386213,"about_ca_topic_score_gemma":0.000005871404,"domain_scores_codex":[0.9977755,0.00002817919,0.0003032612,0.0003935405,0.001270158,0.0002293725],"domain_scores_gemma":[0.9978715,0.000125834,0.00007273359,0.0002053987,0.001602724,0.0001218721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000712356,0.0002013757,0.002396471,0.00001548563,0.00005775912,0.000002636016,0.0004743588,0.000568533,0.1632235,0.8164431,0.005287129,0.01125843],"study_design_scores_gemma":[0.001715376,0.0002070739,0.006472928,0.0001453138,0.000009622186,0.00004341481,0.0001677574,0.01825443,0.9293912,0.00554734,0.03772433,0.00032119],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3986897,0.00001870981,0.01757795,0.1676407,0.01507595,0.001142996,0.00002656539,0.0003462849,0.3994812],"genre_scores_gemma":[0.9917717,0.00001329573,0.004128958,0.0005979092,0.0002313972,0.00001768029,0.000002458623,0.00001281776,0.003223786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8108957,"threshold_uncertainty_score":0.4272159,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01305475237093703,"score_gpt":0.2718941346757287,"score_spread":0.2588393823047917,"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."}}