{"id":"W2214007724","doi":"10.1142/s0129054115500288","title":"Shortest, Fastest, and Foremost Broadcast in Dynamic Networks","year":2015,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bounded function; Graph; Upper and lower bounds; Shortest path problem; Class (philosophy); Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.001941297,0.0002406748,0.0004542668,0.001091869,0.00007828043,0.0008018622,0.004139568,0.0001270917,0.000004855677],"category_scores_gemma":[0.00004873346,0.0002278978,0.0001182074,0.0005914255,0.0005904082,0.001330897,0.00249194,0.0006436892,0.000001526008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002801056,"about_ca_system_score_gemma":0.001810679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002972662,"about_ca_topic_score_gemma":0.00001881774,"domain_scores_codex":[0.9966613,0.00006890674,0.001164667,0.0004689773,0.001345047,0.0002910899],"domain_scores_gemma":[0.9951717,0.000231075,0.001188721,0.000511892,0.002649856,0.0002468083],"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.00003125656,0.0002333954,0.002669487,0.00001475025,0.00008712364,0.0001873555,0.0007940608,0.1730657,0.00002304152,0.01024803,0.0005425984,0.8121032],"study_design_scores_gemma":[0.000427726,0.00012231,0.003828831,0.0004120726,0.00001167653,0.0005087372,0.00001440009,0.9797185,0.000004554541,0.0145028,0.0002552405,0.0001931565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02802536,0.0004704515,0.964691,0.001023768,0.0051186,0.000136585,0.000008164252,0.00001697021,0.0005091146],"genre_scores_gemma":[0.8688583,0.000200519,0.1304564,0.0001317067,0.0003165238,0.000002108769,0.000008066044,0.000007923028,0.0000183998],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8408329,"threshold_uncertainty_score":0.9293402,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02678322750074663,"score_gpt":0.3116693806386324,"score_spread":0.2848861531378858,"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."}}