{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003054294,0.0008561947,0.001325695,0.00189664,0.001864626,0.003208422,0.002655723,0.001619091,0.004373976],"category_scores_gemma":[0.01879836,0.0009844027,0.0006256513,0.002659052,0.001897968,0.005587725,0.001974281,0.001741226,0.0003942709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002359508,"about_ca_system_score_gemma":0.002282489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003969797,"about_ca_topic_score_gemma":0.004145592,"domain_scores_codex":[0.9984669,0.0004652761,0.0001199182,0.0002794472,0.0004140926,0.0002543612],"domain_scores_gemma":[0.9877216,0.009853768,0.0009415781,0.0004960632,0.0005822976,0.0004047291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006371259,0.0001660383,0.001737952,0.0003865797,0.00008351273,0.000142771,0.000382248,0.5099952,0.001591708,0.4130466,0.005359331,0.06647095],"study_design_scores_gemma":[0.0001246186,0.00007532707,0.0002510591,0.00004427077,0.00005291013,0.00007759757,0.0001013724,0.6692885,0.0006081539,0.3261453,0.00320619,0.00002472726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09669831,0.002590111,0.8884054,0.001838233,0.0003043463,0.0002043483,0.0004537077,0.0003740615,0.009131512],"genre_scores_gemma":[0.7386566,0.004052103,0.2357207,0.0003817958,0.0004171107,0.0007076074,0.0009649836,0.0001797867,0.01891931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004373976,"threshold_uncertainty_score":0.01711953,"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."}}