{"id":"W2004103537","doi":"10.1016/s1874-8651(10)60014-2","title":"Path Optimization of Stochastic Transportation Network Based on Frequency-Domain Spanning Graph Model","year":2009,"lang":"en","type":"article","venue":"Systems Engineering - Theory & Practice","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Adjacency matrix; Computer science; Mathematical optimization; Probability distribution; Node (physics); Path (computing); Graph; Adjacency list; Domain (mathematical analysis); Frequency domain; Transformation (genetics); Algorithm; Mathematics; Theoretical computer science; Engineering","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009565327,0.000786606,0.00150826,0.001092382,0.0005510519,0.0009718206,0.001487799,0.001359616,0.002616374],"category_scores_gemma":[0.003044329,0.0006642545,0.001025517,0.001744807,0.0007660468,0.001647967,0.0007911236,0.0008062765,0.0001718907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001820017,"about_ca_system_score_gemma":0.001813921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01587828,"about_ca_topic_score_gemma":0.008759176,"domain_scores_codex":[0.999451,0.0002338436,0.00001558642,0.000132848,0.00008483555,0.00008194144],"domain_scores_gemma":[0.9989428,0.0006592365,0.000148375,0.00003682763,0.0001479863,0.00006471907],"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.00001103006,0.000006200969,0.000115063,0.00001573486,0.00001111458,0.00001448389,0.000008209765,0.9879971,0.0001124737,0.009761284,0.0002800997,0.001667245],"study_design_scores_gemma":[0.000001856978,0.000003437573,0.00003218063,9.719711e-7,0.0000025835,0.000003403241,0.000002442673,0.9969187,0.00001616177,0.002956411,0.00006011743,0.000001728154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05479681,0.0003854549,0.9397039,0.0004346381,0.00005537625,0.00005028394,0.0002189324,0.0001295592,0.004225101],"genre_scores_gemma":[0.8960806,0.000904833,0.09459265,0.000107697,0.00005769155,0.0001908048,0.0005467106,0.0001001606,0.007418827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01587828,"threshold_uncertainty_score":0.03157175,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008711621415275149,"score_gpt":0.2436874803986758,"score_spread":0.2349758589834006,"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."}}