{"id":"W2965549869","doi":"10.24963/ijcai.2019/867","title":"Optimally Efficient Bidirectional Search","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Hebrew University of Jerusalem; National Science Foundation","keywords":"Computer science; Heuristic; Bidirectional search; Efficient algorithm; Algorithm; Mathematical optimization; Node (physics); Search algorithm; Best-first search; Mathematics; Beam search","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":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000589066,0.00007675683,0.00009513304,0.0001936906,0.00006478547,0.0001868321,0.0007250652,0.00003249391,0.002734417],"category_scores_gemma":[0.00005268685,0.00006468785,0.0000410366,0.0006621163,0.00002476154,0.0001335877,0.0003522377,0.0001259761,0.005086945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004483789,"about_ca_system_score_gemma":0.0001653594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001507993,"about_ca_topic_score_gemma":2.921489e-7,"domain_scores_codex":[0.9983793,0.00008066634,0.0001477797,0.0003579417,0.0007544197,0.0002799284],"domain_scores_gemma":[0.9989843,0.0001363304,0.00001814392,0.0004982618,0.0002379221,0.0001250016],"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.00001063708,0.0002647224,0.001519303,0.00002371121,0.00003610336,0.00001698134,0.0001987801,0.5541669,0.001346685,0.4068735,0.003662101,0.03188067],"study_design_scores_gemma":[0.0001981262,0.00003969717,0.001296964,0.000002353592,4.522916e-7,0.00001196217,0.000006992179,0.9942133,0.001166104,0.00006962983,0.00290701,0.00008743908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00672417,0.00001820442,0.898275,0.0008331318,0.0003671857,0.000194915,7.333516e-7,0.0001777155,0.09340897],"genre_scores_gemma":[0.1591453,0.000007911982,0.7955125,0.0002373349,0.00005331152,0.00001132429,0.000002828126,0.00001148245,0.04501805],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4400464,"threshold_uncertainty_score":0.9981772,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0179847930493404,"score_gpt":0.2777990495920848,"score_spread":0.2598142565427444,"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."}}