{"id":"W112839659","doi":"","title":"Memory-Bounded D* Lite","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Pathfinding; Bounded function; Computer science; Queue; Priority queue; Path (computing); Parallel computing; Theoretical computer science; Algorithm; Shortest path problem; Operating system; Mathematics; Computer network; Graph","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.00007313016,0.00005153282,0.00005011122,0.00004567819,0.00009423404,0.00009876421,0.0006778443,0.00001104697,0.00009334662],"category_scores_gemma":[0.000005239852,0.00004193633,0.0000232934,0.0002102185,0.00002263823,0.0007598036,0.0002903236,0.00003035867,0.0007452253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005967583,"about_ca_system_score_gemma":0.00001087977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001994893,"about_ca_topic_score_gemma":0.000002116917,"domain_scores_codex":[0.9994632,0.000008764539,0.00006994068,0.0001789036,0.0001435279,0.0001356704],"domain_scores_gemma":[0.9994997,0.0000104938,0.00001470601,0.0004200627,0.0000152852,0.00003974048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001501218,0.0001025612,0.0004251957,0.000007890767,0.00002594039,0.0002217678,0.0005491538,0.000006254103,0.00008671445,0.5242718,0.1988413,0.27546],"study_design_scores_gemma":[0.001019083,0.0001050307,0.01132672,0.000008559797,0.000005774777,0.00008779584,0.00004157648,0.09566723,0.004555481,0.0193631,0.8671858,0.0006338828],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003049291,0.00003195736,0.7540925,0.001161987,0.0003087335,0.00006041189,5.560132e-7,0.0003385325,0.240956],"genre_scores_gemma":[0.2309972,0.000100924,0.5594009,0.004219726,0.0002607387,0.00001257202,0.00001360449,0.00001150542,0.2049829],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6683445,"threshold_uncertainty_score":0.9578612,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02356485116860079,"score_gpt":0.2158187258912426,"score_spread":0.1922538747226418,"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."}}