{"id":"W4385763925","doi":"10.24963/ijcai.2023/625","title":"Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Heuristics; Heuristic; Computer science; Set (abstract data type); Algorithm; Bidirectional search; Mathematical optimization; Search algorithm; Beam search; Theoretical computer science; Incremental heuristic 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.002052847,0.0002299665,0.0002895784,0.0004795408,0.0006146069,0.0009077701,0.0003355333,0.00005803309,0.000183195],"category_scores_gemma":[0.0009373793,0.0001943429,0.00002493168,0.00104119,0.0001920013,0.0002719981,0.0006792984,0.0002637403,0.0001827985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006319518,"about_ca_system_score_gemma":0.0002802523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000168293,"about_ca_topic_score_gemma":0.00002396279,"domain_scores_codex":[0.9966727,0.0002956128,0.000374982,0.0008453327,0.001226361,0.0005849766],"domain_scores_gemma":[0.9975306,0.001018554,0.00006227242,0.000422403,0.0005184944,0.0004476116],"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.0001064474,0.0002211048,0.01095735,0.0003864516,0.0003962266,0.0004758757,0.005392336,0.02773662,0.001216143,0.02019072,0.008412577,0.9245082],"study_design_scores_gemma":[0.0005373075,0.0003445137,0.00777416,0.00003968036,0.00001226633,0.0001355647,0.0001896243,0.9896651,0.0001360126,0.0003445587,0.000556043,0.0002651497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02086361,0.0001900913,0.9735067,0.001808932,0.0002555152,0.0005523258,0.00001676168,0.0004234985,0.00238253],"genre_scores_gemma":[0.0987923,0.0001122237,0.8933129,0.000324514,0.0001569739,0.0000977858,0.00001961668,0.00004218953,0.007141465],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9619285,"threshold_uncertainty_score":0.8753648,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06058572995949063,"score_gpt":0.34199767726925,"score_spread":0.2814119473097593,"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."}}