{"id":"W2082688210","doi":"10.1109/icc.2011.5962599","title":"Capacity Bounds and Lattice Coding for the Star Relay Network","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Linear network coding; Upper and lower bounds; Computer science; Lattice (music); Coding (social sciences); Wireless; Relay channel; Topology (electrical circuits); Computer network; Wireless network; Mathematics; Telecommunications; Combinatorics; Physics; Network packet; Statistics","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.002642902,0.0007269332,0.000834254,0.001173643,0.0005888916,0.002207829,0.00104609,0.0008200321,0.003606909],"category_scores_gemma":[0.01043572,0.0003452463,0.0005079299,0.001322494,0.002692052,0.002519643,0.002068039,0.001911931,0.0006699325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002431563,"about_ca_system_score_gemma":0.001356963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002316459,"about_ca_topic_score_gemma":0.001241711,"domain_scores_codex":[0.9983877,0.0005964507,0.00004925531,0.0001112079,0.0005497293,0.0003056348],"domain_scores_gemma":[0.9902195,0.007304624,0.0005743784,0.0005581935,0.001064906,0.0002784272],"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.0001388022,0.00003100142,0.0002470201,0.0001099228,0.00002298898,0.00009122561,0.0001900942,0.3931352,0.002868362,0.5881988,0.002659897,0.0123067],"study_design_scores_gemma":[0.00001617411,0.00002129488,0.00008458181,0.00003551733,0.000005076118,0.00004523933,0.00004100693,0.7623287,0.0009977343,0.2349763,0.001430086,0.00001841297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0889647,0.002714944,0.86528,0.001810117,0.0001002119,0.00006892878,0.0005277431,0.0003849495,0.04014853],"genre_scores_gemma":[0.9373067,0.002038686,0.05514039,0.0002843076,0.0001354402,0.0003480607,0.0004038867,0.00009212396,0.004250375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003606909,"threshold_uncertainty_score":0.01764226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1282596182923865,"score_gpt":0.2737300661559077,"score_spread":0.1454704478635211,"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."}}