{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001408157,0.00008092957,0.0001656731,0.000190994,0.0001627221,0.00002247871,0.00009802781,0.0001049417,0.00001261646],"category_scores_gemma":[0.00002324359,0.00008617318,0.00007826512,0.0003626491,0.00003197067,0.0008997914,9.141557e-8,0.0001433293,1.685187e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006936202,"about_ca_system_score_gemma":0.00009437682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000064502,"about_ca_topic_score_gemma":0.00290519,"domain_scores_codex":[0.9987866,0.00003370842,0.0005510506,0.0001126731,0.000270606,0.0002453645],"domain_scores_gemma":[0.9991184,0.0001377512,0.0003148679,0.00004593171,0.000267584,0.0001154667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.000243976,0.000093118,0.008568954,0.000009303124,0.000009359444,0.00003238142,0.02069173,0.8134938,0.0002254122,0.001252763,0.00001143569,0.1553678],"study_design_scores_gemma":[0.005853995,0.0007307485,0.9265189,0.0003599561,0.000128857,0.000004583,0.03797949,0.0150444,0.0006452102,0.002339267,0.009880315,0.0005142419],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2177931,0.0001346379,0.781333,0.00008301019,0.0003669838,0.0001758172,0.000009314654,0.00001937219,0.00008478093],"genre_scores_gemma":[0.8679244,0.0001886115,0.1314996,0.00004201115,0.0002092855,0.000003352781,0.00008612078,0.00001224661,0.00003435372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.91795,"threshold_uncertainty_score":0.351404,"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."}}