{"id":"W2060633232","doi":"10.1002/atr.5670420403","title":"General stochastic user equilibrium traffic assignment problem with link capacity constraints","year":2008,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National University of Singapore","keywords":"Subroutine; Mathematical optimization; Dual (grammatical number); Lagrangian; Minification; Path (computing); Sequence (biology); Lagrangian relaxation; Computer science; Basis (linear algebra); Benchmark (surveying); Link (geometry); Function (biology); Trajectory; Applied mathematics; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002781531,0.000130035,0.0002196615,0.000120871,0.0002396825,0.00002037062,0.00009947571,0.00008374677,0.00006397546],"category_scores_gemma":[0.00001827802,0.0001137628,0.00008147485,0.0002634405,0.0002953133,0.0007262989,3.196112e-7,0.0002085384,0.000001995128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008186736,"about_ca_system_score_gemma":0.0003518417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002297997,"about_ca_topic_score_gemma":0.0002606912,"domain_scores_codex":[0.9983994,0.00006414021,0.0005200827,0.0001451522,0.0006426189,0.0002285958],"domain_scores_gemma":[0.9988061,0.00006115359,0.0005023538,0.0000550518,0.0004092396,0.0001661595],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0002023132,0.00007121726,0.002469881,0.00001264867,0.00003619941,0.00005074898,0.0204417,0.9728554,0.0005663675,0.0009615712,0.00003118264,0.002300687],"study_design_scores_gemma":[0.01819851,0.00315776,0.9390502,0.001240921,0.0008296251,0.0002547961,0.02046707,0.001841993,0.001828789,0.001644656,0.009469986,0.002015712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8824261,0.00003940726,0.116406,0.0004345606,0.0002209098,0.0002151017,0.00001625608,0.00004238881,0.0001992862],"genre_scores_gemma":[0.9580606,0.00004611756,0.04142644,0.00004813639,0.0001885773,0.000005731556,0.00003946847,0.00001510162,0.0001698799],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9710135,"threshold_uncertainty_score":0.4639114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01937116034573813,"score_gpt":0.2573713804144278,"score_spread":0.2380002200686897,"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."}}