{"id":"W2033185214","doi":"10.1109/lcomm.2015.2472531","title":"Capacity Bounds for a Class of Diamond Networks With Conferencing Relays","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Upper and lower bounds; Channel capacity; Relay; Wireless network; Gaussian; Channel (broadcasting); Wireless; Backhaul (telecommunications); Telecommunications; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0006386453,0.0001444901,0.0002236802,0.0001089907,0.0003233821,0.0001180253,0.002863523,0.00005304359,0.000001196712],"category_scores_gemma":[0.00007229854,0.0001334659,0.00006273045,0.0005190423,0.0003171067,0.0003649387,0.0004222951,0.0002753458,0.000003293285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001023062,"about_ca_system_score_gemma":0.0001245204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000250403,"about_ca_topic_score_gemma":0.0002626262,"domain_scores_codex":[0.9987807,0.000283331,0.0003274901,0.0002132261,0.0001654408,0.0002298056],"domain_scores_gemma":[0.9955282,0.0005227565,0.0002211483,0.003164963,0.0004462058,0.0001166866],"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.0001623038,0.0008811039,0.0129379,0.00008249866,0.0005429046,0.000003321431,0.02630732,0.0694907,0.0284523,0.7072622,0.08349215,0.07038536],"study_design_scores_gemma":[0.001750458,0.000218103,0.001436994,0.0001677175,0.00004039759,0.00001652059,0.0001784434,0.926421,0.001565084,0.0006393641,0.06705768,0.0005081697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02832557,0.0005095804,0.953844,0.01467335,0.000151457,0.0004629949,0.000004221847,0.0001133775,0.001915517],"genre_scores_gemma":[0.876051,0.0001952631,0.1220819,0.001402395,0.00002956772,0.0001792258,0.0000135951,0.0000126567,0.00003438213],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8569304,"threshold_uncertainty_score":0.5442582,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1180353212257268,"score_gpt":0.2908637812203323,"score_spread":0.1728284599946055,"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."}}