{"id":"W2083125140","doi":"10.1002/atr.5670410305","title":"An algorithm for finding reasonable paths in transit networks","year":2007,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Transit (satellite); Computer science; Transit system; Algorithm; Network planning and design; Transit time; Transportation planning; Rail transit; Urban transit; Transport engineering; Test (biology); Operations research; Simulation; Public transport; Engineering; Computer network","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654834,0.00113499,0.001113686,0.003096854,0.001160016,0.001544441,0.001831151,0.001365532,0.006724801],"category_scores_gemma":[0.008714103,0.0007724153,0.001079282,0.00222529,0.0009981261,0.002458169,0.001666831,0.001399493,0.001177344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001314838,"about_ca_system_score_gemma":0.002592349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01085587,"about_ca_topic_score_gemma":0.01066313,"domain_scores_codex":[0.9989748,0.0003281374,0.0000758617,0.000284728,0.0002104516,0.0001261053],"domain_scores_gemma":[0.9959006,0.002939337,0.0002361086,0.0002367485,0.0005763189,0.0001109108],"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.0003063776,0.0001677606,0.002050053,0.0003164724,0.00007855699,0.0001426339,0.000500214,0.6126399,0.003021711,0.03407611,0.004622419,0.3420778],"study_design_scores_gemma":[0.00005967479,0.00005570195,0.0001673187,0.00002532386,0.0000161729,0.00005011386,0.00008732655,0.9750924,0.001007094,0.02157484,0.001850577,0.00001347139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01157112,0.00009139775,0.9859533,0.00007023116,0.00001027887,0.000155915,0.0001791441,0.001027176,0.0009415018],"genre_scores_gemma":[0.06206187,0.00005821904,0.9360906,0.00002577582,0.000007699515,0.0002022781,0.0005852508,0.0001468605,0.0008214136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01085587,"threshold_uncertainty_score":0.0224967,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01267880474806064,"score_gpt":0.3084149865033584,"score_spread":0.2957361817552978,"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."}}