{"id":"W3197111254","doi":"10.1609/socs.v12i1.18581","title":"Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Computer science; Incremental heuristic search; Null-move heuristic; Iterative deepening depth-first search; Search algorithm; Algorithm; Beam search; Mathematical optimization; Mathematics; Artificial intelligence","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.0008355313,0.000216799,0.0002603545,0.0002531236,0.0003460206,0.0006455289,0.002353552,0.0000918796,0.0001467956],"category_scores_gemma":[0.0007766058,0.0001653153,0.0001133818,0.001668595,0.0001712483,0.0005047654,0.001150441,0.0006461969,0.00003525472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003145778,"about_ca_system_score_gemma":0.0005051717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006371935,"about_ca_topic_score_gemma":0.000001309646,"domain_scores_codex":[0.9951669,0.0001080571,0.0004315324,0.0006764635,0.003212828,0.0004042118],"domain_scores_gemma":[0.9947268,0.0005015063,0.0001639258,0.0003266224,0.004111547,0.0001696233],"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.0007023808,0.001405669,0.006170795,0.0001400768,0.0004978823,0.00006672754,0.001324452,0.006437938,0.1068191,0.8696534,0.004065186,0.002716364],"study_design_scores_gemma":[0.004485299,0.0008144083,0.005268644,0.000428677,0.00003107756,0.0002523786,0.000233922,0.1965841,0.7795953,0.008128526,0.003513094,0.0006646087],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6922798,0.0001446559,0.03293281,0.0512438,0.01630199,0.002276518,0.00008089937,0.0006131728,0.2041264],"genre_scores_gemma":[0.9817689,0.00004236711,0.01289484,0.0001544003,0.0005459685,0.00005157295,0.0000103379,0.00003790669,0.004493695],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8615249,"threshold_uncertainty_score":0.6741363,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01798461546135943,"score_gpt":0.2674510381562879,"score_spread":0.2494664226949285,"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."}}