{"id":"W1988189387","doi":"10.1145/1645373.1645374","title":"Shortest paths in time-dependent FIFO networks using edge load forecasts","year":2009,"lang":"en","type":"article","venue":"","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Time complexity; Node (physics); Polynomial; Function (biology); FIFO (computing and electronics); Enhanced Data Rates for GSM Evolution; Algorithm; Computer science; Arrival time; Binary logarithm; Mathematics; FIFO and LIFO accounting; Combinatorics; Discrete mathematics; Telecommunications","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.0001331102,0.0001122111,0.0001068898,0.00009084768,0.00001850572,0.00003461178,0.0001152539,0.00007418065,0.00006949327],"category_scores_gemma":[0.00000347076,0.0001139301,0.000030971,0.0001366486,0.000006410849,0.0001229052,0.00002260444,0.0001206686,0.00002361201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001268336,"about_ca_system_score_gemma":0.000005313379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001270409,"about_ca_topic_score_gemma":0.00004093374,"domain_scores_codex":[0.9993562,0.000007509459,0.0001682737,0.0001227519,0.0001308857,0.0002144106],"domain_scores_gemma":[0.9997815,0.00000761126,0.00001019337,0.0001423285,0.00001082939,0.00004747029],"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.00001021896,0.0001197007,0.0008675611,0.00001321666,0.00002423286,0.00005830832,0.00008769978,0.6202827,0.001197324,0.001019282,0.06497294,0.3113468],"study_design_scores_gemma":[0.0001738131,0.00002526451,0.002079664,0.00002780643,0.000006220116,0.000004685852,0.000008026491,0.9947143,0.0003279979,0.00006648558,0.002426396,0.0001393935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04699443,0.000222654,0.8749495,0.00005543299,0.0002983484,0.0003632293,0.000001815774,0.007794186,0.06932047],"genre_scores_gemma":[0.9977442,0.00007236044,0.00172216,0.0001489532,0.00006730196,0.000005504365,0.000004185036,0.00001446231,0.0002208911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9507498,"threshold_uncertainty_score":0.4645935,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009732687004920844,"score_gpt":0.2114367933383054,"score_spread":0.2017041063333846,"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."}}