{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007494685,0.004215213,0.005221431,0.006403642,0.003655122,0.008623208,0.007559598,0.003775085,0.01710128],"category_scores_gemma":[0.0609217,0.00215938,0.002306819,0.008331865,0.006535821,0.01725751,0.006945453,0.00921128,0.002229148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007900677,"about_ca_system_score_gemma":0.003696434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004934189,"about_ca_topic_score_gemma":0.006514344,"domain_scores_codex":[0.9957643,0.0009006697,0.0001785185,0.0007634938,0.001157475,0.001235562],"domain_scores_gemma":[0.8511752,0.1294585,0.004610464,0.00443447,0.004787659,0.005533649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002623678,0.0004853485,0.003302978,0.002149826,0.0003720215,0.0004449401,0.001975574,0.2958765,0.01036018,0.6054748,0.02541902,0.05151525],"study_design_scores_gemma":[0.0002045362,0.0001814162,0.001037692,0.0003053335,0.0003061744,0.0002501527,0.0003734973,0.3929992,0.002267148,0.5969154,0.005069127,0.00009026683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1704915,0.02048934,0.698894,0.01964602,0.001461921,0.000419668,0.003990777,0.002012421,0.08259437],"genre_scores_gemma":[0.8561839,0.02000623,0.08489785,0.003375431,0.002899073,0.001180955,0.002666066,0.001745959,0.02704458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01710128,"threshold_uncertainty_score":0.05732363,"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."}}