{"id":"W1973843421","doi":"10.1016/j.tcs.2004.04.017","title":"Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Upper and lower bounds; Computer science; Constant (computer programming); Network topology; Time complexity; Randomized algorithm; Matching (statistics); Node (physics); Algorithm; Mathematics; Discrete mathematics; Combinatorics; Theoretical computer science; Topology (electrical circuits); Computer network","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.004873024,0.0005177956,0.001216952,0.001235628,0.0008832694,0.003589509,0.001921301,0.001744784,0.005679753],"category_scores_gemma":[0.03663193,0.0005189001,0.001039251,0.001405937,0.002581313,0.008569326,0.001845589,0.002770374,0.000465894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003192811,"about_ca_system_score_gemma":0.002948935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001665359,"about_ca_topic_score_gemma":0.001327257,"domain_scores_codex":[0.9955924,0.001944104,0.0001775047,0.0005666885,0.0009909195,0.0007283259],"domain_scores_gemma":[0.9186491,0.07003151,0.002897031,0.005228751,0.001926105,0.001267471],"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.001456648,0.0001466786,0.00225464,0.0003567741,0.0001283434,0.0001251295,0.0004675073,0.2295749,0.005011651,0.7151117,0.007629392,0.03773666],"study_design_scores_gemma":[0.0001263807,0.0001033553,0.0009027998,0.00002735158,0.0000601158,0.0001160782,0.0000883742,0.3927218,0.001864568,0.6026644,0.001289563,0.00003510874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4736305,0.003047033,0.4630956,0.01626271,0.0003712404,0.0001875574,0.001363625,0.0008207747,0.04122096],"genre_scores_gemma":[0.9775095,0.0007464444,0.01570756,0.0003890242,0.0003779769,0.0001184452,0.0002798685,0.0001759846,0.004695115],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005679753,"threshold_uncertainty_score":0.02577132,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02896538927366809,"score_gpt":0.2665988582973958,"score_spread":0.2376334690237277,"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."}}