{"id":"W4416573669","doi":"10.1016/j.dam.2025.11.013","title":"Bounds on broadcast time in well-connected graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Upper and lower bounds; Vertex (graph theory); Graph; Connectivity; Binary logarithm; Time complexity","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.0002950013,0.0002461603,0.0003705159,0.0002442237,0.0001092976,0.0001771658,0.0007488474,0.0001371215,0.0000596731],"category_scores_gemma":[0.000007802951,0.0002186936,0.00007782382,0.0008084607,0.00007328899,0.00008833603,0.0002136895,0.0002874506,0.0003674268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004059961,"about_ca_system_score_gemma":0.00008413812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004010991,"about_ca_topic_score_gemma":0.000002235483,"domain_scores_codex":[0.9984303,0.000019541,0.0004567483,0.0004196998,0.000274112,0.000399596],"domain_scores_gemma":[0.9986472,0.000295702,0.0001179585,0.0008196793,0.00002998625,0.00008946297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001490063,0.0001556161,0.00001281943,0.0000624921,0.0000265554,0.00002332775,0.000527429,0.0000602706,0.0002716637,0.9795017,0.005009083,0.01433413],"study_design_scores_gemma":[0.0007998431,0.00004572929,0.00004845001,0.0001854297,0.00002086374,0.000005766081,0.0001248249,0.6411487,0.000347658,0.3544004,0.002511161,0.0003611324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007581284,0.00003770438,0.6566249,0.0003849512,0.00016038,0.0003568961,0.000004023823,0.0002180894,0.3346318],"genre_scores_gemma":[0.9458848,0.00002435191,0.04996996,0.00115076,0.00003451008,0.0000743411,0.00002528779,0.00002545175,0.002810516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9383035,"threshold_uncertainty_score":0.8918066,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007889908169945536,"score_gpt":0.230629129295252,"score_spread":0.2227392211253065,"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."}}