{"id":"W2397806795","doi":"10.1609/socs.v3i1.18236","title":"Search-Aware Conditions for Probably Approximately Correct Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","keywords":"Incremental heuristic search; Speedup; Beam search; Heuristic; Bidirectional search; Iterative deepening depth-first search; Computer science; Search algorithm; Best-first search; Beam stack search; Quality (philosophy); Search problem; Field (mathematics); Guided Local Search; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Parallel computing","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.001406273,0.0002132621,0.0002552115,0.0001363142,0.0004855452,0.0005193725,0.002304228,0.0001203918,0.00002923484],"category_scores_gemma":[0.0003994838,0.0001833132,0.0002015027,0.0005957984,0.0001555675,0.0003681729,0.0008105363,0.0005098283,0.00002439849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002512959,"about_ca_system_score_gemma":0.0004213047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007103901,"about_ca_topic_score_gemma":0.000001156312,"domain_scores_codex":[0.9970123,0.00006186761,0.0003973444,0.0006084218,0.001423258,0.0004967707],"domain_scores_gemma":[0.9964644,0.0007223228,0.0001338693,0.0002708069,0.002263054,0.0001455598],"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.0002413853,0.0005785667,0.003611222,0.0003284703,0.0001728005,0.00001006044,0.001130798,0.001569922,0.05149077,0.9309043,0.0090748,0.0008868678],"study_design_scores_gemma":[0.003023623,0.0007531058,0.0008315371,0.0008979032,0.00003950294,0.0001309416,0.0003612954,0.1351432,0.7932895,0.05929155,0.005596921,0.0006408847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8210236,0.0001705378,0.03090382,0.06827525,0.02211642,0.004327509,0.0006618772,0.0008123704,0.05170865],"genre_scores_gemma":[0.9964615,0.00001063789,0.001737052,0.0001879638,0.0003586628,0.00009836486,0.00003700722,0.0000278791,0.001080941],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8716128,"threshold_uncertainty_score":0.7475296,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02591596339315059,"score_gpt":0.2807167400186607,"score_spread":0.2548007766255101,"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."}}