{"id":"W7110184166","doi":"10.4230/lipics.disc.2025.58","title":"Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Broadcasting (networking); Node (physics); Gossip; Constant (computer programming); Radio networks; Scheme (mathematics); Asymptotically optimal algorithm; Radio broadcasting","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009866314,0.0003745716,0.0004914198,0.0004386854,0.0006199151,0.0006740373,0.002128225,0.0002010579,0.000006140763],"category_scores_gemma":[0.0001482713,0.0003904986,0.0002278355,0.0007567957,0.0001713821,0.001411452,0.0007959097,0.0004598765,0.00000700278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001719562,"about_ca_system_score_gemma":0.0001248052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000176993,"about_ca_topic_score_gemma":0.0000406951,"domain_scores_codex":[0.9972484,0.00005522423,0.001250164,0.0003544896,0.0002948449,0.0007969487],"domain_scores_gemma":[0.9974841,0.0004970464,0.0003700864,0.00123413,0.0003022359,0.0001123394],"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.0003509586,0.00133226,0.005746057,0.002041009,0.0005205366,0.00000785492,0.01481274,0.01788766,0.00003314956,0.5563284,0.008766351,0.392173],"study_design_scores_gemma":[0.002860756,0.0001445807,0.0002803518,0.0004430803,0.00002543592,0.00000987251,0.0004477066,0.8955959,0.00009894637,0.003464435,0.09623213,0.0003968129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009614021,0.0003568971,0.9852104,0.0004766436,0.0008033811,0.001483964,0.0001679912,0.0001971688,0.001689599],"genre_scores_gemma":[0.5160784,0.0002961722,0.4796969,0.001936218,0.0001237791,0.0006857457,0.0007241328,0.00004119373,0.0004174467],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8777082,"threshold_uncertainty_score":0.9998547,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01384619250655066,"score_gpt":0.2732599140368345,"score_spread":0.2594137215302839,"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."}}