{"id":"W3041741830","doi":"10.24963/ijcai.2020/664","title":"Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound","year":2020,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Heuristics; Upper and lower bounds; Computer science; Heuristic; Mathematical optimization; Branch and bound; Bidirectional search; Algorithm; Search algorithm; Theoretical computer science; Best-first search; Beam search; Mathematics; 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.0000593853,0.00005957024,0.00005709731,0.00003462632,0.0001107638,0.0001805414,0.0001391708,0.00002216317,0.0007334237],"category_scores_gemma":[0.00003715721,0.00005630441,0.00002829404,0.0002555332,0.0000271989,0.0002786916,0.00005997125,0.00006733075,0.0001432216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000222056,"about_ca_system_score_gemma":0.00004307887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001568238,"about_ca_topic_score_gemma":0.000002463068,"domain_scores_codex":[0.9993855,0.00002453949,0.00009622074,0.0002046075,0.0001728733,0.0001162066],"domain_scores_gemma":[0.9997044,0.00004902713,0.00001711469,0.00008478377,0.00003699909,0.0001077048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009972466,0.0003796641,0.03070967,0.00009453914,0.0001770816,0.00009158552,0.006099949,0.01280145,0.06173649,0.2158024,0.3126149,0.3593926],"study_design_scores_gemma":[0.000622782,0.0001099893,0.003956245,0.0000115667,0.00000528003,0.00003038105,0.0001224679,0.9637015,0.006076912,0.0005347746,0.02445337,0.0003746984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006471632,0.00002133366,0.9795352,0.004799414,0.0002105446,0.00004978812,0.000002375036,0.0002454375,0.008664316],"genre_scores_gemma":[0.9760641,0.00001182403,0.02139332,0.001675927,0.00005235065,0.000002991274,0.000003845478,0.000004362089,0.0007913127],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9695925,"threshold_uncertainty_score":0.8030475,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03374550677601711,"score_gpt":0.2613294497068696,"score_spread":0.2275839429308525,"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."}}