{"id":"W2085697310","doi":"10.1016/j.cor.2015.04.007","title":"Path based algorithms for metro network design","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Path (computing); A priori and a posteriori; Network planning and design; Set (abstract data type); Integer (computer science); Mathematical optimization; Algorithm; Integer programming; Linear programming; Population; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003764816,0.00006232578,0.00009040333,0.0001447086,0.001247375,0.0003073493,0.0002388056,0.00006866557,0.00002371804],"category_scores_gemma":[0.00034981,0.00006280357,0.00003372384,0.0007672879,0.0001360283,0.0002062022,0.000009836826,0.0001243803,0.00002608776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001210345,"about_ca_system_score_gemma":0.0009803521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005151562,"about_ca_topic_score_gemma":0.0005068909,"domain_scores_codex":[0.9981029,0.0006110672,0.0001560164,0.0002053118,0.00055152,0.00037321],"domain_scores_gemma":[0.9980673,0.0005576093,0.00001247173,0.0001370008,0.001015126,0.0002105286],"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.0000195528,0.00003312582,0.0002564502,0.000002741023,0.000006671148,0.000001491801,0.002847097,0.940649,0.000002407442,0.006847192,0.04631199,0.003022225],"study_design_scores_gemma":[0.0005028095,0.0001356519,0.0002066467,0.00001904144,0.000004926333,8.798119e-8,0.00112923,0.9637398,0.00002308318,0.0004340996,0.03370864,0.00009596054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005725153,0.00009293448,0.9951847,0.002334206,0.0003820698,0.0006761679,0.000009522406,0.00009021693,0.0006576848],"genre_scores_gemma":[0.2081833,0.00001246286,0.789624,0.0002106093,0.0006024817,0.000177624,0.000172896,0.00001426497,0.001002259],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2076108,"threshold_uncertainty_score":0.9593924,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2998911981469053,"score_gpt":0.4523902647933835,"score_spread":0.1524990666464782,"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."}}