{"id":"W2966242139","doi":"10.24963/ijcai.2019/175","title":"Direction-Optimizing Breadth-First Search with External Memory Storage","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Heuristics; Computer science; Heuristic; Auxiliary memory; Cube (algebra); Incremental heuristic search; Graph; Search algorithm; Parallel computing; Theoretical computer science; Algorithm; Beam search; Artificial intelligence; Mathematics","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":[],"category_scores_codex":[0.0001526987,0.00009933046,0.00009685727,0.0001191939,0.000123357,0.0001909368,0.0002367709,0.00003510429,0.0009325495],"category_scores_gemma":[0.000003675406,0.00008099247,0.00003181571,0.0002813548,0.00002729434,0.0006443212,0.00007196888,0.0001176848,0.0002974015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006013566,"about_ca_system_score_gemma":0.00006633362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001245797,"about_ca_topic_score_gemma":0.00008047826,"domain_scores_codex":[0.9990808,0.00003144149,0.0001143716,0.000302048,0.0002818148,0.0001895251],"domain_scores_gemma":[0.9994174,0.00005200096,0.0000371625,0.0003281519,0.00008153226,0.00008373771],"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.00008569637,0.0002116059,0.07123012,0.00008361832,0.0001042474,0.00006920553,0.003932191,0.5443063,0.004712734,0.05526752,0.001171088,0.3188257],"study_design_scores_gemma":[0.001256921,0.0001970539,0.06930225,0.00008022157,0.00000742377,0.0002431681,0.0003240679,0.9237819,0.00282803,0.0000620065,0.001438279,0.0004786281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03598303,0.00001470878,0.9168855,0.0005721317,0.0003542416,0.0001626697,3.937303e-7,0.000277651,0.04574967],"genre_scores_gemma":[0.8355921,0.00001165057,0.1556591,0.0002211375,0.00003895622,0.000005660563,8.723306e-7,0.000009373389,0.008461177],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7996091,"threshold_uncertainty_score":0.9999807,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008246674108310384,"score_gpt":0.2120163881170462,"score_spread":0.2037697140087358,"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."}}