{"id":"W4285601267","doi":"10.24963/ijcai.2022/660","title":"Efficient Budgeted Graph Search","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative deepening depth-first search; Heuristics; Search tree; Mathematical optimization; Graph; Computer science; Search algorithm; Best-first search; Range (aeronautics); Beam search; Tree (set theory); Incremental heuristic search; Limit (mathematics); Local search (optimization); Search problem; Iterative method; Mathematics; Algorithm; Theoretical computer science; Combinatorics","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.0007521309,0.0002018309,0.0001943496,0.0003991464,0.0006075698,0.0002522017,0.002129908,0.0000470077,0.0008192682],"category_scores_gemma":[0.0002142297,0.0001721311,0.000186139,0.0009014491,0.0002134826,0.0001837802,0.001038196,0.0005047281,0.00006082494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000203028,"about_ca_system_score_gemma":0.0001319435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005423789,"about_ca_topic_score_gemma":0.000009055361,"domain_scores_codex":[0.9972506,0.00003678702,0.0006133029,0.0005164812,0.001295946,0.0002868688],"domain_scores_gemma":[0.9983719,0.00008309427,0.0003695347,0.0002644269,0.0008223559,0.00008870841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005504159,0.0002177003,0.000340307,0.00001086105,0.00002924463,0.000001096854,0.001314447,0.04933427,0.005625276,0.926227,0.0001839328,0.01666079],"study_design_scores_gemma":[0.00008433239,0.000193155,0.001394994,0.00008246358,0.000009289601,0.00003780837,0.001583585,0.8537741,0.08577254,0.05628679,0.0004652041,0.0003157443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3609794,0.0000326315,0.4858266,0.0744604,0.007608453,0.001740955,0.00009446442,0.0006144179,0.06864268],"genre_scores_gemma":[0.9958848,0.00001480574,0.003324556,0.0004033029,0.00005382925,0.00005493559,0.000002411898,0.00001146334,0.0002498987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8699403,"threshold_uncertainty_score":0.8970413,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05721922264094473,"score_gpt":0.2742359353565563,"score_spread":0.2170167127156115,"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."}}