{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2341,"total_is_capped":false,"direct_labels_cover":3,"predictions_cover":2341,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"f24e9ac26895","filters":{"topic":"Cooperative Communication and Network Coding"}},"results":[{"id":"W2155174176","doi":"10.1109/jsac.2010.101202","title":"Multi-Cell MIMO Cooperative Networks: A New Look at Interference","year":2010,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1826,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; MIMO; Base station; 3G MIMO; Scalability; Exploit; Multi-user MIMO; Interference (communication); Distributed computing; Coding (social sciences); Limiting; Wireless; Key (lock); Telecommunications; Computer network; Computer engineering; Beamforming; Computer security; Channel (broadcasting); Engineering","authors":[{"name":"David Gesbert","is_ca":false},{"name":"Stephen V. Hanly","is_ca":false},{"name":"Howard Huang","is_ca":false},{"name":"Shlomo Shamai","is_ca":false},{"name":"Osvaldo Simeone","is_ca":false},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05416347955178205,"gpt":0.3113857137378589,"spread":0.2572222341860769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005903066,0.0005845206,0.001059697,0.0005606806,0.0006993462,0.002260362,0.001170985,0.001682469,0.001642855],"category_scores_gemma":[0.0009108043,0.0003406431,0.0004685523,0.000837613,0.001674863,0.004334485,0.001302582,0.002287381,0.0004306965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008796863,"about_ca_system_score_gemma":0.0004121098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004583424,"about_ca_topic_score_gemma":0.0006634187,"domain_scores_codex":[0.9995831,0.0001177053,0.00001493652,0.00006193,0.0001609903,0.00006147736],"domain_scores_gemma":[0.9994226,0.000350661,0.00004094496,0.00005628258,0.0000969176,0.00003263312],"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.00004633563,0.00003275926,0.0004109318,0.0005312616,0.0000451092,0.0003890082,0.0003658504,0.02373,0.003736428,0.8954968,0.00693681,0.06827874],"study_design_scores_gemma":[0.00001517705,0.0001406428,0.0004185111,0.0003494908,0.00005393816,0.001266715,0.0005100778,0.1006185,0.001947789,0.761564,0.1330412,0.00007402986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01256815,0.2453156,0.6537238,0.01238221,0.002540181,0.00004645933,0.00009138494,0.0001896173,0.07314255],"genre_scores_gemma":[0.5214774,0.3005247,0.1350698,0.007389268,0.01077184,0.0002162589,0.0001256927,0.0001095851,0.02431543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002260362,"threshold_uncertainty_score":0.006382644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133149827","doi":"10.1109/mcom.2004.1336724","title":"Relay-based deployment concepts for wireless and mobile broadband radio","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1695,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Instituto de Telecomunicações","keywords":"HiperLAN; Computer science; Computer network; Relay; Telecommunications; Wireless; Software deployment; Wireless network; Wireless broadband; Mobile broadband; Broadband; Broadband networks; Context (archaeology); Wireless lan","authors":[{"name":"Ralf Pabst","is_ca":false},{"name":"Bernhard Walke","is_ca":false},{"name":"Daniel C. Schultz","is_ca":false},{"name":"P. Herhold","is_ca":false},{"name":"Halim Yanıkömeroğlu","is_ca":true},{"name":"Sohini Mukherjee","is_ca":false},{"name":"Harish Viswanathan","is_ca":false},{"name":"M. Lott","is_ca":false},{"name":"Wolfgang Zirwas","is_ca":false},{"name":"Mischa Döhler","is_ca":false},{"name":"Hamid Aghvami","is_ca":false},{"name":"D.D. Falconer","is_ca":true},{"name":"Gerhard Fettweis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04314384442252283,"gpt":0.3194169616991871,"spread":0.2762731172766643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656427,0.001014405,0.0004470646,0.0007679785,0.0007395662,0.001513817,0.001297716,0.001717666,0.005815106],"category_scores_gemma":[0.002560493,0.0003819344,0.0004465364,0.0009122816,0.002463572,0.003566879,0.001624931,0.001979023,0.002775668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018902,"about_ca_system_score_gemma":0.0004492636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005856077,"about_ca_topic_score_gemma":0.0007713182,"domain_scores_codex":[0.999083,0.0003891828,0.00004644151,0.0001767341,0.0002408622,0.00006378922],"domain_scores_gemma":[0.9991768,0.0003772849,0.0001136157,0.0001870368,0.0001103774,0.00003479849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001193105,0.000006874347,0.00004855516,0.0001080709,0.000007251652,0.0001220355,0.0001792989,0.003330749,0.00218782,0.963895,0.003204911,0.02689755],"study_design_scores_gemma":[0.00003283626,0.0001886399,0.0002227669,0.0001949133,0.00004644896,0.002235743,0.000271696,0.03197514,0.00508971,0.5257599,0.4339243,0.000057766],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003795384,0.01532786,0.9075268,0.002518733,0.0008314783,0.00008537775,0.00007428621,0.0004397416,0.0694002],"genre_scores_gemma":[0.3779856,0.0380998,0.5215073,0.001789654,0.001860632,0.0006227001,0.000178288,0.0002670971,0.05768883],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005815106,"threshold_uncertainty_score":0.01945353,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016312880","doi":"10.1109/iwqos.2006.250480","title":"How Practical is Network Coding?","year":2006,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1402,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science","authors":[{"name":"Mea Wang","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.104847326543095,"gpt":0.3769582704969661,"spread":0.2721109439538711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01117011,0.0009291281,0.000832401,0.0008919036,0.00155701,0.004181968,0.002922284,0.005190862,0.007954271],"category_scores_gemma":[0.0859345,0.0007162907,0.0004913526,0.001131175,0.008015076,0.01667651,0.003006765,0.00428496,0.00217998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002222837,"about_ca_system_score_gemma":0.002724081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003294477,"about_ca_topic_score_gemma":0.002079946,"domain_scores_codex":[0.988345,0.006585382,0.0003124766,0.001070484,0.002885961,0.0008006548],"domain_scores_gemma":[0.9472517,0.03605157,0.002055156,0.00940448,0.004141598,0.001095504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002581735,0.00009539601,0.002393011,0.0004491213,0.0001003931,0.0002017489,0.0005463015,0.03209536,0.001302661,0.7973518,0.02740136,0.1378045],"study_design_scores_gemma":[0.00005051173,0.0000605242,0.0002880663,0.0002228933,0.00001988533,0.0002929818,0.0004756873,0.0284889,0.001151587,0.9406681,0.02824471,0.00003619649],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02907392,0.01366624,0.7027149,0.1808232,0.003008526,0.0001510074,0.0003300908,0.001132646,0.06909952],"genre_scores_gemma":[0.7498939,0.01024956,0.2166687,0.008390275,0.002442712,0.000387436,0.0003324231,0.0005782086,0.01105681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01117011,"threshold_uncertainty_score":0.05907393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139416652","doi":"10.1109/tit.2008.926449","title":"Coding for Errors and Erasures in Random Network Coding","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1097,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Grassmannian; Decoding methods; Mathematics; Code word; Discrete mathematics; List decoding; Linear network coding; Vector space; Coding theory; Linear space; Linear code; Combinatorics; Algorithm; Concatenated error correction code; Block code; Computer science; Network packet; Pure mathematics","authors":[{"name":"R. Koetter","is_ca":false},{"name":"Frank R. Kschischang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02987853723354601,"gpt":0.2569482130286362,"spread":0.2270696757950902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001661252,0.0008739688,0.0007381784,0.001471281,0.0005391835,0.001745466,0.0009437267,0.001284145,0.004493527],"category_scores_gemma":[0.007049445,0.0003466424,0.0007320474,0.001714451,0.00209363,0.00309446,0.00185729,0.002442195,0.001187225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001563556,"about_ca_system_score_gemma":0.001059126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001827073,"about_ca_topic_score_gemma":0.00193304,"domain_scores_codex":[0.9983529,0.0007923855,0.00007577616,0.0001752835,0.0004424507,0.0001611403],"domain_scores_gemma":[0.9979328,0.001231971,0.0001561865,0.0003692134,0.0002626042,0.00004724845],"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.00001651269,0.00000380382,0.00005409436,0.00004852882,0.000006041212,0.00004618365,0.00006071665,0.0141986,0.0003956045,0.9725395,0.002535046,0.01009535],"study_design_scores_gemma":[0.00000910302,0.00001681552,0.00008477479,0.00005365169,0.000005926222,0.00007531574,0.00002874609,0.1083959,0.000559911,0.8794436,0.01131031,0.00001605212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01472275,0.008220453,0.9314009,0.003517571,0.0008792485,0.00008226664,0.0003858763,0.0003460857,0.04044484],"genre_scores_gemma":[0.6451675,0.01767828,0.2821653,0.001868574,0.002502647,0.0008462778,0.001342495,0.0004471491,0.04798176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004493527,"threshold_uncertainty_score":0.01503235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3144673228","doi":"","title":"1Improving Amplify-and-Forward Relay Networks: Optimal Power Allocation versus Selection","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":867,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Node (physics); Channel state information; Throughput; Selection (genetic algorithm); Transmission (telecommunications); Cooperative diversity; Relay channel; Channel (broadcasting); Computer network; Power (physics); Mathematical optimization; Diversity gain; Wireless; Telecommunications; Fading; Mathematics; Engineering","authors":[{"name":"Yiyi Zhao","is_ca":true},{"name":"Raviraj Adve","is_ca":true},{"name":"Teng Joon Lim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04730526437810581,"gpt":0.2853361669805998,"spread":0.238030902602494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007735061,0.0007074842,0.0004821017,0.0002514983,0.0003054005,0.0006234213,0.0005088678,0.0004952868,0.0008713992],"category_scores_gemma":[0.002348992,0.0001845696,0.0001865932,0.0004498612,0.0007277164,0.0008511559,0.0005949311,0.0002980019,0.0002005344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005198598,"about_ca_system_score_gemma":0.0004156297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006889451,"about_ca_topic_score_gemma":0.001251503,"domain_scores_codex":[0.9994448,0.0003106115,0.00001475838,0.00005404129,0.000112994,0.00006279107],"domain_scores_gemma":[0.9991912,0.0005445625,0.00007928818,0.00007256366,0.00009262473,0.00001960614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002418663,0.0001011719,0.0009653989,0.00009305446,0.00003458648,0.000234962,0.0001426724,0.8487936,0.02113215,0.06661305,0.001264887,0.06038256],"study_design_scores_gemma":[0.00001794938,0.0001182086,0.0001523928,0.000005380401,0.00001581658,0.00008243381,0.00002312417,0.97993,0.003666025,0.01537067,0.0006102279,0.000007741506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1483713,0.000894882,0.837343,0.000533564,0.00004369897,0.0000602066,0.00004760337,0.0001688881,0.01253699],"genre_scores_gemma":[0.9512615,0.0004796722,0.04635257,0.00005847041,0.00005299375,0.00004109186,0.00001608038,0.00001306544,0.001724732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008713992,"threshold_uncertainty_score":0.004090726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120448104","doi":"10.1109/tcomm.2004.836447","title":"Multihop Diversity in Wireless Relaying Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":673,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Channel (broadcasting); Computer science; Computer network; Wireless; Transmission (telecommunications); Signal-to-noise ratio (imaging); Electronic engineering; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering","authors":[{"name":"John Boyer","is_ca":true},{"name":"D.D. Falconer","is_ca":true},{"name":"Halim Yanıkömeroğlu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09475132157149174,"gpt":0.3027697721859978,"spread":0.2080184506145061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150236,0.0007720668,0.0006143326,0.0008044845,0.0005659857,0.001545116,0.0007877992,0.0009536848,0.001585382],"category_scores_gemma":[0.005750633,0.00038835,0.0005675644,0.0006602492,0.0014295,0.00205739,0.0007668688,0.001038822,0.0004291604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001421898,"about_ca_system_score_gemma":0.0007850411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001471283,"about_ca_topic_score_gemma":0.00116297,"domain_scores_codex":[0.9987512,0.0003714485,0.00003131138,0.0001088639,0.0005664132,0.0001707955],"domain_scores_gemma":[0.9953584,0.003257749,0.0003777109,0.0003352686,0.0006001044,0.00007069046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004933207,0.00002304527,0.0004246613,0.0001132215,0.00002085215,0.0002352528,0.0001564972,0.6701367,0.003709461,0.3114143,0.0007581034,0.01295852],"study_design_scores_gemma":[0.00001157542,0.00006565649,0.0002353791,0.0000284706,0.00001675505,0.0003093974,0.00005211067,0.8988132,0.001446588,0.09582879,0.003159709,0.00003224314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06564166,0.002464579,0.9155169,0.0004507199,0.000116021,0.00005198518,0.0001551816,0.0001710185,0.01543197],"genre_scores_gemma":[0.9514136,0.003271566,0.0405942,0.0001734546,0.0001869433,0.0001084242,0.00009923495,0.00004041078,0.004112225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001585382,"threshold_uncertainty_score":0.01031667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098360731","doi":"10.1109/isit.2006.262002","title":"Improving Amplify-and-Forward Relay Networks: Optimal Power Allocation versus Selection","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":603,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Relay; Computer science; Node (physics); Throughput; Selection (genetic algorithm); Transmission (telecommunications); Computer network; Power (physics); Scheme (mathematics); Relay channel; Cooperative diversity; Outage probability; Channel (broadcasting); Mathematical optimization; Wireless; Telecommunications; Fading; Engineering; Mathematics","authors":[{"name":"Yiyi Zhao","is_ca":true},{"name":"Raviraj Adve","is_ca":true},{"name":"Teng Joon Lim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01601497729465671,"gpt":0.2487335468859915,"spread":0.2327185695913348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001218552,0.001034806,0.0007480002,0.000343187,0.0003217161,0.000651506,0.0006770084,0.0006637761,0.0008328914],"category_scores_gemma":[0.003830946,0.0003016194,0.0002428903,0.0006194802,0.0007706937,0.001306822,0.0007669003,0.0003419128,0.0002342879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005110496,"about_ca_system_score_gemma":0.0004900997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007018961,"about_ca_topic_score_gemma":0.0009165796,"domain_scores_codex":[0.9992472,0.000383227,0.00002483483,0.00007765632,0.0001878164,0.00007932953],"domain_scores_gemma":[0.9987671,0.0008447551,0.0001506078,0.00009127362,0.0001216653,0.00002451041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001606614,0.00007187362,0.0008068066,0.00008295545,0.00003797303,0.0001345137,0.0001178171,0.9035061,0.01127566,0.02658764,0.0007312779,0.05648683],"study_design_scores_gemma":[0.00002739756,0.0001401663,0.0001398304,0.000005474493,0.0000267736,0.00008206953,0.00001812811,0.9856576,0.002651891,0.01068012,0.0005636913,0.000006825584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.10461,0.001279034,0.8875445,0.0004134422,0.00003702412,0.00004923222,0.00002941492,0.000217535,0.005819775],"genre_scores_gemma":[0.9069385,0.001426467,0.08967429,0.0001055495,0.0001303948,0.0000759099,0.00002661787,0.00002896643,0.001593296],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001218552,"threshold_uncertainty_score":0.006444395,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159339877","doi":"10.1109/surv.2009.090207","title":"Multiple-antenna techniques for wireless communications - a comprehensive literature survey","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":552,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; MIMO; Spatial multiplexing; Antenna diversity; Beamforming; Multi-user MIMO; Transmitter; 3G MIMO; Wireless; Telecommunications; Multiplexing; Electronic engineering; Diversity gain; Fading; Channel (broadcasting); Engineering","authors":[{"name":"Jan Mietzner","is_ca":true},{"name":"Robert Schober","is_ca":true},{"name":"Lutz Lampe","is_ca":true},{"name":"Wolfgang Gerstacker","is_ca":false},{"name":"Peter Adam Hoeher","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1232491814129798,"gpt":0.3613660418809393,"spread":0.2381168604679595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005869209,0.0008242944,0.0007452009,0.002076147,0.0003961433,0.001325377,0.0007966837,0.0009707211,0.008595793],"category_scores_gemma":[0.001434472,0.000339477,0.0004224815,0.005432426,0.0003918953,0.002409399,0.0006544951,0.001370174,0.006243238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004428396,"about_ca_system_score_gemma":0.0009289764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007574207,"about_ca_topic_score_gemma":0.0007456548,"domain_scores_codex":[0.9995577,0.00009370802,0.00004253016,0.00006093588,0.0002087676,0.0000363364],"domain_scores_gemma":[0.9991523,0.0004687036,0.00004844895,0.00005375391,0.0002450591,0.00003170075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003346898,0.00007843156,0.000426413,0.005220193,0.00003989353,0.0001378306,0.0001457951,0.002862861,0.002144131,0.03905274,0.06391147,0.8859468],"study_design_scores_gemma":[0.000005117969,0.00008383796,0.0006973194,0.001868331,0.00004004691,0.000836358,0.0001514462,0.002571353,0.0009017694,0.01910558,0.9737087,0.00003013504],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.001520741,0.928649,0.03659312,0.001388323,0.001964893,0.00004646236,0.0001601779,0.0001832515,0.02949404],"genre_scores_gemma":[0.01056153,0.9608952,0.01443495,0.0007003686,0.002036632,0.00004964231,0.0003692304,0.00006493958,0.01088756],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.008595793,"threshold_uncertainty_score":0.02875578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169948709","doi":"10.1109/lcom.2007.348292","title":"Performance Analysis of Cooperative Diversity Wireless Networks over Nakagami-m Fading Channel","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":517,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Nakagami distribution; Fading; Moment-generating function; Probability density function; Signal-to-noise ratio (imaging); Outage probability; Diversity combining; Computer science; Wireless; Channel (broadcasting); Maximal-ratio combining; Bit error rate; Probability of error; Algorithm; Statistics; Mathematics; Wireless network; Topology (electrical circuits); Telecommunications; Combinatorics","authors":[{"name":"Salama Ikki","is_ca":true},{"name":"Mohamed H. Ahmed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04499486000545759,"gpt":0.2818834896058828,"spread":0.2368886296004252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648956,0.0008996397,0.0008425624,0.000701785,0.0004860125,0.0009267299,0.0005067927,0.0008496852,0.0005770783],"category_scores_gemma":[0.009592476,0.0002700985,0.0003089707,0.0008335487,0.001182279,0.001056914,0.0008622701,0.0005022187,0.0002052381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001391813,"about_ca_system_score_gemma":0.0005725932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002281168,"about_ca_topic_score_gemma":0.001232997,"domain_scores_codex":[0.9988555,0.0004964,0.00003351024,0.000094143,0.0003580665,0.0001624912],"domain_scores_gemma":[0.9934429,0.004856151,0.0006069815,0.0003076857,0.0007078224,0.00007853458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008389246,0.00001585435,0.00131038,0.00004876186,0.00003300705,0.0001554636,0.0001198421,0.97241,0.005596424,0.01415889,0.0001453397,0.005922121],"study_design_scores_gemma":[0.000004706716,0.00006855534,0.0005282658,0.000009604466,0.00001484278,0.00009361561,0.00003347388,0.9935867,0.001694239,0.003833965,0.0001207697,0.00001139965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.590802,0.002545964,0.3973567,0.0004347806,0.00003414984,0.00003690345,0.00009561187,0.0002699542,0.00842405],"genre_scores_gemma":[0.9952062,0.0004101779,0.003807959,0.0000263052,0.00002109641,0.00001628386,0.00001737269,0.00001163023,0.0004830068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002281168,"threshold_uncertainty_score":0.01009834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134968843","doi":"10.1109/jsac.2013.131011","title":"Optimal Relay Selection for Physical-Layer Security in Cooperative Wireless Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":512,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Relay; Eavesdropping; Selection (genetic algorithm); Cooperative diversity; Wireless network; Wireless; Outage probability; Relay channel","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.04113554529995501,"gpt":0.3173365994603299,"spread":0.2762010541603749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002151043,0.0007986036,0.0007188257,0.0005095124,0.0004538675,0.001193848,0.0007339753,0.0008130206,0.0006927091],"category_scores_gemma":[0.007820124,0.0003971784,0.0005401958,0.0006680548,0.001945176,0.001706165,0.001075782,0.0007278409,0.0001824344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001233391,"about_ca_system_score_gemma":0.001200263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001093625,"about_ca_topic_score_gemma":0.0007782836,"domain_scores_codex":[0.9980323,0.0009272766,0.00007213339,0.00023997,0.0005376029,0.0001906772],"domain_scores_gemma":[0.9966641,0.002450774,0.0003377222,0.0002151006,0.0002893121,0.00004288127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001253622,0.00004495187,0.001358298,0.00018431,0.00007218317,0.0003631492,0.0004049219,0.7892784,0.01030176,0.1652325,0.0007063047,0.03192788],"study_design_scores_gemma":[0.00001201097,0.00008132032,0.0001834923,0.00001862862,0.00001927631,0.0001151414,0.00005366775,0.9627448,0.001663581,0.03443424,0.0006591075,0.00001481925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03344951,0.001346936,0.9625902,0.0002493363,0.00002408842,0.00002913207,0.00001906771,0.00008776074,0.002203921],"genre_scores_gemma":[0.9477713,0.00149197,0.04975652,0.00007981474,0.0000534941,0.00006825868,0.00001813994,0.0000180893,0.0007424912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002151043,"threshold_uncertainty_score":0.01137596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147730843","doi":"10.1109/jsac.2007.070209","title":"Joint optimization of relay strategies and resource allocations in cooperative cellular networks","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":503,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Computer network; Wireless network; Relay channel; Orthogonal frequency-division multiple access; Node (physics); Resource allocation; Bandwidth (computing); Link Access Procedure for Frame Relay; Physical layer; Wireless; Channel (broadcasting); Telecommunications; Orthogonal frequency-division multiplexing; Power (physics); Engineering","authors":[{"name":"Truman Ng","is_ca":true},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04251145398737984,"gpt":0.2898647024568767,"spread":0.2473532484694969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585634,0.001172397,0.0009872937,0.0005533179,0.0003629868,0.001205053,0.001056375,0.001200294,0.0007482411],"category_scores_gemma":[0.003630189,0.0005159634,0.0003202558,0.001060139,0.001056801,0.001103379,0.0009722568,0.0004345883,0.0002366224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001058544,"about_ca_system_score_gemma":0.0006762909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002227718,"about_ca_topic_score_gemma":0.001901104,"domain_scores_codex":[0.9989713,0.0005527483,0.0000276386,0.0001388175,0.0001535627,0.0001558034],"domain_scores_gemma":[0.9988403,0.0007459843,0.0001384614,0.00006718307,0.000153544,0.00005446668],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004397777,0.0000215303,0.0001921816,0.00002254532,0.00002443198,0.00006781388,0.00004075238,0.9799009,0.00113532,0.009286179,0.0002192554,0.009045059],"study_design_scores_gemma":[0.00001624952,0.0000434082,0.0000710186,0.000003703492,0.00001165689,0.00001946637,0.00002008244,0.9907739,0.0005171635,0.008229719,0.0002878715,0.000005774148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07674948,0.0007258967,0.9172683,0.0002474042,0.00002270757,0.00004928599,0.00005341817,0.0001283751,0.004754975],"genre_scores_gemma":[0.9685807,0.0003627595,0.02864876,0.00004466397,0.00001745452,0.00009887358,0.00003085668,0.000026189,0.002189727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002227718,"threshold_uncertainty_score":0.008385718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166246268","doi":"10.1109/twc.2008.060184","title":"Selection cooperation in multi-source cooperative networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":428,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Selection (genetic algorithm); Computer science; Relay; Simple (philosophy); Scheme (mathematics); Outage probability; Computer network; Power (physics); Distributed computing; Artificial intelligence; Channel (broadcasting); Mathematics; Fading","authors":[{"name":"Elzbieta Beres","is_ca":true},{"name":"Raviraj Adve","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06866355332286894,"gpt":0.2970925186943968,"spread":0.2284289653715278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002462244,0.0006386422,0.000700406,0.0005464309,0.0006027311,0.0008422851,0.000854583,0.0009648945,0.0004267724],"category_scores_gemma":[0.004282263,0.0002997881,0.0003557829,0.0009693538,0.001945918,0.001180883,0.001256007,0.0004852506,0.0001414758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007912283,"about_ca_system_score_gemma":0.0005108388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006889025,"about_ca_topic_score_gemma":0.0007198951,"domain_scores_codex":[0.9982461,0.001037537,0.00004347476,0.0001666819,0.0003459356,0.0001603462],"domain_scores_gemma":[0.9935074,0.004838049,0.0005137819,0.0005286296,0.0004950353,0.0001171256],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002769098,0.00006699254,0.00143828,0.0001234057,0.0000752107,0.0006749547,0.0006023203,0.8673724,0.01166601,0.09462516,0.001056023,0.02202234],"study_design_scores_gemma":[0.00003553397,0.000150402,0.0002907522,0.000009548064,0.00002423793,0.0001623529,0.00005358909,0.9624728,0.002375355,0.03367087,0.0007371185,0.00001738283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1963965,0.001031188,0.7974302,0.0003406913,0.00004299802,0.00004909976,0.00002951462,0.0002001797,0.004479604],"genre_scores_gemma":[0.9785729,0.0002979517,0.02023027,0.00005810361,0.00003463422,0.00005101073,0.00001316062,0.00001003333,0.0007320599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002462244,"threshold_uncertainty_score":0.01302171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116551454","doi":"10.1109/lcomm.2006.061048","title":"A closed-form expression for the outage probability of decode-and-forward relaying in dissimilar Rayleigh fading channels","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":332,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Rayleigh fading; Computer science; Relay; Outage probability; Expression (computer science); Transmission (telecommunications); Computer network; Wireless; Fading distribution; Closed-form expression; Telecommunications; Channel (broadcasting); Topology (electrical circuits); Mathematics; Engineering; Electrical engineering; Physics","authors":[{"name":"Norman C. Beaulieu","is_ca":true},{"name":"Jeremiah Hu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05420197605574768,"gpt":0.2942957767705044,"spread":0.2400938007147567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002504209,0.001569289,0.001219789,0.00102914,0.0005786102,0.00203298,0.001253135,0.001589727,0.005458894],"category_scores_gemma":[0.01242819,0.0004493253,0.0005055472,0.001370262,0.001689089,0.002114689,0.00115117,0.001484,0.001634941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001594037,"about_ca_system_score_gemma":0.001237985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001808544,"about_ca_topic_score_gemma":0.002493023,"domain_scores_codex":[0.9988304,0.0002822169,0.00006484096,0.000171792,0.0005124749,0.0001382522],"domain_scores_gemma":[0.9932607,0.004908661,0.0005820988,0.0002508214,0.0009243609,0.00007335922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001341469,0.00009627734,0.001192718,0.0007454417,0.00009479916,0.0007170135,0.0005534137,0.638403,0.01080301,0.2774331,0.007713872,0.06211315],"study_design_scores_gemma":[0.00002947823,0.0001106791,0.0008956087,0.000151301,0.00006374497,0.0009880464,0.0001638297,0.904797,0.003387414,0.08343144,0.005911077,0.00007050826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01374557,0.002520617,0.9703798,0.0005477319,0.0001289436,0.00008974244,0.0004347028,0.0002766599,0.01187623],"genre_scores_gemma":[0.7348889,0.009915953,0.2355333,0.000693864,0.0004914638,0.000510508,0.001275965,0.0002253158,0.01646482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005458894,"threshold_uncertainty_score":0.01826179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091131578","doi":"10.1109/twc.2012.011012.110682","title":"Max-Max Relay Selection for Relays with Buffers","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":310,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Rayleigh fading; Diversity gain; Selection (genetic algorithm); Maximal-ratio combining; Signal-to-noise ratio (imaging); Transmission (telecommunications); Computer science; Relay channel; Outage probability; Channel state information; Fading; Wireless; Telecommunications; Channel (broadcasting); Mathematics; Power (physics); Physics","authors":[{"name":"Aïssa Ikhlef","is_ca":true},{"name":"Diomidis S. Michalopoulos","is_ca":true},{"name":"Robert Schober","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05087570124702614,"gpt":0.2918621337912376,"spread":0.2409864325442115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001582951,0.001094555,0.0009680884,0.0005188209,0.0007606057,0.001181767,0.002316563,0.0005054033,0.001673846],"category_scores_gemma":[0.002590657,0.0003787417,0.0004206001,0.0004456449,0.0007713049,0.002179089,0.001275442,0.0004703081,0.0004831308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007242444,"about_ca_system_score_gemma":0.0006030116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005579181,"about_ca_topic_score_gemma":0.0007858771,"domain_scores_codex":[0.9990348,0.0004006565,0.00009412722,0.0002247725,0.0001443701,0.0001014498],"domain_scores_gemma":[0.997804,0.0009774911,0.0002904142,0.0005480928,0.0002895196,0.00009043484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003283774,0.0002220972,0.004489413,0.0006547864,0.0003590162,0.001431128,0.001148056,0.3485303,0.1388669,0.207839,0.008164888,0.2850107],"study_design_scores_gemma":[0.000173976,0.0007857533,0.0006959045,0.00005365082,0.0001909799,0.00132649,0.0001959685,0.8667676,0.07424941,0.04102809,0.01442085,0.0001112249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06415475,0.00113617,0.9306157,0.0001863121,0.0001045928,0.00009318438,0.0001207647,0.0006987049,0.002889786],"genre_scores_gemma":[0.8951709,0.000412604,0.1012849,0.0001328519,0.00007277353,0.0001191995,0.0001103602,0.0000388697,0.002657574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002316563,"threshold_uncertainty_score":0.008371532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156260722","doi":"10.1109/jsac.2007.071205","title":"R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":286,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Upload; Linear network coding; Testbed; Computer network; Server; Peer-to-peer; Multicast; BitTorrent; World Wide Web; Network packet","authors":[{"name":"Mea Wang","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03754363206759547,"gpt":0.3099601509320104,"spread":0.2724165188644149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002675953,0.0007215085,0.0006838663,0.0007853706,0.000561996,0.001014929,0.001695183,0.001278863,0.001989896],"category_scores_gemma":[0.007955136,0.000371986,0.0006274075,0.0007620121,0.001947497,0.002360233,0.00210112,0.001583806,0.0008061742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001043253,"about_ca_system_score_gemma":0.001447389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00238716,"about_ca_topic_score_gemma":0.001430645,"domain_scores_codex":[0.9984005,0.0006978584,0.00006451704,0.0002475957,0.0004834138,0.0001060661],"domain_scores_gemma":[0.997481,0.001631146,0.0001631911,0.00027683,0.0003453302,0.0001025767],"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.0002524796,0.0000743194,0.00049578,0.0002116389,0.00004231313,0.000289856,0.0002854586,0.432656,0.01123646,0.4398578,0.003464377,0.1111334],"study_design_scores_gemma":[0.00003007047,0.00006199089,0.00005030656,0.00001965573,0.000007963397,0.00008988537,0.00001880292,0.9419728,0.00351056,0.05132828,0.002887835,0.00002186438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00538592,0.0001835399,0.9912028,0.0001375439,0.00003899206,0.00008360162,0.00003113507,0.0004263988,0.002509987],"genre_scores_gemma":[0.3408868,0.0007457538,0.6486137,0.000379486,0.0001603963,0.0005847552,0.0001957756,0.0003530797,0.008080213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002675953,"threshold_uncertainty_score":0.01415193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116674255","doi":"10.1109/tcomm.2010.01.080080","title":"Performance analysis of adaptive decode-and-forward cooperative diversity networks with best-relay selection","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":274,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"","keywords":"Relay; Relay channel; Cooperative diversity; Node (physics); Computer science; Transmitter; Selection (genetic algorithm); Diversity gain; Computer network; Signal-to-noise ratio (imaging); Diversity combining; Outage probability; Channel (broadcasting); Telecommunications; Fading; Engineering; Power (physics); Artificial intelligence","authors":[{"name":"Salama Ikki","is_ca":true},{"name":"Mohamed H. Ahmed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0326593209367927,"gpt":0.2629587803049321,"spread":0.2302994593681394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002895397,0.001309647,0.001299884,0.001230181,0.0007183966,0.001484953,0.001226794,0.001148183,0.001423629],"category_scores_gemma":[0.01005551,0.0005097089,0.0005702024,0.001400079,0.001766139,0.001681203,0.001311738,0.0007485122,0.0002861218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00299907,"about_ca_system_score_gemma":0.001400576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0074073,"about_ca_topic_score_gemma":0.004100363,"domain_scores_codex":[0.9983735,0.0006046331,0.00005139185,0.0001611673,0.0005022112,0.0003069639],"domain_scores_gemma":[0.9918887,0.005628882,0.0008046033,0.0002961532,0.001253674,0.0001278695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009812728,0.00002682101,0.000852137,0.00007759021,0.00004020703,0.0001768423,0.0001355468,0.9626625,0.002835255,0.02686073,0.0004773827,0.005756935],"study_design_scores_gemma":[0.000004479276,0.00003544791,0.0002473533,0.000007682387,0.00001274894,0.00006233095,0.00002529825,0.9951336,0.0004487947,0.003902758,0.0001100465,0.000009537581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2695685,0.003579021,0.7060838,0.001006307,0.00006080938,0.00009101821,0.000346285,0.0004340402,0.01883026],"genre_scores_gemma":[0.9895335,0.001078907,0.007522737,0.00005744067,0.00003746551,0.000054564,0.00008985827,0.00002937635,0.001596041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0074073,"threshold_uncertainty_score":0.02175987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120896095","doi":"10.1109/tcomm.2006.877947","title":"Distributed space-time block coding","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":257,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Node (physics); Relay; Code (set theory); Algorithm; Topology (electrical circuits); Combinatorics; Mathematics; Set (abstract data type); Physics; Programming language","authors":[{"name":"Simon Yiu","is_ca":true},{"name":"Robert Schober","is_ca":true},{"name":"Lutz Lampe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03229868936485061,"gpt":0.2693690723793093,"spread":0.2370703830144587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006943842,0.000586561,0.0007410753,0.000673025,0.0005200204,0.001162591,0.00100849,0.0007053774,0.003210526],"category_scores_gemma":[0.002209199,0.0002121692,0.000335036,0.001301571,0.0006721036,0.00110157,0.001265344,0.001170486,0.001714766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000990239,"about_ca_system_score_gemma":0.001725946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002991781,"about_ca_topic_score_gemma":0.003699214,"domain_scores_codex":[0.9986828,0.0002995841,0.00005520327,0.0001941921,0.000591104,0.0001771044],"domain_scores_gemma":[0.9987175,0.0003661733,0.00008958705,0.0003554656,0.0004177209,0.00005348717],"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.000468435,0.0001104747,0.000676741,0.0002399266,0.00007302275,0.0002937498,0.0001375291,0.201809,0.02299418,0.4223635,0.01564589,0.3351877],"study_design_scores_gemma":[0.00006836109,0.0001250967,0.0002141427,0.00003711114,0.0000216379,0.0002649571,0.00002507823,0.8887148,0.009479794,0.0714486,0.0295694,0.00003113369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00541422,0.0009271109,0.9832825,0.0002834616,0.0003120853,0.00008335011,0.000251897,0.0004608914,0.008984466],"genre_scores_gemma":[0.5310022,0.002831963,0.4378579,0.0007090677,0.0004811594,0.0004876806,0.001880643,0.0001193963,0.0246299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003210526,"threshold_uncertainty_score":0.01074022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140882775","doi":"10.1109/twc.2007.05227","title":"Cooperative relaying in multi-antenna fixed relay networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":256,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Relay; Rayleigh fading; Maximal-ratio combining; Computer network; Wireless network; Nakagami distribution; Antenna (radio); Wireless; Directional antenna; Fading; Telecommunications; Electronic engineering; Channel (broadcasting); Engineering; Power (physics)","authors":[{"name":"Abdulkareem Adinoyi","is_ca":true},{"name":"Halim Yanıkömeroğlu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06747478000990768,"gpt":0.3164228902814734,"spread":0.2489481102715657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040381,0.0007199507,0.0007012629,0.000558534,0.0004693307,0.00114513,0.0007667851,0.001108326,0.0007397577],"category_scores_gemma":[0.002479222,0.0003816694,0.0003801507,0.0008840338,0.001007212,0.001055707,0.000519921,0.0004576993,0.0002190683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001156789,"about_ca_system_score_gemma":0.0004435608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002092564,"about_ca_topic_score_gemma":0.001878043,"domain_scores_codex":[0.9992726,0.0003418541,0.00001862007,0.0000977531,0.0001746814,0.00009458676],"domain_scores_gemma":[0.9983103,0.001183326,0.0001868347,0.0001130245,0.0001803922,0.00002605639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007022688,0.00001613322,0.0005006305,0.0001376552,0.00005092128,0.0004358084,0.0001268179,0.9134323,0.005499814,0.05957022,0.0006837739,0.01947578],"study_design_scores_gemma":[0.00001483651,0.000114192,0.0003981497,0.00002109267,0.00003190008,0.000253124,0.00005744649,0.9645191,0.001418427,0.03136741,0.001781916,0.00002239281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09157865,0.005921461,0.893848,0.0003201816,0.00007186476,0.00004367635,0.00007552336,0.0001782586,0.007962325],"genre_scores_gemma":[0.951687,0.003393252,0.0415785,0.00006883803,0.00007073678,0.00006507144,0.0000419569,0.00001859764,0.003075948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002092564,"threshold_uncertainty_score":0.008393168,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996977547","doi":"10.1109/jsac.2013.130816","title":"Buffer-Aided Relaying with Adaptive Link Selection","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":245,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Computer network; Throughput; Channel state information; Relay channel; Transmission (telecommunications); Queue; Link Access Procedure for Frame Relay; Upper and lower bounds; Schedule; Selection (genetic algorithm); Power (physics); Wireless; Telecommunications; Mathematics","authors":[{"name":"Nikola Zlatanov","is_ca":true},{"name":"Robert Schober","is_ca":true},{"name":"Petar Popovski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07297752707014883,"gpt":0.3101918647511244,"spread":0.2372143376809756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009153734,0.000779219,0.0005445329,0.000405277,0.0003087861,0.0007482315,0.001297579,0.0007010808,0.0005468209],"category_scores_gemma":[0.002548562,0.0002305973,0.0003181521,0.0004782193,0.0005561649,0.001538743,0.0006023123,0.0003578538,0.0001282847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006021547,"about_ca_system_score_gemma":0.0006901069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001298033,"about_ca_topic_score_gemma":0.001656082,"domain_scores_codex":[0.9995074,0.0001889261,0.00003078815,0.00009500689,0.0001143277,0.0000634824],"domain_scores_gemma":[0.9987704,0.0007289018,0.0001796866,0.0001353831,0.0001536013,0.00003204175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003176563,0.0001038605,0.0009740093,0.0001501703,0.00008163303,0.0005934318,0.0001845059,0.8628411,0.03200389,0.05984767,0.0005646803,0.04233749],"study_design_scores_gemma":[0.00004269715,0.0001696738,0.0001386176,0.000007366034,0.00003912234,0.0001624099,0.0000161868,0.9847426,0.005958272,0.007796398,0.0009067345,0.00001989233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1484327,0.001221332,0.8460439,0.0002564282,0.00008525817,0.0001056014,0.00006655751,0.0002958862,0.003492245],"genre_scores_gemma":[0.9405249,0.0004912639,0.05734956,0.00005411889,0.00003372055,0.0000691774,0.00003669166,0.00001104784,0.001429479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001298033,"threshold_uncertainty_score":0.00484103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2569741146","doi":"10.1109/tit.2013.2274264","title":"An Algebraic Approach to Physical-Layer Network Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":234,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Decoding methods; Algebraic number; Computer science; Theoretical computer science; Coding (social sciences); Relay; Gaussian; Lattice (music); Encoding (memory); Mathematics; Algorithm; Topology (electrical circuits); Computer network; Artificial intelligence","authors":[{"name":"Chen Feng","is_ca":true},{"name":"Danilo Silva","is_ca":false},{"name":"Frank R. Kschischang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0224123968946915,"gpt":0.2554212682628074,"spread":0.2330088713681159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009546984,0.0005648381,0.0004426546,0.0009556991,0.0007403017,0.001809633,0.001292168,0.0008553622,0.003628028],"category_scores_gemma":[0.002845229,0.0003313308,0.0006013672,0.001210062,0.002121124,0.00257363,0.001641414,0.002057318,0.0006911512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554069,"about_ca_system_score_gemma":0.001068245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006584825,"about_ca_topic_score_gemma":0.0007251639,"domain_scores_codex":[0.9992396,0.0002663276,0.00004568721,0.0001061482,0.0002611423,0.000081108],"domain_scores_gemma":[0.9989123,0.0005759476,0.0001301406,0.0001714989,0.0001708296,0.00003918846],"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.000008121618,0.00000950075,0.00004954957,0.00004622947,0.000004467757,0.00003206427,0.00004757334,0.03186923,0.001203685,0.9583476,0.0005351557,0.007846817],"study_design_scores_gemma":[0.00001187612,0.00005043432,0.00006530783,0.00004067139,0.000008572522,0.0001326767,0.00004433926,0.312588,0.001390747,0.6741616,0.01148147,0.00002428637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004762427,0.0005494506,0.9734704,0.0005098851,0.00008282648,0.00005448854,0.00008470361,0.00004699571,0.02043878],"genre_scores_gemma":[0.4499594,0.00427306,0.5309391,0.0005282282,0.0005146599,0.0005423687,0.0002081547,0.00006443967,0.01297058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003628028,"threshold_uncertainty_score":0.01213694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152076414","doi":"10.1109/lcomm.2005.1496587","title":"Outage probability at arbitrary SNR with cooperative diversity","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":221,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Independent and identically distributed random variables; Computer science; Outage probability; Signal-to-noise ratio (imaging); Cooperative diversity; Diversity combining; Wireless; Wireless network; Topology (electrical circuits); Random variable; Fading; Computer network; Algorithm; Channel (broadcasting); Telecommunications; Mathematics; Statistics; Combinatorics","authors":[{"name":"Yiyi Zhao","is_ca":true},{"name":"Raviraj Adve","is_ca":true},{"name":"Teng Joon Lim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05843134168805304,"gpt":0.2664886045503591,"spread":0.208057262862306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003977769,0.001261073,0.001574964,0.0009918478,0.000974905,0.002243401,0.001266858,0.001758897,0.001726729],"category_scores_gemma":[0.02380668,0.0007715785,0.0005357351,0.001793495,0.003505482,0.00339756,0.002417172,0.002178386,0.0005882066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002057125,"about_ca_system_score_gemma":0.001052823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001484864,"about_ca_topic_score_gemma":0.0008172305,"domain_scores_codex":[0.9962877,0.001128464,0.0001539482,0.0003717999,0.001427848,0.0006303231],"domain_scores_gemma":[0.9806947,0.01532217,0.001382735,0.001248124,0.001078307,0.0002738984],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003714708,0.00009758762,0.002530418,0.000359899,0.00006683105,0.001097663,0.0007955817,0.6756257,0.007977698,0.2724942,0.005064706,0.03351829],"study_design_scores_gemma":[0.00005027035,0.00009792366,0.001202309,0.00007600853,0.0000534193,0.000693694,0.0001557168,0.7724955,0.003951242,0.2193198,0.001842872,0.00006129402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1392628,0.0033509,0.8247712,0.002373009,0.0001527881,0.00004884641,0.0004669109,0.0008760882,0.02869734],"genre_scores_gemma":[0.983083,0.001450932,0.01252364,0.0002749077,0.0003013166,0.00006787519,0.0001555965,0.00009898195,0.002043871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003977769,"threshold_uncertainty_score":0.02103674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105628599","doi":"10.1109/vetecf.2003.1285365","title":"Relayer selection strategies in cellular networks with peer-to-peer relaying","year":2003,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Base station; Node (physics); Throughput; Bandwidth (computing); Transmitter power output; Time division multiple access; Wireless; Wireless network; Selection (genetic algorithm); Telecommunications; Engineering","authors":[{"name":"V. Sreng","is_ca":true},{"name":"Halim Yanıkömeroğlu","is_ca":true},{"name":"D.D. Falconer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02535860064811632,"gpt":0.2610248731944703,"spread":0.2356662725463539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083932,0.0007092158,0.0005339421,0.0005515129,0.0004228371,0.0005436189,0.0007452595,0.001030054,0.0004009943],"category_scores_gemma":[0.004707119,0.0002420756,0.0002576829,0.0005193892,0.001003426,0.001008841,0.0004437433,0.0002838785,0.000131494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005143966,"about_ca_system_score_gemma":0.0002414767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001741866,"about_ca_topic_score_gemma":0.001514692,"domain_scores_codex":[0.9992555,0.0004475845,0.00002213629,0.00006457956,0.0001118357,0.00009827074],"domain_scores_gemma":[0.9967273,0.002581942,0.0002816734,0.0001293569,0.0002080863,0.00007161391],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00013173,0.00007124247,0.001260417,0.00007690001,0.00004564991,0.0005009406,0.0002701545,0.9456222,0.01359399,0.01500214,0.0002688878,0.02315563],"study_design_scores_gemma":[0.00004850608,0.0003495064,0.000479011,0.000008600015,0.00004768544,0.0002229812,0.0001071263,0.9818865,0.004499201,0.01169303,0.0006367628,0.00002098855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5430412,0.001724377,0.4489312,0.0003192962,0.00002748243,0.0001224157,0.00004052014,0.0002158708,0.00557754],"genre_scores_gemma":[0.9853302,0.0003358138,0.01375322,0.00002231313,0.000009564286,0.00003756721,0.000008577837,0.000006496143,0.0004962389],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.001741866,"threshold_uncertainty_score":0.005732417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151953578","doi":"10.1109/jsac.2008.081006","title":"Grassmannian beamforming for MIMO amplify-and-forward relaying","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":204,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Beamforming; Transmitter; Codebook; MIMO; Computer science; Grassmannian; Rayleigh fading; Relay channel; Topology (electrical circuits); Channel (broadcasting); Decoding methods; Control theory (sociology); Algorithm; Mathematics; Telecommunications; Fading; Physics; Power (physics)","authors":[{"name":"Behrouz Khoshnevis","is_ca":true},{"name":"Wei Yu","is_ca":true},{"name":"Raviraj Adve","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0851291242515848,"gpt":0.3234087361271168,"spread":0.238279611875532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794596,0.000589256,0.0005682256,0.0002981579,0.0002346373,0.0007368027,0.0005693096,0.000556851,0.001572238],"category_scores_gemma":[0.002279578,0.0002165627,0.000249778,0.0006265416,0.0005838895,0.0009454681,0.0004720335,0.0004405468,0.0004480871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008200907,"about_ca_system_score_gemma":0.0008244688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00211378,"about_ca_topic_score_gemma":0.002140997,"domain_scores_codex":[0.9995446,0.0001692409,0.0000254846,0.00007269226,0.0001476263,0.00004038809],"domain_scores_gemma":[0.9992956,0.0004036585,0.00008743733,0.00005316686,0.0001309969,0.000029049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006758274,0.00002864869,0.0002894693,0.0001284126,0.00002171651,0.0001428788,0.0001153765,0.7938726,0.008915794,0.1163844,0.001756171,0.07827688],"study_design_scores_gemma":[0.000008844335,0.00004287122,0.00007872037,0.000006142913,0.000004382257,0.00003446902,0.00001928129,0.9708802,0.001254944,0.02659946,0.001060957,0.000009693937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008562463,0.0003862857,0.9890136,0.00009529017,0.00002414564,0.00002943563,0.00004567792,0.00004937524,0.001793806],"genre_scores_gemma":[0.6524839,0.002228527,0.3387182,0.0001273659,0.0001254091,0.0001974518,0.000189453,0.00004567925,0.005884096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00211378,"threshold_uncertainty_score":0.005950153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153946652","doi":"10.1109/isit.2006.261922","title":"Signaling over MIMO Multi-Base Systems: Combination of Multi-Access and Broadcast Schemes","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Base (topology); Algorithm; Artificial intelligence; Information retrieval; Topology (electrical circuits); Mathematics; Combinatorics","authors":[{"name":"Mohammad Ali Maddah-Ali","is_ca":true},{"name":"Seyed Abolfazl Motahari","is_ca":true},{"name":"Amir K. Khandani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06225531140053813,"gpt":0.3129612854689553,"spread":0.2507059740684172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329764,0.0009777183,0.0008287387,0.0005744436,0.0005738189,0.001599824,0.000841204,0.0009218748,0.001620271],"category_scores_gemma":[0.002558205,0.0004384537,0.0006570936,0.001038388,0.0008459328,0.001269675,0.0009505968,0.001120369,0.0006540501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001240905,"about_ca_system_score_gemma":0.0009211794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001327152,"about_ca_topic_score_gemma":0.002028266,"domain_scores_codex":[0.9986572,0.0004224193,0.00004864949,0.0001837807,0.0004351306,0.0002527302],"domain_scores_gemma":[0.9978466,0.001261401,0.000246392,0.0002386509,0.0003062395,0.0001007665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003421592,0.0001183823,0.001282525,0.0003871243,0.0001506093,0.0006647275,0.0002535626,0.5913634,0.0291226,0.3005885,0.003094745,0.07263166],"study_design_scores_gemma":[0.00002407549,0.0001636783,0.000327033,0.00003719544,0.00007774999,0.0002718751,0.00004783136,0.9571233,0.00421715,0.03460055,0.003074751,0.00003475514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02508342,0.001633944,0.9593316,0.0004712781,0.0001719968,0.00005293815,0.00009881249,0.0002348622,0.01292108],"genre_scores_gemma":[0.9284416,0.002802846,0.05992856,0.0002936701,0.00039602,0.0001019767,0.0001345664,0.0000356656,0.007865191],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001620271,"threshold_uncertainty_score":0.00900346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071879168","doi":"10.1155/2008/580368","title":"Performance of Multiple-Relay Cooperative Diversity Systems with Best Relay Selection over Rayleigh Fading Channels","year":2008,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Relay; Rayleigh fading; Cooperative diversity; Relay channel; Node (physics); Computer science; Fading; Computer network; Signal-to-noise ratio (imaging); Interference (communication); Diversity gain; Diversity combining; Telecommunications; Topology (electrical circuits); Channel (broadcasting); Mathematics; Power (physics); Engineering; Physics","authors":[{"name":"Salama Ikki","is_ca":true},{"name":"Mohamed H. Ahmed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0358092712235222,"gpt":0.274050797603345,"spread":0.2382415263798228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001772133,0.001474789,0.001414573,0.0006155045,0.000771887,0.001493654,0.0007980357,0.001298505,0.0009584411],"category_scores_gemma":[0.004721189,0.0003973953,0.0005108441,0.0006728997,0.001581039,0.001209469,0.001370187,0.0005639981,0.0002192066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001298259,"about_ca_system_score_gemma":0.001067774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007421467,"about_ca_topic_score_gemma":0.003060562,"domain_scores_codex":[0.9987332,0.0005043584,0.00004759055,0.0001606627,0.0002292391,0.0003249709],"domain_scores_gemma":[0.9949805,0.003195224,0.0004971738,0.0002459108,0.0008859152,0.0001952589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003337528,0.00003024936,0.001820729,0.00006404119,0.00007259531,0.0002050874,0.0001006658,0.9865632,0.004097959,0.002890506,0.0001992057,0.003621934],"study_design_scores_gemma":[0.000027154,0.0001967519,0.0007862029,0.000009235026,0.00003792761,0.00007940727,0.00005447509,0.9955309,0.001301243,0.001873189,0.00007847144,0.00002507825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8573071,0.00191722,0.130488,0.0004680757,0.00006722967,0.00004721198,0.000257698,0.0003686189,0.009078771],"genre_scores_gemma":[0.9982734,0.0001637116,0.001214996,0.00001652427,0.0000100177,0.000007778567,0.00002621444,0.000006300279,0.0002811247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007421467,"threshold_uncertainty_score":0.01475656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140787501","doi":"10.1109/tvt.2005.863426","title":"A Node-Cooperative ARQ Scheme for Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":190,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retransmission; Computer science; Jitter; Automatic repeat request; Computer network; Node (physics); Throughput; Wireless ad hoc network; Markov process; Wireless network; Wireless; Hybrid automatic repeat request; Real-time computing; Network packet; Engineering; Mathematics; Telecommunications link; Telecommunications; Statistics","authors":[{"name":"Mehrdad Dianati","is_ca":true},{"name":"Xiang Ling","is_ca":true},{"name":"Kshirasagar Naik","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0160199585887187,"gpt":0.2494040336984629,"spread":0.2333840751097442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008943029,0.0004162674,0.0003530116,0.0003138276,0.000484002,0.0002803203,0.001179453,0.0005859712,0.0006275938],"category_scores_gemma":[0.001188205,0.000165271,0.0004091343,0.0003243415,0.0003894663,0.0006862064,0.0004494971,0.0005175977,0.0002805668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002759937,"about_ca_system_score_gemma":0.000470505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008243977,"about_ca_topic_score_gemma":0.001139734,"domain_scores_codex":[0.9995599,0.0001395554,0.00001795746,0.00007231157,0.0001736816,0.00003647243],"domain_scores_gemma":[0.9993989,0.0002143232,0.00006708122,0.000129903,0.0001588272,0.00003092316],"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.0003870616,0.000384184,0.001640718,0.0004553934,0.0002349794,0.0009442362,0.000842396,0.302975,0.1926586,0.1307996,0.004209631,0.3644682],"study_design_scores_gemma":[0.00004635444,0.0005430193,0.0004845187,0.00001017638,0.00006766622,0.0006174059,0.00004319036,0.9671449,0.01295493,0.009274664,0.008765961,0.00004717979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04400446,0.001069012,0.952074,0.000136816,0.0000980382,0.0001206448,0.00002590384,0.0004385432,0.002032616],"genre_scores_gemma":[0.7948862,0.0007202009,0.2002263,0.0001598591,0.00007500665,0.0001550636,0.00005933509,0.0000236435,0.003694449],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001179453,"threshold_uncertainty_score":0.004729629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109714708","doi":"10.1109/jsac.2007.070219","title":"Joint optimization of relay-precoders and decoders with partial channel side information in cooperative networks","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Channel state information; Beamforming; Relay channel; Decoding methods; Terminal (telecommunication); Channel (broadcasting); Computer network; Transmission (telecommunications); Joint (building); Telecommunications; Wireless; Engineering","authors":[{"name":"Zhihang Yi","is_ca":true},{"name":"Il‐Min Kim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03420949191589935,"gpt":0.2779440421411942,"spread":0.2437345502252948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00202433,0.001145995,0.001127631,0.0003561644,0.0002877248,0.001056078,0.0006953358,0.001074896,0.0006692839],"category_scores_gemma":[0.00456576,0.0005642677,0.0003969538,0.0007221671,0.0009330293,0.001184976,0.001051365,0.0005086889,0.0003050236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005466033,"about_ca_system_score_gemma":0.001141498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001804781,"about_ca_topic_score_gemma":0.001958941,"domain_scores_codex":[0.9988266,0.0006520873,0.00005226007,0.000138371,0.0001934589,0.0001372283],"domain_scores_gemma":[0.998312,0.001112842,0.0001412566,0.0001731851,0.0002142431,0.00004653441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006922474,0.00001900069,0.0003177067,0.00003547844,0.00003284773,0.00005924484,0.00007392642,0.9756615,0.002319034,0.007763458,0.0002179393,0.01343067],"study_design_scores_gemma":[0.0000176049,0.00005517076,0.0001003132,0.000005514364,0.00001889289,0.00002951909,0.00001850292,0.9902887,0.002048291,0.007202724,0.0002072194,0.000007513122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07849862,0.0003990731,0.9184358,0.0001645654,0.0000130728,0.00002396801,0.00005116732,0.0001319622,0.002281817],"genre_scores_gemma":[0.9172376,0.000401806,0.07997839,0.00005078507,0.00002621549,0.0000929145,0.00006331199,0.00003003216,0.002118936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00202433,"threshold_uncertainty_score":0.01070583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124990550","doi":"10.1109/infcom.2010.5462030","title":"UUSee: Large-Scale Operational On-Demand Streaming with Random Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":183,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear network coding; Software deployment; Computer science; Coding (social sciences); Cornerstone; On demand; Telecommunications; Data science; Computer network; Multimedia; Geography","authors":[{"name":"Zimu Liu","is_ca":true},{"name":"Chuan Wu","is_ca":false},{"name":"Baochun Li","is_ca":true},{"name":"Shuqiao Zhao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01536240477324076,"gpt":0.2536347597322398,"spread":0.238272354958999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001958317,0.00056979,0.0005394621,0.0007971844,0.0006037146,0.0008859851,0.001616548,0.0005859584,0.001101402],"category_scores_gemma":[0.009593346,0.0002680854,0.0002299049,0.0009889398,0.001015336,0.00184914,0.001664262,0.001035429,0.0003179559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008450477,"about_ca_system_score_gemma":0.001026779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01050911,"about_ca_topic_score_gemma":0.009549486,"domain_scores_codex":[0.9985374,0.0004783987,0.00005361815,0.0001863015,0.000596054,0.0001482573],"domain_scores_gemma":[0.9958545,0.0020862,0.000183253,0.001064105,0.0005570317,0.0002548806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001733865,0.001086374,0.0185756,0.0003974522,0.0002172086,0.001145087,0.001393122,0.6258901,0.03774071,0.02951042,0.03498894,0.2473211],"study_design_scores_gemma":[0.000074098,0.0001625087,0.001804595,0.000009253469,0.000008834008,0.000125567,0.0001204387,0.9817965,0.007392906,0.005287027,0.003190201,0.00002808873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5345571,0.0006460123,0.4213211,0.0009252689,0.000281157,0.0008635783,0.002214901,0.02775107,0.01143989],"genre_scores_gemma":[0.9061641,0.0001535497,0.08951132,0.0001100911,0.00005374371,0.0001999895,0.002043933,0.0003661731,0.001397064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01050911,"threshold_uncertainty_score":0.02089584,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104780755","doi":"10.1109/infcom.2007.130","title":"Lava: A Reality Check of Network Coding in Peer-to-Peer Live Streaming","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Live streaming; Computer science; Peer-to-peer; Coding (social sciences); Lava; Video streaming; Linear network coding; Virtual reality; Computer network; Reality check; Human–computer interaction; Geology","authors":[{"name":"Miao Wang","is_ca":true},{"name":"Binbin Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05732286662263603,"gpt":0.3277477094876921,"spread":0.270424842865056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005366795,0.0004522286,0.0005069255,0.0005461869,0.001042957,0.001412953,0.001825483,0.001358366,0.002009167],"category_scores_gemma":[0.02158626,0.0003015148,0.0003764304,0.0003538435,0.002668166,0.002743147,0.002527311,0.002070919,0.0004348095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001169858,"about_ca_system_score_gemma":0.001726897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002716556,"about_ca_topic_score_gemma":0.001669585,"domain_scores_codex":[0.9961506,0.001678137,0.0001281419,0.000348107,0.001439735,0.0002553002],"domain_scores_gemma":[0.9897552,0.005892308,0.0005110792,0.001905692,0.001569126,0.0003664976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009521529,0.0004088758,0.002523245,0.000315278,0.00006458996,0.00048319,0.0009662653,0.4418074,0.05783149,0.3527752,0.005593792,0.1362786],"study_design_scores_gemma":[0.00005942044,0.0002620298,0.0001730419,0.00003695729,0.00001063276,0.0001011342,0.00008215065,0.9265544,0.02704391,0.04065181,0.004992262,0.00003222805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08267403,0.0004816516,0.9020985,0.001512204,0.0001641298,0.0001860427,0.00009759126,0.003177066,0.009608696],"genre_scores_gemma":[0.7388748,0.0002271267,0.2576083,0.0003760382,0.00004536801,0.0001918159,0.000120251,0.0002554531,0.002300953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005366795,"threshold_uncertainty_score":0.02838272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145630771","doi":"10.1109/tit.2007.904983","title":"Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Bilayer; Relay; Code (set theory); Channel (broadcasting); Channel capacity; Decoding methods","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02026939436584421,"gpt":0.2708845776144249,"spread":0.2506151832485807,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004764929,0.0003607307,0.0003100836,0.0004002963,0.0003012679,0.0004991457,0.0003993694,0.0004425502,0.0009910582],"category_scores_gemma":[0.002100914,0.0001588767,0.0002340581,0.0004330509,0.0005288228,0.0006675231,0.0006108051,0.0005988277,0.0003579429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005538968,"about_ca_system_score_gemma":0.0007024127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006864079,"about_ca_topic_score_gemma":0.0006931346,"domain_scores_codex":[0.9996705,0.00009888646,0.00001674381,0.00003202411,0.0001544035,0.00002740123],"domain_scores_gemma":[0.9994697,0.0002155396,0.00006270108,0.0001150524,0.0001175957,0.00001946249],"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.0001926582,0.00006066034,0.0006199253,0.0002330375,0.00002514887,0.0001856383,0.000198739,0.2911456,0.05757544,0.5457008,0.001346883,0.1027155],"study_design_scores_gemma":[0.00001816499,0.00007908655,0.0001071616,0.00002245658,0.00001156934,0.0001208237,0.00001566557,0.9306507,0.02150827,0.04322939,0.004215405,0.00002127246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02976765,0.0003148349,0.9664026,0.0001336899,0.00003544035,0.00005078905,0.00006123281,0.0001975304,0.003036049],"genre_scores_gemma":[0.5619239,0.0007343241,0.434965,0.00008189958,0.00002802095,0.000137358,0.0001151397,0.00004905554,0.001965402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009910582,"threshold_uncertainty_score":0.004018784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128555802","doi":"10.1109/tit.2009.2032817","title":"On Metrics for Error Correction in Network Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":169,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Error detection and correction; Subspace topology; Computer science; Algorithm; Constant-weight code; Metric (unit); Coding (social sciences); Variable-length code; Theoretical computer science; Decoding methods; Topology (electrical circuits); Linear code; Mathematics; Block code; Computer network; Artificial intelligence; Statistics","authors":[{"name":"Danilo Silva","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02773562526010384,"gpt":0.2775726853735803,"spread":0.2498370601134765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068773,0.002948845,0.001585996,0.0046102,0.001493093,0.00367198,0.002297366,0.003059837,0.003107969],"category_scores_gemma":[0.03170494,0.0005415786,0.001107169,0.004529339,0.006356724,0.009380047,0.005299162,0.00505221,0.001062365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004517328,"about_ca_system_score_gemma":0.001616384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002303312,"about_ca_topic_score_gemma":0.0008786698,"domain_scores_codex":[0.9925672,0.003617013,0.0004226741,0.0008593306,0.002080952,0.0004528929],"domain_scores_gemma":[0.9773453,0.01509345,0.001784271,0.00214715,0.002965859,0.0006639868],"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.000027521,0.000009567743,0.0001594905,0.00008111118,0.00001587757,0.00003743605,0.0001034688,0.03961077,0.0005285803,0.9431928,0.001313375,0.01491995],"study_design_scores_gemma":[0.000006602794,0.00006875081,0.0001364921,0.00008401911,0.00001115296,0.00007852248,0.00004071968,0.1355433,0.0007846802,0.856435,0.006774958,0.0000358593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009786433,0.006016463,0.9629537,0.001392048,0.0003268282,0.00008513058,0.0002416229,0.0001892018,0.01900842],"genre_scores_gemma":[0.5658817,0.01846983,0.3891892,0.001380926,0.002181491,0.0008876274,0.001257942,0.0007776365,0.01997358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0068773,"threshold_uncertainty_score":0.03637111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2799292918","doi":"10.1109/tmc.2018.2831679","title":"Multipath Cooperative Routing with Efficient Acknowledgement for LEO Satellite Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":165,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer network; Computer science; Multipath routing; Dynamic Source Routing; Acknowledgement; Routing protocol; Distributed computing; Network packet; Linear network coding; Static routing; Retransmission; Multipath propagation; Channel (broadcasting)","authors":[{"name":"Feilong Tang","is_ca":false},{"name":"Heteng Zhang","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02644118996341843,"gpt":0.2862196929497967,"spread":0.2597785029863782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008941154,0.0004205514,0.000298293,0.0006172115,0.0005398052,0.0004876191,0.0007422458,0.0003898598,0.0005128187],"category_scores_gemma":[0.002445097,0.0002008725,0.0002488664,0.0007014615,0.0005544022,0.001070989,0.0007856367,0.0005014273,0.000110849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008903582,"about_ca_system_score_gemma":0.001175776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003175602,"about_ca_topic_score_gemma":0.004346381,"domain_scores_codex":[0.999539,0.0001319886,0.00002009426,0.00005132913,0.0001959777,0.00006149224],"domain_scores_gemma":[0.9988025,0.0005209023,0.0002161551,0.0001665151,0.0002549123,0.00003899073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001746729,0.00006810074,0.001518702,0.0002280323,0.00005589588,0.0003383301,0.000367407,0.7333055,0.04888187,0.05758123,0.002668513,0.1548118],"study_design_scores_gemma":[0.000009451618,0.0001056534,0.0002624777,0.00001115629,0.00002278501,0.000119441,0.00004878753,0.9812438,0.005929669,0.009453299,0.002770488,0.00002304977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07342722,0.001624153,0.9204314,0.0003908939,0.00006244244,0.00007104027,0.00003439308,0.0005932391,0.003365287],"genre_scores_gemma":[0.921277,0.0008532453,0.07594434,0.00006795713,0.00004524323,0.00009433438,0.00004483133,0.0000278614,0.001645016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003175602,"threshold_uncertainty_score":0.006460011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963415238","doi":"10.1109/tcomm.2018.2869596","title":"Mixed-ADC/DAC Multipair Massive MIMO Relaying Systems: Performance Analysis and Power Optimization","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Beijing Municipal Science and Technology Commission; Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; Southeast University; National Natural Science Foundation of China","keywords":"Converters; Effective number of bits; Electronic engineering; MIMO; Computer science; Quantization (signal processing); Bandwidth (computing); Power (physics); Engineering; Electrical engineering; Voltage; Algorithm; Beamforming; CMOS; Telecommunications","authors":[{"name":"Jiayi Zhang","is_ca":false},{"name":"Linglong Dai","is_ca":false},{"name":"Ziyan He","is_ca":false},{"name":"Bo Ai","is_ca":false},{"name":"Octavia A. Dobre","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04484471352069685,"gpt":0.2755894887356007,"spread":0.2307447752149039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009152688,0.001243819,0.0007178652,0.0003507287,0.0003235124,0.001387173,0.0007497508,0.0007994868,0.002081669],"category_scores_gemma":[0.002135823,0.0004060831,0.0003513649,0.0007933253,0.0007159918,0.001367877,0.0008635811,0.0006755624,0.0005374144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000915639,"about_ca_system_score_gemma":0.0005110579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008615322,"about_ca_topic_score_gemma":0.001231325,"domain_scores_codex":[0.999305,0.0002870481,0.00002526393,0.00009155474,0.0002069516,0.00008418176],"domain_scores_gemma":[0.9990602,0.0005341658,0.0001161282,0.0001043983,0.0001593314,0.00002580487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001132287,0.00006307646,0.0005095965,0.0002021271,0.00005212533,0.0002410821,0.00009277407,0.8699102,0.01799943,0.07375927,0.00113427,0.03592286],"study_design_scores_gemma":[0.000004577464,0.00005577482,0.0001101716,0.000008480213,0.00001051053,0.00008065492,0.00001686418,0.990869,0.002081452,0.006247059,0.0005067001,0.000008768416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0559642,0.002285645,0.9263895,0.0004867644,0.0000428525,0.00005787551,0.00008841692,0.0001707282,0.01451392],"genre_scores_gemma":[0.9196488,0.00180321,0.07429601,0.0001106405,0.00007881114,0.00007803692,0.00006867059,0.0000378158,0.003877948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002081669,"threshold_uncertainty_score":0.006963849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151544711","doi":"10.1109/twc.2009.080818","title":"On the ergodic capacity of multi-hop wireless relaying systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Ergodic theory; Computer science; Hop (telecommunications); Upper and lower bounds; Rayleigh fading; Fading; Topology (electrical circuits); Wireless; Channel capacity; Transmission (telecommunications); Ergodicity; Telecommunications; Channel (broadcasting); Mathematics; Mathematical analysis; Statistics; Combinatorics","authors":[{"name":"Golnaz Farhadi","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0814055833073757,"gpt":0.2917448779703903,"spread":0.2103392946630146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632634,0.0007639126,0.0008016442,0.001031956,0.0005086399,0.001352093,0.0007737782,0.0006014417,0.002063286],"category_scores_gemma":[0.008618709,0.0002953443,0.0003592485,0.001232639,0.001825954,0.001749253,0.001047285,0.0009643731,0.0004095727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001493331,"about_ca_system_score_gemma":0.0008460185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002541766,"about_ca_topic_score_gemma":0.001186901,"domain_scores_codex":[0.9990618,0.000292597,0.00003592957,0.00007689597,0.0003171155,0.0002155772],"domain_scores_gemma":[0.9925263,0.00597278,0.0003810172,0.0003578824,0.0006640163,0.00009809806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005664052,0.00001776373,0.0004310297,0.0001315832,0.00003146803,0.0002209776,0.0001517972,0.7998152,0.003149366,0.1786091,0.001109016,0.01627592],"study_design_scores_gemma":[0.000004315089,0.00001852658,0.0002627237,0.0000332875,0.00001120959,0.00008301833,0.00003497848,0.9434884,0.001216526,0.05406465,0.000762463,0.00001990187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1383091,0.005258574,0.8274521,0.0007250627,0.0001398848,0.00003823554,0.0002693617,0.0003081604,0.02749957],"genre_scores_gemma":[0.9860194,0.002596288,0.008970904,0.00006214814,0.0001248677,0.00005563528,0.0001217049,0.00004183717,0.002007292],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002541766,"threshold_uncertainty_score":0.01083493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142383973","doi":"10.1109/twc.2009.080485","title":"Power allocation in wireless multi-user relay networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":157,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Computer science; Relay; Quality of service; Mathematical optimization; Power control; Transmitter power output; Heuristic; Optimization problem; Computer network; Resource allocation; Geometric programming; Wireless; Wireless network; Throughput; Power (physics); Channel allocation schemes; Channel (broadcasting); Telecommunications; Algorithm; Mathematics","authors":[{"name":"Khoa T. Phan","is_ca":true},{"name":"Tho Le‐Ngoc","is_ca":true},{"name":"Sergiy A. Vorobyov","is_ca":true},{"name":"Chintha Tellambura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03759268491733248,"gpt":0.293027843904858,"spread":0.2554351589875256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461887,0.001113251,0.001148949,0.0005990001,0.0004912969,0.001448939,0.001226259,0.001603106,0.001254414],"category_scores_gemma":[0.003387841,0.0005726587,0.0005018957,0.001286404,0.00147488,0.00213941,0.001086817,0.0008266317,0.0003899929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074442,"about_ca_system_score_gemma":0.0005697368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00121858,"about_ca_topic_score_gemma":0.0009740434,"domain_scores_codex":[0.9983455,0.001032145,0.00004139895,0.0002067099,0.0002472022,0.0001270213],"domain_scores_gemma":[0.9990197,0.0006864134,0.0001074751,0.00006733993,0.00008833376,0.00003075124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005019136,0.00001933443,0.0001814493,0.00007210029,0.00002458337,0.0001598172,0.00006727007,0.9340943,0.00127836,0.04468265,0.0005414987,0.0188285],"study_design_scores_gemma":[0.00001283133,0.0000281076,0.00003980821,0.000004842016,0.000007138008,0.00004497347,0.00001920301,0.9759653,0.0003441775,0.02272021,0.0008059894,0.000007410952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01542684,0.001741579,0.9790094,0.0002941029,0.00004911354,0.00003775079,0.00002589687,0.0001431264,0.003272093],"genre_scores_gemma":[0.8444763,0.002404619,0.148416,0.0001489162,0.0001541552,0.0001911768,0.0000466907,0.0000850968,0.004077122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001603106,"threshold_uncertainty_score":0.007795691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139727241","doi":"10.1109/ciss.2006.286622","title":"On Selection Cooperation in Distributed Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Selection (genetic algorithm); Relay; Computer science; Constraint (computer-aided design); Maximal-ratio combining; Block (permutation group theory); Outage probability; Power (physics); Scheme (mathematics); Diversity (politics); Wireless network; Wireless; Selection algorithm; Computer network; Distributed computing; Telecommunications; Fading; Mathematics; Artificial intelligence; Political science","authors":[{"name":"Elzbieta Beres","is_ca":true},{"name":"Raviraj Adve","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01478986450220563,"gpt":0.2458056913089561,"spread":0.2310158268067505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00328463,0.0009518298,0.001038061,0.0009233258,0.001193986,0.001846619,0.001419542,0.002062343,0.002509627],"category_scores_gemma":[0.009967906,0.0004094915,0.0005224576,0.001623506,0.003247859,0.003814708,0.003072656,0.002180585,0.0007213634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001256728,"about_ca_system_score_gemma":0.0005485793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005825171,"about_ca_topic_score_gemma":0.0004291058,"domain_scores_codex":[0.9976676,0.001234279,0.00007560999,0.0002425952,0.0005512983,0.0002285721],"domain_scores_gemma":[0.9926092,0.005699852,0.0003758203,0.0005842316,0.0005592422,0.0001716956],"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.00004953075,0.00001937665,0.000215024,0.00009336053,0.00002028342,0.0002146769,0.0002221167,0.06666776,0.00102505,0.9169713,0.003410644,0.01109082],"study_design_scores_gemma":[0.00004802538,0.00007653223,0.0001448661,0.00006237414,0.00002062416,0.000199858,0.00005366014,0.1943076,0.0004828273,0.7902809,0.01430186,0.00002087983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02450849,0.005602525,0.9164264,0.005887011,0.0006002174,0.00009590226,0.00008389221,0.0001139279,0.04668163],"genre_scores_gemma":[0.8640775,0.01420115,0.09994837,0.002270346,0.002678802,0.0008021634,0.0001677113,0.0001273471,0.01572654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00328463,"threshold_uncertainty_score":0.017371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168435726","doi":"10.1109/tvt.2009.2014685","title":"Cooperative Diversity for Intervehicular Communication: Performance Analysis and Optimization","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":152,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Nakagami distribution; Fading; Cooperative diversity; Rayleigh fading; Relay; Computer science; Antenna diversity; Channel (broadcasting); Broadcasting (networking); Base station; Wireless; Diversity scheme; Computer network; Telecommunications; Power (physics)","authors":[{"name":"Hacı İlhan","is_ca":false},{"name":"Murat Uysal","is_ca":true},{"name":"İbrahim Altunbaş","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01947587009554669,"gpt":0.2522520498328435,"spread":0.2327761797372968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001560034,0.001263886,0.0008267286,0.0008549466,0.0004366872,0.001494079,0.0008711951,0.00126359,0.002211484],"category_scores_gemma":[0.003743638,0.000398989,0.0005070669,0.001917089,0.001189079,0.001026781,0.001036539,0.0007357695,0.0006602191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001969011,"about_ca_system_score_gemma":0.0009787327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003636614,"about_ca_topic_score_gemma":0.002589635,"domain_scores_codex":[0.9989522,0.0004656321,0.00001866841,0.00009977789,0.0003031758,0.0001605685],"domain_scores_gemma":[0.9972184,0.001877179,0.0003254949,0.0001296501,0.0003880509,0.00006128696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005969066,0.00003688213,0.0003654713,0.00007081204,0.00004281623,0.00007959737,0.00006342509,0.9562879,0.002033293,0.02397803,0.001223833,0.01575838],"study_design_scores_gemma":[0.000005576443,0.00003887014,0.0002093159,0.000009218619,0.000008000694,0.00003748146,0.00002445176,0.9874591,0.0005903301,0.01111305,0.000495573,0.000009036693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08529621,0.004476807,0.8834525,0.0009496342,0.00005399447,0.00008712873,0.0002352339,0.0002090533,0.0252394],"genre_scores_gemma":[0.9584947,0.003027841,0.03152591,0.0001194108,0.0001114353,0.0001360156,0.0001733574,0.00006521614,0.006346325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003636614,"threshold_uncertainty_score":0.01428622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2741791149","doi":"10.1109/mnet.2017.1600280","title":"UAV-Assisted Dynamic Coverage in a Heterogeneous Cellular System","year":2017,"lang":"en","type":"article","venue":"IEEE Network","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Macrocell; Backhaul (telecommunications); Computer science; Cellular network; Computer network; Base station; Software deployment; Reuse; Frequency reuse; Relay; Resource allocation; The Internet; Operating system","authors":[{"name":"Yue Li","is_ca":true},{"name":"Lin Cai","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03019094368816328,"gpt":0.2696145879682965,"spread":0.2394236442801332,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000147665,0.0002854248,0.0002870669,0.000210452,0.0002955032,0.0003449268,0.000391592,0.0003850695,0.0002664761],"category_scores_gemma":[0.0003984857,0.0001127056,0.0001708425,0.0002669628,0.000323728,0.0003435079,0.0005131344,0.0001796122,0.0000859463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004144502,"about_ca_system_score_gemma":0.0001765225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004666232,"about_ca_topic_score_gemma":0.003373727,"domain_scores_codex":[0.9998453,0.00004344842,0.000004472605,0.00002870029,0.0000330822,0.00004486615],"domain_scores_gemma":[0.9998275,0.0000591388,0.00002970061,0.00002876352,0.00003146456,0.0000234505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002445227,0.00003767103,0.002847817,0.0000437477,0.00005695522,0.001650434,0.0001264593,0.8965632,0.05268924,0.008453032,0.0009583634,0.0363285],"study_design_scores_gemma":[0.000005868377,0.00006221834,0.0005241096,0.000001938506,0.00001054425,0.0001413919,0.00002762431,0.9959309,0.002156543,0.0007764075,0.0003563869,0.000005975361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5635018,0.0007908876,0.4280522,0.0002175882,0.00005310315,0.00002878741,0.00008273173,0.0002743747,0.006998495],"genre_scores_gemma":[0.9954802,0.00007057052,0.003976611,0.00001251114,0.000006281812,0.000003967641,0.00001158321,0.000002327114,0.0004359587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004666232,"threshold_uncertainty_score":0.009278178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095699525","doi":"10.1109/twc.2008.061041","title":"Diversity order analysis of the decode-and-forward cooperative networks with relay selection","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":148,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Upper and lower bounds; Selection (genetic algorithm); Cooperative diversity; Maximal-ratio combining; Overhead (engineering); Computer science; Bounded function; Diversity combining; Bit error rate; Order (exchange); Telecommunications; Mathematics; Algorithm; Mathematical optimization; Decoding methods; Power (physics); Fading; Artificial intelligence","authors":[{"name":"Zhihang Yi","is_ca":true},{"name":"Il‐Min Kim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03450173950108613,"gpt":0.2570138841348498,"spread":0.2225121446337636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001605499,0.0006880492,0.0007469353,0.001176753,0.0006526622,0.000926621,0.0006392983,0.0006180454,0.001551038],"category_scores_gemma":[0.006917756,0.0003862361,0.000363877,0.0008062995,0.001247564,0.001360905,0.000873557,0.0009919329,0.0004137699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001890397,"about_ca_system_score_gemma":0.00146501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003339712,"about_ca_topic_score_gemma":0.002092286,"domain_scores_codex":[0.9989993,0.0002538027,0.00003224963,0.00008012453,0.0004567965,0.0001777093],"domain_scores_gemma":[0.9941021,0.00371943,0.0004954702,0.0002847793,0.001206149,0.0001921104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002880647,0.00007095263,0.002600864,0.0001865307,0.00004567127,0.000405059,0.0004685288,0.686061,0.01723749,0.2729939,0.001691378,0.01795056],"study_design_scores_gemma":[0.00001904388,0.00008157258,0.0008353477,0.00002494508,0.00001568136,0.0001897055,0.00007094945,0.9391016,0.003068704,0.05576585,0.0007930144,0.00003345096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2809814,0.002249674,0.6818089,0.0009202116,0.00006740666,0.0001005153,0.0003659174,0.0001980778,0.03330789],"genre_scores_gemma":[0.9753339,0.001281916,0.01872905,0.0001267703,0.00007554029,0.0001006411,0.0001568532,0.00003864838,0.004156654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003339712,"threshold_uncertainty_score":0.0137158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166757187","doi":"10.1109/tcomm.2010.092810.090322","title":"On the Performance of Cooperative-Diversity Networks with the Nth Best-Relay Selection Scheme","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":147,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"","keywords":"Relay; Rayleigh fading; Expression (computer science); Cooperative diversity; Moment-generating function; Diversity combining; Signal-to-noise ratio (imaging); Node (physics); Maximal-ratio combining; Selection (genetic algorithm); Closed-form expression; Probability density function; Topology (electrical circuits); Computer science; Function (biology); Mathematics; Algorithm; Fading; Telecommunications; Statistics; Combinatorics; Channel (broadcasting); Engineering; Physics; Artificial intelligence; Power (physics)","authors":[{"name":"Salama Ikki","is_ca":true},{"name":"Mohamed H. Ahmed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03464705107615206,"gpt":0.2561856685289257,"spread":0.2215386174527736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546987,0.00158406,0.001056425,0.0009305842,0.0008076505,0.001221024,0.001165994,0.001440244,0.001290926],"category_scores_gemma":[0.01026314,0.0003889354,0.000568276,0.001110228,0.002205185,0.001671251,0.00153424,0.0007095825,0.00034876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002290196,"about_ca_system_score_gemma":0.001261202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00918331,"about_ca_topic_score_gemma":0.006476909,"domain_scores_codex":[0.9984755,0.0006540699,0.00003377561,0.0001540775,0.0003241243,0.0003584271],"domain_scores_gemma":[0.9935985,0.004305086,0.0005169502,0.0003451607,0.001087622,0.0001468278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001503614,0.00002947668,0.0008239985,0.00005756599,0.00003625133,0.0001610552,0.0001114201,0.975121,0.002056813,0.01689127,0.0004614236,0.00409941],"study_design_scores_gemma":[0.00001087118,0.00007621261,0.0003912376,0.00001753754,0.00002037552,0.00008549461,0.00005817263,0.9931369,0.0007180792,0.005287186,0.0001783886,0.00001967927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6725565,0.005825968,0.2797035,0.00161167,0.0002010245,0.00007830286,0.0004414248,0.0003694078,0.03921224],"genre_scores_gemma":[0.9949461,0.0006897634,0.003025822,0.00005946342,0.00004583034,0.00001951013,0.00006125336,0.00001786852,0.00113442],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00918331,"threshold_uncertainty_score":0.0182597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169103030","doi":"10.1109/twc.2011.120810.100873","title":"Outage Probability and Optimum Power Allocation for Analog Network Coding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":147,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Upper and lower bounds; Relay; Computer science; Multiplexing; Outage probability; Signal-to-noise ratio (imaging); Computer network; Channel (broadcasting); Topology (electrical circuits); Fading; Power (physics); Mathematics; Telecommunications; Network packet","authors":[{"name":"Zhihang Yi","is_ca":true},{"name":"MinChul Ju","is_ca":true},{"name":"Il‐Min Kim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04429452299002599,"gpt":0.2930583529425485,"spread":0.2487638299525224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002727057,0.001036218,0.001173485,0.0009050795,0.0006272027,0.001354112,0.0009108165,0.0009115822,0.002415447],"category_scores_gemma":[0.01500269,0.0004820507,0.000378727,0.001470254,0.002486925,0.001767184,0.001380936,0.001128883,0.0002709386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002226894,"about_ca_system_score_gemma":0.0009857655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001702383,"about_ca_topic_score_gemma":0.001142208,"domain_scores_codex":[0.9980108,0.0008968281,0.00006948988,0.0001889468,0.0005195152,0.0003144067],"domain_scores_gemma":[0.9874803,0.01051732,0.0008803514,0.0003071894,0.0006581447,0.000156642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001018815,0.00003584002,0.0005276891,0.0001284352,0.00003061814,0.0001938177,0.0001654417,0.8291913,0.002583347,0.1564452,0.001065104,0.009531244],"study_design_scores_gemma":[0.00001702707,0.00002669915,0.0002292971,0.00002001888,0.00001302217,0.00007632009,0.00003539411,0.9395737,0.0006432532,0.05895455,0.0003959506,0.00001468308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09046292,0.001627213,0.8907765,0.0007933499,0.00006386949,0.00005236694,0.0001740241,0.0001560869,0.01589369],"genre_scores_gemma":[0.9743258,0.001328187,0.02127285,0.0001170465,0.0001173569,0.0001123022,0.00008962017,0.00006621361,0.002570711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002727057,"threshold_uncertainty_score":0.01615727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117554110","doi":"10.1109/icnp.2008.4697020","title":"CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Conference on Network Protocols","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Linear network coding; Unicast; Wireless mesh network; Network packet; Routing protocol; Wireless network; Hazy Sighted Link State Routing Protocol; Wireless Routing Protocol; Dynamic Source Routing; Distributed computing; Scheduling (production processes); Wireless; Telecommunications","authors":[{"name":"Yunfeng Lin","is_ca":true},{"name":"Baochun Li","is_ca":true},{"name":"Ben Liang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08976932936101299,"gpt":0.3162120079074109,"spread":0.2264426785463979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934644,0.0003855764,0.0003757157,0.0006601401,0.0006086674,0.0005427017,0.0009916268,0.0004139703,0.0007816881],"category_scores_gemma":[0.002762995,0.0001833185,0.0002217589,0.0006059914,0.0007174665,0.001063009,0.001273248,0.0004223697,0.0001554763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006680797,"about_ca_system_score_gemma":0.001082525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00274487,"about_ca_topic_score_gemma":0.003980485,"domain_scores_codex":[0.9995735,0.0001389048,0.00001851972,0.00004048869,0.0001462836,0.00008223481],"domain_scores_gemma":[0.9989229,0.0005032049,0.0001447827,0.0001657654,0.0001979839,0.00006530672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007874815,0.000155582,0.001664893,0.0002660789,0.0001122755,0.0005486289,0.000407759,0.5247293,0.07069879,0.1117545,0.009365882,0.2795088],"study_design_scores_gemma":[0.00003871557,0.0001435847,0.0002283096,0.00001716953,0.00001822702,0.0001672979,0.00004339964,0.968228,0.008492636,0.01750299,0.005100186,0.00001952982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06901205,0.0005738616,0.9241226,0.0003227846,0.00009876656,0.0001867954,0.0001233522,0.00101692,0.004542809],"genre_scores_gemma":[0.8434294,0.000401509,0.1527034,0.0001678383,0.00005404999,0.0002942286,0.0002015628,0.00008478244,0.002663232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00274487,"threshold_uncertainty_score":0.005457759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053784592","doi":"10.1109/twc.2007.360364","title":"Rateless Coding for Wireless Relay Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Relay; Fountain code; Computer science; Computer network; Wireless; Coding (social sciences); Relay channel; Decoding methods; Online codes; Channel state information; Telecommunications; Block code; Concatenated error correction code; Mathematics","authors":[{"name":"Jeff Castura","is_ca":true},{"name":"Yongyi Mao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06604303079732751,"gpt":0.3179111441387598,"spread":0.2518681133414322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001266843,0.0007021429,0.0005452891,0.0004858586,0.0003658131,0.0009354772,0.001280763,0.0008533599,0.001015842],"category_scores_gemma":[0.004398415,0.000262501,0.0004665182,0.0005631657,0.001289833,0.001667112,0.0009649166,0.001471727,0.0004573229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008317469,"about_ca_system_score_gemma":0.0008311452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001340923,"about_ca_topic_score_gemma":0.0008702297,"domain_scores_codex":[0.9989717,0.000384278,0.00003821476,0.00008894608,0.0004109069,0.0001060108],"domain_scores_gemma":[0.9981152,0.0009309201,0.000184852,0.0003816203,0.0003431686,0.00004429607],"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.00006852264,0.00002534214,0.0001266413,0.00008582592,0.00001705188,0.0001563205,0.000113453,0.2806246,0.008669941,0.6801003,0.001459913,0.02855209],"study_design_scores_gemma":[0.00002705388,0.00005524901,0.00005302301,0.00002680331,0.00001193528,0.0001312147,0.00000964992,0.8192614,0.003412019,0.172401,0.004581374,0.00002927625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00544077,0.0003874642,0.9913031,0.0001616114,0.00005221931,0.00002648005,0.000045462,0.0001180277,0.002464833],"genre_scores_gemma":[0.5869287,0.00201706,0.4038692,0.000400745,0.0002802884,0.0003635965,0.0002297842,0.0001276856,0.005782912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001340923,"threshold_uncertainty_score":0.006699741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965556172","doi":"10.1109/icc.2010.5502758","title":"On Minimizing Broadcast Completion Delay for Instantly Decodable Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Greedy algorithm; Selection (genetic algorithm); Network packet; Computational complexity theory; Coding (social sciences); Selection algorithm; Algorithm; Mathematical optimization; Wireless network; Frame (networking); Wireless; Mathematics; Computer network; Artificial intelligence","authors":[{"name":"Sameh Sorour","is_ca":true},{"name":"Shahrokh Valaee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04145693096827495,"gpt":0.290546781536613,"spread":0.249089850568338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002117332,0.0008924727,0.0009391369,0.0004816888,0.0004326071,0.0006646345,0.0008720323,0.0007262681,0.001005735],"category_scores_gemma":[0.00615119,0.0002806479,0.0002578862,0.0008246774,0.001295954,0.001303869,0.0008105422,0.0008189717,0.0001614506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001750967,"about_ca_system_score_gemma":0.002294985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002946045,"about_ca_topic_score_gemma":0.0024496,"domain_scores_codex":[0.999131,0.0003765527,0.00002371714,0.0001478388,0.0002058688,0.0001151179],"domain_scores_gemma":[0.9964924,0.00271765,0.0002517386,0.000174593,0.0002605317,0.0001030282],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001093585,0.00004361666,0.0001669496,0.00005765196,0.00001595392,0.00002506783,0.00004663036,0.9522397,0.00319522,0.02816398,0.0006448089,0.01529109],"study_design_scores_gemma":[0.00001888357,0.00005650117,0.00007124689,0.000004423105,0.000004554917,0.00001154432,0.00001296064,0.9886286,0.001080074,0.009883231,0.0002223729,0.000005490267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04250204,0.0003258493,0.9553478,0.0002369065,0.00002751207,0.00004908435,0.000044261,0.0001167056,0.001349817],"genre_scores_gemma":[0.8395554,0.0006997238,0.1565513,0.0001097277,0.00007982181,0.0002166215,0.0001320728,0.0001029342,0.002552398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002946045,"threshold_uncertainty_score":0.01270419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104878965","doi":"10.1109/tcomm.2010.082010.090256","title":"Error Performance Analysis of BPSK Modulation in Physical-Layer Network-Coded Bidirectional Relay Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Relay channel; Phase-shift keying; Rayleigh fading; Linear network coding; Bit error rate; Computer science; Algorithm; Topology (electrical circuits); Fading; Node (physics); Mathematics; Decoding methods; Computer network; Network packet; Engineering; Physics; Combinatorics","authors":[{"name":"MinChul Ju","is_ca":true},{"name":"Il‐Min Kim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04881039997255162,"gpt":0.3068714708438505,"spread":0.2580610708712989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003764457,0.00115487,0.0008744173,0.000951542,0.000478552,0.00106384,0.0008534372,0.001036159,0.001219017],"category_scores_gemma":[0.01826544,0.0003231212,0.0003114907,0.0008000912,0.001598777,0.001486813,0.001494159,0.000761701,0.0002655296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001885878,"about_ca_system_score_gemma":0.001157166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004405621,"about_ca_topic_score_gemma":0.002284325,"domain_scores_codex":[0.9981267,0.0006590806,0.00005846992,0.0001324036,0.0007355377,0.0002878238],"domain_scores_gemma":[0.9863695,0.01019931,0.0008915639,0.0004796734,0.001936515,0.0001234585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001768498,0.00003193728,0.001044833,0.00008076368,0.00002996647,0.0001135,0.0001108982,0.9642258,0.00431221,0.02166999,0.0002502638,0.00795292],"study_design_scores_gemma":[0.0000038949,0.0000331911,0.0001630271,0.000009477737,0.000007407834,0.00003011249,0.00001798535,0.9959928,0.001043317,0.00261574,0.00007393729,0.000009006821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3980714,0.00264473,0.5856724,0.0006562244,0.00007299118,0.00006542075,0.0001618068,0.0003555388,0.01229956],"genre_scores_gemma":[0.9885958,0.0005987118,0.009423058,0.00004156302,0.00001973672,0.00003745,0.00004697703,0.0000443884,0.001192406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004405621,"threshold_uncertainty_score":0.01990855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981093646","doi":"10.1109/lsp.2010.2096466","title":"Joint Relay Selection and Power Allocation for Two-Way Relay Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Ontario Tech University","funders":"","keywords":"Relay; Maximization; Transceiver; Selection (genetic algorithm); Computer science; Transmitter power output; Relay channel; Signal-to-noise ratio (imaging); Power (physics); Channel (broadcasting); Mathematical optimization; Joint (building); Control theory (sociology); Mathematics; Topology (electrical circuits); Telecommunications; Wireless; Transmitter; Engineering","authors":[{"name":"Saurabh Talwar","is_ca":true},{"name":"Yindi Jing","is_ca":true},{"name":"Shahram Shahbazpanahi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02201918150435418,"gpt":0.2610998891457004,"spread":0.2390807076413463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001644709,0.001110534,0.001130712,0.0004331888,0.0003710319,0.0008469251,0.00101043,0.0008780923,0.0009451336],"category_scores_gemma":[0.003041922,0.0004117458,0.0003714778,0.0007617351,0.001124843,0.001450203,0.001351412,0.0005523486,0.0002915312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005592824,"about_ca_system_score_gemma":0.0003869274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003991248,"about_ca_topic_score_gemma":0.0005019224,"domain_scores_codex":[0.9983383,0.000943603,0.00005657316,0.0001835994,0.0003067637,0.0001711354],"domain_scores_gemma":[0.9986634,0.0008824597,0.0001468057,0.0001469838,0.0001088239,0.0000514731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003288054,0.0001016853,0.0005766158,0.0001560914,0.00008408485,0.0002771041,0.000207374,0.8793172,0.01617948,0.03177423,0.0008986093,0.07009869],"study_design_scores_gemma":[0.00004917801,0.0001313741,0.0001389699,0.000005833956,0.00001701489,0.000109135,0.00002416084,0.9848655,0.003074098,0.01081039,0.0007562024,0.00001806589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03515134,0.0006179604,0.9624481,0.0001226377,0.00002629821,0.00004614996,0.00002077792,0.0001341747,0.001432607],"genre_scores_gemma":[0.8804116,0.0003839306,0.1172666,0.00005814426,0.00004261933,0.0001001083,0.00002818158,0.00002654135,0.001682433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001644709,"threshold_uncertainty_score":0.008698165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102659255","doi":"10.1109/jsac.2008.081009","title":"Distributed beamforming in wireless relay networks with quantized feedback","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Beamforming; Upper and lower bounds; Synchronization (alternating current); Asynchronous communication; Bit error rate; Signal-to-noise ratio (imaging); Diversity gain; Wireless; Wireless network; Control theory (sociology); Diversity combining; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics; Decoding methods; Fading; MIMO; Channel (broadcasting)","authors":[{"name":"Erdem Koyuncu","is_ca":false},{"name":"Yindi Jing","is_ca":true},{"name":"Hamid Jafarkhani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04857823550778225,"gpt":0.2865930646353924,"spread":0.2380148291276101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009923276,0.0008266821,0.0006733647,0.0003498367,0.0002898232,0.0007818271,0.0006230892,0.0006402038,0.0009223225],"category_scores_gemma":[0.002653562,0.0003490789,0.0002433393,0.0008667946,0.001082822,0.001589581,0.0006366895,0.0005892141,0.0002995315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006550798,"about_ca_system_score_gemma":0.000366523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000769774,"about_ca_topic_score_gemma":0.000767276,"domain_scores_codex":[0.9991737,0.0004113567,0.0000358019,0.00009813721,0.0002241239,0.00005672806],"domain_scores_gemma":[0.9988503,0.0008278587,0.0001003284,0.0000739471,0.0001310378,0.00001653737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001099071,0.00004856992,0.0003611261,0.0002635929,0.00003185797,0.0001298725,0.0001372219,0.8105792,0.01660223,0.09263104,0.001258275,0.07784709],"study_design_scores_gemma":[0.000020273,0.0001430593,0.0001071837,0.00002554549,0.00001309415,0.00007017399,0.00002720117,0.9597268,0.002556713,0.0358913,0.001397396,0.00002128186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01196859,0.001465963,0.9844726,0.0001558955,0.00004832938,0.00002220176,0.00002286012,0.0000907963,0.001752749],"genre_scores_gemma":[0.7767073,0.007454888,0.2106262,0.0002148678,0.0002829758,0.0002041768,0.00006584326,0.00005618349,0.004387624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009923276,"threshold_uncertainty_score":0.00524801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992756898","doi":"10.1109/mwc.2012.6189408","title":"Cooperation in wireless communication networks","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless network; Throughput; Wireless; Reliability (semiconductor); Scarcity; Protocol stack; Telecommunications; Distributed computing; Wireless sensor network","authors":[{"name":"Weihua Zhuang","is_ca":true},{"name":"Muhammad Ismail","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05245409162886313,"gpt":0.3028787834895706,"spread":0.2504246918607075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001988144,0.0007466645,0.0007932383,0.0007704452,0.001469403,0.002384153,0.001012073,0.002596645,0.002262475],"category_scores_gemma":[0.004393719,0.0002977469,0.000361928,0.001415483,0.003238836,0.00274202,0.002361592,0.002110356,0.0007520345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001070168,"about_ca_system_score_gemma":0.001022787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008241769,"about_ca_topic_score_gemma":0.0006284165,"domain_scores_codex":[0.9975139,0.001298496,0.00009263474,0.0002816665,0.0006349021,0.0001784281],"domain_scores_gemma":[0.9975769,0.001612284,0.0001883843,0.0002416053,0.000280181,0.0001006679],"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.00001375254,0.00001541149,0.0002256109,0.0002377694,0.0000231936,0.0001956015,0.0003157882,0.01210309,0.0008149643,0.9436184,0.005468,0.03696842],"study_design_scores_gemma":[0.00002024361,0.00007723432,0.0002545549,0.0001768459,0.00002363966,0.0005097325,0.0001584993,0.03221448,0.0005429803,0.8888515,0.0771367,0.0000335326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0206456,0.109226,0.6623145,0.01290051,0.00319786,0.0002302538,0.0001552827,0.000267826,0.1910621],"genre_scores_gemma":[0.8050058,0.07238967,0.08315619,0.002756923,0.003760653,0.0007276196,0.0002016938,0.00007526813,0.03192609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002596645,"threshold_uncertainty_score":0.01051444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157661883","doi":"10.1109/twc.2008.070393","title":"Cooperative diversity over log-normal fading channels: performance analysis and optimization","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rician fading; Computer science; Fading; Pairwise error probability; MIMO; Nakagami distribution; Rayleigh fading; Cooperative diversity; Relay; Channel (broadcasting); Upper and lower bounds; Throughput; Diversity combining; Wireless; Algorithm; Computer network; Telecommunications; Power (physics); Mathematics","authors":[{"name":"Majid Safari","is_ca":true},{"name":"Murat Uysal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04874418566896094,"gpt":0.2632591302108401,"spread":0.2145149445418791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002402181,0.001430057,0.001088492,0.000873823,0.0004398742,0.001804919,0.000987552,0.001194327,0.00126112],"category_scores_gemma":[0.007955053,0.0004735814,0.0004396518,0.001953532,0.001862426,0.00163004,0.001217354,0.0008654555,0.0004041645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00179123,"about_ca_system_score_gemma":0.001331702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002894644,"about_ca_topic_score_gemma":0.001996076,"domain_scores_codex":[0.9984208,0.0006605136,0.00003985565,0.0001532719,0.000485425,0.0002401021],"domain_scores_gemma":[0.9945858,0.003983221,0.000472513,0.0002522186,0.000612953,0.00009327393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004731011,0.00003680406,0.000394056,0.0000598345,0.00001980838,0.00006943824,0.00006296195,0.9630246,0.001346906,0.0246586,0.0003758413,0.009903767],"study_design_scores_gemma":[0.000006538831,0.00003550454,0.0001526097,0.000009085291,0.000006957005,0.0000497186,0.00002857417,0.9838015,0.0004320407,0.01526447,0.000203889,0.000009068835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09203095,0.002185761,0.8905963,0.0006804337,0.00002985383,0.00006897869,0.0001633421,0.0001934112,0.0140509],"genre_scores_gemma":[0.9576402,0.002501373,0.03603246,0.00009481184,0.00008361411,0.0001459711,0.0001188055,0.00004517286,0.003337679],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002894644,"threshold_uncertainty_score":0.01299632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136379375","doi":"10.1109/lcomm.2006.1638618","title":"Impact of receive diversity on the performance of amplify-and-forward relaying under APS and IPS power constraints","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Terminal (telecommunication); Power (physics); Diversity gain; Mode (computer interface); Diversity combining; Scaling; Telecommunications; Topology (electrical circuits); Mathematics; Fading; Physics; Decoding methods; Combinatorics","authors":[{"name":"H. Mheidat","is_ca":true},{"name":"Murat Uysal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04540599425230116,"gpt":0.2777678915224783,"spread":0.2323618972701772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002984039,0.00123123,0.001150766,0.0003682158,0.0004776842,0.001345034,0.0005648798,0.001107902,0.00112076],"category_scores_gemma":[0.01686954,0.0003146629,0.0003445684,0.0004782817,0.001495093,0.001729194,0.001378058,0.0008722769,0.0002641066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006495186,"about_ca_system_score_gemma":0.0007046913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006861816,"about_ca_topic_score_gemma":0.0005596651,"domain_scores_codex":[0.9969952,0.001381575,0.00008747656,0.0002384704,0.0008487694,0.0004486031],"domain_scores_gemma":[0.9810244,0.01548857,0.001305398,0.0007650355,0.001209253,0.0002074255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006920856,0.00007483581,0.00351126,0.0001561744,0.00009455986,0.0006770031,0.0002108438,0.9253189,0.03412564,0.01770253,0.0002714121,0.01716473],"study_design_scores_gemma":[0.00007061511,0.0006622549,0.00245406,0.00003257212,0.00008404855,0.000678016,0.0001782457,0.9579591,0.02791269,0.009547904,0.0003749015,0.00004564344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.815355,0.001132753,0.1631501,0.0006860187,0.00003853154,0.00003327123,0.000179314,0.0002300083,0.019195],"genre_scores_gemma":[0.9967334,0.0002516593,0.002496519,0.00004432765,0.00002596274,0.00001175774,0.00002432284,0.00001400381,0.0003979252],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002984039,"threshold_uncertainty_score":0.01578128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}