{"id":"W3094196896","doi":"10.1063/5.0028464","title":"Markov chain long run probabilities for estimation of traffic flow","year":2020,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Markov chain; Computer science; Markov process; Traffic flow (computer networking); Traffic congestion reconstruction with Kerner's three-phase theory; Markov model; Markov decision process; State (computer science); Set (abstract data type); Traffic congestion; Operations research; Mathematical optimization; Algorithm; Transport engineering; Engineering; Mathematics; Computer network; Machine learning; Statistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001695589,0.0008770917,0.0009622519,0.001675782,0.0005815965,0.001355358,0.001074744,0.001036387,0.003903653],"category_scores_gemma":[0.009771664,0.0006898078,0.001036801,0.00168989,0.0007423228,0.002059236,0.0008620404,0.002307568,0.001075661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001121541,"about_ca_system_score_gemma":0.001661952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02103889,"about_ca_topic_score_gemma":0.01076584,"domain_scores_codex":[0.9988438,0.0004189401,0.00006058784,0.0003265146,0.0002395772,0.0001106078],"domain_scores_gemma":[0.9953166,0.003389578,0.0004619208,0.0002535255,0.0004983654,0.00007999011],"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.00005252976,0.00003518917,0.003290343,0.00008388709,0.0000640954,0.00008931694,0.0000547328,0.9361649,0.0007524982,0.02947719,0.001153012,0.02878237],"study_design_scores_gemma":[0.000002206969,0.000008541955,0.0003361825,0.00001155474,0.000008074106,0.00001471621,0.000004721979,0.9892457,0.0001869995,0.009788774,0.0003838228,0.000008784928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008946407,0.000632448,0.9881639,0.0001433454,0.00005930354,0.00003822065,0.0002912954,0.0004185967,0.001306367],"genre_scores_gemma":[0.7633406,0.003725584,0.2211765,0.0001467022,0.0003270167,0.0004943081,0.002927365,0.0001994768,0.00766232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02103889,"threshold_uncertainty_score":0.04183286,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01785618250407247,"score_gpt":0.2175544816645295,"score_spread":0.199698299160457,"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."}}