{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002009194,0.0001641572,0.0002218555,0.0001601964,0.0002269088,0.00005309996,0.0001315571,0.0001364575,0.00000969476],"category_scores_gemma":[0.0004546702,0.0001814661,0.00006546052,0.0005335711,0.00003371076,0.000522105,6.482103e-7,0.0001781308,0.00000177105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006778221,"about_ca_system_score_gemma":0.0001332844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001180179,"about_ca_topic_score_gemma":0.000005980157,"domain_scores_codex":[0.9983431,0.000268421,0.0004202395,0.0002284619,0.0004649931,0.0002747999],"domain_scores_gemma":[0.9986016,0.0005931961,0.0003305464,0.0001783818,0.0002042163,0.00009210224],"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.00007904552,0.00003750087,0.00002387104,0.00002731576,0.00001387838,0.00000328435,0.003552211,0.7788195,0.00005139264,0.2173373,0.00001356655,0.00004111434],"study_design_scores_gemma":[0.0003348621,0.00009644313,0.0002860268,0.0003599585,0.00008495321,6.680744e-7,0.00160627,0.9948264,0.000003956984,0.002111736,0.00006324373,0.0002254913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002251832,0.0001875507,0.9939895,0.0001683501,0.0003635414,0.0003555288,0.00001720022,0.0002443402,0.002422113],"genre_scores_gemma":[0.8796167,0.00001189201,0.119994,0.0000817149,0.0001255435,0.00001883975,0.00008975971,0.00002253513,0.00003894295],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8773649,"threshold_uncertainty_score":0.7399974,"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."}}