{"id":"W2116643655","doi":"10.1007/s00453-010-9461-6","title":"Shortest Paths in Time-Dependent FIFO Networks","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Combinatorics; Disjoint sets; Mathematics; Interval (graph theory); Function (biology); Node (physics); Binary logarithm; Time complexity; Path (computing); Discrete mathematics; Computer science; Graph; Physics","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.00054398,0.0002098332,0.0002338552,0.00009786144,0.00007668226,0.0002035997,0.00176591,0.0002122305,0.0001787546],"category_scores_gemma":[0.00003232052,0.0002074956,0.00006882711,0.0004859621,0.00005657851,0.0003546355,0.0005629687,0.0008051642,0.0004546086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003784938,"about_ca_system_score_gemma":0.00005789101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000603362,"about_ca_topic_score_gemma":0.0001285071,"domain_scores_codex":[0.9980375,0.00006517877,0.0003336731,0.0005993051,0.0003730441,0.0005912596],"domain_scores_gemma":[0.9984188,0.0001922668,0.00007844147,0.00107604,0.00005101622,0.0001834334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009357139,0.0004361638,0.005340961,0.000004937543,0.00003231319,0.0005208196,0.0002907488,0.009265219,0.001531589,0.01084346,0.01079656,0.9609279],"study_design_scores_gemma":[0.0003487187,0.00005404359,0.003900615,0.0000144364,0.000003947756,0.0000625843,0.000002509234,0.9858742,0.0003840266,0.001588869,0.00744726,0.000318778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03297029,0.00021512,0.9534054,0.001036554,0.003168536,0.0007065245,0.000004934523,0.0006608821,0.007831722],"genre_scores_gemma":[0.9601842,0.00001865452,0.03754937,0.0005651331,0.0007369817,0.00007952256,0.000009219594,0.00003260083,0.0008243844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.976609,"threshold_uncertainty_score":0.8461425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004630311136895341,"score_gpt":0.2092553920371225,"score_spread":0.2046250809002272,"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."}}