{"id":"W3174209100","doi":"10.1609/aaai.v35i5.16485","title":"Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Bounded function; Bounding overwatch; Constant (computer programming); Computer science; Heuristic; Differentiable function; Piecewise; Mathematical optimization; Piecewise linear function; Incremental heuristic search; Function (biology); Mathematics; Search algorithm; Beam 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.0009428575,0.0001843709,0.0002558405,0.0002625182,0.000660958,0.0006338028,0.0008285108,0.00006732184,0.00006809898],"category_scores_gemma":[0.000869561,0.0001494502,0.00005771689,0.001343193,0.0003167513,0.0004970437,0.0004277794,0.000396943,0.00001424977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007836908,"about_ca_system_score_gemma":0.0003078998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005893258,"about_ca_topic_score_gemma":0.00006554861,"domain_scores_codex":[0.9978839,0.00004053758,0.0004632717,0.0006232001,0.0005497469,0.0004392998],"domain_scores_gemma":[0.9978004,0.0003691476,0.0001688738,0.0002520189,0.001283546,0.0001259785],"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.0001047855,0.0003874511,0.002148945,0.0001458202,0.00002937022,0.000005681484,0.002965042,0.008130536,0.01511402,0.9652317,0.0001638323,0.005572829],"study_design_scores_gemma":[0.0001264413,0.0003134568,0.0004913938,0.0003376716,0.00001552599,0.00003226463,0.00279749,0.8680571,0.1197204,0.007752941,0.0001047247,0.0002506248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5227957,0.00004924033,0.4640049,0.008082308,0.0002974596,0.000896531,0.00002777281,0.00005707438,0.003789029],"genre_scores_gemma":[0.9655903,0.00005266701,0.03328377,0.00007295092,0.00004542573,0.00009355496,0.000003786228,0.00001485266,0.000842721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9574788,"threshold_uncertainty_score":0.6111774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09174042424760195,"score_gpt":0.3268076675045277,"score_spread":0.2350672432569258,"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."}}