{"id":"W2772756146","doi":"10.1155/2017/5656323","title":"A Gradual Approach for Multimodel Journey Planning: A Case Study in Izmir, Turkey","year":2017,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Dijkstra's algorithm; Public transport; Computer science; Router; Graph; Plan (archaeology); Transportation planning; Route planning; Operations research; Motion planning; Routing (electronic design automation); Node (physics); Transport engineering; Routing algorithm; Shortest path problem; Engineering; Robot; Artificial intelligence; Computer network; Routing protocol","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.0005382753,0.0001173238,0.0002228641,0.0002043375,0.0001969621,0.0002124534,0.0006774607,0.00002681715,3.762242e-7],"category_scores_gemma":[0.00003323918,0.0001020302,0.00008410231,0.00009220821,0.00001771214,0.002989658,0.00001196137,0.0001655433,1.779481e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002474944,"about_ca_system_score_gemma":0.00003503422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004490749,"about_ca_topic_score_gemma":0.00005345231,"domain_scores_codex":[0.9988557,0.00001834218,0.0004875893,0.0002031647,0.0002620627,0.0001731445],"domain_scores_gemma":[0.9988089,0.00003341964,0.0006318178,0.0003214731,0.0001338602,0.00007058176],"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.0006107654,0.003100325,0.04348984,0.0001734335,0.0002313105,0.01501334,0.04788138,0.7378858,0.0003546078,0.002893356,0.0002820446,0.1480839],"study_design_scores_gemma":[0.02724854,0.00255997,0.4503511,0.0002374542,0.0002026054,0.0008928344,0.02159022,0.4899835,0.0002043488,0.005225919,0.0006629115,0.0008405756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4430824,0.00002734825,0.5563138,0.00006941664,0.0002011017,0.0002719561,0.000003567772,0.00000807555,0.0000223305],"genre_scores_gemma":[0.7475924,0.000006732297,0.252287,0.00001337787,0.0000588056,0.00001310039,0.000005876881,0.00000646335,0.00001622156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4068613,"threshold_uncertainty_score":0.4160671,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06903255165066252,"score_gpt":0.3468965048434949,"score_spread":0.2778639531928324,"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."}}