{"id":"W4253771444","doi":"10.1109/glocom.2014.7417469","title":"A Public Vehicle System with Multiple Origin-Destination Pairs on Traffic Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Taxis; Public transport; Computer science; Traffic congestion; Scheduling (production processes); Travelling salesman problem; Key (lock); Path (computing); Energy consumption; Traffic system; Transport engineering; Real-time computing; Computer network; Mathematical optimization; Engineering; Computer security","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003459228,0.0002647211,0.0002510692,0.0001056099,0.0003331958,0.000163012,0.0008571076,0.0001384332,0.00002687352],"category_scores_gemma":[0.00005281456,0.0002605413,0.00005754135,0.0008370311,0.0001707098,0.0002977097,0.00002535448,0.0003340095,0.0001314651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003395354,"about_ca_system_score_gemma":0.0001115242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001006599,"about_ca_topic_score_gemma":0.003851017,"domain_scores_codex":[0.9985146,0.0001458433,0.0004544598,0.0002631612,0.0002620989,0.0003598583],"domain_scores_gemma":[0.9974272,0.0001839377,0.0001104073,0.001596643,0.0005130416,0.0001688326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003805762,0.000421116,0.01568699,0.0001120833,0.0001437611,0.000001481213,0.0002473784,0.4342127,0.00008971166,0.4971522,0.005292763,0.04660174],"study_design_scores_gemma":[0.000859461,0.00008861194,0.0291025,0.0001173831,0.00003349154,0.000007692272,0.0002808128,0.9539196,0.00001493,0.00008938093,0.01513121,0.0003549232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3766361,0.0001891135,0.5483921,0.003453711,0.0008460418,0.001330792,0.0002464947,0.003718,0.06518775],"genre_scores_gemma":[0.9962599,0.00004583773,0.002974221,0.0001124652,0.00004241698,0.0001886542,0.0003177778,0.00002659523,0.00003209268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6196239,"threshold_uncertainty_score":0.9999847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05761607196773316,"score_gpt":0.2602072905555159,"score_spread":0.2025912185877827,"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."}}