{"id":"W2397134496","doi":"10.1609/socs.v3i1.18266","title":"Alternative Forms of Bounded Suboptimal Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Bounded function; Construct (python library); Mathematical optimization; Iterative deepening depth-first search; Mathematics; Computer science; Search algorithm; Constant (computer programming); Beam search; Algorithm; Theoretical computer science; Best-first search; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009603997,0.0001519283,0.0002259232,0.000109379,0.0001416924,0.0002090363,0.002488573,0.00007007806,0.00003533751],"category_scores_gemma":[0.0002526348,0.0001155319,0.0001825322,0.0005205964,0.0001555486,0.0003509561,0.001233282,0.0004594431,0.00001137921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001405673,"about_ca_system_score_gemma":0.0001637259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001447176,"about_ca_topic_score_gemma":7.989324e-7,"domain_scores_codex":[0.9971988,0.00003922945,0.0003588091,0.0004021945,0.001719573,0.0002814232],"domain_scores_gemma":[0.9977822,0.0002008744,0.0001884477,0.0002233401,0.001523081,0.00008207005],"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.00007901721,0.0003241407,0.003110636,0.00003862353,0.00009330449,0.000002754909,0.000562851,0.0003424672,0.05047425,0.9433842,0.0001590599,0.001428739],"study_design_scores_gemma":[0.001351891,0.000304822,0.001356774,0.0001462946,0.000007899031,0.00002590305,0.0000913185,0.04467165,0.8896787,0.06079402,0.001382222,0.0001885384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9393624,0.00002139648,0.00122168,0.009115241,0.003780416,0.0002282365,0.00001262213,0.00005780502,0.04620022],"genre_scores_gemma":[0.9973565,0.00001869273,0.001502491,0.00007368639,0.000284356,0.00000860592,0.000002600887,0.00001364762,0.000739429],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8825901,"threshold_uncertainty_score":0.4711256,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01429436540194341,"score_gpt":0.2740143347736901,"score_spread":0.2597199693717467,"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."}}