{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006365591,0.0002827144,0.0003023423,0.0003398028,0.001015334,0.0004398938,0.005441857,0.0001494597,0.0001144228],"category_scores_gemma":[0.0003275959,0.0002621402,0.00009061964,0.001723441,0.0001649986,0.0005594423,0.000979519,0.002806224,0.0001257441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002532188,"about_ca_system_score_gemma":0.0005065497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001698098,"about_ca_topic_score_gemma":0.003815892,"domain_scores_codex":[0.9974983,0.000820138,0.0006642885,0.0003456424,0.0002372274,0.0004344315],"domain_scores_gemma":[0.994781,0.0009121278,0.0003331001,0.002892175,0.0007441876,0.0003374266],"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.0004954519,0.01214208,0.02757867,0.00002799015,0.0005309355,0.0001396887,0.02799222,0.05962831,0.2868033,0.08930136,0.1558326,0.3395273],"study_design_scores_gemma":[0.002835904,0.0003110479,0.009107274,0.0002955502,0.00001750104,0.0003033365,0.00007750175,0.9428027,0.003614388,0.0002821788,0.03957909,0.0007735798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0738818,0.004355798,0.8919126,0.01537952,0.002128967,0.0009280902,0.00000646506,0.0004568173,0.01094992],"genre_scores_gemma":[0.9381525,0.00499432,0.05422215,0.0009877525,0.0001385208,0.00003201727,0.00001069813,0.00002311518,0.001438917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8831744,"threshold_uncertainty_score":0.9999831,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003641982,0.0001658466,0.0002013369,0.0001038941,0.0006074901,0.0001612429,0.002044806,0.00005749949,0.000005990887],"category_scores_gemma":[0.00003417113,0.0001684953,0.00006485511,0.0004000151,0.0002449498,0.0002844172,0.0004429966,0.0001955138,0.00003146408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001113549,"about_ca_system_score_gemma":0.0001427042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005749097,"about_ca_topic_score_gemma":0.00009715929,"domain_scores_codex":[0.9988834,0.0001519077,0.0003158276,0.0002929733,0.000128093,0.0002278578],"domain_scores_gemma":[0.9962978,0.0004013921,0.0001215577,0.002830267,0.0002332866,0.000115667],"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.00008580327,0.002060017,0.0007728585,0.0001268138,0.0001937818,0.000005358288,0.007217977,0.0168696,0.05934399,0.4938113,0.01700289,0.4025097],"study_design_scores_gemma":[0.007843613,0.0006294093,0.002030379,0.0002935377,0.00005538529,0.00003572354,0.00007510473,0.3442823,0.01247802,0.003230191,0.6280324,0.001013946],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03674991,0.00710733,0.9410717,0.01166417,0.0002993539,0.001382246,0.00001444034,0.0004150038,0.001295779],"genre_scores_gemma":[0.8503262,0.002612564,0.1454417,0.0007443408,0.00003309747,0.0005764723,0.00002679517,0.00001810252,0.000220717],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8135763,"threshold_uncertainty_score":0.6871037,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006868031,0.000134669,0.0001856507,0.00006847129,0.0001269926,0.0002660425,0.001225384,0.00007195487,0.0001019847],"category_scores_gemma":[0.0001425334,0.0001335293,0.00008253825,0.0005142141,0.00003802641,0.0004925703,0.0004115693,0.0002383442,0.0000496829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005896841,"about_ca_system_score_gemma":0.00004615272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004306433,"about_ca_topic_score_gemma":0.0002182143,"domain_scores_codex":[0.9983546,0.0002061745,0.0003824765,0.0003048793,0.0005612033,0.000190644],"domain_scores_gemma":[0.9975913,0.0008537688,0.0002866251,0.0006404011,0.0005760113,0.00005184901],"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.00003153094,0.0001773183,0.0007027345,0.000009797281,0.00003751804,0.000001891939,0.0002377434,0.0007161669,0.0004275138,0.9654897,0.02403728,0.008130793],"study_design_scores_gemma":[0.002517456,0.0001184113,0.07173222,0.0007952469,0.00002267617,0.00002766426,0.0003873508,0.2826797,0.004052586,0.08619957,0.5501182,0.001348883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01178216,0.0002347034,0.4887358,0.4632678,0.0009919226,0.0001859458,0.000008444619,0.0001726641,0.0346206],"genre_scores_gemma":[0.9571981,0.0001207012,0.02478593,0.01518634,0.0004271472,0.00001176286,0.00002103153,0.000009710197,0.002239205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.945416,"threshold_uncertainty_score":0.5445169,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008280659,0.0001137179,0.000147042,0.0002091591,0.0006317331,0.0000817312,0.0002730033,0.00005317134,0.00001667139],"category_scores_gemma":[0.00002450026,0.0001113023,0.00005363997,0.0003629795,0.00006286569,0.001379083,0.000004761314,0.0001787458,0.00001312163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004741268,"about_ca_system_score_gemma":0.00004985033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000017945,"about_ca_topic_score_gemma":0.00001470912,"domain_scores_codex":[0.9990949,0.0001449011,0.0003375465,0.000112145,0.000117636,0.0001928964],"domain_scores_gemma":[0.998881,0.0006320137,0.00008806521,0.0002626699,0.00008382021,0.00005245393],"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.0005339042,0.00009762297,0.00007983009,0.0000586293,0.0000624484,0.000001692286,0.0212485,0.1556764,0.000190817,0.4201179,0.001442068,0.4004903],"study_design_scores_gemma":[0.008771189,0.0002511142,0.001598393,0.00032484,0.00002263792,0.00008691279,0.0006806886,0.9535387,0.0051784,0.01088507,0.01781376,0.0008483347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003606776,0.0000922399,0.9937153,0.0002925744,0.0003424683,0.0003444813,0.000003243543,0.0001139699,0.001488877],"genre_scores_gemma":[0.9903024,0.0009956417,0.007742696,0.0007286435,0.00002126835,0.0001079082,0.000002613772,0.000005082616,0.00009369409],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9866956,"threshold_uncertainty_score":0.4858844,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005056123,0.0001066468,0.00009637472,0.00006426241,0.0001890767,0.0001614822,0.0003919731,0.00006403849,0.00001949345],"category_scores_gemma":[0.00009204652,0.0000986829,0.00002232581,0.0003870453,0.00002774156,0.0006115814,0.0003413876,0.0001787275,0.00003225979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008936803,"about_ca_system_score_gemma":0.0000685616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001232736,"about_ca_topic_score_gemma":0.00004772357,"domain_scores_codex":[0.9991142,0.000110352,0.000169772,0.0002602573,0.0001514901,0.0001939436],"domain_scores_gemma":[0.9991429,0.0001048734,0.00005926152,0.0003561504,0.0001979538,0.0001388251],"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.0001961063,0.0001505045,0.001406936,0.00000663927,0.0001075727,0.000002810348,0.004103253,0.1014125,0.0009852544,0.4977787,0.03475204,0.3590976],"study_design_scores_gemma":[0.0006567541,0.000184616,0.0004985371,0.000007670268,0.000004898193,0.000007555119,0.00009168699,0.9746946,0.0001401289,0.00005634181,0.02348412,0.0001731399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007571395,0.0005395811,0.9816223,0.001106619,0.0004797199,0.0001217004,7.307749e-8,0.0002692193,0.008289399],"genre_scores_gemma":[0.9459288,0.0002543161,0.0527927,0.0003155378,0.00007048895,0.00001496615,0.000003624477,0.0000078644,0.0006116713],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9383574,"threshold_uncertainty_score":0.4024172,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000300702,0.0001436903,0.0001527394,0.0002829975,0.001448069,0.00009343861,0.002910397,0.00007268869,0.00001421899],"category_scores_gemma":[0.000007393217,0.0001619058,0.00008535391,0.001046325,0.0001171943,0.0005395871,0.0001244675,0.0005804018,0.00009736358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000247612,"about_ca_system_score_gemma":0.0000767346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001639588,"about_ca_topic_score_gemma":0.001443054,"domain_scores_codex":[0.998841,0.0002217142,0.0002692714,0.0002633019,0.000174952,0.0002297113],"domain_scores_gemma":[0.9968907,0.000244946,0.00006669581,0.002606285,0.0001038006,0.00008754301],"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.00003926633,0.004141386,0.0004386667,0.00002265986,0.0001299901,0.00001548053,0.02981417,0.188428,0.00459556,0.290794,0.0001646306,0.4814162],"study_design_scores_gemma":[0.01164882,0.0005378874,0.00718573,0.001265561,0.00008376512,0.0000842336,0.001924993,0.9082745,0.03286492,0.02317974,0.009871963,0.003077898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01619443,0.0001658494,0.9738241,0.007023124,0.0002905329,0.0002519455,0.000003554874,0.0002469642,0.001999451],"genre_scores_gemma":[0.9809412,0.002442277,0.01599105,0.0004145082,0.000007934882,0.00007323411,0.000002538015,0.00000980654,0.0001174723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9647468,"threshold_uncertainty_score":0.9998519,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002803461,0.0001094493,0.00009022065,0.00006568765,0.000292203,0.000235474,0.000330027,0.00006336023,0.00003464657],"category_scores_gemma":[0.00002445828,0.0001034547,0.000028025,0.0003767169,0.00002729895,0.0004971417,0.0002402796,0.0001633411,0.00001843249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006439359,"about_ca_system_score_gemma":0.00002992764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005393517,"about_ca_topic_score_gemma":0.0001313227,"domain_scores_codex":[0.9991409,0.00007767829,0.000189338,0.0002714816,0.0001175131,0.0002030437],"domain_scores_gemma":[0.9993371,0.0001140689,0.00006900733,0.0003198902,0.0001113553,0.00004860046],"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.00006438562,0.0001052973,0.0009723685,0.000005535577,0.00003557168,0.00000148418,0.0003218537,0.07850672,0.003698671,0.7125709,0.008113626,0.1956036],"study_design_scores_gemma":[0.0004596963,0.00008853595,0.002288521,0.000005901644,0.000004871334,0.000005549446,0.00001666685,0.9878591,0.0003684053,0.00005746174,0.008674326,0.0001709565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0108313,0.0003724827,0.9808572,0.0006426885,0.0002813744,0.0001127839,9.719334e-8,0.0002639527,0.006638123],"genre_scores_gemma":[0.9457328,0.0001251612,0.05311967,0.000169019,0.0000883351,0.00001447209,0.000006011735,0.000007613914,0.0007368696],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9349015,"threshold_uncertainty_score":0.4218762,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.006236349,0.0004837187,0.0007569183,0.0003620811,0.001801316,0.0008169102,0.01256314,0.0002840249,0.000004779451],"category_scores_gemma":[0.001199518,0.0004936269,0.0002739448,0.002048882,0.0004643627,0.001051274,0.001555523,0.0007188774,0.0000313847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001852455,"about_ca_system_score_gemma":0.0002641205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001046376,"about_ca_topic_score_gemma":0.001127388,"domain_scores_codex":[0.9890199,0.008265262,0.001135617,0.0006526342,0.0003529021,0.0005736678],"domain_scores_gemma":[0.9747275,0.008364344,0.0005473173,0.01314328,0.00300651,0.0002111301],"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.0001107045,0.002755207,0.0034027,0.00006334179,0.0003854368,0.000003557048,0.007289936,0.00002654062,0.09851231,0.2941262,0.03067388,0.5626501],"study_design_scores_gemma":[0.004395011,0.0009331582,0.1146566,0.001217498,0.000119836,0.00006162472,0.0002029309,0.1687822,0.009704059,0.01259029,0.6835897,0.003747062],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002849527,0.01127531,0.9644369,0.01270695,0.001672702,0.003240931,0.0005024368,0.001625023,0.001690232],"genre_scores_gemma":[0.861306,0.01474415,0.1208788,0.0010454,0.0002294498,0.0005173628,0.0009700958,0.00003901928,0.0002697662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8584564,"threshold_uncertainty_score":0.9997515,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044019,0.0001867699,0.0003466101,0.0005584501,0.001167061,0.00007336534,0.004093491,0.0000689009,0.00001321958],"category_scores_gemma":[0.00002199586,0.0001974701,0.0001690062,0.003435542,0.0003001747,0.0005953256,0.002349103,0.0003757625,0.000005365651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000137209,"about_ca_system_score_gemma":0.00002646893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003744347,"about_ca_topic_score_gemma":0.0003136533,"domain_scores_codex":[0.9983747,0.0002753419,0.000461108,0.0002941544,0.0002633007,0.0003313704],"domain_scores_gemma":[0.9957079,0.0005756082,0.000273045,0.003057291,0.0002859386,0.0001002754],"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.0001189478,0.001317548,0.2067873,0.00005828311,0.005775764,0.00001527286,0.04464167,0.4775948,0.04029002,0.05828298,0.007243758,0.1578736],"study_design_scores_gemma":[0.0002508977,0.0000227509,0.07811908,0.00003740239,0.0001281523,0.000001263731,0.00007043206,0.9197542,0.0008198137,0.000004499465,0.0005421797,0.0002493429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4404238,0.0002749266,0.5567707,0.001202835,0.0001428637,0.0001424052,0.000003007953,0.00009002885,0.0009493103],"genre_scores_gemma":[0.9931306,0.001696057,0.003432711,0.001627353,0.00002634254,0.00001107617,0.00002718824,0.000009343209,0.00003934866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5533381,"threshold_uncertainty_score":0.8976209,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006642412,0.0002476032,0.0003481516,0.0003884127,0.0007312201,0.0004142413,0.002420868,0.0001248678,0.00001921788],"category_scores_gemma":[0.0002086716,0.0002361395,0.00009438644,0.002420804,0.00009498249,0.0009183765,0.0002698654,0.001683794,0.00002364612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004176401,"about_ca_system_score_gemma":0.0002348457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002761148,"about_ca_topic_score_gemma":0.0007798668,"domain_scores_codex":[0.9973158,0.001078609,0.0006078402,0.0003202246,0.0002189738,0.0004585695],"domain_scores_gemma":[0.9959773,0.00128168,0.0002694968,0.001214155,0.001109275,0.0001480365],"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.0001960169,0.004871827,0.007549713,0.00001740544,0.0002052539,0.000005620053,0.01247786,0.7779401,0.009339974,0.09756958,0.01625765,0.07356902],"study_design_scores_gemma":[0.0009190742,0.0002489547,0.004579579,0.0001485016,0.000005793871,0.00003244771,0.00006884871,0.990857,0.0006621046,0.0006056103,0.001596232,0.0002758546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6384414,0.0006541634,0.3490935,0.008441458,0.0003539783,0.001453049,0.000003532817,0.0001884431,0.001370494],"genre_scores_gemma":[0.9853097,0.001957961,0.01162736,0.0004637194,0.000138145,0.0003887309,0.00001275213,0.0000230181,0.00007867279],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3468682,"threshold_uncertainty_score":0.962949,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630055,0.0001587841,0.0002518706,0.000588302,0.0003958412,0.0002147495,0.001313589,0.0001030347,0.000007845084],"category_scores_gemma":[0.0002277801,0.0001578669,0.00003582708,0.002274961,0.0001629259,0.0006356115,0.0002447254,0.00101368,0.000001135692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001704047,"about_ca_system_score_gemma":0.0002348063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001595302,"about_ca_topic_score_gemma":0.0008076815,"domain_scores_codex":[0.9977291,0.0007939523,0.0008153667,0.000200717,0.0001993735,0.0002614805],"domain_scores_gemma":[0.9970047,0.000816589,0.000331132,0.00117472,0.0005700919,0.0001027237],"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.00002428316,0.000377325,0.0008827854,0.000003583639,0.00002366907,0.000005829098,0.00258835,0.9309969,0.001839549,0.05623221,0.0001869704,0.006838566],"study_design_scores_gemma":[0.0008604464,0.000168483,0.01405535,0.0003685874,0.000008148773,0.00004924408,0.0008597228,0.9808584,0.000963067,0.0003623743,0.001181381,0.0002647286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03315001,0.002784351,0.9571506,0.00282949,0.00008368291,0.0002927179,9.423341e-7,0.00005005694,0.003658081],"genre_scores_gemma":[0.9612973,0.005458898,0.03297414,0.0001755587,0.00002761642,0.00001327668,0.00001224285,0.00001200738,0.00002897734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9281473,"threshold_uncertainty_score":0.6437625,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003380587,0.0002697341,0.0002814582,0.000383787,0.001791958,0.0001257077,0.001975282,0.000149884,0.00003450379],"category_scores_gemma":[0.00001461845,0.0002924704,0.00009979674,0.002103061,0.0002464833,0.0008063309,0.00003685557,0.0009480531,0.00007841846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002545261,"about_ca_system_score_gemma":0.0001698693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005957426,"about_ca_topic_score_gemma":0.00236728,"domain_scores_codex":[0.9976677,0.0007963431,0.0005431394,0.0004408722,0.0002076185,0.0003442748],"domain_scores_gemma":[0.9968907,0.0004163692,0.0001227618,0.002086883,0.0003598104,0.0001234226],"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.00004102165,0.002448832,0.000402158,0.000006719916,0.00008234951,0.000005069341,0.00511166,0.8331636,0.004152146,0.01997814,0.0005401209,0.1340681],"study_design_scores_gemma":[0.0008526455,0.00008461927,0.0007472508,0.0000533348,0.000006457316,0.00003814694,0.00004763397,0.9929791,0.002675628,0.000007103726,0.00218634,0.0003217368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007809585,0.0002733053,0.988743,0.001496462,0.0002019335,0.0004876443,0.000003148512,0.0003928781,0.0005920642],"genre_scores_gemma":[0.9726868,0.007193604,0.01827188,0.0005644147,0.00001694762,0.0003303633,0.0000118392,0.0000276782,0.0008964757],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9704711,"threshold_uncertainty_score":0.9999527,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009414,0.0001463465,0.0002076988,0.0001293302,0.0006080926,0.0001066102,0.002476683,0.00005198826,0.000001925023],"category_scores_gemma":[0.00009980911,0.0001160567,0.00008893323,0.0004497799,0.0002216542,0.0003934902,0.000750452,0.000269258,0.000001130836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008232838,"about_ca_system_score_gemma":0.00002968459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003854276,"about_ca_topic_score_gemma":0.0001706698,"domain_scores_codex":[0.9986048,0.0002655693,0.0004969179,0.0002544369,0.0001421638,0.0002360648],"domain_scores_gemma":[0.9957139,0.001386486,0.0002069505,0.002562587,0.0000944174,0.0000355962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001333226,0.001384707,0.0424407,0.0003439142,0.0001541862,0.000003271,0.03666877,0.04800397,0.3786841,0.2759453,0.012401,0.2038368],"study_design_scores_gemma":[0.002535096,0.00009472709,0.03441607,0.0007393199,0.00005022056,0.000009621011,0.0003710744,0.8857872,0.02911315,0.01515913,0.03078115,0.0009432817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2417888,0.001869109,0.7210186,0.03337959,0.0001992852,0.001235365,0.000007753214,0.0001077507,0.0003937205],"genre_scores_gemma":[0.9495674,0.0005775906,0.04890699,0.0005822397,0.00002593527,0.0002962317,0.000008471128,0.00001101304,0.00002416599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8377832,"threshold_uncertainty_score":0.4732654,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005714526,0.0002392398,0.0002235635,0.0002357403,0.001649768,0.0001356067,0.001944163,0.0001140268,0.00002806228],"category_scores_gemma":[0.00001067742,0.0002264933,0.0001275351,0.001036591,0.0001598547,0.001114827,0.00002421181,0.000556088,0.00006791381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000196962,"about_ca_system_score_gemma":0.0001040707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001687834,"about_ca_topic_score_gemma":0.0002580181,"domain_scores_codex":[0.9983277,0.0003765185,0.0003435424,0.0002983329,0.0002175455,0.0004363801],"domain_scores_gemma":[0.9959515,0.000798727,0.0001433691,0.002619375,0.0002975649,0.0001894368],"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.0001585557,0.002912924,0.000610156,0.00004796004,0.0004201226,3.701749e-7,0.006077424,0.02122363,0.007601249,0.353804,0.002657138,0.6044865],"study_design_scores_gemma":[0.002568819,0.0007055649,0.001191125,0.0002837462,0.0001884182,0.00009813409,0.0003788047,0.8133221,0.0304276,0.0002898009,0.1490909,0.001454973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003595216,0.0003736098,0.9887776,0.004456134,0.0002867354,0.0007807652,0.00001171707,0.0004393711,0.00127884],"genre_scores_gemma":[0.9091069,0.001504346,0.08707649,0.0004815982,0.00003604626,0.001041835,0.00001218668,0.00003428711,0.000706334],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9055117,"threshold_uncertainty_score":0.9996499,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004663292,0.0002921626,0.000468513,0.0007177495,0.0009061862,0.0004316234,0.003508864,0.0001121875,0.00002238637],"category_scores_gemma":[0.001363231,0.0002609884,0.00008118727,0.003849471,0.00009671128,0.000529839,0.0004318384,0.001890576,0.00003282604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004752456,"about_ca_system_score_gemma":0.0002923781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003393472,"about_ca_topic_score_gemma":0.005265835,"domain_scores_codex":[0.9962128,0.001115218,0.0009221036,0.0003430236,0.0007068918,0.00069997],"domain_scores_gemma":[0.9920689,0.003240524,0.0003504331,0.002010276,0.002043637,0.0002861602],"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.005830299,0.004847476,0.119927,0.00003647832,0.000732387,0.0004630544,0.05237641,0.2281531,0.003919975,0.07908475,0.04624961,0.4583794],"study_design_scores_gemma":[0.05799516,0.001960695,0.3114986,0.007961773,0.0001336306,0.001130716,0.00263744,0.4260962,0.002214313,0.004580133,0.1795881,0.004203255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1496363,0.002294769,0.8025865,0.02549719,0.001042184,0.001653051,0.000005476159,0.0003527469,0.01693176],"genre_scores_gemma":[0.9508345,0.001625855,0.04604372,0.0009172978,0.0002083831,0.00004492649,0.00001170907,0.00002801775,0.0002856648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8011981,"threshold_uncertainty_score":0.9999842,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003077473,0.0001747034,0.0002745148,0.0004115681,0.001745808,0.00006305485,0.001391507,0.00009266922,0.00003965954],"category_scores_gemma":[0.000006273331,0.0001605137,0.00009895748,0.002500294,0.000333552,0.000517151,0.00008392929,0.0007522197,0.00000544423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004762882,"about_ca_system_score_gemma":0.00007442374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007196743,"about_ca_topic_score_gemma":0.005544287,"domain_scores_codex":[0.9988434,0.0002249999,0.0002731069,0.0002866597,0.0001908233,0.0001810539],"domain_scores_gemma":[0.9971396,0.0004372658,0.0001523088,0.001669712,0.0004974222,0.0001037322],"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.0001138708,0.001093228,0.006095055,0.000006665489,0.00192948,4.332099e-7,0.004530989,0.841828,0.001035944,0.01744415,0.00005148968,0.1258707],"study_design_scores_gemma":[0.0002867029,0.0002751896,0.006123625,0.0000208704,0.0003986227,0.000004628182,0.00007982174,0.9914056,0.0009900904,0.000007156817,0.0002176856,0.0001899893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1018309,0.00007832136,0.8961511,0.0004804409,0.00008293245,0.0002161554,0.00000967398,0.00009183589,0.001058651],"genre_scores_gemma":[0.966216,0.002428363,0.03102205,0.00009211818,0.000006173103,0.0000567407,0.000006067127,0.000008757284,0.0001637772],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.865129,"threshold_uncertainty_score":0.9995538,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000246584,0.00018971,0.0001856273,0.000187932,0.001320879,0.0002185124,0.002672375,0.00007550392,0.00006849135],"category_scores_gemma":[0.00000806887,0.0002032771,0.0001310443,0.001021996,0.000149611,0.0003825339,0.00003962769,0.000439934,0.0004331978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001311198,"about_ca_system_score_gemma":0.00007114086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003265334,"about_ca_topic_score_gemma":0.0001516285,"domain_scores_codex":[0.9985796,0.0003042693,0.0003533817,0.0002842949,0.0002052202,0.0002732722],"domain_scores_gemma":[0.9955425,0.0004861596,0.0001043797,0.003586491,0.0001919288,0.00008852681],"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.00004137534,0.005205213,0.00009165843,0.00002884774,0.000320512,0.00001010021,0.001594489,0.1204223,0.06492312,0.6278403,0.04319955,0.1363224],"study_design_scores_gemma":[0.0009871542,0.0001082037,0.0007256556,0.0001120592,0.00004867555,0.0000387713,0.00003889816,0.8565692,0.0179007,0.00260436,0.1200903,0.0007760273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006225464,0.000301428,0.9774653,0.01044466,0.0001599998,0.000236094,0.00003509691,0.0005955305,0.01013931],"genre_scores_gemma":[0.9743118,0.0008787629,0.02269689,0.0002069958,0.0000241855,0.000097306,0.00002941281,0.0000166609,0.00173804],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9736892,"threshold_uncertainty_score":0.9999793,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001189063,0.0002847109,0.0003107455,0.0004692825,0.001174336,0.0001601591,0.003103527,0.0001742532,0.00002519886],"category_scores_gemma":[0.00002373392,0.0003011615,0.0001330529,0.002072965,0.0002328228,0.0006334438,0.00006541965,0.00134026,0.0000677817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002658053,"about_ca_system_score_gemma":0.00009944819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004885735,"about_ca_topic_score_gemma":0.003720478,"domain_scores_codex":[0.9975095,0.0005710576,0.0007280624,0.0004572961,0.0002300391,0.0005040678],"domain_scores_gemma":[0.9947088,0.001158814,0.0001596372,0.003521557,0.0002828702,0.0001683211],"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.0001415216,0.004852989,0.001210994,0.00002166746,0.0002482609,0.00004333035,0.01444604,0.2229137,0.0153697,0.09980557,0.0004029676,0.6405432],"study_design_scores_gemma":[0.001038422,0.00007029622,0.002027594,0.0001696583,0.00001134606,0.0000122962,0.0002708199,0.9927006,0.001778961,0.00002367281,0.00146627,0.0004300317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00539577,0.0007108191,0.9896419,0.001939961,0.0004296943,0.0004539766,0.000004218009,0.0003338867,0.001089748],"genre_scores_gemma":[0.9518855,0.004408176,0.04246537,0.0006393213,0.00001374807,0.0001330413,0.000008472574,0.00002931918,0.0004170641],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9471766,"threshold_uncertainty_score":0.999944,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009728209,0.0002099502,0.0002304558,0.0004279256,0.00101402,0.0002217203,0.002208082,0.0000950902,0.00002002464],"category_scores_gemma":[0.0001853746,0.0001813316,0.00005516609,0.002460227,0.00008814633,0.001124812,0.0002441489,0.001650188,0.00004610257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000411842,"about_ca_system_score_gemma":0.0002378829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008169967,"about_ca_topic_score_gemma":0.0002053341,"domain_scores_codex":[0.9974245,0.001139877,0.0004630406,0.0001943666,0.0003195125,0.0004586934],"domain_scores_gemma":[0.9965786,0.0007729764,0.0003030433,0.001465906,0.0006644666,0.0002149795],"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.0004727105,0.004319935,0.0934171,0.00001780598,0.0006328569,0.00002460343,0.02407205,0.01162668,0.01368227,0.441419,0.008899793,0.4014152],"study_design_scores_gemma":[0.007715466,0.002953546,0.3447489,0.002573062,0.0001601275,0.004523153,0.0008529748,0.5167961,0.01025124,0.005247159,0.1007252,0.003453121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1355911,0.005898416,0.8063682,0.02201725,0.0009796291,0.001015709,0.000003466387,0.0007637064,0.02736252],"genre_scores_gemma":[0.9450136,0.002061664,0.05216305,0.0004060265,0.0001784442,0.00004574483,0.000004192037,0.0000208236,0.0001064137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8094226,"threshold_uncertainty_score":0.7799124,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004061841,0.0001545779,0.0001353092,0.0001782038,0.0005183918,0.0004139144,0.0008273032,0.0000477972,0.00009796574],"category_scores_gemma":[0.000005955246,0.0001419484,0.00006999894,0.0006993155,0.0000330609,0.003635482,0.000007755749,0.0002389854,0.001280281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005693547,"about_ca_system_score_gemma":0.00003140837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002946592,"about_ca_topic_score_gemma":9.895801e-7,"domain_scores_codex":[0.9989114,0.0001815099,0.0002718936,0.0001647666,0.0002106445,0.0002597228],"domain_scores_gemma":[0.9986321,0.0001509614,0.0000756325,0.0008004766,0.0001700861,0.0001706865],"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.00001081768,0.0001304316,0.000001029049,0.000007054503,0.00002162058,4.365419e-8,0.00656855,0.1647872,0.0004299444,0.4007551,0.00149081,0.4257974],"study_design_scores_gemma":[0.0003836958,0.0001626272,0.0002982661,0.00003407412,0.000009744941,0.000005999669,0.0003530956,0.9779976,0.004647646,0.01181003,0.003870559,0.0004266556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004025538,0.000006819737,0.9797907,0.0003004031,0.0002913161,0.0004148698,0.000001808084,0.0003330827,0.01483544],"genre_scores_gemma":[0.9762765,0.0000221144,0.02010754,0.0031403,0.00006178059,0.0002416244,0.000004964283,0.000008057861,0.0001370891],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.972251,"threshold_uncertainty_score":0.9994974,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003929405,0.0002064111,0.0001996907,0.00009614492,0.001952331,0.0001442541,0.004377146,0.0000472687,0.00004450715],"category_scores_gemma":[0.00002702956,0.0001857266,0.00006979236,0.0005969591,0.0004349018,0.0008793636,0.003708247,0.0004138614,0.0001456248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003372161,"about_ca_system_score_gemma":0.00006294039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000160996,"about_ca_topic_score_gemma":0.0007737461,"domain_scores_codex":[0.9982959,0.0005122888,0.0002728556,0.0003839835,0.0002507521,0.0002842304],"domain_scores_gemma":[0.9948577,0.000302532,0.0001277682,0.004395238,0.0001930455,0.0001236872],"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.0003093981,0.00465647,0.1128934,0.00009988537,0.00108741,0.00004634794,0.08726721,0.02268573,0.05749501,0.355792,0.1420829,0.2155842],"study_design_scores_gemma":[0.005650753,0.0004890713,0.06816094,0.0003506796,0.0001414142,0.0001750638,0.0003061169,0.2532131,0.0188511,0.001062267,0.6477823,0.003817095],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.500511,0.001159416,0.2999357,0.1823653,0.0002069292,0.00116206,0.00001673337,0.0008457326,0.01379721],"genre_scores_gemma":[0.9084525,0.0003940962,0.08239065,0.008335596,0.00004273931,0.00006492113,0.00001766601,0.00001139733,0.00029046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5056994,"threshold_uncertainty_score":0.999347,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192536,0.000124394,0.0001168535,0.0001254786,0.0001814191,0.0002963505,0.0004200956,0.00005462985,0.00006384742],"category_scores_gemma":[0.00005180271,0.0001031702,0.00002084236,0.00123321,0.00001612613,0.0005349971,0.0000953493,0.0002865152,0.00003120726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000683566,"about_ca_system_score_gemma":0.00008592993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001866812,"about_ca_topic_score_gemma":0.0005233954,"domain_scores_codex":[0.9987944,0.0001961308,0.0001854418,0.0002954912,0.0002647231,0.0002638046],"domain_scores_gemma":[0.9990997,0.00007376519,0.00003791697,0.0004296881,0.0002833299,0.00007555786],"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.00001164274,0.00007164361,0.006649382,0.000002921551,0.0000145337,0.00001008916,0.001649189,0.2318132,0.001242609,0.7458041,0.003706173,0.009024494],"study_design_scores_gemma":[0.001027577,0.000321227,0.006218281,0.0001031179,0.000007227264,0.00003889399,0.0008681599,0.866344,0.003862852,0.001432904,0.1189586,0.000817179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0182533,0.0001454494,0.9288529,0.001806048,0.0001019636,0.0001558901,3.157799e-8,0.0001402475,0.05054416],"genre_scores_gemma":[0.9301664,0.00003749559,0.064867,0.0004649024,0.0000196003,0.00002069685,0.000001123686,0.00000919008,0.004413575],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9119131,"threshold_uncertainty_score":0.4207157,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000712026,0.0001768039,0.0002435872,0.0003937189,0.001857584,0.0001744576,0.00235387,0.00008890724,0.000003981146],"category_scores_gemma":[0.0003494982,0.0001716504,0.00007350337,0.001038221,0.0001193415,0.0005431384,0.0003200424,0.0009738494,0.00000702185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001739401,"about_ca_system_score_gemma":0.000200684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005623141,"about_ca_topic_score_gemma":0.0001078244,"domain_scores_codex":[0.9983342,0.0003621408,0.0005362111,0.0002246409,0.0002037063,0.0003391258],"domain_scores_gemma":[0.9965749,0.001089826,0.0002450837,0.001491001,0.0004361399,0.0001629815],"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.000245261,0.002693224,0.03234098,0.00006102791,0.000520063,0.00006718557,0.03180525,0.00784276,0.0152416,0.4198795,0.03143578,0.4578674],"study_design_scores_gemma":[0.005534401,0.0009356324,0.04643867,0.001064745,0.00005704017,0.00306844,0.0004175986,0.511754,0.00150519,0.01256268,0.4148222,0.001839378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1197671,0.003827278,0.8481763,0.02028504,0.0006021878,0.0009529183,0.000008947065,0.0003613502,0.006018842],"genre_scores_gemma":[0.8828304,0.01132048,0.1048057,0.0007317366,0.00007149917,0.00007341118,0.000009183967,0.00001864698,0.0001388894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7630633,"threshold_uncertainty_score":0.9994419,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002386306,0.00009503016,0.0001362226,0.00009327097,0.000125695,0.0002163251,0.0004757046,0.00003387215,0.00001307246],"category_scores_gemma":[0.0000232529,0.00008575644,0.00002540935,0.000278363,0.00004678226,0.0005212015,0.0003341988,0.00006672873,0.000002753688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002065392,"about_ca_system_score_gemma":0.00002149118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001334901,"about_ca_topic_score_gemma":0.00005049392,"domain_scores_codex":[0.9991953,0.0001045645,0.0002575816,0.0001996708,0.0001276061,0.0001152446],"domain_scores_gemma":[0.9992194,0.0001041777,0.0001128051,0.0003403614,0.00018784,0.0000354054],"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.00001471558,0.001329716,0.07383756,0.0002349925,0.00006028854,0.000007318939,0.000965384,0.005759441,0.1363065,0.7108162,0.001573688,0.06909421],"study_design_scores_gemma":[0.0009325956,0.00001893295,0.0123436,0.0000723083,0.000003179057,0.00000212965,0.00002736963,0.9762175,0.009176439,0.00003704649,0.001034204,0.0001347073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1736997,0.002022952,0.8230417,0.0001499984,0.0001061613,0.0002031945,0.000001275325,0.00009866946,0.0006763485],"genre_scores_gemma":[0.9763197,0.0001085729,0.02311109,0.00006445016,0.00001402612,0.00001022136,0.000003952369,0.000005133204,0.0003629038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.970458,"threshold_uncertainty_score":0.3497046,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005417189,0.0002193504,0.0003172057,0.0002820829,0.001466829,0.0001287579,0.0006811697,0.00005438646,0.000009741032],"category_scores_gemma":[0.000048289,0.0001729972,0.00004372024,0.00106814,0.0001389121,0.002899687,0.0002135378,0.0007001315,0.000003774131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002040925,"about_ca_system_score_gemma":0.0001423231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002699824,"about_ca_topic_score_gemma":0.000008301859,"domain_scores_codex":[0.9981532,0.0002671223,0.0004608137,0.0003033318,0.0005125377,0.0003029787],"domain_scores_gemma":[0.9985326,0.0002203391,0.0005033896,0.0001644044,0.0004781179,0.0001011498],"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.0002187151,0.000178485,0.09147698,0.00005310405,0.00001720895,0.00004186856,0.003775932,0.8760978,0.00106668,0.000190783,0.00001828609,0.02686414],"study_design_scores_gemma":[0.001453519,0.001085713,0.004988148,0.001785523,0.000008638031,0.0005273249,0.0001965437,0.9858896,0.003033168,0.000006621704,0.0006718091,0.0003533641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8047955,0.00419912,0.189784,0.00005656466,0.0002316531,0.0001738291,5.420763e-7,0.00004123055,0.0007175612],"genre_scores_gemma":[0.9926956,0.003785077,0.003198753,0.00006495268,0.0001158323,0.000006309705,6.490358e-7,0.00001290187,0.000119966],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1879,"threshold_uncertainty_score":0.9998331,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001812355,0.0002442044,0.0002755196,0.0003540031,0.0006149765,0.00009401904,0.001030597,0.00030142,0.0000178704],"category_scores_gemma":[0.000005795547,0.0002416871,0.0001428671,0.001194511,0.0001683149,0.0002225055,0.0000139409,0.0005224,0.00003957868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001004318,"about_ca_system_score_gemma":0.00006078304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000238794,"about_ca_topic_score_gemma":0.0001256143,"domain_scores_codex":[0.9985335,0.00007874973,0.0003176924,0.0005210085,0.0001405388,0.0004084363],"domain_scores_gemma":[0.998439,0.0001223718,0.00008677704,0.001025824,0.0002754398,0.00005058874],"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.00008141168,0.00103655,0.0000273311,0.00002248835,0.0002080456,0.00002622251,0.0002135858,0.1482914,0.03704816,0.1485664,0.002292026,0.6621863],"study_design_scores_gemma":[0.001196154,0.0002949399,0.0000307997,0.00006296804,0.00002129672,0.00003515592,0.00003489511,0.9080971,0.05444861,0.001138224,0.03417341,0.0004664564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01476359,0.001604814,0.9773217,0.00455243,0.0003264674,0.0004946399,0.000005437686,0.0007667975,0.0001641147],"genre_scores_gemma":[0.9551291,0.0009245932,0.04249716,0.000441865,0.0000357935,0.000487269,0.000005971832,0.00002584995,0.0004523235],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9403656,"threshold_uncertainty_score":0.9855716,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227786,0.0001555372,0.0002372874,0.0005858091,0.0003146961,0.0001397357,0.0008879016,0.00008957386,0.000004036096],"category_scores_gemma":[0.0002301526,0.0001412172,0.00002638617,0.001715378,0.0001282255,0.001125587,0.000171713,0.0008114254,0.000001160777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001795962,"about_ca_system_score_gemma":0.0001727322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000181869,"about_ca_topic_score_gemma":0.001045191,"domain_scores_codex":[0.9981627,0.0004656935,0.0007647029,0.0001380581,0.0002059304,0.0002628537],"domain_scores_gemma":[0.9975587,0.0005275354,0.0004107562,0.0007941939,0.0006033962,0.0001054045],"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.00007137738,0.0001371202,0.001045641,0.000002748499,0.00002053904,0.000001948899,0.002365625,0.9818156,0.00004780762,0.002841888,0.00005824603,0.01159148],"study_design_scores_gemma":[0.00106318,0.0001880303,0.006876793,0.0002626378,0.000005616404,0.00005342295,0.000293713,0.9904767,0.0003398863,0.0000632431,0.0002039878,0.0001728206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02654004,0.0004234125,0.9696514,0.00183859,0.00009045808,0.0002989876,0.000001109027,0.00003781528,0.001118171],"genre_scores_gemma":[0.9619864,0.004652238,0.03297757,0.0003211832,0.00001744542,0.00001732877,0.00001359763,0.000008633646,0.000005649568],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9366739,"threshold_uncertainty_score":0.575867,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005643757,0.0001449129,0.0001571925,0.00004826908,0.0006493632,0.0003176814,0.0007043417,0.00004874966,0.000341498],"category_scores_gemma":[0.0000505639,0.0001060875,0.00003692206,0.0003533583,0.00004221092,0.0003815482,0.0002567372,0.0003423166,0.00005470515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000144054,"about_ca_system_score_gemma":0.00006618988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001822482,"about_ca_topic_score_gemma":0.0004222728,"domain_scores_codex":[0.9988861,0.00009316028,0.0001858963,0.0003102339,0.0002302647,0.0002943609],"domain_scores_gemma":[0.9986656,0.0002916283,0.00005224772,0.0006716557,0.0002146302,0.0001041939],"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.00007542142,0.0002059627,0.005764185,0.000005183739,0.00005145792,0.000007093549,0.001186491,0.006375612,0.001827119,0.9383234,0.01580522,0.0303728],"study_design_scores_gemma":[0.004436531,0.0001858669,0.008599099,0.0000964374,0.00001035133,0.0000221368,0.00007347257,0.8579079,0.001917606,0.0006039397,0.1255381,0.0006085468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0251869,0.00007244681,0.935551,0.001831118,0.0004947385,0.0002361942,0.000001207252,0.0002297718,0.03639665],"genre_scores_gemma":[0.9063978,0.00008198361,0.08960898,0.001801446,0.0003738659,0.00002722521,0.000008533681,0.00001104971,0.001689163],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9377195,"threshold_uncertainty_score":0.4994442,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002769477,0.0001081233,0.0001934159,0.0001092547,0.00009766392,0.00005468767,0.0008072527,0.00004925048,0.0000437001],"category_scores_gemma":[0.0002406714,0.000102694,0.00004203248,0.0009892439,0.00002843801,0.0001960577,0.0005824096,0.0001809913,0.00002134568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007581247,"about_ca_system_score_gemma":0.00004474802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001302958,"about_ca_topic_score_gemma":0.00254296,"domain_scores_codex":[0.9985836,0.000104242,0.000389601,0.0002562747,0.0003378993,0.0003283824],"domain_scores_gemma":[0.9984505,0.0003374326,0.00008576649,0.0006446792,0.000381027,0.0001006129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00005119715,0.0003038038,0.05403867,0.00003024162,0.00004325382,0.00002673402,0.01811908,0.006033962,0.003504565,0.5540081,0.02736728,0.3364731],"study_design_scores_gemma":[0.001937033,0.0003573541,0.597189,0.0007317772,0.0000143251,0.00001753208,0.002036936,0.2990139,0.01263818,0.003654498,0.08107293,0.001336606],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0719791,0.0001848363,0.8666991,0.005764285,0.0002334055,0.0002787429,8.85203e-7,0.0001313096,0.05472833],"genre_scores_gemma":[0.9561356,0.00005839813,0.041699,0.0004881613,0.00006660487,0.000004257161,0.000002310813,0.000005364503,0.001540339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8841565,"threshold_uncertainty_score":0.4187738,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001915595,0.0001311888,0.0001493553,0.0003444892,0.0003432528,0.0001311047,0.0003377509,0.00009435708,0.00001944992],"category_scores_gemma":[0.00003153366,0.0001268878,0.00006697465,0.0003936064,0.00005640966,0.001446013,0.000007748404,0.000244881,0.00004622906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008178765,"about_ca_system_score_gemma":0.00003993618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004167631,"about_ca_topic_score_gemma":0.00007606457,"domain_scores_codex":[0.9989632,0.00009904148,0.0004220332,0.0001415457,0.0001423318,0.000231832],"domain_scores_gemma":[0.9987079,0.0005639244,0.0001003911,0.0003935909,0.0001513077,0.0000829179],"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.0002962455,0.0001780276,0.00004684549,0.0000610344,0.00004452581,9.875237e-7,0.01191145,0.02111581,0.0003918012,0.2443221,0.0002436916,0.7213875],"study_design_scores_gemma":[0.005171908,0.0004737086,0.003249351,0.000365656,0.00004308635,0.00005045742,0.001819812,0.7798545,0.1539122,0.03243186,0.02120891,0.001418557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02295917,0.00003466116,0.9747583,0.0004162883,0.0004271464,0.0003570656,0.000005381213,0.0001249198,0.000917042],"genre_scores_gemma":[0.9903883,0.0002161715,0.008071115,0.001095379,0.00001636342,0.00005537373,0.000004100756,0.000005624775,0.0001475558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9674292,"threshold_uncertainty_score":0.5174333,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008571407,0.0001194864,0.0001207639,0.0004584196,0.0003642064,0.0001310927,0.0003645141,0.00006791636,0.00002499157],"category_scores_gemma":[0.0000479137,0.0001192321,0.00007366317,0.001079284,0.0000160098,0.001239985,0.00000178459,0.0002456164,0.000060655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001442772,"about_ca_system_score_gemma":0.00003684396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.707767e-7,"about_ca_topic_score_gemma":0.000007031877,"domain_scores_codex":[0.9990484,0.0001305038,0.0003431574,0.0001203609,0.0001558762,0.0002017406],"domain_scores_gemma":[0.998691,0.0006711858,0.0001097467,0.0003669561,0.0001131295,0.00004795943],"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.00008076928,0.00005949377,7.29371e-7,0.000002925307,0.000005424006,9.677875e-8,0.0008468637,0.201337,0.00001324073,0.2359505,0.00133428,0.5603687],"study_design_scores_gemma":[0.001041121,0.0004590991,0.0002393802,0.0001067413,0.000007309063,0.000004569409,0.0001217009,0.9668459,0.002288647,0.02207792,0.006527656,0.0002799137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004354136,0.0000206661,0.992286,0.000516352,0.001368753,0.0003501943,0.000002486124,0.0001696802,0.004850415],"genre_scores_gemma":[0.9921335,0.0001178996,0.004701131,0.002716468,0.00002810293,0.00006437841,0.000005019194,0.000004071783,0.0002294264],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9916981,"threshold_uncertainty_score":0.4862146,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005650203,0.0002799231,0.0002587357,0.0001341844,0.001475856,0.0002528538,0.0007213908,0.00006745871,0.00002198663],"category_scores_gemma":[0.000009103613,0.000242541,0.0001025873,0.0007611904,0.0001390625,0.0001523396,0.00002283585,0.0003051184,0.00004596293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000144145,"about_ca_system_score_gemma":0.00007857921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002289909,"about_ca_topic_score_gemma":0.00006148602,"domain_scores_codex":[0.9981275,0.0001815983,0.0003859159,0.0006105826,0.0002008231,0.0004936116],"domain_scores_gemma":[0.9979382,0.000493601,0.0001395759,0.000729951,0.000575358,0.0001233343],"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.000036839,0.0002097398,0.00001375508,0.000006643451,0.00004737965,9.871502e-7,0.002230219,0.6373525,0.0002649946,0.001472657,0.00004483663,0.3583194],"study_design_scores_gemma":[0.000856852,0.0007223054,0.00006113148,0.0001706757,0.00001549185,0.000005835068,0.0001217108,0.987036,0.007971344,0.000005204639,0.002721931,0.0003114923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01308436,0.0002059946,0.9837743,0.000117592,0.0009017491,0.001024236,0.000002486634,0.0003274315,0.0005618293],"genre_scores_gemma":[0.957207,0.00007884223,0.04188072,0.0002724561,0.0002170731,0.0001453991,0.000002523308,0.00002701169,0.0001689511],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9441227,"threshold_uncertainty_score":0.9998241,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004108372,0.0002035291,0.0002477249,0.0005332222,0.001852134,0.0002757321,0.001653463,0.00009776672,0.00004686672],"category_scores_gemma":[0.00001680094,0.0002091005,0.0001100024,0.002132689,0.0003008907,0.0007188249,0.00005748813,0.0003781513,0.00005701387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001065007,"about_ca_system_score_gemma":0.00006654181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000295864,"about_ca_topic_score_gemma":0.0002066481,"domain_scores_codex":[0.9982938,0.0004571157,0.0004191866,0.0003753274,0.0002109179,0.0002436962],"domain_scores_gemma":[0.995708,0.0004110252,0.0001700844,0.003119945,0.0004657557,0.0001251153],"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.00004888529,0.001019484,0.000959478,0.00003788603,0.001481785,0.000001636924,0.009484978,0.8434852,0.001064351,0.02339372,0.0007183082,0.1183043],"study_design_scores_gemma":[0.0002709609,0.0001050477,0.0009876445,0.00005649364,0.000116028,0.000005374598,0.0001917445,0.9949922,0.0006713956,0.00001104184,0.002350537,0.0002415405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004952641,0.000528313,0.9894031,0.001698959,0.0003216941,0.0002952202,0.00001054227,0.0002824139,0.002507156],"genre_scores_gemma":[0.9178594,0.003714374,0.07774118,0.0001767361,0.00001612503,0.0001288905,0.000009603924,0.00001559241,0.0003380717],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9129068,"threshold_uncertainty_score":0.9994473,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006401837,0.0002449543,0.0003041312,0.000227672,0.001482878,0.0001536611,0.004077965,0.0001120635,0.00001389961],"category_scores_gemma":[0.00002177843,0.0002006206,0.0001733327,0.001084974,0.0002790646,0.0003181585,0.00002911399,0.000878292,0.00005073175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000130173,"about_ca_system_score_gemma":0.00008736573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004579766,"about_ca_topic_score_gemma":0.0001214115,"domain_scores_codex":[0.9975861,0.0009027889,0.0005676112,0.0003214428,0.0003424664,0.0002796428],"domain_scores_gemma":[0.9929191,0.001404478,0.0002506284,0.005012861,0.0003103156,0.0001025432],"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.00002559855,0.002048573,0.00001275652,0.00001881672,0.0001166961,0.000001115781,0.004157697,0.02932282,0.01773216,0.7897733,0.0004860846,0.1563043],"study_design_scores_gemma":[0.0007139706,0.0002323866,0.00045041,0.0004409919,0.00003357274,0.0000139811,0.0002884759,0.984527,0.01120969,0.0005055285,0.001136778,0.0004471973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04700839,0.0003817779,0.9432101,0.006878572,0.0002994565,0.0005205452,0.00001533455,0.0002636475,0.001422225],"genre_scores_gemma":[0.9930725,0.002303537,0.003656107,0.0006146254,0.00001085328,0.00013009,0.000002925461,0.00001602689,0.0001933364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9552042,"threshold_uncertainty_score":0.9998171,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005109726,0.0002946043,0.0003007982,0.0004052396,0.0008072726,0.0001997531,0.003484499,0.0001848589,0.00003449335],"category_scores_gemma":[0.000008684236,0.000320873,0.0001398145,0.001698767,0.0001432615,0.0007732498,0.00003439644,0.001024886,0.00007862987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000229396,"about_ca_system_score_gemma":0.0001038831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001961323,"about_ca_topic_score_gemma":0.0006143244,"domain_scores_codex":[0.9976297,0.000596206,0.0006266037,0.0004746875,0.0002559694,0.0004168575],"domain_scores_gemma":[0.9948466,0.0003827807,0.0001603929,0.004226428,0.0002333945,0.0001503689],"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.00005171961,0.004652202,0.0002016175,0.000007874622,0.00008539926,0.000007352769,0.004286262,0.125313,0.006296297,0.2635931,0.0006727233,0.5948325],"study_design_scores_gemma":[0.001222641,0.0001424153,0.004472136,0.0001775551,0.0000125464,0.00001183148,0.00009354028,0.9870802,0.001915948,0.0001410441,0.004152162,0.0005779832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007252885,0.0004186186,0.9816795,0.00811523,0.0002731052,0.0004591276,0.000003364323,0.0003970301,0.001401152],"genre_scores_gemma":[0.9738058,0.005093584,0.01891669,0.001332391,0.00001258927,0.0001573663,0.00001160029,0.00002307505,0.0006468397],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.966553,"threshold_uncertainty_score":0.9999244,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001508956,0.00006161902,0.00005878038,0.00006209518,0.0001044246,0.0001059573,0.0002336661,0.00003177795,0.00003528813],"category_scores_gemma":[0.00001435206,0.00005593784,0.0000139778,0.0006983379,0.000008304422,0.0001997358,0.00005688212,0.0001080106,0.00002164202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006563959,"about_ca_system_score_gemma":0.00001511164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002453473,"about_ca_topic_score_gemma":0.0007264819,"domain_scores_codex":[0.999436,0.00008753879,0.0001384417,0.0001521804,0.00006603827,0.0001198224],"domain_scores_gemma":[0.9996345,0.00006555864,0.00002321556,0.0002025439,0.00005725129,0.0000169111],"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.000002814511,0.00005957598,0.0008746875,2.931494e-7,8.52019e-7,5.605086e-7,0.00001208783,0.1127596,0.0001888287,0.8674904,0.005320869,0.01328937],"study_design_scores_gemma":[0.0001977876,0.00002982655,0.01274218,0.000007216749,3.101395e-7,0.000001228074,8.612583e-7,0.9835913,0.0003344867,0.000897377,0.002120071,0.00007742513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01083424,0.00004074313,0.9807265,0.0008125998,0.00007440333,0.00008721847,1.675589e-7,0.0001309493,0.007293136],"genre_scores_gemma":[0.9971928,0.00003692211,0.002028854,0.000328126,0.00003586406,0.00001194933,0.00002044901,0.000002570059,0.0003424364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9863586,"threshold_uncertainty_score":0.2281079,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002179591,0.0001416329,0.0002160876,0.00055304,0.001089449,0.00007016221,0.0007800552,0.0001383163,0.00001244187],"category_scores_gemma":[0.000008665055,0.0001422768,0.00009845752,0.00169844,0.0001141144,0.0003323763,0.0000292231,0.0002554142,0.000002671382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005576125,"about_ca_system_score_gemma":0.00001735029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001930799,"about_ca_topic_score_gemma":0.00002380368,"domain_scores_codex":[0.9991248,0.00009054689,0.00019703,0.0003179898,0.000104106,0.0001655356],"domain_scores_gemma":[0.9987034,0.00006578884,0.00007366761,0.000844481,0.0002673984,0.00004523719],"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.00002896799,0.0002732212,0.0001808149,0.000007971935,0.0004020019,0.000001737132,0.0006343455,0.7098375,0.00052245,0.01547262,0.00004652583,0.2725919],"study_design_scores_gemma":[0.0004686461,0.0003235404,0.0004039232,0.00002308262,0.0001210989,0.000007413408,0.00003664981,0.9866152,0.01120083,0.0002471149,0.0003616107,0.0001908703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03019583,0.0003069034,0.9635566,0.0052858,0.00003877981,0.0002828896,0.000003001818,0.0002745348,0.0000556456],"genre_scores_gemma":[0.9326169,0.001447915,0.06541893,0.0003945213,0.000003560278,0.00004584531,0.000005745412,0.00000425532,0.00006235551],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9024211,"threshold_uncertainty_score":0.8379271,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004246287,0.0001642139,0.0002406869,0.00005194241,0.0006964003,0.0004950344,0.002122936,0.00007864759,0.00000434474],"category_scores_gemma":[0.00001715274,0.0001648683,0.00007617779,0.0002036551,0.00004992973,0.0002770035,0.0004463174,0.0002188354,0.00008181881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001598525,"about_ca_system_score_gemma":0.00004499333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001581203,"about_ca_topic_score_gemma":0.0003900086,"domain_scores_codex":[0.9985793,0.0002186502,0.0002895305,0.000359477,0.0001724925,0.0003805713],"domain_scores_gemma":[0.9975065,0.00008565233,0.000198224,0.002063153,0.00005746168,0.00008902462],"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.0001877264,0.0006395101,0.01413049,0.0002217384,0.0003003179,0.002341074,0.003307777,0.272621,0.01167377,0.05070861,0.02130717,0.6225609],"study_design_scores_gemma":[0.001197807,0.00008018344,0.02198751,0.0005579277,0.00001032681,0.00007571263,0.00001048622,0.9515281,0.0005187716,0.0007161811,0.02268796,0.0006289943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4457026,0.006979629,0.4946621,0.001654186,0.0166772,0.001135895,0.000004734418,0.0009250343,0.03225858],"genre_scores_gemma":[0.997719,0.0002495053,0.001128709,0.0001757694,0.000383034,0.00002978052,0.000002397351,0.00001377089,0.0002979589],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6789072,"threshold_uncertainty_score":0.6723136,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0001838493,0.0001349855,0.000212844,0.0002141143,0.00412206,0.00002996748,0.001547232,0.00006649474,0.00001875303],"category_scores_gemma":[0.000006545133,0.000105754,0.0001105458,0.003667724,0.0004149906,0.0002780345,0.0001450396,0.0004312589,0.000001772589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005521597,"about_ca_system_score_gemma":0.00008178234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007423179,"about_ca_topic_score_gemma":0.002667518,"domain_scores_codex":[0.9987836,0.0004030849,0.0002372964,0.0002259501,0.000203727,0.0001463048],"domain_scores_gemma":[0.9972368,0.0003849398,0.0001422372,0.001767084,0.0004065087,0.00006243023],"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.00003281776,0.0004106915,0.007574828,0.000003322244,0.001099831,4.709599e-7,0.005767684,0.9530663,0.0002019826,0.02020696,0.00007860723,0.01155644],"study_design_scores_gemma":[0.0002857874,0.00006878916,0.017179,0.00002615337,0.0002506353,0.0000109849,0.00006239648,0.9810417,0.0007633076,0.00000791072,0.0001467041,0.000156618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1323246,0.0001079343,0.8660533,0.0009650261,0.00004836166,0.0001536949,0.000004664744,0.00006951606,0.0002728393],"genre_scores_gemma":[0.9895931,0.002975165,0.006986451,0.0002148975,0.000003436234,0.00004400679,0.000002920622,0.000007918123,0.0001720804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8590668,"threshold_uncertainty_score":0.9971744,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005133623,0.0001607071,0.0001306709,0.00008539805,0.003732039,0.00009521621,0.003088156,0.00006898971,0.00007463556],"category_scores_gemma":[0.00001152949,0.00009659596,0.00006996108,0.001061045,0.0004677356,0.0002945004,0.00007514474,0.001304426,0.00002915601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003864343,"about_ca_system_score_gemma":0.00008768681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002474132,"about_ca_topic_score_gemma":0.001205516,"domain_scores_codex":[0.9988061,0.0003768403,0.0001992832,0.0002026627,0.0002363725,0.0001787813],"domain_scores_gemma":[0.9956089,0.00110883,0.0001302366,0.002728543,0.0003721734,0.00005129058],"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.0001845463,0.002647391,0.0007075766,0.00001297009,0.0004378914,4.813218e-7,0.006889758,0.5772837,0.008646047,0.3312107,0.003315056,0.06866392],"study_design_scores_gemma":[0.0003317888,0.0004052887,0.0006042416,0.00005344386,0.00002949409,0.00000910662,0.0001119775,0.9889361,0.005823275,0.00002313035,0.003474162,0.0001980453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.183362,0.00007767109,0.8001705,0.01322848,0.0001998553,0.0004835202,0.000004493301,0.0001212825,0.002352137],"genre_scores_gemma":[0.9930869,0.0009227099,0.00484724,0.0005813981,0.00001429677,0.0001009937,0.000001732657,0.00001025793,0.0004344168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8097249,"threshold_uncertainty_score":0.997565,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000724319,0.0001996802,0.000214836,0.0001213315,0.001572036,0.0002345612,0.001853653,0.0001242932,0.00002130873],"category_scores_gemma":[0.00002516003,0.0002097286,0.0001033292,0.0005603184,0.0002672707,0.0004900047,0.0000478275,0.0006525584,0.00001153483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000508588,"about_ca_system_score_gemma":0.00009147606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008598093,"about_ca_topic_score_gemma":0.000733073,"domain_scores_codex":[0.9985593,0.000221258,0.0003852064,0.0003919194,0.0001462295,0.0002960841],"domain_scores_gemma":[0.9954607,0.0008601241,0.0001303372,0.003100193,0.0003113712,0.000137198],"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.00003404759,0.0008122447,0.000128216,0.00003015378,0.0001104525,3.341763e-7,0.002241839,0.007560499,0.01576483,0.7250157,0.0007669031,0.2475348],"study_design_scores_gemma":[0.001193244,0.00023055,0.001430553,0.0001077845,0.00005611349,0.00001968503,0.00009074864,0.9575456,0.004179566,0.00837661,0.02597809,0.0007914929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008831508,0.0001154356,0.9814,0.007312533,0.0004344301,0.0007338122,0.00001458508,0.0002772926,0.0008804204],"genre_scores_gemma":[0.8674789,0.0007995541,0.1306915,0.0004464958,0.00002366361,0.0004091003,0.00001063817,0.00001725959,0.0001228773],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9499851,"threshold_uncertainty_score":0.9997278,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001652467,0.0008063948,0.0008235904,0.0003521981,0.001061442,0.001128789,0.003431164,0.0002774626,0.0001452365],"category_scores_gemma":[0.0001446009,0.000760299,0.0001429149,0.002092281,0.0002892253,0.001707674,0.001107019,0.00139812,0.00003118421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004828518,"about_ca_system_score_gemma":0.0003714325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008491967,"about_ca_topic_score_gemma":0.00002123998,"domain_scores_codex":[0.9945478,0.00005300409,0.00125772,0.001456331,0.001239407,0.00144578],"domain_scores_gemma":[0.9961883,0.0001771898,0.0009712044,0.0004101265,0.00185242,0.000400793],"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.0003322356,0.0002071098,0.04056981,0.00003603576,0.00009440529,0.00003790928,0.0006742564,0.0006908235,0.0003346191,0.9472737,0.005726256,0.004022846],"study_design_scores_gemma":[0.002719935,0.0006887888,0.005810969,0.003598193,0.0000170526,0.000244356,0.0002262632,0.9796234,0.0002125945,0.002306412,0.003203073,0.001348963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04637968,0.00008334381,0.3656337,0.009281252,0.002003716,0.0819049,0.00002141846,0.00388831,0.4908037],"genre_scores_gemma":[0.9673276,0.0004690644,0.009994652,0.00115417,0.001033797,0.01931573,0.00002868566,0.000083657,0.0005926429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9789326,"threshold_uncertainty_score":0.9999081,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001253219,0.0003042019,0.0003357228,0.0003925537,0.002047742,0.0002625905,0.003907862,0.0001633827,0.00001933401],"category_scores_gemma":[0.00001422062,0.000327932,0.0002257862,0.001206434,0.0002256043,0.0005925199,0.00005161652,0.0006444445,0.00006159544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001983948,"about_ca_system_score_gemma":0.0001197858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001242762,"about_ca_topic_score_gemma":0.0003268667,"domain_scores_codex":[0.9977675,0.0002617498,0.0006527675,0.0004822186,0.0002795186,0.0005562275],"domain_scores_gemma":[0.9936051,0.001677498,0.0002065704,0.003836704,0.0004586283,0.0002154652],"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.00006476779,0.0009494008,0.00001450299,0.00003329521,0.0001387623,0.000002695044,0.003023458,0.00434692,0.01448783,0.274215,0.0006771216,0.7020463],"study_design_scores_gemma":[0.002411836,0.0003204604,0.000159503,0.0003635559,0.00006940304,0.00004119934,0.0005197563,0.8280191,0.1259299,0.00100839,0.03981188,0.001344983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006227449,0.000256365,0.9863272,0.003653165,0.0008433251,0.0007428856,0.00001779724,0.0005257765,0.001406],"genre_scores_gemma":[0.9632247,0.002502722,0.03244502,0.0006234198,0.00005520017,0.0003564317,0.00001583595,0.00004228665,0.0007343547],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9569973,"threshold_uncertainty_score":0.9999173,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005590015,0.000130694,0.0001524811,0.00006533624,0.000612765,0.0001759547,0.0008059012,0.00005828515,0.00008715588],"category_scores_gemma":[0.0001008773,0.0001189959,0.00006330548,0.000343481,0.00003224309,0.0002948749,0.0002436839,0.0002337703,0.00004363574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002814634,"about_ca_system_score_gemma":0.00004027519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003016668,"about_ca_topic_score_gemma":0.0001484404,"domain_scores_codex":[0.9989551,0.0000585508,0.0002354628,0.0002951826,0.0001362063,0.000319548],"domain_scores_gemma":[0.9984499,0.0005764986,0.00008116696,0.0006467068,0.0001570771,0.00008869305],"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.000012307,0.00003586598,0.0001011034,0.000003457105,0.000008187453,7.109597e-7,0.0001480177,0.0008514757,0.0031631,0.8899282,0.0155943,0.09015332],"study_design_scores_gemma":[0.0006725487,0.0001243226,0.0004383286,0.00004853898,0.000004120418,0.00001172892,0.00001517543,0.7696909,0.001165487,0.005206286,0.2223247,0.000297853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01038246,0.00009102689,0.9652506,0.001148544,0.0007937031,0.0002861455,0.000001139617,0.0002201154,0.02182632],"genre_scores_gemma":[0.7939485,0.0001096205,0.2036656,0.001613623,0.0001631104,0.00003871472,0.000007698958,0.00001106509,0.00044204],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8847219,"threshold_uncertainty_score":0.4852512,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005452153,0.0001885602,0.0003363077,0.0005953644,0.0005834286,0.0000606312,0.001802367,0.0001242744,0.00005352026],"category_scores_gemma":[0.00001190436,0.0001976594,0.0002026338,0.004273118,0.0001677479,0.0005024291,0.00003701015,0.001034413,0.00001491452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006523862,"about_ca_system_score_gemma":0.00006928065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004010799,"about_ca_topic_score_gemma":0.002904256,"domain_scores_codex":[0.9983376,0.0003329265,0.0005048853,0.0003194532,0.0002427024,0.0002624287],"domain_scores_gemma":[0.9958175,0.0006661513,0.0002020248,0.002999151,0.0002346423,0.00008047042],"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.00001160521,0.0004029608,0.0009599856,0.000002146005,0.0001696472,1.130217e-7,0.0005236481,0.9472959,0.001886929,0.006632587,0.0000527836,0.04206169],"study_design_scores_gemma":[0.0002454037,0.00003646536,0.03184788,0.00002200214,0.00009080433,0.000001337404,0.000009743393,0.9660821,0.0006074522,0.00009335743,0.000780294,0.0001831453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1575547,0.00008800304,0.8391085,0.0009147626,0.0003822855,0.0002515568,0.000008331139,0.0001482825,0.001543656],"genre_scores_gemma":[0.9828804,0.0009503057,0.01569162,0.0001113504,0.00003304183,0.0001301826,0.00002562088,0.00001432954,0.000163127],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8253258,"threshold_uncertainty_score":0.8060315,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005945592,0.000151606,0.000132916,0.00009753829,0.0005564495,0.0003796534,0.0003536939,0.00007138895,0.000008139936],"category_scores_gemma":[0.00002684452,0.0001454597,0.00004250337,0.0003366364,0.00006705883,0.0006106315,0.00006746111,0.0004153785,0.000003919212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003468819,"about_ca_system_score_gemma":0.00004656256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003236401,"about_ca_topic_score_gemma":0.00002788181,"domain_scores_codex":[0.9989062,0.00007378739,0.0002435092,0.0003711946,0.0001455985,0.0002597096],"domain_scores_gemma":[0.9992406,0.0001001119,0.0001465035,0.0002494043,0.0001818326,0.00008154132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001815256,0.00004065171,0.0001496983,0.00002033593,0.0000170631,0.000001174371,0.0009906687,0.03060587,0.748997,0.002713031,0.004018484,0.2124279],"study_design_scores_gemma":[0.0004128639,0.00005377464,0.0005647971,0.00005705141,0.000008562259,0.00002387864,0.000006320152,0.9853513,0.009957409,0.00008719548,0.003234955,0.0002419453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1102817,0.0001754693,0.8829154,0.005809604,0.0003539736,0.0002038246,2.106861e-7,0.0001544835,0.0001053998],"genre_scores_gemma":[0.9603418,0.00001577294,0.03621256,0.003086487,0.0002196654,0.00004778605,0.000002885895,0.0000166563,0.00005642441],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9547454,"threshold_uncertainty_score":0.5931674,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006968128,0.0002377474,0.0003582829,0.0004444478,0.0009390143,0.000163482,0.003301215,0.0001113398,0.00000864938],"category_scores_gemma":[0.000132473,0.0002095327,0.00006109755,0.003699865,0.0001721085,0.0006072017,0.0003194751,0.001893905,0.00001131342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003706196,"about_ca_system_score_gemma":0.0003329287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000191594,"about_ca_topic_score_gemma":0.0009729561,"domain_scores_codex":[0.9973502,0.000893157,0.0007140351,0.0002685987,0.0003162053,0.0004577829],"domain_scores_gemma":[0.9961464,0.0008536375,0.0003345608,0.002030265,0.0004764136,0.0001587467],"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.00104524,0.007357578,0.2334548,0.00002707391,0.0004630447,0.0006595704,0.01450854,0.517966,0.004079217,0.1102619,0.009726391,0.1004506],"study_design_scores_gemma":[0.003555315,0.0002956029,0.1014432,0.0008590783,0.00001103303,0.001124579,0.0001076328,0.8863272,0.0002841904,0.0001934627,0.005115605,0.0006830782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4614034,0.001361085,0.5278465,0.006479537,0.0002502738,0.000499056,0.000004311575,0.0002323114,0.001923567],"genre_scores_gemma":[0.9695249,0.01083939,0.01915397,0.0003061014,0.00004169469,0.00004092747,0.00002598941,0.00002052111,0.00004652247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5086924,"threshold_uncertainty_score":0.8544496,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001300592,0.0002513256,0.0002997696,0.0002550309,0.0008078063,0.0002430195,0.005026893,0.0001557584,0.00002148097],"category_scores_gemma":[0.00004281761,0.0002738738,0.00008033913,0.001567436,0.0002243642,0.001848532,0.001316379,0.0007385642,0.0001006261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002152463,"about_ca_system_score_gemma":0.00008566761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004298299,"about_ca_topic_score_gemma":0.0005651914,"domain_scores_codex":[0.9970803,0.001211332,0.0006532872,0.0002792113,0.0002208606,0.000555051],"domain_scores_gemma":[0.9930236,0.0005960206,0.0002199719,0.005714667,0.0002592347,0.0001864966],"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.000006773497,0.000781228,0.01178314,0.000008082515,0.0000288487,5.283426e-7,0.003502025,0.001368953,0.002229073,0.8461893,0.001358636,0.1327434],"study_design_scores_gemma":[0.000782943,0.00002650093,0.01736029,0.0001658611,0.00001196489,0.00001811268,0.0001460191,0.963201,0.0009207227,0.0003589515,0.0163716,0.000636029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.106574,0.0112358,0.8550136,0.007805365,0.0007336887,0.001014789,0.000004413207,0.0007428709,0.01687543],"genre_scores_gemma":[0.9729083,0.01331538,0.01249864,0.0006770844,0.00006921481,0.0002829556,0.00006907909,0.00002674763,0.0001525781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.961832,"threshold_uncertainty_score":0.9999713,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002305609,0.0001996614,0.0002572838,0.0004664478,0.004211997,0.0001112774,0.001584877,0.00008265655,0.00005405753],"category_scores_gemma":[0.000005496441,0.0002130941,0.0001117469,0.002066427,0.0003063014,0.001011206,0.0001504019,0.0004256596,0.00001189162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009706865,"about_ca_system_score_gemma":0.00005715146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000475098,"about_ca_topic_score_gemma":0.0001752885,"domain_scores_codex":[0.9985918,0.0003208927,0.0002926589,0.0003371905,0.0002262207,0.0002312167],"domain_scores_gemma":[0.9974059,0.0002817454,0.0001148407,0.00182175,0.0002524219,0.0001232769],"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.00001770519,0.0003789882,0.002259515,0.0000072094,0.0004041838,0.000001795962,0.007519659,0.9558412,0.0001457651,0.002802134,0.00006681429,0.03055496],"study_design_scores_gemma":[0.000354653,0.00006183289,0.003167964,0.00002231833,0.00008434438,0.00001186309,0.00004945548,0.9947248,0.001069931,0.000006115364,0.0001919795,0.0002547189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08082145,0.0001802536,0.9171991,0.0007407163,0.0001145762,0.0001918967,0.00001092936,0.0001928825,0.0005482072],"genre_scores_gemma":[0.9689818,0.01394074,0.01641344,0.0002759918,0.00001061576,0.00005693378,0.00001428463,0.00001059008,0.0002955797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9007856,"threshold_uncertainty_score":0.9970844,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004021995,0.0001021079,0.0001427047,0.0000866572,0.0005886517,0.00003694147,0.001329573,0.00003365102,0.000008729843],"category_scores_gemma":[0.00002372493,0.0000782541,0.00005173367,0.0002690684,0.0006949754,0.0001953478,0.0009721632,0.0002475908,0.000002538331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004626354,"about_ca_system_score_gemma":0.00002591665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006008074,"about_ca_topic_score_gemma":0.00001929789,"domain_scores_codex":[0.9991314,0.0002601256,0.0002234906,0.0001359345,0.0001278389,0.0001212438],"domain_scores_gemma":[0.9974487,0.0007023183,0.0001760155,0.00154418,0.00009813557,0.00003068326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00009015024,0.0007190445,0.3764029,0.00005281198,0.0005260051,0.000001492364,0.0156332,0.007164476,0.1070825,0.4376961,0.01158097,0.04305033],"study_design_scores_gemma":[0.0009304851,0.0002712779,0.9649056,0.0002670783,0.00003873056,0.000021106,0.0003255506,0.02913731,0.002296739,0.0007324222,0.0006319954,0.0004417022],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9848417,0.0002488771,0.006928055,0.006376903,0.00003132256,0.0001481243,0.000005935351,0.0000240208,0.001395076],"genre_scores_gemma":[0.9961494,0.0007426364,0.002482252,0.0005971981,0.000004504388,0.000005627981,0.000003135502,0.000004298764,0.00001095663],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5885027,"threshold_uncertainty_score":0.4527493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}