{"id":"W3035592717","doi":"10.24963/ijcai.2020/562","title":"Multi-Directional Heuristic Search","year":2020,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Heuristics; Mathematical optimization; Heuristic; Computer science; Task (project management); Path (computing); Bidirectional search; Consistent heuristic; Algorithm; Search algorithm; Best-first search; Incremental heuristic search; Beam search; Mathematics; 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.00009000612,0.00004103169,0.00004505211,0.00002689762,0.00006774881,0.00009778295,0.0003153431,0.00001592217,0.0003783482],"category_scores_gemma":[0.00004674944,0.00003545496,0.00002089347,0.0002951512,0.00001609451,0.0001724289,0.0001399709,0.00007954812,0.0006365573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008307187,"about_ca_system_score_gemma":0.00004989402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001119145,"about_ca_topic_score_gemma":0.000001462992,"domain_scores_codex":[0.9993837,0.00003870809,0.00007594387,0.0001830966,0.0001903421,0.0001282097],"domain_scores_gemma":[0.9996351,0.00003241365,0.000007355049,0.000104637,0.00006993365,0.0001505444],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003212121,0.0007123864,0.007257228,0.0001340294,0.00009596747,0.0001068144,0.008887747,0.1465139,0.01499393,0.5724072,0.147403,0.1014556],"study_design_scores_gemma":[0.0001739959,0.00003014315,0.0005470673,9.303939e-7,2.506557e-7,0.000002104919,0.000008731498,0.9902344,0.0004358686,0.00006308028,0.008451149,0.00005227121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007733818,0.00001173721,0.9784397,0.009610767,0.00005998695,0.00006602739,5.206011e-7,0.0002643693,0.01146951],"genre_scores_gemma":[0.1819606,0.00001131781,0.8093569,0.004308521,0.00005770214,0.000005711626,0.000002217645,0.000005147568,0.004291916],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8437204,"threshold_uncertainty_score":0.8181868,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08922955930922948,"score_gpt":0.298222700249762,"score_spread":0.2089931409405325,"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."}}