{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002526141,0.0006045668,0.0009087593,0.001140479,0.000608115,0.001433952,0.001340406,0.00105042,0.002016126],"category_scores_gemma":[0.01394699,0.0006140378,0.0009819224,0.001581496,0.002899691,0.004070633,0.001685829,0.001960537,0.0002994516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001665054,"about_ca_system_score_gemma":0.001421478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003917666,"about_ca_topic_score_gemma":0.002869066,"domain_scores_codex":[0.9983959,0.0008603692,0.00006548713,0.0002263404,0.0003255981,0.0001263425],"domain_scores_gemma":[0.9881248,0.008507265,0.0007897236,0.001818307,0.0005190279,0.0002408207],"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.000147189,0.0000594166,0.0007875434,0.000143975,0.00004278972,0.00007252827,0.0002357463,0.82928,0.001393038,0.120023,0.0005408597,0.04727389],"study_design_scores_gemma":[0.00002944057,0.00006262549,0.0002541703,0.00001691675,0.00001895681,0.00003807234,0.00003205933,0.8368143,0.0008080375,0.1605801,0.001330594,0.00001470344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05344927,0.000656957,0.9424456,0.0002708171,0.00002377031,0.0000622859,0.00006023758,0.0006141726,0.002416802],"genre_scores_gemma":[0.7175075,0.0007073586,0.2793964,0.0001132326,0.00003441436,0.0001781109,0.0001739282,0.00013117,0.001757961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003917666,"threshold_uncertainty_score":0.01335961,"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."}}