{"id":"W2058753381","doi":"10.1007/s10107-004-0542-7","title":"Capacitated transit assignment with loading priorities","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Queue; Position (finance); Transit (satellite); Variational inequality; Mathematical optimization; Set (abstract data type); Node (physics); Residual; Order (exchange); Preference; Computer science; Mathematics; Operations research; Public transport; Transport engineering; Computer network; Algorithm; Engineering","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":[],"consensus_categories":[],"category_scores_codex":[0.0003052292,0.0000833215,0.0001150382,0.0000404868,0.0003571095,0.0001193722,0.000072622,0.00005457036,0.00006897651],"category_scores_gemma":[0.00004784365,0.00006888019,0.00002993942,0.0002074432,0.0001794268,0.0001664399,0.000001688294,0.00008665244,0.00002533872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007284784,"about_ca_system_score_gemma":0.00007690179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001259136,"about_ca_topic_score_gemma":0.0001664136,"domain_scores_codex":[0.9990647,0.00002934548,0.0001655091,0.0001303947,0.0003488814,0.0002611104],"domain_scores_gemma":[0.9996796,0.00006094149,0.00004307203,0.00006408674,0.00005100099,0.0001012675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","study_design_scores_codex":[0.00005107402,0.0003731674,0.001700899,0.0002476663,0.0000801209,0.00006907302,0.2205346,0.01210904,0.0001294973,0.7353474,0.00002270605,0.02933481],"study_design_scores_gemma":[0.01657633,0.00267208,0.005809264,0.007519597,0.001219492,0.0001009209,0.4232255,0.004535765,0.007615819,0.4207439,0.1040907,0.005890668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1311398,0.0000399452,0.8476987,0.001566746,0.00005773572,0.0005507605,0.000001916622,0.0005179375,0.01842647],"genre_scores_gemma":[0.9190246,0.00000295079,0.08061386,0.00003308563,0.00003180098,0.0000284649,0.000005626735,0.00001101788,0.0002486259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7878848,"threshold_uncertainty_score":0.2808853,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0237641230072467,"score_gpt":0.2759974946328648,"score_spread":0.252233371625618,"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."}}