{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001751119,0.0001787028,0.0003517854,0.0001771764,0.0004673369,0.0002440809,0.001849364,0.00004399798,0.00004193472],"category_scores_gemma":[0.0001220455,0.0001555463,0.00005058295,0.0009126103,0.004643801,0.0007472899,0.001419164,0.0001544214,0.00001946101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004680288,"about_ca_system_score_gemma":0.0001024354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.210241e-7,"about_ca_topic_score_gemma":0.000001181294,"domain_scores_codex":[0.9979783,0.0003317365,0.0003859287,0.000519643,0.000435907,0.0003484824],"domain_scores_gemma":[0.9981347,0.0004607825,0.0001397703,0.0007480534,0.0003235629,0.0001931148],"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.00005659056,0.00006337762,0.00005777586,0.000007164497,0.000004292004,0.000001292024,0.001088107,0.0006095851,0.00105449,0.8616571,0.00001651869,0.1353837],"study_design_scores_gemma":[0.001053466,0.0001474885,0.002377102,0.00006196535,0.000005253716,0.00003535005,0.000002938421,0.983963,0.003865779,0.008117934,0.0001672376,0.0002025188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09606086,0.0001100446,0.9009933,0.00151371,0.000120656,0.0002071878,0.000001020163,0.0001147557,0.0008784214],"genre_scores_gemma":[0.877619,0.00005272203,0.1219379,0.0002975144,0.00006903076,0.000005068144,9.436102e-7,0.000006238537,0.00001158656],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9833534,"threshold_uncertainty_score":0.998065,"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."}}