{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009819887,0.001403414,0.002002114,0.001784044,0.001070601,0.002743508,0.00227848,0.001969156,0.004585959],"category_scores_gemma":[0.06106146,0.001081377,0.001125201,0.001142314,0.002863502,0.005619586,0.00301075,0.003553399,0.0006679657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001724555,"about_ca_system_score_gemma":0.004373537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00290374,"about_ca_topic_score_gemma":0.001949052,"domain_scores_codex":[0.9943158,0.00212817,0.0004027005,0.0007179228,0.001315687,0.001119763],"domain_scores_gemma":[0.9599716,0.02978621,0.003216871,0.002633944,0.00285398,0.001537475],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004849054,0.0002848714,0.003445376,0.000603969,0.00009969572,0.0004393771,0.0004689673,0.6581234,0.006554047,0.2245072,0.005297762,0.09969048],"study_design_scores_gemma":[0.00006715258,0.0002251103,0.0005884598,0.00009117616,0.00002890544,0.0001781534,0.0001124944,0.9331024,0.002761559,0.06102183,0.001789261,0.00003355114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04333809,0.0007588634,0.9468781,0.0004385601,0.00007864596,0.0002232153,0.0001019106,0.0006866544,0.007495959],"genre_scores_gemma":[0.7281723,0.000641369,0.2675102,0.0004020818,0.00008465089,0.0003870413,0.0002829999,0.0003780019,0.00214138],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009819887,"threshold_uncertainty_score":0.05193311,"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."}}