{"id":"W2966663453","doi":"10.1609/socs.v10i1.18508","title":"Improving Bidirectional Heuristic Search by Bounds Propagation","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":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Heuristics; Heuristic; Computer science; Node (physics); Bidirectional search; Incremental heuristic search; Algorithm; Mathematical optimization; Running time; Search algorithm; Beam search; Upper and lower bounds; Theoretical computer science; Mathematics; Artificial intelligence; Engineering","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.0005209657,0.0001315663,0.0001272935,0.00009804309,0.000260332,0.0004376124,0.00092786,0.00007896651,0.00007740251],"category_scores_gemma":[0.0002628646,0.000115908,0.0001008389,0.0005641627,0.00008539238,0.0004892274,0.0004508355,0.0003030322,0.00001583158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003109464,"about_ca_system_score_gemma":0.0002382458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007821547,"about_ca_topic_score_gemma":0.00000198777,"domain_scores_codex":[0.9976985,0.00003140272,0.000309036,0.000411182,0.001334454,0.0002154265],"domain_scores_gemma":[0.9980445,0.0001159189,0.0001395221,0.0001497609,0.001471971,0.00007836083],"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.00008143534,0.0003782223,0.005751733,0.00005159653,0.00007290903,0.000001620902,0.0003005581,0.000371047,0.4380272,0.5435933,0.003700097,0.007670285],"study_design_scores_gemma":[0.001407283,0.0001784534,0.00257753,0.0001004827,0.00001245267,0.00005539775,0.00008746424,0.08109336,0.9038069,0.005955313,0.004428997,0.0002963791],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8001244,0.00008388502,0.0419666,0.05592831,0.02632924,0.001288699,0.00007361727,0.0005055548,0.07369968],"genre_scores_gemma":[0.997193,0.00002066749,0.00107281,0.0001450271,0.0002602429,0.00001820515,0.00001035134,0.00001286005,0.00126679],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5376379,"threshold_uncertainty_score":0.4726592,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009862664804386103,"score_gpt":0.2391165904643839,"score_spread":0.2292539256599978,"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."}}