{"id":"W2759836588","doi":"10.1609/icaps.v27i1.13825","title":"Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Node (physics); Heuristics; Mathematical optimization; Class (philosophy); Bidirectional search; Heuristic; Incremental heuristic search; Search algorithm; Beam search; Computer science; Front (military); Focus (optics); Mathematics; Algorithm; Artificial intelligence; Engineering","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007322401,0.001052352,0.001577032,0.002027745,0.001130296,0.002115238,0.001775221,0.001874309,0.008035867],"category_scores_gemma":[0.05663881,0.001259647,0.001487351,0.001425465,0.003197481,0.007069243,0.002877188,0.003371411,0.001225922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009227383,"about_ca_system_score_gemma":0.002980581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001923001,"about_ca_topic_score_gemma":0.002226893,"domain_scores_codex":[0.9934633,0.002586976,0.0004416539,0.000915424,0.001427972,0.001164703],"domain_scores_gemma":[0.9449419,0.04430097,0.002922669,0.002546207,0.004114402,0.001173827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007458141,0.000317787,0.003839673,0.0007417638,0.0001141743,0.000597496,0.0007388304,0.4829718,0.0129919,0.4538768,0.003223298,0.03984065],"study_design_scores_gemma":[0.0001343038,0.0002644233,0.0007572588,0.0002508738,0.00007097919,0.0001973821,0.0004705306,0.740652,0.01144164,0.2417481,0.00394602,0.00006651277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06715021,0.0003123911,0.9214025,0.0004493671,0.00003624939,0.0002752631,0.0003585463,0.0005222415,0.009493172],"genre_scores_gemma":[0.7021334,0.0006293398,0.2906514,0.0003696778,0.00007574543,0.001312368,0.001234847,0.0005125473,0.003080723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008035867,"threshold_uncertainty_score":0.03872502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08026908485261397,"score_gpt":0.3518153585259207,"score_spread":0.2715462736733067,"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."}}