{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002907849,0.0009740043,0.000830284,0.001007571,0.001278737,0.002227795,0.001668507,0.002118103,0.006522784],"category_scores_gemma":[0.01653756,0.0007892441,0.001045002,0.002019167,0.002152338,0.006543696,0.001415642,0.004659168,0.002582955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00240298,"about_ca_system_score_gemma":0.001118037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001164731,"about_ca_topic_score_gemma":0.0007789287,"domain_scores_codex":[0.9982156,0.0006936538,0.000111431,0.0003124707,0.0004531982,0.0002138566],"domain_scores_gemma":[0.9924855,0.005157071,0.0004373629,0.0007636354,0.0008514859,0.0003049115],"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.0005245754,0.0001171905,0.0006845956,0.0008384582,0.00004931895,0.0001273627,0.0004902154,0.0330978,0.01081198,0.7204035,0.05363193,0.1792231],"study_design_scores_gemma":[0.0001764325,0.0007962822,0.0007286789,0.0002169397,0.000131487,0.0004905086,0.0001834585,0.1971993,0.01198425,0.5689197,0.2189797,0.0001931715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01509368,0.0063282,0.9471774,0.01004398,0.004529304,0.0001671609,0.0002895668,0.001050364,0.01532034],"genre_scores_gemma":[0.311401,0.01578916,0.6232144,0.003672689,0.0110185,0.0007130589,0.001146782,0.0008924455,0.03215183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006522784,"threshold_uncertainty_score":0.02182084,"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."}}