{"id":"W100039866","doi":"","title":"The Online Loop-free Stochastic Shortest-Path Problem.","year":2010,"lang":"en","type":"article","venue":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Shortest path problem; Regret; Mathematics; Asymptotically optimal algorithm; Path (computing); Graph; Action (physics); State (computer science); Combinatorics; Mathematical optimization; Hindsight bias; Discrete mathematics; Computer science; Algorithm","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":["metaresearch","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.01065064,0.0002960356,0.0003949206,0.0007145578,0.002220953,0.001347477,0.008261663,0.0003216101,0.0001365791],"category_scores_gemma":[0.01521406,0.000186729,0.0001835561,0.003998686,0.003807943,0.001941271,0.000872332,0.001467189,0.0001275966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007493615,"about_ca_system_score_gemma":0.0007129561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003106736,"about_ca_topic_score_gemma":0.00003538653,"domain_scores_codex":[0.9904721,0.0003767379,0.001744559,0.001332952,0.005212147,0.0008614577],"domain_scores_gemma":[0.9922229,0.003236679,0.001328355,0.00132309,0.001412976,0.0004759995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002277414,0.001500463,0.01597679,0.00003214558,0.0001451476,0.000009495171,0.001365424,0.008154655,0.178455,0.3162704,0.1402333,0.3376294],"study_design_scores_gemma":[0.002192128,0.0006666035,0.1894016,0.00008901297,0.00006698066,0.0005405506,0.002674771,0.2104459,0.01875861,0.3633321,0.2102809,0.001550769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3550711,0.00194001,0.2017345,0.3443621,0.007688351,0.009985682,0.0005103617,0.001461509,0.07724641],"genre_scores_gemma":[0.9675359,0.00001538378,0.01761892,0.0004968641,0.0007926121,0.0001458504,0.000007367774,0.00003381212,0.01335333],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6124648,"threshold_uncertainty_score":0.9996892,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07004419195070641,"score_gpt":0.3992770809796929,"score_spread":0.3292328890289865,"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."}}