{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001223402,0.000503143,0.0006687588,0.0009439533,0.000813448,0.00132513,0.001096428,0.001059968,0.001160793],"category_scores_gemma":[0.008861914,0.0004379794,0.0004487866,0.00101464,0.001634831,0.002563938,0.0009675163,0.001198082,0.0002194847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001486027,"about_ca_system_score_gemma":0.0009038898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003060013,"about_ca_topic_score_gemma":0.002029633,"domain_scores_codex":[0.9993384,0.0002052438,0.00002459497,0.0001605341,0.0001636398,0.0001075781],"domain_scores_gemma":[0.9960511,0.00299589,0.0004216405,0.0001860779,0.0002117202,0.0001335912],"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.000235727,0.0000746801,0.001372817,0.0005483525,0.00002665868,0.0002150852,0.000419655,0.5276824,0.005927392,0.4050515,0.004577931,0.05386772],"study_design_scores_gemma":[0.0000202655,0.00006412686,0.0003494001,0.00003775821,0.00001961779,0.0001018764,0.0001433018,0.7697405,0.001219125,0.2248181,0.003466989,0.00001894338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1588266,0.005050896,0.8133048,0.001487302,0.0001662433,0.0001185541,0.0002145596,0.0005663029,0.02026472],"genre_scores_gemma":[0.8868368,0.004475886,0.1027601,0.0002252073,0.0002332607,0.000210418,0.0002883761,0.0001786534,0.004791294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003060013,"threshold_uncertainty_score":0.010782,"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."}}