{"id":"W1557519121","doi":"10.1613/jair.2293","title":"Graph Abstraction in Real-time Heuristic Search","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"University of Alberta; Western Canada Research Grid","keywords":"Computer science; Abstraction; Incremental heuristic search; Heuristic; Graph; Maxima and minima; Theoretical computer science; Pathfinding; Class (philosophy); Situated; Beam search; Artificial intelligence; Search algorithm; Algorithm; Mathematics","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.01941097,0.0001109318,0.0002192197,0.001531033,0.0002249931,0.0002657706,0.001029896,0.0001175646,0.00007408169],"category_scores_gemma":[0.0006767864,0.0001002098,0.00009457166,0.001927722,0.0001427957,0.0005793924,0.0001219779,0.001381841,0.0002630583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002022089,"about_ca_system_score_gemma":0.0003854085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004245291,"about_ca_topic_score_gemma":0.00007439489,"domain_scores_codex":[0.9963234,0.0003830417,0.0009273931,0.0002512821,0.001359686,0.0007551763],"domain_scores_gemma":[0.9964144,0.001978656,0.0001816657,0.0003016041,0.0008705085,0.0002532028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006638227,0.0007207816,0.003919245,0.00008410973,0.00004587058,0.002697017,0.006474966,0.02763581,0.1090301,0.03759545,0.00144831,0.8096845],"study_design_scores_gemma":[0.0002774872,0.003837665,0.01953203,0.001327051,0.00001500204,0.000934381,0.005159153,0.2802083,0.404863,0.2813379,0.001523885,0.0009840402],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3777869,0.000182844,0.6173208,0.001119923,0.0003866613,0.0001518227,7.660321e-7,0.00003222615,0.00301805],"genre_scores_gemma":[0.9835452,0.0001479187,0.0158708,0.0000144983,0.0002852159,9.510731e-7,5.379702e-7,0.000009965436,0.0001249206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8087005,"threshold_uncertainty_score":0.6727492,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1599400188619807,"score_gpt":0.4311293688593298,"score_spread":0.2711893499973491,"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."}}