{"id":"W2943778955","doi":"10.1016/j.ejtl.2020.100004","title":"A tutorial on recursive models for analyzing and predicting path choice behavior","year":2020,"lang":"en","type":"preprint","venue":"EURO Journal on Transportation and Logistics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Intuition; Computer science; Path (computing); Discrete choice; Inverse; Theoretical computer science; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Cognitive science","routes":{"ca_aff":true,"ca_fund":true,"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.001656343,0.002601885,0.001398391,0.001524585,0.0004011212,0.001824783,0.001889222,0.00237653,0.01958942],"category_scores_gemma":[0.007080313,0.0009555889,0.002419601,0.002622859,0.0008635144,0.00340135,0.001265813,0.003909658,0.005535558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001078026,"about_ca_system_score_gemma":0.001117369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00454351,"about_ca_topic_score_gemma":0.004243706,"domain_scores_codex":[0.9992684,0.0003330551,0.00005564842,0.0001369563,0.0001527491,0.00005328083],"domain_scores_gemma":[0.9974018,0.002100685,0.0001331794,0.0001595627,0.0001468012,0.00005788902],"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.00004282282,0.0001604831,0.001584147,0.001202288,0.000185528,0.0003462476,0.0003454295,0.157879,0.001950847,0.6409087,0.05506811,0.1403264],"study_design_scores_gemma":[0.00001604579,0.00008391647,0.0009050831,0.0004351265,0.00008245764,0.0003293349,0.00005763618,0.3361216,0.0004514083,0.5415902,0.1198559,0.00007124474],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001512653,0.02153484,0.9597862,0.001739169,0.0005109706,0.00007183229,0.001228449,0.0007065106,0.01290942],"genre_scores_gemma":[0.1049987,0.08819337,0.7645223,0.002602927,0.003859163,0.001556955,0.004892302,0.0009926901,0.02838168],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01958942,"threshold_uncertainty_score":0.06553316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08301966753873334,"score_gpt":0.3385868799717806,"score_spread":0.2555672124330472,"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."}}