{"id":"W4399490788","doi":"10.1007/s10623-024-01439-1","title":"External codes for multiple unicast networks via interference alignment","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Division of Mathematical Sciences; European Commission; Koninklijke Nederlandse Akademie van Wetenschappen; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Clemson University","keywords":"Unicast; Finite field; Mathematics; Context (archaeology); Upper and lower bounds; Code (set theory); Interference (communication); Field (mathematics); Interference alignment; Theoretical computer science; Discrete mathematics; Computer science; Topology (electrical circuits); Combinatorics; Telecommunications; Multicast; Computer network; Pure mathematics; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.0003829226,0.0001893729,0.0001861022,0.0001586034,0.0002858581,0.0006140369,0.0006584805,0.00005855555,0.00001356637],"category_scores_gemma":[0.00001186391,0.000163106,0.0001292995,0.000480632,0.0001075383,0.0002745208,0.0002802697,0.0001519087,0.000003429572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001774291,"about_ca_system_score_gemma":0.00002105457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005437914,"about_ca_topic_score_gemma":0.00003407563,"domain_scores_codex":[0.9988167,0.0001153332,0.0002418219,0.0004241574,0.0001156269,0.0002863419],"domain_scores_gemma":[0.9988164,0.000481897,0.00004313336,0.0004552198,0.00008360475,0.0001196954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003298797,0.00008194695,0.001112683,0.0000479701,0.0001163609,0.000009153218,0.000878932,0.0004909221,0.007193536,0.4443868,0.002018629,0.5436301],"study_design_scores_gemma":[0.0003042809,0.0002198305,0.0007180643,0.0002421223,0.00001992497,0.00001924751,0.00004160417,0.9711636,0.0009089643,0.007946768,0.0181136,0.0003020163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001698953,0.01177832,0.9851178,0.000390216,0.0002607991,0.0002866287,0.000006156969,0.0002090539,0.0002520579],"genre_scores_gemma":[0.9188469,0.004013922,0.07660241,0.0003026435,0.00007561547,0.0001115814,0.000007318365,0.00001290374,0.00002669264],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9706727,"threshold_uncertainty_score":0.6651268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04815929764473289,"score_gpt":0.2870985302757326,"score_spread":0.2389392326309997,"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."}}