{"id":"W2440655608","doi":"","title":"Modeling And Optimizing Route Choice For Multimodal Transportation Networks","year":2016,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Transport engineering; Traffic congestion; Computer science; Schedule; Routing (electronic design automation); Probabilistic logic; Vehicle routing problem; Flow network; Dijkstra's algorithm; Operations research; Shortest path problem; Graph; Engineering; Computer network; Mathematical optimization","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006769012,0.0002298188,0.0002972544,0.0006560396,0.002347842,0.0001961829,0.0003396751,0.0005243084,0.00001804327],"category_scores_gemma":[0.00008653661,0.0002596311,0.0001492687,0.0005269603,0.0001882016,0.0005894346,0.000006266906,0.0005041266,0.000001790093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004644413,"about_ca_system_score_gemma":0.000968048,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.04007171,"about_ca_topic_score_gemma":0.1478762,"domain_scores_codex":[0.9974972,0.0003080552,0.0002883392,0.0006436431,0.0005829078,0.0006798663],"domain_scores_gemma":[0.998386,0.0004496636,0.0001580887,0.00019325,0.0005210473,0.0002920071],"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.01126968,0.0006105858,0.200428,0.001952368,0.001856733,0.0008387891,0.1072053,0.51843,0.00390269,0.1199436,0.002458384,0.0311038],"study_design_scores_gemma":[0.01564744,0.001576633,0.1860477,0.003779416,0.001813738,0.000006555084,0.1240516,0.4478841,0.00315786,0.003280129,0.2063655,0.006389254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8581279,0.0005548149,0.07248936,0.0006864989,0.002063416,0.002105567,0.0001334442,0.00041588,0.06342313],"genre_scores_gemma":[0.9564819,0.0008928821,0.0005400782,0.000006076177,0.0006623597,0.00001482734,0.0007134751,0.00005089765,0.04063755],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2039071,"threshold_uncertainty_score":0.9999856,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02986192293764968,"score_gpt":0.3072234006994945,"score_spread":0.2773614777618448,"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."}}