{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003574423,0.001773939,0.001471108,0.002614109,0.0009929494,0.001819324,0.002492546,0.001888132,0.005498886],"category_scores_gemma":[0.01710885,0.0008973564,0.001243523,0.002414433,0.001310501,0.003550643,0.004351163,0.002156767,0.001549635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001193168,"about_ca_system_score_gemma":0.00231894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005036448,"about_ca_topic_score_gemma":0.005785132,"domain_scores_codex":[0.9969835,0.001172642,0.0001366362,0.0003487262,0.0009804979,0.0003779646],"domain_scores_gemma":[0.9917288,0.005301049,0.0005411983,0.001255504,0.0009803621,0.0001930584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003251195,0.0003466111,0.001833394,0.0003124158,0.0001056009,0.0001328309,0.0002718951,0.5834518,0.006985764,0.06105077,0.005458013,0.3397258],"study_design_scores_gemma":[0.00004388095,0.00005997723,0.0001379141,0.00003597952,0.00002936387,0.00003667548,0.00004092893,0.9691405,0.002375351,0.02618409,0.001901315,0.00001396704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0239825,0.0005283016,0.9649355,0.0002431647,0.00006426512,0.0001140218,0.00009635697,0.00148827,0.008547643],"genre_scores_gemma":[0.335256,0.000479897,0.6585632,0.000345387,0.00008623186,0.0004352859,0.0004889242,0.0005760248,0.003769046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005498886,"threshold_uncertainty_score":0.01890355,"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."}}