{"meta":{"query_hash":"f24e9ac26895","filters":{"topic":"Cooperative Communication and Network Coding"},"cohort_total":2341,"direct_labels_cover":3,"predictions_cover":2341,"exported":2341,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/f24e9ac26895","api":"https://metacan.xera.ac/api/v1/cohort?topic=Cooperative+Communication+and+Network+Coding"},"results":[{"id":"W1024519069","doi":"","title":"Exploring spatial reuse effects on performance enhancements in wireless multihop networks","year":2008,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Wireless; Exponential backoff; Transmission (telecommunications); Distributed coordination function; Throughput; Wireless network; Reuse; Frame (networking); Multiple Access with Collision Avoidance for Wireless; Capture effect; Distributed computing; Vehicular ad hoc network; IEEE 802.11; Engineering; Telecommunications","score_opus":0.07503505511965318,"score_gpt":0.2910429239605444,"score_spread":0.21600786884089118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1024519069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9679255,0.00018576227,0.0012668398,0.00012355056,0.0016914174,0.00070376456,5.5467194e-7,0.00014872033,0.027953919],"genre_scores_gemma":[0.9761857,0.013324165,0.000060028487,0.000013998496,0.00032908248,0.000036081943,0.000041795323,0.000037942773,0.009971228],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99574226,0.0011354365,0.00036209918,0.0009898902,0.0008694972,0.0009007966],"domain_scores_gemma":[0.9967127,0.0005673301,0.00020544302,0.001990783,0.0002746464,0.00024911197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005398865,0.0003919939,0.00046161553,0.001594142,0.001156482,0.00020195563,0.003583381,0.00024500722,0.0000064113133],"category_scores_gemma":[0.000092840535,0.00046097685,0.00013780274,0.0021993762,0.00010965112,0.0009986098,0.00089682406,0.0021160878,0.00004219969],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004976887,0.0022553054,0.10721063,0.0014011223,0.00077506504,0.010997561,0.021261748,0.0051762774,0.027750205,0.020647414,0.003141785,0.794406],"study_design_scores_gemma":[0.004513561,0.0023089964,0.58570665,0.0044142697,0.000033419594,0.000028183264,0.00070193724,0.18143307,0.20092739,0.0000451255,0.017540345,0.002347069],"about_ca_topic_score_codex":0.0016012212,"about_ca_topic_score_gemma":0.007925349,"teacher_disagreement_score":0.79205894,"about_ca_system_score_codex":0.0011835323,"about_ca_system_score_gemma":0.0005567846,"threshold_uncertainty_score":0.9997842},"labels":[],"label_agreement":null},{"id":"W109687435","doi":"10.1007/978-1-4614-8397-7_2","title":"Capacity Scaling Laws of Wireless Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Throughput; Scaling law; Benchmark (surveying); Wireless network; Computer science; Wireless; Computer network; Scaling; Distributed computing; Telecommunications; Mathematics; Geography","score_opus":0.015259124410523938,"score_gpt":0.19409961474094278,"score_spread":0.17884049033041885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109687435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017242319,0.0035928185,0.9876555,0.00009736873,0.00030401477,0.00023527033,6.085746e-7,0.00016480817,0.0062253606],"genre_scores_gemma":[0.90087354,0.007896378,0.08398609,0.00046664986,0.0008760448,0.000045366505,0.000008238386,0.00013478474,0.0057129203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840647,0.000026145979,0.0005117563,0.00047955845,0.00020556738,0.00037052055],"domain_scores_gemma":[0.9988966,0.0001921296,0.00013500836,0.00055447983,0.000097434255,0.00012436409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021456381,0.00034615694,0.0005472514,0.00026566035,0.000056662087,0.00011572971,0.00079026073,0.0002425359,0.000014142074],"category_scores_gemma":[0.000008078577,0.00035993257,0.0001028302,0.00021144531,0.00004761272,0.00017557226,0.0006942986,0.0008482017,0.000005981417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021019023,0.000021706188,0.000051124804,0.000047556383,0.000045373796,0.000008361855,0.0001015061,0.013270347,0.00007004498,0.6395933,0.00011758883,0.346671],"study_design_scores_gemma":[0.00018393557,0.000042042982,0.0008384732,0.00035498824,0.0000065254544,0.000013520876,9.019439e-8,0.98881745,0.00007171554,0.0008501506,0.008426958,0.00039413577],"about_ca_topic_score_codex":0.000011142898,"about_ca_topic_score_gemma":0.000004532862,"teacher_disagreement_score":0.97554713,"about_ca_system_score_codex":0.00007865099,"about_ca_system_score_gemma":0.000026644797,"threshold_uncertainty_score":0.99988526},"labels":[],"label_agreement":null},{"id":"W1119726271","doi":"10.1007/s11036-015-0634-z","title":"A Network Coding Scheme to Improve Throughput for IEEE 802.11 WLAN","year":2015,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Linear network coding; Computer network; Network packet; Bottleneck; Throughput; Coding (social sciences); IEEE 802.11; Wireless network; Wireless; Telecommunications; Embedded system; Mathematics","score_opus":0.04601293573124449,"score_gpt":0.30409436418861757,"score_spread":0.2580814284573731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1119726271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008647064,0.0013679217,0.9940801,0.00090160273,0.00023862172,0.0016531067,0.0000045910897,0.00018782893,0.0007014905],"genre_scores_gemma":[0.9124679,0.00065971084,0.072223894,0.0032252618,0.0018713122,0.008905846,0.000032591506,0.00003576959,0.0005777394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870163,0.000046733927,0.00027201656,0.0004752745,0.000115338466,0.00038898565],"domain_scores_gemma":[0.99836004,0.00019816998,0.00009014765,0.00083811313,0.00022507324,0.00028846483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047281594,0.00017140407,0.0002047354,0.000039854458,0.0004898827,0.00025089897,0.00072218204,0.00007621674,0.00000319819],"category_scores_gemma":[0.000015202817,0.00016645931,0.000050357638,0.0006313273,0.00004713168,0.00019713255,0.00037529581,0.00013568625,0.0000148498275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022373746,0.00017988088,0.0011287079,0.0000191304,0.000044303928,6.825241e-7,0.00058287993,0.15319452,0.00075065723,0.51751673,0.09312355,0.23343655],"study_design_scores_gemma":[0.00042093973,0.00011654454,0.00010573868,0.000027642256,0.000008617747,0.000003402567,0.000045827772,0.5400257,0.00004210863,0.0021649667,0.4567688,0.00026969225],"about_ca_topic_score_codex":0.0000056603963,"about_ca_topic_score_gemma":0.0000447094,"teacher_disagreement_score":0.9218562,"about_ca_system_score_codex":0.00004873883,"about_ca_system_score_gemma":0.000054629912,"threshold_uncertainty_score":0.67880136},"labels":[],"label_agreement":null},{"id":"W1144352559","doi":"10.1017/cbo9780511667008.009","title":"Radio resource optimization in cooperative cellular wireless networks","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of British Columbia","funders":"","keywords":"Computer network; Multi-frequency network; Computer science; Wireless network; Wireless; Radio resource management; Bandwidth (computing); Relay; Multipath propagation; Quality of service; Node (physics); MIMO; Fading; Telecommunications; Wi-Fi array; Engineering; Power (physics); Channel (broadcasting)","score_opus":0.03076026173299006,"score_gpt":0.1954625441209212,"score_spread":0.16470228238793114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1144352559","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000061679416,0.0004531339,0.41337967,0.000017349337,0.000088826484,0.0002902277,0.00000607211,0.00011659034,0.585642],"genre_scores_gemma":[0.006097974,0.0017477534,0.0012643485,0.00013755685,0.00008739534,0.0000023684293,0.00006746564,0.00004529233,0.99054986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824274,0.00023458648,0.0003001435,0.0006856332,0.00020792171,0.00032896918],"domain_scores_gemma":[0.9979911,0.0001030349,0.00026082096,0.0012417228,0.00024329768,0.00016003445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023462997,0.0004092483,0.00045395817,0.0002869684,0.00030123827,0.00012042038,0.0019139877,0.00037706867,0.000013073114],"category_scores_gemma":[0.000007081947,0.00049787026,0.00013162132,0.000055306667,0.00019913654,0.00026343763,0.0012826051,0.0008030104,0.000009393006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031350897,0.000015599944,0.0000012554417,0.000010336715,0.00004587078,0.00013558268,0.00023561809,0.013976245,0.000009387265,0.9744099,0.005726473,0.0054024146],"study_design_scores_gemma":[0.00072367454,0.00005801676,0.0000046713667,0.0003058769,0.000037294216,0.000008142954,0.000014494657,0.3149917,0.00014941292,0.000008182022,0.6829927,0.0007058024],"about_ca_topic_score_codex":0.000021757603,"about_ca_topic_score_gemma":0.000006934718,"teacher_disagreement_score":0.9744017,"about_ca_system_score_codex":0.00028671903,"about_ca_system_score_gemma":0.00012408828,"threshold_uncertainty_score":0.9997473},"labels":[],"label_agreement":null},{"id":"W118127315","doi":"10.1002/wcm.1242","title":"Multiple‐frame precoding and multi‐D mapping for BICM over ergodic NAF relay channels","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Precoding; Computer science; Coding gain; Relay; Algorithm; Diversity gain; Ergodic theory; Topology (electrical circuits); Telecommunications; MIMO; Channel (broadcasting); Fading; Decoding methods; Mathematics; Physics; Power (physics)","score_opus":0.09747333975801883,"score_gpt":0.3006154596127354,"score_spread":0.20314211985471656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118127315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21041922,0.0057545486,0.7820498,0.00023011338,0.00022941582,0.00077879487,0.0000033004394,0.00025228743,0.000282513],"genre_scores_gemma":[0.784769,0.0036748664,0.21111386,0.0001634156,0.00003764332,0.0001595272,0.00001002556,0.000019502786,0.00005217908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983824,0.00023621845,0.00046742323,0.00045984756,0.00009824484,0.00035587107],"domain_scores_gemma":[0.996724,0.0008969725,0.00028821515,0.0017604374,0.00018930815,0.00014108604],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007209235,0.00023136784,0.0002940944,0.00018388349,0.0013953112,0.0002509085,0.0015769157,0.000100474164,0.0000038342505],"category_scores_gemma":[0.0000917802,0.00023840212,0.000070458016,0.00037821324,0.00020942051,0.00039421575,0.0027001207,0.0003233578,0.000002673439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009692659,0.00027874293,0.008347945,0.00007988984,0.000076111384,8.239689e-7,0.025808277,0.00014529885,0.0036564474,0.03902575,0.00010798889,0.92246306],"study_design_scores_gemma":[0.0007713412,0.000071159324,0.003679971,0.00023043175,0.000009417892,0.000014403756,0.0003626363,0.9820605,0.00025066844,0.00015792123,0.012067051,0.00032453364],"about_ca_topic_score_codex":0.00003503086,"about_ca_topic_score_gemma":0.000037162135,"teacher_disagreement_score":0.9819152,"about_ca_system_score_codex":0.00003980333,"about_ca_system_score_gemma":0.000038095124,"threshold_uncertainty_score":0.99990475},"labels":[],"label_agreement":null},{"id":"W1189764912","doi":"10.1007/s11277-015-3013-y","title":"Optimal Power Allocation and Relay Selection in Multi-hop Cognitive Relay Networks","year":2015,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Computer science; Hop (telecommunications); Computer network; Selection (genetic algorithm); Correctness; Dual (grammatical number); Cognitive radio; Transmission (telecommunications); Cognitive network; Power (physics); Telecommunications; Wireless; Algorithm; Artificial intelligence","score_opus":0.08354855680645877,"score_gpt":0.32358121562919767,"score_spread":0.2400326588227389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1189764912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2765826,0.0061652516,0.706487,0.007689157,0.00013413251,0.00057183456,0.0000043122195,0.00028513948,0.0020805914],"genre_scores_gemma":[0.9640312,0.002129514,0.0330434,0.00038429134,0.00001784937,0.00011694726,0.000035099456,0.00001654731,0.00022515788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981855,0.0006469807,0.00033727314,0.00035518061,0.00020669932,0.0002683458],"domain_scores_gemma":[0.9981109,0.00040191336,0.00013626965,0.00071086973,0.00046927444,0.00017081143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084148353,0.00018460919,0.00019744235,0.00018714367,0.00046341022,0.0001791377,0.001149563,0.00012262045,0.000008298679],"category_scores_gemma":[0.00015580235,0.00020014738,0.00004357096,0.0009257752,0.00021658196,0.00067285105,0.0009355459,0.0006461913,0.00002247031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003648435,0.0043396764,0.07882711,0.000043850436,0.00043366806,0.000021408385,0.18119025,0.058348294,0.0038999885,0.39524364,0.0048880465,0.27239922],"study_design_scores_gemma":[0.00091504224,0.00007303531,0.015601486,0.000090859794,0.000008612702,0.000024525329,0.0011599353,0.9801533,0.000028594375,0.000020066795,0.0016775538,0.00024697094],"about_ca_topic_score_codex":0.000052756106,"about_ca_topic_score_gemma":0.0007778036,"teacher_disagreement_score":0.921805,"about_ca_system_score_codex":0.00017631956,"about_ca_system_score_gemma":0.00016432234,"threshold_uncertainty_score":0.8161773},"labels":[],"label_agreement":null},{"id":"W138337706","doi":"10.1007/978-3-642-33860-1_10","title":"Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Randomized algorithm; Wireless sensor network; Probabilistic logic; Locality; Cellular automaton; Set (abstract data type); Algorithm; Automaton; Theoretical computer science; Distributed computing; Artificial intelligence; Computer network","score_opus":0.03956445200174695,"score_gpt":0.2819148690352345,"score_spread":0.24235041703348753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138337706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024630885,0.0038926348,0.9926162,0.0002653291,0.0016732729,0.00083690917,0.000003333082,0.0002950618,0.00039262333],"genre_scores_gemma":[0.18457323,0.00015429094,0.812402,0.0014494755,0.0010618034,0.000099089026,0.0000404514,0.000060967748,0.00015865703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706,0.000076243305,0.0005087788,0.0010692026,0.00053984753,0.00074592186],"domain_scores_gemma":[0.9968506,0.0007836648,0.00031336088,0.0015234528,0.00033226816,0.00019666372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012965599,0.00049283856,0.00047464058,0.0005359209,0.0005423188,0.00048556394,0.0025684703,0.0003340755,0.000025128826],"category_scores_gemma":[0.00004590631,0.00047587827,0.0001669907,0.0005274086,0.0003045644,0.0005269868,0.00088257674,0.0006991864,0.000016669732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002861055,0.00002230758,0.000023453782,0.000017031503,0.000005898132,0.0000060753987,0.00027822214,0.36462426,0.000113048285,0.0034928354,0.000026258549,0.6313877],"study_design_scores_gemma":[0.0002854914,0.00010781434,0.00003672444,0.000302169,0.000008577447,0.000009614569,1.5532449e-7,0.98850423,0.0011020508,0.0028780552,0.0062281075,0.00053702213],"about_ca_topic_score_codex":0.0000017081678,"about_ca_topic_score_gemma":0.000004491327,"teacher_disagreement_score":0.63085073,"about_ca_system_score_codex":0.0002866699,"about_ca_system_score_gemma":0.00023421306,"threshold_uncertainty_score":0.9997693},"labels":[],"label_agreement":null},{"id":"W1447941052","doi":"10.71781/10041","title":"Gestion des ressources dans les réseaux cellulaires sans fil","year":2013,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Political science","score_opus":0.1265209821013548,"score_gpt":0.3337200450277043,"score_spread":0.20719906292634951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1447941052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7983377,0.012789788,0.032657526,0.0022723263,0.0011051099,0.0013218535,0.000028389431,0.000019025847,0.15146826],"genre_scores_gemma":[0.8583151,0.007788546,0.045246635,0.00006391739,0.00019475656,0.00014373018,0.0005863203,0.000046627752,0.08761437],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970391,0.00080446457,0.00058889703,0.0007874561,0.00033918233,0.0004409172],"domain_scores_gemma":[0.99732834,0.0003736929,0.00039937728,0.0011270285,0.00057866995,0.00019288917],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000628574,0.00043909048,0.00041549568,0.00013580319,0.001909702,0.002458763,0.0037038375,0.00035708194,0.0056413],"category_scores_gemma":[0.00019486215,0.00044065033,0.0001283744,0.00055888796,0.0003386344,0.0012489094,0.0007786796,0.00059599604,0.0015221258],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001676768,0.00013179274,0.00079597166,0.000036765137,0.00004605589,0.0000081193875,0.09644403,0.0008600783,0.010370928,0.001656717,0.0011214761,0.8885113],"study_design_scores_gemma":[0.0009769304,0.0003872496,0.06334193,0.004795934,0.00018684442,0.00003618204,0.01469571,0.29917142,0.0857292,0.0007860566,0.5279061,0.0019863988],"about_ca_topic_score_codex":0.0023273902,"about_ca_topic_score_gemma":0.022782957,"teacher_disagreement_score":0.8865249,"about_ca_system_score_codex":0.00019633581,"about_ca_system_score_gemma":0.0002511719,"threshold_uncertainty_score":0.99980456},"labels":[],"label_agreement":null},{"id":"W1479649428","doi":"10.1007/978-3-642-29222-4_29","title":"A Multi-objective Optimization Approach for Designing Multihop Cellular Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Quality of service; Software deployment; Network topology; Distributed computing; Computer network; Throughput; A priori and a posteriori; Network planning and design; Cellular network; Greedy algorithm; Mathematical optimization; Key (lock); Wireless; Mathematics; Algorithm; Computer security; Telecommunications","score_opus":0.041608620739039405,"score_gpt":0.2474495718445136,"score_spread":0.2058409511054742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479649428","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000039685674,0.001955118,0.9958527,0.00018425588,0.00034712203,0.0010718382,0.000018652996,0.000081778715,0.00048456373],"genre_scores_gemma":[0.006142996,0.00048057915,0.9928375,0.00012998024,0.00016448568,0.000094085706,0.00008226318,0.000022543472,0.00004556138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987275,0.000027347889,0.0005907759,0.00019223362,0.00017260642,0.00028953163],"domain_scores_gemma":[0.99793607,0.00044438624,0.00052926387,0.0007081564,0.00032283942,0.000059292688],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006407611,0.00030750205,0.0003744634,0.00018888895,0.0014180138,0.00025157578,0.002128464,0.00023634078,5.7141597e-7],"category_scores_gemma":[0.00007191282,0.00026148718,0.00021839404,0.00026635436,0.00028421046,0.000502854,0.0009745275,0.0004003086,1.2300994e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012678353,0.000018092629,0.0000011884133,0.000070197355,0.000056717632,7.742839e-9,0.001398116,0.9622658,0.000014587974,0.018404186,0.000016854869,0.017753007],"study_design_scores_gemma":[0.00028673673,0.00003654432,0.0000051620154,0.00011331093,0.00004307777,0.0000028694226,0.0000045347915,0.99582046,0.0000796162,0.000055066772,0.0032561347,0.000296485],"about_ca_topic_score_codex":0.0000045090405,"about_ca_topic_score_gemma":0.000010594666,"teacher_disagreement_score":0.033554684,"about_ca_system_score_codex":0.00008757259,"about_ca_system_score_gemma":0.00011519304,"threshold_uncertainty_score":0.9999837},"labels":[],"label_agreement":null},{"id":"W1483283902","doi":"10.1007/11422778_128","title":"A Node Cooperative ARQ Scheme for Wireless Ad-Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Retransmission; Computer network; Computer science; Wireless ad hoc network; Automatic repeat request; Node (physics); Fading; Cooperative diversity; Throughput; Hybrid automatic repeat request; Channel (broadcasting); Scheme (mathematics); Selective Repeat ARQ; Wireless; Mobile ad hoc network; Telecommunications; Engineering; Network packet; Telecommunications link; Mathematics","score_opus":0.03154592047554502,"score_gpt":0.2777628156912662,"score_spread":0.24621689521572118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483283902","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026437223,0.0065651815,0.9870204,0.0023370644,0.0011570182,0.00083926733,0.000005927985,0.00022589436,0.0018228438],"genre_scores_gemma":[0.07068046,0.005068291,0.91205525,0.008681605,0.0014394847,0.00013503498,0.000033654807,0.00010609128,0.0018001423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961615,0.000072164796,0.0006653646,0.0016367403,0.00062107365,0.000843132],"domain_scores_gemma":[0.9957771,0.0008994249,0.00032879444,0.0020269242,0.00073959725,0.00022819881],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010154884,0.00067388284,0.0006989318,0.00052376394,0.00070557016,0.0008147748,0.004875431,0.00037720363,0.000039281957],"category_scores_gemma":[0.000090425594,0.0006315442,0.00019506163,0.00081381446,0.0006903621,0.0007124972,0.0020459176,0.0011061408,0.000038107057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012969744,0.00003481599,0.000005167842,0.000013628292,0.000019012221,0.00000894352,0.0006338796,0.05657935,0.00010348119,0.04298098,0.00019178244,0.89941597],"study_design_scores_gemma":[0.00047671684,0.00015742688,0.00001753443,0.00041319444,0.0000064738706,0.000021409804,2.0540196e-7,0.954271,0.00024130411,0.0058294837,0.03780467,0.000760575],"about_ca_topic_score_codex":9.609042e-7,"about_ca_topic_score_gemma":0.00017398478,"teacher_disagreement_score":0.8986554,"about_ca_system_score_codex":0.0004252964,"about_ca_system_score_gemma":0.0006238372,"threshold_uncertainty_score":0.9996136},"labels":[],"label_agreement":null},{"id":"W1487935471","doi":"10.1109/tcomm.2015.2438832","title":"Centralized and Game Theoretical Solutions of Joint Source and Relay Power Allocation for AF Relay Based Network","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Relay; Stackelberg competition; Computer science; Transmitter power output; Mathematical optimization; Node (physics); Game theory; Geometric programming; Computer network; Optimization problem; Power (physics); Key (lock); Mathematics; Engineering; Computer security","score_opus":0.0771996307057762,"score_gpt":0.2892104417411179,"score_spread":0.21201081103534167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487935471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013358346,0.0011959533,0.9842684,0.011831894,0.00013959143,0.00049447175,0.000012797679,0.0001274684,0.0005935791],"genre_scores_gemma":[0.9024068,0.0011368307,0.095813185,0.0003469026,0.00001014418,0.0001583351,0.000009423154,0.000015750997,0.000102606755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839973,0.00048596322,0.00041734093,0.00026759383,0.000167477,0.00026189865],"domain_scores_gemma":[0.9965762,0.000877434,0.0001378411,0.0018602457,0.0003546387,0.00019364941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090241147,0.00016108663,0.00022854967,0.00012990998,0.0006201658,0.00008935514,0.00078908633,0.00009771676,0.000014425037],"category_scores_gemma":[0.00006851591,0.00016177354,0.00008631705,0.00045250932,0.00054217246,0.00024316077,0.00004535762,0.00030169467,0.0000043389227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010474263,0.00076091784,0.00003771048,0.000023075037,0.00011581991,2.111701e-7,0.0042822203,0.064578585,0.0013783624,0.8915964,0.0017865519,0.035335455],"study_design_scores_gemma":[0.0016630758,0.00027490422,0.0002470447,0.00012353239,0.000064704436,0.000010493822,0.00016844062,0.9774351,0.0008867532,0.0051173507,0.013720716,0.0002878827],"about_ca_topic_score_codex":0.000008414174,"about_ca_topic_score_gemma":0.0000613584,"teacher_disagreement_score":0.9128565,"about_ca_system_score_codex":0.00006512149,"about_ca_system_score_gemma":0.00014349798,"threshold_uncertainty_score":0.6596933},"labels":[],"label_agreement":null},{"id":"W1490574178","doi":"10.1109/tit.2011.2137230","title":"Construction of New Delay-Tolerant Space-Time Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block code; Asynchronous communication; Computer science; Luby transform code; Synchronization (alternating current); Online codes; Construct (python library); Turbo code; Linear code; Mathematics; Algorithm; Topology (electrical circuits); Decoding methods; Telecommunications; Computer network; Combinatorics","score_opus":0.026317244189914782,"score_gpt":0.23096336754838367,"score_spread":0.20464612335846888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490574178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028639042,0.000024851637,0.98343956,0.00011980153,0.00032503266,0.00014378922,0.0000054950415,0.00014412761,0.012933433],"genre_scores_gemma":[0.9538144,0.00014492749,0.04537667,0.00026514436,0.0000113516735,0.000013516585,0.0000026415325,0.0000049554646,0.0003663841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914855,0.00012309435,0.00035981744,0.00008879737,0.00015781909,0.000121945326],"domain_scores_gemma":[0.9990287,0.00009709368,0.00016649118,0.000475617,0.00015734497,0.000074775075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034187423,0.00010972778,0.0001329034,0.000239975,0.00018442831,0.000044399607,0.00042301315,0.00005749202,0.0004934678],"category_scores_gemma":[0.000006715783,0.00010442646,0.0000755447,0.0003761924,0.00008603586,0.0015855456,0.0000045721554,0.00015063056,0.0002466257],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008693288,0.00006928112,0.000004073103,0.000011258069,0.000050159353,2.5775793e-7,0.012021452,0.002666301,0.0002988668,0.3680749,0.00028809367,0.61642843],"study_design_scores_gemma":[0.0035969433,0.0008337118,0.0005974733,0.00031686982,0.000103062586,0.00017399718,0.0017974504,0.54876304,0.35819644,0.07008532,0.014253897,0.0012818109],"about_ca_topic_score_codex":0.000008957577,"about_ca_topic_score_gemma":0.000003313341,"teacher_disagreement_score":0.9509505,"about_ca_system_score_codex":0.00003413393,"about_ca_system_score_gemma":0.00008090985,"threshold_uncertainty_score":0.5403126},"labels":[],"label_agreement":null},{"id":"W1491362750","doi":"10.1049/iet-com.2010.0035","title":"Cooperative relaying protocol for energy-constrained <i>ad hoc</i> networks","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cooperative diversity; Computer network; Rayleigh fading; Wireless ad hoc network; Throughput; Transmission (telecommunications); Bandwidth (computing); Wireless; Fading; Wireless network; Protocol (science); Channel (broadcasting); Telecommunications","score_opus":0.1344708339621468,"score_gpt":0.33643902174551366,"score_spread":0.20196818778336686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491362750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007373257,0.00061190006,0.9342647,0.0021348898,0.00008555447,0.026025036,0.0000055693345,0.0003788479,0.03648613],"genre_scores_gemma":[0.1360165,0.0012543658,0.4319255,0.0021285044,0.0000592603,0.42750618,0.000050581373,0.00004558529,0.0010135191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983455,0.0004068797,0.00046417376,0.0003410446,0.00010478079,0.00033760373],"domain_scores_gemma":[0.9948936,0.0004975433,0.00020383408,0.0037795373,0.0004969676,0.00012852973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050077337,0.00021727692,0.00022188296,0.00009908744,0.001172745,0.00017343288,0.004194637,0.00009900569,0.00004983019],"category_scores_gemma":[0.00009111426,0.00021089287,0.00011921756,0.000669135,0.00025936269,0.0005618566,0.0013731145,0.0003065581,0.000015348192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031681833,0.00033771148,0.00005231315,0.0000070533342,0.000057419053,5.4582523e-7,0.003050114,0.00010086629,0.00030298356,0.8234334,0.0069224685,0.16570346],"study_design_scores_gemma":[0.0015254801,0.00022395002,0.00017183251,0.00011114894,0.000013816667,0.000012410322,0.00014494786,0.3134912,0.00058631034,0.003997527,0.67922187,0.000499489],"about_ca_topic_score_codex":0.0000056070194,"about_ca_topic_score_gemma":0.00017719725,"teacher_disagreement_score":0.81943583,"about_ca_system_score_codex":0.00006117738,"about_ca_system_score_gemma":0.00015308947,"threshold_uncertainty_score":0.9019925},"labels":[],"label_agreement":null},{"id":"W1492561514","doi":"10.1109/icc.2015.7248699","title":"MIMO relaying with interference via the CMGF transform","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Ergodic theory; Relay; Interference (communication); MIMO; Topology (electrical circuits); Computer science; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Combinatorics; Physics; Pure mathematics","score_opus":0.06968107219631806,"score_gpt":0.2765645766659192,"score_spread":0.20688350446960116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492561514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015328438,0.00020605337,0.90968215,0.009146113,0.00006946018,0.00009173458,4.827782e-8,0.00010624651,0.07916534],"genre_scores_gemma":[0.98473966,0.000062049156,0.01316744,0.00097440684,0.00001602819,0.000011749833,3.4079088e-7,0.0000033319845,0.0010250141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994558,0.00006581693,0.00009879907,0.0001340371,0.0001220753,0.00012347636],"domain_scores_gemma":[0.9991667,0.00006737338,0.00002298046,0.00056875264,0.00010918766,0.000064976324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030741596,0.00007044999,0.00006234803,0.00002284157,0.0001437897,0.00012778555,0.0010559701,0.000015282287,0.000020536847],"category_scores_gemma":[0.000011250691,0.00003655141,0.000016844631,0.00029580263,0.000045202443,0.00031332902,0.00016699935,0.00013440134,0.00005250791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020610374,0.000049234746,0.0005266484,0.0000027721635,0.000024158804,0.000003989836,0.011768871,0.00021168028,0.00030157456,0.31179452,0.005501468,0.66979444],"study_design_scores_gemma":[0.0016835297,0.0007304441,0.0016010015,0.00013721634,0.000015225669,0.00014834407,0.0012808896,0.79366744,0.0059328033,0.009221192,0.18481137,0.0007705276],"about_ca_topic_score_codex":0.000010734017,"about_ca_topic_score_gemma":0.00018434068,"teacher_disagreement_score":0.9832068,"about_ca_system_score_codex":0.000024229812,"about_ca_system_score_gemma":0.00005905762,"threshold_uncertainty_score":0.19622728},"labels":[],"label_agreement":null},{"id":"W1493289129","doi":"10.1109/iswcs.2005.1547644","title":"A Threshold-Based Adaptive Encoding for Achieving the Diversity-Multiplexing Tradeoff","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Multiplexing; Encoding (memory); Transmitter; MIMO; Computer science; Scheme (mathematics); Algorithm; Theoretical computer science; Computer network; Mathematics; Telecommunications; Channel (broadcasting); Artificial intelligence","score_opus":0.09592235200025089,"score_gpt":0.28776106461663187,"score_spread":0.19183871261638097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493289129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025964521,0.0002598408,0.97116554,0.0153067475,0.00008778764,0.00034494136,0.0000011557858,0.0001923486,0.010045162],"genre_scores_gemma":[0.918097,0.000033251785,0.07872354,0.002759659,0.00009462212,0.000026901826,0.0000013033366,0.000005521031,0.0002581858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991237,0.00007677138,0.00015459476,0.0002442374,0.00015836686,0.00024232267],"domain_scores_gemma":[0.9986977,0.0005644259,0.00006091336,0.00053683965,0.00008609754,0.000054015087],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00053414295,0.00011537012,0.000107546795,0.000059111764,0.001488979,0.00016627215,0.0014442881,0.000043801196,0.000029767609],"category_scores_gemma":[0.000047677564,0.00008198786,0.00009894971,0.0002778429,0.00004657575,0.00043921237,0.00079836603,0.00021420691,0.000012107104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035483194,0.00012585151,0.0013597229,0.000007960683,0.00004944464,0.0000011783337,0.007478757,0.021637864,0.0030834605,0.7055752,0.0035304984,0.25711456],"study_design_scores_gemma":[0.00044878077,0.000042607146,0.00070744846,0.000024099345,0.0000048799225,0.0000011857943,0.0001162657,0.97660255,0.0012077588,0.00021053883,0.02048306,0.00015082835],"about_ca_topic_score_codex":0.0000032764467,"about_ca_topic_score_gemma":0.0001245954,"teacher_disagreement_score":0.9549647,"about_ca_system_score_codex":0.00006826614,"about_ca_system_score_gemma":0.000040508796,"threshold_uncertainty_score":0.99981093},"labels":[],"label_agreement":null},{"id":"W1495930959","doi":"10.1186/s13638-015-0482-3","title":"Buffer-aided relaying improves both throughput and end-to-end delay","year":2015,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Qatar National Research Fund; National Natural Science Foundation of China; Fonds National de la Recherche Luxembourg; Qatar Foundation","keywords":"Computer science; Network packet; Relay; End-to-end principle; End-to-end delay; Computer network; Queue; Throughput; Bernoulli's principle; Intuition; Bernoulli process; Channel (broadcasting); Real-time computing; Network delay; Wireless; Telecommunications","score_opus":0.08598699465626314,"score_gpt":0.3141476256462855,"score_spread":0.22816063099002237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495930959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39795178,0.0865613,0.44675162,0.044472568,0.0022031425,0.0010723372,0.0000045418396,0.00058766245,0.020395035],"genre_scores_gemma":[0.9395686,0.031530216,0.026934918,0.0015802088,0.00023898101,0.00001796577,0.0000033398649,0.000025221027,0.000100571626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976599,0.00074228103,0.000535256,0.00034626966,0.00031614033,0.00040011632],"domain_scores_gemma":[0.9965955,0.0007554474,0.0002915111,0.0016502236,0.00023301499,0.0004742826],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017682904,0.00026098086,0.00032291506,0.00020849069,0.0015789061,0.0009071325,0.0019079201,0.00008083566,0.00000415119],"category_scores_gemma":[0.000061229985,0.00023393502,0.00006241097,0.0006274862,0.00017635434,0.00066033297,0.0018264785,0.00089887873,0.000009574367],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024811778,0.00008831236,0.0015135375,0.0000046134596,0.00005791225,0.000011764305,0.0043153893,0.00015964216,0.0006935142,0.042610906,0.0011323612,0.94938725],"study_design_scores_gemma":[0.0027095708,0.001046384,0.007413738,0.0012658705,0.00006701557,0.0016000725,0.00094785605,0.5093999,0.00018323291,0.006004444,0.46790856,0.0014533788],"about_ca_topic_score_codex":0.000009861867,"about_ca_topic_score_gemma":0.00005233052,"teacher_disagreement_score":0.94793385,"about_ca_system_score_codex":0.00010634512,"about_ca_system_score_gemma":0.000110371555,"threshold_uncertainty_score":0.99972093},"labels":[],"label_agreement":null},{"id":"W1496889240","doi":"10.11575/prism/30622","title":"Cooperative Diversity Routing in Wireless Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Distributed computing; Physical layer; Routing protocol; Static routing; Cooperative diversity; Geographic routing; Dynamic Source Routing; Routing (electronic design automation); Wireless network; Wireless; Telecommunications","score_opus":0.03331800206900968,"score_gpt":0.2642224058560105,"score_spread":0.2309044037870008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496889240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045420945,0.000070239876,0.9284559,0.0022287162,0.00008451162,0.00010967145,6.8604486e-8,0.00014859693,0.023481386],"genre_scores_gemma":[0.995799,0.00018937937,0.0019414456,0.0017725461,0.000022061917,0.0000012683338,9.2736224e-7,0.0000014779663,0.0002719101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992651,0.00011932516,0.0001341852,0.0001997818,0.000091793954,0.00018984042],"domain_scores_gemma":[0.9994353,0.000068469904,0.00003016836,0.00035013477,0.00006799732,0.00004791474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002766792,0.00008181222,0.000108323875,0.000052924097,0.0003252393,0.000094036324,0.00079758035,0.00003338266,0.000023545415],"category_scores_gemma":[0.000015684987,0.000075036914,0.000023581315,0.00057706353,0.000017390288,0.0003828748,0.0007430763,0.00017434546,0.0000096787835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003315949,0.000063497886,0.0061867083,2.9493984e-7,0.000003192911,0.0000075061644,0.0013697952,0.0016151121,0.00009243466,0.80820245,0.00058457884,0.1818711],"study_design_scores_gemma":[0.0002783866,0.00003932354,0.03925824,0.000018534362,6.581454e-7,0.0000018120786,0.000038202717,0.9596242,0.00014063758,0.0003173936,0.00013921989,0.00014340208],"about_ca_topic_score_codex":0.000010617323,"about_ca_topic_score_gemma":0.00012608872,"teacher_disagreement_score":0.95800906,"about_ca_system_score_codex":0.000050119535,"about_ca_system_score_gemma":0.000018478246,"threshold_uncertainty_score":0.30599165},"labels":[],"label_agreement":null},{"id":"W1496955190","doi":"10.1109/vetecs.2006.1682906","title":"Induced Cooperative Multi-user Diversity Relaying for Multi-hop Cellular Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Telecommunications link; Cooperative diversity; Network packet; Hop (telecommunications); Base station; Throughput; Multi-user; Diversity gain; Diversity scheme; Wireless; Fading; Telecommunications","score_opus":0.09067996763507334,"score_gpt":0.29186181052633803,"score_spread":0.20118184289126467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496955190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014620222,0.00027742394,0.98273164,0.00043621616,0.00028719782,0.0004832653,0.0000012834635,0.00026410638,0.0008986371],"genre_scores_gemma":[0.84575695,0.000059131064,0.14860384,0.00059433526,0.00008251642,0.000035060275,0.000013366663,0.000011991033,0.004842791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986754,0.000157933,0.00026073598,0.00042503537,0.00013787806,0.00034303017],"domain_scores_gemma":[0.9986411,0.00018372976,0.000090339956,0.0006498948,0.00035238185,0.00008258215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038740772,0.00019263102,0.00020014004,0.000077957455,0.001253507,0.0001912271,0.0010980167,0.000103603124,0.0000293947],"category_scores_gemma":[0.00004679249,0.0001766976,0.000096547265,0.00044912394,0.000041843556,0.000514239,0.0015093235,0.00022873617,0.000024494293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055872493,0.001288057,0.015574361,0.000023714556,0.00015591283,0.000022603612,0.0041043228,0.029699363,0.032731336,0.8468723,0.021550639,0.04792147],"study_design_scores_gemma":[0.0013988124,0.000047490612,0.0026125677,0.000016646287,0.000007583209,0.0000010754085,0.00005862236,0.9860388,0.003988437,0.00003643694,0.0054830643,0.0003104582],"about_ca_topic_score_codex":0.00007387645,"about_ca_topic_score_gemma":0.00039180604,"teacher_disagreement_score":0.9563394,"about_ca_system_score_codex":0.00007819021,"about_ca_system_score_gemma":0.000036713784,"threshold_uncertainty_score":0.96410894},"labels":[],"label_agreement":null},{"id":"W1497819923","doi":"10.1109/icc.2015.7248629","title":"Complex Low Density Lattice Codes to Physical Layer Network Coding","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto","keywords":"Linear network coding; Computer science; Coding gain; Coding (social sciences); Lattice (music); Decoding methods; Shannon–Fano coding; Variable-length code; Parametric statistics; Relay; Channel code; Algorithm; Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Physics; Combinatorics","score_opus":0.13619056711066732,"score_gpt":0.3342500014932132,"score_spread":0.1980594343825459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497819923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06825931,0.000046654368,0.90196055,0.004971202,0.00024118021,0.00017519314,4.223913e-7,0.00033615626,0.024009332],"genre_scores_gemma":[0.93108004,0.000011954422,0.063993774,0.004121427,0.00022586779,0.000006918017,0.0000021223236,0.000006396075,0.00055150775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989077,0.00017386975,0.0001416195,0.00026957513,0.00022168792,0.00028556323],"domain_scores_gemma":[0.9985531,0.00019388815,0.00003572057,0.0006964187,0.00025259986,0.00026829337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042519503,0.000121005854,0.00018358024,0.000033294982,0.00021908148,0.00020277477,0.0009196885,0.000024785555,0.000022042417],"category_scores_gemma":[0.00007318636,0.00010692875,0.000041476374,0.00055899983,0.000033894295,0.0002544764,0.00095864106,0.0001301123,0.00040109752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015391668,0.00011693632,0.0021532218,0.000004618355,0.00002573325,0.0000075351595,0.0026380313,0.0058119884,0.002082529,0.81736857,0.13876024,0.031015206],"study_design_scores_gemma":[0.00042394223,0.00009284142,0.009087237,0.000037973572,0.0000063418156,0.000009630228,0.000057418627,0.937775,0.0014873301,0.003542247,0.047090307,0.00038972977],"about_ca_topic_score_codex":0.000009562242,"about_ca_topic_score_gemma":0.000099735116,"teacher_disagreement_score":0.931963,"about_ca_system_score_codex":0.00005523597,"about_ca_system_score_gemma":0.000049055663,"threshold_uncertainty_score":0.5155431},"labels":[],"label_agreement":null},{"id":"W1501483656","doi":"10.1049/el.2011.0828","title":"Cooperative opportunistic beamforming using integrated relay node prototype","year":2011,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Relay; Beamforming; Node (physics); Computer science; Transmission (telecommunications); Computer network; Simple (philosophy); Relay channel; Link Access Procedure for Frame Relay; Throughput; Electronic engineering; Telecommunications; Engineering; Wireless; Power (physics)","score_opus":0.06828229265410955,"score_gpt":0.27019187936423,"score_spread":0.20190958671012044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501483656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039805528,0.0003689044,0.9557545,0.0011550743,0.0001594899,0.00045533056,0.000001075999,0.00021958834,0.0020804822],"genre_scores_gemma":[0.84616005,0.0003101374,0.14789487,0.005279069,0.00005367762,0.00007642916,0.000017273576,0.00003476121,0.00017371064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859536,0.00017227417,0.0002694298,0.0003378324,0.00016046462,0.0004646694],"domain_scores_gemma":[0.99893904,0.000047653644,0.00011350122,0.00066256453,0.00014256604,0.00009466228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003437539,0.00019454598,0.00017647298,0.0001173709,0.00035779708,0.000107509266,0.0009694891,0.000050811486,0.00006353965],"category_scores_gemma":[0.00005062446,0.00018048329,0.00005375993,0.0006099693,0.000069359776,0.00044605506,0.00023147564,0.0004498026,0.00003130547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014555383,0.00037831697,0.0009404402,0.00003222084,0.00031373044,0.00011323514,0.015243832,0.003403349,0.39792445,0.51155156,0.003163782,0.06678953],"study_design_scores_gemma":[0.0009725161,0.0005284674,0.00022414193,0.00017259232,0.000041162395,0.00012090833,0.00009868922,0.9045745,0.032360245,0.0004758746,0.059226207,0.0012047128],"about_ca_topic_score_codex":0.000014058541,"about_ca_topic_score_gemma":0.000027242755,"teacher_disagreement_score":0.90117115,"about_ca_system_score_codex":0.00024789947,"about_ca_system_score_gemma":0.00027857765,"threshold_uncertainty_score":0.7359895},"labels":[],"label_agreement":null},{"id":"W1503948751","doi":"10.1109/wowmom.2015.7158129","title":"Minimum delay scheduling with multi-packet transmission in wireless networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Network packet; Linear network coding; Scheduling (production processes); Computational complexity theory; Time complexity; Job shop scheduling; Mathematical optimization; Transmission delay; Wireless network; Optimization problem; Heuristic; Wireless; Algorithm; Computer network; Mathematics","score_opus":0.061685366186479164,"score_gpt":0.28970677848206383,"score_spread":0.22802141229558467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503948751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03655842,0.00045563496,0.95980865,0.0009689288,0.00006428429,0.00012723055,5.295289e-8,0.000117974494,0.0018988039],"genre_scores_gemma":[0.83878475,0.00019469605,0.16042268,0.00032280883,0.000018952085,0.000010006082,0.0000017798401,0.0000071282298,0.00023719572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903643,0.00014082422,0.0001884709,0.00025423788,0.0001495414,0.00023050135],"domain_scores_gemma":[0.9991599,0.000066409564,0.000038984508,0.00045832165,0.00011289593,0.00016351067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000425848,0.00011966892,0.00013891314,0.000079310164,0.00007988371,0.00010388326,0.0006868188,0.00005355169,0.000010463034],"category_scores_gemma":[0.000009728773,0.000089223366,0.000021144395,0.000598172,0.000031667874,0.0003616808,0.0001570812,0.00020831844,0.000011121392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012602253,0.0005734473,0.012547361,0.000013431089,0.000036828074,0.000077655495,0.007817384,0.098522075,0.0010131359,0.066211104,0.0012887712,0.81177276],"study_design_scores_gemma":[0.0009968942,0.000053048163,0.0005007932,0.000068264955,0.0000014189123,0.000008425885,0.000073685245,0.99667317,0.0002256197,0.000031793224,0.0012103313,0.00015654408],"about_ca_topic_score_codex":0.000010864236,"about_ca_topic_score_gemma":0.00020858775,"teacher_disagreement_score":0.8981511,"about_ca_system_score_codex":0.000044541055,"about_ca_system_score_gemma":0.00008920109,"threshold_uncertainty_score":0.36384234},"labels":[],"label_agreement":null},{"id":"W1508003355","doi":"10.1109/icc.2015.7248866","title":"Virtual frame aggregation: Clustered channel access in wireless networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Overhead (engineering); Frame (networking); Construct (python library); Subcarrier; Node (physics); Throughput; Wireless; Channel (broadcasting); Hidden node problem; Wireless network; Orthogonal frequency-division multiplexing; Wi-Fi array; Telecommunications; Engineering","score_opus":0.08669328158181,"score_gpt":0.31500970553161217,"score_spread":0.22831642394980217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508003355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011713668,0.00021272579,0.97680956,0.0028314039,0.00044595113,0.0001563289,1.4308155e-7,0.00016193023,0.0076682772],"genre_scores_gemma":[0.99612975,0.0002130247,0.0013024597,0.0015810336,0.00010156566,0.000024487195,0.0000041395024,0.00000663606,0.0006369146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891573,0.00017735815,0.00023701307,0.00026181305,0.00018219739,0.00022587436],"domain_scores_gemma":[0.9989953,0.000096854914,0.0000639742,0.00055471866,0.00015507893,0.00013406685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045287365,0.000114649585,0.00014443038,0.00011078624,0.00008364401,0.00035292868,0.0015178706,0.00007115235,0.00002229725],"category_scores_gemma":[0.00004052237,0.00010543217,0.000026763328,0.00084898097,0.000033846936,0.0009741445,0.0010878999,0.00021006446,0.000034098262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036814152,0.00023192458,0.0034645414,0.00000467952,0.000021587975,0.000019513627,0.0040387837,0.04194092,0.00002430178,0.34595078,0.016575946,0.58769023],"study_design_scores_gemma":[0.0005191225,0.000038548133,0.001125605,0.00003303669,6.854291e-7,0.0000039899046,0.000058627655,0.9961102,0.00007998603,0.00068621075,0.0011864796,0.00015751888],"about_ca_topic_score_codex":0.000018887376,"about_ca_topic_score_gemma":0.00031923444,"teacher_disagreement_score":0.98441607,"about_ca_system_score_codex":0.00007190201,"about_ca_system_score_gemma":0.00007711449,"threshold_uncertainty_score":0.42993993},"labels":[],"label_agreement":null},{"id":"W1511092649","doi":"10.1007/978-3-642-01399-7_45","title":"Practical Random Linear Network Coding on GPUs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Hong Kong Baptist University","keywords":"Computer science; Linear network coding; Hash function; Homomorphic encryption; Speedup; Distributed computing; Computational complexity theory; Tuple; Parallel computing; Theoretical computer science; Computer network; Algorithm; Network packet; Encryption; Computer security","score_opus":0.04893286052545473,"score_gpt":0.31123538963723524,"score_spread":0.26230252911178054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511092649","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000062711415,0.0005420124,0.976207,0.005146295,0.0014551069,0.0004030251,8.2431376e-7,0.0002175513,0.016021878],"genre_scores_gemma":[0.08426432,0.0016309603,0.89692366,0.013399002,0.002352709,0.000014508736,0.000009033072,0.00005481814,0.0013509627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962682,0.00014344453,0.00058183615,0.0013338819,0.0009235491,0.0007490979],"domain_scores_gemma":[0.9955035,0.0016936612,0.00030769172,0.0019889483,0.00028606193,0.00022015665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016612437,0.00053956883,0.00061714236,0.0004483658,0.00060513045,0.0006080764,0.0031540536,0.00029954858,0.000038217968],"category_scores_gemma":[0.00028549234,0.0004828643,0.00015971035,0.00081039977,0.00042410355,0.00051029166,0.001355914,0.0015966365,0.000114882874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023294886,0.000036152003,0.00000608965,0.0000059260487,0.000009874222,0.00007890355,0.00022072768,0.0581076,0.000021288379,0.1455213,0.00042294688,0.7955459],"study_design_scores_gemma":[0.0007202387,0.00031189076,0.000044335444,0.00070644723,0.000008491887,0.000079016034,5.6904476e-8,0.9187395,0.0002721368,0.052179243,0.026194394,0.00074426323],"about_ca_topic_score_codex":0.0000013966799,"about_ca_topic_score_gemma":0.000029416102,"teacher_disagreement_score":0.8606319,"about_ca_system_score_codex":0.000293451,"about_ca_system_score_gemma":0.0005138793,"threshold_uncertainty_score":0.9997623},"labels":[],"label_agreement":null},{"id":"W1512713022","doi":"10.1109/tit.2015.2445753","title":"Streaming Codes for Multicast Over Burst Erasure Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Erasure; Multicast; Network packet; Converse; Binary erasure channel; Erasure code; Channel (broadcasting); Computer network; Channel capacity; Topology (electrical circuits); Algorithm; Decoding methods; Mathematics","score_opus":0.042140692939551264,"score_gpt":0.28563617728953816,"score_spread":0.2434954843499869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512713022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014133144,0.00003409063,0.99512094,0.00037034412,0.0007729702,0.0003102714,0.000021441845,0.00020269377,0.0017539134],"genre_scores_gemma":[0.99019325,0.00004258565,0.008524841,0.0007455631,0.000036613943,0.00012044804,0.000009833123,0.000006702865,0.0003201811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991497,0.0001048667,0.0002733627,0.00011033628,0.00018747427,0.0001742894],"domain_scores_gemma":[0.99877614,0.0002901568,0.00009134577,0.0004381371,0.00029439066,0.00010984573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006544902,0.00012495324,0.000115118855,0.00018273694,0.00032425812,0.00022477034,0.0004403962,0.00005945909,0.00002927073],"category_scores_gemma":[0.000033073746,0.0001171582,0.00007069626,0.00027246622,0.000042250296,0.0019100511,0.000004925815,0.00014735525,0.00009567906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013716136,0.00015575635,0.000003813198,0.000028095395,0.00007151469,3.2927005e-7,0.014291742,0.08187664,0.00016374385,0.21205236,0.0017595659,0.68945926],"study_design_scores_gemma":[0.0025089837,0.00029101456,0.00005940741,0.000096784956,0.000024550282,0.000011952446,0.0013432886,0.9310801,0.01073109,0.006701514,0.0466485,0.00050278805],"about_ca_topic_score_codex":0.0000020114528,"about_ca_topic_score_gemma":0.0000054547863,"teacher_disagreement_score":0.9887799,"about_ca_system_score_codex":0.00008314232,"about_ca_system_score_gemma":0.00007045144,"threshold_uncertainty_score":0.47775725},"labels":[],"label_agreement":null},{"id":"W1514055676","doi":"10.1109/itw.2008.4578651","title":"Asymptotic capacity and optimal precoding strategy of multi-level precode &amp;#x00026; forward in correlated channels","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Institut National de la Recherche Scientifique","funders":"","keywords":"Precoding; Zero-forcing precoding; Computer science; Mathematics; Control theory (sociology); Mathematical optimization; Channel (broadcasting); MIMO; Telecommunications; Artificial intelligence","score_opus":0.1922076030966851,"score_gpt":0.3170137894176999,"score_spread":0.12480618632101481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514055676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31456718,0.0010172698,0.6811429,0.00016709956,0.0004596677,0.0007081988,0.000015759824,0.00015396967,0.001767932],"genre_scores_gemma":[0.85677,0.004864436,0.13733497,0.000042662396,0.000024596999,0.000047748203,0.00002021388,0.000018379596,0.00087703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975353,0.00033873454,0.00076075,0.00074745197,0.00023503875,0.00038271362],"domain_scores_gemma":[0.9978858,0.00024755907,0.00034109625,0.001127084,0.0002586775,0.00013974648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056873495,0.0003798556,0.00062217214,0.00033307893,0.00013904095,0.00015940152,0.0013959107,0.0003449197,0.000040799594],"category_scores_gemma":[0.00012055046,0.0003775207,0.00011037544,0.0003968023,0.00014144459,0.0003322682,0.0026508775,0.00096301606,0.000010672489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006852889,0.0011903086,0.006801318,0.00058083184,0.00038760758,0.000016098425,0.02556502,0.6613499,0.001900735,0.013984818,0.0009904663,0.2871644],"study_design_scores_gemma":[0.0007547794,0.00004801372,0.010646571,0.000462215,0.000010499697,0.000026778189,0.000029386676,0.98635906,0.0006846878,0.00028413645,0.00019774793,0.0004961235],"about_ca_topic_score_codex":0.0001293689,"about_ca_topic_score_gemma":0.0005505723,"teacher_disagreement_score":0.5438079,"about_ca_system_score_codex":0.000119409015,"about_ca_system_score_gemma":0.00020005358,"threshold_uncertainty_score":0.9998677},"labels":[],"label_agreement":null},{"id":"W1523326937","doi":"10.1049/iet-com.2010.0436","title":"Performance analysis of cooperative diversity systems with opportunistic relaying and adaptive transmission","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Independent and identically distributed random variables; Rayleigh fading; Fading; Link adaptation; Computer science; Transmission (telecommunications); Spectral efficiency; Diversity combining; Modulation (music); Bit error rate; Algorithm; Random variable; Telecommunications; Mathematics; Channel (broadcasting); Statistics; Physics","score_opus":0.142104682693373,"score_gpt":0.2699197652789648,"score_spread":0.12781508258559177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523326937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08471415,0.0020596685,0.8830991,0.00038813407,0.000035316047,0.000423523,0.000016015865,0.00013488375,0.02912924],"genre_scores_gemma":[0.97170115,0.0038180903,0.024331922,0.000033975324,0.0000015859787,0.000018280369,0.000012803395,0.0000041504136,0.00007806437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907213,0.0002756077,0.00022472699,0.00018106705,0.00013538873,0.000111079076],"domain_scores_gemma":[0.9976707,0.00019127011,0.00015061263,0.001582327,0.00032256203,0.00008251385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031235252,0.000104832936,0.00023051554,0.0001974739,0.000836797,0.000032367992,0.0014477096,0.00003463621,0.000011827666],"category_scores_gemma":[0.0000110179,0.00008819441,0.000037887286,0.0011648709,0.00024238942,0.00038255184,0.001169715,0.00016386468,0.0000013048776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013658874,0.0007775162,0.10377634,0.0000589538,0.0026004228,0.0000052064515,0.09728889,0.003080099,0.0006178234,0.69166607,0.00014310732,0.099848986],"study_design_scores_gemma":[0.00022079534,0.00017287664,0.05695086,0.00009080302,0.00027275886,0.0000039228657,0.0005764291,0.9410468,0.000050263607,0.000026937547,0.00042110877,0.00016645607],"about_ca_topic_score_codex":0.00007741576,"about_ca_topic_score_gemma":0.00006786338,"teacher_disagreement_score":0.9379667,"about_ca_system_score_codex":0.000027137763,"about_ca_system_score_gemma":0.000055092576,"threshold_uncertainty_score":0.64360505},"labels":[],"label_agreement":null},{"id":"W1525672794","doi":"10.1109/pacrim.2005.1517223","title":"Differential distributed space-time block coding","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Node (physics); Block code; Differential (mechanical device); Space–time block code; Coding (social sciences); Wireless ad hoc network; Code (set theory); Algorithm; Wireless sensor network; Channel state information; Set (abstract data type); Topology (electrical circuits); Wireless; Decoding methods; Computer network; Mathematics; Telecommunications; Combinatorics; Physics","score_opus":0.02252095629191257,"score_gpt":0.25568901973548164,"score_spread":0.23316806344356908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525672794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021877559,0.00009909963,0.9522363,0.011152316,0.00011693173,0.00010504526,0.0000020001537,0.00045460172,0.013956167],"genre_scores_gemma":[0.98404026,0.000100899386,0.01258781,0.00030532078,0.00010785492,0.0000047839717,0.000007677716,0.000004408047,0.002840959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992773,0.00006284706,0.00014471656,0.0001936384,0.00012795093,0.00019354372],"domain_scores_gemma":[0.9992095,0.000071359966,0.000036425627,0.00053813163,0.00006384621,0.000080686244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077111035,0.00009625285,0.0001075822,0.000043154203,0.00020009822,0.00017732594,0.00076002063,0.000029682842,0.00059621],"category_scores_gemma":[0.000021338506,0.000083255014,0.000045665198,0.000259114,0.000022794848,0.00026556564,0.0004776464,0.00010445787,0.00047002867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000938996,0.0003113679,0.0004115282,0.0000054601187,0.00006230491,0.000004623084,0.00084710814,0.0011642359,0.057119206,0.6248253,0.08229266,0.23294681],"study_design_scores_gemma":[0.00036475522,0.000021398044,0.0013102161,0.000013459562,0.0000036553918,0.000007723633,0.000004712098,0.8836853,0.010819985,0.000109621695,0.103440024,0.0002191642],"about_ca_topic_score_codex":0.0000010642144,"about_ca_topic_score_gemma":0.000009404908,"teacher_disagreement_score":0.96216273,"about_ca_system_score_codex":0.000042409178,"about_ca_system_score_gemma":0.000019579029,"threshold_uncertainty_score":0.6528081},"labels":[],"label_agreement":null},{"id":"W1526690225","doi":"10.1109/cwit.2015.7255181","title":"A DoF analysis of compress-and-forward in MIMO Gaussian relay channel with correlated noises","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; MIMO; Relay channel; Computer science; Interference (communication); Channel (broadcasting); Topology (electrical circuits); Signal-to-noise ratio (imaging); Gaussian; Electronic engineering; Telecommunications; Mathematics; Engineering; Physics; Power (physics)","score_opus":0.045189636169047746,"score_gpt":0.2758727420816134,"score_spread":0.23068310591256563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526690225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31419557,0.0015860618,0.6484663,0.0032226709,0.00010474309,0.00033649552,0.0000028688978,0.00017901238,0.03190627],"genre_scores_gemma":[0.9933793,0.00015062165,0.00593456,0.00015395398,0.0000032711907,0.000006768672,0.0000043046507,0.0000033482552,0.00036385903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920464,0.000108525615,0.0002141315,0.00019721454,0.00015086579,0.000124644],"domain_scores_gemma":[0.99910617,0.00008575709,0.00008092223,0.0004951222,0.00013777924,0.00009424419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027014982,0.0000890767,0.0002519425,0.00032418728,0.000039131603,0.000041913103,0.00045002042,0.000034041077,0.000014649635],"category_scores_gemma":[0.00002389116,0.00006472781,0.000031756925,0.0019028262,0.00006002798,0.00020217504,0.00026533124,0.00010364959,0.0000034260197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045189422,0.0012992069,0.28727505,0.000051037932,0.0029506541,0.0000699119,0.059261307,0.26205948,0.00087800506,0.31461114,0.0063250405,0.06476729],"study_design_scores_gemma":[0.0006673355,0.0000961759,0.03339125,0.000037958027,0.000056827896,0.0000027121,0.00017851173,0.96457994,0.00016619581,0.00007150033,0.0006176272,0.00013393811],"about_ca_topic_score_codex":0.00010168549,"about_ca_topic_score_gemma":0.0012066371,"teacher_disagreement_score":0.7025205,"about_ca_system_score_codex":0.000021146248,"about_ca_system_score_gemma":0.000040945055,"threshold_uncertainty_score":0.26395234},"labels":[],"label_agreement":null},{"id":"W1527489272","doi":"10.1002/wcm.2359","title":"Time and power scheduling in an ad hoc network with bidirectional relaying and network coding","year":2013,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Linear network coding; Scheduling (production processes); Mobile ad hoc network; Coding (social sciences); Telecommunications; Wireless; Network packet","score_opus":0.02078326246867399,"score_gpt":0.26395902804136423,"score_spread":0.24317576557269024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527489272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95150167,0.016612148,0.030176548,0.00063562504,0.00005162516,0.00045031038,5.2296264e-7,0.00016459258,0.00040697],"genre_scores_gemma":[0.89260864,0.0062914914,0.10074889,0.00020721168,0.000035934187,0.00006043966,0.000008254183,0.000016951988,0.000022205153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984117,0.00035888696,0.00034857253,0.00040797546,0.00011445794,0.00035840247],"domain_scores_gemma":[0.99790263,0.0005974934,0.0001506484,0.0010507074,0.00015313663,0.0001453986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069400255,0.00019882272,0.00027356582,0.00010082843,0.0012480809,0.00048258514,0.00071535935,0.00007189089,0.00000794039],"category_scores_gemma":[0.000012881223,0.00019121495,0.00001820479,0.000590436,0.00025975693,0.0006838835,0.0016457809,0.00041738126,0.0000037093562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015090968,0.00016865156,0.03915713,0.000026271544,0.000058662383,0.000002975956,0.0072523826,0.035608068,0.0010970444,0.031909823,0.000116916286,0.884587],"study_design_scores_gemma":[0.00037775017,0.00011494983,0.019095995,0.00033923044,0.0000052211562,0.000037150094,0.00026014962,0.9778156,0.0000039048446,0.00020930999,0.0014663002,0.00027442074],"about_ca_topic_score_codex":0.000016246053,"about_ca_topic_score_gemma":0.00010471722,"teacher_disagreement_score":0.9422076,"about_ca_system_score_codex":0.000034898327,"about_ca_system_score_gemma":0.000040243853,"threshold_uncertainty_score":0.9599355},"labels":[],"label_agreement":null},{"id":"W1528530582","doi":"10.5772/9482","title":"Multi-Agent Design for the Physical Layer of a Distributed Base Station Network","year":2010,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Layer (electronics); Computer science; Base (topology); Distributed computing; Computer network; Materials science; Mathematics; Nanotechnology","score_opus":0.11023686198810187,"score_gpt":0.31113185773597546,"score_spread":0.2008949957478736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528530582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069007565,0.00020605861,0.9940781,0.00024367549,0.00026236704,0.0008671976,0.00003845415,0.000084025436,0.004213194],"genre_scores_gemma":[0.47111762,0.00033005181,0.3986285,0.0010010118,0.0010452284,0.0007567136,0.00015228796,0.00014357307,0.12682502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897903,0.00006173089,0.0003009144,0.00028538305,0.00018494572,0.00018797485],"domain_scores_gemma":[0.9973232,0.0009390672,0.0002752089,0.0010224651,0.0003877356,0.000052326206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043950367,0.00022345882,0.0002602308,0.000044862503,0.00023255941,0.00007713718,0.0011901971,0.00014225428,0.00001984011],"category_scores_gemma":[0.000063527834,0.00016324485,0.00017608037,0.000030493251,0.00013981362,0.000044461234,0.00039845204,0.0004981119,0.000014940302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009953428,0.00011038061,0.000001443438,0.000050563238,0.00033188262,0.0000054813986,0.0021676645,0.00089952146,0.06628253,0.5290061,0.0044005294,0.39664435],"study_design_scores_gemma":[0.00091316376,0.0002963642,0.000014696921,0.00042259865,0.00011533232,0.00000626668,0.000012884076,0.38364258,0.07828314,0.060975198,0.47464675,0.00067103957],"about_ca_topic_score_codex":0.0000019846123,"about_ca_topic_score_gemma":0.00003203833,"teacher_disagreement_score":0.5954496,"about_ca_system_score_codex":0.00004323654,"about_ca_system_score_gemma":0.000112939364,"threshold_uncertainty_score":0.6656932},"labels":[],"label_agreement":null},{"id":"W1529219782","doi":"10.1109/eucnc.2015.7194041","title":"Soft detection of multilevel lattice network coding","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto","keywords":"Decoding methods; Linear network coding; Lattice (music); Computer science; Algorithm; Coding (social sciences); Theoretical computer science; Mathematics; Computer network; Statistics; Physics","score_opus":0.09577076560449507,"score_gpt":0.3009264319546321,"score_spread":0.20515566635013702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529219782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003290393,0.00026079724,0.9872277,0.00024417182,0.0002560547,0.000063895684,9.643359e-8,0.00011482151,0.008542095],"genre_scores_gemma":[0.951032,0.00005025357,0.04825313,0.00021472061,0.000055742785,0.0000039570587,3.633074e-7,0.000003334969,0.0003865352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936885,0.000091404756,0.00016128823,0.00012625942,0.00012563638,0.00012655072],"domain_scores_gemma":[0.9991206,0.00013368623,0.00006447521,0.0004055026,0.00020552291,0.00007024146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044857274,0.000059983282,0.00009079591,0.00003400234,0.00008297012,0.000039641804,0.00047590953,0.0000273253,0.000009326296],"category_scores_gemma":[0.000097357915,0.00005422668,0.000025396012,0.00030474842,0.000021740809,0.00025626132,0.00029464008,0.00007811376,0.000027867647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012247162,0.00006535986,0.00092246843,0.000008107974,0.000023053644,0.0000012464562,0.0016811871,0.0047597867,0.0060723927,0.22947867,0.0030187657,0.75395674],"study_design_scores_gemma":[0.00032852753,0.00004909205,0.0016071575,0.00002243405,0.0000029409566,0.000004415155,0.00003494158,0.9771004,0.006418968,0.0015046273,0.012807482,0.00011905583],"about_ca_topic_score_codex":0.000007739628,"about_ca_topic_score_gemma":0.00004086929,"teacher_disagreement_score":0.9723406,"about_ca_system_score_codex":0.000025829548,"about_ca_system_score_gemma":0.00003595387,"threshold_uncertainty_score":0.22112997},"labels":[],"label_agreement":null},{"id":"W1530142314","doi":"10.1002/ett.1511","title":"Novel partial decision combining schemes for Rayleigh fading","year":2011,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Fading; Rayleigh scattering; Computer science; Algorithm; Mathematics; Electronic engineering; Engineering; Physics; Decoding methods; Optics","score_opus":0.08825230779126586,"score_gpt":0.3119523440535032,"score_spread":0.22370003626223733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530142314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016607598,0.0005171148,0.99071425,0.0025172357,0.0001832417,0.0004107654,0.0000050157323,0.0025974107,0.001394224],"genre_scores_gemma":[0.553939,0.0011780247,0.44444662,0.00005586133,0.0000034544435,0.00031386875,0.000003336293,0.0000141911005,0.00004564911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854654,0.00005928694,0.0004591546,0.0004056491,0.00015822717,0.00037116598],"domain_scores_gemma":[0.9962547,0.0005970077,0.00015677804,0.0027362385,0.00021089213,0.000044407123],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00043228755,0.00023198142,0.00023475362,0.00052693934,0.0015788533,0.00010974201,0.0033658396,0.00014816725,0.0000395694],"category_scores_gemma":[0.00016225259,0.00023582671,0.00015160869,0.0011491472,0.00018393052,0.0005605103,0.00016879679,0.0005056281,0.00002790577],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019206569,0.00043437342,0.000027381127,0.000005838147,0.00006217742,2.2574739e-7,0.0012170817,0.00052277016,0.0027348085,0.20703356,0.00015308913,0.78778946],"study_design_scores_gemma":[0.0038107082,0.000858512,0.0005412915,0.00059731747,0.00012502667,0.00004702311,0.0038255982,0.5157469,0.24311393,0.038732875,0.19046162,0.0021391932],"about_ca_topic_score_codex":0.000007787455,"about_ca_topic_score_gemma":0.00003164082,"teacher_disagreement_score":0.7856503,"about_ca_system_score_codex":0.00008602003,"about_ca_system_score_gemma":0.000054054777,"threshold_uncertainty_score":0.99972093},"labels":[],"label_agreement":null},{"id":"W1535178872","doi":"10.1002/9781118979846.ch8","title":"Distributed Resource Allocation in<scp>5G</scp>Cellular Networks","year":2016,"lang":"en","type":"other","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Distributed computing; Resource allocation; Scalability; Overhead (engineering); Computer network; Provisioning; Wireless network; Cellular network; Heterogeneous network; Radio resource management; Resource management (computing); Wireless; Telecommunications","score_opus":0.01941388686686364,"score_gpt":0.24894335808672324,"score_spread":0.22952947121985962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535178872","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018386178,0.0017193616,0.5690219,0.0005342427,0.00015484785,0.00018657463,0.0000027320623,0.00033729462,0.42804122],"genre_scores_gemma":[0.008012537,0.0038292166,0.0033358429,0.00070581026,0.00043935268,0.00006231863,0.00019048923,0.0001840361,0.9832404],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983416,0.00027200006,0.0003077682,0.00050264964,0.00021272765,0.00036320952],"domain_scores_gemma":[0.9978688,0.00030321485,0.00019884105,0.0014664535,0.000057600566,0.000105120205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034453772,0.00027603994,0.0002843169,0.00024051956,0.00008122599,0.00014408001,0.0017816903,0.00027969124,0.00039820554],"category_scores_gemma":[0.000086345884,0.00022462968,0.000069438676,0.0005573367,0.000058283145,0.00011566323,0.00051317766,0.00030321677,0.00037033026],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.913783e-7,0.000033794407,0.00005833311,0.0000058771284,0.000018438426,0.0000045024008,0.00006629452,0.00008153284,0.000045677592,0.06086977,0.91300035,0.025815064],"study_design_scores_gemma":[0.0002510423,0.000011387231,0.00006978789,0.00021028236,0.0000034316165,0.0000013341021,0.000010939954,0.036337547,0.00005849431,0.00010041163,0.9628235,0.00012184665],"about_ca_topic_score_codex":0.000013867768,"about_ca_topic_score_gemma":0.00024169784,"teacher_disagreement_score":0.56568605,"about_ca_system_score_codex":0.00009333511,"about_ca_system_score_gemma":0.000055607405,"threshold_uncertainty_score":0.91601324},"labels":[],"label_agreement":null},{"id":"W1536568986","doi":"10.1109/icc.2015.7248647","title":"A completely distributed algorithm for user association in HetSNets","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Association (psychology); Computational complexity theory; Quality of service; Time complexity; Distributed algorithm; Approximation algorithm; Algorithm; Information exchange; Order (exchange); Channel (broadcasting); Distributed computing; Computer network","score_opus":0.08816987449417873,"score_gpt":0.3116664673804475,"score_spread":0.22349659288626877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536568986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008150365,0.00008048675,0.99442035,0.0030140544,0.00013184668,0.00017753444,0.000006338041,0.000088296365,0.0012660448],"genre_scores_gemma":[0.61419094,0.00006788589,0.38138676,0.001700641,0.00008576919,0.00019416139,0.00009540454,0.0000103964485,0.002268023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932927,0.00008745381,0.00015259393,0.0001420381,0.00012824187,0.0001603975],"domain_scores_gemma":[0.9992406,0.00016741581,0.000054027732,0.0002593064,0.00021683394,0.00006186622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054070354,0.00005959074,0.00009792101,0.000044883247,0.000052138792,0.00009913398,0.00043341957,0.000033881355,0.00000878028],"category_scores_gemma":[0.00013235435,0.000055884062,0.000025081103,0.00033239558,0.0000056828767,0.00024266892,0.0001719846,0.000064737826,0.000022477456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075803914,0.00023054617,0.008702504,0.000003281464,0.000027919976,0.0000024064755,0.0012563765,0.00046943713,0.00009105739,0.1633794,0.16070776,0.66512173],"study_design_scores_gemma":[0.0008060913,0.000038965834,0.004977561,0.0000059864037,0.000001002001,7.718781e-7,0.00001985658,0.82050824,0.00010965061,0.0013138676,0.17211486,0.00010316748],"about_ca_topic_score_codex":0.000010859079,"about_ca_topic_score_gemma":0.00014490886,"teacher_disagreement_score":0.8200388,"about_ca_system_score_codex":0.0002083576,"about_ca_system_score_gemma":0.00004956444,"threshold_uncertainty_score":0.2278886},"labels":[],"label_agreement":null},{"id":"W1538771458","doi":"10.1109/isit.2008.4594971","title":"Security for wiretap networks via rank-metric codes","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Network packet; Information-theoretic security; Theoretical computer science; Coset; Computer network; Coding (social sciences); Linear code; Variable-length code; Adversary; Secure coding; Code (set theory); Algorithm; Mathematics; Decoding methods; Discrete mathematics; Block code; Computer security; Information security; Encryption","score_opus":0.045468772336824885,"score_gpt":0.29435961540063105,"score_spread":0.24889084306380616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538771458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028356275,0.0062181056,0.98237264,0.0010583112,0.0009975771,0.0007759043,0.000004353612,0.00044254027,0.00784702],"genre_scores_gemma":[0.91409016,0.021089261,0.06215886,0.0011455404,0.000348079,0.00024480687,0.00007275271,0.00002661972,0.0008239024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980009,0.00022422815,0.00044571288,0.00070651225,0.00023767052,0.00038496213],"domain_scores_gemma":[0.9967903,0.00053879165,0.00021721706,0.0019114742,0.00040544514,0.00013679308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058091694,0.00033184068,0.00047309411,0.00024130961,0.00040119674,0.00028559656,0.002854778,0.0002904557,0.00003725202],"category_scores_gemma":[0.00008706437,0.00031038278,0.0002752046,0.000715561,0.00007908562,0.00018390827,0.0033877396,0.00070882775,0.000018882523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048733455,0.00048503073,0.0005328218,0.00019180455,0.00040315435,0.0000151355525,0.00292464,0.088878706,0.000030643776,0.16570354,0.21624003,0.5245458],"study_design_scores_gemma":[0.0003058491,0.000032234228,0.00025056896,0.000047213067,0.000010759581,0.0000090789545,0.0000027347176,0.97397727,0.00007029311,0.00505688,0.019840585,0.0003965541],"about_ca_topic_score_codex":0.000019058618,"about_ca_topic_score_gemma":0.000049863236,"teacher_disagreement_score":0.92021376,"about_ca_system_score_codex":0.000096795295,"about_ca_system_score_gemma":0.00014083782,"threshold_uncertainty_score":0.99993485},"labels":[],"label_agreement":null},{"id":"W1540231437","doi":"10.1109/icc.2009.5199090","title":"Interference Aware Subcarrier Assignment for Throughput Maximization in OFDMA Wireless Relay Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subcarrier; Computer science; Throughput; Computer network; Relay; Wireless mesh network; Interference (communication); Wireless network; Wireless; Distributed computing; Orthogonal frequency-division multiplexing; Channel (broadcasting); Telecommunications","score_opus":0.03618330258922438,"score_gpt":0.2871746624702802,"score_spread":0.2509913598810558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540231437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002540094,0.00017830903,0.9911502,0.004076042,0.0001932754,0.0003438629,6.002472e-7,0.00011909197,0.0013985283],"genre_scores_gemma":[0.98653793,0.0009046836,0.010284738,0.0015011237,0.000044112163,0.00006311429,0.000009143692,0.0000063395146,0.0006488129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888194,0.00011420438,0.00029690322,0.00033161396,0.0001206016,0.000254749],"domain_scores_gemma":[0.99905837,0.000114324896,0.00008003598,0.0005545941,0.00013353064,0.000059173664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031816278,0.0001385882,0.00016952377,0.00007466155,0.0001396975,0.00015391457,0.0008440488,0.000072270755,0.000041627907],"category_scores_gemma":[0.000020930043,0.00012372198,0.000047435842,0.00048047962,0.00002058057,0.00043288287,0.00019320972,0.00015412598,0.0000036531444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026180363,0.00014947246,0.0018381148,0.000005497409,0.000012636512,0.0000021874125,0.001193922,0.015221802,0.0003452224,0.45261884,0.00471543,0.5238707],"study_design_scores_gemma":[0.00041664677,0.00009987963,0.0028585766,0.000068718844,0.0000023661025,0.0000012219667,0.000030402402,0.9937531,0.00056736,0.0009114579,0.0011083658,0.00018192468],"about_ca_topic_score_codex":0.0000037307038,"about_ca_topic_score_gemma":0.00007946597,"teacher_disagreement_score":0.9839978,"about_ca_system_score_codex":0.00009686517,"about_ca_system_score_gemma":0.000043247313,"threshold_uncertainty_score":0.50452363},"labels":[],"label_agreement":null},{"id":"W1542631986","doi":"10.1109/iccw.2015.7247310","title":"Performance analysis of interference-limited AF Relay Systems with Antenna Correlation","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Beamforming; Interference (communication); Computer science; Hop (telecommunications); Diversity gain; Relay channel; Antenna (radio); Antenna diversity; Signal-to-noise ratio (imaging); Expression (computer science); Topology (electrical circuits); Channel (broadcasting); Telecommunications; Electronic engineering; Mathematics; MIMO; Engineering; Physics; Power (physics)","score_opus":0.06202762133631129,"score_gpt":0.26370902882203795,"score_spread":0.20168140748572666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542631986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17647827,0.00019219557,0.8129787,0.0001293989,0.000103740924,0.00008524358,3.913955e-7,0.00007681462,0.009955269],"genre_scores_gemma":[0.9948189,0.00011810397,0.004166074,0.000038634218,0.0000066551743,0.000006459734,0.0000070051524,0.0000027670658,0.0008353612],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992354,0.00010191526,0.00022549539,0.00016086482,0.00017675826,0.00009958153],"domain_scores_gemma":[0.9987035,0.00006414283,0.00012714481,0.0005976661,0.00044365495,0.00006393644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033617497,0.00007760463,0.0001855483,0.0002623838,0.000052270756,0.00006134171,0.00052495115,0.000027432343,0.000010571215],"category_scores_gemma":[0.000024497584,0.00005491502,0.000030286545,0.001987226,0.000034666744,0.0003826797,0.00015188978,0.00008221402,0.000012255281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000150386,0.00026497673,0.5210284,0.000035913195,0.0013371347,0.000004044869,0.012067568,0.3213644,0.0008699561,0.09969113,0.0017510335,0.04143507],"study_design_scores_gemma":[0.0001771331,0.00012452019,0.019157574,0.00003950755,0.000046211208,0.0000022569907,0.0001227204,0.9799852,0.000042735588,0.0000019567967,0.00022001532,0.00008018824],"about_ca_topic_score_codex":0.000017350692,"about_ca_topic_score_gemma":0.000053513362,"teacher_disagreement_score":0.81834066,"about_ca_system_score_codex":0.000037183632,"about_ca_system_score_gemma":0.000050153896,"threshold_uncertainty_score":0.22393695},"labels":[],"label_agreement":null},{"id":"W1545265218","doi":"10.1109/pimrc.2014.7136190","title":"Soft forwarding device cooperation strategies for 5G radio access networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Computer network; Overhead (engineering); Telecommunications link; Radio access network; Cellular network; Exploit; User equipment; Radio resource management; Distributed computing; Base station; Telecommunications; Wireless; Wireless network; Mobile station; Computer security","score_opus":0.05973838923611131,"score_gpt":0.32446072013827804,"score_spread":0.26472233090216674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545265218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005486156,0.00018828674,0.9840818,0.0013142705,0.00028876183,0.0002729281,1.8846224e-7,0.00025156164,0.013053581],"genre_scores_gemma":[0.97678524,0.0001319205,0.02088494,0.0015669046,0.00019826398,0.00007319197,0.0000090561125,0.0000101234355,0.00034034316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901336,0.00012319897,0.00022866919,0.00028526422,0.000100583566,0.00024890894],"domain_scores_gemma":[0.9986448,0.0003841277,0.000070607806,0.0005731159,0.00025773238,0.000069598675],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005974742,0.00013102328,0.000156493,0.000059880538,0.00046812758,0.0012661316,0.0012622215,0.000054027973,0.00002353],"category_scores_gemma":[0.00007313945,0.00011500989,0.000057024517,0.00036044992,0.000025317517,0.0016658877,0.00019227371,0.0001053163,0.000009851035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043597756,0.000016076534,0.00010660835,0.000008638207,0.000012836451,9.614269e-8,0.00018698088,0.044691063,0.00020080901,0.80707043,0.0048246863,0.14287743],"study_design_scores_gemma":[0.0002847696,0.000042579573,0.00019638558,0.000017863433,0.0000038569683,0.0000018853201,0.000021016138,0.96670616,0.00036841028,0.0015907363,0.030596603,0.00016974303],"about_ca_topic_score_codex":0.0000057081666,"about_ca_topic_score_gemma":0.00012318155,"teacher_disagreement_score":0.97623664,"about_ca_system_score_codex":0.000031071137,"about_ca_system_score_gemma":0.00006700918,"threshold_uncertainty_score":0.99977064},"labels":[],"label_agreement":null},{"id":"W1545528108","doi":"","title":"Network Modulation : A New Dimension to Enhance Wireless Network Performance","year":2011,"lang":"en","type":"article","venue":"Theory and Applications of Satisfiability Testing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Dimension (graph theory); Modulation (music); Wireless network; Computer network; Wireless WAN; Wireless; Radio networks; Telecommunications; Key distribution in wireless sensor networks; Physics; Mathematics","score_opus":0.039141049212891,"score_gpt":0.2722447304205683,"score_spread":0.2331036812076773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545528108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24938191,0.0002268235,0.7473264,0.0001173341,0.000027491791,0.0004504566,5.1611386e-7,0.00011881247,0.0023502917],"genre_scores_gemma":[0.83063865,0.00004060563,0.16893023,0.00016233324,0.00008599452,0.0000750783,0.0000015125888,0.000006304472,0.00005929209],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875396,0.00021801138,0.00035316218,0.0003469179,0.00010725654,0.00022066588],"domain_scores_gemma":[0.9979486,0.0007466911,0.00015635372,0.0008598247,0.00017278912,0.000115739706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015733291,0.00012551897,0.00017365062,0.00003724318,0.0004010969,0.000028764485,0.00051722024,0.000040716368,0.0000129615755],"category_scores_gemma":[0.00013790447,0.00012558754,0.000020784424,0.0009686204,0.00008723722,0.00027605696,0.00043502613,0.00012043646,0.000007824563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013613521,0.000026598747,0.009199713,0.000014492317,0.000004092301,3.3481534e-8,0.0007204666,0.0029864423,0.0007456951,0.31344467,0.000059844828,0.6727843],"study_design_scores_gemma":[0.00026194085,0.0002887884,0.29556695,0.00042067046,0.000024884583,0.000008563193,0.00006503349,0.19270502,0.003322607,0.50543463,0.0012617629,0.0006391304],"about_ca_topic_score_codex":0.000014648574,"about_ca_topic_score_gemma":0.000009586831,"teacher_disagreement_score":0.6721452,"about_ca_system_score_codex":0.00001997298,"about_ca_system_score_gemma":0.000048826314,"threshold_uncertainty_score":0.5121311},"labels":[],"label_agreement":null},{"id":"W1546554898","doi":"10.1109/ccnc.2015.7157977","title":"A novel coding strategy for device-to-device communications","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Base station; Spectral efficiency; Computer network; Relay; Multicast; Coding (social sciences); Efficient energy use; Mobile device; Transmission (telecommunications); Mobile telephony; Channel (broadcasting); Telecommunications; Mobile radio; Electrical engineering; Engineering","score_opus":0.3219314652791804,"score_gpt":0.3929844793994301,"score_spread":0.07105301412024972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546554898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028409727,0.00029392642,0.95549613,0.010157308,0.0000976306,0.00038546103,0.0000023912528,0.00021185819,0.033071198],"genre_scores_gemma":[0.61970615,0.000069549445,0.3762195,0.0028534092,0.00003492072,0.00011051025,0.000007749187,0.000008477354,0.0009897476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911517,0.00007003011,0.00023192308,0.00022954158,0.00013460786,0.00021872004],"domain_scores_gemma":[0.9972003,0.00030474763,0.000056852365,0.0017131447,0.00050538825,0.00021958414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097281,0.000109480876,0.00013170515,0.00008694182,0.0002877471,0.00025312733,0.0026077032,0.000034503668,0.000008877571],"category_scores_gemma":[0.00014835692,0.000103074744,0.00004158047,0.0005907995,0.000030130299,0.00038131076,0.0010753544,0.00010679252,0.00009300498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000445631,0.00009998752,0.00005623553,0.0000046877203,0.000014535109,1.3454815e-7,0.0012116992,0.00048058335,0.0023481806,0.9218455,0.010016334,0.06391765],"study_design_scores_gemma":[0.0008742213,0.0001378823,0.00037677033,0.000040969957,0.000007237653,0.0000084693,0.00036485153,0.6128195,0.0007532875,0.0013617456,0.38291752,0.0003375779],"about_ca_topic_score_codex":0.000019183282,"about_ca_topic_score_gemma":0.0004178752,"teacher_disagreement_score":0.92048377,"about_ca_system_score_codex":0.00006792404,"about_ca_system_score_gemma":0.0001626225,"threshold_uncertainty_score":0.48458046},"labels":[],"label_agreement":null},{"id":"W1548609943","doi":"10.1109/icc.2015.7248832","title":"A power-efficient method to increase common rate in AF multi-way relay channels","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Relay; Computer science; Power (physics); Transmission (telecommunications); Mathematical optimization; Upper and lower bounds; Transmitter power output; Optimization problem; Scheme (mathematics); Computer network; Algorithm; Channel (broadcasting); Telecommunications; Mathematics; Transmitter","score_opus":0.08901201065801131,"score_gpt":0.35575069089460987,"score_spread":0.2667386802365985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548609943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03615385,0.00018468178,0.95267385,0.0037497797,0.00022928015,0.00031101215,5.690564e-7,0.00014927535,0.006547701],"genre_scores_gemma":[0.7494857,0.000011256448,0.24709465,0.0021917245,0.000013631113,0.00003660181,0.0000012154261,0.0000074517884,0.0011578179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980549,0.0008725784,0.00027876307,0.0003456112,0.00016976023,0.00027838247],"domain_scores_gemma":[0.99837387,0.00022570335,0.00005002291,0.00088278623,0.00015934624,0.00030829888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00250376,0.00014019704,0.00020131179,0.00020586835,0.000088756926,0.00014476903,0.0010925066,0.000044190707,0.000033949884],"category_scores_gemma":[0.00019217447,0.00012100223,0.000036731348,0.0010073835,0.000016981783,0.00016304557,0.001073699,0.00018482695,0.00022223733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014720281,0.0020383338,0.0023407051,0.000013240516,0.0000388751,0.00013162498,0.049394134,0.28702253,0.0076803262,0.3813152,0.024651399,0.24522641],"study_design_scores_gemma":[0.0009533374,0.00010581887,0.0026354524,0.000037168895,0.0000012878635,0.0000058678156,0.00013583997,0.9619143,0.0015691693,0.00010313181,0.032273505,0.0002651291],"about_ca_topic_score_codex":0.00012425642,"about_ca_topic_score_gemma":0.00025629677,"teacher_disagreement_score":0.7133318,"about_ca_system_score_codex":0.00011457705,"about_ca_system_score_gemma":0.000071482165,"threshold_uncertainty_score":0.4934328},"labels":[],"label_agreement":null},{"id":"W1550197964","doi":"10.1109/icc.2015.7248673","title":"Optimum decode-and-forward relay-assisted combining scheme with relay decision information","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Channel state information; Computer science; Maximal-ratio combining; Robustness (evolution); Cooperative diversity; Relay channel; Network packet; Diversity combining; Wireless; Antenna diversity; Channel (broadcasting); Diversity gain; MIMO; Computer network; Telecommunications; Fading","score_opus":0.04094802524530508,"score_gpt":0.2749784493309792,"score_spread":0.23403042408567412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550197964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037507758,0.00020272036,0.9425321,0.001104427,0.00009123063,0.000095523246,1.8415558e-7,0.00018635661,0.01827967],"genre_scores_gemma":[0.6013851,0.00015920395,0.3977611,0.0005521577,0.00000584281,0.000009311385,0.0000047589156,0.0000038986295,0.00011858101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916494,0.00005764216,0.00023539574,0.00014536188,0.00024805064,0.00014863648],"domain_scores_gemma":[0.9988321,0.00013567222,0.000091157395,0.0005286506,0.0002604034,0.00015200627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052588497,0.0000991499,0.00010705663,0.000101299884,0.00018794414,0.00029206055,0.0004805486,0.00004894425,0.000014801283],"category_scores_gemma":[0.000118737466,0.0000776082,0.00001883522,0.00042124063,0.00003576866,0.0016254697,0.00047102346,0.00014846202,0.00008383083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008753065,0.00005559334,0.0029674019,0.0000065516365,0.000034809094,0.0000039570505,0.003617657,0.0024674616,0.000065449174,0.31099018,0.011658516,0.66804487],"study_design_scores_gemma":[0.0017305665,0.00025637614,0.0032960575,0.00009703432,0.00000563929,0.000060593527,0.00025264686,0.95518965,0.0002499383,0.0004533968,0.038125288,0.00028283894],"about_ca_topic_score_codex":0.000004358063,"about_ca_topic_score_gemma":0.000020981555,"teacher_disagreement_score":0.9527222,"about_ca_system_score_codex":0.000040763432,"about_ca_system_score_gemma":0.00008569262,"threshold_uncertainty_score":0.31647706},"labels":[],"label_agreement":null},{"id":"W1551659937","doi":"10.1002/9781119970446.ch18","title":"The Market View","year":2011,"lang":"en","type":"other","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Femtocell; Telecommunications; Computer science; Wireless; Relay; Mobile telephony; Cellular network; Wireless network; Computer network; Business; Mobile radio","score_opus":0.045929710084249904,"score_gpt":0.27008386146174285,"score_spread":0.22415415137749295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551659937","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.9400182e-9,0.01107423,0.08436448,0.00062985416,0.00027221214,0.00008632475,1.7685603e-7,0.00023669396,0.90333605],"genre_scores_gemma":[0.0000134197,0.03158788,0.0072659226,0.0005201523,0.000056712455,0.000013305813,4.0342013e-7,0.000042655523,0.9604995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949354,0.000109974964,0.000079670725,0.00013717338,0.000071887465,0.000107729444],"domain_scores_gemma":[0.9986607,0.000063799765,0.00005499218,0.0011728572,0.000018962488,0.000028726407],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019521646,0.00009000504,0.00008039063,0.000030034415,0.00011527384,0.00010217041,0.0018613552,0.00004680113,0.007906995],"category_scores_gemma":[0.000010302272,0.00005063212,0.000033927012,0.00012726657,0.00003404394,0.000026666223,0.0005264017,0.00010306006,0.00074515014],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.0300836e-8,0.000002124959,6.744283e-7,9.29373e-7,0.0000055550304,1.6770446e-7,0.000010536321,1.6814663e-9,1.3432958e-7,0.15551026,0.6787543,0.1657152],"study_design_scores_gemma":[0.000023322704,0.0000037124207,0.000019264933,0.00003320861,0.0000010483233,9.571635e-7,8.74769e-7,0.00037096447,0.000002242578,0.00028796605,0.99917877,0.00007766694],"about_ca_topic_score_codex":0.000009899833,"about_ca_topic_score_gemma":0.00030115058,"teacher_disagreement_score":0.32042444,"about_ca_system_score_codex":0.0000066286734,"about_ca_system_score_gemma":0.000025377884,"threshold_uncertainty_score":0.9929999},"labels":[],"label_agreement":null},{"id":"W1553465133","doi":"10.1109/icassp.2015.7178548","title":"Optimal design and power allocation for multicarrier decode and forward relays","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Subcarrier; Computer science; Power (physics); Mathematical optimization; Optimization problem; Electric power system; Orthogonal frequency-division multiplexing; Electronic engineering; Engineering; Telecommunications; Mathematics; Algorithm","score_opus":0.07441029703889199,"score_gpt":0.30615970104605916,"score_spread":0.23174940400716718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553465133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065011154,0.0004368684,0.9900623,0.0018186324,0.00004889629,0.00031451057,2.3289e-7,0.000054766206,0.00076269463],"genre_scores_gemma":[0.4816908,0.000091483365,0.5176173,0.00028612182,0.0000070084843,0.000036434853,7.1806915e-7,0.0000032888065,0.000266888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995019,0.000057396694,0.00009957652,0.00017379728,0.000061689054,0.00010563095],"domain_scores_gemma":[0.9992835,0.00018254505,0.000023702913,0.0002501003,0.00014545726,0.00011468746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045690467,0.00006403948,0.00007076781,0.0000317635,0.00010268691,0.00011540941,0.00019503798,0.000029324085,0.0000037289553],"category_scores_gemma":[0.00011322107,0.000054565076,0.000010899291,0.000077165074,0.000032105745,0.00029405055,0.0001861647,0.000039396375,0.0000032136522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118441676,0.00010982318,0.0010479654,0.000013611155,0.00006854665,0.0000018152065,0.013103959,0.0060166153,0.0025685858,0.66651344,0.030193506,0.2802437],"study_design_scores_gemma":[0.00057570025,0.000120885656,0.00031797113,0.0000058191927,0.0000037244342,0.000006126216,0.000072336145,0.9807049,0.0008024652,0.0008600443,0.016422084,0.00010791254],"about_ca_topic_score_codex":9.91851e-7,"about_ca_topic_score_gemma":0.0000042495863,"teacher_disagreement_score":0.9746883,"about_ca_system_score_codex":0.000015049591,"about_ca_system_score_gemma":0.000035038287,"threshold_uncertainty_score":0.22250992},"labels":[],"label_agreement":null},{"id":"W1554859668","doi":"10.1109/isit.2011.6034126","title":"Multiple access demodulation in the lifted signal graph with spatial coupling","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Demodulation; Computer science; Graph; Detector; MIMO; Algorithm; Theoretical computer science; Topology (electrical circuits); Channel (broadcasting); Mathematics; Telecommunications; Combinatorics","score_opus":0.09289143116212133,"score_gpt":0.2798497176373325,"score_spread":0.18695828647521118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554859668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1324433,0.000032547607,0.86454564,0.0002743214,0.000029179057,0.0001519336,8.8600935e-8,0.00005705234,0.002465956],"genre_scores_gemma":[0.989653,0.000024147053,0.009897451,0.00037338966,0.00001668668,0.000018330122,0.0000017780119,0.0000030264307,0.000012189732],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941087,0.00006980705,0.00012258979,0.0001482429,0.00013380428,0.00011466421],"domain_scores_gemma":[0.9993657,0.00012699177,0.000042443153,0.000375974,0.00006717191,0.000021747885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030816894,0.00006727995,0.00006032369,0.000068906214,0.00013896178,0.00012391967,0.0010448697,0.000020065583,0.000047712092],"category_scores_gemma":[0.000012228155,0.00004071728,0.000015533276,0.00051086076,0.0000262635,0.00043598303,0.00012563133,0.00010790226,0.000005552227],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010265426,0.00044767823,0.693304,0.000008834411,0.000034841327,0.000017130911,0.018101696,0.01367939,0.001394768,0.11358563,0.00033601574,0.15898737],"study_design_scores_gemma":[0.0002729761,0.000033498196,0.24999893,0.000011552834,0.0000013017581,0.000002033215,0.000035533005,0.74822736,0.00081279874,0.0004476822,0.00007661179,0.000079737125],"about_ca_topic_score_codex":0.00015920111,"about_ca_topic_score_gemma":0.0023229143,"teacher_disagreement_score":0.8572097,"about_ca_system_score_codex":0.000009700075,"about_ca_system_score_gemma":0.000022281849,"threshold_uncertainty_score":0.19416451},"labels":[],"label_agreement":null},{"id":"W1555972352","doi":"10.1109/icc.2015.7248618","title":"Relay selection for average throughput maximization in buffer-aided relay networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; Unavailability; Throughput; Computer science; Computer network; Jitter; Selection (genetic algorithm); Transmission (telecommunications); Buffer (optical fiber); Wireless; Telecommunications; Reliability engineering; Engineering","score_opus":0.0646128523674201,"score_gpt":0.29380620570665894,"score_spread":0.22919335333923885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555972352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030089018,0.00021774469,0.9901968,0.0015170844,0.00033320815,0.0003520219,1.6456579e-7,0.0002009901,0.0041730395],"genre_scores_gemma":[0.8927002,0.00032925923,0.10404185,0.0007139155,0.00009882987,0.00007418359,0.000014054469,0.000012737773,0.002014956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988869,0.00018833709,0.00027069295,0.00029340034,0.00013213496,0.00022852534],"domain_scores_gemma":[0.9990406,0.00015674593,0.000074767726,0.00041456905,0.0002349749,0.00007832714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007484475,0.00011615646,0.00013936916,0.00009984853,0.00013911053,0.00013899565,0.0004943676,0.000087116954,0.000017208775],"category_scores_gemma":[0.00014539687,0.000108819666,0.00003888919,0.00077630824,0.000017271246,0.00060990447,0.00019429701,0.00016928381,0.000016164015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042419204,0.00012153246,0.0036557848,0.000005581282,0.000014568371,0.0000013886947,0.0016398968,0.6771407,0.00013049197,0.24661167,0.019716602,0.050919324],"study_design_scores_gemma":[0.00072695035,0.00008039847,0.00061307376,0.000016311602,0.0000017860532,0.000006085244,0.000014602203,0.9876896,0.0002070698,0.0008739067,0.0096251285,0.00014508812],"about_ca_topic_score_codex":0.000017751974,"about_ca_topic_score_gemma":0.00032274486,"teacher_disagreement_score":0.8896913,"about_ca_system_score_codex":0.00015646873,"about_ca_system_score_gemma":0.00007330532,"threshold_uncertainty_score":0.44375372},"labels":[],"label_agreement":null},{"id":"W1557827403","doi":"10.1109/icc.2015.7248540","title":"Multi-antenna cognitive AF relay systems with multiple primary receivers","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Relay; Maximal-ratio combining; Nakagami distribution; Cognitive radio; Fading; Interference (communication); Topology (electrical circuits); Computer science; Transmission (telecommunications); Antenna (radio); Upper and lower bounds; Ergodic theory; Signal-to-noise ratio (imaging); Electronic engineering; Mathematics; Telecommunications; Wireless; Engineering; Channel (broadcasting); Physics; Power (physics); Combinatorics","score_opus":0.0760524676628998,"score_gpt":0.2721256599863886,"score_spread":0.1960731923234888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557827403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009390789,0.0009365007,0.9723535,0.0004775572,0.0003548026,0.00038393415,0.0000019991667,0.00034018903,0.01576069],"genre_scores_gemma":[0.9475455,0.00017450454,0.048389237,0.00051556743,0.000028010385,0.000033691278,0.000008759396,0.000010266219,0.0032944535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988758,0.00021118311,0.00017052356,0.00030377542,0.00023021811,0.00020850815],"domain_scores_gemma":[0.99852043,0.0002140041,0.00007881865,0.0005163455,0.0004953492,0.00017502412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037879858,0.0001345235,0.00016488873,0.000071228926,0.00014571108,0.00015900742,0.00065179967,0.000040577932,0.000006850594],"category_scores_gemma":[0.00010798705,0.00009961624,0.000026842292,0.0004092002,0.000066493085,0.00050122064,0.0003288469,0.00015973639,0.00013608401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016684555,0.0043798517,0.30937734,0.00028597284,0.0016260225,0.00070589076,0.092060536,0.012834952,0.017564572,0.09029352,0.11180621,0.3573967],"study_design_scores_gemma":[0.0038243625,0.00026910123,0.010260482,0.000233924,0.000013703927,0.000043428965,0.0015274716,0.97053576,0.0002140846,0.0000068132945,0.012583048,0.00048781777],"about_ca_topic_score_codex":0.00003841719,"about_ca_topic_score_gemma":0.00010137191,"teacher_disagreement_score":0.9577008,"about_ca_system_score_codex":0.000091686146,"about_ca_system_score_gemma":0.00013459864,"threshold_uncertainty_score":0.40622327},"labels":[],"label_agreement":null},{"id":"W1558421735","doi":"10.1109/iccw.2015.7247297","title":"Relay selection for MIMO two-way relay networks with spatial multiplexing","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Multiplexing; Robustness (evolution); Computer science; Spatial multiplexing; Selection (genetic algorithm); Relay channel; Spectral efficiency; Transmission (telecommunications); Wishart distribution; Mathematical optimization; Computer network; Telecommunications; Mathematics; Channel (broadcasting); Artificial intelligence; Machine learning","score_opus":0.055164137321983484,"score_gpt":0.2892282630817134,"score_spread":0.2340641257597299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558421735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003073573,0.00016222158,0.9910297,0.0009677363,0.00028071,0.00032130393,2.7038865e-7,0.00029274548,0.003871743],"genre_scores_gemma":[0.7949165,0.000028613977,0.2032106,0.00041673466,0.00018919338,0.0000563153,0.0000065998083,0.000012831994,0.0011625973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989268,0.00012363777,0.00019970007,0.00031890563,0.00016269587,0.00026826537],"domain_scores_gemma":[0.99878705,0.00017421927,0.00008586077,0.0004604223,0.0003541809,0.00013828003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005503758,0.00013745102,0.00013877079,0.00006568842,0.00028387812,0.00017417036,0.0005386783,0.00005215066,0.00001253797],"category_scores_gemma":[0.000070069545,0.000108335524,0.000040320658,0.00043871172,0.000031198037,0.00040381402,0.00019315744,0.00018137367,0.000013934689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001523744,0.0001227766,0.0056617833,0.000005796202,0.00005901312,0.0000019561119,0.0016513807,0.70356697,0.00040175032,0.084814124,0.014788576,0.18877347],"study_design_scores_gemma":[0.0011428735,0.00020261569,0.00029600647,0.000021064412,0.000004319172,0.000011786436,0.0000205845,0.977328,0.00044078578,0.000060750026,0.02028946,0.00018172408],"about_ca_topic_score_codex":0.00007600944,"about_ca_topic_score_gemma":0.0016964051,"teacher_disagreement_score":0.79184294,"about_ca_system_score_codex":0.00008608063,"about_ca_system_score_gemma":0.00008127625,"threshold_uncertainty_score":0.44177943},"labels":[],"label_agreement":null},{"id":"W1559514898","doi":"10.1109/pimrc.2001.965273","title":"A theoretical characterization of the multihop wireless communications channel without diversity","year":2002,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decodes; Relay; Computer science; Channel (broadcasting); Wireless; Terminal (telecommunication); Relay channel; Antenna diversity; Computer network; Telecommunications; Decoding methods; Physics","score_opus":0.05564753705588,"score_gpt":0.25759972079386706,"score_spread":0.20195218373798707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559514898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24879405,0.0001610302,0.6886325,0.027505662,0.00029337255,0.00059643085,0.000006044032,0.0002564205,0.0337545],"genre_scores_gemma":[0.99721795,0.00051981193,0.0014433275,0.0004958328,0.000008497636,0.0000062497656,0.0000017500148,0.0000028990805,0.00030368203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928653,0.0002231109,0.00014073527,0.000115438495,0.00013910662,0.00009509104],"domain_scores_gemma":[0.99816984,0.00007700115,0.000078791934,0.0015105403,0.00013064533,0.000033178803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016159081,0.00006486639,0.00008917115,0.000029467854,0.0005276517,0.00003435764,0.0023639938,0.000029251223,0.00012786262],"category_scores_gemma":[0.000026240188,0.000044979006,0.000046489782,0.00036533244,0.00026947333,0.00019493527,0.0034588021,0.00011472134,0.000015483934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.0015705e-7,0.00010965266,0.002386521,0.0000021944215,0.000008217383,5.309188e-8,0.002834797,0.0000025405736,0.0048195156,0.9747945,0.00005739821,0.014983905],"study_design_scores_gemma":[0.00020826081,0.000012761401,0.019079776,0.000024462632,0.000004874192,0.0000018995794,0.00002628557,0.9768014,0.0022500681,0.00092183234,0.0005737771,0.00009461622],"about_ca_topic_score_codex":0.0000029503765,"about_ca_topic_score_gemma":0.000010815594,"teacher_disagreement_score":0.97679883,"about_ca_system_score_codex":0.000016284595,"about_ca_system_score_gemma":0.0000070764295,"threshold_uncertainty_score":0.43929282},"labels":[],"label_agreement":null},{"id":"W1559664397","doi":"10.1017/cbo9780511841453.006","title":"Diversity","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Diversity scheme; Multipath propagation; Diversity (politics); Computer science; Fading distribution; Channel state information; Diversity gain; Time diversity; Electronic engineering; Computer network; Telecommunications; Channel (broadcasting); Engineering; Rayleigh fading; Political science; Wireless","score_opus":0.043573294011651435,"score_gpt":0.2144453496776786,"score_spread":0.17087205566602715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559664397","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026824624,0.00013938111,0.03503117,0.00006937459,0.0003153211,0.00019881906,0.00001817256,0.00029205956,0.96390885],"genre_scores_gemma":[0.0023236028,0.00050795166,0.0014296804,0.00017103135,0.00008056197,2.3460743e-7,0.000010273456,0.000016694352,0.99546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988425,0.000047999256,0.00012902208,0.0004993164,0.00025531964,0.00022584938],"domain_scores_gemma":[0.99787164,0.00007264317,0.00016947894,0.0014703951,0.00023457114,0.00018128922],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00012813513,0.0002862355,0.00027540894,0.00015494606,0.0014898839,0.000075501215,0.0028538646,0.0003296067,0.000012020602],"category_scores_gemma":[0.000007697961,0.0003490472,0.00018278383,0.000013776966,0.00020075399,0.00019991507,0.010773854,0.0009067096,0.000047751862],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057658935,0.000005301223,0.0000016903966,0.0000074723844,0.000039670504,0.00006901351,0.00011060852,5.0250196e-7,0.000056254255,0.9849498,0.008234529,0.006519374],"study_design_scores_gemma":[0.00025756558,0.000019802115,0.000020062007,0.00004693082,0.00003433323,0.000009240179,0.0000022995055,0.00032745543,0.00021609341,0.000063355285,0.9986193,0.00038355857],"about_ca_topic_score_codex":0.000015680273,"about_ca_topic_score_gemma":0.000006333562,"teacher_disagreement_score":0.99038476,"about_ca_system_score_codex":0.00011841089,"about_ca_system_score_gemma":0.00009185399,"threshold_uncertainty_score":0.99989617},"labels":[],"label_agreement":null},{"id":"W1560820974","doi":"10.1109/icc.2015.7249002","title":"Optimized MIMO transmission and compression for interference mitigation with cooperative relay","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"MIMO; Relay; Computer science; Quantization (signal processing); Covariance matrix; Transmission (telecommunications); Covariance; Relay channel; Electronic engineering; Algorithm; Telecommunications; Channel (broadcasting); Mathematics; Engineering; Statistics","score_opus":0.05576582518232217,"score_gpt":0.29415326545811094,"score_spread":0.23838744027578876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560820974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048278477,0.00035066326,0.9900178,0.002365432,0.000045727582,0.00031604938,6.316939e-7,0.00009041348,0.0019854563],"genre_scores_gemma":[0.62480897,0.00015547685,0.3741367,0.00025845363,0.000011628644,0.000040232124,0.000007633025,0.000004774102,0.00057615765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993239,0.00011303497,0.0001356416,0.00022511292,0.000095757714,0.00010652149],"domain_scores_gemma":[0.99914366,0.00013659192,0.000043354597,0.0002515488,0.0002997025,0.00012513871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022865132,0.00009807386,0.0001221396,0.000039910217,0.00015899674,0.00012998389,0.0003003622,0.000032331922,0.000009107335],"category_scores_gemma":[0.000027029404,0.00006473951,0.000014313789,0.00015714057,0.00004926785,0.00041961623,0.00010781815,0.00007879765,0.0000023618843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011971669,0.00034476165,0.0005187429,0.000053848915,0.00008772877,0.000004800046,0.029115211,0.016633444,0.016330633,0.22901966,0.021486955,0.68520707],"study_design_scores_gemma":[0.002418258,0.00043657524,0.00012474023,0.00014654167,0.0000052473865,0.0000086115015,0.00015219268,0.97661597,0.010006161,0.00033503128,0.009565243,0.00018542595],"about_ca_topic_score_codex":0.0000025636543,"about_ca_topic_score_gemma":0.0000068297923,"teacher_disagreement_score":0.9599825,"about_ca_system_score_codex":0.000019947423,"about_ca_system_score_gemma":0.000059715647,"threshold_uncertainty_score":0.2640001},"labels":[],"label_agreement":null},{"id":"W1562220595","doi":"10.1002/wcm.2600","title":"Power allocation and transmission scheduling for a network with bidirectional relaying links","year":2015,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relay; Network packet; Linear network coding; Computer network; Scheduling (production processes); Markov decision process; Heuristic; Transmission (telecommunications); Transmission delay; Node (physics); Markov process; Mathematical optimization; Power (physics); Telecommunications; Mathematics","score_opus":0.041782859871759406,"score_gpt":0.29349751253520656,"score_spread":0.25171465266344717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562220595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06230089,0.007900119,0.92682165,0.0017689555,0.00006652026,0.00043990344,6.4933886e-7,0.00016727982,0.00053404935],"genre_scores_gemma":[0.73917556,0.0013669803,0.25913125,0.0001671562,0.000033871685,0.000077590164,0.0000112641255,0.000011829359,0.000024465142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889994,0.00017695427,0.00027689087,0.000303272,0.000124884,0.0002180562],"domain_scores_gemma":[0.9980649,0.00046144708,0.00013432083,0.0008514783,0.00033681208,0.0001510822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083613733,0.00014758356,0.00018084038,0.00007526122,0.001035597,0.00022563805,0.0006494774,0.000090804366,8.428928e-7],"category_scores_gemma":[0.00002195631,0.00013502045,0.000028085025,0.00038144566,0.00012043008,0.0002957561,0.0006014679,0.0003199057,7.6321385e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002960226,0.00012198504,0.0019512449,0.000028619559,0.0000518295,4.7903313e-7,0.0059447447,0.01343059,0.000644149,0.13045104,0.00017140261,0.8471743],"study_design_scores_gemma":[0.00066164974,0.00016970979,0.000435255,0.00022218273,0.000009494619,0.000028058623,0.00030088794,0.96463746,0.00005468595,0.0006132105,0.03265226,0.00021515424],"about_ca_topic_score_codex":0.000005832545,"about_ca_topic_score_gemma":0.000010099941,"teacher_disagreement_score":0.95120686,"about_ca_system_score_codex":0.000039247618,"about_ca_system_score_gemma":0.00010296349,"threshold_uncertainty_score":0.7965079},"labels":[],"label_agreement":null},{"id":"W1564421574","doi":"10.1155/2015/819195","title":"Resource Management Based on Security Satisfaction Ratio with Fairness-Aware in Two-Way Relay Networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Distributed Sensor Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Resource allocation; Relay; Node (physics); Distributed computing; Pairing; Resource management (computing); Computer network; Mathematical optimization; Power (physics)","score_opus":0.020405171197570206,"score_gpt":0.27905491397294224,"score_spread":0.25864974277537206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564421574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01127453,0.0001474705,0.98370296,0.00284842,0.0007621535,0.00018340973,0.000007739262,0.000052850435,0.001020452],"genre_scores_gemma":[0.99563324,0.00015289024,0.0031250722,0.0006318962,0.00033790627,0.000008305038,0.000070365735,0.000015175885,0.00002513031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752134,0.000431792,0.0006497562,0.00028606513,0.00083196955,0.0002790698],"domain_scores_gemma":[0.9977056,0.00024986736,0.00053124217,0.0004633581,0.00085217116,0.00019775283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000909199,0.0002270109,0.0002718814,0.0002937173,0.00009511781,0.00029619306,0.0011039032,0.0000779827,0.000016416834],"category_scores_gemma":[0.00005568922,0.0001937858,0.0000958353,0.00067017775,0.000054734675,0.00046198754,0.00019280537,0.00072591106,0.000004303543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034813714,0.0001224948,0.007731798,0.0000017158674,0.0000810213,0.00024556386,0.00012820344,0.9679938,0.0000017092372,0.006074229,0.0030969665,0.014174381],"study_design_scores_gemma":[0.0028980603,0.00018046853,0.013229069,0.0003055018,0.0000143333555,0.00008813834,0.00014525885,0.9790393,0.00001679101,0.00013857361,0.0037229543,0.00022152867],"about_ca_topic_score_codex":0.00001243999,"about_ca_topic_score_gemma":0.00013301571,"teacher_disagreement_score":0.9843587,"about_ca_system_score_codex":0.0005183376,"about_ca_system_score_gemma":0.00007830002,"threshold_uncertainty_score":0.7902356},"labels":[],"label_agreement":null},{"id":"W1564555699","doi":"10.1109/icc.2015.7249313","title":"PiPNC: Piggybacking Physical Layer Network Coding for multihop wireless networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Computer science; Computer network; Linear network coding; Wireless; Node (physics); Relay channel; Physical layer; Channel (broadcasting); Telecommunications; Network packet; Engineering","score_opus":0.10353694544212215,"score_gpt":0.32692293104185643,"score_spread":0.22338598559973427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564555699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004743653,0.00029347398,0.987381,0.000938543,0.0006207764,0.0003207052,3.7086696e-7,0.0003475302,0.0053539514],"genre_scores_gemma":[0.959782,0.00010020127,0.037459437,0.001088345,0.00086487655,0.000066236484,0.0000062734343,0.000019450514,0.0006131903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985158,0.00014944762,0.0002442261,0.00039042215,0.00020296297,0.0004971844],"domain_scores_gemma":[0.9981724,0.00045584477,0.00009676904,0.0007506256,0.00030945934,0.00021492159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006983456,0.00019345892,0.0002598943,0.00004172288,0.00035203298,0.00029299172,0.0011477589,0.000063948304,0.0000068532436],"category_scores_gemma":[0.00006565358,0.00017130503,0.00010747914,0.0005280036,0.000044786637,0.00046820875,0.00065872126,0.00021321235,0.000027841375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002600829,0.0001015282,0.0010680575,0.0000072549706,0.000043072057,0.0000027334843,0.0013523109,0.04796994,0.0002702872,0.68617547,0.044439554,0.21854377],"study_design_scores_gemma":[0.000626163,0.000057925146,0.00017082962,0.000035065925,0.0000057153725,0.000003085679,0.00003218008,0.98052835,0.00019814805,0.0012525191,0.01683948,0.0002505418],"about_ca_topic_score_codex":0.000004425137,"about_ca_topic_score_gemma":0.0000360436,"teacher_disagreement_score":0.9550383,"about_ca_system_score_codex":0.00007195315,"about_ca_system_score_gemma":0.00006766358,"threshold_uncertainty_score":0.69856167},"labels":[],"label_agreement":null},{"id":"W1565673794","doi":"","title":"Single-carrier equalization and distributed beamforming for asynchronous two-way relay networks","year":2013,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Transceiver; Beamforming; Computer science; Channel (broadcasting); Asynchronous communication; Equalization (audio); Interference (communication); Relay channel; Intersymbol interference; Electronic engineering; Power (physics); Telecommunications; Engineering; Wireless","score_opus":0.04953907120453908,"score_gpt":0.2650630082704354,"score_spread":0.21552393706589631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565673794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004617355,0.000752475,0.99037683,0.00037079555,0.00006877864,0.00032183,0.0000027798992,0.00022394412,0.003265211],"genre_scores_gemma":[0.97070616,0.00005981734,0.028533544,0.00035423916,0.000113632894,0.000027979506,0.00003882891,0.00002403607,0.00014173293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984703,0.0002571331,0.00035463247,0.0004307976,0.0001498492,0.000337292],"domain_scores_gemma":[0.99864227,0.00015504926,0.00021155362,0.00034027288,0.0005090632,0.00014180368],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005252153,0.00020375749,0.0001791472,0.000063583284,0.0006094948,0.0011291358,0.00069844077,0.00003595535,0.000037528356],"category_scores_gemma":[0.00008076066,0.00019038224,0.00003494764,0.00032562684,0.00010728881,0.0010321271,0.0003940413,0.00018467443,0.00001452325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006140281,0.0000411117,0.00013960965,0.00003077091,0.000011366948,0.0000019468264,0.0012167766,0.004283524,0.0069278753,0.012884955,0.00032617967,0.97412974],"study_design_scores_gemma":[0.00044527272,0.00010317057,0.00049208594,0.00019847196,0.000008494139,0.000010538528,0.000051824758,0.99338067,0.0004622765,0.0005046428,0.0040409938,0.00030159112],"about_ca_topic_score_codex":0.0000030170431,"about_ca_topic_score_gemma":0.000004006399,"teacher_disagreement_score":0.9890971,"about_ca_system_score_codex":0.000043071253,"about_ca_system_score_gemma":0.00006702806,"threshold_uncertainty_score":0.9999078},"labels":[],"label_agreement":null},{"id":"W1569046518","doi":"10.1002/wcm.2193","title":"Delay analysis in practical wireless network coding","year":2012,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Linear network coding; Exploit; Wireless network; Computer network; Queueing theory; Coding (social sciences); Network calculus; Scheduling (production processes); Maximum throughput scheduling; Wireless; Wireless WAN; Distributed computing; Dynamic priority scheduling; Round-robin scheduling; Wi-Fi array; Telecommunications; Mathematical optimization; Quality of service; Network packet; Computer security","score_opus":0.048163411731703284,"score_gpt":0.3345301321007554,"score_spread":0.2863667203690521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569046518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27540419,0.006891469,0.71389794,0.0010720554,0.00015969231,0.0003574052,0.0000010988985,0.00020686489,0.0020092658],"genre_scores_gemma":[0.9363635,0.004802452,0.058389883,0.00026117495,0.00007533812,0.00005783702,0.000016106222,0.000012844476,0.000020829719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976933,0.0007038439,0.0005451179,0.0003176761,0.00017341998,0.0005666478],"domain_scores_gemma":[0.9961395,0.0011622839,0.00021737788,0.0021654777,0.00012817275,0.00018718388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016399303,0.00020136764,0.00038455575,0.0002661333,0.00081955007,0.00023562703,0.0014634667,0.00008986207,0.000009012415],"category_scores_gemma":[0.000034327826,0.00020891892,0.00009536105,0.002366892,0.00015129875,0.000655483,0.0027961025,0.00052314956,0.000009514936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048446973,0.00045135245,0.12417829,0.000015828075,0.00020772738,0.0000029354687,0.0061016753,0.0031987526,0.00024322401,0.46959153,0.00020767676,0.39579615],"study_design_scores_gemma":[0.00025200876,0.000022838482,0.019227954,0.000070250426,0.000049281596,0.00002129205,0.00023504833,0.9708523,0.000022622346,0.00009130401,0.008859896,0.00029519355],"about_ca_topic_score_codex":0.000028071156,"about_ca_topic_score_gemma":0.00015030194,"teacher_disagreement_score":0.9676536,"about_ca_system_score_codex":0.000083560895,"about_ca_system_score_gemma":0.0000550606,"threshold_uncertainty_score":0.8519466},"labels":[],"label_agreement":null},{"id":"W1571783273","doi":"10.1109/iscc.2004.1358445","title":"Joint rate allocation and routing scheme in multihop cellular CDMA networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Base station; Telecommunications link; Heuristic; Knapsack problem; Cellular network; Relay; Joint (building); Mathematical optimization; Computer network; Code division multiple access; Scheme (mathematics); Throughput; Routing (electronic design automation); Resource allocation; Algorithm; Mathematics; Wireless; Telecommunications; Engineering","score_opus":0.03644804525447013,"score_gpt":0.2517901208195268,"score_spread":0.21534207556505666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571783273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099105746,0.0004199116,0.8965749,0.00237451,0.000070927425,0.00012581107,2.876672e-8,0.0000912974,0.0012368589],"genre_scores_gemma":[0.95843595,0.000332186,0.040528096,0.0005643528,0.000026236838,0.000008595492,0.0000018395265,0.000004547481,0.00009817423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992343,0.00009047108,0.00020736032,0.00022774911,0.00006513186,0.0001749522],"domain_scores_gemma":[0.99943215,0.000045557208,0.00004781002,0.00036786156,0.000054383167,0.00005221622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053305377,0.000088561224,0.00009891704,0.00006408772,0.00012687064,0.0001303292,0.0002916173,0.000038979942,0.000008063346],"category_scores_gemma":[0.00004150995,0.000083323335,0.000017625225,0.00036134277,0.00002530271,0.0003152556,0.0003323295,0.00015199787,0.000010917316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044619646,0.00010708504,0.0022784201,0.00000712517,0.000011145295,0.000010017909,0.0023548233,0.03059384,0.03034104,0.80939645,0.00006549099,0.124830075],"study_design_scores_gemma":[0.00054807874,0.00001915713,0.00620473,0.000048110232,7.419652e-7,0.000002046522,0.00003664873,0.98860884,0.0035671336,0.0005565048,0.00027124485,0.00013674774],"about_ca_topic_score_codex":0.000030364996,"about_ca_topic_score_gemma":0.00014612768,"teacher_disagreement_score":0.958015,"about_ca_system_score_codex":0.000054841898,"about_ca_system_score_gemma":0.000029453007,"threshold_uncertainty_score":0.3397827},"labels":[],"label_agreement":null},{"id":"W1578141933","doi":"10.1002/wcm.1168","title":"Variable‐rate adaptive modulation with optimum switching thresholds for cooperative systems with relay selection","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Independent and identically distributed random variables; Spectral efficiency; Rayleigh fading; Link adaptation; Relay; Computer science; Quadrature amplitude modulation; Fading; Modulation (music); Phase-shift keying; Control theory (sociology); Bit error rate; Mathematics; Topology (electrical circuits); Telecommunications; Algorithm; Statistics; Random variable; Power (physics); Channel (broadcasting); Physics","score_opus":0.047779443332043856,"score_gpt":0.2631568015452348,"score_spread":0.21537735821319093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578141933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07091012,0.00061419304,0.92608005,0.00006914867,0.000053438536,0.0007830551,0.000002329381,0.0001893526,0.0012983029],"genre_scores_gemma":[0.7577695,0.0002546766,0.24157107,0.00004608763,0.000022384638,0.00027342443,0.000013307336,0.000019922492,0.000029573945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857503,0.00032276803,0.00032487014,0.0003950092,0.000117746895,0.00026459654],"domain_scores_gemma":[0.99748486,0.00041371462,0.00026500114,0.0011369756,0.0006134337,0.00008603952],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00068370707,0.00021261435,0.0002386316,0.00011364941,0.0014826037,0.00027570006,0.0009316827,0.00007158759,0.0000018953843],"category_scores_gemma":[0.000011369013,0.00017907043,0.000025963178,0.000525001,0.00009678996,0.000589853,0.00054290885,0.00028765202,0.0000012272595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009928041,0.00021306754,0.0012942151,0.00003548528,0.00016086263,8.658945e-7,0.011819991,0.1336035,0.0013595093,0.7910491,0.000025964973,0.06033813],"study_design_scores_gemma":[0.00057860516,0.00056654966,0.0005553534,0.00025158425,0.000020636595,0.00003453421,0.0006002759,0.9963496,0.0001296373,0.00013318525,0.00050905836,0.00027102968],"about_ca_topic_score_codex":0.000087826054,"about_ca_topic_score_gemma":0.00013423708,"teacher_disagreement_score":0.86274606,"about_ca_system_score_codex":0.000060186667,"about_ca_system_score_gemma":0.00011881805,"threshold_uncertainty_score":0.9998173},"labels":[],"label_agreement":null},{"id":"W1580157616","doi":"10.1007/978-3-540-27821-4_16","title":"Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Binary logarithm; Radio networks; Graph; Computer science; Time complexity; Scheme (mathematics); Radio broadcasting; Log-log plot; Node (physics); Algorithm; Approximation algorithm; Discrete mathematics; Mathematics; Combinatorics; Theoretical computer science; Computer network; Wireless network; Telecommunications; Wireless; Physics","score_opus":0.03979449247252133,"score_gpt":0.27990688521995233,"score_spread":0.240112392747431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580157616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009864841,0.0018933387,0.9944291,0.00036262622,0.0013807585,0.0004989686,0.0000014266174,0.00023499223,0.0011001494],"genre_scores_gemma":[0.6386469,0.0009079452,0.3587357,0.0010893008,0.00030852348,0.000018435689,0.0000108952745,0.00005406672,0.00022821664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960842,0.00013820294,0.0008039828,0.0014573961,0.00058052165,0.00093570154],"domain_scores_gemma":[0.9968466,0.00073570065,0.00034013359,0.0016267485,0.0002340654,0.00021674247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009472427,0.0006080691,0.00069049146,0.0008623632,0.0003705983,0.0006434583,0.004008954,0.00033297788,0.00004220141],"category_scores_gemma":[0.00023177174,0.0006082425,0.00013147217,0.0013636061,0.0005555074,0.00047865213,0.0017377174,0.0013576895,0.000020377664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074458144,0.000055179717,0.00014868105,0.000019984755,0.000009060646,0.00016375665,0.0010789387,0.3003725,0.00007858692,0.012197635,0.0000060519283,0.6858622],"study_design_scores_gemma":[0.00089127553,0.00006459846,0.0008033738,0.0010647918,0.0000053600756,0.000053812848,1.4600933e-7,0.98761755,0.00007474427,0.008208048,0.00051178655,0.0007045055],"about_ca_topic_score_codex":0.00002392565,"about_ca_topic_score_gemma":0.0005265374,"teacher_disagreement_score":0.687245,"about_ca_system_score_codex":0.0008571974,"about_ca_system_score_gemma":0.0006997275,"threshold_uncertainty_score":0.9996369},"labels":[],"label_agreement":null},{"id":"W1585352813","doi":"10.1109/icc.2015.7248588","title":"Adaptive link selection in buffer-aided relaying with statistical QoS constraints","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Fading; Computer science; Quality of service; Computer network; Transmission (telecommunications); Transmitter power output; Node (physics); Constraint (computer-aided design); Power (physics); Telecommunications; Engineering; Transmitter","score_opus":0.07771158631233069,"score_gpt":0.2947759121878022,"score_spread":0.2170643258754715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585352813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003061885,0.00003485054,0.97687393,0.0009154245,0.000058977832,0.00013128328,4.1104886e-7,0.00010968534,0.018813536],"genre_scores_gemma":[0.8522311,0.000013559656,0.14729929,0.00023081689,0.000029126351,0.000018921903,0.0000012980131,0.000004048982,0.00017188638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910665,0.00019366489,0.0001568455,0.00021462893,0.00015960491,0.00016859281],"domain_scores_gemma":[0.9993232,0.00018099816,0.000036114725,0.00018761761,0.0001668534,0.00010524667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382601,0.00008626662,0.000110264904,0.00007731579,0.00007105182,0.00008123359,0.00029543033,0.000034522556,0.000051938187],"category_scores_gemma":[0.00009170661,0.00006958617,0.000008995841,0.00045652367,0.00008275624,0.000286446,0.00013110632,0.00020856621,0.00004050364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041525574,0.00006269444,0.0033992557,0.0000019267236,0.000013794887,0.000019353633,0.0015616383,0.0008711317,0.00014542101,0.82200867,0.002128074,0.1697465],"study_design_scores_gemma":[0.0019134971,0.00056148984,0.011579481,0.00008371908,0.0000049790183,0.0000892143,0.00042186386,0.97796315,0.0005455828,0.0042683864,0.0021787754,0.0003898571],"about_ca_topic_score_codex":0.000020637981,"about_ca_topic_score_gemma":0.00027143394,"teacher_disagreement_score":0.977092,"about_ca_system_score_codex":0.00009993944,"about_ca_system_score_gemma":0.00017248822,"threshold_uncertainty_score":0.28376415},"labels":[],"label_agreement":null},{"id":"W1586020639","doi":"10.1002/wcm.2244","title":"Applications of network coding to improve TCP performance over wireless mesh networks: a survey","year":2012,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Computer and Network Systems","keywords":"Computer science; Computer network; Wireless mesh network; Zeta-TCP; Transmission Control Protocol; TCP tuning; TCP delayed acknowledgment; Linear network coding; Network packet; Network performance; Wireless network; Wireless; Telecommunications","score_opus":0.02818282469493354,"score_gpt":0.2907791367424214,"score_spread":0.26259631204748785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586020639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20865649,0.0033404918,0.7860276,0.000123433,0.0002084794,0.00087131787,0.000006434336,0.00016416404,0.0006016004],"genre_scores_gemma":[0.97392005,0.0055818353,0.01970811,0.00025828907,0.00014570798,0.00028291508,0.00003265525,0.00002520256,0.000045253517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976534,0.00051621435,0.00067698373,0.0003655893,0.0002024636,0.0005853383],"domain_scores_gemma":[0.9951497,0.0010416727,0.0003540777,0.0028365364,0.00035542928,0.00026263934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001954071,0.00025406826,0.00040969305,0.00014057884,0.0010768659,0.0001513118,0.0024821546,0.00009462203,0.0000065549466],"category_scores_gemma":[0.000024975865,0.00026595176,0.00007097798,0.0014570458,0.00017846789,0.00046997366,0.0036583734,0.00038420275,0.000007626205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007811295,0.00023814126,0.0512859,0.000044281398,0.000051655523,7.0141276e-8,0.0020976707,0.0017690274,0.00057293684,0.08432908,0.00037081126,0.8592326],"study_design_scores_gemma":[0.0003102397,0.000080501224,0.044377662,0.00019145159,0.000013943825,0.000005779122,0.00009283583,0.94203806,0.00015657562,0.000022378452,0.012307114,0.00040344673],"about_ca_topic_score_codex":0.000046080688,"about_ca_topic_score_gemma":0.000061096274,"teacher_disagreement_score":0.94026905,"about_ca_system_score_codex":0.0000651124,"about_ca_system_score_gemma":0.00005976591,"threshold_uncertainty_score":0.99997926},"labels":[],"label_agreement":null},{"id":"W15874310","doi":"10.1049/el:20020371","title":"Jointly optimal transmit and receive diversity","year":2002,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transmit diversity; Fading; Maximal-ratio combining; Signal-to-noise ratio (imaging); Transmission (telecommunications); Computer science; Diversity gain; Antenna diversity; Diversity combining; Degradation (telecommunications); Constraint (computer-aided design); Diversity scheme; Electronic engineering; Outage probability; Telecommunications; Mathematics; Channel (broadcasting); Antenna (radio); Engineering","score_opus":0.02439220234241512,"score_gpt":0.21330546241574408,"score_spread":0.18891326007332895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15874310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33014452,0.009393821,0.57392895,0.08279093,0.0001566113,0.00022599686,9.0904825e-7,0.00028976245,0.0030684874],"genre_scores_gemma":[0.98393357,0.0037796318,0.0068736533,0.00520372,0.000026396667,0.0000033569645,7.865479e-7,0.000005088353,0.0001738182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925077,0.000076665885,0.00008726592,0.0002168671,0.00011488818,0.00025352795],"domain_scores_gemma":[0.99952376,0.00004837149,0.000029226789,0.00031739825,0.000023608114,0.00005765082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001306327,0.00008927197,0.00008807418,0.000048908598,0.00039190118,0.00008387886,0.00053985853,0.000023979741,0.00004656671],"category_scores_gemma":[0.0000072512803,0.00009232146,0.00003359086,0.00020617824,0.00004303858,0.0002686287,0.00034088377,0.00021844011,0.00002600922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001605349,0.00019184512,0.0019880692,0.000017599743,0.00017511933,0.000043381704,0.01983652,0.0009236421,0.039903745,0.15634356,0.07999474,0.70056576],"study_design_scores_gemma":[0.0024146077,0.00051531295,0.005288025,0.000055004595,0.0000424497,0.00010427029,0.000051419454,0.61078405,0.008305511,0.0010518213,0.3699889,0.0013986516],"about_ca_topic_score_codex":0.0000017126724,"about_ca_topic_score_gemma":0.000011321143,"teacher_disagreement_score":0.6991671,"about_ca_system_score_codex":0.00005980649,"about_ca_system_score_gemma":0.0000069107336,"threshold_uncertainty_score":0.376476},"labels":[],"label_agreement":null},{"id":"W1587917166","doi":"10.1007/978-3-642-01399-7_17","title":"Dimensioning and Location Planning for Wireless Networks under Multi-level Cooperative Relaying","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimensioning; Computer science; Relay; Software deployment; Wireless; Computer network; Wireless network; Computation; Throughput; Distributed computing; Key (lock); Mathematical optimization; Algorithm; Telecommunications; Engineering","score_opus":0.07174315380968027,"score_gpt":0.3039273096781059,"score_spread":0.2321841558684256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587917166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000909606,0.0031029328,0.9945992,0.00070653384,0.00053006393,0.00056306715,0.000001281471,0.00011975588,0.00028619324],"genre_scores_gemma":[0.50694174,0.0004106432,0.48947924,0.0024830238,0.00022838994,0.000021939308,0.000014016139,0.000033200387,0.00038781686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746686,0.00006586371,0.0004674099,0.0011524757,0.00034828903,0.0004991149],"domain_scores_gemma":[0.99718827,0.00087317446,0.00026657045,0.00086283655,0.00067241467,0.00013674943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009145405,0.00044321662,0.00044740055,0.00041443115,0.00088444224,0.0006314092,0.0014443921,0.00026272464,0.0000020143784],"category_scores_gemma":[0.0001064034,0.00042014275,0.000052592968,0.0006664341,0.0003741413,0.000603754,0.00095130526,0.00074446213,0.0000026359492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053086046,0.000012293779,0.000018091605,0.000008867775,0.00000800353,0.0000043274385,0.00070154585,0.36735585,0.00008703652,0.02571356,0.000012286913,0.60607284],"study_design_scores_gemma":[0.0004200672,0.000114306604,0.0003671985,0.0009003943,0.0000070077554,0.000023152246,7.8624396e-7,0.9917801,0.00015458779,0.005436513,0.00029167582,0.0005042211],"about_ca_topic_score_codex":0.000002215073,"about_ca_topic_score_gemma":0.000043502412,"teacher_disagreement_score":0.6244242,"about_ca_system_score_codex":0.0002354418,"about_ca_system_score_gemma":0.00031956763,"threshold_uncertainty_score":0.99982506},"labels":[],"label_agreement":null},{"id":"W1599531430","doi":"10.1109/iccw.2015.7247298","title":"Performance analysis of cooperative networks with optimum combining and Co-channel interference","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Memorial University of Newfoundland","funders":"","keywords":"Cumulative distribution function; Rayleigh fading; Interference (communication); Outage probability; Probability density function; Co-channel interference; Computer science; Fading; Maximal-ratio combining; Cooperative diversity; Expression (computer science); Diversity gain; Q-function; Channel (broadcasting); Probability of error; Electronic engineering; Algorithm; Topology (electrical circuits); Telecommunications; Mathematics; Statistics; Engineering; Electrical engineering","score_opus":0.05499971239072173,"score_gpt":0.28457370655822783,"score_spread":0.2295739941675061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599531430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11148973,0.00023961492,0.8778765,0.00016361177,0.000031285483,0.00008066926,4.6620735e-7,0.000051035062,0.010067087],"genre_scores_gemma":[0.99243075,0.00033255122,0.0068685277,0.0001596431,0.000005835565,0.0000073947863,0.0000049972123,0.0000035229323,0.00018675222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992473,0.00009370093,0.00018557742,0.0002118782,0.00012356578,0.0001379474],"domain_scores_gemma":[0.99895114,0.00009997278,0.000084358544,0.0004217211,0.0003396708,0.000103163096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033498826,0.00010789316,0.00024627952,0.00015775698,0.00009963259,0.00008512248,0.00047998517,0.000027104315,0.000011741603],"category_scores_gemma":[0.000015719239,0.00007946598,0.000021160236,0.0011586932,0.000109288936,0.00037502268,0.00029332278,0.00011608877,0.0000017549227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010255938,0.0001431642,0.03363589,0.000009850288,0.0008846884,0.000003374664,0.010950423,0.88452184,0.00008942737,0.042152572,0.0008405997,0.026665632],"study_design_scores_gemma":[0.0003101458,0.0002684109,0.003673253,0.00002740545,0.000036114994,0.0000026152004,0.0002037046,0.99511814,0.00018316276,0.000005542494,0.000055949593,0.00011558224],"about_ca_topic_score_codex":0.000006779429,"about_ca_topic_score_gemma":0.000052092706,"teacher_disagreement_score":0.88094103,"about_ca_system_score_codex":0.00001808074,"about_ca_system_score_gemma":0.000047607828,"threshold_uncertainty_score":0.32405287},"labels":[],"label_agreement":null},{"id":"W1602598878","doi":"10.1109/icc.2015.7248330","title":"Power efficient multicast for multiple description media in wireless mesh networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multicast; Computer science; Computer network; RSS; Quality of service; Source-specific multicast; Tree (set theory); Wireless network; Distributed computing; Wireless; Mathematics; Telecommunications","score_opus":0.0742858989359118,"score_gpt":0.2854057674596391,"score_spread":0.21111986852372727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602598878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045758247,0.00009470328,0.9514133,0.0005947433,0.00051122636,0.00031796528,5.5470093e-7,0.00011344864,0.0011958227],"genre_scores_gemma":[0.9713511,0.000034881035,0.028106313,0.00030007135,0.00003724843,0.000057644345,0.0000058804812,0.0000074425766,0.00009941365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990062,0.000106669904,0.00023180142,0.0002532342,0.0001481638,0.00025394795],"domain_scores_gemma":[0.9988196,0.0003127584,0.000045243873,0.0004752221,0.00021525988,0.0001319494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065208547,0.00010699248,0.00013613897,0.00008999507,0.000077842196,0.00011928688,0.0006155327,0.0000541125,0.00001069117],"category_scores_gemma":[0.00019067063,0.00009411364,0.000038816062,0.00038423878,0.000032306074,0.00019650065,0.00028436875,0.000114271614,0.000016105098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012816864,0.00088679115,0.008313128,0.0000100649095,0.000026392956,0.000008529802,0.01660185,0.03904662,0.0019429424,0.76969415,0.013743255,0.1495981],"study_design_scores_gemma":[0.0010046666,0.00003171458,0.0016802776,0.000017740454,9.5094333e-7,0.0000014969683,0.00014065891,0.9955233,0.00016280466,0.00008683898,0.0012187231,0.0001308531],"about_ca_topic_score_codex":0.0000066840635,"about_ca_topic_score_gemma":0.0003525486,"teacher_disagreement_score":0.9564766,"about_ca_system_score_codex":0.00009322054,"about_ca_system_score_gemma":0.00004495454,"threshold_uncertainty_score":0.38378426},"labels":[],"label_agreement":null},{"id":"W1603958972","doi":"","title":"New addressing scheme to increase reliability in MPLS with network coding","year":2013,"lang":"en","type":"article","venue":"University of Debrecen Electronic Archive (University of Debrecen)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Multiprotocol Label Switching; Linear network coding; Label switching; Network topology; Backbone network; Multicast; Network packet; Header; Network architecture; Circuit switching; Distributed computing; Quality of service","score_opus":0.011896679095168576,"score_gpt":0.1972328938073696,"score_spread":0.18533621471220102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603958972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20871879,0.00022010444,0.7811772,0.00331537,0.000037613547,0.0006409515,0.000004992679,0.000110174566,0.0057747653],"genre_scores_gemma":[0.80450857,0.0007299643,0.19398187,0.00013482844,0.000016848117,1.7886045e-7,0.000014000644,0.000012226843,0.0006015032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791723,0.00038235614,0.00018925118,0.0005471025,0.00029343637,0.0006706035],"domain_scores_gemma":[0.99804074,0.00032373518,0.00023649566,0.0008158594,0.00026162193,0.0003215298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038735184,0.00022503686,0.00044785297,0.0003271245,0.0004208291,0.000028419667,0.0019303869,0.000083076775,0.000394306],"category_scores_gemma":[0.000047956022,0.0002808328,0.000109608314,0.0013324107,0.00020387597,0.00097269384,0.0010701146,0.00044867554,0.000050361643],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021742233,0.0010870335,0.06049664,0.0002268026,0.0006412413,0.00009912724,0.037003823,0.01454687,0.020402322,0.1771529,0.04986363,0.6363054],"study_design_scores_gemma":[0.01497045,0.0029939942,0.30333918,0.0029284637,0.00022794945,0.0000783335,0.009123303,0.5246784,0.0010059525,0.024534596,0.1125165,0.003602907],"about_ca_topic_score_codex":0.0039415075,"about_ca_topic_score_gemma":0.01210641,"teacher_disagreement_score":0.63270247,"about_ca_system_score_codex":0.00030728086,"about_ca_system_score_gemma":0.00067850255,"threshold_uncertainty_score":0.99996436},"labels":[],"label_agreement":null},{"id":"W1607464581","doi":"10.1109/icc.2015.7248897","title":"Support of TCP in wireless mesh with unstable packet forwarding capacity","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; TCP Vegas; TCP Friendly Rate Control; TCP Westwood plus; Wireless mesh network; TCP global synchronization; Zeta-TCP; TCP tuning; TCP acceleration; Linear network coding; Network packet; CUBIC TCP; Packet forwarding; Network congestion; Wireless network; Wireless; Telecommunications","score_opus":0.07708830405074513,"score_gpt":0.2740020785261301,"score_spread":0.196913774475385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607464581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30412984,0.00003686241,0.58222675,0.0012166289,0.00009772999,0.00019647139,0.0000010386663,0.0001093274,0.11198532],"genre_scores_gemma":[0.9837667,0.00003542952,0.015505131,0.00021577596,0.0000069460766,0.000006591738,0.0000013112723,0.000003850092,0.00045831475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992365,0.00008590208,0.00017830181,0.00015796957,0.00017778407,0.00016349685],"domain_scores_gemma":[0.99914086,0.00005203637,0.000058531085,0.0004933571,0.0001732938,0.00008189548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700829,0.00007627271,0.0001599219,0.00007886117,0.000035733316,0.000040805793,0.00055524753,0.000024396837,0.000029986903],"category_scores_gemma":[0.000020483692,0.000059168975,0.00001851783,0.00053446525,0.00004377383,0.00040299288,0.00023707509,0.00009440984,0.000008861302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026403954,0.00017440399,0.049429353,0.000018221244,0.000026019554,0.000009090224,0.0050952835,0.00027968324,0.0013763789,0.9022034,0.01140392,0.029957859],"study_design_scores_gemma":[0.010263888,0.00176435,0.020720536,0.00048510832,0.000029029581,0.00012055231,0.0030099228,0.73027134,0.14243315,0.009544172,0.079050735,0.00230719],"about_ca_topic_score_codex":0.000053860982,"about_ca_topic_score_gemma":0.0005216573,"teacher_disagreement_score":0.8926592,"about_ca_system_score_codex":0.000046378256,"about_ca_system_score_gemma":0.00015445257,"threshold_uncertainty_score":0.24128407},"labels":[],"label_agreement":null},{"id":"W1620089381","doi":"10.1109/iwcmc.2015.7289172","title":"Decode-and-Forward vehicular relaying for 2&amp;#x00D7;2 MIMO LTE-advanced downlink","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"MIMO; Spatial multiplexing; Computer science; Telecommunications link; 3G MIMO; Antenna diversity; Wireless; Diversity gain; Orthogonality; Multi-user MIMO; Cooperative MIMO; Space–time block code; Computer network; Multiplexing; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.08576698000730017,"score_gpt":0.32276212684329075,"score_spread":0.2369951468359906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1620089381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018942518,0.0014238054,0.9704132,0.0035375936,0.00023525543,0.00029445437,8.850665e-7,0.00022541778,0.004926883],"genre_scores_gemma":[0.51376057,0.00037479567,0.48225954,0.0015023354,0.000047661706,0.000072727904,0.000008414447,0.000013103875,0.0019608724],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989367,0.00007854158,0.00023641094,0.00033523576,0.0001580367,0.00025503561],"domain_scores_gemma":[0.9985332,0.00020230531,0.000065035,0.00074045046,0.00026565325,0.00019334615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060560287,0.00013781208,0.0001756487,0.000070588765,0.00023884131,0.00016853366,0.00071159645,0.000056233213,0.000010351675],"category_scores_gemma":[0.00021564524,0.000118694894,0.000060763556,0.0002648405,0.000036760965,0.0004575333,0.0004914127,0.00012758297,0.00005133358],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003611495,0.00010207803,0.0017575322,0.000024573079,0.00006129245,0.0000025395748,0.0029715232,0.0033620768,0.0033466576,0.41973484,0.013227143,0.5553736],"study_design_scores_gemma":[0.0018798503,0.00014394845,0.0004908038,0.00005095038,0.000011408811,0.000013034154,0.0001098482,0.3196254,0.0013177715,0.0076752864,0.6681708,0.0005108998],"about_ca_topic_score_codex":0.0000036222366,"about_ca_topic_score_gemma":0.00005767404,"teacher_disagreement_score":0.65494365,"about_ca_system_score_codex":0.000049864535,"about_ca_system_score_gemma":0.00006696756,"threshold_uncertainty_score":0.48402372},"labels":[],"label_agreement":null},{"id":"W1624734503","doi":"10.1109/isit.2015.7282933","title":"Constructing multicast networks where vector linear coding outperforms scalar linear coding","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linear network coding; Scalar (mathematics); Conjecture; Multicast; Finite field; Mathematics; Discrete mathematics; Scalar multiplication; Scalar field; Combinatorics; Dimension (graph theory); Linear map; Topology (electrical circuits); Computer science; Pure mathematics","score_opus":0.06721237117439419,"score_gpt":0.30062604393362113,"score_spread":0.23341367275922695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1624734503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00909247,0.000645699,0.97562104,0.00183579,0.0009678668,0.0002629575,0.0000013289266,0.0005822941,0.0109905265],"genre_scores_gemma":[0.87412137,0.000328668,0.124078825,0.00043736643,0.00040795075,0.000012389003,0.0000072842463,0.00002391725,0.00058223354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791634,0.00019088441,0.00050395523,0.0004960278,0.00034513752,0.00054763147],"domain_scores_gemma":[0.99773,0.00031081485,0.00015988565,0.0009526385,0.00046392428,0.00038273897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010125259,0.00027653895,0.00033554545,0.000113156435,0.0004639003,0.00031949006,0.001290795,0.00012830872,0.000080687874],"category_scores_gemma":[0.0003073679,0.00023773008,0.0000968072,0.0006893346,0.00012854177,0.0007887431,0.0010613045,0.0005430302,0.00014455471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006140403,0.00026852256,0.036176395,0.000065637585,0.00018249713,0.00006106298,0.0056516477,0.020483807,0.0012202004,0.5428302,0.009019977,0.38397864],"study_design_scores_gemma":[0.000702867,0.00005926152,0.00015019493,0.0001159369,0.000007165866,0.0000395182,0.000527504,0.9915474,0.0006694457,0.00003943802,0.0057941466,0.0003471036],"about_ca_topic_score_codex":0.000016167734,"about_ca_topic_score_gemma":0.00009814125,"teacher_disagreement_score":0.9710636,"about_ca_system_score_codex":0.00017451745,"about_ca_system_score_gemma":0.000120529796,"threshold_uncertainty_score":0.96943516},"labels":[],"label_agreement":null},{"id":"W1625177436","doi":"10.1109/wcnc.2005.1424647","title":"A simple cooperative diversity scheme based on orthogonal signaling","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cooperative diversity; Diversity gain; Computer science; Phase-shift keying; Keying; Algorithm; Electronic engineering; Bit error rate; Quadrature amplitude modulation; Telecommunications; Control theory (sociology); Topology (electrical circuits); Mathematics; Fading; Engineering; Decoding methods; Artificial intelligence","score_opus":0.04896544130616518,"score_gpt":0.2798047095162456,"score_spread":0.2308392682100804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625177436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05545612,0.000057433917,0.9130367,0.004444715,0.00005323207,0.00015317295,0.0000016585178,0.00027778823,0.026519148],"genre_scores_gemma":[0.96285063,0.000012172853,0.031059556,0.005637217,0.000050482886,0.0000028251443,0.0000045622605,0.0000035836706,0.0003789714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912274,0.000115114555,0.00012561661,0.00024956412,0.00021154857,0.00017539221],"domain_scores_gemma":[0.9990958,0.00017275788,0.00003490886,0.00046368208,0.0001481944,0.000084663225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025656345,0.00010687537,0.00010002524,0.00006755419,0.00064899423,0.000104555365,0.00075984624,0.000029214152,0.00056557456],"category_scores_gemma":[0.00003863386,0.0000935121,0.00004836992,0.00035116356,0.000030875704,0.00031722398,0.0007299406,0.00014986782,0.00013242253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005237273,0.0006020618,0.010977894,0.000005884254,0.000048256232,0.000011619188,0.0019560612,0.1025597,0.0050396966,0.7435743,0.014517473,0.12065466],"study_design_scores_gemma":[0.00038308062,0.00006250044,0.0010082377,0.000009949334,0.0000013748893,6.0650007e-7,0.0000137554525,0.97846067,0.0033876295,0.00008370718,0.016429042,0.00015943873],"about_ca_topic_score_codex":0.0000024115227,"about_ca_topic_score_gemma":0.000040924206,"teacher_disagreement_score":0.9073945,"about_ca_system_score_codex":0.000058076334,"about_ca_system_score_gemma":0.000061511644,"threshold_uncertainty_score":0.6192645},"labels":[],"label_agreement":null},{"id":"W1634702529","doi":"10.1109/iwcmc.2015.7289128","title":"Performance enhancement of multi-hop wireless systems by optimizing the number and location of relays","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Outage probability; Computer science; Wireless; Path loss; Hop (telecommunications); Computer network; Wireless network; Fading; Telecommunications; Channel (broadcasting)","score_opus":0.05363342454436563,"score_gpt":0.28181467086238854,"score_spread":0.22818124631802292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634702529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2078686,0.0015468203,0.78724843,0.00027925862,0.000104562096,0.00020422607,1.7319798e-7,0.00001911821,0.0027288182],"genre_scores_gemma":[0.9894288,0.0008402345,0.009215608,0.000034097582,0.000005154026,0.000017198205,8.460956e-7,0.0000023571804,0.00045570836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994291,0.000079963545,0.00019804445,0.000097620206,0.00012549912,0.00006974369],"domain_scores_gemma":[0.9990279,0.000054330136,0.000108749824,0.0003695863,0.00040960222,0.000029802703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045244978,0.000052821375,0.00009253732,0.000014022402,0.000060263832,0.000027068563,0.0003703795,0.0000177845,0.000002687963],"category_scores_gemma":[0.000017430026,0.00003578089,0.0000071134505,0.00028629223,0.000049852326,0.00019540376,0.00020694199,0.00004868036,0.0000037239397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007530136,0.0009946184,0.03355152,0.00069313607,0.00021023811,6.4598686e-7,0.04830599,0.028988438,0.10858395,0.2150709,0.022983933,0.54054135],"study_design_scores_gemma":[0.00023211034,0.000027639302,0.00022995893,0.000075925134,0.0000021470055,0.0000017682023,0.00022529287,0.98385835,0.01456473,0.000001708586,0.0007277984,0.00005258828],"about_ca_topic_score_codex":0.00002306427,"about_ca_topic_score_gemma":0.000002973541,"teacher_disagreement_score":0.95486987,"about_ca_system_score_codex":0.00001874765,"about_ca_system_score_gemma":0.000037655656,"threshold_uncertainty_score":0.14591023},"labels":[],"label_agreement":null},{"id":"W1644377443","doi":"10.1109/cwit.2009.5069553","title":"A greedy omnidirectional relay scheme","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Additive white Gaussian noise; Omnidirectional antenna; Relay; Computer science; Greedy algorithm; Channel (broadcasting); Scheme (mathematics); Duplex (building); Gaussian; Algorithm; Mathematical optimization; Mathematics; Topology (electrical circuits); Telecommunications; Combinatorics; Physics; Mathematical analysis","score_opus":0.034045616513964407,"score_gpt":0.27947163116923723,"score_spread":0.24542601465527283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644377443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004224877,0.0004704032,0.7405195,0.016147872,0.00018708046,0.000074687836,9.40998e-8,0.00048616048,0.23788927],"genre_scores_gemma":[0.8496003,0.00017261131,0.14108373,0.0033787692,0.000056325774,0.0000033127983,9.0288535e-7,0.0000018702361,0.005702144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995352,0.000035687244,0.000089751185,0.0001376048,0.00010134672,0.000100419384],"domain_scores_gemma":[0.9994637,0.000030198738,0.000018691599,0.00037806283,0.00006488658,0.000044458622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001351697,0.000051500294,0.00005041738,0.000041879597,0.00014130988,0.000072504314,0.00048513504,0.000019112184,0.00013214182],"category_scores_gemma":[0.000020226496,0.00004479134,0.000027884684,0.0003157033,0.000010584076,0.00024750282,0.00009582562,0.000084268766,0.00014568875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.612974e-7,0.000037109414,0.00014192158,2.0064644e-7,0.0000028905224,0.0000010271508,0.00009682366,0.000019489136,0.0017871301,0.84373325,0.011341788,0.14283739],"study_design_scores_gemma":[0.00068686163,0.00021283429,0.055847276,0.000028636408,0.0000023838625,0.000060466806,0.000015281777,0.4792385,0.0039260047,0.010483403,0.44898996,0.0005083953],"about_ca_topic_score_codex":8.951787e-7,"about_ca_topic_score_gemma":0.0000056059303,"teacher_disagreement_score":0.8453755,"about_ca_system_score_codex":0.0000193668,"about_ca_system_score_gemma":0.000024351699,"threshold_uncertainty_score":0.18725829},"labels":[],"label_agreement":null},{"id":"W1646744266","doi":"10.1109/isit.2015.7282861","title":"Embedded MDS codes for multicast streaming","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer science; Erasure; Channel (broadcasting); Network packet; Erasure code; Separable space; Computer network; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Decoding methods","score_opus":0.11424017481141947,"score_gpt":0.34464682930304325,"score_spread":0.23040665449162379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646744266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033612598,0.00013872817,0.9807902,0.0011168006,0.00012507389,0.00013362062,6.225287e-7,0.00015839732,0.0141753275],"genre_scores_gemma":[0.7722261,0.000019672294,0.22598892,0.00036106573,0.000035024834,0.000020712749,0.000002365508,0.0000036008105,0.0013425107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949825,0.00004066829,0.00010645412,0.00014229977,0.0000817946,0.00013054328],"domain_scores_gemma":[0.9991361,0.0001421991,0.000024603756,0.0004212735,0.00018570623,0.00009015382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025785662,0.000060650258,0.00007708982,0.00003219988,0.00009623215,0.00011330934,0.0005442885,0.000019132682,0.000010981466],"category_scores_gemma":[0.000114842376,0.000050880633,0.000026241265,0.00014413048,0.000018611738,0.00021821678,0.00023050114,0.000040386745,0.000027802786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008123793,0.00009053323,0.0003056648,0.0000048204142,0.000017675644,0.0000010787301,0.0033229042,0.00029104174,0.0014451594,0.6013342,0.018872947,0.37430584],"study_design_scores_gemma":[0.0006368169,0.000067710534,0.0001946887,0.000010953118,0.000002339249,0.0000029524956,0.00022651862,0.9518046,0.0026788472,0.0013474541,0.042879965,0.00014717077],"about_ca_topic_score_codex":0.000002479969,"about_ca_topic_score_gemma":0.000033011936,"teacher_disagreement_score":0.9515135,"about_ca_system_score_codex":0.000023446111,"about_ca_system_score_gemma":0.000043689677,"threshold_uncertainty_score":0.2074852},"labels":[],"label_agreement":null},{"id":"W1663693503","doi":"10.1109/isit.2015.7282860","title":"Convolutional codes with maximum column sum rank for network streaming","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Column (typography); Hamming(7,4); Hamming distance; Convolutional code; Diagonal; Computer science; Rank (graph theory); Code (set theory); Linear code; Mathematics; Algorithm; Discrete mathematics; Block code; Combinatorics; Computer network; Decoding methods","score_opus":0.060520462322609,"score_gpt":0.28053314511313404,"score_spread":0.22001268279052505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1663693503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018537723,0.00049039547,0.9859105,0.001732026,0.00017350928,0.00024024532,0.0000018662412,0.00016149144,0.0094362],"genre_scores_gemma":[0.74424124,0.00005562235,0.2522815,0.00089739036,0.000174411,0.00007366472,0.000017841612,0.000009621434,0.002248697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991677,0.00006847865,0.00014397533,0.00021180914,0.00016372629,0.00024432087],"domain_scores_gemma":[0.9988669,0.000210567,0.000052130352,0.00040660932,0.00034465658,0.00011911213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042846543,0.000097349555,0.00012785195,0.000027363076,0.00023833195,0.0001449471,0.000576984,0.000029619041,0.000020214933],"category_scores_gemma":[0.000033901822,0.00007972089,0.000029250532,0.00027881455,0.00005813827,0.00026422614,0.00020482446,0.000070885624,0.000015527272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007407201,0.00008541489,0.0074794125,0.000007905029,0.00005905451,0.0000023403109,0.0004566505,0.007246424,0.000054530436,0.8584576,0.085033804,0.041042745],"study_design_scores_gemma":[0.0026709372,0.0002833363,0.0038901267,0.00006657278,0.000012241395,0.000021771808,0.00013676715,0.7932349,0.00014723054,0.01072791,0.18836534,0.0004428637],"about_ca_topic_score_codex":0.00000836449,"about_ca_topic_score_gemma":0.0002023022,"teacher_disagreement_score":0.84772974,"about_ca_system_score_codex":0.00005193134,"about_ca_system_score_gemma":0.00017042604,"threshold_uncertainty_score":0.32509235},"labels":[],"label_agreement":null},{"id":"W1717826710","doi":"10.1007/s11276-015-1055-4","title":"Performance analysis of threshold digital relaying M2M cooperative networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Phase-shift keying; Computer science; Fading; Keying; Nakagami distribution; Binary number; Modulation (music); Algorithm; Bit error rate; Power (physics); Telecommunications; Mathematics; Arithmetic; Decoding methods; Physics","score_opus":0.039983502921819375,"score_gpt":0.2633315330109311,"score_spread":0.22334803008911172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1717826710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19247822,0.0014289294,0.7967138,0.00017078056,0.00036273347,0.00018578398,0.0000021338003,0.000182307,0.008475305],"genre_scores_gemma":[0.9975411,0.0011056116,0.0006949898,0.00022422768,0.00012039058,0.000022366636,0.00004462083,0.000017292437,0.00022934368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811494,0.00012650304,0.0005407154,0.00044841052,0.00033981234,0.00042964294],"domain_scores_gemma":[0.9976773,0.00019077167,0.00025271135,0.0011568497,0.00049723923,0.00022507327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005836852,0.00025435895,0.0005366287,0.000253774,0.00023855228,0.00028950654,0.0014385659,0.00013751454,0.000013654476],"category_scores_gemma":[0.000032229356,0.00023325742,0.00016828287,0.003556056,0.0001440123,0.0009971973,0.00077044225,0.00042042867,0.000008816392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021518683,0.000064120904,0.021527305,0.0000026172168,0.00032548036,0.0000035145276,0.00061900605,0.9022153,0.000008040395,0.015213917,0.0010071537,0.05899202],"study_design_scores_gemma":[0.0003632799,0.00008275309,0.0036750552,0.00005118997,0.00007815309,0.0000029274647,0.000059323986,0.994839,0.000023282839,0.0000134601005,0.000541169,0.00027038335],"about_ca_topic_score_codex":0.0000033368906,"about_ca_topic_score_gemma":0.000026927566,"teacher_disagreement_score":0.80506295,"about_ca_system_score_codex":0.00008296204,"about_ca_system_score_gemma":0.00008846698,"threshold_uncertainty_score":0.95119613},"labels":[],"label_agreement":null},{"id":"W1717978628","doi":"10.1007/978-1-84882-765-3","title":"Algorithms for Next Generation Networks","year":2010,"lang":"en","type":"book","venue":"Computer communications and networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Blinding; Pace; Computer science; Everyday life; Foundation (evidence); Data science; Telecommunications; Political science; Geography; MEDLINE","score_opus":0.11916405523428458,"score_gpt":0.30275852333791986,"score_spread":0.18359446810363528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1717978628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017532129,0.02613661,0.9592518,0.0016961056,0.0014703746,0.0009712384,0.000008531015,0.00030980774,0.010153772],"genre_scores_gemma":[0.0033897925,0.13727033,0.7762817,0.003901963,0.006106356,0.0007478419,0.0023252482,0.00018458268,0.069792174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751747,0.00025497645,0.00073982734,0.00080893445,0.0001882103,0.0004906028],"domain_scores_gemma":[0.99241906,0.00089747296,0.00045195513,0.005453475,0.00054095767,0.00023708341],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007516913,0.0005535062,0.0006136545,0.00021578187,0.0014474292,0.0011646799,0.004813972,0.0007532359,0.000014413744],"category_scores_gemma":[0.000013767654,0.00057727395,0.00023708776,0.00028693353,0.0003227967,0.0005371662,0.003994409,0.0016739187,0.000009318818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022286301,0.000050247534,0.000002191903,0.000010732915,0.00007406623,6.8233373e-7,0.00012252659,0.0010001527,0.000008019565,0.182921,0.09050578,0.72530234],"study_design_scores_gemma":[0.00023528415,0.00006855584,0.000008079608,0.000075927965,0.000026554351,0.000013005721,7.7145853e-7,0.58232844,6.0232475e-7,0.0009854002,0.4158911,0.00036628422],"about_ca_topic_score_codex":0.0000020701168,"about_ca_topic_score_gemma":0.000117499825,"teacher_disagreement_score":0.72493607,"about_ca_system_score_codex":0.00010625287,"about_ca_system_score_gemma":0.00022140818,"threshold_uncertainty_score":0.9998722},"labels":[],"label_agreement":null},{"id":"W1738459908","doi":"10.1007/978-3-642-29222-4_10","title":"Optimal Channel Pairing and Power Allocation for Multi-channel Multi-hop Relay Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"","keywords":"Pairing; Relay; Subcarrier; Computer science; Hop (telecommunications); Orthogonal frequency-division multiplexing; Sorting; Channel (broadcasting); Mathematical optimization; Power (physics); Computer network; Algorithm; Mathematics","score_opus":0.052302534681326285,"score_gpt":0.2672891549076362,"score_spread":0.21498662022630993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1738459908","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069021684,0.0033124206,0.99422127,0.0008019378,0.0005529142,0.00083086593,0.000021278061,0.000083544626,0.00010674285],"genre_scores_gemma":[0.045241393,0.0010996426,0.9530895,0.00022804941,0.00013098479,0.00007582892,0.00003853656,0.000024511699,0.0000715899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867654,0.000020972053,0.00061453704,0.00020669898,0.00016225847,0.00031898377],"domain_scores_gemma":[0.9980962,0.00037662085,0.000466672,0.000689968,0.00029028166,0.00008020739],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006801188,0.00032736655,0.00037302892,0.0001888901,0.0013771132,0.00026297694,0.0017188246,0.0002467887,4.696816e-7],"category_scores_gemma":[0.00007671603,0.0002816244,0.00017169304,0.00019569737,0.0003311542,0.0005755579,0.0012897792,0.00042900414,3.0743357e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017319863,0.00002061682,0.0000014342608,0.000078343954,0.00006228206,1.8300048e-8,0.0027965957,0.9568755,0.000005328721,0.025216714,0.000037518563,0.014903886],"study_design_scores_gemma":[0.00036288195,0.000050812803,0.0000507196,0.00020553995,0.000032849068,0.0000070093697,0.000007570196,0.9893453,0.000026129366,0.00007292347,0.009516478,0.0003217858],"about_ca_topic_score_codex":0.0000058687683,"about_ca_topic_score_gemma":0.000051211748,"teacher_disagreement_score":0.04517237,"about_ca_system_score_codex":0.00006575464,"about_ca_system_score_gemma":0.00008608406,"threshold_uncertainty_score":0.9999636},"labels":[],"label_agreement":null},{"id":"W1742573363","doi":"10.1002/dac.2576","title":"Optimal power‐aware relay placement for cooperative wireless sensor networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Relay; Computer science; Cooperative diversity; Computer network; Wireless sensor network; Wireless; Wireless network; Power (physics); Hop (telecommunications); Telecommunications","score_opus":0.030317963598766602,"score_gpt":0.3023736404099393,"score_spread":0.2720556768111727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1742573363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015879007,0.002731307,0.97308606,0.0054835426,0.0013561648,0.00056326564,0.00000478755,0.00004658382,0.0008492638],"genre_scores_gemma":[0.9811314,0.0019081116,0.015865456,0.00036271953,0.00017466038,0.00010387887,0.000016270207,0.00001545133,0.0004220805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976821,0.00050833664,0.0009548135,0.00016492291,0.0005017539,0.00018807036],"domain_scores_gemma":[0.9932378,0.00069498207,0.0009002768,0.0008182473,0.004229363,0.000119335666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010446998,0.00016999438,0.00029348934,0.00020742281,0.0002404291,0.00071981724,0.0033790944,0.000080034144,0.000043644162],"category_scores_gemma":[0.00010660073,0.00014805363,0.00014347282,0.00021745314,0.00006550494,0.0010684698,0.00049002253,0.00032972265,0.00002802469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011155966,0.00034872358,0.00048918126,0.000005558964,0.0007303693,0.000006360616,0.0037939756,0.8332007,0.0010922505,0.11187486,0.03155557,0.016790885],"study_design_scores_gemma":[0.0012989314,0.00019600551,0.00043759574,0.000299139,0.000010476976,0.000110288616,0.001000981,0.9472106,0.0002120813,0.000041951527,0.04894799,0.00023397226],"about_ca_topic_score_codex":0.000010960768,"about_ca_topic_score_gemma":0.0000036214487,"teacher_disagreement_score":0.96525234,"about_ca_system_score_codex":0.00022145448,"about_ca_system_score_gemma":0.00012686285,"threshold_uncertainty_score":0.6941214},"labels":[],"label_agreement":null},{"id":"W1747005659","doi":"10.1109/wcl.2013.120513.130762","title":"Impact of Co-Channel Interference on the Performance of Multi-Hop Relaying over Nakagami-m Fading Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Fading; Nakagami distribution; Fading distribution; Rayleigh fading; Hop (telecommunications); Computer science; Diversity gain; Interference (communication); Channel (broadcasting); Channel state information; Co-channel interference; Weibull fading; Topology (electrical circuits); Telecommunications; Mathematics; Wireless","score_opus":0.0692030566188243,"score_gpt":0.31781786724292005,"score_spread":0.24861481062409574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1747005659","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8483257,0.0000925486,0.14832029,0.0024420188,0.00013784744,0.00021950861,0.000003856257,0.000062500345,0.0003956722],"genre_scores_gemma":[0.9965586,0.0007369583,0.0019046032,0.0006848607,0.000021847878,0.000048631824,0.0000054965685,0.000016671369,0.000022350208],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981333,0.0006443774,0.0005003142,0.00024163914,0.0002244242,0.00025593134],"domain_scores_gemma":[0.99440634,0.0011573153,0.00041763106,0.0037648142,0.00019532429,0.00005859738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082095177,0.00020692364,0.0002928725,0.00020409033,0.00046935384,0.00007454382,0.00462448,0.000054726515,0.000009155218],"category_scores_gemma":[0.00008061335,0.00015860015,0.00016302968,0.00060738396,0.00036216818,0.00035813122,0.0006428444,0.00045929026,0.0000157947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010143116,0.001360362,0.016579885,0.0001404302,0.0005472174,8.189719e-7,0.032283075,0.14469436,0.6332311,0.06966179,0.0045173015,0.09688224],"study_design_scores_gemma":[0.00036804125,0.00014351713,0.007641886,0.00037712755,0.000007463613,0.0000021888231,0.000041487277,0.97810864,0.012930093,0.000016726994,0.00014615005,0.00021667864],"about_ca_topic_score_codex":0.00003419372,"about_ca_topic_score_gemma":0.000011176792,"teacher_disagreement_score":0.83341426,"about_ca_system_score_codex":0.00009534311,"about_ca_system_score_gemma":0.00004304556,"threshold_uncertainty_score":0.8593511},"labels":[],"label_agreement":null},{"id":"W177114816","doi":"10.1017/cbo9780511920950.018","title":"Network coding in bi-directed and peer-to-peer networks","year":2012,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Calgary","funders":"","keywords":"Linear network coding; Computer science; Computer network; The Internet; Coding (social sciences); Peer-to-peer; Distributed computing; Throughput; Theoretical computer science; Network packet; Telecommunications; Mathematics; Wireless; World Wide Web","score_opus":0.03983678641330712,"score_gpt":0.22641300336714854,"score_spread":0.1865762169538414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177114816","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004259157,0.0016617625,0.065283515,0.00032426667,0.00040072014,0.00050143414,0.000012260253,0.00034188115,0.9314316],"genre_scores_gemma":[0.012483826,0.0010814079,0.0025051634,0.00043766684,0.0002848905,0.0000022744005,0.000028449305,0.000039234295,0.9831371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808633,0.0001489154,0.0002645611,0.0006078625,0.00035867916,0.0005336542],"domain_scores_gemma":[0.9978754,0.00021540631,0.00017602742,0.0010006817,0.00041111623,0.00032135122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055081345,0.00039782518,0.0004644537,0.00027117488,0.00034361563,0.00017647765,0.0013400144,0.00032451426,0.000005859513],"category_scores_gemma":[0.000029681278,0.00048373747,0.000088980894,0.00007439925,0.000117641466,0.00023956239,0.0022797575,0.00079850986,0.000013475566],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023401491,0.000007683266,0.00003170867,0.000011659932,0.00003895324,0.000048111677,0.00020199521,0.0003084436,0.000006342111,0.92117465,0.054748397,0.02339864],"study_design_scores_gemma":[0.00041201652,0.000028309096,0.00032763215,0.0003004048,0.000034749923,0.000012126114,0.000006868434,0.021310126,0.0000074167324,0.00002249287,0.9769619,0.0005759314],"about_ca_topic_score_codex":0.000024045728,"about_ca_topic_score_gemma":0.000020856955,"teacher_disagreement_score":0.92221355,"about_ca_system_score_codex":0.00021363908,"about_ca_system_score_gemma":0.000065750115,"threshold_uncertainty_score":0.9997614},"labels":[],"label_agreement":null},{"id":"W1810698100","doi":"10.1007/s11276-015-1099-5","title":"Truthful budget constrained auction for device-to-device relaying packet allocation","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Network packet; Auction algorithm; Computer network; Resource allocation; Probabilistic logic; Quality of service; Auction theory; Bidding; Microeconomics; Revenue equivalence","score_opus":0.06392773536777661,"score_gpt":0.3051142505420399,"score_spread":0.24118651517426326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810698100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012382692,0.00042099608,0.9800661,0.0039105196,0.00090952555,0.0006198806,0.0000017696991,0.0003348736,0.0013536398],"genre_scores_gemma":[0.9743656,0.00014166634,0.022867704,0.0017133586,0.0004142569,0.0001800627,0.000044087516,0.000024162398,0.00024912055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998289,0.0002133172,0.00039219533,0.00046711974,0.0002296947,0.00040868515],"domain_scores_gemma":[0.9979138,0.00028859245,0.0001626934,0.00079447863,0.0005490076,0.00029147448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845787,0.00021239587,0.00025057243,0.000114203474,0.00033994953,0.00025857036,0.0009150443,0.00013184504,0.000006585953],"category_scores_gemma":[0.00012799838,0.00021853454,0.00007308767,0.0008186036,0.000050008202,0.00048533754,0.00029017037,0.00023270704,0.000038359707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010793739,0.00013917657,0.0005674142,0.000028804036,0.00007722766,0.0000038673147,0.0035037932,0.0816774,0.00056687905,0.16480786,0.030474912,0.71804476],"study_design_scores_gemma":[0.00085392786,0.00010966503,0.00033999424,0.000090620575,0.000012206098,0.000011069203,0.00016555811,0.96526766,0.00017998027,0.00047177667,0.03217299,0.00032455538],"about_ca_topic_score_codex":0.000008165824,"about_ca_topic_score_gemma":0.00008857854,"teacher_disagreement_score":0.9619829,"about_ca_system_score_codex":0.00014977762,"about_ca_system_score_gemma":0.00014490045,"threshold_uncertainty_score":0.891158},"labels":[],"label_agreement":null},{"id":"W1813891131","doi":"10.1007/11499169_5","title":"A High-Throughput Overlay Multicast Infrastructure with Network Coding","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Multicast; Computer network; Overlay network; Overlay; Overlay multicast; Distributed computing; Coding (social sciences); Throughput; Source-specific multicast; Reliable multicast; Wireless; Telecommunications; The Internet; Network packet","score_opus":0.017713014984501205,"score_gpt":0.24972425097530032,"score_spread":0.23201123599079912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813891131","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006146127,0.00094160053,0.99208283,0.0017080454,0.0011128141,0.00044442952,0.0000033536958,0.00025500893,0.003390462],"genre_scores_gemma":[0.23955859,0.0006061098,0.7547471,0.0031720235,0.0014062393,0.000013365809,0.000009347903,0.00005475025,0.00043250123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583924,0.0000780319,0.00059312163,0.0016055754,0.0009664857,0.0009175753],"domain_scores_gemma":[0.99610484,0.00057706214,0.00038439975,0.002315681,0.0003839271,0.00023407457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007199832,0.00072844647,0.0007038579,0.00044227354,0.00066036964,0.0008562521,0.0043091862,0.0003247185,0.00009328408],"category_scores_gemma":[0.0000580617,0.0006024777,0.00010937872,0.0010843646,0.0008162391,0.0008576455,0.0024518466,0.0014687267,0.00004371684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009308617,0.000016196502,0.000054521886,0.000012274619,0.000020207088,0.000044049644,0.00062370894,0.2848517,0.000035495894,0.09496602,0.00019252548,0.619174],"study_design_scores_gemma":[0.00089984643,0.00030299218,0.00077049504,0.0012923437,0.000020349908,0.00019137908,2.9902301e-7,0.93200314,0.00025961106,0.033980798,0.028713753,0.0015649898],"about_ca_topic_score_codex":0.0000070853553,"about_ca_topic_score_gemma":0.00025956758,"teacher_disagreement_score":0.64715147,"about_ca_system_score_codex":0.00049217464,"about_ca_system_score_gemma":0.0005852347,"threshold_uncertainty_score":0.99964267},"labels":[],"label_agreement":null},{"id":"W1816648091","doi":"10.1002/wcm.2597","title":"A coalitional game‐based relay load balancing and power allocation scheme in decode‐and‐forward cellular relay networks","year":2015,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Bell Canada Enterprises","keywords":"Relay; Computer science; Computer network; Telecommunications link; Power (physics); Relay channel; Cellular network; Base station; Transmitter power output; Transmission (telecommunications); Scheme (mathematics); Channel (broadcasting); Telecommunications; Transmitter; Mathematics","score_opus":0.029364461829267625,"score_gpt":0.2791105079064898,"score_spread":0.24974604607722214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1816648091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40193024,0.0146104945,0.58084106,0.0014825019,0.00008876989,0.00038877383,0.0000015304249,0.00013724658,0.00051936717],"genre_scores_gemma":[0.9476649,0.0022476004,0.04955746,0.00037799316,0.000022040535,0.00006350142,0.000027832135,0.000015443198,0.000023194532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815977,0.00043950515,0.00048475727,0.00041619525,0.00020946434,0.00029028818],"domain_scores_gemma":[0.99739546,0.0005835213,0.00018610446,0.0013272236,0.0003100577,0.00019765992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015054289,0.00020382582,0.00027093984,0.00014254636,0.00045810753,0.0002590019,0.0008460962,0.000109361084,0.0000024290027],"category_scores_gemma":[0.000077300574,0.00021769533,0.000032855958,0.0004909833,0.00021919684,0.00033663513,0.0016009199,0.00045260432,0.0000024410567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007387009,0.0010234897,0.07643499,0.00012815488,0.00013336708,0.000017687747,0.028698977,0.08916176,0.0045916717,0.30240774,0.0007726254,0.49655566],"study_design_scores_gemma":[0.00081781496,0.00006393703,0.0029289802,0.00021478461,0.0000054454085,0.000014748287,0.00027749184,0.98958105,0.000038315226,0.0001293126,0.0056798654,0.0002482399],"about_ca_topic_score_codex":0.000046993788,"about_ca_topic_score_gemma":0.00012175316,"teacher_disagreement_score":0.9004193,"about_ca_system_score_codex":0.00013554421,"about_ca_system_score_gemma":0.00017745806,"threshold_uncertainty_score":0.8877358},"labels":[],"label_agreement":null},{"id":"W1843104828","doi":"10.1002/wcm.2595","title":"Transmission scheduling in a multi‐channel wireless network with bidirectional relaying links","year":2015,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Linear network coding; Computer network; Relay; Maximum throughput scheduling; Scheduling (production processes); Network packet; Wireless network; Round-robin scheduling; Wireless; Fair-share scheduling; Quality of service; Mathematical optimization; Telecommunications","score_opus":0.06769034584289321,"score_gpt":0.3054646803065216,"score_spread":0.23777433446362836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843104828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14324637,0.0068146433,0.84790087,0.00088251615,0.00010015441,0.00037998127,5.777071e-7,0.00023736915,0.0004375286],"genre_scores_gemma":[0.85410136,0.0023338278,0.14321025,0.00017481863,0.000040595576,0.00007468159,0.000011872669,0.00002021409,0.000032408192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980516,0.000457122,0.00046781794,0.00042894296,0.00021261831,0.0003819115],"domain_scores_gemma":[0.9975898,0.0003947975,0.00017933306,0.0013566171,0.00027215344,0.00020730103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111542,0.00022864928,0.00030415374,0.00017428631,0.0008232249,0.00022459254,0.0014440987,0.0001442676,0.0000012844279],"category_scores_gemma":[0.000017262406,0.00021490881,0.000043970962,0.001084492,0.00015516092,0.00039278847,0.0012159923,0.00086371566,0.0000037687676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003291121,0.00046722763,0.0083114635,0.000034624518,0.000048768277,0.000008448914,0.011851773,0.20189828,0.00042809796,0.022572068,0.000071642404,0.7542747],"study_design_scores_gemma":[0.0009789369,0.000080581936,0.0009914716,0.0004892084,0.0000056134327,0.000033252447,0.00046382516,0.99270797,0.00004708566,0.00017133399,0.0037416434,0.00028910371],"about_ca_topic_score_codex":0.00004824509,"about_ca_topic_score_gemma":0.0001377449,"teacher_disagreement_score":0.7908097,"about_ca_system_score_codex":0.000101567115,"about_ca_system_score_gemma":0.00017510378,"threshold_uncertainty_score":0.8763727},"labels":[],"label_agreement":null},{"id":"W1847181667","doi":"10.1109/wicon.2005.2","title":"A Cross-Layer Optimization Framework for Multicast in Multi-hop Wireless Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Wireless network; Distributed computing; Linear network coding; Multicast; Physical layer; Optimization problem; Wireless; Throughput; Network packet; Algorithm; Telecommunications","score_opus":0.05816665370696038,"score_gpt":0.3409091095252796,"score_spread":0.2827424558183192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847181667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028183097,0.00016921687,0.9952073,0.0005552751,0.00018531029,0.0003495977,6.41584e-7,0.00015278158,0.00056158565],"genre_scores_gemma":[0.54082716,0.00006709666,0.4583678,0.00027567652,0.000047692036,0.000057890495,0.000006585026,0.000008062072,0.00034203916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989212,0.000074062715,0.00030734137,0.00031644048,0.00009493504,0.00028602348],"domain_scores_gemma":[0.99880743,0.0003448372,0.00006964506,0.000553628,0.00017948548,0.000044952016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029154986,0.00013048173,0.00014709926,0.000085703316,0.00019212965,0.000307314,0.0006801384,0.00011096669,0.000045362907],"category_scores_gemma":[0.000064274005,0.00012329109,0.000052398187,0.00055267167,0.000041845833,0.00037084907,0.0002398752,0.00017461178,0.0000070939486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008033958,0.00014243029,0.003472962,0.0000033439028,0.0000033463307,0.0000010124252,0.00012774409,0.7319556,0.00004802131,0.24096063,0.00017040032,0.023106484],"study_design_scores_gemma":[0.0006370913,0.000014992883,0.0050603063,0.00003183421,0.0000011444424,0.0000010084713,0.000006928336,0.9930875,0.00012589575,0.00034836767,0.0005199533,0.00016498554],"about_ca_topic_score_codex":0.000024705827,"about_ca_topic_score_gemma":0.00021488308,"teacher_disagreement_score":0.53800887,"about_ca_system_score_codex":0.000052740757,"about_ca_system_score_gemma":0.000024213115,"threshold_uncertainty_score":0.5027665},"labels":[],"label_agreement":null},{"id":"W1851834002","doi":"10.1109/wcl.2013.113013.130653","title":"Accuracy of Harmonic Mean Approximation in Performance Analysis of Multihop Amplify-and-Forward Relaying","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Upper and lower bounds; Harmonic mean; Fading; Signal-to-noise ratio (imaging); Ergodic theory; Mathematics; Outage probability; Harmonic; Algorithm; Computer science; Topology (electrical circuits); Statistics; Applied mathematics; Physics; Mathematical analysis; Combinatorics","score_opus":0.04158554766670669,"score_gpt":0.2860465707098553,"score_spread":0.2444610230431486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851834002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76052177,0.0002581425,0.23674013,0.0020699026,0.00003101908,0.0001538233,0.0000017910894,0.000038199618,0.00018519585],"genre_scores_gemma":[0.9723172,0.0026767568,0.02462392,0.00030465794,0.000004989774,0.000041365543,0.00001946808,0.000008043928,0.0000036041206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982904,0.0005003746,0.0006235474,0.00022679032,0.00019028863,0.00016856122],"domain_scores_gemma":[0.99578214,0.00092999917,0.0004471291,0.0026596675,0.00013737279,0.000043706885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094896986,0.0001322865,0.00036901908,0.00062412437,0.00018678923,0.000044154676,0.0021545948,0.000052101335,0.0000024243027],"category_scores_gemma":[0.000078980294,0.00013833099,0.00008455215,0.0018842083,0.00018098051,0.0005024625,0.0005439275,0.00028031465,0.0000022163713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026936883,0.00041314258,0.052410446,0.00015271812,0.00054372405,2.6482098e-7,0.018232964,0.03452541,0.16415672,0.071130015,0.000092317365,0.65831536],"study_design_scores_gemma":[0.00033986868,0.000015608764,0.03218143,0.000088593646,0.00005550461,6.551529e-7,0.000058120135,0.96339864,0.0034331626,0.000023784007,0.0002606833,0.0001439412],"about_ca_topic_score_codex":0.000060914554,"about_ca_topic_score_gemma":0.00022097299,"teacher_disagreement_score":0.92887324,"about_ca_system_score_codex":0.00005356632,"about_ca_system_score_gemma":0.000026419288,"threshold_uncertainty_score":0.5640974},"labels":[],"label_agreement":null},{"id":"W1855768972","doi":"","title":"Space Diversity for Multi-antenna Multi-relay Channels","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Beamforming; Maximal-ratio combining; Computer science; Antenna (radio); Antenna diversity; Topology (electrical circuits); Diversity gain; Channel (broadcasting); Relay channel; Transmitter power output; Electronic engineering; Power (physics); Telecommunications; Computer network; Electrical engineering; Fading; Engineering; MIMO; Physics; Transmitter","score_opus":0.09964881129328798,"score_gpt":0.3007040865884254,"score_spread":0.20105527529513742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855768972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028271952,0.0002455377,0.99380976,0.0016429906,0.00034858694,0.00024734827,0.0000015265376,0.00020650557,0.0006705541],"genre_scores_gemma":[0.6922355,0.000060767332,0.29763016,0.0003746556,0.00005061113,0.00001487355,0.000003697556,0.0000050001822,0.00962472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992693,0.00004944963,0.00012313477,0.00025002967,0.000093376,0.00021469464],"domain_scores_gemma":[0.999187,0.000082619925,0.000047100588,0.00047377218,0.00015829611,0.00005119141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021330421,0.00010275392,0.00010951566,0.00005589947,0.0005671284,0.00009888685,0.0008827316,0.00003811921,0.000020983602],"category_scores_gemma":[0.000026942747,0.000091340306,0.000072992676,0.00022026394,0.000030793504,0.00027246974,0.0011538563,0.00007398595,0.000047170302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029145302,0.0014390303,0.016382901,0.00003310624,0.000082132545,0.000011692868,0.004297966,0.0031051557,0.013581874,0.859418,0.055598453,0.046020545],"study_design_scores_gemma":[0.0008586897,0.000024798406,0.004691321,0.000009485815,0.000003096728,0.0000011347105,0.00002130671,0.9810228,0.0012347617,0.0001083819,0.011852817,0.00017140326],"about_ca_topic_score_codex":0.00007224504,"about_ca_topic_score_gemma":0.0003215297,"teacher_disagreement_score":0.9779177,"about_ca_system_score_codex":0.000033506843,"about_ca_system_score_gemma":0.00001577789,"threshold_uncertainty_score":0.43619505},"labels":[],"label_agreement":null},{"id":"W1865890927","doi":"10.1007/1-4020-4711-8_8","title":"Multi-route and Multi-user Diversity","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Diversity (politics); Computer science; Geography; Sociology; Anthropology","score_opus":0.06380579711397112,"score_gpt":0.26687261470415824,"score_spread":0.20306681759018713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1865890927","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060816463,0.0036583839,0.11782767,0.0011491966,0.0008261262,0.00070922414,0.000025764833,0.0006930926,0.8750497],"genre_scores_gemma":[0.003830595,0.00036710763,0.015412677,0.001887158,0.00019592114,0.000017060398,0.00003765883,0.000060371287,0.97819144],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997414,0.00009338093,0.0005344968,0.0009772256,0.0004829587,0.0004979372],"domain_scores_gemma":[0.9976993,0.00013237294,0.0003617124,0.0012495897,0.0002645111,0.00029248596],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00060090557,0.00056769204,0.000514185,0.00035246543,0.00072047935,0.00069692946,0.0031415354,0.0009217702,0.000070323105],"category_scores_gemma":[0.000050393744,0.0005799519,0.00017482188,0.0000613357,0.00031986428,0.0013412515,0.0066148895,0.0023370574,0.00007295751],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016806012,0.00004750315,0.001559346,0.00006469518,0.0002984456,0.00005744699,0.00301909,0.000023062448,0.00017654114,0.32353365,0.47140926,0.19979416],"study_design_scores_gemma":[0.0010147359,0.000020035788,0.0007008481,0.00015621603,0.000043902797,0.00001795874,0.0000094890465,0.005696838,0.000015548812,0.0025148017,0.98899174,0.0008178892],"about_ca_topic_score_codex":0.000030210824,"about_ca_topic_score_gemma":0.000061117345,"teacher_disagreement_score":0.5175825,"about_ca_system_score_codex":0.00021663897,"about_ca_system_score_gemma":0.00014710725,"threshold_uncertainty_score":0.9999646},"labels":[],"label_agreement":null},{"id":"W1877783666","doi":"10.48550/arxiv.1401.3659","title":"Multipath Private Communication: An Information Theoretic Approach","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multipath propagation; Private information retrieval; Business; Computer science; Telecommunications; Computer security","score_opus":0.08272765242768941,"score_gpt":0.20518994289285206,"score_spread":0.12246229046516265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1877783666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040888436,0.000091517795,0.9454719,0.00015037926,0.00014203564,0.00035759975,0.0000037523248,0.00037013929,0.012524248],"genre_scores_gemma":[0.9777087,0.0012576204,0.020375455,0.00031426258,0.00003079619,0.0000042942324,0.00015790807,0.000010798663,0.00014016917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981351,0.00075264135,0.00027722458,0.0004981575,0.000096200216,0.00024069917],"domain_scores_gemma":[0.9952519,0.00011265466,0.0003550134,0.0038324264,0.00029340715,0.00015458572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006827417,0.00027034836,0.00026467323,0.00021339027,0.0004089873,0.00036615157,0.00462725,0.00021570503,0.00002047252],"category_scores_gemma":[0.000049177313,0.0002986556,0.00011203667,0.00047954213,0.00017255156,0.0014022926,0.0041054594,0.0007078412,0.000091472866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007483131,0.00006511828,0.00022878683,0.000032739496,0.000021248945,0.0000011357569,0.0010945738,0.1151921,0.0000028903312,0.87823033,0.00010345361,0.005020126],"study_design_scores_gemma":[0.00034117902,0.000028154293,0.0008086793,0.000057562924,0.000018165909,0.0000022840618,0.000060717306,0.969387,0.000016938977,0.025159927,0.0037671064,0.0003523116],"about_ca_topic_score_codex":0.000013124076,"about_ca_topic_score_gemma":0.000008634121,"teacher_disagreement_score":0.93682027,"about_ca_system_score_codex":0.00013977659,"about_ca_system_score_gemma":0.00009791787,"threshold_uncertainty_score":0.99994653},"labels":[],"label_agreement":null},{"id":"W1887163227","doi":"10.48550/arxiv.1003.0445","title":"On The Design of Signature Codes in Decentralized Wireless Networks","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transmitter; Gaussian; Computer science; Wireless network; Transmission (telecommunications); Entropy (arrow of time); Wireless; Topology (electrical circuits); Dirty paper coding; Mathematics; Theoretical computer science; Algorithm; Computer network; Telecommunications; Channel (broadcasting); Precoding; Combinatorics","score_opus":0.09140892941687197,"score_gpt":0.20915867621205847,"score_spread":0.1177497467951865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887163227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09859451,0.00022717359,0.89967996,0.00029428006,0.00028198105,0.0004039008,0.0000018783915,0.00006185344,0.00045448117],"genre_scores_gemma":[0.99592656,0.0027437238,0.0009837255,0.00019644419,0.000017154538,0.0000018686382,0.0000045203806,0.000009662968,0.00011632925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982743,0.0007089796,0.00019769021,0.0005041433,0.0000715227,0.00024334207],"domain_scores_gemma":[0.9971119,0.00095295167,0.00023235846,0.0014906421,0.0001479182,0.000064195425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059488433,0.00022215255,0.000292924,0.00014450251,0.00013296194,0.00007049993,0.002968439,0.00031714013,0.00004006009],"category_scores_gemma":[0.000060310846,0.00018781987,0.00010726779,0.0007032108,0.00014082006,0.00010745105,0.0014451697,0.0014873536,0.0000056492854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002807381,0.00005594758,0.00016649248,0.00000527708,0.0000192523,0.000014298454,0.00015938467,0.5907089,0.0001006875,0.40752587,0.00019586268,0.0010199728],"study_design_scores_gemma":[0.0002972506,0.000024121076,0.0004406359,0.00016503381,0.00001029342,4.9387876e-7,0.000014085079,0.9858606,0.00021494058,0.0126736825,0.00009956436,0.00019929624],"about_ca_topic_score_codex":0.000020682413,"about_ca_topic_score_gemma":0.00013775953,"teacher_disagreement_score":0.89869624,"about_ca_system_score_codex":0.000077556026,"about_ca_system_score_gemma":0.00013111936,"threshold_uncertainty_score":0.76590717},"labels":[],"label_agreement":null},{"id":"W1899517412","doi":"10.1109/twc.2014.031714.130348","title":"Semi-Blind Channel Estimation with Superimposed Training for OFDM-Based AF Two-Way Relaying","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Queen's University","funders":"","keywords":"Estimator; Computer science; Relay; Orthogonal frequency-division multiplexing; Channel (broadcasting); Algorithm; Gaussian; Estimation; Estimation theory; Statistics; Telecommunications; Mathematics; Engineering","score_opus":0.0826215686847368,"score_gpt":0.3115087381118792,"score_spread":0.22888716942714238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899517412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054881726,0.000077699886,0.9870896,0.0051145772,0.00016752766,0.00071903324,0.0000150733595,0.00045756958,0.0008707662],"genre_scores_gemma":[0.84927994,0.0001290574,0.14915924,0.0005740046,0.000021862788,0.0006758432,0.000035465717,0.000038954055,0.00008564443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979946,0.00045043812,0.0004653764,0.00044326292,0.00026823918,0.0003780566],"domain_scores_gemma":[0.9945942,0.0014961926,0.00018834956,0.0032250118,0.0003393182,0.00015688642],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00070330116,0.00029168336,0.0003172509,0.0003284615,0.0018927827,0.00025893393,0.0022451128,0.00010186646,0.0000108695185],"category_scores_gemma":[0.000026414573,0.00028770659,0.00014306932,0.0009179534,0.00020516958,0.00059306005,0.000020893707,0.0005167509,0.00001941144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015941332,0.00070431,0.000008192515,0.000039391798,0.000110669534,4.757704e-7,0.0053625708,0.41546977,0.0054773353,0.039898828,0.00007898919,0.53269005],"study_design_scores_gemma":[0.002380697,0.00022807739,0.00003963898,0.00018042082,0.000035386638,0.000006876603,0.00013045174,0.98960584,0.005384424,0.00031107126,0.0013347949,0.00036229225],"about_ca_topic_score_codex":0.0000143102225,"about_ca_topic_score_gemma":0.0003237871,"teacher_disagreement_score":0.8437918,"about_ca_system_score_codex":0.00012719118,"about_ca_system_score_gemma":0.00017950119,"threshold_uncertainty_score":0.9999575},"labels":[],"label_agreement":null},{"id":"W1901850816","doi":"10.1109/tit.2015.2439269","title":"Decentralized Wireless Networks With Asynchronous Users and Burst Transmissions","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Code word; Transmitter; Decoding methods; Asynchronous communication; Transmission (telecommunications); Channel (broadcasting); Topology (electrical circuits); Computer science; Asymptote; Mathematics; Random variable; Gaussian; Wireless network; Fading; Discrete mathematics; Wireless; Computer network; Algorithm; Combinatorics; Telecommunications; Statistics; Physics","score_opus":0.0188661477728679,"score_gpt":0.2392646256970387,"score_spread":0.2203984779241708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901850816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036043865,0.00011916876,0.99369425,0.00047067992,0.00028161882,0.00022633745,0.000003240512,0.00022298787,0.0013773403],"genre_scores_gemma":[0.9923567,0.0007132884,0.0061045904,0.00068454206,0.000011318602,0.000044402746,0.0000048391594,0.000007585866,0.000072716866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905276,0.00017554419,0.00024932713,0.0001269543,0.00019416232,0.0002012606],"domain_scores_gemma":[0.99891573,0.00014526438,0.00007987862,0.00041749387,0.00021566344,0.00022597988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033952302,0.00014862021,0.00013292678,0.00014781418,0.00036258774,0.0002034929,0.0003616251,0.00006431445,0.000030474801],"category_scores_gemma":[0.0000060521165,0.000121360456,0.000035929377,0.0004056276,0.00009669279,0.001659934,0.000003824518,0.00023626292,0.000028217084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022205747,0.00009696907,0.000010423668,0.000011202753,0.00006188627,0.0000012563672,0.0074372427,0.18315017,0.000019008687,0.057314854,0.00037710465,0.75129783],"study_design_scores_gemma":[0.00342748,0.00040372042,0.00019082754,0.00015161693,0.000040767707,0.00005878667,0.00094275654,0.9760819,0.001566048,0.00097497186,0.015603195,0.0005579114],"about_ca_topic_score_codex":0.0000038264902,"about_ca_topic_score_gemma":0.000010292778,"teacher_disagreement_score":0.9887523,"about_ca_system_score_codex":0.000069150396,"about_ca_system_score_gemma":0.0001054583,"threshold_uncertainty_score":0.49489358},"labels":[],"label_agreement":null},{"id":"W1903268680","doi":"10.1002/ett.1495","title":"On the error exponent of MIMO‐ARQ system over the fast fading channels","year":2011,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fading; Hybrid automatic repeat request; Computer science; Automatic repeat request; Algorithm; Exponent; Decoding methods; Code word; Code rate; MIMO; Bit error rate; Channel (broadcasting); Electronic engineering; Mathematics; Computer network; Telecommunications; Engineering; Transmission (telecommunications)","score_opus":0.08077837576552113,"score_gpt":0.25861743510811647,"score_spread":0.17783905934259533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903268680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009099743,0.00031515,0.88363063,0.0048451163,0.0003617213,0.00061349105,0.000011884236,0.0003211744,0.10080107],"genre_scores_gemma":[0.99526936,0.0003838493,0.0032497009,0.0005112198,0.000017480872,0.000076889206,0.000002594544,0.000025085677,0.00046385085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732685,0.0015871573,0.00042367345,0.00023771041,0.00021057004,0.00021404214],"domain_scores_gemma":[0.9952182,0.0007427862,0.00020380094,0.0036373034,0.00013532426,0.000062548],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00093407393,0.0001806759,0.00014958979,0.0001450109,0.001475201,0.00009693651,0.0038586406,0.000026823074,0.00016987266],"category_scores_gemma":[0.00003127733,0.000116428266,0.00015641234,0.0007235366,0.00017211516,0.0001852992,0.00011409375,0.0005381864,0.00022019907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003324669,0.001245476,0.000022023998,0.000023598135,0.00026419488,0.0000031791303,0.039070126,0.007326187,0.0010638268,0.84517926,0.002530656,0.10323821],"study_design_scores_gemma":[0.0054008407,0.0028503751,0.063321985,0.003822658,0.00051803625,0.00020345082,0.022567738,0.67119366,0.049526144,0.0033178802,0.17277384,0.004503389],"about_ca_topic_score_codex":0.000018724511,"about_ca_topic_score_gemma":0.000035871923,"teacher_disagreement_score":0.9861696,"about_ca_system_score_codex":0.00006798216,"about_ca_system_score_gemma":0.00003239373,"threshold_uncertainty_score":0.99982476},"labels":[],"label_agreement":null},{"id":"W1907663096","doi":"","title":"Video multicast over wireless ad hoc networks","year":2012,"lang":"en","type":"article","venue":"WSEAS TRANSACTIONS on COMMUNICATIONS archive","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Multicast; Computer network; Distance Vector Multicast Routing Protocol; Protocol Independent Multicast; Source-specific multicast; Xcast; Distributed computing; Multiple description coding; Pragmatic General Multicast; Wireless ad hoc network; Wireless; Network packet","score_opus":0.0423970643078938,"score_gpt":0.2987473446193943,"score_spread":0.2563502803115005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907663096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087123155,0.0044121174,0.9836497,0.0026834542,0.00028106326,0.00036349968,0.00002009615,0.00034324787,0.0073756203],"genre_scores_gemma":[0.9165257,0.014486012,0.06755578,0.0007984531,0.00004203133,0.00022970812,0.00003139517,0.000026815962,0.00030407234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784434,0.0007041331,0.00038481914,0.00031062934,0.0002441616,0.00051188923],"domain_scores_gemma":[0.9938919,0.0010300984,0.00011445567,0.0045215506,0.00012301949,0.00031895586],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004063691,0.00025300184,0.0002246615,0.00024319299,0.00139849,0.00016601967,0.0031470181,0.00007685328,0.00016823935],"category_scores_gemma":[0.000019941863,0.00025724655,0.00017774245,0.00080126687,0.00028049576,0.0008175658,0.00023840115,0.00081200345,0.00023997793],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003314395,0.0015722077,0.0002698323,0.00000847709,0.00014089078,8.1509e-7,0.004608563,0.0027384204,0.00046414556,0.12167252,0.0013437659,0.8671472],"study_design_scores_gemma":[0.0009243818,0.00011322755,0.01173599,0.00012449465,0.00004917143,0.000023612629,0.00019127523,0.7353311,0.00021118582,0.0006514145,0.2499794,0.00066471164],"about_ca_topic_score_codex":0.0000062512922,"about_ca_topic_score_gemma":0.00016647718,"teacher_disagreement_score":0.9160939,"about_ca_system_score_codex":0.00010972783,"about_ca_system_score_gemma":0.000067680405,"threshold_uncertainty_score":0.99998796},"labels":[],"label_agreement":null},{"id":"W1914891733","doi":"10.1002/wcm.1138","title":"Cooperative communications with relay selection for wireless networks: design issues and applications","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Norges Forskningsråd","keywords":"Relay; Computer science; Computer network; Selection (genetic algorithm); Cooperative diversity; Key (lock); Wireless; Relay channel; Game theory; Spectral efficiency; Wireless network; Distributed computing; Telecommunications; Computer security; Artificial intelligence; Channel (broadcasting)","score_opus":0.06244162308857815,"score_gpt":0.29987696630567673,"score_spread":0.23743534321709858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914891733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004076382,0.0075939354,0.9855704,0.00053211814,0.000026812242,0.0013452796,0.0000032509292,0.00026506223,0.000586816],"genre_scores_gemma":[0.7097319,0.013135033,0.27574822,0.00014232419,0.00003086744,0.0011144517,0.000024319255,0.000023548273,0.00004935046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982504,0.00047469864,0.00041625672,0.00044808013,0.00010564103,0.00030487622],"domain_scores_gemma":[0.995744,0.00091995834,0.00024767953,0.0024456605,0.00050945126,0.0001332365],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007111682,0.0002438849,0.0002782957,0.00012990256,0.002339571,0.00027138426,0.0020443266,0.00009800427,0.0000034509787],"category_scores_gemma":[0.000012851345,0.00023755072,0.00004073663,0.0006874485,0.00053141575,0.0004346342,0.0016875851,0.00035116757,0.0000021395356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022918459,0.00028642148,0.0010580817,0.000025897903,0.00010044801,2.0044634e-7,0.0054315585,0.0013342663,0.00030529816,0.427047,0.00015629367,0.5642316],"study_design_scores_gemma":[0.0004689653,0.00028007157,0.00033790327,0.00011127546,0.0000311227,0.000030366276,0.0004300769,0.98380643,0.00026690224,0.00026247467,0.013645519,0.0003289005],"about_ca_topic_score_codex":0.00004453554,"about_ca_topic_score_gemma":0.00015493979,"teacher_disagreement_score":0.9824722,"about_ca_system_score_codex":0.00003923817,"about_ca_system_score_gemma":0.0000847412,"threshold_uncertainty_score":0.99895924},"labels":[],"label_agreement":null},{"id":"W1926125375","doi":"10.1002/wcm.1121","title":"Coding‐aware routing and scheduling in <scp>WiMAX</scp>‐based mesh networks: a cross‐layer design approach","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Unicast; WiMAX; Scheduling (production processes); Linear network coding; Computer network; Coding (social sciences); Distributed computing; Column generation; Schedule; Mathematical optimization; Multicast; Wireless; Telecommunications","score_opus":0.09087120328719307,"score_gpt":0.3004786869825619,"score_spread":0.20960748369536886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1926125375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11024075,0.0032304022,0.8845397,0.000058171212,0.00006158818,0.0005325173,8.817932e-7,0.00023025798,0.0011057252],"genre_scores_gemma":[0.79584724,0.00214496,0.20166132,0.00017425744,0.000024308196,0.000101479316,0.000009638537,0.000023632614,0.000013167052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740106,0.0007222918,0.0006271195,0.00058304874,0.00015589444,0.0005106048],"domain_scores_gemma":[0.9959253,0.0014864601,0.00028980404,0.0019209598,0.0002164206,0.0001610576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016737913,0.00029996422,0.0003820831,0.00022708964,0.0012636292,0.0004823199,0.0020269717,0.0001387472,0.0000017583731],"category_scores_gemma":[0.000102779035,0.00031617592,0.000060489612,0.0008632565,0.00030629977,0.00044937764,0.0025847326,0.0006685651,0.000001894794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019301724,0.0012545873,0.066317864,0.00015614014,0.0001302146,0.000012440052,0.04459122,0.0850412,0.001086589,0.25558633,0.00009198858,0.5457121],"study_design_scores_gemma":[0.00060979056,0.000054689088,0.0044840686,0.00023319562,0.000008484816,0.000015279127,0.00077700254,0.99317986,0.00014384305,0.00010542749,0.0002035542,0.00018483459],"about_ca_topic_score_codex":0.000036686295,"about_ca_topic_score_gemma":0.000022023953,"teacher_disagreement_score":0.90813863,"about_ca_system_score_codex":0.000063970074,"about_ca_system_score_gemma":0.00009320184,"threshold_uncertainty_score":0.999929},"labels":[],"label_agreement":null},{"id":"W1935350106","doi":"10.48550/arxiv.1508.06656","title":"Power Allocation for Multi-Pair Massive MIMO Two-Way AF Relaying with Linear Processing","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Beamforming; Topology (electrical circuits); Spectral efficiency; Upper and lower bounds; Fading; Transmission (telecommunications); Mathematics; Channel state information; Relay channel; MIMO; Maximal-ratio combining; Signal-to-noise ratio (imaging); Computer science; Channel (broadcasting); Control theory (sociology); Power (physics); Mathematical optimization; Telecommunications; Wireless; Combinatorics","score_opus":0.15466937842847672,"score_gpt":0.25443330263937297,"score_spread":0.09976392421089625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1935350106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032617003,0.00029884765,0.96427137,0.000402663,0.00021839389,0.0006484976,0.000005178974,0.00029485163,0.0012431948],"genre_scores_gemma":[0.93108755,0.000106946914,0.067032,0.0001465073,0.000058657697,0.000009030611,0.000031345193,0.000028292558,0.0014996878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821335,0.0001843702,0.00022344524,0.0009426404,0.00010731139,0.0003289071],"domain_scores_gemma":[0.997052,0.00010038792,0.00037701393,0.0012141492,0.0010811485,0.00017529025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046807222,0.00032467145,0.00030760228,0.0002142874,0.00039669368,0.0001890951,0.0017050201,0.00017971957,0.000008060863],"category_scores_gemma":[0.00007200978,0.00033024763,0.00011118757,0.0006225551,0.00010688673,0.00059476105,0.0014616993,0.00053824583,0.00002221774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002304266,0.0004153055,0.0025585198,0.000217299,0.00024245992,0.00009537967,0.0056898,0.8595115,0.0002577689,0.11700344,0.001249188,0.012528914],"study_design_scores_gemma":[0.0012354789,0.0000834085,0.00017356947,0.0002955228,0.00003934224,0.0000028387033,0.00020207769,0.9941952,0.00015292366,0.0010925586,0.002060408,0.00046667713],"about_ca_topic_score_codex":0.000012031597,"about_ca_topic_score_gemma":0.00007105988,"teacher_disagreement_score":0.8984705,"about_ca_system_score_codex":0.000325069,"about_ca_system_score_gemma":0.00048361722,"threshold_uncertainty_score":0.99991494},"labels":[],"label_agreement":null},{"id":"W1939076699","doi":"10.1109/tit.2015.2473863","title":"Multicast Network Coding and Field Sizes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multicast; Linear network coding; Finite field; Bounded function; Multiplicative function; Field size","score_opus":0.03160043652916588,"score_gpt":0.2646613241301877,"score_spread":0.23306088760102184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1939076699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069521816,0.00005969593,0.99044955,0.0008703173,0.00044641693,0.00011018552,0.0000011872102,0.00015780822,0.0072096046],"genre_scores_gemma":[0.9886609,0.00019757198,0.008867348,0.002037965,0.000026930491,0.000021843349,0.0000010385088,0.0000031618815,0.0001832719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932754,0.00012196493,0.00020625423,0.00008147806,0.0001278745,0.0001348672],"domain_scores_gemma":[0.99904186,0.0003696097,0.000058123507,0.00031747523,0.00011182052,0.00010110844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005530537,0.000087887165,0.0000843293,0.00008856111,0.00027494156,0.00017607147,0.00027288354,0.00004475229,0.000031661188],"category_scores_gemma":[0.000030072417,0.0000818109,0.000028197635,0.0002442957,0.000034396136,0.0014060311,0.0000074697678,0.00016913145,0.00009972611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005136427,0.00002950278,0.00000734739,0.000007844721,0.000022114786,4.2757887e-7,0.0055980054,0.019302528,0.00002629026,0.26169044,0.0020669962,0.71119714],"study_design_scores_gemma":[0.0024934188,0.0004888945,0.00015862609,0.00017072413,0.000028268963,0.000054940894,0.0014506688,0.9012281,0.009294523,0.021714589,0.062165253,0.0007520299],"about_ca_topic_score_codex":0.0000014428264,"about_ca_topic_score_gemma":0.000004188667,"teacher_disagreement_score":0.98796564,"about_ca_system_score_codex":0.000029621271,"about_ca_system_score_gemma":0.000034438446,"threshold_uncertainty_score":0.33361515},"labels":[],"label_agreement":null},{"id":"W1940211195","doi":"10.1109/ficloud.2015.51","title":"Secure Multipath Routing Algorithm for Device-to-Device Communications for Public Safety over LTE Heterogeneous Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer network; Computer science; Multipath propagation; Quality of service; Multipath routing; Distance-vector routing protocol; Wireless; Routing protocol; Routing (electronic design automation); Optimized Link State Routing Protocol; Wireless Routing Protocol; Telecommunications; Channel (broadcasting)","score_opus":0.12897373241827653,"score_gpt":0.3425592860423984,"score_spread":0.21358555362412185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1940211195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017894812,0.00085914874,0.99014777,0.005670913,0.0003030293,0.0012991,0.000017954426,0.00031897007,0.0012041639],"genre_scores_gemma":[0.34223232,0.00025865025,0.6518246,0.0044958238,0.00018417234,0.00044039232,0.0000904443,0.000032475975,0.0004411538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806225,0.00023232054,0.00049397437,0.00046807298,0.00019736878,0.000546025],"domain_scores_gemma":[0.9954101,0.0008460521,0.00016311817,0.0022381465,0.0009576681,0.00038491792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012741453,0.00023995161,0.00028149926,0.00011057813,0.0008624041,0.00046264988,0.003059596,0.000106452084,0.000009533338],"category_scores_gemma":[0.00025315114,0.00022801512,0.00014315527,0.00068733166,0.00004609586,0.0005359557,0.0017429438,0.00020611034,0.000016996166],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018535957,0.00019184979,0.00028411113,0.000009362456,0.00008864732,6.159203e-7,0.0020264625,0.004964458,0.00003227441,0.11568547,0.008059243,0.868639],"study_design_scores_gemma":[0.0007692799,0.00007981956,0.00006017977,0.000022490265,0.000008146601,0.0000049014916,0.00006121495,0.7833156,0.000030496072,0.00017495445,0.21522665,0.00024626695],"about_ca_topic_score_codex":0.000018560111,"about_ca_topic_score_gemma":0.0006995336,"teacher_disagreement_score":0.8683927,"about_ca_system_score_codex":0.00017585202,"about_ca_system_score_gemma":0.00016465016,"threshold_uncertainty_score":0.9298187},"labels":[],"label_agreement":null},{"id":"W1945742947","doi":"10.1002/wcm.1135","title":"Bit error rate performance of orthogonal frequency‐division multiplexing relaying systems with high power amplifiers and Doppler effects","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Bit error rate; Orthogonal frequency-division multiplexing; Telecommunications link; Electronic engineering; Channel (broadcasting); Multiplexing; Amplifier; Phase-shift keying; Telecommunications; Bandwidth (computing); Engineering","score_opus":0.03357996570166707,"score_gpt":0.25348261686554713,"score_spread":0.21990265116388005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1945742947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8535747,0.002832288,0.14258309,0.000039606883,0.00007426505,0.00040295732,0.0000018776809,0.00009776332,0.00039345105],"genre_scores_gemma":[0.95773524,0.0015246416,0.040597398,0.000044275523,0.000008615815,0.00005507673,0.000008169576,0.000016782602,0.000009813227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848276,0.00036954883,0.00041682486,0.00033908396,0.00014059366,0.00025116475],"domain_scores_gemma":[0.9972844,0.0005697239,0.0003054712,0.0014977041,0.00023901195,0.00010366073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006938216,0.00020270796,0.00030502115,0.000144447,0.0008391007,0.00011767317,0.0010677492,0.000064500484,0.0000024007354],"category_scores_gemma":[0.000019500638,0.00017482786,0.000029962604,0.0003666462,0.0002847597,0.00039323073,0.001378396,0.00030674684,0.0000014333405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073141564,0.0006319374,0.18064654,0.00067422434,0.00030580646,0.000010097177,0.03870037,0.006960326,0.02258779,0.46197325,0.000042077223,0.28739446],"study_design_scores_gemma":[0.0009667699,0.00047532286,0.07236739,0.0012666329,0.000018245786,0.000057162826,0.00051127945,0.9228513,0.0007262099,0.00009612216,0.0001891393,0.00047440128],"about_ca_topic_score_codex":0.000069622234,"about_ca_topic_score_gemma":0.000016541699,"teacher_disagreement_score":0.915891,"about_ca_system_score_codex":0.000027790938,"about_ca_system_score_gemma":0.000048115024,"threshold_uncertainty_score":0.7129273},"labels":[],"label_agreement":null},{"id":"W1955773032","doi":"10.1109/twc.2015.2446979","title":"Rate Maximization Based Power Allocation and Relay Selection With IRI Consideration for Two-Path AF Relaying","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Maximization; Computer science; Mathematical optimization; Relay channel; Selection (genetic algorithm); Optimization problem; Selection algorithm; Channel (broadcasting); Path (computing); Power (physics); Algorithm; Mathematics; Telecommunications; Computer network; Artificial intelligence","score_opus":0.056349031966600654,"score_gpt":0.2905994325265029,"score_spread":0.23425040055990223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955773032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007993983,0.00015961462,0.9818288,0.008296553,0.0001567385,0.0008255432,0.000008720484,0.00035004417,0.00037999157],"genre_scores_gemma":[0.87631994,0.00027033544,0.122103795,0.00061288563,0.000013490558,0.0004854401,0.000035691737,0.000030217798,0.00012822343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981084,0.00059179193,0.00040855224,0.00042451327,0.00022553273,0.00024124245],"domain_scores_gemma":[0.996503,0.0006800621,0.00021720096,0.0015615665,0.0008716827,0.00016650991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081443804,0.00024110006,0.00021751784,0.00028479763,0.0012966559,0.0003219894,0.0007273522,0.00010156292,0.0000070799565],"category_scores_gemma":[0.00004000491,0.00024124679,0.00005761448,0.0008453811,0.00017125116,0.0009082125,0.000017520637,0.00036707323,0.00001100313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043554395,0.0013900017,0.00031912728,0.000049673235,0.00022281457,0.000001512955,0.006136336,0.6843164,0.015026844,0.18318948,0.0012363027,0.107675955],"study_design_scores_gemma":[0.0020017668,0.00031403263,0.00014667596,0.000100066165,0.00004220321,0.000016209051,0.00013896718,0.98858,0.0064215115,0.0002872111,0.0016172224,0.0003341512],"about_ca_topic_score_codex":0.000021248523,"about_ca_topic_score_gemma":0.00046352186,"teacher_disagreement_score":0.86832595,"about_ca_system_score_codex":0.00021082195,"about_ca_system_score_gemma":0.00033189426,"threshold_uncertainty_score":0.997296},"labels":[],"label_agreement":null},{"id":"W1956548685","doi":"10.1109/isit.2015.7282661","title":"A unified approach for network information theory","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Corollary; Information theory; Computer science; Unified field theory; Linear network coding; Constraint (computer-aided design); Coding (social sciences); Theoretical computer science; Channel code; Simple (philosophy); Duality (order theory); Algorithm; Decoding methods; Mathematics; Mathematical optimization; Discrete mathematics","score_opus":0.0758540987113902,"score_gpt":0.2789008752538946,"score_spread":0.20304677654250441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956548685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030731484,0.00010522044,0.8912472,0.00038486646,0.000097486314,0.00018205756,1.8108548e-7,0.0001358669,0.10781636],"genre_scores_gemma":[0.31251037,0.000035288485,0.6833067,0.0025561524,0.00009946016,0.00008509286,0.000025857422,0.0000035953542,0.001377484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951154,0.0000837181,0.00012612765,0.00007366926,0.000080042315,0.00012492857],"domain_scores_gemma":[0.99924254,0.00008822406,0.00003962494,0.0003862325,0.00017901907,0.00006437802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009051348,0.000053065625,0.000061092964,0.000029880775,0.00010412169,0.00013561995,0.0005546676,0.00002421737,0.00000452469],"category_scores_gemma":[0.000070902795,0.000042949017,0.000023568096,0.00025758508,0.000013653769,0.00073965645,0.00019456119,0.00004634786,0.00002090732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059220865,0.000007380363,0.000011797235,0.0000014026024,0.0000034307493,1.1664381e-8,0.0005409789,0.0024337398,0.0000012178646,0.91046864,0.018959528,0.06756596],"study_design_scores_gemma":[0.00041164842,0.000039592538,0.000058336158,0.0000028765598,0.0000016376162,0.0000016176558,0.00011254504,0.8074413,0.000030318059,0.026717711,0.16508083,0.00010156487],"about_ca_topic_score_codex":5.550896e-7,"about_ca_topic_score_gemma":0.0000011033569,"teacher_disagreement_score":0.8837509,"about_ca_system_score_codex":0.000020732883,"about_ca_system_score_gemma":0.00005467456,"threshold_uncertainty_score":0.175141},"labels":[],"label_agreement":null},{"id":"W1958540862","doi":"10.1002/wcm.2569","title":"A two-hop equalize-and-forward relay scheme in OFDM-based wireless networks over multipath channels","year":2015,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relay; Orthogonal frequency-division multiplexing; Multipath propagation; Computer network; Hop (telecommunications); Wireless; Scheme (mathematics); Telecommunications; Channel (broadcasting); Mathematics","score_opus":0.05595349975542519,"score_gpt":0.3245656878261136,"score_spread":0.26861218807068843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958540862","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50248015,0.0094159115,0.4853375,0.0009079716,0.00022177391,0.00067687733,0.0000023437606,0.00028842155,0.00066907716],"genre_scores_gemma":[0.957239,0.002267969,0.039708838,0.0005229338,0.000052826337,0.00012762162,0.000023362287,0.00002723389,0.000030266636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974388,0.00070277805,0.00063516333,0.00052794145,0.00023115565,0.00046420252],"domain_scores_gemma":[0.99611276,0.00076775404,0.00026172443,0.002326686,0.00025865794,0.00027239101],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015252192,0.00030007196,0.00043716878,0.00024227666,0.00060468056,0.00035776303,0.001937965,0.0001216081,0.000002920063],"category_scores_gemma":[0.000056260436,0.00030772103,0.00006550807,0.00090309535,0.000269234,0.00037856222,0.0031115666,0.0006227103,0.0000041632015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003907468,0.0006988108,0.019897252,0.000056003333,0.000066750705,0.000011126284,0.013143908,0.0721916,0.00074953784,0.1599594,0.00027224445,0.73291427],"study_design_scores_gemma":[0.0017066683,0.000075883676,0.000652852,0.00026062093,0.0000059687923,0.000009050238,0.00033281324,0.9920855,0.000041013045,0.000104742496,0.004361846,0.00036300474],"about_ca_topic_score_codex":0.00012389691,"about_ca_topic_score_gemma":0.00018611696,"teacher_disagreement_score":0.9198939,"about_ca_system_score_codex":0.000113661474,"about_ca_system_score_gemma":0.00013734418,"threshold_uncertainty_score":0.9999375},"labels":[],"label_agreement":null},{"id":"W1962826818","doi":"10.1109/twc.2015.2451171","title":"Achievable Rate of the Half-Duplex Multi-Hop Buffer-Aided Relay Channel With Block Fading","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Computer science; Relay; Channel state information; Computer network; Additive white Gaussian noise; Hop (telecommunications); Transmission (telecommunications); Channel (broadcasting); Scheduling (production processes); Wireless; Telecommunications; Mathematics; Mathematical optimization","score_opus":0.08570712077375067,"score_gpt":0.2913527427453585,"score_spread":0.20564562197160782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1962826818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023652852,0.00044943587,0.9639604,0.009908415,0.0003004011,0.0005705718,0.000010252448,0.0002535965,0.0008940683],"genre_scores_gemma":[0.9793497,0.00083298,0.018356606,0.0003141097,0.000010392117,0.00016501054,0.00000343871,0.000027934384,0.0009398613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977935,0.0008677046,0.00045075236,0.0003237904,0.00027004382,0.0002942418],"domain_scores_gemma":[0.99377334,0.00050650426,0.00025430397,0.0047810143,0.0005252413,0.0001595984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006716104,0.00024603435,0.0002884144,0.0001796401,0.0011276498,0.000118667864,0.00415513,0.000092962204,0.0000067450014],"category_scores_gemma":[0.000025099467,0.00018824497,0.00013288585,0.0014394093,0.00036541457,0.0004699853,0.00009918025,0.00070009293,0.000029839846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020644105,0.005005868,0.00025600725,0.00007137626,0.00078565965,0.000004752186,0.033299625,0.81758296,0.025284473,0.059729327,0.0016868194,0.056086697],"study_design_scores_gemma":[0.0019058853,0.0001895157,0.00037585766,0.00031057443,0.00007244852,0.000033864562,0.0004762596,0.9659856,0.02629395,0.00011882691,0.0037628566,0.0004743489],"about_ca_topic_score_codex":0.00011358814,"about_ca_topic_score_gemma":0.001223869,"teacher_disagreement_score":0.9556968,"about_ca_system_score_codex":0.00013576738,"about_ca_system_score_gemma":0.0002773904,"threshold_uncertainty_score":0.8673085},"labels":[],"label_agreement":null},{"id":"W1963709939","doi":"10.1007/s11277-008-9641-8","title":"Outage-based Decision Strategies for Coded Cooperative Relaying Schemes","year":2008,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Relay; Outage probability; Signal-to-noise ratio (imaging); Range (aeronautics); Maximal-ratio combining; Upper and lower bounds; Mathematical optimization; Telecommunications; Computer network; Algorithm; Decoding methods; Fading; Power (physics); Mathematics","score_opus":0.10626438764996773,"score_gpt":0.33538018167266054,"score_spread":0.2291157940226928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963709939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03817915,0.0019171084,0.9516097,0.005019578,0.000098425706,0.00049990765,0.000020145573,0.00030968752,0.0023463524],"genre_scores_gemma":[0.842386,0.0010902927,0.15518337,0.0007763924,0.000027002192,0.00027136467,0.000061810264,0.000018644534,0.00018512284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837077,0.00028390152,0.00039058973,0.00037275543,0.0002784267,0.00030355933],"domain_scores_gemma":[0.9954284,0.0014726106,0.0001521928,0.0021530895,0.0006756674,0.00011806217],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00041008255,0.00022660711,0.00026998325,0.00015152508,0.0025323282,0.00025675015,0.0030806782,0.00009115214,0.00002303099],"category_scores_gemma":[0.00013268235,0.00022322637,0.00015011817,0.000645152,0.00038916213,0.0007655214,0.0007189427,0.00037940245,0.000033095377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007553729,0.00053198665,0.00076256966,0.000023449746,0.0000909597,0.0000043922932,0.012275244,0.0010393845,0.0064336793,0.9138817,0.004499583,0.06038151],"study_design_scores_gemma":[0.0012291243,0.0001115751,0.00075430056,0.00011932065,0.000011778831,0.00001765349,0.0008305804,0.9522058,0.0007367122,0.0009933779,0.042555273,0.00043451722],"about_ca_topic_score_codex":0.000009774687,"about_ca_topic_score_gemma":0.0001275759,"teacher_disagreement_score":0.9511664,"about_ca_system_score_codex":0.000107409534,"about_ca_system_score_gemma":0.000595585,"threshold_uncertainty_score":0.99876624},"labels":[],"label_agreement":null},{"id":"W1963885726","doi":"10.1090/s0002-9939-07-08714-x","title":"Transversals for strongly almost disjoint families","year":2007,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Combinatorics; Genealogy; Mathematics; History","score_opus":0.025680803299576675,"score_gpt":0.28515555948452004,"score_spread":0.25947475618494337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963885726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23928958,0.000073418734,0.7489721,0.0046642274,0.000050370098,0.00054039195,0.000004257734,0.00012570551,0.006279925],"genre_scores_gemma":[0.8256233,0.00008547416,0.17372636,0.00038825357,0.00003121852,0.000020775611,2.1934478e-7,0.000009586573,0.00011481934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896824,0.000006171485,0.00031580694,0.00019316534,0.00024481118,0.00027181217],"domain_scores_gemma":[0.9988632,0.00033580652,0.00026285203,0.00023691946,0.00023275544,0.000068444235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008460945,0.00012271167,0.00026385393,0.000017169903,0.00020782984,0.000059854017,0.0012353223,0.00002382835,0.000004943735],"category_scores_gemma":[0.00015806624,0.00008247626,0.00031405364,0.00053661957,0.000400215,0.00017965722,0.0003148489,0.00012534174,0.000002500108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024172235,0.00025070083,0.00088807463,0.00019534149,0.00011413463,4.4551363e-8,0.011566722,0.000008200049,0.037314463,0.89950067,0.005754586,0.044382885],"study_design_scores_gemma":[0.0037339563,0.0016317575,0.038998883,0.0010747095,0.00031567208,0.00004485657,0.043533403,0.33093968,0.2444825,0.29575965,0.036910065,0.0025748715],"about_ca_topic_score_codex":0.0000016430354,"about_ca_topic_score_gemma":7.731473e-7,"teacher_disagreement_score":0.60374105,"about_ca_system_score_codex":0.000044268694,"about_ca_system_score_gemma":0.00002017775,"threshold_uncertainty_score":0.33632842},"labels":[],"label_agreement":null},{"id":"W1964055724","doi":"10.1109/icc.2012.6363703","title":"Joint beamforming and antenna selection for two-way amplify-and-forward MIMO relay networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Beamforming; Relay; Computer science; MIMO; Precoding; Antenna (radio); Signal-to-noise ratio (imaging); Transmission (telecommunications); Diversity gain; Selection (genetic algorithm); Topology (electrical circuits); Control theory (sociology); Telecommunications; Mathematical optimization; Mathematics; Power (physics)","score_opus":0.04282807105055662,"score_gpt":0.2829381109103678,"score_spread":0.2401100398598112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964055724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008795676,0.0015317793,0.98730236,0.0007302705,0.00020571663,0.0002292853,2.741812e-7,0.0001266039,0.0010780037],"genre_scores_gemma":[0.91760755,0.0007844307,0.08021558,0.0006708673,0.0001621014,0.000035479596,0.0000027735452,0.000008886531,0.000512316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991599,0.000058118483,0.0001930222,0.00020222164,0.00007264051,0.0003141114],"domain_scores_gemma":[0.99931693,0.00015591533,0.000063022904,0.0002493185,0.000081775266,0.00013305881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064471306,0.000116494695,0.00014012985,0.000065795575,0.000405202,0.00014516641,0.00018806155,0.0000505159,0.000010572223],"category_scores_gemma":[0.000038554397,0.000097996046,0.000032413034,0.00021450846,0.00003387765,0.00064904854,0.00029673512,0.00014617167,0.0000034038587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020132447,0.00008243162,0.008475651,0.00002257252,0.000055300745,1.7164366e-7,0.0020712295,0.00041249752,0.0045808335,0.5067868,0.0024425797,0.4750498],"study_design_scores_gemma":[0.00042773355,0.00006807201,0.0027790137,0.000025919177,0.000008929323,0.00003337073,0.000045607856,0.9748266,0.00043669448,0.00023238845,0.020909637,0.00020606705],"about_ca_topic_score_codex":0.000009379161,"about_ca_topic_score_gemma":0.000047967424,"teacher_disagreement_score":0.97441405,"about_ca_system_score_codex":0.000028203118,"about_ca_system_score_gemma":0.000010942453,"threshold_uncertainty_score":0.39961627},"labels":[],"label_agreement":null},{"id":"W1964227892","doi":"10.1109/tvt.2013.2259643","title":"Space–Time Trellis Codes for Two-Way Relay MIMO Channels With Single-Antenna Relay Nodes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Pairwise error probability; Relay; Relay channel; Trellis (graph); Upper and lower bounds; Space–time trellis code; MIMO; Topology (electrical circuits); Channel state information; Computer science; Space–time code; Diversity gain; Algorithm; Channel (broadcasting); Decoding methods; Mathematics; Telecommunications; Wireless; Block code; Power (physics); Concatenated error correction code; Physics; Combinatorics","score_opus":0.019852029807414132,"score_gpt":0.23802018017514423,"score_spread":0.2181681503677301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964227892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04035621,0.00034145144,0.94482595,0.012373408,0.00023259752,0.00076389546,0.000006074062,0.00088939106,0.00021099558],"genre_scores_gemma":[0.9389241,0.00019175997,0.058312524,0.0003310574,0.000025555726,0.00058411265,0.0000037485866,0.000039406565,0.0015877308],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982758,0.00011338575,0.00031958686,0.00061216473,0.00019272004,0.00048629678],"domain_scores_gemma":[0.9978541,0.00021663294,0.00012650093,0.0013444333,0.0003595968,0.00009870098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020787904,0.00030900058,0.00036303105,0.0005420391,0.00056646543,0.00016142109,0.0011180263,0.00026052818,0.00007444669],"category_scores_gemma":[0.000016427442,0.00026126474,0.00014300688,0.0011814546,0.00026942676,0.00041153433,0.000015476799,0.0005088472,0.0002696373],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013235118,0.0017790468,0.000043009048,0.000053408963,0.0006587754,0.00004133291,0.0012969545,0.075852245,0.5846564,0.03329635,0.0019199683,0.3002701],"study_design_scores_gemma":[0.0019047437,0.0011394173,0.000016665457,0.0002049586,0.000068413974,0.00013651917,0.000096688505,0.68177825,0.30305043,0.0009815898,0.009891254,0.0007310922],"about_ca_topic_score_codex":0.00001759484,"about_ca_topic_score_gemma":0.000063587635,"teacher_disagreement_score":0.8985679,"about_ca_system_score_codex":0.00009996442,"about_ca_system_score_gemma":0.000043937278,"threshold_uncertainty_score":0.99998397},"labels":[],"label_agreement":null},{"id":"W1964527706","doi":"10.1109/tcomm.2013.061913.110585","title":"Improved Low-Complexity Soliton-Like Network Coding for a Resource-Limited Relay","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Linear network coding; Relay; Computer science; Decoding methods; Coding (social sciences); Computer network; Erasure; Luby transform code; Degree distribution; Encoding (memory); Theoretical computer science; Algorithm; Block code; Mathematics; Concatenated error correction code; Network packet; Complex network","score_opus":0.07585027634728102,"score_gpt":0.2960460330290131,"score_spread":0.22019575668173208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964527706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004534745,0.0003133239,0.9839987,0.010235853,0.00042639524,0.0012677668,0.000017295202,0.00057021173,0.0027169443],"genre_scores_gemma":[0.8328765,0.0010364837,0.16119348,0.0019563562,0.00007106937,0.0015117222,0.000032959528,0.00004022681,0.0012812127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977538,0.00047581008,0.0005846517,0.00046297658,0.00018755355,0.00053523073],"domain_scores_gemma":[0.9929391,0.0013829395,0.00019389822,0.0048546186,0.0004236063,0.00020580208],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005322283,0.00028208064,0.000295625,0.00019124869,0.002450662,0.0003848867,0.0036893634,0.00013500047,0.00009075558],"category_scores_gemma":[0.000028070837,0.00029483967,0.00023857527,0.0010265135,0.00027494077,0.000634465,0.000077216355,0.00066669803,0.00012340517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013769421,0.0034218251,0.000040628263,0.00012676134,0.0006113735,0.0000011888131,0.0072657075,0.053360272,0.017070528,0.27227542,0.07321837,0.57247025],"study_design_scores_gemma":[0.00082863704,0.00013003725,0.00017446124,0.00011351413,0.000030872223,0.0000072159523,0.00009915472,0.9477838,0.0010687916,0.0022869543,0.04701383,0.00046273225],"about_ca_topic_score_codex":0.00004743999,"about_ca_topic_score_gemma":0.0003100734,"teacher_disagreement_score":0.89442354,"about_ca_system_score_codex":0.00015965739,"about_ca_system_score_gemma":0.000105564344,"threshold_uncertainty_score":0.99995035},"labels":[],"label_agreement":null},{"id":"W1964687629","doi":"10.1109/tmc.2011.92","title":"FESCIM: Fair, Efficient, and Secure Cooperation Incentive Mechanism for Multihop Cellular Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Network packet; Overhead (engineering); Relay; Collusion; Computer security; Payment; Node (physics); Incentive","score_opus":0.032046914871176994,"score_gpt":0.252424370414075,"score_spread":0.220377455542898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964687629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029310277,0.00017851619,0.9684656,0.00005637801,0.00079279474,0.0008077998,0.0000038876055,0.00024215392,0.00014254409],"genre_scores_gemma":[0.9632168,0.00014544465,0.03617981,0.0002215811,0.00005151983,0.000099137644,0.0000033272825,0.000019618115,0.00006276794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858,0.00015991114,0.0003150171,0.00049679045,0.00012947124,0.0003188465],"domain_scores_gemma":[0.9988238,0.0002282068,0.0001122188,0.0004807985,0.00024713596,0.000107808475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034751772,0.00021746698,0.00020202502,0.00013182474,0.0009762037,0.00014527823,0.00048047933,0.00010072308,0.000015408024],"category_scores_gemma":[0.000006492543,0.00022093547,0.00008825041,0.00042053408,0.000059690763,0.00020173247,0.00002230246,0.00029897373,0.000007970178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007105198,0.0007661265,0.00001711223,0.000044369313,0.00011757781,0.0000062317367,0.0130715575,0.5054235,0.0077916426,0.09528309,0.000101937374,0.37730578],"study_design_scores_gemma":[0.00060037925,0.00019277315,0.000016473636,0.00006136086,0.000015175256,0.0000041541985,0.00010388871,0.97533774,0.023127532,0.00016549141,0.00013434341,0.0002406831],"about_ca_topic_score_codex":0.000007612568,"about_ca_topic_score_gemma":0.000022687947,"teacher_disagreement_score":0.9339065,"about_ca_system_score_codex":0.000060891587,"about_ca_system_score_gemma":0.000034083903,"threshold_uncertainty_score":0.9009487},"labels":[],"label_agreement":null},{"id":"W1965099004","doi":"10.1049/iet-com.2010.0478","title":"Performance of multi-relay coded cooperative diversity in asynchronous code-division multiple-access over fading channels","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Fading; Cooperative diversity; Relay; Asynchronous communication; Telecommunications link; Convolutional code; Code division multiple access; Computer network; Base station; Bit error rate; Telecommunications; Algorithm; Decoding methods; Channel (broadcasting)","score_opus":0.16781941556023566,"score_gpt":0.33255232891371694,"score_spread":0.16473291335348128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965099004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8006206,0.0009212269,0.1931616,0.0004080214,0.00023992624,0.0006999848,0.000018748871,0.00018380352,0.0037460793],"genre_scores_gemma":[0.97322404,0.0023850808,0.024114946,0.00012950932,0.0000062119193,0.000052101088,0.000016911297,0.000011567598,0.000059618476],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828744,0.00046986304,0.00046852077,0.0003092976,0.00019478818,0.00027008992],"domain_scores_gemma":[0.9962869,0.00039258142,0.00024182408,0.002649899,0.0003422032,0.00008658932],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005836129,0.00019049592,0.00028868634,0.0002346943,0.00085168553,0.00007425823,0.0053823735,0.00008543345,0.000050252536],"category_scores_gemma":[0.0001233538,0.00019544153,0.00006997991,0.00095570186,0.00025792173,0.0011938951,0.007519722,0.0003950895,0.000018920071],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104054634,0.0035777716,0.7576309,0.00008028525,0.00018491599,0.000006010519,0.11603947,0.023880709,0.004747528,0.03562637,0.00046047787,0.057661545],"study_design_scores_gemma":[0.00092063914,0.00008233745,0.16517285,0.00014436326,0.0000062723443,0.0000015771794,0.000094610274,0.8308224,0.0022071232,0.000027510578,0.00028240232,0.00023790727],"about_ca_topic_score_codex":0.00023407339,"about_ca_topic_score_gemma":0.0013895535,"teacher_disagreement_score":0.8069417,"about_ca_system_score_codex":0.000120303346,"about_ca_system_score_gemma":0.00008170416,"threshold_uncertainty_score":0.999999},"labels":[],"label_agreement":null},{"id":"W1965255283","doi":"10.1109/bsc.2010.5472969","title":"SNR-based vs. BER-based power allocation for an amplify-and-forward single-relay wireless system with MRC at destination","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Wireless; Transmitter power output; Power (physics); Bit error rate; Signal-to-noise ratio (imaging); Maximal-ratio combining; Terminal (telecommunication); Computer network; Telecommunications; Fading; Transmitter; Channel (broadcasting); Physics","score_opus":0.030512217374633416,"score_gpt":0.26022148133969386,"score_spread":0.22970926396506045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965255283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18961318,0.00001460172,0.8069916,0.0012915246,0.00014328385,0.00047301393,0.0000019227325,0.0003014207,0.0011694655],"genre_scores_gemma":[0.9136479,0.0000014848414,0.08545561,0.0005498934,0.000027133417,0.00011743229,0.000043855238,0.000017691113,0.00013901315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987561,0.000117519514,0.00024674734,0.0004237549,0.0002270293,0.00022880998],"domain_scores_gemma":[0.99809074,0.00032310782,0.00014620223,0.0008324441,0.00046382344,0.00014365044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055684743,0.0001804491,0.00017039964,0.00011560216,0.0004618914,0.00025972383,0.00057166157,0.0000942242,0.000015066931],"category_scores_gemma":[0.000041919677,0.00014737424,0.000034702487,0.0002972117,0.00007883776,0.00041521402,0.000096005635,0.00015184589,0.000009148297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045978426,0.0009613157,0.0073258393,0.00023192672,0.000064134256,0.0000037249802,0.0014824279,0.010483941,0.18361394,0.67825043,0.0015630416,0.115559496],"study_design_scores_gemma":[0.0011680574,0.00055287464,0.0015587644,0.00007157137,0.0000116414985,0.000008264114,0.000025836098,0.9751779,0.018161066,0.000019281575,0.0029519023,0.00029283363],"about_ca_topic_score_codex":0.00001559705,"about_ca_topic_score_gemma":0.00094768807,"teacher_disagreement_score":0.96469396,"about_ca_system_score_codex":0.00011377693,"about_ca_system_score_gemma":0.00011588023,"threshold_uncertainty_score":0.60097474},"labels":[],"label_agreement":null},{"id":"W1965321556","doi":"10.1155/2009/901965","title":"Power Allocation and Admission Control in Multiuser Relay Networks via Convex Programming: Centralized and Distributed Schemes","year":2009,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Aristotle University of Thessaloniki","keywords":"Computer science; Resource allocation; Mathematical optimization; Max-min fairness; Maximization; Power control; Relay; Heuristic; Throughput; Power (physics); Wireless network; Wireless; Computer network; Distributed computing; Telecommunications; Mathematics","score_opus":0.024258662924366514,"score_gpt":0.2838015596840111,"score_spread":0.2595428967596446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965321556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14298649,0.04802781,0.7859454,0.02163104,0.0002633239,0.00075971667,0.0000015352489,0.00016763328,0.00021702045],"genre_scores_gemma":[0.94261384,0.05018975,0.0062208953,0.00087764894,0.000053042804,0.000012616669,0.0000108941085,0.000011725778,0.000009591661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798506,0.0006496733,0.00053573446,0.00029861706,0.00017007925,0.0003608183],"domain_scores_gemma":[0.9980074,0.0004751805,0.00030106882,0.0008124865,0.00014774554,0.00025611595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009600847,0.00023216783,0.00032095207,0.00014993471,0.0009150301,0.00052117545,0.0007544927,0.00011158962,0.0000033362883],"category_scores_gemma":[0.000034723795,0.0002077923,0.00004241881,0.00048719184,0.00013588714,0.00045392392,0.00030537051,0.0008115017,5.4581415e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007819756,0.00022893462,0.013558651,0.0000044043622,0.000036025755,0.000009178593,0.00093571364,0.00054677104,0.00053948973,0.014933649,0.00010781904,0.96902114],"study_design_scores_gemma":[0.002147927,0.00022132011,0.029544523,0.00048689268,0.000013788621,0.00011664214,0.00006234875,0.92265105,0.000015051377,0.00028290704,0.044134248,0.00032328392],"about_ca_topic_score_codex":0.0000020938924,"about_ca_topic_score_gemma":0.000014150622,"teacher_disagreement_score":0.9686979,"about_ca_system_score_codex":0.000060419738,"about_ca_system_score_gemma":0.000033285596,"threshold_uncertainty_score":0.8473524},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04145693096827495,"score_gpt":0.29054678153661295,"score_spread":0.249089850568338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965556172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010382463,0.00009102689,0.96525055,0.0011485443,0.0007937031,0.0002861455,0.0000011396171,0.00022011535,0.021826323],"genre_scores_gemma":[0.79394853,0.00010962049,0.20366561,0.0016136226,0.00016311037,0.000038714716,0.000007698958,0.000011065093,0.00044204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989551,0.000058550802,0.00023546275,0.0002951826,0.00013620635,0.00031954798],"domain_scores_gemma":[0.99844986,0.0005764986,0.00008116696,0.0006467068,0.00015707714,0.00008869305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055900146,0.00013069402,0.00015248111,0.00006533624,0.00061276497,0.00017595466,0.0008059012,0.000058285154,0.00008715588],"category_scores_gemma":[0.00010087733,0.000118995886,0.00006330548,0.00034348105,0.00003224309,0.00029487492,0.00024368387,0.0002337703,0.00004363574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012306996,0.000035865978,0.00010110339,0.0000034571049,0.000008187453,7.109597e-7,0.00014801773,0.0008514757,0.0031630995,0.88992816,0.015594299,0.09015332],"study_design_scores_gemma":[0.0006725487,0.00012432263,0.0004383286,0.000048538976,0.000004120418,0.000011728919,0.0000151754275,0.76969093,0.0011654865,0.0052062855,0.22232467,0.000297853],"about_ca_topic_score_codex":0.0000030166684,"about_ca_topic_score_gemma":0.00014844038,"teacher_disagreement_score":0.8847219,"about_ca_system_score_codex":0.000028146338,"about_ca_system_score_gemma":0.000040275194,"threshold_uncertainty_score":0.48525116},"labels":[],"label_agreement":null},{"id":"W1965632003","doi":"10.1049/iet-com.2011.0572","title":"Max–min relay selection in bidirectional cooperative networks with imperfect channel estimation","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Relay channel; Channel (broadcasting); Transmission (telecommunications); Imperfect; Selection (genetic algorithm); Channel state information; Transmitter power output; Outage probability; Telecommunications; Power (physics); Wireless; Mathematical optimization; Mathematics; Transmitter; Fading; Artificial intelligence","score_opus":0.03744637526057233,"score_gpt":0.29418667822827893,"score_spread":0.2567403029677066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965632003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014783852,0.00300573,0.97159773,0.004009358,0.00019763754,0.00054342806,0.000002396139,0.0003478555,0.005512004],"genre_scores_gemma":[0.94941133,0.0013911846,0.048324395,0.00028537548,0.00005719056,0.0002592578,0.00004142776,0.000016242115,0.00021356613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983257,0.00061692164,0.0003106907,0.0002285726,0.000174017,0.0003440704],"domain_scores_gemma":[0.99791884,0.00040853006,0.00013094378,0.0012029359,0.0002302963,0.00010847279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535067,0.0001801835,0.00017935036,0.00021922756,0.0006661249,0.00013620238,0.0012282502,0.00008681557,0.000026693031],"category_scores_gemma":[0.00008024297,0.00016718624,0.000040712082,0.0016846181,0.000112730755,0.0011796101,0.00049886596,0.0005182726,0.000045177952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007599789,0.0019525265,0.02775804,0.000017383289,0.00017689854,0.0000015196608,0.012260922,0.5353266,0.0015664481,0.31493998,0.0050819293,0.10084177],"study_design_scores_gemma":[0.00038880028,0.00007417989,0.026196655,0.00006250154,0.000008332126,0.000034802753,0.000068192174,0.967643,0.00018561492,0.00006722897,0.0050212797,0.00024936994],"about_ca_topic_score_codex":0.00004162211,"about_ca_topic_score_gemma":0.00071859796,"teacher_disagreement_score":0.93462753,"about_ca_system_score_codex":0.00021109321,"about_ca_system_score_gemma":0.00009671608,"threshold_uncertainty_score":0.68176574},"labels":[],"label_agreement":null},{"id":"W1965734862","doi":"10.1109/glocom.2013.6831740","title":"Adaptive physical-layer network coding in two-way relaying with OFDM","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Physical layer; Computer science; Linear network coding; Orthogonal frequency-division multiplexing; Computer network; Coding (social sciences); Telecommunications; Wireless; Channel (broadcasting)","score_opus":0.04363063887481687,"score_gpt":0.2824385676937053,"score_spread":0.2388079288188884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965734862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09195859,0.00026491212,0.81476057,0.0020620483,0.00012107796,0.0004927644,1.1891448e-7,0.0002851982,0.09005471],"genre_scores_gemma":[0.958339,0.000052778956,0.040137425,0.00073907303,0.00008678455,0.000058406684,5.909112e-7,0.000009606518,0.00057638506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886435,0.00015069597,0.00017383006,0.0003081587,0.0001647873,0.00033816244],"domain_scores_gemma":[0.9988933,0.00024452584,0.00006417397,0.00060164667,0.00011657109,0.00007976782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002161681,0.00014460647,0.00018154022,0.00006246404,0.00018923548,0.00018238291,0.00071649416,0.000019490233,0.00007603446],"category_scores_gemma":[0.00001316386,0.00010882034,0.0000324302,0.00081229577,0.000042511667,0.0007539178,0.0004252806,0.00025609217,0.0001751741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012516329,0.000115456845,0.008450713,0.000004000589,0.000034160195,0.000009442688,0.0030240575,0.021217344,0.0014591925,0.77214754,0.0045170756,0.18900852],"study_design_scores_gemma":[0.0005708383,0.000076729164,0.011940053,0.000104289094,0.000002558541,0.0000047914746,0.00009201754,0.9826727,0.00039123016,0.0031877586,0.0006707515,0.0002862865],"about_ca_topic_score_codex":0.000050220406,"about_ca_topic_score_gemma":0.00022316034,"teacher_disagreement_score":0.96145535,"about_ca_system_score_codex":0.000057191217,"about_ca_system_score_gemma":0.00003156515,"threshold_uncertainty_score":0.4437565},"labels":[],"label_agreement":null},{"id":"W1965862126","doi":"10.1109/pimrc.2011.6139825","title":"Symbol-asynchronous compute-and-forward","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Asynchronous communication; Decoding methods; Relay; Computer science; Algorithm; Coding (social sciences); Single antenna interference cancellation; Theoretical computer science; Topology (electrical circuits); Mathematics; Telecommunications","score_opus":0.053128149553023876,"score_gpt":0.2519242355143317,"score_spread":0.19879608596130782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965862126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005548366,0.0003925422,0.8978003,0.00047588506,0.00012150325,0.00006896537,8.9644296e-8,0.00022929904,0.09536303],"genre_scores_gemma":[0.9063316,0.00031334572,0.09222772,0.000764566,0.000017159615,0.0000046750756,3.6035271e-7,0.0000033852427,0.0003372143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994601,0.000048675865,0.00011256646,0.00017668311,0.00006769212,0.00013428263],"domain_scores_gemma":[0.9993287,0.000037646543,0.000025020257,0.00048334655,0.00004932506,0.000076015625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013992895,0.00007421042,0.00008712935,0.00004299382,0.00013344738,0.00006188435,0.0006320682,0.000022850429,0.00012925616],"category_scores_gemma":[0.000007134561,0.00006254273,0.000022951566,0.00016103186,0.00003752335,0.00022912615,0.0005501753,0.000075048585,0.00010666739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010856601,0.00003423483,0.0009917519,0.000001970731,0.000009868853,0.0000024536446,0.0018420732,0.0000020425646,0.00006700358,0.7344728,0.0011723335,0.26140237],"study_design_scores_gemma":[0.0018299893,0.00060446066,0.14332424,0.00009121942,0.0000216535,0.00016794915,0.00028140406,0.7355741,0.0077623804,0.024150744,0.084577374,0.0016144362],"about_ca_topic_score_codex":0.000008551042,"about_ca_topic_score_gemma":0.000017465598,"teacher_disagreement_score":0.9007832,"about_ca_system_score_codex":0.0000115927505,"about_ca_system_score_gemma":0.000019429148,"threshold_uncertainty_score":0.25504184},"labels":[],"label_agreement":null},{"id":"W1965956356","doi":"10.1109/vtcfall.2013.6692112","title":"Base Station and Relay Station Broadband Network Planning Using Immune Quantum Evolutionary Algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Evolutionary algorithm; Base station; Mathematical optimization; RSS; Probabilistic logic; Quantum computer; Optimization problem; Wireless network; Network planning and design; Computer network; Algorithm; Distributed computing; Wireless; Quantum; Artificial intelligence; Mathematics; Telecommunications","score_opus":0.03917564686399309,"score_gpt":0.28198347127255946,"score_spread":0.24280782440856638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965956356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050402697,0.002790893,0.9452879,0.00054859894,0.00018743765,0.00022679848,0.0000011645984,0.00013126867,0.0004232383],"genre_scores_gemma":[0.56515807,0.00037882847,0.43377513,0.00031119763,0.000078854806,0.000020573982,0.00003004162,0.000010225868,0.00023709037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988639,0.00019548115,0.00028277736,0.0002580321,0.00016521492,0.00023461673],"domain_scores_gemma":[0.9990951,0.00015376741,0.000111331596,0.00036064436,0.00019823309,0.00008092207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031698163,0.00012321204,0.00012326593,0.000081307764,0.00049164356,0.00024206523,0.00026115932,0.000044528,0.00008290029],"category_scores_gemma":[0.000027976535,0.00011681813,0.00002358651,0.0003894383,0.000042869942,0.0012276982,0.00024736286,0.00014175533,0.00002255734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013280979,0.00011380566,0.0042402945,0.00002272446,0.00006892563,0.0000087230155,0.0040511717,0.09045426,0.006559594,0.08563678,0.014295432,0.794535],"study_design_scores_gemma":[0.0002442317,0.000034925186,0.027055187,0.00004754558,0.0000036265737,0.00001172084,0.00009721835,0.9695624,0.00006349838,0.0020243174,0.0006997537,0.00015559258],"about_ca_topic_score_codex":0.00015112964,"about_ca_topic_score_gemma":0.0000056306353,"teacher_disagreement_score":0.87910813,"about_ca_system_score_codex":0.00006105894,"about_ca_system_score_gemma":0.000052639916,"threshold_uncertainty_score":0.47637054},"labels":[],"label_agreement":null},{"id":"W1965991184","doi":"10.1109/vtcfall.2013.6692260","title":"Joint Relay and Destination Design for Two-Way MIMO AF Multi-Relay Systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; MIMO; Precoding; Optimization problem; Mathematical optimization; Computer science; Convex optimization; Singular value decomposition; Relay channel; Gradient descent; Mean squared error; Control theory (sociology); Mathematics; Channel (broadcasting); Algorithm; Regular polygon; Power (physics); Telecommunications; Statistics","score_opus":0.10790687467736132,"score_gpt":0.2934917180444201,"score_spread":0.18558484336705877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965991184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032545791,0.0007476227,0.9928934,0.0011245963,0.0001949823,0.00085376576,2.6297533e-7,0.00015706706,0.00077374466],"genre_scores_gemma":[0.64202344,0.000088687935,0.35555714,0.00018351065,0.000026451484,0.00021429165,0.0000014626103,0.0000071715754,0.0018978253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903506,0.00019380469,0.00023575188,0.0002558648,0.00009812238,0.00018141845],"domain_scores_gemma":[0.99875754,0.00034955246,0.00008017604,0.00043873792,0.00028835275,0.00008561918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059137784,0.00011151558,0.00012914289,0.000072767914,0.00026139614,0.00035425278,0.0003710442,0.000039429124,0.000017221948],"category_scores_gemma":[0.00012702784,0.00009051924,0.000028079017,0.00017817756,0.000030860523,0.00049479125,0.00019874227,0.00008172725,0.000057818106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011926139,0.00029581515,0.00069274456,0.000089295594,0.000076920434,0.0000023563919,0.003682346,0.031116258,0.0413377,0.55646366,0.03543692,0.33079407],"study_design_scores_gemma":[0.0005564217,0.000060763345,0.0013484558,0.000038438317,0.000003030593,0.000008019407,0.00003262127,0.9950381,0.0011567628,0.00012876933,0.0014878727,0.00014072542],"about_ca_topic_score_codex":0.00003513835,"about_ca_topic_score_gemma":0.00001817852,"teacher_disagreement_score":0.96392184,"about_ca_system_score_codex":0.000039931077,"about_ca_system_score_gemma":0.000025850928,"threshold_uncertainty_score":0.36912677},"labels":[],"label_agreement":null},{"id":"W1966272865","doi":"10.1002/wcm.783","title":"A bandwidth-efficient cooperative relaying scheme with hard interference cancellation and iterative decoding","year":2008,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Computer science; Single antenna interference cancellation; Decoding methods; Bandwidth (computing); Relay channel; Transmission (telecommunications); Spectral efficiency; Diversity gain; Electronic engineering; Antenna diversity; Interference (communication); Computer network; Telecommunications; Wireless; Fading; Power (physics); Beamforming; Engineering; Channel (broadcasting); Physics","score_opus":0.04299821088910934,"score_gpt":0.27720022322255183,"score_spread":0.2342020123334425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966272865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5540989,0.0038884652,0.43987155,0.00047283614,0.000040619234,0.00036489638,0.0000016366921,0.0001344801,0.0011266099],"genre_scores_gemma":[0.91742784,0.0050613093,0.077189766,0.00014876362,0.000018443272,0.00006693555,0.000009141358,0.000013373502,0.00006441057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984901,0.00029658896,0.0003606711,0.00044798784,0.00014389644,0.00026078243],"domain_scores_gemma":[0.9976578,0.00049243006,0.00019357268,0.001183726,0.00035165696,0.00012081261],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00034822573,0.00022711592,0.00027567038,0.00013237844,0.002077748,0.00026192344,0.00087060896,0.000053660115,0.000003997246],"category_scores_gemma":[0.00002629923,0.000202687,0.000027291664,0.000535265,0.00039363175,0.00033703473,0.0015229326,0.00038037077,0.0000027989468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054446577,0.0004477646,0.02925786,0.00007653876,0.00018788024,0.00001869095,0.101073615,0.010093874,0.010977868,0.19932945,0.00018373065,0.64829826],"study_design_scores_gemma":[0.00051179325,0.00013860643,0.002466396,0.00030539194,0.000006292346,0.000103371916,0.00051149854,0.99387014,0.000340184,0.000020952773,0.0014249086,0.00030043634],"about_ca_topic_score_codex":0.000018896964,"about_ca_topic_score_gemma":0.00004649328,"teacher_disagreement_score":0.9837763,"about_ca_system_score_codex":0.00007217953,"about_ca_system_score_gemma":0.00010164648,"threshold_uncertainty_score":0.9992214},"labels":[],"label_agreement":null},{"id":"W1966451111","doi":"10.1109/twc.2014.2329877","title":"Energy-Efficient Resource Allocation for OFDMA Cellular Networks With User Cooperation and QoS Provisioning","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Orthogonal frequency-division multiple access; Resource allocation; Optimization problem; Fractional programming; Efficient energy use; Nonlinear programming; Frequency-division multiple access; Quality of service; Nonlinear system; Orthogonal frequency-division multiplexing; Mathematics; Computer network; Channel (broadcasting)","score_opus":0.021588138671278206,"score_gpt":0.24338965994904915,"score_spread":0.22180152127777095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966451111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003799364,0.00039240433,0.9905357,0.004120598,0.000116887204,0.00050852954,0.0000045266993,0.00023937787,0.00028262963],"genre_scores_gemma":[0.96744186,0.0010619473,0.029777525,0.00057532993,0.00004218932,0.000721315,0.000028548255,0.000031207575,0.0003200956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983369,0.00043404073,0.00035632946,0.00042104532,0.00019117801,0.00026048982],"domain_scores_gemma":[0.9964624,0.00072118157,0.00015535938,0.0021828713,0.00035506033,0.00012312182],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00048723572,0.00022675261,0.00021484206,0.00018347577,0.0017472834,0.00029164468,0.0012639997,0.000101023026,0.000005316233],"category_scores_gemma":[0.000008636562,0.00020988127,0.00006179625,0.00062381825,0.00017359464,0.00029200074,0.000036116242,0.00030834437,0.0000029102569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044994944,0.0004742926,0.000014458742,0.000017864648,0.000064016036,1.488246e-7,0.00090861344,0.47959188,0.004033726,0.1552641,0.00027094007,0.35931498],"study_design_scores_gemma":[0.00061149016,0.00015611717,0.00002764627,0.0001187907,0.000029830779,0.0000032809266,0.000039560757,0.968882,0.0062202658,0.000025427425,0.023623668,0.0002618977],"about_ca_topic_score_codex":0.000016640659,"about_ca_topic_score_gemma":0.00018765482,"teacher_disagreement_score":0.9636425,"about_ca_system_score_codex":0.00006944595,"about_ca_system_score_gemma":0.00006497589,"threshold_uncertainty_score":0.9995523},"labels":[],"label_agreement":null},{"id":"W1966622101","doi":"10.1109/glocom.2014.7037366","title":"Outage probability of underlay cognitive relay networks with spatially random nodes","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Underlay; Relay; Poisson point process; Stochastic geometry; Computer science; Interference (communication); Cognitive radio; Multicast; Computer network; Signal-to-noise ratio (imaging); Point process; Topology (electrical circuits); Cognitive network; Power (physics); Telecommunications; Mathematics; Wireless; Engineering; Electrical engineering; Statistics","score_opus":0.025550414873622855,"score_gpt":0.2483085914140445,"score_spread":0.22275817654042163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966622101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021237273,0.00007895737,0.9589133,0.00048207288,0.000050035123,0.00026401252,3.3234687e-7,0.00010561516,0.018868396],"genre_scores_gemma":[0.96251696,0.000054441494,0.036798414,0.0003382171,0.000025010273,0.0000132954165,0.0000023569785,0.0000060331795,0.00024524305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879426,0.0003691306,0.00024080186,0.0002655172,0.00016375163,0.00016654839],"domain_scores_gemma":[0.9982094,0.00071861455,0.000117151816,0.0005920098,0.0003019026,0.000060921793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072565104,0.000119445496,0.00021924065,0.00003740635,0.00012458707,0.00006581162,0.0005739794,0.000041762945,0.000043934826],"category_scores_gemma":[0.00013635615,0.00008373725,0.000044734243,0.00030944086,0.00013095743,0.00021760911,0.00025965128,0.0001440998,0.000006931579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049403746,0.0005935568,0.02179319,0.000054657994,0.00018975571,0.000003100091,0.0043532457,0.057445433,0.000465109,0.5181897,0.00035874816,0.39605942],"study_design_scores_gemma":[0.0027115229,0.0002831063,0.010148361,0.0001276801,0.000015749929,0.000003922174,0.000038699738,0.9838846,0.0008973409,0.0011103898,0.00051096344,0.00026769264],"about_ca_topic_score_codex":0.000011656241,"about_ca_topic_score_gemma":0.00028665754,"teacher_disagreement_score":0.9412797,"about_ca_system_score_codex":0.000016297958,"about_ca_system_score_gemma":0.000049178605,"threshold_uncertainty_score":0.34147057},"labels":[],"label_agreement":null},{"id":"W1966805475","doi":"10.1109/pimrc.2011.6139731","title":"Multicarrier HF communications with amplify-and-forward relaying","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Electronic engineering; Transmission (telecommunications); Wireless; Communications system; Key (lock); Fading; Pairwise error probability; Computer network; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.09769900975575571,"score_gpt":0.27999017700351364,"score_spread":0.18229116724775793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966805475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004191504,0.0005438823,0.8463399,0.0018288799,0.000039206334,0.00017428308,4.794639e-7,0.00028871073,0.14659317],"genre_scores_gemma":[0.72901326,0.00051740545,0.26946348,0.00055752986,0.000004515315,0.00001890923,0.0000011099818,0.000005071525,0.00041873677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993608,0.00009673995,0.00013536723,0.0001789556,0.0000852927,0.00014281976],"domain_scores_gemma":[0.99805176,0.000116620766,0.00004143254,0.0016049102,0.00009348067,0.00009178203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020391401,0.00008723608,0.00009245881,0.000050523227,0.00034183727,0.00007842706,0.001208143,0.00002996042,0.000060632312],"category_scores_gemma":[0.000018078785,0.00006567935,0.000016496797,0.00024370721,0.00012808086,0.00033986018,0.00090373814,0.00016927953,0.00003783703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048308293,0.00005262957,0.004365654,0.0000023078028,0.000026028596,0.0000012351965,0.0050281445,0.000001585935,0.00014968995,0.900087,0.00032749525,0.0899534],"study_design_scores_gemma":[0.0031609912,0.00060603576,0.07907634,0.00023497247,0.00007984362,0.00017348495,0.0019519585,0.62523544,0.0031407988,0.00934374,0.27493304,0.0020633312],"about_ca_topic_score_codex":0.000019076539,"about_ca_topic_score_gemma":0.000093391645,"teacher_disagreement_score":0.89074326,"about_ca_system_score_codex":0.00001344762,"about_ca_system_score_gemma":0.000026154541,"threshold_uncertainty_score":0.2678326},"labels":[],"label_agreement":null},{"id":"W1967391395","doi":"10.1109/icassp.2010.5494902","title":"Achievable rate region and sum-rate maximization for network beamforming for bi-directional relay networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Maximization; Beamforming; Relay; Constraint (computer-aided design); Transmitter power output; Computer science; Mathematical optimization; Power (physics); Mathematics; Telecommunications; Transmitter","score_opus":0.02972801645483786,"score_gpt":0.2625850752457633,"score_spread":0.23285705879092544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967391395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021218185,0.00019682589,0.9930025,0.0021288348,0.0009354561,0.0006004762,7.375027e-7,0.00019403484,0.00081936904],"genre_scores_gemma":[0.28649253,0.0014582659,0.7016851,0.0022584766,0.0011529503,0.00044793417,0.00008069664,0.0000449451,0.0063791294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890846,0.00008505813,0.0002598082,0.00035643578,0.00006330384,0.00032691698],"domain_scores_gemma":[0.99840766,0.0006768059,0.00012684117,0.00044082283,0.00025753528,0.00009033465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011136583,0.00014881167,0.00015749625,0.00006484624,0.00088065816,0.00027133024,0.00039975398,0.00010658271,0.00001001136],"category_scores_gemma":[0.0001305486,0.0001362015,0.0000615282,0.0003649725,0.000044837525,0.0005812543,0.00020200647,0.00019525479,0.000001653411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012381852,0.000062330335,0.0010833263,0.00002453944,0.000050734583,5.4450226e-7,0.00025793325,0.10727494,0.0017556157,0.72666794,0.031235158,0.13146314],"study_design_scores_gemma":[0.00049002125,0.000063850915,0.0004797844,0.000018823912,0.0000074849963,0.0000084881385,0.000005270288,0.91389227,0.00023151694,0.0029567229,0.081665814,0.00017996934],"about_ca_topic_score_codex":0.0000033290235,"about_ca_topic_score_gemma":0.00017172478,"teacher_disagreement_score":0.8066173,"about_ca_system_score_codex":0.000020860529,"about_ca_system_score_gemma":0.00004470469,"threshold_uncertainty_score":0.67734},"labels":[],"label_agreement":null},{"id":"W1967393606","doi":"10.1109/icc.2012.6364454","title":"Distributed beamforming and subcarrier power allocation for OFDM-based asynchronous two-way relay networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Subcarrier; Relay; Orthogonal frequency-division multiplexing; Computer science; Beamforming; Asynchronous communication; Transceiver; Electronic engineering; Multiplexing; Channel (broadcasting); Power (physics); Computer network; Telecommunications; Engineering; Wireless","score_opus":0.021577494604666653,"score_gpt":0.2713050496164222,"score_spread":0.24972755501175556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967393606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010244048,0.00079906,0.98635596,0.0010633575,0.0002512789,0.00030118288,0.0000023718069,0.00014536173,0.0008373846],"genre_scores_gemma":[0.9476672,0.00005528809,0.051268276,0.0007243655,0.00007702398,0.000058398215,0.000045202716,0.000010218386,0.000094037896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902034,0.000077259574,0.00022147282,0.00021735138,0.00010662364,0.0003569372],"domain_scores_gemma":[0.99882144,0.00025566996,0.00008071733,0.00053963397,0.00015034429,0.0001521788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060414296,0.00013777532,0.00013627841,0.000052469684,0.00034480132,0.00013288241,0.00039180895,0.00005868439,0.000029756548],"category_scores_gemma":[0.00006112223,0.00012199686,0.000046852416,0.00028694468,0.000044186767,0.0006029852,0.00018814328,0.0001158332,0.000005369191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005664878,0.00032685293,0.015529698,0.000026369444,0.00008748647,8.2924885e-7,0.0018404038,0.019891152,0.0016703367,0.71838367,0.0066018137,0.23558475],"study_design_scores_gemma":[0.00074787857,0.000072034185,0.004345651,0.00002145468,0.000009463947,0.000004707255,0.000027293512,0.97122335,0.0009819092,0.00008590501,0.022219487,0.00026088246],"about_ca_topic_score_codex":0.0000046694086,"about_ca_topic_score_gemma":0.000022419894,"teacher_disagreement_score":0.9513322,"about_ca_system_score_codex":0.00006797454,"about_ca_system_score_gemma":0.00003800191,"threshold_uncertainty_score":0.49748877},"labels":[],"label_agreement":null},{"id":"W1967459533","doi":"10.1016/j.aam.2013.02.001","title":"Inequivalent representations of matroids over prime fields","year":2013,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Mersenne prime; Combinatorics; Prime power; Prime (order theory); Integer (computer science); Discrete mathematics; Field (mathematics); Pure mathematics","score_opus":0.023486742364840333,"score_gpt":0.31099295807236715,"score_spread":0.2875062157075268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967459533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01933895,0.0007250099,0.91503125,0.00031080685,0.00008696739,0.00043700737,5.105579e-7,0.00006919306,0.06400031],"genre_scores_gemma":[0.7361722,0.0006108847,0.26295292,0.000076807984,0.000010579368,0.000082307764,0.0000010106771,0.0000046271794,0.00008867198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992429,0.000015299194,0.00033111652,0.00014050747,0.00014522174,0.00012493959],"domain_scores_gemma":[0.998842,0.0002868388,0.0001299464,0.0006700143,0.00004276591,0.000028440169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013041928,0.00008109445,0.0001528821,0.00007185401,0.000037815844,0.00003183116,0.0006077314,0.00002953218,0.00007922509],"category_scores_gemma":[0.000045694636,0.00007342323,0.000026367661,0.00033174607,0.000045539135,0.00029634184,0.00028736948,0.000099462275,0.000034171822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.494526e-7,0.00012343535,0.00035698537,0.000052376497,0.000004160094,2.5285806e-7,0.0012979427,0.0005351997,0.0025952177,0.9468743,0.00020096343,0.04795839],"study_design_scores_gemma":[0.0013060648,0.00008580733,0.0069428305,0.0002631286,0.000011516332,0.0000063185867,0.000604392,0.258859,0.026219064,0.698568,0.006504421,0.0006294514],"about_ca_topic_score_codex":0.0000025602826,"about_ca_topic_score_gemma":0.000013455722,"teacher_disagreement_score":0.71683323,"about_ca_system_score_codex":0.000021902164,"about_ca_system_score_gemma":0.000017032673,"threshold_uncertainty_score":0.29941127},"labels":[],"label_agreement":null},{"id":"W1967577542","doi":"10.1109/icassp.2010.5494899","title":"Joint bandwidth and power allocation in wireless multi-user decode-and-forward relay networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Relay; Bandwidth (computing); Maximization; Resource allocation; Bandwidth allocation; Wireless; Dynamic bandwidth allocation; Computer network; Mathematical optimization; Optimization problem; Minification; Wireless network; Power (physics); Telecommunications; Algorithm; Mathematics","score_opus":0.02231368923665136,"score_gpt":0.2622246226603487,"score_spread":0.23991093342369732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967577542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29875022,0.00022110509,0.6973024,0.0020860904,0.00018516804,0.00016764872,1.2203739e-7,0.000086236025,0.0012009942],"genre_scores_gemma":[0.9662249,0.00083338015,0.031590365,0.0006607232,0.000016432426,0.000015211366,0.0000012312931,0.0000068732284,0.00065084756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991625,0.00008004534,0.00021477594,0.00028076433,0.000082844716,0.00017907529],"domain_scores_gemma":[0.9992845,0.00009382342,0.00004754621,0.0004078802,0.000073128154,0.00009308982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050024956,0.00011126911,0.00013276005,0.00008318949,0.00012861918,0.00015596267,0.00032211753,0.00008144516,0.000034612225],"category_scores_gemma":[0.000036146514,0.000094971954,0.00001868515,0.00023801673,0.00005669958,0.000354377,0.000412384,0.00032582245,0.0000070695055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012939165,0.00018585152,0.031983525,0.000008753838,0.000022590051,0.000005592698,0.002855808,0.0005430775,0.011937176,0.6807487,0.0014226923,0.2702733],"study_design_scores_gemma":[0.000615708,0.000025957814,0.1075647,0.000023698216,0.0000019347917,0.000010721676,0.00002561973,0.88693607,0.00052022975,0.00011113431,0.003959442,0.00020479954],"about_ca_topic_score_codex":0.000017471219,"about_ca_topic_score_gemma":0.0014493628,"teacher_disagreement_score":0.88639295,"about_ca_system_score_codex":0.000013740534,"about_ca_system_score_gemma":0.000022174308,"threshold_uncertainty_score":0.3872844},"labels":[],"label_agreement":null},{"id":"W1967913462","doi":"10.1109/allerton.2010.5706953","title":"On the optimality of successive decoding in compress-and-forward relay schemes","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decodes; Decoding methods; Relay; Computer science; Relay channel; Joint (building); Cover (algebra); Sequential decoding; Process (computing); Algorithm; Block code; Engineering","score_opus":0.028209624585579806,"score_gpt":0.2918548188501362,"score_spread":0.2636451942645564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967913462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87503767,0.0001095576,0.09288416,0.0054705585,0.0001145422,0.00015051675,4.2897918e-7,0.00004353235,0.026189039],"genre_scores_gemma":[0.9862354,0.00007551206,0.013220077,0.00036254822,0.000006704476,0.000007182823,2.5266715e-7,0.000002034214,0.00009032423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994174,0.00009312078,0.00015756575,0.00014032712,0.000095784686,0.00009578277],"domain_scores_gemma":[0.9985419,0.00078661175,0.00005880739,0.0005232647,0.00006147786,0.000027941953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004890542,0.00006158043,0.000095645635,0.000044923465,0.00010408156,0.000058024965,0.00073419214,0.000028193825,0.00007052384],"category_scores_gemma":[0.0001967839,0.000039008064,0.000021472748,0.00021208098,0.0000803133,0.00016005948,0.00043196158,0.00025451733,0.000004435651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024003402,0.000020754214,0.0029021841,0.0000016783471,0.0000031639925,3.2478198e-7,0.00030772263,0.000047472655,0.0024637117,0.9825965,0.000143419,0.011510638],"study_design_scores_gemma":[0.0004789953,0.00005264302,0.035627734,0.000073354284,0.0000025965792,0.0000029576142,0.00010325174,0.9368535,0.018030934,0.0051546297,0.0033996454,0.00021975771],"about_ca_topic_score_codex":0.000010721804,"about_ca_topic_score_gemma":0.00013307402,"teacher_disagreement_score":0.9774419,"about_ca_system_score_codex":0.000006068112,"about_ca_system_score_gemma":0.000018126007,"threshold_uncertainty_score":0.15907027},"labels":[],"label_agreement":null},{"id":"W1968419395","doi":"10.1109/mascot.2008.4770562","title":"Network Information Flow in Network of Queues","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Linear network coding; Network topology; Multicast; Distributed computing; Queueing theory; Network packet","score_opus":0.034722928172895774,"score_gpt":0.24522396386829443,"score_spread":0.21050103569539866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968419395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011581863,0.000856539,0.9396383,0.0012036338,0.00029190345,0.00018471824,2.2585343e-7,0.00014587874,0.046096925],"genre_scores_gemma":[0.9174877,0.0009087446,0.08044887,0.00095214613,0.000061772495,0.000007780339,0.0000035326427,0.000002014428,0.0001274667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992877,0.00008346994,0.00028180628,0.00007323753,0.00010955976,0.00016421685],"domain_scores_gemma":[0.999327,0.00008507469,0.000069770314,0.0003904354,0.00009885825,0.000028856815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028822827,0.00006241065,0.00011430447,0.000037047976,0.000100418285,0.000022107497,0.00051185704,0.000030089874,0.000032675118],"category_scores_gemma":[0.00002561326,0.000056514848,0.000024254061,0.0007427841,0.00002999871,0.0007595237,0.00024181929,0.000088415756,0.000028377073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011230026,0.000046696536,0.016440295,0.000008019769,0.000009599752,0.0000023718526,0.0031977193,0.28447247,0.000011098902,0.39844632,0.06098065,0.23637351],"study_design_scores_gemma":[0.00031209885,0.00003685054,0.029426008,0.000047083402,7.3082987e-7,0.00000693377,0.000013319524,0.92101663,0.00006799652,0.0026062736,0.046319954,0.00014610768],"about_ca_topic_score_codex":0.000010956954,"about_ca_topic_score_gemma":0.000082828,"teacher_disagreement_score":0.9059058,"about_ca_system_score_codex":0.000021271548,"about_ca_system_score_gemma":0.000050300012,"threshold_uncertainty_score":0.23046087},"labels":[],"label_agreement":null},{"id":"W1968887874","doi":"10.1109/aina.2014.143","title":"Design and Analysis of Symbol Detection Schemes with Imperfect CSI for SDF-Relay Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rayleigh fading; Relay; Computer science; Channel (broadcasting); Algorithm; Bit error rate; Fading; Minimum mean square error; Imperfect; Symbol (formal); Modulation (music); Telecommunications; Mathematics; Statistics","score_opus":0.020832741555938703,"score_gpt":0.25229315462934676,"score_spread":0.23146041307340806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968887874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02155528,0.00016549422,0.9777994,0.00009053072,0.000022114391,0.0001708154,8.88121e-8,0.000052631927,0.0001436527],"genre_scores_gemma":[0.9103947,0.00012270978,0.08929337,0.0000902006,0.000011150098,0.00002593682,0.0000012273383,0.0000038021233,0.000056870966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936575,0.0001310249,0.00013429856,0.00018815615,0.00006867297,0.000112071844],"domain_scores_gemma":[0.9989234,0.0004473614,0.00006808395,0.00038567116,0.00013619973,0.00003927694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051456597,0.00007901761,0.00017543661,0.00013447642,0.00013728728,0.000063321946,0.00025456495,0.000032345954,0.0000060707202],"category_scores_gemma":[0.000029905255,0.000057961322,0.000043072392,0.0007736814,0.000033663415,0.00015387441,0.00008842866,0.000053628217,3.4287595e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075384574,0.00006116403,0.0033485247,0.000013986792,0.00084279355,1.507241e-7,0.0006042239,0.15498383,0.0074553518,0.049468525,0.0001335881,0.78301245],"study_design_scores_gemma":[0.00021865022,0.0001868663,0.0016639624,0.000007900448,0.00009002753,7.6754606e-7,0.000006511677,0.9921991,0.0052246186,0.000023793682,0.0002937545,0.00008404276],"about_ca_topic_score_codex":0.0000028654536,"about_ca_topic_score_gemma":0.000047423488,"teacher_disagreement_score":0.8888395,"about_ca_system_score_codex":0.000010119258,"about_ca_system_score_gemma":0.000010726055,"threshold_uncertainty_score":0.2363594},"labels":[],"label_agreement":null},{"id":"W1969776874","doi":"10.1109/sahcnw.2009.5172926","title":"Decoupled optimization of interference aware routing and scheduling for throughput maximization in wireless relay mesh networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Scheduling (production processes); Time division multiple access; Wireless mesh network; Relay; Column generation; Wireless; Schedule; Wireless network; Distributed computing; Engineering; Mathematical optimization","score_opus":0.030633967198819285,"score_gpt":0.2832843870232371,"score_spread":0.2526504198244178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969776874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012806977,0.00013606338,0.98590463,0.0005888239,0.00005585357,0.00023246293,1.9204573e-7,0.000058987458,0.00021598546],"genre_scores_gemma":[0.81300265,0.0007613739,0.1860192,0.00016660534,0.000013454088,0.000007704268,0.000006612769,0.000003985532,0.000018443186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991622,0.00006494238,0.0003226582,0.00023285682,0.00006664555,0.00015071439],"domain_scores_gemma":[0.9992308,0.00015982904,0.00012666649,0.00027809365,0.00017373834,0.000030861316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036992668,0.000096205324,0.00016233281,0.00008248997,0.000107692314,0.00008583915,0.00035328214,0.000057999296,0.000005536948],"category_scores_gemma":[0.00006993202,0.000093131,0.00002337592,0.0004340552,0.000019849605,0.0004440348,0.00013836421,0.00009596518,1.5073586e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014332892,0.00003900848,0.0014489709,0.0000075943944,0.000004730385,2.4034222e-7,0.0006939884,0.7818202,0.00018170652,0.13360445,0.00001441063,0.082170375],"study_design_scores_gemma":[0.00039939318,0.000058883277,0.000876182,0.0001296134,0.0000022975441,0.0000012606064,0.000045697547,0.9978225,0.00032924072,0.00022866507,0.0000029559587,0.000103262384],"about_ca_topic_score_codex":0.000003433631,"about_ca_topic_score_gemma":0.000042040803,"teacher_disagreement_score":0.80019563,"about_ca_system_score_codex":0.000030989384,"about_ca_system_score_gemma":0.000027931019,"threshold_uncertainty_score":0.3797772},"labels":[],"label_agreement":null},{"id":"W1970050458","doi":"10.1109/glocom.2013.6831681","title":"Cooperative uplink cellular systems with multi-antenna relays and heterogeneous users","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Telecommunications link; MIMO; Computer science; Iterative method; Base station; Convergence (economics); Upper and lower bounds; Computer network; Channel (broadcasting); Antenna (radio); Channel state information; Mathematical optimization; Algorithm; Wireless; Telecommunications; Mathematics; Power (physics)","score_opus":0.031743304375562095,"score_gpt":0.23609676350700476,"score_spread":0.20435345913144265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970050458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052264925,0.0016272966,0.94348615,0.0007083815,0.00012534868,0.0006398012,3.6558058e-7,0.00018314098,0.0009645991],"genre_scores_gemma":[0.9769375,0.00030278284,0.020622544,0.00038894807,0.000015749243,0.0001028355,0.0000019716688,0.000010695966,0.0016170164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905276,0.00012428778,0.00018319018,0.00032034083,0.0001089219,0.00021046949],"domain_scores_gemma":[0.99886876,0.000077748555,0.000055047625,0.0006161209,0.00025464926,0.00012764156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001253046,0.00015384305,0.00016667608,0.000053078133,0.00025153364,0.0004324963,0.0005041446,0.00004238293,0.000038737304],"category_scores_gemma":[0.000011461086,0.00010663227,0.000019870185,0.0002353829,0.0000735962,0.00044382684,0.00023289247,0.00013354268,0.0001075219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009020803,0.0014807304,0.03382489,0.00025396838,0.001265292,0.00033764468,0.033536628,0.031711735,0.24449784,0.48733667,0.013610429,0.15205395],"study_design_scores_gemma":[0.00042804144,0.000113412854,0.00039845376,0.00003801731,0.000003826417,0.00003159386,0.00012189344,0.99611413,0.0012653709,0.000007104232,0.0012587976,0.00021938192],"about_ca_topic_score_codex":0.000053194097,"about_ca_topic_score_gemma":0.000040172403,"teacher_disagreement_score":0.9644024,"about_ca_system_score_codex":0.000024289215,"about_ca_system_score_gemma":0.000027380183,"threshold_uncertainty_score":0.4348338},"labels":[],"label_agreement":null},{"id":"W1970149668","doi":"10.1109/tvt.2012.2210060","title":"Asymptotic SEP Analysis of Two-Way Relaying Networks With Distributed Alamouti Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quadrature amplitude modulation; Diversity gain; Signal-to-noise ratio (imaging); Mathematics; Maximal-ratio combining; Coding gain; Algorithm; QAM; Topology (electrical circuits); Applied mathematics; Electronic engineering; Computer science; Statistics; Bit error rate; Combinatorics; Decoding methods; Engineering; Fading","score_opus":0.016566799755300725,"score_gpt":0.25655534420783865,"score_spread":0.23998854445253792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970149668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081527345,0.00048762694,0.9167335,0.0005638313,0.00011458944,0.00014059016,0.000006568859,0.00034085257,0.0000850926],"genre_scores_gemma":[0.98881495,0.00020992936,0.010791004,0.000082437764,0.000009371749,0.00004553897,0.000009077018,0.0000119513315,0.000025726926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986982,0.00014253822,0.00030613062,0.00029099267,0.00018540196,0.00037676623],"domain_scores_gemma":[0.9983429,0.00014022092,0.00014204123,0.0011278229,0.00016595365,0.000081092665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029214873,0.00018714118,0.00037516045,0.00075618015,0.00029096508,0.00003110447,0.0007572146,0.00016847446,0.000028075541],"category_scores_gemma":[0.000007058604,0.00016277752,0.00014695407,0.0046245214,0.00018738351,0.00024483993,0.000014724458,0.00046819745,0.000008400379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018843133,0.00045513245,0.004788778,0.000006690792,0.0016170937,0.000006068575,0.00027746568,0.91000247,0.0025720359,0.027326422,0.000025300084,0.052903697],"study_design_scores_gemma":[0.00063277583,0.0001727348,0.0027135583,0.000055856333,0.0006960326,0.000029347308,0.00007467255,0.975276,0.019432314,0.00007090907,0.0004951051,0.0003507269],"about_ca_topic_score_codex":0.00000717888,"about_ca_topic_score_gemma":0.000090301626,"teacher_disagreement_score":0.9072876,"about_ca_system_score_codex":0.00007864883,"about_ca_system_score_gemma":0.000024562865,"threshold_uncertainty_score":0.6637875},"labels":[],"label_agreement":null},{"id":"W1970170950","doi":"10.1109/tit.2011.2177578","title":"Gaussian Z-Interference Channel With a Relay Link: Achievability Region and Asymptotic Sum Capacity","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Interference (communication); Topology (electrical circuits); Relay; Channel capacity; Channel (broadcasting); Noise (video); Signal-to-noise ratio (imaging); Zero-forcing precoding; Additive white Gaussian noise; Co-channel interference; Telecommunications; Mathematics; Computer science; Physics; MIMO; Power (physics); Precoding; Combinatorics; Quantum mechanics","score_opus":0.029001916694381076,"score_gpt":0.23412684801960956,"score_spread":0.2051249313252285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970170950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014827738,0.00003189131,0.9808666,0.0008552436,0.00023661267,0.00015758071,0.000002297314,0.0001424506,0.0028796003],"genre_scores_gemma":[0.9970367,0.00011852145,0.0021868977,0.00052510446,0.00001952783,0.00004220007,0.0000015824013,0.000004445033,0.00006502555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911636,0.00021198287,0.00022534725,0.00011068598,0.00013431905,0.00020129047],"domain_scores_gemma":[0.9989896,0.00017650895,0.00010006269,0.00052129425,0.000091827504,0.000120746736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005850263,0.00012568917,0.00009927377,0.00013576457,0.0003844564,0.000120305296,0.00029362683,0.00008470978,0.000022480739],"category_scores_gemma":[0.000013172313,0.0001049684,0.00003510056,0.0002738499,0.00011498186,0.002678937,0.000007279495,0.00038196496,0.00005288552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029891092,0.00028787288,0.00017766427,0.000093448936,0.00009570522,5.5041846e-7,0.04082789,0.0059727174,0.00009672879,0.45339578,0.00014294457,0.49860978],"study_design_scores_gemma":[0.008723534,0.0036724373,0.037977174,0.0018226658,0.00028660602,0.0011419919,0.005489018,0.83215666,0.0632252,0.02188963,0.018854821,0.0047602486],"about_ca_topic_score_codex":0.000003126196,"about_ca_topic_score_gemma":0.000010197641,"teacher_disagreement_score":0.98220897,"about_ca_system_score_codex":0.000052967145,"about_ca_system_score_gemma":0.000029900755,"threshold_uncertainty_score":0.4280487},"labels":[],"label_agreement":null},{"id":"W1970385094","doi":"10.1049/iet-com.2009.0684","title":"Cooperative MIMO multiple-relay system with optimised beamforming and power allocation","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Medical Research Council","keywords":"Relay; Beamforming; MIMO; Computer science; Transmitter power output; Power (physics); Constraint (computer-aided design); Maximal-ratio combining; Mathematical optimization; Computer network; Telecommunications; Mathematics; Decoding methods; Fading","score_opus":0.024511360378735834,"score_gpt":0.2640844332275096,"score_spread":0.23957307284877374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970385094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06450934,0.0012532593,0.89356834,0.012534263,0.000296036,0.0011274837,0.000010082507,0.0008073059,0.025893917],"genre_scores_gemma":[0.8249917,0.0003053838,0.17419183,0.00021026802,0.000013351158,0.00012576283,0.000019977235,0.000013473983,0.00012822621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883145,0.00021585367,0.0002894494,0.00029094637,0.00016279642,0.00020952336],"domain_scores_gemma":[0.9956213,0.00050927803,0.00014139223,0.0031594513,0.00043720973,0.0001313572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042689475,0.00017928288,0.00017865149,0.00010661348,0.0010495991,0.00029100417,0.0021072107,0.00007836504,0.000010776616],"category_scores_gemma":[0.00009904075,0.0001546574,0.000031997253,0.00051009277,0.00026460437,0.0006606474,0.0009467826,0.00053067197,0.000025532123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021598471,0.0002758995,0.0018729726,0.000020731679,0.00010707418,0.0000021357444,0.009781884,0.001269112,0.023965292,0.9369722,0.0005846389,0.025126481],"study_design_scores_gemma":[0.0014963421,0.00016341802,0.005020297,0.00018789133,0.000025406956,0.00011054975,0.0011692627,0.9479683,0.0016700117,0.000049168626,0.041507732,0.00063162326],"about_ca_topic_score_codex":0.00002402292,"about_ca_topic_score_gemma":0.00076682144,"teacher_disagreement_score":0.9466992,"about_ca_system_score_codex":0.000045651585,"about_ca_system_score_gemma":0.00011022878,"threshold_uncertainty_score":0.80727744},"labels":[],"label_agreement":null},{"id":"W1970688426","doi":"10.1109/ahici.2011.6113956","title":"A superposition modulation based cooperative transmission scheme in regenerate-and-forward relaying networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Superposition principle; Transmission (telecommunications); Relay; Computer science; Modulation (music); Scheme (mathematics); Quadrature amplitude modulation; Topology (electrical circuits); Bit error rate; Electronic engineering; Constellation; Spectral efficiency; Power (physics); Algorithm; Telecommunications; Mathematics; Channel (broadcasting); Engineering; Physics; Electrical engineering","score_opus":0.048296175931697403,"score_gpt":0.2519664420839758,"score_spread":0.20367026615227837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970688426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039002754,0.0003651061,0.9569296,0.0004930059,0.000048175738,0.00020191197,1.4020469e-7,0.000109306195,0.0028499966],"genre_scores_gemma":[0.89417857,0.0003915657,0.10483053,0.0004584823,0.000013202752,0.000027015523,0.000007857391,0.0000069996554,0.000085781125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989394,0.00022357669,0.00024817215,0.00030199796,0.00010584457,0.00018101145],"domain_scores_gemma":[0.9993881,0.000055222175,0.00003934121,0.0003345925,0.00010351443,0.00007922391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037845512,0.00012791119,0.00013341027,0.0001278158,0.00018957442,0.000070154194,0.0002891804,0.00007668647,0.00007103668],"category_scores_gemma":[0.000012894614,0.00011288369,0.0000291743,0.000523241,0.000031118834,0.0006085315,0.00009442544,0.0001826824,0.0000049606447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001075373,0.00027594995,0.0066440217,0.000014192414,0.000022535083,0.000013978155,0.006865935,0.022142407,0.01999593,0.54350495,0.00023180556,0.4001808],"study_design_scores_gemma":[0.0004600421,0.000056420446,0.008526515,0.00005838176,0.000001649456,0.000002315532,0.00001932565,0.98723096,0.00315664,0.00020910183,0.00012407993,0.00015459183],"about_ca_topic_score_codex":0.000027160566,"about_ca_topic_score_gemma":0.000059475176,"teacher_disagreement_score":0.96508855,"about_ca_system_score_codex":0.000046112942,"about_ca_system_score_gemma":0.000037460697,"threshold_uncertainty_score":0.4603263},"labels":[],"label_agreement":null},{"id":"W1970945969","doi":"10.1007/s11277-014-1984-8","title":"Cooperative Subcarrier Allocation and Power Allocation in the Downlink of an Amplify-and-Forward OFDM Relaying System","year":2014,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Subcarrier; Computer science; Relay; Orthogonal frequency-division multiplexing; Telecommunications link; Wireless; Throughput; Power (physics); Computer network; Resource allocation; Telecommunications; Channel (broadcasting)","score_opus":0.032921163244135014,"score_gpt":0.2842030654324409,"score_spread":0.2512819021883059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970945969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8531463,0.002503177,0.12025912,0.015746666,0.00008200559,0.00089193234,0.000012587468,0.00016254694,0.0071956683],"genre_scores_gemma":[0.99311,0.00077885535,0.005517619,0.00041089766,0.000012842756,0.00009846143,0.00004462239,0.000009816369,0.000016892085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763817,0.0012940317,0.00039056758,0.000280294,0.00023100508,0.00016593319],"domain_scores_gemma":[0.99713707,0.00068968826,0.00017696095,0.0016432102,0.0002820107,0.000071032046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016168996,0.00015373954,0.00021799249,0.00013009564,0.0006177149,0.00016902742,0.0016190606,0.00008317713,0.0000026020502],"category_scores_gemma":[0.00008706895,0.00012719292,0.000030661522,0.0005289375,0.00028931434,0.0005547413,0.00050863595,0.00037619224,0.0000033667825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009119423,0.00010433331,0.0010315018,0.00002419582,0.000018896113,2.2913143e-7,0.024107052,0.00005403792,0.0020824014,0.93983585,0.000025265197,0.03270714],"study_design_scores_gemma":[0.000704488,0.0001781281,0.030513154,0.00020479065,0.000022023572,0.00003863865,0.008114579,0.95583695,0.00020501103,0.00041659042,0.003434709,0.00033090616],"about_ca_topic_score_codex":0.000062144,"about_ca_topic_score_gemma":0.00042046214,"teacher_disagreement_score":0.95578295,"about_ca_system_score_codex":0.000059897302,"about_ca_system_score_gemma":0.000068598085,"threshold_uncertainty_score":0.51867765},"labels":[],"label_agreement":null},{"id":"W1970974668","doi":"10.1049/iet-com.2010.1033","title":"Average capacity performance of opportunistic relay selection with outdated CSI","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Relay channel; Computer science; Selection (genetic algorithm); Channel state information; Link Access Procedure for Frame Relay; Computer network; Channel (broadcasting); Terminal (telecommunication); Outage probability; Telecommunications; Wireless; Artificial intelligence; Fading; Power (physics)","score_opus":0.13928746142838194,"score_gpt":0.26747042400036436,"score_spread":0.12818296257198242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970974668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2911235,0.00041613088,0.6100188,0.0017188303,0.00015688085,0.000646411,0.00001346241,0.0006124874,0.0952935],"genre_scores_gemma":[0.91057724,0.0010776432,0.08795154,0.000100167636,0.000005845328,0.000034123666,0.000015460859,0.000008115944,0.00022987166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902034,0.00024301546,0.0002810406,0.00016740577,0.00013613902,0.00015208877],"domain_scores_gemma":[0.99676895,0.00010669663,0.00018832221,0.0024911189,0.00037512163,0.00006977077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003339183,0.00011211933,0.0001456756,0.00010002828,0.0004230937,0.00003287451,0.0022420727,0.000043873846,0.000051813422],"category_scores_gemma":[0.000035329675,0.000101461745,0.00003288504,0.0007054533,0.00019997622,0.0004413648,0.0005533842,0.0002770569,0.000023790182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007166862,0.001335718,0.040690567,0.00005654829,0.00020955405,0.000001788329,0.019231774,0.00076855504,0.0072665517,0.8662114,0.0013154534,0.06284038],"study_design_scores_gemma":[0.0008953155,0.0006865259,0.08085858,0.0002362597,0.000042932817,0.000065873865,0.00010665778,0.885497,0.006082155,0.0005026558,0.024372587,0.00065348094],"about_ca_topic_score_codex":0.000038374958,"about_ca_topic_score_gemma":0.00017651459,"teacher_disagreement_score":0.88472843,"about_ca_system_score_codex":0.000042156156,"about_ca_system_score_gemma":0.000100577265,"threshold_uncertainty_score":0.41663665},"labels":[],"label_agreement":null},{"id":"W1971055022","doi":"10.1109/glocomw.2012.6477613","title":"On the exact capacity of dual-hop af relaying with adaptive channel inversion","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Inversion (geology); Computer science; Bessel function; Channel capacity; Fading; Nakagami distribution; Channel (broadcasting); Cutoff; Topology (electrical circuits); Algorithm; Electronic engineering; Telecommunications; Mathematics; Physics; Engineering; Mathematical analysis","score_opus":0.08683379257843346,"score_gpt":0.2526619200619004,"score_spread":0.16582812748346695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971055022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49044687,0.00019723793,0.44319046,0.003827795,0.0001910654,0.00029382875,7.324583e-7,0.00011680408,0.061735213],"genre_scores_gemma":[0.99549353,0.00005197209,0.0035047564,0.00070443127,0.000020044441,0.000006042015,2.8047492e-7,0.0000034802226,0.00021544695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993216,0.0001688533,0.000093215065,0.000106549276,0.00016029605,0.00014948081],"domain_scores_gemma":[0.9989552,0.00032363043,0.00006764032,0.00052162475,0.00008155134,0.000050380855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043235393,0.000076811026,0.000080633305,0.000039544677,0.00019823262,0.0000213842,0.00039096354,0.000022313832,0.000045938916],"category_scores_gemma":[0.00003563725,0.000042240285,0.000024726063,0.0002968696,0.000057284196,0.0003231712,0.00024685398,0.0001421884,0.000028029343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023252573,0.00010326076,0.0004190355,0.0000027359577,0.000024308536,3.9891137e-7,0.007625931,0.00021951969,0.0011858033,0.9822412,0.0032754429,0.00487911],"study_design_scores_gemma":[0.0022622545,0.001807502,0.021270167,0.0007289277,0.000041588297,0.00003951111,0.004900323,0.8298352,0.12198345,0.0061063753,0.009597437,0.0014273097],"about_ca_topic_score_codex":0.0000128284455,"about_ca_topic_score_gemma":0.000015065047,"teacher_disagreement_score":0.97613484,"about_ca_system_score_codex":0.000028565672,"about_ca_system_score_gemma":0.000015887348,"threshold_uncertainty_score":0.17225088},"labels":[],"label_agreement":null},{"id":"W1971075767","doi":"10.1016/j.adhoc.2012.04.003","title":"Cross-layer optimization with cooperative communication for minimum power cost in packet error rate constrained wireless sensor networks","year":2012,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cross-layer optimization; Time division multiple access; Network packet; Computer science; Relay; Computer network; Optimization problem; Wireless sensor network; Physical layer; Hop (telecommunications); Power optimization; Wireless; Power control; Node (physics); Power (physics); Mathematical optimization; Wireless network; Algorithm; Engineering; Mathematics; Telecommunications","score_opus":0.03649772048595648,"score_gpt":0.304769086160071,"score_spread":0.26827136567411447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971075767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018621977,0.0034152833,0.9741558,0.0009988418,0.000375441,0.0014564313,0.000007121813,0.00016699397,0.0008021234],"genre_scores_gemma":[0.95891553,0.002374216,0.03654801,0.0011460755,0.00011606751,0.00037376376,0.00016656506,0.000044584114,0.000315174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973368,0.0006898694,0.00056225574,0.00045741844,0.00017073932,0.00078289636],"domain_scores_gemma":[0.996737,0.00093765237,0.000302422,0.0012348572,0.0005731191,0.00021492614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013394874,0.00036234575,0.00041328187,0.000115854215,0.00057069084,0.00040162378,0.001010653,0.00022027541,0.000072021365],"category_scores_gemma":[0.00007025266,0.00032550568,0.00007573323,0.0009710368,0.00028715096,0.0012131036,0.00035682885,0.00051023497,0.000007778833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025447796,0.00022518514,0.004701489,0.000006763477,0.000062819796,0.0000024119468,0.0018352238,0.96159756,0.00003853114,0.010974469,0.00100907,0.019291995],"study_design_scores_gemma":[0.0019963593,0.00014320014,0.0034502642,0.00013501718,0.000013299683,0.000011545243,0.00016053772,0.9897468,0.00004503935,0.0000114525765,0.003830736,0.00045573505],"about_ca_topic_score_codex":0.0000024168744,"about_ca_topic_score_gemma":0.00017166417,"teacher_disagreement_score":0.94029355,"about_ca_system_score_codex":0.00014213563,"about_ca_system_score_gemma":0.00009580082,"threshold_uncertainty_score":0.9999197},"labels":[],"label_agreement":null},{"id":"W1971376530","doi":"10.1109/ccece.2013.6567768","title":"Resource allocation schemes for cooperative relay-based cognitive radio with imperfect channel state information","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cognitive radio; Channel state information; Computer science; Additive white Gaussian noise; Relay; Resource allocation; Channel (broadcasting); Computer network; Transmitter power output; Imperfect; Transmitter; Telecommunications; Wireless; Power (physics)","score_opus":0.019064976751923982,"score_gpt":0.245412390809259,"score_spread":0.22634741405733502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971376530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013479927,0.00010339801,0.9803761,0.0030031865,0.000029091283,0.0011963256,0.00000380679,0.00020016171,0.0016079621],"genre_scores_gemma":[0.9709052,0.00006758079,0.02553838,0.0023758546,0.000019428257,0.00061488204,0.000095679476,0.000009692307,0.00037330363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990342,0.00012138985,0.00024320027,0.0002078111,0.00016632349,0.00022706915],"domain_scores_gemma":[0.99812496,0.0003510517,0.00012422974,0.0003632151,0.0009512092,0.00008531246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029422282,0.00015982546,0.00014228204,0.00012404805,0.0003485375,0.0003765691,0.00041172034,0.000038602124,0.000036033187],"category_scores_gemma":[0.00011178279,0.00012162972,0.00003547244,0.0004503205,0.0000624397,0.0019388903,0.000094069226,0.000121139514,0.000094403396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034050195,0.0002789757,0.00032034464,0.000091062924,0.00023733213,9.698877e-7,0.016535481,0.017204912,0.0019796044,0.08376695,0.02188211,0.85736173],"study_design_scores_gemma":[0.0017996993,0.00047302543,0.00056326744,0.00009086237,0.000008175507,0.000002939256,0.00037133356,0.96400094,0.015427319,0.00009550839,0.016848993,0.00031795973],"about_ca_topic_score_codex":0.000012402324,"about_ca_topic_score_gemma":0.000022658369,"teacher_disagreement_score":0.9574253,"about_ca_system_score_codex":0.000056700417,"about_ca_system_score_gemma":0.0001408526,"threshold_uncertainty_score":0.4959916},"labels":[],"label_agreement":null},{"id":"W1971567402","doi":"10.1109/vetecf.2010.5594259","title":"Cutoff Rate Analysis of Amplify-and-Forward Relay System","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Pairwise error probability; Expression (computer science); Rayleigh fading; Upper and lower bounds; Cutoff; Chernoff bound; Relay channel; Bit error rate; Mathematics; Computer science; Control theory (sociology); Algorithm; Statistics; Fading; Mathematical analysis; Power (physics); Physics; Decoding methods; Artificial intelligence","score_opus":0.019182964669898436,"score_gpt":0.26670953408404935,"score_spread":0.2475265694141509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971567402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19954975,0.00017030221,0.773434,0.0013517523,0.00027796076,0.00012825224,0.000001940878,0.00024023099,0.024845805],"genre_scores_gemma":[0.97945106,0.00007756756,0.01976126,0.00012291396,0.000010142579,0.0000044290405,0.0000020080076,0.0000024330586,0.00056820933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993562,0.00009132463,0.00019849333,0.00017131565,0.00008604483,0.000096602555],"domain_scores_gemma":[0.998846,0.00015674064,0.00007480827,0.0007518335,0.000111571615,0.000059038488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050886226,0.00006566131,0.00018412177,0.0001761,0.00009507493,0.00006741527,0.000564803,0.000038064198,0.00004774109],"category_scores_gemma":[0.00003018838,0.000051988874,0.000058717564,0.00096194627,0.00003751947,0.00014657818,0.00031033272,0.0001357188,0.000013640231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017412689,0.000016623024,0.0032933117,0.0000073159285,0.00019534332,7.3165467e-7,0.00040823297,0.00013933677,0.008545009,0.96905714,0.00044592045,0.017889312],"study_design_scores_gemma":[0.00016794732,0.00002167474,0.02345877,0.000011377738,0.00011017669,0.0000033913323,0.000058216498,0.9616002,0.00194236,0.00006147274,0.012410207,0.00015419464],"about_ca_topic_score_codex":0.000017297754,"about_ca_topic_score_gemma":0.00020532851,"teacher_disagreement_score":0.96899563,"about_ca_system_score_codex":0.000007875907,"about_ca_system_score_gemma":0.000018677809,"threshold_uncertainty_score":0.21200448},"labels":[],"label_agreement":null},{"id":"W1971673588","doi":"10.1109/acssc.2013.6810263","title":"SNR-based channel pairing design in multichannel TDBC-based two-way relaying","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Pairing; Computer science; Relay; Sorting; Channel (broadcasting); Maximization; Optimization problem; Theoretical computer science; Mathematical optimization; Power (physics); Algorithm; Computer network; Mathematics; Physics","score_opus":0.07640711048191168,"score_gpt":0.2786701284079095,"score_spread":0.20226301792599782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971673588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074160877,0.00018596603,0.9858705,0.0037688604,0.00015512735,0.0004979057,1.4808012e-7,0.0003261658,0.0017792594],"genre_scores_gemma":[0.86164457,0.000017312617,0.13574575,0.0022129747,0.000027414493,0.00015377959,0.0000018314518,0.000014346281,0.00018200674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817514,0.00042370253,0.000348084,0.00041296493,0.00021054136,0.000429561],"domain_scores_gemma":[0.99808496,0.00064361346,0.000082236744,0.0008903602,0.0001681661,0.00013064794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008273551,0.00020121524,0.00020034531,0.00026578945,0.00023726701,0.0002470252,0.0011214007,0.000059624646,0.00013792008],"category_scores_gemma":[0.00013192404,0.00018390019,0.000064000764,0.0007633678,0.00003966366,0.0005445458,0.00026789948,0.00026215214,0.00025650312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029364699,0.00064823497,0.0028293727,0.000045692865,0.000028511911,0.000029894183,0.0028952481,0.78687096,0.016356122,0.020674752,0.00440952,0.16518235],"study_design_scores_gemma":[0.001026618,0.000043973032,0.0013642319,0.00008688625,0.0000014130928,7.924956e-7,0.00004026445,0.9899754,0.006695937,0.00035323732,0.00015606858,0.00025519298],"about_ca_topic_score_codex":0.0001015197,"about_ca_topic_score_gemma":0.000095858224,"teacher_disagreement_score":0.8542285,"about_ca_system_score_codex":0.000102989594,"about_ca_system_score_gemma":0.00009355474,"threshold_uncertainty_score":0.7499232},"labels":[],"label_agreement":null},{"id":"W1971986732","doi":"10.1109/cjece.2013.6601082","title":"Downlink beamforming through relays: imperfect CSI and coordinated transmission","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Beamforming; Precoding; Base station; Relay; Computer science; Telecommunications link; Computer network; Transmission (telecommunications); MIMO; Transmitter power output; Context (archaeology); Electronic engineering; Telecommunications; Power (physics); Engineering; Channel (broadcasting); Transmitter; Geography","score_opus":0.00863070880864629,"score_gpt":0.19006027785281282,"score_spread":0.18142956904416652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971986732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060672015,0.005887303,0.93199164,0.0011483729,0.000119143435,0.000091584894,1.3932969e-7,0.00002193576,0.00006786076],"genre_scores_gemma":[0.95406383,0.00072948966,0.04483108,0.00025916068,0.000091153684,0.0000026177775,3.7021405e-7,0.000007156439,0.000015130516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929494,0.000030084342,0.00023534796,0.00012073533,0.000066572,0.00025232622],"domain_scores_gemma":[0.999204,0.00011868618,0.00005083122,0.00011437111,0.000113072325,0.0003990741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012915426,0.00011343421,0.00017447957,0.0001648015,0.00014520064,0.00021981866,0.00030847552,0.00005024819,0.000008514104],"category_scores_gemma":[0.000021116102,0.00009463558,0.000038483387,0.00035093477,0.00001881568,0.0005267311,0.000039368908,0.00030971694,0.0000012953548],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022571573,0.000011793027,0.00053607754,0.00001886208,0.000050132418,0.000043661108,0.001238551,0.002543477,0.002052648,0.017149152,0.0012247332,0.97512865],"study_design_scores_gemma":[0.00033633396,0.00022773676,0.0035500769,0.00010825994,0.0000068545587,0.00044089934,0.0000031217505,0.97198844,0.00032133912,0.00035927034,0.022468869,0.00018881421],"about_ca_topic_score_codex":0.00010222272,"about_ca_topic_score_gemma":0.000020722504,"teacher_disagreement_score":0.9749398,"about_ca_system_score_codex":0.000046971472,"about_ca_system_score_gemma":0.0001055147,"threshold_uncertainty_score":0.38591272},"labels":[],"label_agreement":null},{"id":"W1972011722","doi":"10.1109/lsp.2010.2092427","title":"Performance Analysis of Relay Selection With Feedback Delay and Channel Estimation Errors","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Channel state information; Computer science; Relay channel; Selection (genetic algorithm); Channel (broadcasting); Bit error rate; Cooperative diversity; Control theory (sociology); Telecommunications; Fading; Wireless; Artificial intelligence; Power (physics)","score_opus":0.016057965101815973,"score_gpt":0.24338001800869338,"score_spread":0.2273220529068774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972011722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57093495,0.000021058886,0.4283428,0.0005604248,0.000024644485,0.000039323968,1.5630586e-7,0.000036561254,0.000040067927],"genre_scores_gemma":[0.9730106,0.000013217331,0.026559701,0.00036604184,0.00002110146,0.000007583955,0.0000022369964,0.000006025673,0.0000134766415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992619,0.00003893203,0.00017146705,0.00021997129,0.00017286211,0.0001348739],"domain_scores_gemma":[0.9994421,0.000040349878,0.00016042864,0.00017819236,0.00013534559,0.000043612134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025601193,0.00010320752,0.00014655113,0.0002551787,0.000247856,0.00010075694,0.00027121048,0.000035528996,0.000004900237],"category_scores_gemma":[0.0000060934462,0.00008730172,0.000025574485,0.0013421455,0.00009449319,0.0006161488,0.000035341236,0.00021367529,0.000001230389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000386018,0.00005851359,0.010387817,0.0000705486,0.00019486947,0.0000016704081,0.003565324,0.45503724,0.27087006,0.00014493975,0.00014882053,0.25948158],"study_design_scores_gemma":[0.00012988043,0.00004256391,0.013630071,0.000040435465,0.00006500636,0.000009103604,0.000006884637,0.9791645,0.0067676455,0.0000036088356,0.000024697552,0.000115625415],"about_ca_topic_score_codex":0.00000533412,"about_ca_topic_score_gemma":0.000043371503,"teacher_disagreement_score":0.52412724,"about_ca_system_score_codex":0.00001540474,"about_ca_system_score_gemma":0.000037363174,"threshold_uncertainty_score":0.3560061},"labels":[],"label_agreement":null},{"id":"W1972427238","doi":"10.1109/icnsc.2013.6548792","title":"Cocasting and power control for energy efficient information dissemination in WSNs","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Linear network coding; Computer network; Computer science; Unicast; Wireless sensor network; Network packet; Efficient energy use; Relay; Node (physics); Routing protocol; Power control; Exploit; Transmission (telecommunications); Power (physics); Telecommunications; Engineering","score_opus":0.01039825293741533,"score_gpt":0.24649306149505779,"score_spread":0.23609480855764245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972427238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017878065,0.00005970453,0.97728926,0.0014167969,0.00004418238,0.00017847384,3.0859172e-7,0.00003509819,0.0030980974],"genre_scores_gemma":[0.9930064,0.000018225612,0.0063842786,0.00045946686,0.0000043934006,0.000046199504,0.0000026372497,0.0000012976374,0.0000770856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996135,0.000026353144,0.00014446146,0.000068844514,0.000054483735,0.000092341244],"domain_scores_gemma":[0.9994635,0.00021878458,0.00003986975,0.00013104749,0.00012011668,0.000026666032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017351647,0.000045096807,0.000054280565,0.000074390504,0.00007507902,0.00015230657,0.00014662418,0.000017886163,0.000015488631],"category_scores_gemma":[0.00007964758,0.0000385459,0.000010113454,0.0001389681,0.000010215207,0.00052958255,0.00006975165,0.000026852184,0.000005067415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034292864,0.000033320935,0.00042309635,0.000005505251,0.0000036437036,6.39277e-8,0.002447373,0.0018058616,0.0010191861,0.4647063,0.0014527573,0.5280995],"study_design_scores_gemma":[0.00029510885,0.000020995813,0.006512273,0.0000140355705,4.1662773e-7,7.7717107e-7,0.00007142417,0.9908731,0.0001776325,0.00022282002,0.0017555485,0.000055860266],"about_ca_topic_score_codex":0.000009848716,"about_ca_topic_score_gemma":0.000013491554,"teacher_disagreement_score":0.98906726,"about_ca_system_score_codex":0.000019267709,"about_ca_system_score_gemma":0.000008536261,"threshold_uncertainty_score":0.15718561},"labels":[],"label_agreement":null},{"id":"W1972482665","doi":"10.1109/glocom.2012.6504024","title":"Reducing end-to-end distortion in noisy wireless relay networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Relay; Fading; End-to-end principle; Decoding methods; Computer network; Single antenna interference cancellation; Scalability; Wireless; Relay channel; Node (physics); Linear network coding; Distortion (music); Channel (broadcasting); Electronic engineering; Telecommunications; Bandwidth (computing); Engineering","score_opus":0.03228627759811527,"score_gpt":0.2769007531596317,"score_spread":0.24461447556151644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972482665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10998445,0.0006194353,0.8767785,0.001510157,0.00060252,0.00015134619,1.3439315e-7,0.00014084631,0.010212628],"genre_scores_gemma":[0.9891903,0.00020590801,0.009065776,0.0006117133,0.00014020664,0.000022358496,0.0000029154533,0.0000073507263,0.00075348676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989163,0.00015497179,0.00023880212,0.00021494081,0.00013702543,0.00033793083],"domain_scores_gemma":[0.9990125,0.00010545247,0.00004868338,0.0006449479,0.000044307955,0.00014413471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586431,0.00010320887,0.00012052214,0.00010974155,0.0001417854,0.00007973409,0.00061112974,0.000047449823,0.00009316222],"category_scores_gemma":[0.00002957402,0.000096030504,0.000031473755,0.0007055381,0.000019333662,0.0006038301,0.0004233126,0.00020297132,0.00006672111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007464405,0.00015846372,0.015243504,0.000003662351,0.000008250541,0.0000019814527,0.004315415,0.008033503,0.0012256242,0.14426844,0.0032776135,0.8234561],"study_design_scores_gemma":[0.0004907175,0.000069195834,0.1402537,0.00013938254,0.000005007006,0.000014524003,0.00009925326,0.8236116,0.0014828935,0.00007583244,0.033131205,0.0006266679],"about_ca_topic_score_codex":0.0000339737,"about_ca_topic_score_gemma":0.00016945164,"teacher_disagreement_score":0.8792058,"about_ca_system_score_codex":0.00012922802,"about_ca_system_score_gemma":0.000021739777,"threshold_uncertainty_score":0.39160103},"labels":[],"label_agreement":null},{"id":"W1973118205","doi":"10.1109/glocom.2014.7037461","title":"Achievable rates for uplink communications in LTE-advanced networks with decode-and-forward relays","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Telecommunications link; Computer science; Orthogonal frequency-division multiple access; Frequency-division multiple access; Equalization (audio); Transmission (telecommunications); Relay; Orthogonal frequency-division multiplexing; Bit error rate; Minimum mean square error; Electronic engineering; Computer network; Telecommunications; Channel (broadcasting); Mathematics; Engineering; Estimator; Physics","score_opus":0.03164853832956284,"score_gpt":0.3141542933800477,"score_spread":0.28250575505048486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973118205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016930653,0.0007923859,0.98511714,0.004612391,0.000040487044,0.00043080573,2.6823375e-7,0.00011367473,0.00719981],"genre_scores_gemma":[0.6496895,0.0014620702,0.34722298,0.00081566354,0.000013323591,0.00019895862,0.0000068451354,0.000010289654,0.0005803832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990677,0.00013069565,0.00023227869,0.00026597016,0.00006360849,0.00023969547],"domain_scores_gemma":[0.99756765,0.00075876625,0.00007309466,0.0014088274,0.000118806,0.00007284058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006139062,0.00012493858,0.00018047847,0.0000774721,0.000338382,0.00014127442,0.0012333246,0.000047689045,0.0000081147045],"category_scores_gemma":[0.0000657398,0.00010122039,0.000026786072,0.00041037885,0.00007842547,0.00038676057,0.0005849172,0.00019405087,0.000006565947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032332013,0.00008407839,0.0034134653,0.000008041045,0.000016952874,1.7560846e-7,0.0004337978,0.014347956,0.00011475135,0.7191556,0.00074065855,0.2616522],"study_design_scores_gemma":[0.0007377933,0.00010825068,0.0014263714,0.000039827108,0.000003348297,0.0000022553063,0.000021736645,0.9660362,0.00008677276,0.0011299815,0.030243967,0.00016348135],"about_ca_topic_score_codex":0.0000059117106,"about_ca_topic_score_gemma":0.0006380788,"teacher_disagreement_score":0.95168823,"about_ca_system_score_codex":0.000027779854,"about_ca_system_score_gemma":0.000028179778,"threshold_uncertainty_score":0.41276476},"labels":[],"label_agreement":null},{"id":"W1973138156","doi":"10.1109/wcnc.2010.5506211","title":"A Novel Architecture for Multi-Hop WiMAX Systems: Shared Relay Segmentation","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"WiMAX; Computer network; Computer science; Radio resource management; Relay; Access network discovery and selection function; Cellular network; Telecommunications link; Network architecture; Radio access network; Base station; Telecommunications; Wireless network; Wireless; Mobile station","score_opus":0.06682112237477092,"score_gpt":0.3165820802194132,"score_spread":0.24976095784464228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973138156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018400416,0.00008879147,0.9948535,0.0013154926,0.00048636852,0.00048240088,0.0000052503087,0.0001853147,0.00074281706],"genre_scores_gemma":[0.2080123,0.000018245371,0.7893792,0.0005348792,0.000077018354,0.00016647449,0.000017842169,0.000009650524,0.0017843898],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992954,0.000033001492,0.00017582749,0.00023728357,0.0001036669,0.00015481029],"domain_scores_gemma":[0.9990144,0.00012909462,0.00006533782,0.0005627287,0.00016613024,0.000062324674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002551528,0.00009762406,0.00009776961,0.0000647777,0.00020973058,0.00023909149,0.00068849936,0.000050046918,0.00002381483],"category_scores_gemma":[0.0000750551,0.000080711165,0.000044445573,0.00020305446,0.00002023767,0.00025128174,0.0001832102,0.00017487755,0.00001861918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152554185,0.00022810331,0.00021029169,0.00004224825,0.00004144576,7.290425e-7,0.0038562613,0.0021304935,0.6107777,0.24748814,0.006759982,0.12844938],"study_design_scores_gemma":[0.001000932,0.000040208328,0.00060996466,0.000023404651,0.000003888171,0.000015617701,0.000059956234,0.95763844,0.002757689,0.00004882579,0.037608027,0.00019302084],"about_ca_topic_score_codex":0.000009796633,"about_ca_topic_score_gemma":0.00025243955,"teacher_disagreement_score":0.955508,"about_ca_system_score_codex":0.000018543686,"about_ca_system_score_gemma":0.000036992482,"threshold_uncertainty_score":0.3291306},"labels":[],"label_agreement":null},{"id":"W1973327896","doi":"10.1109/bsc.2010.5472980","title":"Energy-aware power allocation for lifetime maximization in single-source relay cooperation","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"","keywords":"Relay; Maximization; Computer science; Power (physics); Mathematical optimization; Residual; Energy (signal processing); Channel (broadcasting); Transmission (telecommunications); Optimization problem; Computer network; Telecommunications; Mathematics; Algorithm; Statistics","score_opus":0.019268481582639895,"score_gpt":0.24546168200028387,"score_spread":0.22619320041764399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973327896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005796851,0.000041193325,0.9877828,0.003186043,0.00026654935,0.0001998142,4.4561648e-7,0.0001546877,0.002571655],"genre_scores_gemma":[0.9436178,0.000040492003,0.053250004,0.0010358128,0.00004708531,0.00006473869,0.000037714577,0.000011482896,0.001894829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911106,0.00007841483,0.0002598036,0.00027623735,0.00011165941,0.00016283512],"domain_scores_gemma":[0.9989131,0.00013267601,0.000070285096,0.0005427172,0.00028788968,0.000053307696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032946127,0.000108230866,0.00010086831,0.00013088615,0.00016416112,0.00018733575,0.0005038069,0.000088920584,0.000078749246],"category_scores_gemma":[0.0000790981,0.00010498478,0.000031182368,0.00047062224,0.00002252622,0.0005512431,0.00013237269,0.00012728068,0.000014722045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022738042,0.00033139152,0.0005399349,0.000006499956,0.000010940977,5.890788e-7,0.0014821744,0.0048924927,0.07151402,0.50665855,0.004692375,0.4098483],"study_design_scores_gemma":[0.00044269042,0.00006733483,0.00035795817,0.000013353547,0.0000016722906,0.0000030886865,0.00001453334,0.9148122,0.008974065,0.00026418554,0.074864395,0.00018449327],"about_ca_topic_score_codex":0.000009123574,"about_ca_topic_score_gemma":0.000600752,"teacher_disagreement_score":0.937821,"about_ca_system_score_codex":0.000041073396,"about_ca_system_score_gemma":0.000053896867,"threshold_uncertainty_score":0.4281155},"labels":[],"label_agreement":null},{"id":"W1973566264","doi":"10.1109/icc.2012.6364087","title":"Binary Artificial Bee Colony for cooperative relay communication in cognitive radio systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Cognitive radio; Mathematical optimization; Integer programming; Binary number; Interference (communication); Computational complexity theory; Artificial bee colony algorithm; Optimization problem; Integer (computer science); Power (physics); Algorithm; Computer network; Artificial intelligence; Wireless; Mathematics; Telecommunications; Arithmetic","score_opus":0.08838067725746282,"score_gpt":0.3299018341726997,"score_spread":0.24152115691523687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973566264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09724876,0.009924328,0.8709773,0.0045225546,0.0007159846,0.0026350997,0.000012699037,0.00032607387,0.013637193],"genre_scores_gemma":[0.99133563,0.00043490579,0.006728196,0.00035809187,0.0000700608,0.00036138666,0.000026081467,0.0000097952225,0.00067585474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985184,0.00049352966,0.0003475313,0.00020723767,0.000120714,0.00031255648],"domain_scores_gemma":[0.99813217,0.0009278616,0.00009942312,0.00046480313,0.00028584045,0.000089903646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010750149,0.00013436719,0.00020365734,0.00012654204,0.00034257796,0.00014891173,0.00071239006,0.00007438507,0.000022815262],"category_scores_gemma":[0.00017795629,0.00012511695,0.00004209315,0.0005393877,0.000074752956,0.0008354924,0.00033308723,0.00019469012,0.000044622782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007408448,0.0005511733,0.0019081247,0.000016338114,0.000044856577,0.0000011071925,0.009986408,0.0009802356,0.0029717777,0.9554457,0.009667523,0.018352684],"study_design_scores_gemma":[0.0023199688,0.00048550058,0.009238899,0.0004196111,0.000027533868,0.000023475573,0.0030159946,0.94027627,0.004372463,0.0004973021,0.03836186,0.00096112624],"about_ca_topic_score_codex":0.000020456564,"about_ca_topic_score_gemma":0.00011187368,"teacher_disagreement_score":0.95494837,"about_ca_system_score_codex":0.00010781133,"about_ca_system_score_gemma":0.000068466885,"threshold_uncertainty_score":0.51021206},"labels":[],"label_agreement":null},{"id":"W1973692534","doi":"10.1016/j.phycom.2013.03.005","title":"New results on performance analysis of opportunistic regenerative relaying","year":2013,"lang":"en","type":"article","venue":"Physical Communication","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Phase-shift keying; Relay; Rayleigh fading; Bit error rate; Transmission (telecommunications); Outage probability; Modulation (music); Telecommunications; Computer network; Fading; Algorithm; Electronic engineering; Channel (broadcasting)","score_opus":0.06563368263755058,"score_gpt":0.3019016298200251,"score_spread":0.2362679471824745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973692534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58856744,0.00043606135,0.32041958,0.012013406,0.00010601423,0.0007874214,0.000010289101,0.00035191045,0.07730789],"genre_scores_gemma":[0.98569906,0.00041623274,0.0131958835,0.00017946884,0.00002017579,0.000025175215,0.000058015114,0.000005446356,0.00040052598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998823,0.00029337037,0.00031666097,0.00022050388,0.00021419558,0.00013230855],"domain_scores_gemma":[0.9967453,0.0005026416,0.00023829726,0.0021819652,0.00024411992,0.000087664346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024492122,0.00011529031,0.00024382588,0.00017371094,0.0002262605,0.000080311416,0.0014484313,0.000028444427,0.00001790426],"category_scores_gemma":[0.00010695876,0.00010291839,0.00009915066,0.0014092326,0.000053303305,0.00047009005,0.00044637345,0.00021317707,0.00006131905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022714243,0.00026252161,0.0002396046,0.0000059804424,0.00028338016,1.378831e-7,0.0045921532,0.0053857593,0.006587718,0.5947058,0.0030380145,0.38487622],"study_design_scores_gemma":[0.00024852453,0.000118345386,0.020711495,0.00004391066,0.00006383068,1.8459296e-7,0.000028452112,0.97375214,0.0027605337,0.0013049963,0.0008126403,0.00015492865],"about_ca_topic_score_codex":0.000046998335,"about_ca_topic_score_gemma":0.000013808562,"teacher_disagreement_score":0.9683664,"about_ca_system_score_codex":0.000047454563,"about_ca_system_score_gemma":0.00005053605,"threshold_uncertainty_score":0.41968903},"labels":[],"label_agreement":null},{"id":"W1973843421","doi":"10.1016/j.tcs.2004.04.017","title":"Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Upper and lower bounds; Computer science; Constant (computer programming); Network topology; Time complexity; Randomized algorithm; Matching (statistics); Node (physics); Algorithm; Mathematics; Discrete mathematics; Combinatorics; Theoretical computer science; Topology (electrical circuits); Computer network","score_opus":0.028965389273668086,"score_gpt":0.26659885829739577,"score_spread":0.23763346902372767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973843421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096060865,0.00011004462,0.90099335,0.0015137095,0.00012065603,0.0002071878,0.000001020163,0.00011475574,0.00087842136],"genre_scores_gemma":[0.87761897,0.00005272203,0.1219379,0.00029751437,0.00006903076,0.000005068144,9.436102e-7,0.000006238537,0.000011586561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979783,0.00033173646,0.0003859287,0.000519643,0.00043590696,0.0003484824],"domain_scores_gemma":[0.99813473,0.00046078247,0.00013977029,0.0007480534,0.00032356285,0.00019311484],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017511193,0.00017870282,0.00035178542,0.00017717644,0.00046733694,0.00024408095,0.0018493645,0.000043997985,0.00004193472],"category_scores_gemma":[0.0001220455,0.0001555463,0.00005058295,0.0009126103,0.0046438007,0.00074728986,0.0014191638,0.00015442143,0.000019461011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056590558,0.00006337762,0.000057775862,0.0000071644968,0.000004292004,0.0000012920244,0.0010881068,0.00060958514,0.0010544895,0.8616571,0.000016518692,0.13538374],"study_design_scores_gemma":[0.0010534659,0.00014748848,0.0023771024,0.00006196535,0.000005253716,0.00003535005,0.0000029384212,0.98396295,0.0038657794,0.008117934,0.00016723758,0.00020251876],"about_ca_topic_score_codex":9.210241e-7,"about_ca_topic_score_gemma":0.000001181294,"teacher_disagreement_score":0.9833534,"about_ca_system_score_codex":0.00004680288,"about_ca_system_score_gemma":0.00010243543,"threshold_uncertainty_score":0.998065},"labels":[],"label_agreement":null},{"id":"W1973850890","doi":"10.1109/bsc.2010.5472966","title":"Performance analysis of a decode-and-forward cooperative relaying scheme for MIMO systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Network topology; Computer science; Transmission (telecommunications); MIMO; Bandwidth (computing); Scheme (mathematics); Antenna (radio); Topology (electrical circuits); Computer network; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering; Electrical engineering; Mathematics","score_opus":0.031389976363021155,"score_gpt":0.2875611844980925,"score_spread":0.2561712081350713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973850890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47986498,0.00022663405,0.5160142,0.00028394756,0.00015572479,0.00024579396,0.0000024455308,0.00006181735,0.003144445],"genre_scores_gemma":[0.94555575,0.00022005632,0.053591147,0.00008894686,0.000015176619,0.000047276335,0.0000040463237,0.0000042188312,0.00047340448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920875,0.000042625703,0.00027067578,0.00022693574,0.00010598789,0.00014503555],"domain_scores_gemma":[0.9986841,0.00024511106,0.00009921787,0.00056087377,0.00034935094,0.000061363506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000511765,0.000096002324,0.00025427688,0.00019867766,0.00021614437,0.00009884539,0.00052862987,0.000046837125,0.000017769373],"category_scores_gemma":[0.00008020985,0.000078287594,0.000070826965,0.00090136484,0.00005213023,0.0003232985,0.00022861545,0.00012824613,0.000002749591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029672672,0.00011699429,0.046233322,0.000084420455,0.0011665229,4.967835e-7,0.0034600645,0.0045443363,0.046142805,0.836316,0.00095359085,0.06095176],"study_design_scores_gemma":[0.00018791936,0.000043638065,0.003688041,0.000013094335,0.00004725806,0.0000013989609,0.000045605833,0.99167216,0.0013856794,0.00000789157,0.002799021,0.000108317574],"about_ca_topic_score_codex":0.000008004601,"about_ca_topic_score_gemma":0.00010509546,"teacher_disagreement_score":0.9871278,"about_ca_system_score_codex":0.000010487907,"about_ca_system_score_gemma":0.000040574596,"threshold_uncertainty_score":0.31924754},"labels":[],"label_agreement":null},{"id":"W1973892455","doi":"10.1109/twc.2013.050313.121454","title":"Signal Alignment: Enabling Physical Layer Network Coding for MIMO Networking","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Precoding; Computer science; MIMO; Linear network coding; Physical layer; Multicast; Unicast; Multi-user MIMO; Network packet; Computer network; Wireless network; Artificial noise; Goodput; Wireless; Throughput; Telecommunications; Channel (broadcasting)","score_opus":0.06371991450776751,"score_gpt":0.29725965217028005,"score_spread":0.23353973766251254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973892455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023332853,0.00043098058,0.99049115,0.0038186933,0.00043477523,0.0009058821,0.000006569589,0.00039779613,0.0011808865],"genre_scores_gemma":[0.9603774,0.0018387937,0.03516983,0.00083822134,0.00022365504,0.0012008038,0.00001282223,0.000039234896,0.00029927157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786735,0.00037483248,0.00046910904,0.00044958686,0.0002601812,0.00057892257],"domain_scores_gemma":[0.99504733,0.0015255637,0.00018114358,0.002756887,0.00030889545,0.00018015435],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00040549235,0.0002962221,0.0003269887,0.00015004141,0.002558319,0.00044669106,0.0029575734,0.00010025623,0.00004723662],"category_scores_gemma":[0.000005061429,0.00030838777,0.00024850375,0.0009133389,0.00015129826,0.0007458862,0.00006851039,0.0005604569,0.00011383414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001718035,0.0007658815,0.000034245797,0.000023766555,0.00022063867,5.787241e-7,0.0026388804,0.06685205,0.010064988,0.1090141,0.0034284948,0.8069392],"study_design_scores_gemma":[0.0005511675,0.0000855093,0.000043395255,0.0001551221,0.000033118824,0.000004378931,0.00008060049,0.9808846,0.0039598853,0.002136135,0.011648795,0.0004172637],"about_ca_topic_score_codex":0.000023726743,"about_ca_topic_score_gemma":0.00007734322,"teacher_disagreement_score":0.95804405,"about_ca_system_score_codex":0.00013838602,"about_ca_system_score_gemma":0.00007919833,"threshold_uncertainty_score":0.9999368},"labels":[],"label_agreement":null},{"id":"W1973910654","doi":"10.1109/tvt.2013.2259856","title":"Maximum-Likelihood Detector for Differential Amplify-and-Forward Cooperative Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Detector; Algorithm; Rayleigh fading; Bit error rate; Keying; Phase-shift keying; Benchmark (surveying); Signal-to-noise ratio (imaging); Computer science; Mathematics; Fading; Telecommunications; Decoding methods","score_opus":0.014242399525304556,"score_gpt":0.2407349835400545,"score_spread":0.22649258401474992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973910654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026801778,0.00026156436,0.96830523,0.0029227692,0.00036356985,0.00078526366,0.0000049610144,0.0005157241,0.00003912224],"genre_scores_gemma":[0.9858215,0.00048629555,0.012358767,0.000362918,0.000030447736,0.0008335458,0.000003112558,0.000021437958,0.00008201725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986353,0.00008596805,0.0002743091,0.0004776453,0.000115332696,0.00041147578],"domain_scores_gemma":[0.9986732,0.00015080482,0.00006934819,0.00076793047,0.00023398489,0.00010475733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010274272,0.00023905688,0.00027395115,0.00029894643,0.00055930996,0.00015656695,0.00075590686,0.00029798492,0.000077923556],"category_scores_gemma":[0.000011248429,0.00021722037,0.00009800104,0.0005761681,0.00016133144,0.00025455232,0.000020998175,0.0005147143,0.00005239238],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020101505,0.0002252003,0.000014350715,0.00001131448,0.00015811437,0.0000024407998,0.00014701356,0.004743286,0.015224617,0.016252065,0.00036456782,0.9628369],"study_design_scores_gemma":[0.0016865201,0.00072197075,0.00014502218,0.00005305452,0.00004864218,0.000044569722,0.00007624785,0.93704057,0.048503123,0.0051640575,0.005885447,0.00063079107],"about_ca_topic_score_codex":0.0000064225783,"about_ca_topic_score_gemma":0.00004751895,"teacher_disagreement_score":0.9622061,"about_ca_system_score_codex":0.00005477342,"about_ca_system_score_gemma":0.00003361427,"threshold_uncertainty_score":0.88579893},"labels":[],"label_agreement":null},{"id":"W1974155053","doi":"10.1109/tvt.2012.2206838","title":"Least Square Error Detection for Noncoherent Cooperative Relay Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pairwise error probability; Diversity gain; Algorithm; MIMO; Relay; Cooperative diversity; Detector; Coding gain; Topology (electrical circuits); Mathematics; Computer science; Diversity scheme; Control theory (sociology); Channel (broadcasting); Decoding methods; Telecommunications; Fading; Physics; Combinatorics","score_opus":0.03583951504614865,"score_gpt":0.28180180250432046,"score_spread":0.2459622874581718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974155053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147220595,0.00089901395,0.98036796,0.0012203038,0.0012830419,0.0007685481,0.0000069947796,0.00061910565,0.00011296627],"genre_scores_gemma":[0.99414575,0.00013337567,0.0044092704,0.000102591206,0.00005382522,0.000829267,0.000002050839,0.000020464257,0.00030342292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987095,0.00014010695,0.00028110415,0.00032990138,0.00014885767,0.0003905445],"domain_scores_gemma":[0.9986407,0.00009910704,0.00009235899,0.00081747904,0.0002609072,0.00008943848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027685682,0.00020243195,0.00022833631,0.00036434951,0.0006172474,0.0000686523,0.00060384907,0.00025625213,0.000013289386],"category_scores_gemma":[0.0000141470355,0.00018996297,0.00011016483,0.00087011,0.0000902404,0.00036738734,0.000009454042,0.00043251176,0.00008992576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010511127,0.001637686,0.00010097843,0.00009768576,0.0004021094,0.0000065154404,0.0018934434,0.1302033,0.09011908,0.07957616,0.000598949,0.695259],"study_design_scores_gemma":[0.0017954358,0.0010893269,0.000101341655,0.0001763772,0.00007506629,0.00017946164,0.0006646366,0.6216051,0.2959229,0.00011503216,0.07743201,0.0008433342],"about_ca_topic_score_codex":0.0000043371774,"about_ca_topic_score_gemma":0.000053360694,"teacher_disagreement_score":0.9794237,"about_ca_system_score_codex":0.00017584072,"about_ca_system_score_gemma":0.000038530605,"threshold_uncertainty_score":0.7746465},"labels":[],"label_agreement":null},{"id":"W1974170714","doi":"10.1145/2160803.2160851","title":"On robust wireless network optimization using network criticality","year":2011,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Toronto","funders":"","keywords":"Criticality; Robustness (evolution); Computer science; Wireless network; Wireless; Convexity; Distributed computing; Robust optimization; Metric (unit); Mathematical optimization; Computer network; Mathematics; Engineering; Telecommunications","score_opus":0.28141784300483796,"score_gpt":0.3645190294056958,"score_spread":0.08310118640085784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974170714","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035344784,0.048810713,0.93984747,0.00052192225,0.00083027343,0.0011876489,7.247512e-7,0.0001792422,0.005087546],"genre_scores_gemma":[0.36323297,0.23785593,0.39095595,0.0073044137,0.00035319498,0.00017900654,0.000041805277,0.00003734738,0.000039350733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965665,0.00088034803,0.0007271144,0.00049876707,0.00086341274,0.00046386756],"domain_scores_gemma":[0.9959428,0.000500104,0.0003323702,0.0020086104,0.0010806929,0.00013546535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006339855,0.0002526273,0.00039216437,0.00016521022,0.00060672604,0.00011226931,0.0017281934,0.000089323,0.0005745715],"category_scores_gemma":[0.001829503,0.00023619141,0.00010428722,0.004740721,0.00005502748,0.00084313966,0.0005955723,0.00031564772,0.00008163645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074792692,0.00010633494,0.0016293088,0.000223799,0.000026099946,7.7275763e-7,0.00008564762,0.59560835,0.0000012451209,0.029020462,0.0046182587,0.36867225],"study_design_scores_gemma":[0.00023383606,0.00009051119,0.0023345,0.0016564787,0.00006987434,0.0000046954183,0.0000014579186,0.9935239,0.0000139750755,0.00075136905,0.0010256289,0.0002937513],"about_ca_topic_score_codex":0.0000021468732,"about_ca_topic_score_gemma":0.0000016146619,"teacher_disagreement_score":0.5488915,"about_ca_system_score_codex":0.00021638548,"about_ca_system_score_gemma":0.00019574985,"threshold_uncertainty_score":0.9631606},"labels":[],"label_agreement":null},{"id":"W1974190285","doi":"10.1109/tcomm.2013.092813.130126","title":"Uniform Approximations for Wireless Performance in Fading Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Moment-generating function; Fading; Rayleigh fading; Maximal-ratio combining; Probability density function; Signal-to-noise ratio (imaging); Mathematics; Cumulative distribution function; Channel (broadcasting); Algorithm; Topology (electrical circuits); Computer science; Statistics; Telecommunications","score_opus":0.06295867897916722,"score_gpt":0.2874495964671314,"score_spread":0.22449091748796418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974190285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062709283,0.000091296875,0.9829036,0.005838108,0.00022630449,0.00096798345,0.0000066643124,0.00020835277,0.0034867425],"genre_scores_gemma":[0.9493665,0.0015167025,0.046100277,0.0002787794,0.000012648991,0.00197609,0.000008897925,0.000015990814,0.0007240833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880046,0.00013318376,0.0003927096,0.0002512526,0.000130196,0.0002921736],"domain_scores_gemma":[0.9967662,0.000496632,0.00009046873,0.0023245867,0.00023752174,0.000084577936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003063702,0.00016369528,0.00017457236,0.0003510502,0.0009411629,0.00020343212,0.0023422523,0.00007262627,0.00004160743],"category_scores_gemma":[0.000008614237,0.00017243516,0.00008693975,0.0009997679,0.000096739284,0.0010596365,0.000028662334,0.00037287417,0.00011768066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105855015,0.0012624307,0.00009325145,0.000060352562,0.00006667706,1.9350223e-7,0.0064167064,0.054299265,0.002191477,0.13827129,0.00058401603,0.79674375],"study_design_scores_gemma":[0.00045862267,0.00006123568,0.00035570163,0.00007929297,0.0000049207347,0.0000033446056,0.000105592626,0.98997855,0.0021896178,0.0010790158,0.0054535735,0.0002305531],"about_ca_topic_score_codex":0.000020361174,"about_ca_topic_score_gemma":0.00015752915,"teacher_disagreement_score":0.9430956,"about_ca_system_score_codex":0.00013761714,"about_ca_system_score_gemma":0.00007366478,"threshold_uncertainty_score":0.72387594},"labels":[],"label_agreement":null},{"id":"W1974727810","doi":"10.1109/wcnc.2014.6952599","title":"Effective capacities of dual-hop networks with relay selection","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Network packet; Computer science; Computer network; Fading; Frame (networking); Throughput; Transmission (telecommunications); Buffer overflow; Hop (telecommunications); Quality of service; Transmission delay; Packet switching; Real-time computing; Wireless; Telecommunications","score_opus":0.010499450815205633,"score_gpt":0.22395657773848598,"score_spread":0.21345712692328034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974727810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0287763,0.00006313791,0.95440483,0.0002373535,0.000059738242,0.00007881752,4.2146244e-8,0.0000873304,0.016292434],"genre_scores_gemma":[0.9831599,0.000048402853,0.016206369,0.00016039448,0.000034977227,0.000015950252,5.646086e-7,0.000003840548,0.00036961804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943304,0.00016992913,0.0000926744,0.0001222176,0.00008512374,0.00009701612],"domain_scores_gemma":[0.99931127,0.00021256234,0.000053398748,0.00026972967,0.0001260816,0.000026967597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026947775,0.000060921855,0.00008464695,0.00004188567,0.000107907166,0.000032453918,0.000197587,0.000026736878,0.000021390315],"category_scores_gemma":[0.00002337712,0.000047014804,0.000019502357,0.00032554776,0.00006407226,0.00017506261,0.000090998146,0.000097305965,0.000004747989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019264922,0.00004205813,0.0013827634,0.000008621485,0.000040490362,3.3811776e-7,0.0017805052,0.041627605,0.00093591434,0.83812076,0.0018633906,0.114178285],"study_design_scores_gemma":[0.00025148338,0.00030286764,0.002775993,0.00003555757,0.0000040778064,0.000009821651,0.000039200095,0.98715794,0.006085072,0.00016072871,0.003063982,0.00011330169],"about_ca_topic_score_codex":0.0000101721,"about_ca_topic_score_gemma":0.000110008375,"teacher_disagreement_score":0.9543836,"about_ca_system_score_codex":0.000013613179,"about_ca_system_score_gemma":0.0000123306845,"threshold_uncertainty_score":0.19172081},"labels":[],"label_agreement":null},{"id":"W1975060391","doi":"10.1109/glocom.2011.6133833","title":"Detection Techniques for Two-Relays Decode and Forward Cooperative Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Detector; Computer science; Network packet; Interference (communication); Bandwidth (computing); Bit error rate; Viterbi algorithm; SIGNAL (programming language); Algorithm; Minimum mean square error; Real-time computing; Electronic engineering; Decoding methods; Telecommunications; Mathematics; Computer network; Engineering; Statistics; Channel (broadcasting)","score_opus":0.0551223018131395,"score_gpt":0.2897812355418455,"score_spread":0.234658933728706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975060391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014213313,0.0003360954,0.98608017,0.00008666086,0.00012353118,0.00059224374,7.664777e-7,0.00026670628,0.011092523],"genre_scores_gemma":[0.92984265,0.00018040018,0.06901874,0.00016622007,0.000030019924,0.00031082926,8.235818e-7,0.0000063859616,0.00044390094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937546,0.000071732924,0.00015655857,0.00021071351,0.000054111475,0.00013141154],"domain_scores_gemma":[0.9992845,0.00008914435,0.000046740268,0.00033301165,0.00019284856,0.00005376424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029380442,0.000091769056,0.00011112798,0.00006422737,0.000242553,0.000113251335,0.00032645083,0.000035759218,0.000007712229],"category_scores_gemma":[0.00002886181,0.000075672266,0.000025012849,0.00016083455,0.000032071704,0.00036009878,0.00018057147,0.00006601085,0.000005573406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019291087,0.000050026163,0.00015151808,0.0000151768545,0.00003251159,7.0839155e-7,0.0021337275,0.000015461916,0.00995197,0.5991673,0.0006608828,0.38780144],"study_design_scores_gemma":[0.0007330919,0.00056323234,0.0003862261,0.00006539631,0.000014068389,0.000037971287,0.00020930846,0.7313309,0.23379478,0.0018969016,0.030494018,0.00047414412],"about_ca_topic_score_codex":0.000024181121,"about_ca_topic_score_gemma":0.00017385298,"teacher_disagreement_score":0.9284214,"about_ca_system_score_codex":0.000025174997,"about_ca_system_score_gemma":0.000017487475,"threshold_uncertainty_score":0.30858254},"labels":[],"label_agreement":null},{"id":"W1975375851","doi":"10.1080/03772063.2005.11416398","title":"Open-Loop and Closed-Loop Transmit Diversity Techniques—Overview and New Results","year":2005,"lang":"en","type":"article","venue":"IETE Journal of Research","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wireless; Excellence; Telecommunications; Telecommunications engineering; Computer science; Communications system; Engineering; Computer engineering","score_opus":0.2924020551157468,"score_gpt":0.4365021690381314,"score_spread":0.1441001139223846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975375851","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3142039,0.1553774,0.10370653,0.36698624,0.00047471194,0.0023236373,0.000014781551,0.00021004122,0.056702763],"genre_scores_gemma":[0.7750299,0.14280635,0.07544968,0.00094506884,0.00034469218,0.0000025828008,5.943601e-7,0.000013121299,0.0054079983],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99827456,0.00046102324,0.00030711276,0.00019750855,0.0005229359,0.00023688366],"domain_scores_gemma":[0.99837106,0.00036008193,0.00011134994,0.0004038205,0.00047623477,0.0002774546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042169304,0.00008523721,0.00019510982,0.00022158925,0.0005189692,0.00045753,0.0020695925,0.000051728377,0.000020950434],"category_scores_gemma":[0.0001677578,0.00007099914,0.00003762928,0.00054063887,0.00011562761,0.0010605442,0.0029210201,0.000646102,0.000005388996],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009049662,0.000049576494,0.00025109077,0.000012086777,0.000020768843,0.00002009937,0.001136602,0.000002662282,0.0008349997,0.004185711,0.022403013,0.9709929],"study_design_scores_gemma":[0.0045369957,0.0013670318,0.012543602,0.0009088935,0.00001936003,0.00042838047,0.00013344082,0.0065675927,0.007233027,0.0038675321,0.9619913,0.00040284684],"about_ca_topic_score_codex":0.00003625113,"about_ca_topic_score_gemma":0.000062455525,"teacher_disagreement_score":0.97059005,"about_ca_system_score_codex":0.000060975835,"about_ca_system_score_gemma":0.00020031809,"threshold_uncertainty_score":0.44119725},"labels":[],"label_agreement":null},{"id":"W1975752675","doi":"10.1109/milcom.2006.302341","title":"Decode-and-Forward Cooperative Networks with Multiuser Diversity","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Estimator; Cooperative diversity; Algorithm; Diversity (politics); Scheme (mathematics); Multiuser detection; Symbol (formal); Computer network; Detector; Mathematics; Telecommunications; Decoding methods; Statistics; Physics; Fading","score_opus":0.017108112220187943,"score_gpt":0.22685308281517436,"score_spread":0.20974497059498642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975752675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022237243,0.00027259323,0.96366125,0.0008324133,0.000043276847,0.00012320474,3.064254e-7,0.0001614851,0.012668243],"genre_scores_gemma":[0.9699825,0.00017572763,0.027666762,0.000634994,0.00002995771,0.0000057264874,0.0000025270294,0.0000043047035,0.001497493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992886,0.00007493273,0.00010442284,0.00024418678,0.000113250455,0.0001746052],"domain_scores_gemma":[0.99929965,0.000090557405,0.000034495286,0.0003769253,0.00013836334,0.000060041562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014000706,0.00011120359,0.000113471695,0.000038230002,0.0005878326,0.00013981615,0.00048523638,0.000032734315,0.00003738011],"category_scores_gemma":[0.000005641611,0.00008130652,0.000019308138,0.00029299737,0.00006988238,0.0003780383,0.0011095981,0.00011810722,0.0000129050395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042221218,0.00020296787,0.09983099,0.000005005322,0.00007407611,0.000022460103,0.0013579424,0.048590068,0.00010929702,0.7718008,0.015003546,0.0629606],"study_design_scores_gemma":[0.00086727744,0.00009798722,0.050999727,0.000018368115,0.000008149506,0.000012589184,0.00004157776,0.9390754,0.0002533829,0.00022088634,0.008069852,0.0003348001],"about_ca_topic_score_codex":0.00006751398,"about_ca_topic_score_gemma":0.001016602,"teacher_disagreement_score":0.94774526,"about_ca_system_score_codex":0.00002325027,"about_ca_system_score_gemma":0.000017445016,"threshold_uncertainty_score":0.45211923},"labels":[],"label_agreement":null},{"id":"W1975891563","doi":"10.1109/lwc.2014.2372776","title":"Diversity–Multiplexing Tradeoff of the Half-Duplex Slow Fading Multiple-Access Relay Channel Based on Generalized Quantize-and-Forward Scheme","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Fading; Multiplexing; Channel state information; Relay channel; Computer science; Computer network; Wireless; Channel (broadcasting); Diversity scheme; Topology (electrical circuits); Telecommunications; Engineering; Physics; Electrical engineering","score_opus":0.07290483281977216,"score_gpt":0.28449629985111585,"score_spread":0.21159146703134368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975891563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5007565,0.00018371614,0.45473102,0.042878553,0.00036230774,0.00052338804,0.0000070776846,0.0002196996,0.0003377166],"genre_scores_gemma":[0.9748371,0.00032935,0.02003251,0.0046479865,0.00003428773,0.000056644712,0.00001073812,0.000023237177,0.000028103173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973108,0.0010564133,0.00048635434,0.00041537662,0.00038892645,0.0003421339],"domain_scores_gemma":[0.9939468,0.0013049041,0.00038265312,0.004111742,0.00014551818,0.000108416556],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008053795,0.00027282853,0.0003570994,0.00023429682,0.0026280251,0.0001789881,0.006690473,0.00008839572,0.0000036745366],"category_scores_gemma":[0.00016630572,0.00023725559,0.0001877373,0.0008347266,0.00043024868,0.00048491097,0.0039249365,0.00052331836,0.0000046906225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018553721,0.00126367,0.07170027,0.0002447882,0.00044295253,0.0000037782029,0.020890743,0.35974762,0.2905147,0.18902813,0.0065241447,0.05945366],"study_design_scores_gemma":[0.0010755038,0.000022593385,0.006643679,0.0002006918,0.000013598994,0.0000019371994,0.000027289361,0.98513246,0.004268875,0.000030812265,0.0022969618,0.00028561594],"about_ca_topic_score_codex":0.00013193485,"about_ca_topic_score_gemma":0.0002229511,"teacher_disagreement_score":0.6253848,"about_ca_system_score_codex":0.00009028407,"about_ca_system_score_gemma":0.00003996218,"threshold_uncertainty_score":0.9986838},"labels":[],"label_agreement":null},{"id":"W1976283561","doi":"10.1109/glocom.2013.6831358","title":"Relay selection scheme with adaptive cyclic prefix for cooperative amplify-and-forward relay","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Relay; Relay channel; Computer science; Cyclic prefix; Computer network; Node (physics); Throughput; Transmission (telecommunications); Link Access Procedure for Frame Relay; Overhead (engineering); Fading; Channel (broadcasting); Reliability (semiconductor); Signal-to-noise ratio (imaging); Orthogonal frequency-division multiplexing; Telecommunications; Engineering; Wireless","score_opus":0.027953638057144438,"score_gpt":0.25600727699922626,"score_spread":0.22805363894208183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976283561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021094227,0.0001954655,0.9685689,0.0022227129,0.00005525631,0.0009273735,0.0000010311693,0.0002443445,0.006690672],"genre_scores_gemma":[0.7163505,0.00019397448,0.2775463,0.0008217202,0.00004209316,0.0004655989,0.0000054737225,0.000015527943,0.004558839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889153,0.000113089875,0.00020152464,0.0004028232,0.0001343457,0.0002566899],"domain_scores_gemma":[0.9987057,0.00024601896,0.00008106208,0.00039368647,0.00046120142,0.00011233465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002126983,0.00017432508,0.00018009804,0.00007667682,0.0004395539,0.0002520499,0.000408152,0.00007011944,0.00007672399],"category_scores_gemma":[0.000050461567,0.00012625859,0.00003106216,0.00043605352,0.00007208041,0.00087766565,0.00021283988,0.00021219425,0.00006747377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082978695,0.00015232884,0.0015888377,0.000014688811,0.00018256746,6.2757647e-7,0.0030066965,0.0017275892,0.0064025316,0.90547895,0.017004117,0.06435807],"study_design_scores_gemma":[0.0014282955,0.0011439503,0.0035175646,0.00006742277,0.00001532303,0.000028309121,0.00023545529,0.9598179,0.0045292326,0.0006383699,0.028004803,0.0005733808],"about_ca_topic_score_codex":0.000025069441,"about_ca_topic_score_gemma":0.00012792308,"teacher_disagreement_score":0.9580903,"about_ca_system_score_codex":0.000059134447,"about_ca_system_score_gemma":0.00006882668,"threshold_uncertainty_score":0.5148676},"labels":[],"label_agreement":null},{"id":"W1976334458","doi":"10.1109/glocom.2012.6503896","title":"Buffer-aided BICM-OFDM relaying","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Diversity gain; Pairwise error probability; Orthogonal frequency-division multiplexing; Computer science; Relay; Diversity scheme; Multiplexing; Coding gain; Cooperative diversity; Computer network; Wireless; Network packet; Electronic engineering; Algorithm; Telecommunications; MIMO; Wireless network; Decoding methods; Channel (broadcasting); Engineering; Physics","score_opus":0.06489535936269573,"score_gpt":0.2955186060457252,"score_spread":0.23062324668302947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976334458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016615616,0.001694833,0.83466524,0.0031320076,0.00053457083,0.00010445975,1.0208527e-7,0.00042616672,0.14282703],"genre_scores_gemma":[0.9547955,0.00021600939,0.04149553,0.0010872023,0.000082968516,0.000007758832,6.866985e-7,0.000004546342,0.0023098057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993061,0.00009593263,0.0001270492,0.00012014646,0.000109757086,0.00024103405],"domain_scores_gemma":[0.9990717,0.000109785935,0.000030287874,0.00063610985,0.00004862598,0.000103462895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037969733,0.000073747906,0.00007627589,0.000050627546,0.0001879783,0.00008767619,0.0006838962,0.000027177914,0.00017134269],"category_scores_gemma":[0.000043637876,0.00006140157,0.000033542892,0.0003223266,0.00001797788,0.0006706034,0.00046063136,0.00010794629,0.00039654327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010327551,0.00006258974,0.0048085847,0.0000022519591,0.000009771444,7.351641e-7,0.0013256123,0.000009873497,0.0025851098,0.82596016,0.01040528,0.15482901],"study_design_scores_gemma":[0.0010482311,0.000096975746,0.05094894,0.00007498692,0.000012703998,0.00008099783,0.0001870211,0.13043073,0.017642567,0.002874069,0.79544514,0.001157621],"about_ca_topic_score_codex":0.0000029895875,"about_ca_topic_score_gemma":0.000003920051,"teacher_disagreement_score":0.93817985,"about_ca_system_score_codex":0.00002588356,"about_ca_system_score_gemma":0.000015231731,"threshold_uncertainty_score":0.5096894},"labels":[],"label_agreement":null},{"id":"W1976359041","doi":"10.1109/lcn.2012.6423677","title":"Energy efficient data survivability for WSNs via Decentralized Erasure Codes","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Survivability; Computer science; Erasure code; Linear network coding; Erasure; Redundancy (engineering); Wireless sensor network; Distributed computing; Coding (social sciences); Data redundancy; Reliability (semiconductor); Computer network; Decoding methods; Algorithm; Power (physics); Database","score_opus":0.10899344526735091,"score_gpt":0.33116091486970944,"score_spread":0.22216746960235853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976359041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028200403,0.0011809544,0.9928449,0.0011055053,0.0004111561,0.00015485237,0.00000915573,0.00014728944,0.0013261504],"genre_scores_gemma":[0.9525852,0.00020892282,0.046362966,0.000501641,0.000058177815,0.000021759115,0.000052941472,0.0000060297484,0.00020235006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987859,0.0002101991,0.00020635127,0.0002947441,0.00015140875,0.0003513677],"domain_scores_gemma":[0.9972535,0.00040167308,0.000049867478,0.0020299482,0.00012438679,0.0001406657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010917609,0.00011077634,0.00014756415,0.00003019937,0.00022576515,0.000094502524,0.001894975,0.000037435322,0.00008167235],"category_scores_gemma":[0.000097275384,0.000090469104,0.000041933316,0.00025831614,0.00003890445,0.00035308817,0.0010712901,0.000056528217,0.000011570665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023630597,0.00066399766,0.005038439,0.0000151488075,0.000053400283,1.8433919e-7,0.00078659,0.0004016145,0.0028009478,0.5801979,0.015923921,0.39409426],"study_design_scores_gemma":[0.0003599866,0.000016174206,0.0022133186,0.000005732694,0.0000058175433,0.000002000301,0.000009924879,0.7717523,0.0022827548,0.00027904072,0.22288957,0.00018336686],"about_ca_topic_score_codex":0.000025827629,"about_ca_topic_score_gemma":0.00021548168,"teacher_disagreement_score":0.94976515,"about_ca_system_score_codex":0.000037083166,"about_ca_system_score_gemma":0.000039900362,"threshold_uncertainty_score":0.3689223},"labels":[],"label_agreement":null},{"id":"W1976739756","doi":"10.1109/bsc.2010.5472953","title":"Capacity of selection cooperation with channel estimation errors","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Medical Research Council","keywords":"Relay; Channel (broadcasting); Selection (genetic algorithm); Fading; Signal-to-noise ratio (imaging); Upper and lower bounds; Computer science; Channel capacity; Algorithm; Outage probability; Relay channel; Noise (video); Telecommunications; Mathematics; Power (physics); Artificial intelligence; Physics","score_opus":0.03214549281202708,"score_gpt":0.2606833990500724,"score_spread":0.2285379062380453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976739756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1804632,0.000003435499,0.8164018,0.0006272618,0.00007792293,0.00008896232,1.4405518e-7,0.000083000676,0.0022543175],"genre_scores_gemma":[0.89681697,0.0000071854943,0.10295668,0.00007556882,0.000012774952,0.000008305065,0.0000020503555,0.0000025967663,0.0001178388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955153,0.00003918169,0.000116252406,0.00012098912,0.00009843152,0.00007358788],"domain_scores_gemma":[0.9993686,0.00002885519,0.000059836868,0.0002624683,0.000250575,0.00002966194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018816315,0.00005842453,0.000067012304,0.000059294525,0.00012573105,0.000043062537,0.00024124437,0.00003071344,0.000045831726],"category_scores_gemma":[0.000031897674,0.0000455414,0.000012092067,0.0004004691,0.00003465808,0.00044381164,0.00004568649,0.000126122,0.000007836299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012690955,0.00014880131,0.0010466742,0.000011934174,0.000018777542,2.0557567e-7,0.0019166011,0.012591801,0.16948618,0.73864925,0.0005195436,0.07559755],"study_design_scores_gemma":[0.00014521345,0.00006771024,0.0029856772,0.0000069616704,0.0000018066199,0.0000074269974,0.0000052573355,0.94031906,0.05587745,0.00026468807,0.00024508825,0.00007363963],"about_ca_topic_score_codex":0.000015288813,"about_ca_topic_score_gemma":0.000647872,"teacher_disagreement_score":0.9277273,"about_ca_system_score_codex":0.00000990594,"about_ca_system_score_gemma":0.00003716409,"threshold_uncertainty_score":0.18571244},"labels":[],"label_agreement":null},{"id":"W1976822910","doi":"10.1109/iccnc.2013.6504228","title":"Performance of cooperative relaying with adaptive modulation and selection combining","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Relay; Computer science; Link adaptation; Bit error rate; Maximal-ratio combining; Signal-to-noise ratio (imaging); Cooperative diversity; Modulation (music); Selection (genetic algorithm); Node (physics); Coding (social sciences); Electronic engineering; Diversity combining; Channel (broadcasting); Computer network; Telecommunications; Fading; Engineering; Mathematics; Statistics; Artificial intelligence","score_opus":0.06617419324837946,"score_gpt":0.28145708771061045,"score_spread":0.21528289446223098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976822910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7214566,0.00085759285,0.24010822,0.0058179125,0.0003104648,0.00080230256,0.0000023835162,0.00027799103,0.030366523],"genre_scores_gemma":[0.9682174,0.0029689348,0.028417831,0.00015858057,0.00004877884,0.000038221944,0.000013689491,0.000011853543,0.00012472896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859476,0.00025561766,0.00037624605,0.0003392134,0.0002376002,0.00019655364],"domain_scores_gemma":[0.9978915,0.00031130496,0.0003431743,0.0005802303,0.0007976387,0.000076166165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034630654,0.00020030723,0.00021952906,0.00017821135,0.00065434177,0.00029237242,0.0010199216,0.00006367471,0.0000225221],"category_scores_gemma":[0.000019082025,0.00018322012,0.000024778668,0.00036884396,0.00022991523,0.0005753923,0.0007566696,0.0003844379,0.00000896851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054784377,0.00019996647,0.018881446,0.000015803327,0.00017937477,3.795005e-7,0.0037982408,0.012378788,0.00149002,0.55383676,0.0004642489,0.4087002],"study_design_scores_gemma":[0.00038079757,0.00028447754,0.019715978,0.00037099342,0.000006778693,0.000015551757,0.00016840085,0.9778124,0.00004850928,0.00048657076,0.00050636585,0.00020314097],"about_ca_topic_score_codex":0.00007456054,"about_ca_topic_score_gemma":0.000049286806,"teacher_disagreement_score":0.96543366,"about_ca_system_score_codex":0.00005262304,"about_ca_system_score_gemma":0.000060909526,"threshold_uncertainty_score":0.74715},"labels":[],"label_agreement":null},{"id":"W1976896241","doi":"10.1109/icact.2008.4493733","title":"Performance Analysis of a Novel Cooperative Transmission Scheme in Wireless Networks","year":2008,"lang":"en","type":"article","venue":"International Conference on Advanced Communication Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fading; Additive white Gaussian noise; Rayleigh fading; Computer science; Relay; Transmission (telecommunications); Wireless; Cooperative diversity; Electronic engineering; Bandwidth (computing); Maximal-ratio combining; Channel (broadcasting); Telecommunications; Monte Carlo method; Computer network; Power (physics); Engineering; Mathematics; Physics; Statistics","score_opus":0.055397220265870274,"score_gpt":0.3160929622771918,"score_spread":0.2606957420113215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976896241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3956739,0.0003488266,0.5891614,0.005510594,0.00007919599,0.00026377334,0.0000043295395,0.00020509672,0.008752874],"genre_scores_gemma":[0.9527862,0.013774211,0.033063855,0.00014960494,0.000003213573,0.00008324641,0.000038617094,0.000007012907,0.0000940322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986183,0.00010130263,0.00052269216,0.00033478436,0.00023796788,0.00018491888],"domain_scores_gemma":[0.9976581,0.00013911413,0.00027129287,0.0012585509,0.00063298404,0.000040011684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021567201,0.00016810762,0.00034089477,0.0009736585,0.00017620857,0.000022425433,0.0028499973,0.0001332089,0.00005665855],"category_scores_gemma":[0.00005263704,0.00017072054,0.00007105915,0.0028061469,0.00026646064,0.00041857772,0.0004461603,0.00047828432,0.0000042315346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058444693,0.00046628638,0.005216031,0.000002409474,0.00016966728,0.0000017708372,0.00057548896,0.029784052,0.014520495,0.8177343,0.000011221181,0.13145983],"study_design_scores_gemma":[0.00075215707,0.000088030945,0.006726481,0.00011090218,0.000007995227,0.0000056311233,0.00006606245,0.9882862,0.0030811988,0.000245154,0.00045957134,0.0001706067],"about_ca_topic_score_codex":0.00000601018,"about_ca_topic_score_gemma":0.000050961666,"teacher_disagreement_score":0.9585022,"about_ca_system_score_codex":0.0001113917,"about_ca_system_score_gemma":0.00009051171,"threshold_uncertainty_score":0.69617814},"labels":[],"label_agreement":null},{"id":"W1977329051","doi":"10.1080/17445760.2012.660485","title":"Transmission rate enhancement via adaptive relaying in wireless networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Fading; Transmission (telecommunications); Computer science; Wireless; Computer network; Channel (broadcasting); Constraint (computer-aided design); Link adaptation; Transmission rate; Wireless network; Energy (signal processing); Electronic engineering; Telecommunications; Engineering; Mathematics; Statistics","score_opus":0.034297004631406225,"score_gpt":0.2877551742185444,"score_spread":0.2534581695871382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977329051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0283439,0.0064840694,0.9627388,0.00062515365,0.0015654591,0.00009819571,0.0000017532236,0.000009096534,0.00013356267],"genre_scores_gemma":[0.99419695,0.0043551866,0.0011125671,0.00004926107,0.00022321485,0.000007753337,0.0000123119125,0.000004420005,0.00003834833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852353,0.00025404687,0.0006193709,0.0001097779,0.00029386475,0.00019938205],"domain_scores_gemma":[0.99900925,0.00007675135,0.00033950462,0.0001224598,0.0003072521,0.00014477852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000920856,0.00011672337,0.00019577843,0.00012288347,0.00007079836,0.00008154607,0.00056622876,0.000047841168,0.00002088455],"category_scores_gemma":[0.000014873051,0.000097427284,0.00006503412,0.00018258995,0.000018497245,0.0005810182,0.00012190119,0.0001988493,0.0000029758012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012711979,0.002306961,0.084679745,0.00006697458,0.0014687134,0.00022762129,0.009436632,0.28376913,0.019471481,0.25157955,0.013458072,0.33226392],"study_design_scores_gemma":[0.0013977801,0.00010121019,0.01028721,0.0003455775,0.000011995185,0.00009199978,0.00019464106,0.973084,0.00015416989,0.000120281475,0.013973337,0.00023781197],"about_ca_topic_score_codex":0.000011180142,"about_ca_topic_score_gemma":0.0000038798125,"teacher_disagreement_score":0.96585304,"about_ca_system_score_codex":0.00011331244,"about_ca_system_score_gemma":0.000029817704,"threshold_uncertainty_score":0.39729694},"labels":[],"label_agreement":null},{"id":"W1977639277","doi":"10.1109/lcomm.2014.2328588","title":"Rate Optimization for Hybrid SC-FDE/OFDM Decode-and-Forward MIMO Relay Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Precoding; MIMO; Computer science; Orthogonal frequency-division multiplexing; SC-FDE; Relay; Equalization (audio); Bit error rate; Transmitter power output; Multiplexing; Spatial multiplexing; Mathematics; Beamforming; Algorithm; Power (physics); Telecommunications; Decoding methods; Transmitter; Channel (broadcasting)","score_opus":0.03796078662537239,"score_gpt":0.27635513077312385,"score_spread":0.23839434414775146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977639277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023020052,0.0012761375,0.9731381,0.021398509,0.00039833208,0.00054104713,0.000006827438,0.0002463621,0.000692668],"genre_scores_gemma":[0.7332166,0.002320856,0.25995603,0.0038773282,0.00007925216,0.0003560968,0.000069511174,0.000027865082,0.00009647223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802566,0.00076336047,0.00044431663,0.00036329124,0.00011912015,0.00028427196],"domain_scores_gemma":[0.9948477,0.0011385784,0.00022187969,0.0034540275,0.00022100973,0.00011681532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012554023,0.00019781209,0.00024102947,0.00017709871,0.00094474223,0.0004256981,0.002843401,0.000050354935,0.0000036843958],"category_scores_gemma":[0.00018260952,0.00020520331,0.000083007115,0.00036480732,0.00016734489,0.00054682035,0.0006091068,0.00023449917,0.000020689093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025639532,0.00026676035,0.000704088,0.000106442945,0.0002013281,7.4365835e-7,0.0017645374,0.26444626,0.013971905,0.55880684,0.037583627,0.122121796],"study_design_scores_gemma":[0.00043386043,0.00003150928,0.00007948375,0.00006245578,0.000015584537,0.0000058474607,0.000010335137,0.89435905,0.0001742146,0.00017200282,0.104418494,0.00023717977],"about_ca_topic_score_codex":0.000013680175,"about_ca_topic_score_gemma":0.000019771463,"teacher_disagreement_score":0.7309146,"about_ca_system_score_codex":0.00007957414,"about_ca_system_score_gemma":0.000030212723,"threshold_uncertainty_score":0.8367948},"labels":[],"label_agreement":null},{"id":"W1977865278","doi":"10.1109/tcomm.2014.2315612","title":"Understanding the Benefits of Successive Interference Cancellation in Multi-Rate Multi-Hop Wireless Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Single antenna interference cancellation; Scheduling (production processes); Wireless network; Computer network; Network performance; Greedy algorithm; Network topology; Transmission (telecommunications); Computational complexity theory; Wireless; Distributed computing; Mathematical optimization; Channel (broadcasting); Algorithm; Mathematics; Telecommunications","score_opus":0.17759528154483173,"score_gpt":0.32021710654508617,"score_spread":0.14262182500025444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977865278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017149393,0.00033354622,0.9946581,0.002303462,0.00022108995,0.00029301707,0.0000046684872,0.000076472716,0.00039466238],"genre_scores_gemma":[0.989326,0.0029772988,0.0072955037,0.00019013973,0.000008010673,0.000094751806,0.000003991781,0.000012726345,0.00009155255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981105,0.00084865344,0.0004526786,0.000250431,0.00012332498,0.00021443391],"domain_scores_gemma":[0.99565756,0.0015303602,0.0002171628,0.0023529348,0.00018702904,0.00005497556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069790555,0.00016506258,0.0002017856,0.00019927815,0.00070493546,0.00010095438,0.0025661788,0.00007874202,0.000009876194],"category_scores_gemma":[0.000026154072,0.0001437541,0.00007475946,0.0010321238,0.00022812023,0.00034145638,0.00005241738,0.00057196105,0.000007160024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018279936,0.00056472165,0.00025508666,0.000011061478,0.00004618991,1.5249259e-7,0.005933737,0.81060255,0.00090735155,0.07904996,0.00003094376,0.10257995],"study_design_scores_gemma":[0.000510125,0.00003644842,0.0015044159,0.0001685722,0.0000092699065,9.211689e-7,0.00020285111,0.9963865,0.00080281694,0.00013482453,0.00009167886,0.00015157311],"about_ca_topic_score_codex":0.00008790772,"about_ca_topic_score_gemma":0.0093429275,"teacher_disagreement_score":0.9876111,"about_ca_system_score_codex":0.00018253284,"about_ca_system_score_gemma":0.00005838722,"threshold_uncertainty_score":0.5862122},"labels":[],"label_agreement":null},{"id":"W1977867051","doi":"10.1109/vtcfall.2013.6692366","title":"Power Allocation and Sum-Rate Analysis for Multi-User Multi-Relay Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Beamforming; Transmitter power output; Computer science; Power (physics); Relay channel; Mathematical optimization; Interference (communication); Constraint (computer-aided design); Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Combinatorics","score_opus":0.049581601180046356,"score_gpt":0.2977720995646824,"score_spread":0.24819049838463608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977867051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006383417,0.00035746067,0.9909467,0.001471662,0.0000854931,0.00036988707,3.834969e-7,0.00011227907,0.00027270176],"genre_scores_gemma":[0.79947805,0.0003136841,0.19463868,0.0009732828,0.000014009052,0.00010412083,0.00000844703,0.000006774435,0.004462954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999097,0.00011211568,0.00021482114,0.00030769454,0.00006356572,0.00020481579],"domain_scores_gemma":[0.99879056,0.00016825245,0.00006861495,0.00058982737,0.00028838523,0.0000943296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035508786,0.00012103654,0.00015933903,0.00012091596,0.00022549614,0.00029513723,0.00048451367,0.00005784247,0.000114439885],"category_scores_gemma":[0.00004396225,0.000100273995,0.00007432966,0.00063409796,0.000034218076,0.0005092375,0.00025954258,0.0000872082,0.000030009176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026306541,0.0010241331,0.102818415,0.000026933387,0.0021498557,0.000001768382,0.0060253097,0.11316393,0.0047112713,0.55323166,0.024279837,0.19254057],"study_design_scores_gemma":[0.0003794279,0.000018453838,0.0698031,0.000003828048,0.000019194891,2.9062488e-7,0.000023269142,0.92655724,0.000060373855,0.000015051242,0.0029829452,0.00013679973],"about_ca_topic_score_codex":0.000032564847,"about_ca_topic_score_gemma":0.00033962354,"teacher_disagreement_score":0.81339335,"about_ca_system_score_codex":0.000020201202,"about_ca_system_score_gemma":0.000013742543,"threshold_uncertainty_score":0.4089055},"labels":[],"label_agreement":null},{"id":"W1978359440","doi":"10.1109/lcomm.2012.100812.121258","title":"Optimal User Pairing for Asymmetric Multi-Way Relay Channels with Pairwise Relaying","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Pairing; Pairwise comparison; Computer science; Pairwise error probability; Relay channel; Computer network; Channel (broadcasting); Transmission (telecommunications); Upper and lower bounds; Topology (electrical circuits); Telecommunications; Mathematics; Power (physics); MIMO; Physics; Combinatorics","score_opus":0.08821356770550323,"score_gpt":0.30490772575562214,"score_spread":0.2166941580501189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978359440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029936876,0.0020620981,0.9526254,0.013736161,0.00039029738,0.00060282275,0.0000029277332,0.0003481578,0.00029526395],"genre_scores_gemma":[0.6110252,0.00036663323,0.38617942,0.0018929323,0.00007520385,0.00029294795,0.000011525766,0.00002638787,0.00012975278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981532,0.0003905451,0.00037481013,0.00031108008,0.00020627028,0.00056409783],"domain_scores_gemma":[0.9948463,0.00085605256,0.00020226324,0.0037174975,0.00019543499,0.00018244938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010423331,0.00024215573,0.00023129919,0.00033054684,0.0010615971,0.00022828099,0.0033388035,0.000070435424,0.0000042610172],"category_scores_gemma":[0.00011655968,0.00022463544,0.00011411541,0.0011883769,0.00015559855,0.0012209169,0.00077089376,0.0004258956,0.000050838175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019365695,0.00489487,0.06436876,0.0002474574,0.0014031081,0.000012620443,0.059334725,0.121361755,0.05656059,0.18983798,0.10572548,0.396059],"study_design_scores_gemma":[0.003539921,0.00020347549,0.009664897,0.00036144056,0.000103593746,0.0000697429,0.00035435785,0.6694793,0.005713339,0.00001697824,0.30873755,0.0017554294],"about_ca_topic_score_codex":0.0000081638145,"about_ca_topic_score_gemma":0.000013862933,"teacher_disagreement_score":0.5810883,"about_ca_system_score_codex":0.00015093297,"about_ca_system_score_gemma":0.00003701131,"threshold_uncertainty_score":0.9160367},"labels":[],"label_agreement":null},{"id":"W1978609099","doi":"10.1109/wcnc.2010.5506230","title":"Symbol Error Probability Analysis for Multihop Relaying over Nakagami Fading Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Computer science; Statistics; Combinatorics; Topology (electrical circuits); Mathematics; Discrete mathematics","score_opus":0.06742750307062416,"score_gpt":0.3213652873226102,"score_spread":0.25393778425198604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978609099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19125447,0.000038070637,0.804928,0.0011164176,0.00037111584,0.00040576886,0.0000013202698,0.00022632086,0.0016585081],"genre_scores_gemma":[0.90584934,0.000011659759,0.09289919,0.000346095,0.000060649374,0.00009096857,0.00000471817,0.00000706667,0.0007302978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877334,0.00007785467,0.00027912174,0.00044061773,0.00015136343,0.0002777149],"domain_scores_gemma":[0.99811774,0.00034229897,0.00008854634,0.0011250835,0.00022273594,0.00010359999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007915832,0.00014004855,0.0002222339,0.00017856447,0.0003951076,0.00022360319,0.0010136953,0.000073102354,0.00013385773],"category_scores_gemma":[0.0002452034,0.00012106537,0.0001978853,0.001070239,0.00004350894,0.00046391945,0.00041779393,0.00023642812,0.00001407871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037493817,0.0006166596,0.066065654,0.000077143166,0.0010279628,0.0000033385018,0.011253044,0.015061367,0.060760193,0.65834177,0.0027236755,0.18403171],"study_design_scores_gemma":[0.0003000073,0.000021859252,0.008825247,0.00000682218,0.000036649075,9.997063e-7,0.000023386028,0.98300564,0.0015994067,0.0012344188,0.00471881,0.00022675892],"about_ca_topic_score_codex":0.000011094765,"about_ca_topic_score_gemma":0.0002876117,"teacher_disagreement_score":0.96794426,"about_ca_system_score_codex":0.000034436638,"about_ca_system_score_gemma":0.0000376558,"threshold_uncertainty_score":0.49369028},"labels":[],"label_agreement":null},{"id":"W1978661640","doi":"10.1109/vtcfall.2014.6965826","title":"A Novel Destination Cooperation Scheme in Interference Channels","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cooperative diversity; MIMO; Fading; Computer network; Diversity gain; Cooperative MIMO; Wireless; Coding (social sciences); Channel (broadcasting); Interference (communication); Antenna diversity; Electronic engineering; Scheme (mathematics); Single antenna interference cancellation; Diversity scheme; Dirty paper coding; Multi-user MIMO; Telecommunications; Precoding; Engineering; Mathematics","score_opus":0.05595838423064584,"score_gpt":0.2859328818062411,"score_spread":0.22997449757559527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978661640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0135652935,0.000021951879,0.9764009,0.0015216992,0.00011340196,0.00008352539,4.7140972e-8,0.00008990706,0.008203257],"genre_scores_gemma":[0.92798674,0.000024416211,0.071090184,0.0005316903,0.000023183627,0.000017351444,0.0000020060875,0.0000025713998,0.00032186648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941385,0.000072638744,0.00015280336,0.00017814276,0.00007158482,0.000110985355],"domain_scores_gemma":[0.9994056,0.000083032435,0.000031899257,0.00032778655,0.00012063095,0.000031035925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039737183,0.00006584602,0.000070731265,0.000095456584,0.00007002282,0.00014079624,0.0005009962,0.000025348761,0.000025566082],"category_scores_gemma":[0.00016035452,0.000060722796,0.000011589201,0.0004266504,0.000014970138,0.0004409096,0.00020945113,0.00009059346,0.000043078082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015020859,0.000062110244,0.00037182125,0.0000022838262,0.0000012471334,1.3327472e-7,0.00053239014,0.00052373606,0.025466625,0.86386645,0.00014272751,0.109029],"study_design_scores_gemma":[0.00025592995,0.000034533983,0.0018167793,0.000029086086,2.3596519e-7,0.0000021738979,0.000005190017,0.9930516,0.0027996474,0.00041683365,0.0014950337,0.000092950344],"about_ca_topic_score_codex":0.000007705061,"about_ca_topic_score_gemma":0.00012951579,"teacher_disagreement_score":0.99252784,"about_ca_system_score_codex":0.00003281295,"about_ca_system_score_gemma":0.000021717648,"threshold_uncertainty_score":0.24762037},"labels":[],"label_agreement":null},{"id":"W1979015928","doi":"10.1109/pimrc.2011.6140009","title":"Distributed cognitive two-way relay beamformer designs under perfect and imperfect CSI","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Cognitive radio; Computer science; Channel state information; Transmitter power output; Node (physics); Beamforming; Transmission (telecommunications); Relay channel; Transceiver; Topology (electrical circuits); Channel (broadcasting); Power (physics); Telecommunications; Mathematics; Wireless; Transmitter; Engineering","score_opus":0.08836958782597408,"score_gpt":0.2907290997865586,"score_spread":0.2023595119605845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979015928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06772926,0.00043154406,0.9092463,0.00020962424,0.00008402869,0.00020497777,0.0000030884553,0.00018436492,0.021906769],"genre_scores_gemma":[0.98310447,0.0003574115,0.015425776,0.00063140225,0.00001982396,0.000022685175,0.000009702905,0.000009107431,0.00041960814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99889004,0.00020764268,0.00018080961,0.00033627395,0.00011842064,0.00026681717],"domain_scores_gemma":[0.99900585,0.00022728006,0.0000534561,0.00043153382,0.00015256011,0.00012932385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037234902,0.00016376405,0.00015755121,0.00006793093,0.00032362132,0.00011849637,0.00045936514,0.000046694273,0.00024866505],"category_scores_gemma":[0.00005514008,0.00013091497,0.00004961808,0.00036769843,0.000105540086,0.00047872978,0.00044099055,0.00018567427,0.000071887436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010427285,0.0004921352,0.015993478,0.000019694327,0.0003092475,0.00001899394,0.011460406,0.00006808524,0.008206726,0.768813,0.0030012266,0.19151272],"study_design_scores_gemma":[0.013146221,0.0035444964,0.42801234,0.00063361845,0.00031858802,0.00055995875,0.0028511246,0.41220146,0.10386227,0.013687826,0.015757956,0.005424127],"about_ca_topic_score_codex":0.000028681843,"about_ca_topic_score_gemma":0.000077587894,"teacher_disagreement_score":0.91537523,"about_ca_system_score_codex":0.000033235454,"about_ca_system_score_gemma":0.00004216794,"threshold_uncertainty_score":0.53385574},"labels":[],"label_agreement":null},{"id":"W1979273203","doi":"10.1109/twc.2014.042814.132093","title":"Performance of Complex Field Network Coding in Multi-Way Relay Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Pairwise error probability; Rayleigh fading; Linear network coding; Computer science; Precoding; Fading; Relay channel; Euclidean distance; Algorithm; Bit error rate; Throughput; Channel (broadcasting); Decoding methods; Telecommunications; Computer network; MIMO; Wireless; Artificial intelligence","score_opus":0.08165077401045481,"score_gpt":0.3030853974244042,"score_spread":0.2214346234139494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979273203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032294087,0.00010556641,0.9631953,0.0021312456,0.00027430416,0.00025372006,0.0000023863174,0.0001353934,0.001607963],"genre_scores_gemma":[0.95980114,0.002836352,0.036672346,0.0004066616,0.000015625017,0.00009993326,0.0000043778255,0.0000146321245,0.00014890601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982395,0.0005060687,0.0005285974,0.00026386796,0.00017390633,0.00028804984],"domain_scores_gemma":[0.99585664,0.0009490382,0.0001666325,0.0027982695,0.00015264575,0.000076786404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263139,0.00017714752,0.0002896567,0.00022209075,0.00060783,0.00005770801,0.0025929576,0.00009378966,0.00002843945],"category_scores_gemma":[0.000015085897,0.00019057296,0.00009455276,0.0010557778,0.00013296815,0.00033644357,0.000055150536,0.0005556335,0.000026429592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048724592,0.0014312072,0.0015701221,0.00006407688,0.00007920373,6.377248e-7,0.0038053503,0.38339067,0.006576055,0.059698783,0.0005111345,0.54282403],"study_design_scores_gemma":[0.00051056244,0.00011980041,0.00169148,0.00020655562,0.000006502755,0.0000027862359,0.000020355043,0.99178153,0.0036090561,0.00003606776,0.0018111543,0.00020415345],"about_ca_topic_score_codex":0.000033391487,"about_ca_topic_score_gemma":0.00047823176,"teacher_disagreement_score":0.9275071,"about_ca_system_score_codex":0.000063373285,"about_ca_system_score_gemma":0.000040388528,"threshold_uncertainty_score":0.77713394},"labels":[],"label_agreement":null},{"id":"W1979467023","doi":"10.1109/vetecf.2010.5594252","title":"Cooperative Communication in Wireless Uplink Transmissions Using Random Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Telecommunications link; Computer science; Computer network; Wireless; Linear network coding; Wireless network; Coding (social sciences); Telecommunications; Network packet","score_opus":0.03924091019797572,"score_gpt":0.30137112525588455,"score_spread":0.26213021505790884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979467023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06729026,0.0002821089,0.92186916,0.0015168965,0.00023326167,0.00031368533,2.8181873e-7,0.00015665492,0.008337713],"genre_scores_gemma":[0.90655506,0.0006791946,0.09216243,0.00040352417,0.000046140296,0.000020449928,0.0000045728734,0.000009584214,0.00011904351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985291,0.00043837418,0.000360146,0.0002665308,0.00012607708,0.0002797925],"domain_scores_gemma":[0.99805427,0.0006055979,0.000078117766,0.0010190328,0.00014253843,0.00010042962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010729627,0.00015129897,0.00022516296,0.00009761523,0.00063401397,0.00022928113,0.0013083408,0.00009893496,0.00013821911],"category_scores_gemma":[0.000060318587,0.00013496749,0.00005255105,0.00090770243,0.00011838973,0.0005242021,0.00036039116,0.0006888457,0.000011792987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031599775,0.0001796675,0.0025044242,0.000006603373,0.000022919414,0.000004014531,0.0031824822,0.008290046,0.05974568,0.84159064,0.00084042107,0.08360153],"study_design_scores_gemma":[0.0011627614,0.000011533157,0.0010732197,0.000078226236,0.0000032803391,0.000007674824,0.000037496608,0.9927116,0.0017527424,0.001054963,0.0018914214,0.00021504893],"about_ca_topic_score_codex":0.000029690553,"about_ca_topic_score_gemma":0.00046937715,"teacher_disagreement_score":0.9844216,"about_ca_system_score_codex":0.00003933085,"about_ca_system_score_gemma":0.00010730679,"threshold_uncertainty_score":0.5503814},"labels":[],"label_agreement":null},{"id":"W1979603721","doi":"10.1109/icc.2014.6884187","title":"AF turbo-coded selective relaying with imperfect channel state information","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Pairwise error probability; Computer science; Turbo code; Phase-shift keying; Relay; Algorithm; Channel state information; Upper and lower bounds; Bit error rate; Signal-to-noise ratio (imaging); Channel (broadcasting); Probability density function; Keying; Decoding methods; Telecommunications; Statistics; Fading; Mathematics; Wireless; Physics","score_opus":0.012835569464585495,"score_gpt":0.22781868416888243,"score_spread":0.21498311470429693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979603721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01757787,0.000040129566,0.95823467,0.0007911788,0.000060450104,0.00016100472,2.4939672e-7,0.00026812265,0.022866335],"genre_scores_gemma":[0.98720336,0.00010796537,0.011440602,0.0010140522,0.000016318065,0.000020117102,0.0000034341213,0.0000044186277,0.00018974618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924576,0.00012298304,0.00015618031,0.00014004161,0.0001470785,0.00018792637],"domain_scores_gemma":[0.99910665,0.00010696308,0.00007771355,0.00043913868,0.00020981995,0.00005972669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037051077,0.00010529308,0.00010338975,0.00009373222,0.00024488298,0.00020733435,0.00047330934,0.000023277546,0.000009629032],"category_scores_gemma":[0.000044871016,0.00007814801,0.000021593374,0.00048336101,0.000021507813,0.0014145096,0.00019326167,0.00014819743,0.0000816141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057570636,0.000054608805,0.0006682962,0.000018676783,0.00006459883,9.1030995e-7,0.018213756,0.007739196,0.00094094797,0.095466174,0.003622215,0.87315303],"study_design_scores_gemma":[0.00082659145,0.0002828947,0.00330797,0.00003854792,0.00000398074,0.000013277439,0.00006963694,0.9763027,0.009592095,0.001202926,0.008030967,0.00032841714],"about_ca_topic_score_codex":0.000010663803,"about_ca_topic_score_gemma":0.000047540667,"teacher_disagreement_score":0.9696255,"about_ca_system_score_codex":0.000044695902,"about_ca_system_score_gemma":0.000040381477,"threshold_uncertainty_score":0.31867835},"labels":[],"label_agreement":null},{"id":"W1979637870","doi":"10.1109/twc.2013.010214.122030","title":"Joint Subcarrier and Power Allocation for Cooperative Communications in LTE-Advanced Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Subcarrier; EnodeB; Throughput; Resource allocation; Computer network; Telecommunications link; Quality of service; Orthogonal frequency-division multiplexing; Transmitter power output; Cellular network; Channel (broadcasting); Mathematical optimization; User equipment; Base station; Wireless; Telecommunications; Transmitter; Mathematics","score_opus":0.04414055211399243,"score_gpt":0.29548613476355473,"score_spread":0.2513455826495623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979637870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036419202,0.0007220029,0.9832217,0.009856856,0.00019291586,0.0009259446,0.000012996519,0.00021122184,0.0012144535],"genre_scores_gemma":[0.9477991,0.0059595965,0.04408944,0.00086333434,0.0000108576705,0.0010569782,0.000029788542,0.000031655276,0.00015923676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975995,0.00078213145,0.0006299083,0.0004687402,0.00016713276,0.00035261185],"domain_scores_gemma":[0.99287486,0.0013520382,0.00018185537,0.005016746,0.00042517442,0.00014932058],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008421178,0.00028323653,0.00035788465,0.00032453839,0.0013502997,0.00022012184,0.0027262694,0.00014121682,0.000009506424],"category_scores_gemma":[0.00004789241,0.00030601755,0.00010697289,0.0009709742,0.0003922895,0.0006766689,0.00010444722,0.00067012815,0.000011464692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005002783,0.0010769749,0.000072809366,0.000019278212,0.00009165444,2.4861586e-7,0.0042763315,0.039705213,0.004162528,0.48815224,0.00022654788,0.46216613],"study_design_scores_gemma":[0.0012557388,0.00018414854,0.00062802405,0.00012875233,0.000017781078,0.0000051125853,0.00018502571,0.9855752,0.0013000232,0.0007129102,0.009589046,0.00041821413],"about_ca_topic_score_codex":0.000019589752,"about_ca_topic_score_gemma":0.0012018054,"teacher_disagreement_score":0.94587,"about_ca_system_score_codex":0.00015033847,"about_ca_system_score_gemma":0.000092474664,"threshold_uncertainty_score":0.9999498},"labels":[],"label_agreement":null},{"id":"W1979658256","doi":"10.1109/ictel.2010.5478874","title":"Power allocation strategies across N orthogonal channels for singe-relay networks at both source and relay","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Computer science; Wireless; Computer network; Channel state information; Multiplexing; Power (physics); Channel (broadcasting); Telecommunications","score_opus":0.020657879439088363,"score_gpt":0.2870750508791656,"score_spread":0.26641717144007726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979658256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15816806,0.00032212088,0.8372765,0.00160208,0.00048991386,0.00023064275,8.9304046e-7,0.00015629573,0.0017534876],"genre_scores_gemma":[0.97925764,0.00011251775,0.016889622,0.00060423755,0.00011027107,0.000038972317,0.000009271397,0.000012805315,0.0029646829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989522,0.00005478567,0.00021396401,0.00034498607,0.00012135308,0.00031270995],"domain_scores_gemma":[0.9988501,0.00024784537,0.000086986714,0.00056112517,0.00015095786,0.00010299815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005571431,0.0001496878,0.00013391762,0.000032317363,0.0006726832,0.0005288414,0.00055246794,0.00010895969,0.00005352128],"category_scores_gemma":[0.000036589183,0.00013027168,0.000047841288,0.0001928177,0.0001069448,0.0005695722,0.000530899,0.00023627878,0.0000082653005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072550545,0.00017732343,0.0017684902,0.000020561787,0.00008176022,0.0000021522505,0.01142316,0.042545382,0.01728222,0.77324384,0.011463856,0.14191872],"study_design_scores_gemma":[0.00052441,0.00010094446,0.0030299309,0.000018787498,0.000003844707,0.000021302281,0.00019413464,0.9095079,0.00048274305,0.00042220938,0.08537183,0.0003220148],"about_ca_topic_score_codex":0.000003305147,"about_ca_topic_score_gemma":0.00036727393,"teacher_disagreement_score":0.8669625,"about_ca_system_score_codex":0.000020279665,"about_ca_system_score_gemma":0.000043942342,"threshold_uncertainty_score":0.53123254},"labels":[],"label_agreement":null},{"id":"W1979710654","doi":"10.1109/ccece.2006.277539","title":"Adaptive Multi-Stream Relaying","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer science; Multiplexing; Computer network; Data stream; Block (permutation group theory); Spatial multiplexing; Relay channel; Bit error rate; Block Error Rate; Telecommunications; MIMO; Telecommunications link; Channel (broadcasting); Mathematics","score_opus":0.05923676934506459,"score_gpt":0.2804288565920013,"score_spread":0.2211920872469367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979710654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001274449,0.00032876703,0.92464453,0.00062914175,0.00006757167,0.000055799024,1.429008e-7,0.00022248476,0.072777145],"genre_scores_gemma":[0.8058783,0.000043239164,0.18967584,0.0002505953,0.000025512842,0.000005896847,9.580334e-7,0.0000028794238,0.0041168076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949265,0.000049551832,0.000108637374,0.00015432466,0.00007388132,0.000120957586],"domain_scores_gemma":[0.9994223,0.00005420711,0.000027628854,0.00040860972,0.000060767692,0.000026477539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010207233,0.00006198035,0.000058074245,0.000038188376,0.00015327404,0.000076290795,0.00050297525,0.000019989544,0.000036267837],"category_scores_gemma":[0.00000840763,0.00005347358,0.000027483658,0.0002410088,0.000018204713,0.0002406211,0.0002475781,0.000076082746,0.000109326065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011730357,0.000084271385,0.001128887,6.5347297e-7,0.0000051025645,0.000003578959,0.00018922868,0.00042121194,0.000998375,0.87632734,0.0058108866,0.11502927],"study_design_scores_gemma":[0.0005050175,0.000039866984,0.015357714,0.000018251887,0.0000021270844,0.0000080379905,0.000043591845,0.9500291,0.0026041917,0.0016546458,0.029464787,0.00027270216],"about_ca_topic_score_codex":0.00002593079,"about_ca_topic_score_gemma":0.00010954638,"teacher_disagreement_score":0.94960785,"about_ca_system_score_codex":0.000023122719,"about_ca_system_score_gemma":0.000017120059,"threshold_uncertainty_score":0.21805893},"labels":[],"label_agreement":null},{"id":"W1979999732","doi":"10.1155/2008/683105","title":"Bandwidth-Efficient Cooperative Relaying Schemes with Multiantenna Relay","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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relay; Retransmission; Decoding methods; Bandwidth (computing); Computer network; Transmission (telecommunications); Spectral efficiency; Electronic engineering; Telecommunications; Power (physics); Channel (broadcasting); Engineering","score_opus":0.031121445228847525,"score_gpt":0.2924665802900789,"score_spread":0.26134513506123136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979999732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08296698,0.020779133,0.8907436,0.0009079751,0.00016932473,0.00019001462,3.8804495e-7,0.00011353064,0.004129016],"genre_scores_gemma":[0.95599174,0.0035947165,0.0395639,0.00058305066,0.00009551931,0.000010497475,6.085601e-7,0.00001993556,0.0001400006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978515,0.00028165415,0.0005065556,0.00041002303,0.00053092686,0.00041933625],"domain_scores_gemma":[0.9985774,0.00023613837,0.00033809498,0.00028838948,0.0004012737,0.00015869434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005955245,0.00026590744,0.00029483144,0.0002815907,0.0012241822,0.00026262816,0.0008954529,0.000048480008,0.000025408635],"category_scores_gemma":[0.00010241896,0.0001942479,0.000054634595,0.0011401132,0.00018745406,0.0016306354,0.00014338233,0.0010302471,0.00001776385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034411508,0.0005739231,0.0066986107,0.00003759492,0.000028523915,0.0011182968,0.008364717,0.34179732,0.0030388965,0.0054230583,0.00010977675,0.6324652],"study_design_scores_gemma":[0.0037318552,0.0009923936,0.0031394702,0.003109499,0.000009860035,0.0029427293,0.0006347299,0.954312,0.004745868,0.00019661004,0.02508001,0.0011049707],"about_ca_topic_score_codex":2.4460968e-7,"about_ca_topic_score_gemma":0.0000039693095,"teacher_disagreement_score":0.87302476,"about_ca_system_score_codex":0.00016108532,"about_ca_system_score_gemma":0.00024129076,"threshold_uncertainty_score":0.94155437},"labels":[],"label_agreement":null},{"id":"W1980203571","doi":"10.1109/sahcn.2007.4292868","title":"Decentralized Multiuser Diversity with Cooperative Relaying in Wireless Sensor Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Aloha; Computer science; Channel (broadcasting); Wireless sensor network; Relay; Cooperative diversity; Wireless; Power (physics); Computer network; Throughput; Topology (electrical circuits); Algorithm; Fading; Mathematics; Telecommunications; Combinatorics; Physics","score_opus":0.029961748846331883,"score_gpt":0.2646808177638834,"score_spread":0.23471906891755154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980203571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21558717,0.000078176265,0.780949,0.00034037058,0.00007929782,0.00018174623,1.2518795e-7,0.00011977018,0.0026643388],"genre_scores_gemma":[0.97284096,0.00032549482,0.025814584,0.0006944258,0.000016874761,0.0000030215222,0.0000017700336,0.0000062547747,0.00029660852],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988337,0.00014175735,0.00020151485,0.0002960689,0.00016841243,0.00035854583],"domain_scores_gemma":[0.9989827,0.0002475646,0.000054293123,0.0004538297,0.00015530355,0.000106283354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005877176,0.00013741158,0.00016563186,0.000093925366,0.00040304006,0.000089604095,0.0006705461,0.000055803524,0.000036285564],"category_scores_gemma":[0.000019147503,0.000109090746,0.000026125084,0.00081662036,0.000057614798,0.00040585376,0.0008283918,0.00025862185,0.000011265632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038965183,0.0005107259,0.5981769,0.000010002291,0.000106291045,0.0003071659,0.014084706,0.023752876,0.0011173643,0.2251049,0.0009806529,0.13545875],"study_design_scores_gemma":[0.003232989,0.00010646726,0.12876861,0.00010680679,0.0000066562,0.000020283898,0.000540336,0.86339945,0.0016752832,0.00002614976,0.0015111346,0.00060582143],"about_ca_topic_score_codex":0.000052555744,"about_ca_topic_score_gemma":0.001955423,"teacher_disagreement_score":0.8396466,"about_ca_system_score_codex":0.00009541658,"about_ca_system_score_gemma":0.000028165034,"threshold_uncertainty_score":0.44485915},"labels":[],"label_agreement":null},{"id":"W1980315494","doi":"10.1109/tvt.2012.2184311","title":"Performance Analysis of Fixed Gain Relay Systems With a Single Interferer in Nakagami- $m$ Fading Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nakagami distribution; Fading; Relay; Interference (communication); Bit error rate; Signal-to-noise ratio (imaging); Outage probability; Co-channel interference; Computer science; Topology (electrical circuits); Electronic engineering; Mathematics; Telecommunications; Electrical engineering; Physics; Engineering; Channel (broadcasting); Power (physics)","score_opus":0.026776517535688032,"score_gpt":0.24420840639099325,"score_spread":0.21743188885530523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980315494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42843217,0.00022746247,0.5707104,0.000188104,0.0001254329,0.00011546138,7.1300116e-7,0.00010550256,0.00009475904],"genre_scores_gemma":[0.9972827,0.00014532128,0.002374185,0.00003159299,0.000006060907,0.00008000245,0.0000010739157,0.000009754005,0.00006932661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989006,0.00011769203,0.00030304052,0.00023981681,0.0001440533,0.00029481473],"domain_scores_gemma":[0.99890965,0.0000711237,0.000109851324,0.0007649505,0.000100095196,0.000044302313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031500385,0.00014518497,0.00032558612,0.0015339057,0.00011326569,0.000025484127,0.0005980967,0.00014536607,0.00000967877],"category_scores_gemma":[0.00000555828,0.00012744454,0.00007307448,0.003839492,0.00009268509,0.00030153553,0.000011267486,0.00034863848,0.000008745988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042642194,0.00085447007,0.0051416005,0.000041178104,0.000756188,0.000007286651,0.0026661863,0.90106565,0.02515898,0.0043333266,0.000009884424,0.05992262],"study_design_scores_gemma":[0.00036931978,0.000266893,0.0006511871,0.00017196343,0.000104053834,0.000020930662,0.00014806411,0.9452072,0.052580904,0.000003855018,0.00025864874,0.00021700919],"about_ca_topic_score_codex":0.0000087190665,"about_ca_topic_score_gemma":0.000046232635,"teacher_disagreement_score":0.5688505,"about_ca_system_score_codex":0.00011451246,"about_ca_system_score_gemma":0.000019399378,"threshold_uncertainty_score":0.51970375},"labels":[],"label_agreement":null},{"id":"W1980321378","doi":"10.1007/s11277-012-0518-5","title":"Performance Analysis of Partial Relay Selection in Cooperative Spectrum Sharing Systems","year":2012,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Cognitive radio; Relay; Fading; Rayleigh fading; Multipath propagation; Cooperative diversity; Nakagami distribution; Wireless; Spectral efficiency; Telecommunications; Computer network; Transmission (telecommunications); Diversity gain; Decoding methods; Power (physics); Channel (broadcasting)","score_opus":0.061660422608293526,"score_gpt":0.3048086807335178,"score_spread":0.24314825812522428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980321378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96132153,0.0022345555,0.032168914,0.000871217,0.00011040588,0.00025263,0.000005862276,0.00009634494,0.0029385483],"genre_scores_gemma":[0.9967836,0.0016544895,0.0012430537,0.000043226955,0.000029984627,0.00008333707,0.000025357329,0.000008381508,0.00012857311],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984572,0.00036853502,0.00044276743,0.00021517613,0.00021494264,0.00030141018],"domain_scores_gemma":[0.99826264,0.00022544451,0.00018612195,0.0010820812,0.00015802443,0.00008565548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008317009,0.00013924036,0.00031533113,0.00046220046,0.00039621917,0.00007876206,0.0017295453,0.000062746934,0.000024786726],"category_scores_gemma":[0.000028341134,0.00014297156,0.00009282559,0.0032060347,0.00011566081,0.00077968586,0.00074534427,0.00035865605,0.000013363422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019894767,0.0006917009,0.59451133,0.000028531134,0.00055895693,2.7820235e-7,0.019486867,0.031048577,0.0033339483,0.344244,0.00006616004,0.006009764],"study_design_scores_gemma":[0.00014131384,0.0000242973,0.11377008,0.0000440891,0.000051874737,0.0000027622962,0.00021758775,0.8847186,0.00024613363,0.0000021730782,0.00064010214,0.0001409619],"about_ca_topic_score_codex":0.0001062793,"about_ca_topic_score_gemma":0.00039745498,"teacher_disagreement_score":0.85367006,"about_ca_system_score_codex":0.00017034792,"about_ca_system_score_gemma":0.00006727906,"threshold_uncertainty_score":0.5830211},"labels":[],"label_agreement":null},{"id":"W1980441554","doi":"10.1109/ccnc.2013.6488495","title":"Power allocation framework for OFDMA-based relay-enhanced cellular networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; Computer science; Telecommunications link; Knapsack problem; Base station; Computer network; Cellular network; Power (physics); Scheme (mathematics); Resource allocation; Mathematical optimization; Mathematics; Algorithm","score_opus":0.02216242944802237,"score_gpt":0.2643897834297087,"score_spread":0.24222735398168632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980441554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022266717,0.00038602133,0.9873799,0.006481659,0.00034370326,0.00054034183,2.1489488e-7,0.00025323476,0.002388217],"genre_scores_gemma":[0.7625461,0.00006676691,0.23378053,0.0025662705,0.000052256895,0.00029574186,0.0000057453703,0.000010146723,0.00067641225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989955,0.00008862219,0.0002330607,0.00029903968,0.00012550234,0.00025831014],"domain_scores_gemma":[0.9982079,0.0004072804,0.0000882261,0.00087627664,0.00033083983,0.00008943574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002343196,0.00013141577,0.00013025799,0.000055602697,0.00024370968,0.00023505255,0.0009020431,0.00010444138,0.000492098],"category_scores_gemma":[0.0000828332,0.00011651591,0.000074838295,0.00039074363,0.000029485309,0.00037236224,0.0001149609,0.00017755291,0.00010273981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007708811,0.00013412129,0.000077055476,0.000008317958,0.00002682629,2.254296e-7,0.00047580161,0.01805579,0.010765018,0.86097807,0.013560784,0.09591029],"study_design_scores_gemma":[0.0002433582,0.00005734979,0.00031009683,0.000043072774,0.0000027658944,1.2324735e-7,0.000017961758,0.97891134,0.012404241,0.0036798173,0.004127483,0.00020239597],"about_ca_topic_score_codex":0.0000039833276,"about_ca_topic_score_gemma":0.0000041561857,"teacher_disagreement_score":0.96085554,"about_ca_system_score_codex":0.000035096364,"about_ca_system_score_gemma":0.000043041913,"threshold_uncertainty_score":0.53881276},"labels":[],"label_agreement":null},{"id":"W1980685205","doi":"10.1109/tsp.2012.2208635","title":"Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parameterized complexity; Mathematics; Mathematical optimization; MIMO; Maximization; Linearization; Relaxation (psychology); Convex optimization; Upper and lower bounds; Polynomial; Eigenvalues and eigenvectors; Semidefinite programming; Algorithm; Regular polygon; Beamforming; Nonlinear system","score_opus":0.048258222088602844,"score_gpt":0.28673939016345396,"score_spread":0.23848116807485112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980685205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014715929,0.0002942106,0.9830531,0.0007137901,0.00013362672,0.00042526054,0.0000022259062,0.00014942049,0.0005124719],"genre_scores_gemma":[0.97907645,0.000024378938,0.020408897,0.00015343945,0.000046538386,0.00010572568,0.000002173737,0.000019994573,0.00016242925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982573,0.0002411028,0.0004759805,0.00030787406,0.00023196451,0.00048577186],"domain_scores_gemma":[0.99904686,0.00012170268,0.00015539634,0.00033413703,0.00018593906,0.00015598886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008333983,0.00018929095,0.0002240799,0.00040927329,0.000479349,0.00015737744,0.00048755374,0.00006576869,0.0000311294],"category_scores_gemma":[0.000010444209,0.00019572675,0.00007323524,0.0015524831,0.000060574683,0.0011006078,0.000015921216,0.00033492385,0.000041079533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060034552,0.0007599122,0.00017134905,0.000063649684,0.00002524612,0.0000011311461,0.0066577718,0.18700646,0.0824263,0.0003994804,0.00007412316,0.72235453],"study_design_scores_gemma":[0.0014327548,0.00024210358,0.0005587877,0.00083282747,0.00003979519,0.00002045519,0.0001817654,0.94210106,0.050627787,0.00008388488,0.0031739618,0.0007048336],"about_ca_topic_score_codex":0.000018561124,"about_ca_topic_score_gemma":0.00009075318,"teacher_disagreement_score":0.9643605,"about_ca_system_score_codex":0.00015245067,"about_ca_system_score_gemma":0.00014652185,"threshold_uncertainty_score":0.79815054},"labels":[],"label_agreement":null},{"id":"W1980787916","doi":"10.1109/twc.2014.012114.120283","title":"An Efficient Clustering Algorithm for Device-to-Device Assisted Virtual MIMO","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Toronto","funders":"","keywords":"Computer science; Cluster analysis; MIMO; Algorithm; Wireless; Computer network; Telecommunications; Artificial intelligence; Channel (broadcasting)","score_opus":0.05453246688514509,"score_gpt":0.31737019718651444,"score_spread":0.26283773030136937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980787916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026165764,0.000057634454,0.9922258,0.0029942857,0.000398135,0.00068711076,0.00002644001,0.00048702367,0.00050694466],"genre_scores_gemma":[0.7491513,0.00013118303,0.24893963,0.0010700979,0.00003332178,0.00049515895,0.000016270562,0.000030212603,0.00013280229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977355,0.00061196747,0.00049572595,0.0005101727,0.00026310218,0.00038351206],"domain_scores_gemma":[0.9936274,0.0009519137,0.00013155659,0.0045780586,0.00042313366,0.00028787978],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00070623396,0.0002719349,0.00029124762,0.00031898328,0.0017608086,0.00031444646,0.004067178,0.00010601781,0.000013368457],"category_scores_gemma":[0.000015326674,0.00029491136,0.00015000977,0.0010122135,0.0001090281,0.0003405412,0.000060947677,0.00041392524,0.00008453015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000805542,0.00059585023,0.0000011990211,0.000005609247,0.000032270396,1.2322492e-7,0.0009903852,0.057664268,0.0027887581,0.0072342055,0.00006255078,0.93061674],"study_design_scores_gemma":[0.0005561484,0.00026643265,0.00013611853,0.000082669765,0.00002247645,0.000005730008,0.00009551915,0.98363584,0.0024425294,0.000026451584,0.012378846,0.0003512292],"about_ca_topic_score_codex":0.0000221569,"about_ca_topic_score_gemma":0.00064938935,"teacher_disagreement_score":0.9302655,"about_ca_system_score_codex":0.00015097731,"about_ca_system_score_gemma":0.00008849805,"threshold_uncertainty_score":0.9999503},"labels":[],"label_agreement":null},{"id":"W1980831670","doi":"10.1109/infcom.2010.5462249","title":"SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Network packet; Computer network; Linear network coding; ENCODE; Unicast; Routing protocol; Distributed computing; Coding (social sciences); Wireless network; Decoding methods; Scheduling (production processes); Wireless; Algorithm","score_opus":0.0420078247864065,"score_gpt":0.28876855821420677,"score_spread":0.24676073342780028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980831670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021703072,0.00006550554,0.9606862,0.002500449,0.0012722518,0.00023014194,0.0000010042055,0.0003425592,0.013198812],"genre_scores_gemma":[0.9758881,0.00069952704,0.020953769,0.0014702104,0.0002844608,0.0000138850455,0.000017980057,0.000012422938,0.0006596544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853903,0.00013504778,0.0003778893,0.00035346585,0.00015792946,0.0004366562],"domain_scores_gemma":[0.99835384,0.0003100102,0.000089967914,0.0009913507,0.00009804822,0.00015677065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007118582,0.00016966074,0.00022627435,0.000088397945,0.00021698627,0.00018962554,0.001429982,0.00009917637,0.00016732655],"category_scores_gemma":[0.00005524009,0.00015883823,0.000051216866,0.0008058557,0.000060391572,0.00031723522,0.0006998476,0.0006850121,0.000019801473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025140137,0.000062716004,0.0027025428,0.000001881222,0.0000053544445,0.00001278378,0.0000754965,0.00035055834,0.0004305601,0.8929067,0.0026481343,0.10080073],"study_design_scores_gemma":[0.0002661282,0.000018795756,0.005430438,0.000036715603,0.000002204225,0.000012340168,0.000012292756,0.9871343,0.000022568387,0.0008973109,0.0059303166,0.00023662997],"about_ca_topic_score_codex":0.000012050531,"about_ca_topic_score_gemma":0.0021778673,"teacher_disagreement_score":0.9867837,"about_ca_system_score_codex":0.00002887771,"about_ca_system_score_gemma":0.00007880386,"threshold_uncertainty_score":0.6477235},"labels":[],"label_agreement":null},{"id":"W1980876816","doi":"10.1145/1873951.1873979","title":"Tenor","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Linear network coding; Fountain code; Coding (social sciences); Telecommunications link; Software deployment; Computer network; Bandwidth (computing); Distributed computing; Decoding methods; Telecommunications; Operating system; Concatenated error correction code; Block code","score_opus":0.026912759499585822,"score_gpt":0.2747609900027743,"score_spread":0.2478482305031885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980876816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012255605,0.00003306902,0.7043747,0.006150787,0.00037555557,0.00004168966,3.766658e-8,0.00026116436,0.2765074],"genre_scores_gemma":[0.9180436,0.000020052335,0.078528,0.00084697036,0.000026165268,0.0000024398014,1.4546497e-7,0.000001095075,0.0025315336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997894,0.000009917332,0.00003969406,0.00006770063,0.000037520058,0.000055753077],"domain_scores_gemma":[0.99948704,0.000023933146,0.000007453445,0.00042093653,0.000032506217,0.000028156388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008191424,0.000023775385,0.000024132105,0.000016309321,0.000067816254,0.000058533904,0.0005551708,0.0000110399105,0.0002133731],"category_scores_gemma":[0.000015845826,0.000018377214,0.000010592212,0.00011660056,0.000010914032,0.00012785954,0.00018162852,0.00008779345,0.00018296868],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.906093e-8,0.0000064281144,0.00015223754,1.0390785e-7,6.115575e-7,2.0689225e-7,0.00005236176,3.6195755e-7,0.010040892,0.82727605,0.002561821,0.15990886],"study_design_scores_gemma":[0.0001700767,0.000018004777,0.010438296,0.0000019536005,5.96558e-7,0.000012140797,0.0000058650116,0.094870694,0.009296293,0.004548727,0.8804705,0.0001668527],"about_ca_topic_score_codex":7.3101296e-7,"about_ca_topic_score_gemma":0.000042870488,"teacher_disagreement_score":0.905788,"about_ca_system_score_codex":0.0000014707513,"about_ca_system_score_gemma":0.000010919721,"threshold_uncertainty_score":0.23517533},"labels":[],"label_agreement":null},{"id":"W1981059249","doi":"10.1109/qbsc.2014.6841215","title":"Random Linear Network Coding for converge-cast Smart Grid wireless networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear network coding; Computer science; Decoding methods; Computer network; Telecommunications link; Smart grid; Distributed computing; Coding (social sciences); Wireless; Wireless network; Network packet; Telecommunications; Engineering","score_opus":0.02944950237657513,"score_gpt":0.26266380298679265,"score_spread":0.23321430061021753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981059249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005191115,0.00019718596,0.9899506,0.0019091936,0.0015737053,0.00037982003,6.5312145e-7,0.00030583306,0.005163898],"genre_scores_gemma":[0.93131787,0.0007620003,0.061045572,0.0034992117,0.0016872451,0.00010674345,0.00002365837,0.000027091735,0.0015306096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983716,0.00024695715,0.00036434748,0.00038977977,0.00014872567,0.0004786011],"domain_scores_gemma":[0.99764097,0.0010245166,0.00011865996,0.0008537412,0.000217022,0.00014509053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001262607,0.00019799625,0.00031646993,0.00004636147,0.0005667185,0.00020042053,0.0011546218,0.00008360636,0.00004762785],"category_scores_gemma":[0.00008030232,0.00017519569,0.00013091226,0.000425043,0.000056544184,0.0002849055,0.00046345955,0.00020095125,0.000039245853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009429211,0.000049782677,0.0008970312,0.000014322816,0.00005047028,8.054588e-7,0.00019949576,0.019166216,0.00008313853,0.82801104,0.043665472,0.107767925],"study_design_scores_gemma":[0.0014073243,0.00006896535,0.00015002358,0.00003803947,0.0000064104893,0.0000032832568,0.0000049205887,0.88884854,0.00010277137,0.00036264543,0.108783826,0.00022325592],"about_ca_topic_score_codex":0.0000039436145,"about_ca_topic_score_gemma":0.000060556507,"teacher_disagreement_score":0.93079877,"about_ca_system_score_codex":0.000029079049,"about_ca_system_score_gemma":0.000032273343,"threshold_uncertainty_score":0.7144273},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022019181504354182,"score_gpt":0.2610998891457004,"score_spread":0.23908070764134626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981093646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11028167,0.00017546928,0.8829154,0.005809604,0.0003539736,0.00020382457,2.1068611e-7,0.00015448351,0.000105399784],"genre_scores_gemma":[0.96034175,0.000015772945,0.03621256,0.0030864868,0.00021966535,0.00004778605,0.000002885895,0.000016656299,0.00005642441],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989062,0.000073787385,0.00024350922,0.0003711946,0.00014559846,0.00025970957],"domain_scores_gemma":[0.9992406,0.00010011191,0.00014650353,0.00024940431,0.00018183255,0.000081541315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059455924,0.00015160596,0.00013291604,0.00009753829,0.00055644946,0.00037965336,0.00035369387,0.00007138895,0.000008139936],"category_scores_gemma":[0.000026844522,0.00014545968,0.000042503372,0.00033663635,0.000067058834,0.0006106315,0.000067461115,0.00041537848,0.0000039192123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018152565,0.000040651714,0.00014969829,0.000020335925,0.000017063103,0.0000011743708,0.0009906687,0.030605873,0.748997,0.0027130311,0.0040184837,0.2124279],"study_design_scores_gemma":[0.00041286388,0.00005377464,0.0005647971,0.00005705141,0.000008562259,0.000023878636,0.0000063201524,0.98535126,0.009957409,0.000087195476,0.003234955,0.00024194531],"about_ca_topic_score_codex":0.0000032364014,"about_ca_topic_score_gemma":0.00002788181,"teacher_disagreement_score":0.95474535,"about_ca_system_score_codex":0.00003468819,"about_ca_system_score_gemma":0.000046562556,"threshold_uncertainty_score":0.59316736},"labels":[],"label_agreement":null},{"id":"W1981179989","doi":"10.1007/s11276-012-0421-8","title":"Optimal reliable relay selection in multiuser cooperative relaying networks","year":2012,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Carleton University","funders":"","keywords":"Relay; Computer science; Computer network; Node (physics); Network packet; Relay channel; Throughput; Wireless; Telecommunications","score_opus":0.023530745394003693,"score_gpt":0.2655602054773028,"score_spread":0.24202946008329912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981179989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10415828,0.0032080638,0.88908756,0.0003398519,0.00083602854,0.00037845763,2.6765866e-7,0.00033250233,0.0016589975],"genre_scores_gemma":[0.9815397,0.0021636384,0.014563034,0.0004779333,0.00048479412,0.00010714798,0.000010439091,0.00003741223,0.0006158627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973217,0.00043906548,0.0005337698,0.000495459,0.00023547353,0.00097447814],"domain_scores_gemma":[0.99851966,0.00028268865,0.00017161075,0.0006119044,0.00018658933,0.0002275648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011607659,0.00031911914,0.00035890884,0.00017024034,0.0005167104,0.00022349722,0.00093334407,0.00027009004,0.000050827355],"category_scores_gemma":[0.00004407868,0.0003168773,0.00008382234,0.0017734553,0.00007113089,0.0014592765,0.0005692254,0.0010730642,0.00004300565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023769728,0.00014563116,0.017314324,0.000003194267,0.000021586777,0.000003651238,0.0010485278,0.9358356,0.00012257295,0.021526344,0.0028430806,0.021111727],"study_design_scores_gemma":[0.00059545005,0.0000448065,0.0075954245,0.00010987789,0.0000060221923,0.00001730656,0.00005172819,0.9861469,0.00010844508,0.0000044074213,0.0049302224,0.0003893799],"about_ca_topic_score_codex":0.000027714206,"about_ca_topic_score_gemma":0.0001182504,"teacher_disagreement_score":0.87738144,"about_ca_system_score_codex":0.00024466554,"about_ca_system_score_gemma":0.000056508372,"threshold_uncertainty_score":0.99992836},"labels":[],"label_agreement":null},{"id":"W1981203331","doi":"10.1109/wcnc.2010.5506613","title":"On the Performance of Pilot Symbol Assisted Modulation for Cooperative Systems with Imperfect Channel Estimation","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Fading; Computer science; Channel (broadcasting); Relay; Bit error rate; Phase-shift keying; Algorithm; Modulation (music); Channel state information; Electronic engineering; Telecommunications; Wireless; Engineering; Power (physics)","score_opus":0.040422606152616676,"score_gpt":0.2683761616989995,"score_spread":0.22795355554638286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981203331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45817447,0.000011552562,0.5396269,0.00054567575,0.00014110947,0.0006092076,0.0000011294665,0.00005416967,0.0008357654],"genre_scores_gemma":[0.99547,0.00001159006,0.0040347218,0.000100481644,0.000021833335,0.00016468913,0.000005987994,0.0000064254587,0.00018427923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993134,0.00008445242,0.00017698103,0.00016569845,0.00014844585,0.00011103005],"domain_scores_gemma":[0.9985095,0.00044073348,0.00011296763,0.0005403239,0.00036956818,0.000026875658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004573282,0.00010119751,0.00011861462,0.000053357413,0.00030101638,0.000101652724,0.0004442475,0.000025986075,0.000008513888],"category_scores_gemma":[0.00007318778,0.000056773468,0.000019911642,0.00029519218,0.000046883655,0.00028962156,0.000057817775,0.00012928294,0.0000053348977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115668954,0.00018701096,0.00014842369,0.00004362413,0.000047671052,1.2003322e-7,0.0010941201,0.12456101,0.03484576,0.81774384,0.0005552004,0.020657578],"study_design_scores_gemma":[0.00030006457,0.0006908438,0.0024907116,0.0000487035,0.0000032424596,0.000003384338,0.000021315158,0.98981947,0.0064610746,0.000043435153,0.000031419106,0.00008632658],"about_ca_topic_score_codex":0.000004933338,"about_ca_topic_score_gemma":0.000028223585,"teacher_disagreement_score":0.86525846,"about_ca_system_score_codex":0.000017195522,"about_ca_system_score_gemma":0.00004632932,"threshold_uncertainty_score":0.23152049},"labels":[],"label_agreement":null},{"id":"W1981377771","doi":"10.1155/2007/56592","title":"A Cross-Layer Optimization Approach for Energy Efficient Wireless Sensor Networks: Coalition-Aided Data Aggregation, Cooperative Communication, and Energy Balancing","year":2007,"lang":"en","type":"article","venue":"Advances in Multimedia","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless sensor network; Computer network; Computer science; Efficient energy use; Sink (geography); Energy consumption; Data aggregator; Cross-layer optimization; Data transmission; Node (physics); Key distribution in wireless sensor networks; Transmission (telecommunications); Distributed computing; Wireless; Wireless network; Engineering; Telecommunications","score_opus":0.028601166805770736,"score_gpt":0.31473655887386803,"score_spread":0.2861353920680973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981377771","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006225037,0.008945036,0.989178,0.00015051622,0.00018343898,0.00022951652,0.000013959523,0.00009731167,0.0005797295],"genre_scores_gemma":[0.45855257,0.009236303,0.5308129,0.00039407567,0.000092885755,0.000099887584,0.00068718934,0.000018917723,0.00010525714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979307,0.00026923773,0.0005880638,0.00063209236,0.00021076507,0.00036914705],"domain_scores_gemma":[0.996409,0.0013124624,0.00025470904,0.0013901509,0.0005221599,0.00011152759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012766675,0.00022459035,0.0002691938,0.0001565275,0.0004899841,0.00022057214,0.0013157814,0.00010285368,0.000007035324],"category_scores_gemma":[0.00029240843,0.00022397748,0.000027004846,0.00075061264,0.00022392506,0.0012112185,0.00070446794,0.00016112818,3.560928e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003076479,0.00010083067,0.00088115624,0.00000984005,0.00001183964,8.4651725e-7,0.00062908255,0.85939515,0.000057291712,0.017514493,0.00007496594,0.12129374],"study_design_scores_gemma":[0.001023426,0.000023267296,0.00031328574,0.000070915965,0.000005275133,0.0000048405664,0.00013711004,0.9933463,0.00037131022,0.000048556325,0.0043906732,0.00026505062],"about_ca_topic_score_codex":0.000036182366,"about_ca_topic_score_gemma":0.00039787483,"teacher_disagreement_score":0.45836505,"about_ca_system_score_codex":0.000096032745,"about_ca_system_score_gemma":0.000061501116,"threshold_uncertainty_score":0.9133536},"labels":[],"label_agreement":null},{"id":"W1981729625","doi":"10.1109/glocom.2013.6831527","title":"Improving data rate in relay-aided power line communications using network coding","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Power-line communication; Computer science; Linear network coding; Computer network; Coding (social sciences); Data exchange; Communications system; Scheme (mathematics); Real-time computing; Power (physics); Database","score_opus":0.144279155286698,"score_gpt":0.335535952483201,"score_spread":0.19125679719650301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981729625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011155958,0.0015169771,0.97483414,0.005470329,0.00025984598,0.00046975492,0.0000013673384,0.00024907725,0.006042535],"genre_scores_gemma":[0.76048255,0.0006203741,0.23742488,0.0011510022,0.000039257626,0.00001629677,0.000019950769,0.000011701665,0.00023398998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824494,0.00043694302,0.00045051894,0.0003933409,0.00011578664,0.0003584624],"domain_scores_gemma":[0.99408257,0.0004559474,0.00014122925,0.00507231,0.00015966702,0.000088279645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012291924,0.00014766124,0.00019007911,0.00010491834,0.00041635442,0.0004096393,0.005024133,0.00005718433,0.00012668471],"category_scores_gemma":[0.00018045903,0.00013979078,0.00002751438,0.0009680923,0.00006779219,0.001718868,0.006564619,0.00036204397,0.00008762967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011472392,0.0005283516,0.009578772,0.00003202258,0.000103853556,0.000012091139,0.003153913,0.02415186,0.046873998,0.5790046,0.02496062,0.31158847],"study_design_scores_gemma":[0.0002328211,0.000014171077,0.0013897226,0.000057161655,0.0000026212613,0.0000031969585,0.00004375761,0.9949134,0.00006380439,0.000421948,0.0026722257,0.00018514149],"about_ca_topic_score_codex":0.00021011711,"about_ca_topic_score_gemma":0.000478289,"teacher_disagreement_score":0.9707616,"about_ca_system_score_codex":0.00007467118,"about_ca_system_score_gemma":0.00009026668,"threshold_uncertainty_score":0.93361723},"labels":[],"label_agreement":null},{"id":"W1981874147","doi":"10.1109/wcnc.2012.6214432","title":"On achievable rate and ergodic capacity of non-symmetric half-duplex NAF relay channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Ergodic theory; Relay; Rayleigh fading; Upper and lower bounds; Transmission (telecommunications); Topology (electrical circuits); Channel (broadcasting); Channel capacity; Computer science; Power (physics); Mathematics; Fading; Mathematical optimization; Telecommunications; Physics; Mathematical analysis; Combinatorics","score_opus":0.050402850463475,"score_gpt":0.2713072987262886,"score_spread":0.2209044482628136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981874147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7505892,0.0010003755,0.2268031,0.0014562254,0.00047590624,0.0002354016,7.12286e-7,0.000107863634,0.019331252],"genre_scores_gemma":[0.9903911,0.00040380209,0.0077702054,0.0004869,0.00003799137,0.000008120319,9.058143e-7,0.000005607491,0.0008953907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990851,0.00016188013,0.00018811817,0.00018172571,0.00013403602,0.00024908353],"domain_scores_gemma":[0.9988,0.0003192335,0.00007864816,0.0005884202,0.00009101719,0.00012272819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079114566,0.00011258189,0.0001649993,0.00018502255,0.0001665746,0.00005771565,0.00049037463,0.00004626025,0.000053896776],"category_scores_gemma":[0.00011037858,0.000091874506,0.00003491559,0.00078122306,0.00005370725,0.00042960842,0.00034699295,0.00015455957,0.000049317758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018994639,0.0003739882,0.002429592,0.000030802847,0.000042771924,8.491157e-7,0.0029131304,0.00065972086,0.009186844,0.92926604,0.0050617615,0.05001553],"study_design_scores_gemma":[0.002003617,0.00069709495,0.061776597,0.00017801621,0.000023466075,0.00002524257,0.00008652367,0.842814,0.06537462,0.0015335719,0.024519503,0.0009677288],"about_ca_topic_score_codex":0.000024628369,"about_ca_topic_score_gemma":0.0000096773765,"teacher_disagreement_score":0.92773247,"about_ca_system_score_codex":0.000024987341,"about_ca_system_score_gemma":0.00001766199,"threshold_uncertainty_score":0.37465337},"labels":[],"label_agreement":null},{"id":"W1981968026","doi":"10.1109/icc.2012.6363713","title":"Selective relaying in multi-relay networks with feedback delays and adaptive modulation","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; Nakagami distribution; Link adaptation; Upper and lower bounds; Cumulative distribution function; Computer science; Fading; Quadrature amplitude modulation; Modulation (music); Topology (electrical circuits); Signal-to-noise ratio (imaging); Control theory (sociology); Spectral efficiency; Bit error rate; Monte Carlo method; Relay channel; Channel (broadcasting); Mathematics; Telecommunications; Probability density function; Statistics; Physics","score_opus":0.04858138494947434,"score_gpt":0.2669068044146691,"score_spread":0.21832541946519474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981968026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050798524,0.0007741926,0.9455735,0.00017127571,0.0000497073,0.00018554094,8.1273214e-8,0.00007380771,0.0023733862],"genre_scores_gemma":[0.8896335,0.00017613445,0.1098475,0.00017616837,0.000021215668,0.000018324634,0.0000010381558,0.0000067958026,0.00011931476],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991514,0.00014824915,0.00014639634,0.00020516441,0.00008913649,0.00025963094],"domain_scores_gemma":[0.99938065,0.00012845217,0.000055613164,0.00026758254,0.000085538406,0.00008216808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033394105,0.000113513874,0.00011438486,0.000083449864,0.00015628169,0.000060512346,0.00021589441,0.000051905092,0.0000056779754],"category_scores_gemma":[0.00001537841,0.00009188456,0.000012936879,0.000558705,0.000034453125,0.0008713194,0.00020812349,0.000220099,0.0000061097794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009876506,0.0003913276,0.32681587,0.000007018338,0.00008111668,0.000003505887,0.016673472,0.24226023,0.00045436175,0.19106117,0.0003815151,0.22177163],"study_design_scores_gemma":[0.0003928902,0.000039207847,0.18413173,0.000025000123,0.0000016793517,0.000005721771,0.00007311751,0.8150865,0.000039971193,0.000020260659,0.00006027838,0.00012369735],"about_ca_topic_score_codex":0.000019868898,"about_ca_topic_score_gemma":0.0002690608,"teacher_disagreement_score":0.838835,"about_ca_system_score_codex":0.00007112421,"about_ca_system_score_gemma":0.000018324276,"threshold_uncertainty_score":0.37469435},"labels":[],"label_agreement":null},{"id":"W1982067419","doi":"10.1109/tit.2013.2241818","title":"On the Optimal Compressions in the Compress-and-Forward Relay Schemes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decodes; Decoding methods; Relay; Computer science; Joint (building); Relay channel; Data compression; Compression (physics); Sequential decoding; Process (computing); Algorithm; List decoding; Theoretical computer science; Block code; Engineering","score_opus":0.019785315122957614,"score_gpt":0.24703301184276796,"score_spread":0.22724769671981035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982067419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016837696,0.000039204315,0.9699339,0.0059243655,0.0001575325,0.0004306882,0.0000029618982,0.000081184364,0.0065924567],"genre_scores_gemma":[0.9938194,0.00012662681,0.0012400735,0.004464582,0.0000071904105,0.00022075762,0.0000016570413,0.0000033455744,0.00011633703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887073,0.00041275378,0.00026677086,0.00009419117,0.00020815882,0.000147424],"domain_scores_gemma":[0.99789417,0.0012742672,0.00007559741,0.0006430409,0.0000752135,0.00003771315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006520568,0.00011529047,0.00008691514,0.00013507369,0.0006427827,0.00031053342,0.0008532505,0.000044730125,0.00020064614],"category_scores_gemma":[0.00002156837,0.000064662796,0.000048386675,0.0003357227,0.0001060614,0.001229047,0.000011246545,0.00043946007,0.00030266558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019046889,0.000084375526,0.0000024126373,0.0000048390366,0.000018243893,1.7274311e-7,0.009516767,0.031259697,0.0000519676,0.7979029,0.0026463964,0.1584932],"study_design_scores_gemma":[0.0012348221,0.0002251512,0.0014027676,0.00021195332,0.000015917727,0.000024369843,0.00364857,0.9347857,0.0044293073,0.018297672,0.035222728,0.0005010325],"about_ca_topic_score_codex":0.0000045256656,"about_ca_topic_score_gemma":0.0000031659401,"teacher_disagreement_score":0.97698176,"about_ca_system_score_codex":0.000023538065,"about_ca_system_score_gemma":0.000020802056,"threshold_uncertainty_score":0.494383},"labels":[],"label_agreement":null},{"id":"W1982083514","doi":"10.1109/isspit.2007.4458084","title":"Analysis of a Distributed Coded Cooperation Scheme for Multi-Relay Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Code word; Maximal-ratio combining; Node (physics); Transmission (telecommunications); Algorithm; Phase-shift keying; Decoding methods; Relay channel; Topology (electrical circuits); Diversity gain; Linear network coding; Convolutional code; Computer network; Mathematics; Telecommunications; Fading; Bit error rate; Network packet; Physics","score_opus":0.08100996877047649,"score_gpt":0.343311183254534,"score_spread":0.2623012144840575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982083514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013377369,0.00009611875,0.98569196,0.00031770804,0.00007390858,0.00020304373,0.000008106664,0.000072532755,0.00015924133],"genre_scores_gemma":[0.83635837,0.00003323117,0.16303672,0.0001711283,0.000012306573,0.000013688498,0.00008072247,0.0000029764763,0.0002908565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922395,0.00003785511,0.00029457966,0.00018646111,0.00009669654,0.0001604791],"domain_scores_gemma":[0.99878454,0.00017286671,0.000089276444,0.00045972673,0.0004377489,0.000055825178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068648846,0.00007822,0.00018613091,0.00019929002,0.0001281669,0.0000529811,0.00047947787,0.000040197694,0.000028655824],"category_scores_gemma":[0.00010876321,0.000068733534,0.00010032333,0.0017092397,0.000025598929,0.00018100822,0.00013237551,0.000049031194,0.000003036367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089191744,0.0008865296,0.0064297817,0.000025935124,0.0017619944,0.0000018736853,0.0033818355,0.03119437,0.06414299,0.80773157,0.0026665502,0.08168736],"study_design_scores_gemma":[0.00040109092,0.00003133032,0.002483616,0.0000049155665,0.000036460628,2.0115677e-7,0.000018320006,0.9843427,0.010726144,0.00000773534,0.0018579299,0.00008959021],"about_ca_topic_score_codex":0.000005511827,"about_ca_topic_score_gemma":0.00023221169,"teacher_disagreement_score":0.9531483,"about_ca_system_score_codex":0.000029990106,"about_ca_system_score_gemma":0.000025716978,"threshold_uncertainty_score":0.28028724},"labels":[],"label_agreement":null},{"id":"W1982293579","doi":"10.1109/isit.2012.6283957","title":"On densifying coding opportunities in instantly decodable network coding graphs","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Coding (social sciences); Computer science; Shannon–Fano coding; Computer network; Variable-length code; Theoretical computer science; Decoding methods; Telecommunications; Mathematics","score_opus":0.1289542820507901,"score_gpt":0.30144491181614147,"score_spread":0.17249062976535137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982293579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17776054,0.0037000007,0.55953264,0.0027514922,0.0021303806,0.00058673957,0.0000011042831,0.000869177,0.25266793],"genre_scores_gemma":[0.98421824,0.0017723962,0.011372917,0.002084726,0.000067540226,0.000017190761,0.0000022722616,0.000011814103,0.00045288756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998423,0.00021848574,0.0003220882,0.00022539705,0.00020157851,0.00060945004],"domain_scores_gemma":[0.9986128,0.00048705516,0.0000843056,0.0005931477,0.00006590537,0.0001567886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011001318,0.00017043862,0.00020311271,0.000214645,0.0003892389,0.00019119232,0.0007241531,0.000046345674,0.000083903],"category_scores_gemma":[0.00007260786,0.00016011226,0.000051492556,0.00074108905,0.00003961206,0.0009438689,0.00044510714,0.00026099716,0.0000387382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040383393,0.000039723298,0.0054539857,0.0000042893134,0.00000675572,0.0000054243915,0.000645342,0.00043137104,0.000102398626,0.9705794,0.0023105186,0.020416794],"study_design_scores_gemma":[0.0039369822,0.000410512,0.038214497,0.0022053993,0.00003157896,0.00016488245,0.0029838814,0.7893424,0.004562826,0.054862764,0.099432334,0.0038519138],"about_ca_topic_score_codex":0.000008925112,"about_ca_topic_score_gemma":0.000069483875,"teacher_disagreement_score":0.9157166,"about_ca_system_score_codex":0.00009262609,"about_ca_system_score_gemma":0.00004730411,"threshold_uncertainty_score":0.6529189},"labels":[],"label_agreement":null},{"id":"W1982402813","doi":"10.1109/vtcfall.2012.6399150","title":"Analytical Study of Multi-Antenna Relaying Systems in the Presence of Co-Channel Interference","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Interference (communication); Transmission (telecommunications); Channel (broadcasting); Outage probability; Computer science; Topology (electrical circuits); Maximal-ratio combining; Antenna (radio); Power (physics); Co-channel interference; Electronic engineering; Signal-to-noise ratio (imaging); Telecommunications; Electrical engineering; Engineering; Fading; Physics","score_opus":0.15872033250895368,"score_gpt":0.3597661698131076,"score_spread":0.20104583730415393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982402813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5372286,0.0009423753,0.45880207,0.00017373633,0.00021068398,0.0005157089,4.808087e-7,0.000027158272,0.0020991925],"genre_scores_gemma":[0.999383,0.000053008167,0.00044793217,0.000028124907,0.000009259765,0.000015849731,1.8397373e-7,0.0000020733899,0.000060600556],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998723,0.00048110617,0.00033840226,0.00012115474,0.00018393998,0.00015243232],"domain_scores_gemma":[0.99859965,0.0004688686,0.000097021286,0.0006964875,0.000106083506,0.000031891235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011575505,0.00006973702,0.00016289197,0.000084261046,0.000047301754,0.00003054401,0.001260294,0.000020538595,0.0000044606118],"category_scores_gemma":[0.00013479889,0.00004399208,0.000023579947,0.00046703583,0.000046253546,0.0002743078,0.00035163903,0.00013858908,0.000003588701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004716876,0.007812804,0.42887104,0.00011387975,0.0001243625,0.0000070907213,0.2629242,0.0030676133,0.0036165412,0.2805528,0.0008215072,0.012040977],"study_design_scores_gemma":[0.00032374403,0.00013223587,0.03586002,0.00007671303,0.000004061989,0.0000032366083,0.008375366,0.9550046,0.00010968899,0.000008015829,0.0000261919,0.00007614909],"about_ca_topic_score_codex":0.00009251542,"about_ca_topic_score_gemma":0.00006608815,"teacher_disagreement_score":0.95193696,"about_ca_system_score_codex":0.0000122403335,"about_ca_system_score_gemma":0.000013718397,"threshold_uncertainty_score":0.23419608},"labels":[],"label_agreement":null},{"id":"W1982622847","doi":"10.1049/iet-com.2010.1118","title":"Impact of outdated channel information on the bit error rate performance for amplify-and-forward selective relaying systems","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Bit error rate; Rayleigh fading; Channel (broadcasting); Relay; Computer science; Diversity gain; Moment-generating function; Selection (genetic algorithm); Telecommunications; Signal-to-noise ratio (imaging); Algorithm; Fading; Diversity combining; Mutual information; Bit (key); Maximal-ratio combining; Electronic engineering; Mathematics; Statistics; Computer network; Probability density function; Engineering; Physics; Artificial intelligence; Power (physics)","score_opus":0.09509874779527124,"score_gpt":0.33413659698094045,"score_spread":0.23903784918566923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982622847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48849282,0.004302481,0.47371316,0.0127703175,0.0007346592,0.0047166,0.00014257156,0.0005439459,0.014583448],"genre_scores_gemma":[0.9966442,0.0010832702,0.0017096286,0.00018308178,0.000019645337,0.00026931224,0.000044869794,0.0000072291673,0.000038790455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989015,0.00034142612,0.00033749736,0.000087558765,0.000105116604,0.00022690892],"domain_scores_gemma":[0.9965782,0.0009565919,0.00027440247,0.0017539806,0.00037093685,0.00006588993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169462,0.00012598858,0.00015851436,0.00012145787,0.0007607486,0.00011971736,0.0014629703,0.00005353896,0.0000022949714],"category_scores_gemma":[0.00020480138,0.00008918643,0.000065726876,0.0005217542,0.00009319838,0.0011530452,0.00051400496,0.00025233068,0.000019684132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013046374,0.00062040304,0.012596577,0.000121992816,0.0005702942,3.132898e-8,0.051581215,0.010950086,0.0016718894,0.8618225,0.01285018,0.047084402],"study_design_scores_gemma":[0.0005068365,0.0002587604,0.05282181,0.00014219426,0.000024367659,0.0000060152393,0.0004695151,0.9325834,0.00029852812,0.00019507548,0.012427664,0.00026584722],"about_ca_topic_score_codex":0.000025614398,"about_ca_topic_score_gemma":0.000005992569,"teacher_disagreement_score":0.9216333,"about_ca_system_score_codex":0.00008958247,"about_ca_system_score_gemma":0.00006457873,"threshold_uncertainty_score":0.585114},"labels":[],"label_agreement":null},{"id":"W1982695909","doi":"10.1049/iet-com.2013.1035","title":"Iterative interference cancellation in multiuser relaying with fast frequency‐hopping modulation","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Saskatchewan","funders":"","keywords":"Frequency-hopping spread spectrum; Single antenna interference cancellation; Interference (communication); Modulation (music); Computer science; Co-channel interference; Telecommunications; Electronic engineering; Physics; Acoustics; Decoding methods; Channel (broadcasting)","score_opus":0.04831355730042087,"score_gpt":0.29015028176768287,"score_spread":0.241836724467262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982695909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026690653,0.0003328691,0.9500096,0.0051152827,0.000076001576,0.00031736016,0.0000014523953,0.00017850091,0.017278276],"genre_scores_gemma":[0.8981383,0.0003473355,0.10100693,0.00027925838,0.000016877653,0.000085385895,0.000023548848,0.00001047881,0.00009188677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984572,0.0005514018,0.0003512707,0.00029075073,0.00014596428,0.00020341687],"domain_scores_gemma":[0.99675614,0.00040740354,0.00016913854,0.0023537131,0.00025619238,0.000057406734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046506763,0.0001526048,0.00016480198,0.00019407598,0.0004380382,0.00019681753,0.0018150429,0.000054564203,0.0000112440375],"category_scores_gemma":[0.00010031532,0.00014554331,0.000028902019,0.0008451192,0.000102364014,0.00087230594,0.0005716212,0.0003776883,0.000024161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016538537,0.0002691459,0.042650048,0.00001921483,0.00004245328,0.0000012294669,0.02813101,0.021159219,0.009938556,0.5909246,0.00016942044,0.30667853],"study_design_scores_gemma":[0.00043788328,0.00005238132,0.031696018,0.00023853629,0.0000033941562,0.0000037817617,0.0001322855,0.9633724,0.00016605713,0.0016990432,0.001953546,0.00024464764],"about_ca_topic_score_codex":0.000081084065,"about_ca_topic_score_gemma":0.003154376,"teacher_disagreement_score":0.94221324,"about_ca_system_score_codex":0.00015342006,"about_ca_system_score_gemma":0.00006384484,"threshold_uncertainty_score":0.59350836},"labels":[],"label_agreement":null},{"id":"W1982754822","doi":"10.1109/tsp.2014.2345636","title":"Single-Carrier Equalization for Asynchronous Two-Way Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Transceiver; Computer science; Intersymbol interference; Relay channel; Asynchronous communication; Beamforming; Equalization (audio); Transmission (telecommunications); Channel (broadcasting); Transmitter power output; Computer network; Topology (electrical circuits); Electronic engineering; Telecommunications; Power (physics); Transmitter; Wireless; Engineering; Electrical engineering","score_opus":0.044282820323172954,"score_gpt":0.28515896642854227,"score_spread":0.2408761461053693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982754822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069106265,0.00024307596,0.9970713,0.00036320818,0.00030496207,0.00025152694,0.0000016481108,0.00029331943,0.0007798657],"genre_scores_gemma":[0.9746003,0.000031168383,0.02421307,0.0007073767,0.00014471922,0.00008211454,0.000003935568,0.000027008242,0.00019027044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985435,0.00018846306,0.00033550983,0.0004086547,0.00020783846,0.0003160285],"domain_scores_gemma":[0.9986916,0.00038535235,0.00014036277,0.00041030892,0.00026418726,0.00010816615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005224518,0.00019575698,0.00018905403,0.00014126157,0.0009303727,0.00036109227,0.00054805627,0.0000870933,0.000031443073],"category_scores_gemma":[0.000013334889,0.00019442178,0.00009850097,0.0005700641,0.000058273636,0.00064724305,0.000005638168,0.00024964003,0.000009999862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016297941,0.000085573185,0.000002306709,0.000013507113,0.000010406173,2.2225784e-7,0.00038025537,0.25721902,0.002741794,0.0023869786,0.0000478216,0.73709583],"study_design_scores_gemma":[0.0005885538,0.00018882501,0.0000066734033,0.00011447573,0.000017175193,0.000005810381,0.000013624903,0.98249996,0.012597419,0.00032267655,0.0033906836,0.0002540979],"about_ca_topic_score_codex":0.0000015027701,"about_ca_topic_score_gemma":0.000020691707,"teacher_disagreement_score":0.97390926,"about_ca_system_score_codex":0.00010067907,"about_ca_system_score_gemma":0.000064320426,"threshold_uncertainty_score":0.792829},"labels":[],"label_agreement":null},{"id":"W1982805909","doi":"10.1109/glocom.2012.6503462","title":"Uplink multicell processing with limited backhaul via successive interference cancellation","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backhaul (telecommunications); Base station; Telecommunications link; Decodes; Computer science; Single antenna interference cancellation; Computer network; Relay; Decoding methods; Telecommunications","score_opus":0.037521659686016985,"score_gpt":0.27891357973562403,"score_spread":0.24139192004960705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982805909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01220566,0.0007061127,0.9782226,0.00062958343,0.00009953131,0.00013928684,9.3210666e-8,0.00016533653,0.007831809],"genre_scores_gemma":[0.9477024,0.00007458339,0.05107063,0.0003723739,0.000056685774,0.000014797087,0.0000030468261,0.000007343181,0.0006981359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917233,0.00007072463,0.00016792082,0.00020390333,0.00012266313,0.00026245095],"domain_scores_gemma":[0.9990325,0.00009630632,0.00009041906,0.00043408058,0.00023664618,0.00011003415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017975862,0.00012539208,0.000107552194,0.000066082546,0.00020828604,0.00016548258,0.00059766776,0.00003561471,0.00007384957],"category_scores_gemma":[0.000018591238,0.0000936821,0.000017361683,0.00048886455,0.00004109592,0.0010983777,0.0002420189,0.00014841092,0.000061625346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037958274,0.00025627294,0.0128733525,0.000041606996,0.000028677841,0.0000022353042,0.008031024,0.0016861348,0.008067398,0.022275658,0.00042060483,0.94627905],"study_design_scores_gemma":[0.00029539282,0.000046316825,0.0031405787,0.000082068145,0.0000056539184,0.000006056853,0.000049023332,0.9877979,0.006471626,0.000024359293,0.0018437232,0.00023727313],"about_ca_topic_score_codex":0.000012098168,"about_ca_topic_score_gemma":0.00009469093,"teacher_disagreement_score":0.9861118,"about_ca_system_score_codex":0.000053349813,"about_ca_system_score_gemma":0.000050109775,"threshold_uncertainty_score":0.38202453},"labels":[],"label_agreement":null},{"id":"W1982889676","doi":"10.1007/s11277-009-9911-0","title":"Diversity Analysis of Relay Selection Schemes for Two-Way Wireless Relay Networks","year":2010,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Saskatchewan","funders":"","keywords":"Relay; Computer science; Relay channel; Cooperative diversity; Wireless network; Computer network; Fading; Wireless; Selection (genetic algorithm); Diversity combining; Channel (broadcasting); Telecommunications; Artificial intelligence; Power (physics)","score_opus":0.044350301770009745,"score_gpt":0.3079460635567898,"score_spread":0.26359576178678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982889676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4108151,0.00044963023,0.5850703,0.0021588914,0.00018739187,0.0003494864,0.000019475548,0.00019143565,0.0007582599],"genre_scores_gemma":[0.96914387,0.00065451366,0.02956845,0.00018550322,0.00004736273,0.000086492415,0.000094606185,0.000014984687,0.00020423128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982723,0.000301015,0.0004414566,0.00039533977,0.0002820592,0.00030782697],"domain_scores_gemma":[0.99558836,0.0009362634,0.0003404769,0.002241103,0.0007639694,0.00012984141],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00089306507,0.0002092009,0.00041098552,0.0003940716,0.002805674,0.00009208643,0.0035687978,0.00014436539,0.00003966725],"category_scores_gemma":[0.00008063834,0.00022211204,0.00034657822,0.002586252,0.0003250517,0.00045689882,0.0032608926,0.00074471836,0.0000039078523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059893413,0.0007868737,0.047003184,0.000025121233,0.0017946364,5.289516e-7,0.009804593,0.0056418115,0.018556323,0.7993057,0.0008551123,0.116166234],"study_design_scores_gemma":[0.00041751275,0.00003883598,0.010268149,0.000020111425,0.0002442452,0.0000025709448,0.00009724518,0.9833987,0.00043934508,0.00006401796,0.0047582663,0.00025104498],"about_ca_topic_score_codex":0.00009432115,"about_ca_topic_score_gemma":0.003455201,"teacher_disagreement_score":0.97775686,"about_ca_system_score_codex":0.0000745411,"about_ca_system_score_gemma":0.00009868648,"threshold_uncertainty_score":0.99849254},"labels":[],"label_agreement":null},{"id":"W1982964048","doi":"10.1002/wcm.1041","title":"A study of multi‐hop cellular networks","year":2010,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Hop (telecommunications); Computer network; Telecommunications","score_opus":0.03983525856759991,"score_gpt":0.30295963471915954,"score_spread":0.26312437615155965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982964048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72677165,0.0014397857,0.2706553,0.000108314984,0.00014172998,0.00043970058,4.6133806e-7,0.000119299286,0.00032375578],"genre_scores_gemma":[0.9709142,0.0008047132,0.02811952,0.000046962265,0.00002594545,0.000050238203,0.000004452241,0.000011450169,0.000022546523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986933,0.00028753097,0.00042705395,0.0002759786,0.00011840475,0.00019777355],"domain_scores_gemma":[0.9961068,0.0003882218,0.00021360432,0.0029675192,0.00023761202,0.00008624137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060331996,0.00014763846,0.00024163906,0.000106523556,0.0006823796,0.00012411193,0.0024214676,0.00006228394,0.0000038216917],"category_scores_gemma":[0.000021968792,0.00014685336,0.00004311159,0.000511887,0.00016036243,0.00017014985,0.0030057447,0.0005313251,0.0000019220113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027947883,0.0018044824,0.008440152,0.000012754763,0.000058218677,0.000002182797,0.014979234,0.002050727,0.0144984005,0.046031613,0.000039310497,0.9120801],"study_design_scores_gemma":[0.0005736965,0.00011708485,0.002287914,0.000030094257,0.00000849376,0.0000066224748,0.0008665813,0.99355906,0.00020576535,0.00002043275,0.0021474855,0.00017674782],"about_ca_topic_score_codex":0.000030034636,"about_ca_topic_score_gemma":0.00024115671,"teacher_disagreement_score":0.99150836,"about_ca_system_score_codex":0.000009456229,"about_ca_system_score_gemma":0.000031324977,"threshold_uncertainty_score":0.5988506},"labels":[],"label_agreement":null},{"id":"W1982972072","doi":"10.1109/lcomm.2012.012412.112327","title":"Joint Relay Assignment and Power Allocation for Multicast Cooperative Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Relay; Unicast; Computer network; Mathematical optimization; Optimization problem; Power (physics); Algorithm; Mathematics","score_opus":0.06813157986102504,"score_gpt":0.30033877152959115,"score_spread":0.23220719166856613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982972072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063088727,0.0021691576,0.9607701,0.02919541,0.00032615184,0.0006034369,0.0000027163944,0.0001255649,0.0004986346],"genre_scores_gemma":[0.91089916,0.0011314921,0.08297563,0.0045099207,0.000059499456,0.0003237,0.000020996793,0.00001603251,0.00006359133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985692,0.0003840036,0.00034091744,0.00023534271,0.00012768472,0.00034283698],"domain_scores_gemma":[0.996796,0.00052359287,0.00013753025,0.0022178504,0.00017498278,0.00015004276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007658569,0.0001760957,0.00017835965,0.00009627156,0.00075572083,0.00018027447,0.0012831325,0.000060293973,0.000007981889],"category_scores_gemma":[0.00008358615,0.00017218528,0.00005911431,0.0003002948,0.00019483987,0.0007109124,0.0005953321,0.00026320826,0.000018013166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041074865,0.0015039714,0.0030472153,0.00003461663,0.00042671917,0.0000010097814,0.02292404,0.020316904,0.12850508,0.6292667,0.07306614,0.12086656],"study_design_scores_gemma":[0.0014060031,0.00012409154,0.009326815,0.00011541861,0.0000460152,0.000024538915,0.00027364035,0.86715657,0.0028238718,0.00006862824,0.11780019,0.00083424547],"about_ca_topic_score_codex":0.0000032948476,"about_ca_topic_score_gemma":0.000011135532,"teacher_disagreement_score":0.90459025,"about_ca_system_score_codex":0.00011628391,"about_ca_system_score_gemma":0.000024624698,"threshold_uncertainty_score":0.7021512},"labels":[],"label_agreement":null},{"id":"W1983300637","doi":"10.5539/cis.v3n3p3","title":"Supporting Differentiated Service in Cognitive Radio Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Cognitive radio; Wireless mesh network; Wireless ad hoc network; Wireless network; Network packet; Throughput; Wireless; Telecommunications","score_opus":0.02212291027254848,"score_gpt":0.28629739002983745,"score_spread":0.26417447975728897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983300637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34229404,0.000010723287,0.65570784,0.00037344912,0.0003991727,0.00013386377,4.6560592e-7,0.000075747914,0.0010047009],"genre_scores_gemma":[0.9937911,0.00009235317,0.004218229,0.0018400963,0.00003512398,0.000008801869,0.00000718663,0.0000018990035,0.0000052238456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885947,0.000037081973,0.0003569496,0.00020665496,0.00023749178,0.00030234878],"domain_scores_gemma":[0.99889725,0.000111648,0.00014181562,0.00032209756,0.00040397505,0.00012319886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091681624,0.000111186695,0.00012505519,0.00028813153,0.00036703245,0.0007536304,0.00094954873,0.000042687887,0.000013567921],"category_scores_gemma":[0.000044258868,0.00010106445,0.000016340156,0.0016908441,0.00015260874,0.007354928,0.0007664692,0.00030309454,0.0000131361785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006158827,0.000040166095,0.007920668,0.000013794447,0.0000047875865,0.000001363241,0.008797513,0.00025396355,0.0008128635,0.13970418,0.00016310657,0.84228146],"study_design_scores_gemma":[0.00032735508,0.000015710777,0.07979207,0.000031336698,8.862269e-7,0.00001334935,0.000039114268,0.9189347,0.0002384074,0.00005875887,0.0004182602,0.00013003248],"about_ca_topic_score_codex":0.0000057415873,"about_ca_topic_score_gemma":0.000031404612,"teacher_disagreement_score":0.9186808,"about_ca_system_score_codex":0.000017742983,"about_ca_system_score_gemma":0.000096258664,"threshold_uncertainty_score":0.7267276},"labels":[],"label_agreement":null},{"id":"W1983459476","doi":"10.1109/tcomm.2012.050912.110380","title":"Training and Decodings for Cooperative Network with Multiple Relays and Receive Antennas","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Relay; Transmitter; Computer science; Channel (broadcasting); Bit error rate; Channel state information; Relay channel; Algorithm; Space–time code; Electronic engineering; Antenna (radio); List decoding; Maximal-ratio combining; Telecommunications; Fading; Wireless; Engineering; Block code; Concatenated error correction code","score_opus":0.08999971044700875,"score_gpt":0.30364295564536475,"score_spread":0.213643245198356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983459476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027787357,0.0018679753,0.99046546,0.0029854681,0.00012062789,0.0006493924,0.000012204297,0.00014383264,0.0009762802],"genre_scores_gemma":[0.85756177,0.004437933,0.13695446,0.00042799822,0.000026351729,0.00041581658,0.000004941956,0.000016372005,0.000154383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892145,0.00020504332,0.00022616738,0.00023824141,0.00008870257,0.00032037968],"domain_scores_gemma":[0.99696714,0.0014338107,0.000086391396,0.0011645219,0.00018272169,0.00016540835],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00044934973,0.00017505258,0.00019960864,0.00009172366,0.0016193534,0.00013940521,0.00066798227,0.000062272615,0.000005422794],"category_scores_gemma":[0.000025236342,0.00015834365,0.00003797841,0.00043150375,0.00023887382,0.0006891634,0.000028899387,0.00032817473,0.0000039955394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001528266,0.0008549551,0.0013641905,0.00003400144,0.00041233574,6.7577406e-7,0.052799303,0.0047190115,0.001943782,0.16449137,0.0010843036,0.77214324],"study_design_scores_gemma":[0.004312671,0.0011181032,0.0047599594,0.0005869012,0.00019812214,0.00018891438,0.0032358181,0.83825684,0.0023787068,0.0012700406,0.14211895,0.001575001],"about_ca_topic_score_codex":0.0000061642872,"about_ca_topic_score_gemma":0.00031974725,"teacher_disagreement_score":0.854783,"about_ca_system_score_codex":0.000039387163,"about_ca_system_score_gemma":0.00004775051,"threshold_uncertainty_score":0.9996804},"labels":[],"label_agreement":null},{"id":"W1983547699","doi":"10.1109/infcom.2010.5462194","title":"Haste: Practical Online Network Coding in a Multicast Switch","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Multicast; Computer science; Computer network; Distributed computing; Emulation; Source-specific multicast; Network packet; Asynchronous communication","score_opus":0.06205329098662052,"score_gpt":0.3493659275107953,"score_spread":0.2873126365241748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983547699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062247466,0.00007661311,0.8990272,0.022124527,0.00082857267,0.00027042834,5.071177e-7,0.00028763455,0.015137045],"genre_scores_gemma":[0.7537634,0.00006391399,0.24488288,0.00089006685,0.00012535416,0.000007044828,0.0000017757593,0.0000050623376,0.0002605491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898654,0.00009866607,0.00023878722,0.000253971,0.00013710232,0.00028490336],"domain_scores_gemma":[0.9986913,0.00039941046,0.00004701156,0.000680698,0.000084278014,0.00009728522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050493446,0.000101523765,0.00013011796,0.000059128146,0.00013107566,0.00015799636,0.00063839194,0.00006024522,0.00014347259],"category_scores_gemma":[0.00024636937,0.00008889305,0.000029601699,0.000575915,0.00003951046,0.00038824754,0.00056077394,0.00059995684,0.00006401262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009326711,0.0003730147,0.006119588,0.0000035963094,0.00000877353,0.000027255115,0.000596763,0.0002784745,0.005985195,0.8615855,0.004216765,0.12079577],"study_design_scores_gemma":[0.00049254927,0.000028362983,0.014514705,0.000026976179,0.0000017551718,0.000038292943,0.000035925983,0.9526067,0.00017645633,0.00063412334,0.031237544,0.0002066342],"about_ca_topic_score_codex":0.000008222646,"about_ca_topic_score_gemma":0.001954294,"teacher_disagreement_score":0.9523282,"about_ca_system_score_codex":0.000017799726,"about_ca_system_score_gemma":0.000071340975,"threshold_uncertainty_score":0.36249533},"labels":[],"label_agreement":null},{"id":"W1983707608","doi":"10.1109/ccnc.2010.5421777","title":"TCP-Aware Network Coding with Opportunistic Scheduling in Wireless Mobile Ad Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; TCP global synchronization; TCP Westwood plus; Linear network coding; TCP Friendly Rate Control; Zeta-TCP; CUBIC TCP; H-TCP; TCP tuning; TCP acceleration; Wireless ad hoc network; Network congestion; Wireless; Network packet; Telecommunications","score_opus":0.024936221129404478,"score_gpt":0.2650083565088372,"score_spread":0.24007213537943273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983707608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068300955,0.0006590687,0.92631584,0.000458552,0.00049390964,0.00035710973,4.4175638e-7,0.0003084299,0.0031057007],"genre_scores_gemma":[0.9611366,0.0018584131,0.035918646,0.0005479791,0.00013612902,0.00007979139,0.000009567229,0.000019525993,0.00029338652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983907,0.000117231044,0.00033215032,0.00044862443,0.00020008371,0.00051121693],"domain_scores_gemma":[0.99827045,0.0002681057,0.00011287769,0.001023204,0.0001458387,0.00017955169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062626513,0.00021794478,0.00025980952,0.00009328628,0.00034299685,0.00028346543,0.0012521249,0.00010587859,0.000114115464],"category_scores_gemma":[0.000018061415,0.00018496202,0.000041598098,0.00095900235,0.00008868179,0.00041973926,0.00054381014,0.0007612579,0.00001739094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003803549,0.0001729287,0.010351274,0.000018239849,0.000035549216,0.000081559156,0.0007061062,0.06425852,0.00083153637,0.3205802,0.0009575385,0.6019685],"study_design_scores_gemma":[0.00041980998,0.000075925265,0.0011918742,0.00011701975,0.0000038106123,0.000020033756,0.0000605382,0.9915304,0.000037391506,0.00012683595,0.006090831,0.00032549622],"about_ca_topic_score_codex":0.0000031145732,"about_ca_topic_score_gemma":0.00115852,"teacher_disagreement_score":0.9272719,"about_ca_system_score_codex":0.00003813436,"about_ca_system_score_gemma":0.00012789803,"threshold_uncertainty_score":0.75425327},"labels":[],"label_agreement":null},{"id":"W1983757131","doi":"10.1109/tvt.2012.2236659","title":"Wireless Multicast Using Relays: Incentive Mechanism and Analysis","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Computer network; Computer science; Network packet; Relay; Bidding; Throughput; Nash equilibrium; Game theory; Wireless; Mathematical optimization; Microeconomics; Telecommunications","score_opus":0.029876272711980813,"score_gpt":0.2735150792264216,"score_spread":0.24363880651444078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983757131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22534505,0.00025130747,0.7734245,0.00047634123,0.00012873177,0.00013205287,0.0000017403734,0.00021398478,0.000026296082],"genre_scores_gemma":[0.96977407,0.00034906226,0.02968499,0.00011191968,0.000008372467,0.00003589952,6.552822e-7,0.000008566238,0.000026454083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990341,0.00010569655,0.00018217975,0.00027579285,0.00011866425,0.00028357413],"domain_scores_gemma":[0.9990442,0.000055947425,0.00006352676,0.0006705636,0.00008685239,0.00007890839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019145208,0.00014131957,0.00021075673,0.00068210915,0.00038089472,0.000041578463,0.00043205643,0.00016782805,0.000015033584],"category_scores_gemma":[0.000004442007,0.00013981735,0.000084133106,0.0019287494,0.00011588586,0.00030607128,0.000019618064,0.00034969134,0.000015772623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021782209,0.0010932116,0.0015185582,0.000018635108,0.0018439546,0.000023046574,0.0026900375,0.009475298,0.10963915,0.42352858,0.000010721288,0.45013702],"study_design_scores_gemma":[0.00037590743,0.00006298826,0.00026987496,0.000026106954,0.00025407388,0.000039371465,0.00014710736,0.9083896,0.08889759,0.00081282674,0.00041540782,0.00030912046],"about_ca_topic_score_codex":0.000005079909,"about_ca_topic_score_gemma":0.000018928971,"teacher_disagreement_score":0.89891434,"about_ca_system_score_codex":0.00007295799,"about_ca_system_score_gemma":0.000015873135,"threshold_uncertainty_score":0.5701586},"labels":[],"label_agreement":null},{"id":"W1983767698","doi":"10.1109/vtcfall.2012.6399349","title":"Exact Error Analysis of Dual-Hop Fixed-Gain AF Relaying over Arbitrary Nakagami-m Fading","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Nakagami distribution; Fading; Computer science; Fading distribution; Algorithm; Hop (telecommunications); Mathematics; Topology (electrical circuits); Statistics; Telecommunications; Combinatorics; Decoding methods","score_opus":0.04946972739143196,"score_gpt":0.3087558627982084,"score_spread":0.2592861354067764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983767698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33852616,0.002212108,0.6031456,0.00076256547,0.00033716133,0.00017993999,0.0000028588706,0.00027749344,0.054556075],"genre_scores_gemma":[0.9801077,0.00019407802,0.018193929,0.0006531604,0.00004657028,0.0000074338404,0.0000067659075,0.000008769678,0.0007815517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985061,0.0002769759,0.00037345558,0.0002484913,0.00025546245,0.00033946105],"domain_scores_gemma":[0.9982264,0.00041963832,0.00015186876,0.000983612,0.00008360728,0.00013485142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010090136,0.00015036034,0.00030372257,0.00040997288,0.00018728319,0.00007433354,0.00067695684,0.000059193237,0.00041426034],"category_scores_gemma":[0.000088300636,0.00013336577,0.00019657925,0.0021223107,0.000041841384,0.0009060188,0.00057122245,0.00019219168,0.000029463814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025719732,0.00070405245,0.18926242,0.000047673988,0.0024746715,0.000011750726,0.01974778,0.0051580765,0.032166258,0.6304334,0.009096266,0.11087194],"study_design_scores_gemma":[0.00041237098,0.000040647887,0.10423638,0.000060064525,0.00024301863,0.000005662313,0.00027667187,0.88037825,0.0049381335,0.00018453793,0.008663929,0.0005603189],"about_ca_topic_score_codex":0.000017034934,"about_ca_topic_score_gemma":0.00003380861,"teacher_disagreement_score":0.8752202,"about_ca_system_score_codex":0.000053890082,"about_ca_system_score_gemma":0.000032541888,"threshold_uncertainty_score":0.5438498},"labels":[],"label_agreement":null},{"id":"W1983915728","doi":"10.1016/j.automatica.2012.06.072","title":"A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks","year":2012,"lang":"en","type":"article","venue":"Automatica","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Node (physics); Dissemination; Computer science; Bounded function; Computer network; Wireless network; Resilience (materials science); Set (abstract data type); Vertex (graph theory); Wireless; Mathematics; Theoretical computer science; Graph; Telecommunications","score_opus":0.015007285221209398,"score_gpt":0.26614775906939014,"score_spread":0.2511404738481807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983915728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22689627,0.0006762289,0.7661575,0.0008339052,0.000090895104,0.00030666424,2.7334542e-7,0.00017067873,0.004867605],"genre_scores_gemma":[0.9664929,0.000058073292,0.03258617,0.0007096733,0.000052342737,0.000054978595,0.0000010213647,0.000010793285,0.000034038105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875844,0.00025487892,0.0002705277,0.00020774076,0.00013075401,0.00037766356],"domain_scores_gemma":[0.99877673,0.0005131619,0.00006337144,0.00046754398,0.000033315773,0.000145886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091836386,0.00013631099,0.00022166863,0.00009677673,0.00015929865,0.00014924159,0.00051141396,0.00008251458,0.000004330213],"category_scores_gemma":[0.0001226295,0.00012468158,0.000026065927,0.00040027546,0.000049653623,0.00031180892,0.00037866316,0.00026827873,0.00000761642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007496888,0.00027951723,0.011638698,0.000056257784,0.000027778135,0.0000025353434,0.018994791,0.001239228,0.00061284326,0.77642876,0.0005260587,0.19018602],"study_design_scores_gemma":[0.00026529483,0.000019808116,0.019322857,0.00011580076,0.0000053261456,0.0000123621385,0.000085916035,0.9792649,0.000039772494,0.0006257766,0.000072642586,0.00016953344],"about_ca_topic_score_codex":0.00000339127,"about_ca_topic_score_gemma":0.0000018901075,"teacher_disagreement_score":0.9780257,"about_ca_system_score_codex":0.00004058722,"about_ca_system_score_gemma":0.000011315077,"threshold_uncertainty_score":0.50843674},"labels":[],"label_agreement":null},{"id":"W1984115116","doi":"10.1109/glocom.2014.7037055","title":"Half-duplex relaying over slow fading multiple access channel","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Additive white Gaussian noise; Relay; Computer science; Channel (broadcasting); Channel state information; Computer network; Transmission (telecommunications); Relay channel; Quality of service; Decoding methods; Topology (electrical circuits); Algorithm; Telecommunications; Wireless; Mathematics; Physics","score_opus":0.06728743291055145,"score_gpt":0.30667193523594233,"score_spread":0.23938450232539088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984115116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015654204,0.00012324819,0.9522041,0.0019578515,0.0003340678,0.00011955925,1.5371653e-7,0.00036327663,0.029243553],"genre_scores_gemma":[0.9853131,0.00011576582,0.011272705,0.0017748182,0.00009274402,0.000016414517,0.0000020333032,0.0000100174375,0.0014023719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989184,0.00013410204,0.00019733075,0.0003164867,0.00016852985,0.0002651657],"domain_scores_gemma":[0.9985989,0.00030998318,0.00006795364,0.0008425652,0.00008504947,0.00009559864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322162,0.00012823104,0.00013879707,0.000099308825,0.0003823923,0.00044110863,0.0016934872,0.000044531127,0.00008278761],"category_scores_gemma":[0.00015893753,0.00011402929,0.00005532028,0.0004318366,0.000025392359,0.0009630356,0.0011497546,0.00016457231,0.0000847313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105294575,0.00015078155,0.01022301,0.000026730813,0.000050743136,0.000004673298,0.0031077124,0.009661485,0.0058000586,0.5622905,0.025563028,0.38311076],"study_design_scores_gemma":[0.00031261463,0.00001551312,0.0047296174,0.000025755482,0.0000015474437,0.0000026112584,0.0000102672075,0.96184385,0.0010714816,0.0004119244,0.03138833,0.00018648985],"about_ca_topic_score_codex":0.000026438933,"about_ca_topic_score_gemma":0.000114192975,"teacher_disagreement_score":0.9696589,"about_ca_system_score_codex":0.000036320842,"about_ca_system_score_gemma":0.000018014307,"threshold_uncertainty_score":0.46499795},"labels":[],"label_agreement":null},{"id":"W1984119615","doi":"10.1109/icspcs.2013.6723916","title":"Joint design of user power allocation and relay beamforming in two-way MIMO relay networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Beamforming; Computer science; Optimization problem; MIMO; Mathematical optimization; Joint (building); Wireless; Transmitter power output; Convex optimization; Power (physics); Relay channel; Iterative method; Antenna (radio); Regular polygon; Algorithm; Computer network; Mathematics; Engineering; Telecommunications; Channel (broadcasting)","score_opus":0.03470233964902947,"score_gpt":0.260550807476184,"score_spread":0.2258484678271545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984119615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040948637,0.00033260134,0.95512295,0.0010837223,0.00007944053,0.0003075482,3.8027558e-8,0.000049002254,0.002076088],"genre_scores_gemma":[0.8847849,0.0004359503,0.1139463,0.00034751816,0.000009846297,0.000027573646,8.2249636e-7,0.000006251702,0.0004408547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989635,0.00018083765,0.0003386249,0.0002200768,0.00011150369,0.00018547566],"domain_scores_gemma":[0.99900264,0.00018767249,0.00009594758,0.0005218275,0.00013196995,0.000059969243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006243574,0.000105873696,0.00015233857,0.000111665846,0.00008281825,0.00008858178,0.00038895407,0.00004304106,0.000081086844],"category_scores_gemma":[0.000048151927,0.00009000376,0.00002310819,0.0003906152,0.000042652544,0.0006599782,0.00032797942,0.00016434051,0.000016118844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021877693,0.0003259988,0.0080422675,0.000022493543,0.00006215979,0.000004160876,0.008517483,0.27742386,0.031842194,0.46294484,0.00886054,0.20193212],"study_design_scores_gemma":[0.00036764308,0.000051342144,0.014576491,0.00006498016,0.0000018195855,0.0000047140843,0.000061983774,0.98310333,0.000830883,0.00027079773,0.00051181327,0.00015421755],"about_ca_topic_score_codex":0.0000541191,"about_ca_topic_score_gemma":0.00005857148,"teacher_disagreement_score":0.84383625,"about_ca_system_score_codex":0.000033842345,"about_ca_system_score_gemma":0.000024878424,"threshold_uncertainty_score":0.3670247},"labels":[],"label_agreement":null},{"id":"W1984167999","doi":"10.1155/2007/74591","title":"Location-Aware Cross-Layer Design Using Overlay Watermarks","year":2007,"lang":"en","type":"article","venue":"Advances in Multimedia","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Communications Research Centre Canada","funders":"","keywords":"Computer science; Overlay; Orthogonal frequency-division multiplexing; Computer network; Physical layer; Wireless; Transceiver; Channel (broadcasting); Bandwidth (computing); Multiplexing; Real-time computing; Telecommunications","score_opus":0.05462846532415036,"score_gpt":0.37066712669260443,"score_spread":0.31603866136845404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984167999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067736274,0.0039658356,0.9877221,0.00007661687,0.00051644933,0.00018165418,3.0769692e-7,0.00008242183,0.0006809845],"genre_scores_gemma":[0.7846582,0.0007961744,0.21415319,0.00021807928,0.000066712164,0.000008049171,0.000002453333,0.000008246245,0.00008890788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874514,0.00011158532,0.00032252027,0.00029963776,0.00018946755,0.00033162013],"domain_scores_gemma":[0.9985918,0.00049433275,0.00009178983,0.0005633981,0.00017988101,0.000078835146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084059226,0.00013585822,0.00013485183,0.00013170372,0.00016541885,0.00009922139,0.00082910666,0.000059171438,0.000027489708],"category_scores_gemma":[0.00012055466,0.00012781558,0.000026270618,0.00063210493,0.00009021614,0.0013668509,0.00023895282,0.00019376012,0.000036286612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043731685,0.00015483408,0.035101555,0.000028871793,0.00001178252,0.00004188698,0.003872189,0.12095832,0.0056491653,0.0028937499,0.000095641924,0.83114827],"study_design_scores_gemma":[0.00052461884,0.000019570945,0.015026978,0.00008703086,0.0000015733451,0.000006829307,0.00003062545,0.97080976,0.008295084,0.00045935292,0.004486812,0.00025175023],"about_ca_topic_score_codex":0.0000057809434,"about_ca_topic_score_gemma":0.00007371391,"teacher_disagreement_score":0.8498514,"about_ca_system_score_codex":0.00011615357,"about_ca_system_score_gemma":0.00005817007,"threshold_uncertainty_score":0.5212168},"labels":[],"label_agreement":null},{"id":"W1984183825","doi":"10.1109/itw.2011.6089358","title":"Decode-forward and compute-forward coding schemes for the two-way relay channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Computer science; Relay channel; Gaussian; Superposition principle; Coding (social sciences); Algorithm; Lattice (music); Channel (broadcasting); Topology (electrical circuits); Channel code; Decoding methods; Linear network coding; Theoretical computer science; Telecommunications; Mathematics; Computer network; Physics; Statistics; Combinatorics","score_opus":0.08100805443561788,"score_gpt":0.29088712419479384,"score_spread":0.20987906975917597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984183825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019290688,0.0010597785,0.9878982,0.0018959093,0.000272455,0.00034328608,0.0000010227861,0.00017591783,0.006424399],"genre_scores_gemma":[0.8809663,0.0010344987,0.11572155,0.0013208509,0.000077474884,0.00006573016,0.0000015499097,0.000012223267,0.00079980894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989804,0.000067843386,0.00023159306,0.0003165632,0.00012245873,0.00028111806],"domain_scores_gemma":[0.99847263,0.00045860783,0.000080108184,0.0007362152,0.00015523174,0.00009718665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006373934,0.00015479096,0.00016715813,0.00006412287,0.0007018407,0.00017761248,0.0011365393,0.00004071706,0.00003467882],"category_scores_gemma":[0.00005623094,0.00010386899,0.000072638155,0.00025634156,0.000089970155,0.00036168267,0.0007745917,0.00014472079,0.000019286677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014734852,0.000043461816,0.00036738793,0.000011000266,0.00006644559,0.0000010243408,0.0036499987,0.00008050493,0.00013734518,0.77972925,0.005160346,0.21073852],"study_design_scores_gemma":[0.00072138413,0.00008797604,0.0010882281,0.00003327267,0.000014744339,0.0000141276705,0.000121514095,0.9343128,0.0023873262,0.0026642308,0.05827854,0.00027582134],"about_ca_topic_score_codex":0.000013388243,"about_ca_topic_score_gemma":0.00007185913,"teacher_disagreement_score":0.93423235,"about_ca_system_score_codex":0.000020253729,"about_ca_system_score_gemma":0.00002821865,"threshold_uncertainty_score":0.5398062},"labels":[],"label_agreement":null},{"id":"W1985344673","doi":"10.1109/infcom.2010.5462145","title":"Stimulating Cooperation in Multi-hop Wireless Networks Using Cheating Detection System","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cheating; Computer network; Computer science; Relay; Network packet; Incentive; Computer security; Wireless; Hop (telecommunications); Overhead (engineering); Wireless network; Payment; Telecommunications","score_opus":0.05387428294347182,"score_gpt":0.3017787764995372,"score_spread":0.2479044935560654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985344673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30375147,0.00002850964,0.6951889,0.000040596606,0.00035468588,0.0001537927,5.537316e-8,0.00018712998,0.00029490743],"genre_scores_gemma":[0.9014709,0.000007701309,0.09833244,0.000060384442,0.000077274235,0.000012674873,0.0000013014808,0.0000099349845,0.000027366275],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883914,0.00016724523,0.00035383395,0.0002908837,0.00011318412,0.0002356988],"domain_scores_gemma":[0.9990741,0.00012941235,0.00009463832,0.00047395218,0.0001699119,0.00005795425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067203614,0.00013007515,0.00014997064,0.00011997695,0.0004033895,0.00026220587,0.00042768536,0.00009636349,0.000007633138],"category_scores_gemma":[0.000059297447,0.00012729701,0.000029695471,0.0007192145,0.000021005248,0.00058444607,0.00024336498,0.00043191478,0.0000054563966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048945976,0.000063554755,0.004510095,0.000018573375,0.0000079363135,0.0000040253385,0.00094564905,0.21837845,0.47975025,0.023991158,0.000003916184,0.2723215],"study_design_scores_gemma":[0.00033961117,0.000012020415,0.0012524517,0.00006257646,0.0000015450878,0.000012309205,0.0000686325,0.9928702,0.005201781,0.0000017380823,0.00002481765,0.00015232974],"about_ca_topic_score_codex":0.000081102036,"about_ca_topic_score_gemma":0.001986973,"teacher_disagreement_score":0.7744917,"about_ca_system_score_codex":0.00010439004,"about_ca_system_score_gemma":0.000039234772,"threshold_uncertainty_score":0.51910216},"labels":[],"label_agreement":null},{"id":"W1985373784","doi":"10.1109/allerton.2012.6483349","title":"An update model for network coding in cloud storage systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; File sharing; Cloud computing; Distributed data store; File system; Cloud storage; Coding (social sciences); Linear network coding; Distributed computing; Redundancy (engineering); Self-certifying File System; Peer-to-peer; Computer network; Data redundancy; Operating system; The Internet","score_opus":0.07126549040849027,"score_gpt":0.3108466752660667,"score_spread":0.2395811848575764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985373784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003903255,0.0009491361,0.99259764,0.00024868757,0.0005670439,0.00024636442,6.8296737e-7,0.00012420326,0.0013629614],"genre_scores_gemma":[0.95776033,0.0001592427,0.040995713,0.00045580365,0.00026524987,0.00005130855,0.0000045654456,0.000007707809,0.00030004888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906445,0.00012761407,0.0002012096,0.00016512562,0.00008439623,0.00035723642],"domain_scores_gemma":[0.9990906,0.00008785276,0.00004944901,0.00061042217,0.000055541732,0.00010609506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010087189,0.00009090069,0.00012965559,0.000047112168,0.0001637954,0.00014445795,0.000743567,0.00003801927,0.0000056070758],"category_scores_gemma":[0.000011456429,0.000082982166,0.000026542593,0.0002658507,0.000011425382,0.00079429825,0.00018242358,0.00009130474,0.00001262259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002872065,0.000039031507,0.00064553355,0.0000047590834,0.000002987833,1.3226878e-7,0.0006792252,0.25790697,0.00008359149,0.7335316,0.0035241127,0.003579176],"study_design_scores_gemma":[0.00016966523,0.0000118163025,0.00015826861,0.000017670982,0.0000011433921,0.0000012092742,0.00002145631,0.993695,0.000014639423,0.00033055196,0.0054572923,0.00012126373],"about_ca_topic_score_codex":0.000003440969,"about_ca_topic_score_gemma":0.00003494789,"teacher_disagreement_score":0.9538571,"about_ca_system_score_codex":0.00005254593,"about_ca_system_score_gemma":0.000024778245,"threshold_uncertainty_score":0.33839142},"labels":[],"label_agreement":null},{"id":"W1986529826","doi":"10.1109/tit.2012.2184737","title":"Generalized Framework for the Level Crossing Analysis of Ordered Random Processes","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Victoria University of Wellington; University of Victoria; University of Canterbury","keywords":"Zero (linguistics); Computer science; Combinatorics; Mathematics; Algorithm; Discrete mathematics; Philosophy","score_opus":0.05743754988560776,"score_gpt":0.3142494260931213,"score_spread":0.25681187620751356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986529826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014532218,0.00027555035,0.9971106,0.00030599456,0.00031354028,0.00028237383,0.000024385896,0.00006622472,0.00016809856],"genre_scores_gemma":[0.96333927,0.00023406389,0.035606317,0.0005875818,0.000018791585,0.00013221402,0.0000058841542,0.0000038529993,0.00007200742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991369,0.00012614898,0.0003556229,0.00006496036,0.00015705377,0.0001592632],"domain_scores_gemma":[0.99719125,0.0017683279,0.00019198889,0.00048820255,0.00031966117,0.000040566818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009354064,0.00009699449,0.00016707082,0.00026145298,0.0007430745,0.00019690875,0.0004955949,0.000052269537,0.00007063723],"category_scores_gemma":[0.00009997117,0.00006889997,0.00014523254,0.0014393092,0.00008883983,0.001440322,0.0000041193757,0.00012234508,0.00000880386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002826844,0.00013977945,0.000018556084,0.000055706234,0.00091224536,1.1577191e-8,0.027546111,0.1315737,0.00012584381,0.39907357,0.0001127116,0.44015908],"study_design_scores_gemma":[0.004149906,0.000123779,0.0013398008,0.00015298737,0.0013180649,0.000004457164,0.0017781028,0.89872724,0.054488033,0.016070876,0.021105744,0.00074102334],"about_ca_topic_score_codex":0.000002582569,"about_ca_topic_score_gemma":0.000008672197,"teacher_disagreement_score":0.96188605,"about_ca_system_score_codex":0.000026095171,"about_ca_system_score_gemma":0.000080300524,"threshold_uncertainty_score":0.5715203},"labels":[],"label_agreement":null},{"id":"W1986622218","doi":"10.1109/icc.2010.5502097","title":"Performance Analysis of Cooperative Diversity Networks with Imperfect Channel Estimation","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Bit error rate; Computer science; Imperfect; Channel (broadcasting); Signal-to-noise ratio (imaging); Monte Carlo method; Word error rate; Relay channel; Maximal-ratio combining; Algorithm; Electronic engineering; Telecommunications; Fading; Mathematics; Statistics; Engineering; Speech recognition; Physics","score_opus":0.018726051310562205,"score_gpt":0.24429707618182592,"score_spread":0.2255710248712637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986622218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3985774,0.0000139377835,0.59908444,0.00010696122,0.00004719055,0.00006939878,3.908685e-7,0.000048031823,0.0020522377],"genre_scores_gemma":[0.98880786,0.00009493998,0.010867454,0.00010038735,0.000009729364,0.0000048600127,0.000007157041,0.0000024369422,0.00010518694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993666,0.00005238501,0.00013072549,0.00018538038,0.00014097578,0.00012395551],"domain_scores_gemma":[0.9989712,0.00008947686,0.00008148723,0.0005440879,0.00026358225,0.000050147348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002748311,0.00009170588,0.0001773935,0.0001656744,0.00036340544,0.00004589357,0.000627815,0.00003623223,0.00006519974],"category_scores_gemma":[0.000015721998,0.00006803836,0.000045602377,0.0016896714,0.000069922266,0.00044665523,0.0005612411,0.00017149483,0.00000280844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003359674,0.00013931577,0.060173742,0.000007196045,0.0006673798,0.000001234711,0.0034140015,0.827237,0.0007989549,0.033073068,0.0002167263,0.07423778],"study_design_scores_gemma":[0.00013254648,0.000073436044,0.06460503,0.000005010364,0.000057372938,9.766304e-7,0.0000114699415,0.9343583,0.00064003305,0.0000039425677,0.000020177213,0.000091716814],"about_ca_topic_score_codex":0.000015886731,"about_ca_topic_score_gemma":0.00038892482,"teacher_disagreement_score":0.59023046,"about_ca_system_score_codex":0.000011937313,"about_ca_system_score_gemma":0.0000264071,"threshold_uncertainty_score":0.27950576},"labels":[],"label_agreement":null},{"id":"W1986693787","doi":"10.1109/glocom.2013.6831721","title":"Distributed beamforming in multi-cell cooperative MIMO Cellular Networks with non-regenerative relays: An LTE-Advanced framework","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Beamforming; MIMO; Computer science; LTE Advanced; Cooperative MIMO; Cellular network; Computer network; Distributed computing; 3G MIMO; Telecommunications; Telecommunications link","score_opus":0.02373951038485874,"score_gpt":0.2587106231493524,"score_spread":0.23497111276449364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986693787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063346714,0.00052138616,0.93353033,0.00049618044,0.00012448593,0.0010245335,0.00000216259,0.00017455028,0.0007796281],"genre_scores_gemma":[0.7175395,0.00016668676,0.28100687,0.00051389425,0.000034331275,0.00026993646,0.000046996756,0.000020891637,0.00040091426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771893,0.0003035204,0.00046501806,0.0007046445,0.00022606258,0.0005818065],"domain_scores_gemma":[0.99766254,0.0002580013,0.00015931131,0.0012270478,0.00044831706,0.00024478437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002503328,0.00037800634,0.00038102144,0.00012912636,0.00043875686,0.00042675383,0.0013115376,0.00016335276,0.00010372162],"category_scores_gemma":[0.000046594272,0.0002962238,0.000050729566,0.0013806554,0.00011539403,0.0018839027,0.00045734938,0.00071521,0.00006001362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076478354,0.0017710233,0.003597591,0.000021646256,0.00008741267,0.000051649535,0.013229973,0.8526027,0.024913548,0.04495661,0.0011073073,0.05758404],"study_design_scores_gemma":[0.0012094108,0.00028022227,0.00095948385,0.000118079304,0.0000043396835,0.0000027774452,0.00055235147,0.98617995,0.009578112,0.00007237557,0.0005333122,0.0005096138],"about_ca_topic_score_codex":0.00006333502,"about_ca_topic_score_gemma":0.0004893983,"teacher_disagreement_score":0.65419275,"about_ca_system_score_codex":0.0001353436,"about_ca_system_score_gemma":0.000099765864,"threshold_uncertainty_score":0.999949},"labels":[],"label_agreement":null},{"id":"W1986810971","doi":"10.1007/s00034-012-9435-9","title":"Joint Transceiver Design for Cooperative Multi-cell Systems with Multiple Users","year":2012,"lang":"en","type":"article","venue":"Circuits Systems and Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"MIMO; Computer science; Backhaul (telecommunications); Transceiver; Joint (building); Minification; Convergence (economics); Expression (computer science); Mathematical optimization; Precoding; Algorithm; Control theory (sociology); Wireless; Mathematics; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.10109446001957054,"score_gpt":0.26754814425772994,"score_spread":0.1664536842381594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986810971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043504,0.021032535,0.97292984,0.000035519577,0.00016505057,0.0010903503,0.0000037417337,0.00011657362,0.00027599835],"genre_scores_gemma":[0.99414307,0.00007449842,0.005022072,0.00005823528,0.00012433852,0.00022938738,0.0000034918564,0.000025369734,0.00031950956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838305,0.00026498383,0.00034956099,0.00036022652,0.00020101336,0.0004411503],"domain_scores_gemma":[0.9987142,0.00021189131,0.00018217039,0.00026025457,0.0004231199,0.00020837126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008362639,0.00024239089,0.00034146002,0.00009309663,0.0007164053,0.0006918513,0.0003413112,0.00008034044,0.0000014640815],"category_scores_gemma":[0.000018251543,0.00018648403,0.00003838984,0.00028543404,0.00007838108,0.001199683,0.000043222644,0.00015324877,0.0000041653725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021309529,0.0023730465,0.0125471605,0.0069786143,0.0005586067,0.000029227935,0.13988207,0.20837961,0.19545835,0.031229177,0.002455538,0.39989552],"study_design_scores_gemma":[0.0016775389,0.00016286226,0.00037501316,0.0005456107,0.000023842476,0.000046899953,0.0009465842,0.992327,0.0016794536,0.0000024361748,0.0017980057,0.00041479923],"about_ca_topic_score_codex":0.000010659949,"about_ca_topic_score_gemma":0.0000031961422,"teacher_disagreement_score":0.9897927,"about_ca_system_score_codex":0.000059323775,"about_ca_system_score_gemma":0.0001228105,"threshold_uncertainty_score":0.76045984},"labels":[],"label_agreement":null},{"id":"W1987264091","doi":"10.1109/mwc.2014.6940428","title":"Multihop cellular: from research to systems, standards, and applications [Guest Editorial]","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless ad hoc network; 3rd Generation Partnership Project 2; Computer network; Telecommunications; Wireless; Telecommunications link","score_opus":0.0736781749006021,"score_gpt":0.3603930157075269,"score_spread":0.2867148408069248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987264091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034584356,0.0036780715,0.9727088,0.0055438685,0.008322196,0.0014050853,0.000105850726,0.00046116713,0.0043164897],"genre_scores_gemma":[0.97284406,0.0030164102,0.014164078,0.00019302264,0.0084308535,0.0010665476,0.00006168426,0.000029565987,0.00019379043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99662226,0.0014429011,0.00042399642,0.00048073803,0.0006801919,0.00034991006],"domain_scores_gemma":[0.9908082,0.0018723871,0.00010532253,0.0055402988,0.0013847584,0.0002890578],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024175004,0.00017683074,0.00026008658,0.000228432,0.001599481,0.00064028316,0.004445469,0.000119825345,0.0000031978925],"category_scores_gemma":[0.00019838056,0.00018562922,0.000038355774,0.0010191167,0.0002648148,0.00033132307,0.0019711545,0.00063303654,0.00013437808],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015861848,0.00053179456,0.00049577246,0.000042484666,0.00009037211,6.3855356e-7,0.004613091,0.0004861867,0.026366182,0.55516005,0.21295151,0.19924608],"study_design_scores_gemma":[0.00025333237,0.000034068926,0.00015119088,0.00008041579,0.000005813956,8.5087277e-7,0.00014817715,0.039102,0.000581633,0.00048336666,0.95893687,0.00022225472],"about_ca_topic_score_codex":0.00029079054,"about_ca_topic_score_gemma":0.00051805243,"teacher_disagreement_score":0.9693856,"about_ca_system_score_codex":0.00016256164,"about_ca_system_score_gemma":0.00016291667,"threshold_uncertainty_score":0.9997003},"labels":[],"label_agreement":null},{"id":"W1987281244","doi":"10.1109/pimrc.2007.4394033","title":"Outage Probability Analysis of Distributed Coded Cooperation for Relay Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Decoding methods; Relay channel; Phase-shift keying; Linear network coding; Node (physics); Fading; Computer network; Coding (social sciences); Cooperative diversity; Diversity gain; Transmission (telecommunications); Keying; Binary number; Topology (electrical circuits); Algorithm; Telecommunications; Bit error rate; Mathematics; Statistics; Engineering; Arithmetic; Power (physics); Network packet; Physics","score_opus":0.0566369177052137,"score_gpt":0.31498920510669465,"score_spread":0.258352287401481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987281244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03382901,0.00004464649,0.9645642,0.00058303005,0.00007499745,0.0003178294,0.000011196289,0.00007762803,0.00049742905],"genre_scores_gemma":[0.958111,0.000017794813,0.04140492,0.00012747724,0.0000123019445,0.000017189755,0.00008635243,0.0000024923038,0.00022048187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991067,0.00006538645,0.00034388903,0.00021852925,0.00010907844,0.00015642196],"domain_scores_gemma":[0.99848115,0.00029158095,0.00009697602,0.0006187188,0.0004582793,0.000053261057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259157,0.000076745375,0.00019959388,0.00013827476,0.00012765225,0.000052976135,0.00048130105,0.000040632473,0.000030552623],"category_scores_gemma":[0.00018227092,0.00006537229,0.00010474761,0.0016089353,0.000034516263,0.00019751537,0.0001375958,0.000051943294,0.0000017764307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063725725,0.00041560488,0.004112764,0.000024579958,0.0005636622,6.5731007e-7,0.0020247847,0.035516698,0.010036038,0.90340585,0.0013026571,0.04253299],"study_design_scores_gemma":[0.00030821929,0.00006719151,0.006339755,0.0000054534225,0.00006503211,2.3734464e-7,0.000019124473,0.97785336,0.011869114,0.0003581203,0.0029876134,0.00012680139],"about_ca_topic_score_codex":0.0000051040824,"about_ca_topic_score_gemma":0.00026477984,"teacher_disagreement_score":0.9423366,"about_ca_system_score_codex":0.000044746055,"about_ca_system_score_gemma":0.000029450914,"threshold_uncertainty_score":0.26658046},"labels":[],"label_agreement":null},{"id":"W1987577990","doi":"10.1109/bsc.2008.4563231","title":"Low complexity power allocation in multiple-antenna relay networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Telecommunications link; Relay; Computer science; Mathematical optimization; Maximization; Convergence (economics); Iterative method; Scheme (mathematics); Optimization problem; Power (physics); Algorithm; Computer network; Mathematics","score_opus":0.08271486531406036,"score_gpt":0.2758539243331766,"score_spread":0.19313905901911627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987577990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047173243,0.00021548143,0.9450541,0.0017500216,0.00017799356,0.00016578945,1.5351749e-7,0.00017912751,0.0052840672],"genre_scores_gemma":[0.97916824,0.0005678086,0.01869339,0.0010525065,0.000020015357,0.00001260997,0.000004720241,0.0000056820663,0.00047503054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897057,0.00015882072,0.0002522812,0.0002609614,0.00013450904,0.00022284691],"domain_scores_gemma":[0.99890614,0.0001533567,0.00005271449,0.0007115268,0.00011036948,0.000065892906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027471146,0.00010805296,0.00013050385,0.00008533437,0.00023003147,0.000045007808,0.000797788,0.000050230643,0.00007496262],"category_scores_gemma":[0.00006118737,0.00009937508,0.000038922386,0.0005980152,0.00009225698,0.00037115224,0.0003386984,0.00021277266,0.000063222455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006299078,0.0013234826,0.10393188,0.000013211355,0.000039132305,0.00008918298,0.008598687,0.02241962,0.00356359,0.77194345,0.016007733,0.07200706],"study_design_scores_gemma":[0.0003696755,0.000022993256,0.090695165,0.000018414883,3.965246e-7,0.000014373886,0.000013706697,0.9073613,0.000115872186,0.00011225846,0.0011289752,0.00014683385],"about_ca_topic_score_codex":0.000022357712,"about_ca_topic_score_gemma":0.00044938564,"teacher_disagreement_score":0.931995,"about_ca_system_score_codex":0.00005632187,"about_ca_system_score_gemma":0.000036816877,"threshold_uncertainty_score":0.40523982},"labels":[],"label_agreement":null},{"id":"W1987604403","doi":"10.1109/tpds.2011.53","title":"Analyzing the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Coding (social sciences); Computer network; Distributed computing; Peer-to-peer; Theoretical computer science; Mathematics","score_opus":0.05830951086884093,"score_gpt":0.26508845983729284,"score_spread":0.20677894896845192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987604403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006005453,0.0014232355,0.9913766,0.00015991766,0.00034153162,0.00028086416,0.000013410749,0.000061280625,0.00033771823],"genre_scores_gemma":[0.9975545,0.0012511925,0.0010597575,0.00002447568,0.000015977379,0.00004725963,0.0000050513536,0.000006257063,0.000035575657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983978,0.0003830545,0.00048387388,0.00029334016,0.00013538702,0.0003065442],"domain_scores_gemma":[0.99887466,0.00022519355,0.00015422182,0.000601867,0.000064863016,0.0000792086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060351833,0.00016599226,0.00028425443,0.00008533223,0.00040902814,0.00007890464,0.0006753888,0.00007783551,0.000009748302],"category_scores_gemma":[0.0000052562227,0.00012746055,0.000076649965,0.00091779156,0.0001645865,0.00021271066,0.000011454454,0.00032408105,0.0000021641195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005143444,0.0001391022,0.0008773131,0.000020512152,0.000046915706,0.000004118856,0.0010210075,0.97020227,0.000054372904,0.019585853,0.00013352763,0.007863598],"study_design_scores_gemma":[0.00035995722,0.00006121112,0.00910688,0.00013885013,0.000011850664,0.000012705984,0.0001844645,0.98952043,0.000014221122,0.00033732338,0.000093017865,0.00015905776],"about_ca_topic_score_codex":0.0001116013,"about_ca_topic_score_gemma":0.00037580996,"teacher_disagreement_score":0.991549,"about_ca_system_score_codex":0.000050780418,"about_ca_system_score_gemma":0.00003118818,"threshold_uncertainty_score":0.519769},"labels":[],"label_agreement":null},{"id":"W1987613950","doi":"10.1109/t-wc.2008.070675","title":"Beamforming with limited feedback in amplify-and-forward cooperative networks - [transactions letters]","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Nortel (Canada)","funders":"","keywords":"Beamforming; Codebook; Computer science; Relay; Selection (genetic algorithm); Outage probability; Signal-to-noise ratio (imaging); Algorithm; Decoding methods; Control theory (sociology); Telecommunications; Fading; Artificial intelligence","score_opus":0.03863103637690535,"score_gpt":0.257948317003578,"score_spread":0.21931728062667266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987613950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019552333,0.00032602347,0.97431976,0.0042541996,0.00011444354,0.00049662864,0.000010602083,0.00028663728,0.0006394042],"genre_scores_gemma":[0.96118385,0.010472591,0.026768066,0.00091021485,0.000013327679,0.0003379251,0.000013129378,0.000033870685,0.00026700442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789006,0.0004336334,0.00051130564,0.00048046833,0.00025494656,0.00042957376],"domain_scores_gemma":[0.9962958,0.0006824549,0.0001328118,0.0025101919,0.00019510849,0.00018365236],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00026608128,0.00033752277,0.00036664846,0.00042341184,0.0016383647,0.00014953145,0.0017706102,0.00012984175,0.00002536359],"category_scores_gemma":[0.000004658594,0.00032633287,0.00008640227,0.0017226333,0.0005320853,0.0009253674,0.000027820333,0.0011839014,0.00002436828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018022448,0.002370487,0.00050937984,0.000028494287,0.00039025882,0.00003059438,0.013419665,0.7035137,0.0037733992,0.017465737,0.00034622397,0.25797185],"study_design_scores_gemma":[0.0020077676,0.00023714245,0.0015390062,0.0002717619,0.000043414107,0.00021279075,0.00030068317,0.98985714,0.0015506378,0.000032138294,0.00308274,0.00086476025],"about_ca_topic_score_codex":0.000079798265,"about_ca_topic_score_gemma":0.0017817882,"teacher_disagreement_score":0.94755167,"about_ca_system_score_codex":0.00016214914,"about_ca_system_score_gemma":0.000118145945,"threshold_uncertainty_score":0.9999189},"labels":[],"label_agreement":null},{"id":"W1987614763","doi":"10.1109/glocom.2013.6831738","title":"Cooperative vehicular ad-hoc transmission for LTE-A MIMO-downlink using Amplify-and-Forward relaying","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cooperative diversity; Computer science; MIMO; Fading; Pairwise error probability; Antenna diversity; Precoding; Telecommunications link; Diversity gain; Multipath propagation; Computer network; Spatial multiplexing; Transmission (telecommunications); Space–time block code; Cooperative MIMO; 3G MIMO; Wireless; Channel (broadcasting); Telecommunications","score_opus":0.04839379536209901,"score_gpt":0.29398433547397335,"score_spread":0.24559054011187434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987614763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025819995,0.0024374381,0.9669196,0.00300915,0.00010053046,0.0006766316,9.691604e-7,0.00015911482,0.00087657856],"genre_scores_gemma":[0.54494965,0.002275148,0.44916406,0.0019694718,0.000056669953,0.00013157434,0.000011195697,0.000026783913,0.0014154443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987316,0.00013378574,0.00029707502,0.0003954727,0.00014644956,0.00029560382],"domain_scores_gemma":[0.9987037,0.0002505125,0.000068503505,0.0005117015,0.00030263897,0.00016291642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003341928,0.00018684105,0.00022032831,0.00008382292,0.0006136637,0.00034320127,0.0005754799,0.00009081446,0.00015290617],"category_scores_gemma":[0.000042993688,0.00014830078,0.000071386705,0.00028536908,0.000055246524,0.00078678405,0.00025031096,0.00019384976,0.000036230565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019284233,0.00009515669,0.00011505077,0.000039434104,0.000068876725,0.0000017830497,0.0035238336,0.0015193678,0.059003063,0.059552,0.0028305883,0.8732316],"study_design_scores_gemma":[0.0006350856,0.00010680993,0.00019600184,0.00007467932,0.000010767105,0.000009311749,0.000109533095,0.9247989,0.0028134738,0.00060056587,0.07033986,0.00030502473],"about_ca_topic_score_codex":0.000010389446,"about_ca_topic_score_gemma":0.000006785773,"teacher_disagreement_score":0.9232795,"about_ca_system_score_codex":0.000045961337,"about_ca_system_score_gemma":0.00006366876,"threshold_uncertainty_score":0.604753},"labels":[],"label_agreement":null},{"id":"W1987683466","doi":"10.1109/wcnc.2014.6952362","title":"Superposition transmission of layered encoded sources over non-orthogonal amplify-forward relay networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Exponent; Topology (electrical circuits); Multiplexing; Distortion (music); Transmission (telecommunications); Metric (unit); Upper and lower bounds; Computer science; Mathematics; Superposition principle; Telecommunications; Algorithm; Physics; Power (physics); Mathematical analysis; Combinatorics; Engineering","score_opus":0.013385783283441071,"score_gpt":0.24602983197841471,"score_spread":0.23264404869497365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987683466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058836296,0.00014185945,0.93417007,0.00043755997,0.00009271559,0.0001139795,4.5765017e-7,0.00009130109,0.0061157723],"genre_scores_gemma":[0.975264,0.00032031778,0.023592765,0.00044152257,0.000060750048,0.000008784693,0.000011453385,0.0000080283235,0.00029239338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881226,0.00019591402,0.0003129903,0.00025961013,0.00021820748,0.00020100587],"domain_scores_gemma":[0.99893975,0.00019402258,0.000086719454,0.00057203165,0.000105228646,0.00010226402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047429075,0.0001327349,0.00019444767,0.00007710998,0.00018755661,0.000074050404,0.0007003707,0.0000919968,0.00016494314],"category_scores_gemma":[0.000013963379,0.000109619585,0.00008934523,0.000327349,0.000047118807,0.0003129695,0.00017635808,0.00018354761,0.000010889505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077503304,0.000323107,0.0058028717,0.000038982453,0.00007713564,0.0000022198744,0.0033242437,0.046100173,0.04858723,0.31143275,0.0049572475,0.57927656],"study_design_scores_gemma":[0.00043704745,0.00009889423,0.0063118283,0.000055674398,0.000005389666,0.000003868386,0.000010367233,0.9791814,0.0045530437,0.00030392542,0.008867757,0.00017079465],"about_ca_topic_score_codex":0.000008778605,"about_ca_topic_score_gemma":0.00001799357,"teacher_disagreement_score":0.9330812,"about_ca_system_score_codex":0.00001697187,"about_ca_system_score_gemma":0.000027040935,"threshold_uncertainty_score":0.44701567},"labels":[],"label_agreement":null},{"id":"W1987844856","doi":"10.1109/jsac.2014.2384331","title":"Delay Optimization and Cross-Layer Design in Multihop Wireless Networks With Network Coding and Successive Interference Cancelation","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Quality of service; Computer network; Network packet; Wireless network; Scheduling (production processes); Time division multiple access; Linear network coding; Wireless; Mathematical optimization; Telecommunications","score_opus":0.04377820636257169,"score_gpt":0.3051203125412626,"score_spread":0.2613421061786909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987844856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04101474,0.00077635,0.9567215,0.0008815627,0.00008915964,0.00025435357,3.6751027e-7,0.000045147426,0.00021684592],"genre_scores_gemma":[0.93033195,0.0070021474,0.06230656,0.00023628316,0.00005002719,0.000040642906,0.0000051618927,0.000014561132,0.000012644825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750775,0.0012805844,0.00048122325,0.00027547163,0.00015327694,0.0003016923],"domain_scores_gemma":[0.9965951,0.0017211683,0.00032455547,0.00080206816,0.00044028272,0.00011681324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010902487,0.00019370297,0.00024647187,0.0002533111,0.00067573,0.000509424,0.0010836875,0.00009918331,0.000003532024],"category_scores_gemma":[0.00017274194,0.0001751229,0.000015597981,0.0013123539,0.00015379301,0.0007371747,0.00025719954,0.0009468175,6.2733204e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054191325,0.00006764827,0.025928179,0.0000027465605,0.00001439766,0.0000023957466,0.0007866461,0.94712734,0.000068981506,0.006086221,0.00003593819,0.019825341],"study_design_scores_gemma":[0.000895828,0.00012708118,0.023497188,0.0004945106,0.0000054753523,0.00005389803,0.000017871416,0.97441196,0.000038829123,0.00019086273,0.00006307052,0.00020339065],"about_ca_topic_score_codex":0.00002088456,"about_ca_topic_score_gemma":0.0009842706,"teacher_disagreement_score":0.8944149,"about_ca_system_score_codex":0.00016437341,"about_ca_system_score_gemma":0.00010832839,"threshold_uncertainty_score":0.71413046},"labels":[],"label_agreement":null},{"id":"W1988115167","doi":"10.1109/twc.2013.071113.121696","title":"Limited Feedback-Based Multi-Antenna Relay Broadcast Channels with Block Diagonalization","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Precoding; Computer science; Relay; Channel state information; Telecommunications link; Codebook; Transmitter; Computer network; Multiplexing; Fading; MIMO; Channel (broadcasting); Telecommunications; Wireless; Power (physics); Algorithm; Physics","score_opus":0.048359425434163786,"score_gpt":0.26941274414553146,"score_spread":0.22105331871136769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988115167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00880974,0.00024475012,0.98166895,0.007380476,0.00024521418,0.00078120234,0.0000106891775,0.00056229666,0.0002967081],"genre_scores_gemma":[0.95076627,0.001381941,0.045360636,0.0010086754,0.000016114642,0.0007887012,0.000029116147,0.000042738084,0.0006057996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978277,0.0005296005,0.00047634993,0.00046159857,0.00032403524,0.00038068971],"domain_scores_gemma":[0.9942962,0.00054888835,0.00020049715,0.0040482897,0.0006995531,0.00020657793],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002168231,0.00032689126,0.00028047126,0.00036422827,0.0013705371,0.00039821953,0.002861727,0.00012644134,0.00008254384],"category_scores_gemma":[0.000011260697,0.00030214695,0.00012783574,0.0016169224,0.00027517736,0.00080403895,0.00003840992,0.0006249695,0.00030875907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011187977,0.009693722,0.0006693573,0.00009271547,0.0006456671,0.0000070573187,0.008344003,0.38121137,0.03285335,0.021543082,0.0021830031,0.5426448],"study_design_scores_gemma":[0.0011397525,0.00014300365,0.00064260425,0.00018984168,0.0000278159,0.000008821182,0.00008335962,0.99001366,0.0048817103,0.000023239509,0.0023903588,0.000455856],"about_ca_topic_score_codex":0.00007291843,"about_ca_topic_score_gemma":0.00028772544,"teacher_disagreement_score":0.9419565,"about_ca_system_score_codex":0.00013382145,"about_ca_system_score_gemma":0.00015314072,"threshold_uncertainty_score":0.9999431},"labels":[],"label_agreement":null},{"id":"W1988191034","doi":"10.1109/isit.2012.6283627","title":"Space information flow: Multiple unicast","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Unicast; Conjecture; Multicast; Computer science; Linear network coding; Mathematics; Theoretical computer science; Topology (electrical circuits); Coding (social sciences); Discrete mathematics; Computer network; Combinatorics; Network packet","score_opus":0.03807315116305765,"score_gpt":0.26444367543534086,"score_spread":0.2263705242722832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988191034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011567527,0.00016945745,0.9482027,0.002048072,0.00020507062,0.00006896851,2.5983195e-7,0.00017430495,0.04797437],"genre_scores_gemma":[0.8800565,0.000111045534,0.11859591,0.0007985806,0.00003462688,0.0000055830815,0.0000034203354,0.0000015189482,0.0003928369],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995571,0.000046584668,0.00010687655,0.000046411187,0.000088774024,0.00015426078],"domain_scores_gemma":[0.9992901,0.00006850522,0.00003025623,0.00047016068,0.000065168824,0.000075788266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000219449,0.0000520374,0.000047645597,0.000043804168,0.00011677865,0.00009375613,0.0004614859,0.000020067138,0.000072641276],"category_scores_gemma":[0.00005689395,0.00004396154,0.000019866413,0.00024480958,0.000011738395,0.0022475666,0.00034095146,0.00006605012,0.0005747566],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014846967,0.000041443374,0.0022636137,0.0000024485328,0.000005889765,6.7721274e-8,0.002712765,0.00017796233,0.00013222318,0.48319876,0.013118091,0.49834523],"study_design_scores_gemma":[0.00015287004,0.00000686463,0.004523988,0.0000038463463,6.826576e-7,0.0000027303226,0.000036458783,0.27953076,0.00059660024,0.00003217905,0.71502304,0.00008999904],"about_ca_topic_score_codex":0.0000028765373,"about_ca_topic_score_gemma":0.000008995375,"teacher_disagreement_score":0.8788997,"about_ca_system_score_codex":0.000023913919,"about_ca_system_score_gemma":0.000013198673,"threshold_uncertainty_score":0.7387525},"labels":[],"label_agreement":null},{"id":"W1988231362","doi":"10.1109/tvt.2012.2196531","title":"Training Designs for Amplify-and-Forward Relaying With Spatially Correlated Antennas","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Channel (broadcasting); Bisection method; Node (physics); Computer science; Spatial correlation; Minimum mean square error; Mean squared error; Iterative method; Algorithm; Convex optimization; Mathematical optimization; Electronic engineering; Mathematics; Regular polygon; Engineering; Power (physics); Telecommunications; Statistics","score_opus":0.06289994223500533,"score_gpt":0.2796249299421162,"score_spread":0.21672498770711085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988231362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022264706,0.00036365484,0.97468513,0.001486823,0.00020593547,0.00036575142,0.0000022683653,0.00052088784,0.00010484189],"genre_scores_gemma":[0.9326091,0.00021769256,0.066671856,0.00023612227,0.000014195616,0.0001604012,0.0000015944714,0.000019281939,0.00006978707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893355,0.00006740861,0.00020737197,0.00028712474,0.00011072251,0.0003938364],"domain_scores_gemma":[0.99900943,0.00016304823,0.0000775865,0.00054966676,0.000110133034,0.00009012582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030130547,0.00017469777,0.00021200872,0.00032590632,0.0005110169,0.00004849925,0.00044984074,0.00021036775,0.000007636582],"category_scores_gemma":[0.000014252272,0.00015363288,0.00005172256,0.00065128546,0.00013044933,0.00029532507,0.000007995656,0.0004492861,0.000011704344],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000834739,0.00029462157,0.00023504412,0.000020413454,0.00024507282,0.0000089308005,0.0029990778,0.006918761,0.023916803,0.06151507,0.00004610083,0.9037166],"study_design_scores_gemma":[0.0060320226,0.002909048,0.0006360683,0.0005715928,0.00032974017,0.0010942419,0.0013290115,0.8323271,0.11026951,0.002585868,0.039695293,0.0022204977],"about_ca_topic_score_codex":0.0000023105597,"about_ca_topic_score_gemma":0.000023046314,"teacher_disagreement_score":0.91034436,"about_ca_system_score_codex":0.000047951427,"about_ca_system_score_gemma":0.000048264676,"threshold_uncertainty_score":0.6264967},"labels":[],"label_agreement":null},{"id":"W1988297085","doi":"10.1109/isit.2007.4557238","title":"A Structured Generalization of Decode-and-Forward Strategies for Multiple-Relay Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Generalization; Computer science; Selection (genetic algorithm); Tree (set theory); Bin; Tree structure; Contrast (vision); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Binary tree; Combinatorics","score_opus":0.02834006449991941,"score_gpt":0.2909823859964748,"score_spread":0.2626423214965554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988297085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017187066,0.00038888727,0.9812534,0.00013500103,0.00011642501,0.00019657375,6.151631e-7,0.000064128326,0.00065792876],"genre_scores_gemma":[0.84951913,0.00019381764,0.14997481,0.00018659803,0.00003322845,0.000006604639,0.00000575339,0.00000458254,0.00007546258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999334,0.0000326785,0.00023974096,0.00016126207,0.000076892335,0.00015543833],"domain_scores_gemma":[0.99916947,0.00022310588,0.00008347041,0.00030826096,0.00016701195,0.00004870464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036767003,0.000083640865,0.00011579227,0.000064048676,0.000118401564,0.00007810935,0.0003439969,0.00005115154,0.000008000322],"category_scores_gemma":[0.0000342082,0.000070886745,0.000036167814,0.00023289741,0.000035371602,0.00026529044,0.00013884756,0.000051475774,2.7903917e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017568558,0.000016342114,0.0016496263,0.000009114541,0.000020181002,2.1777439e-7,0.00068705395,0.020071257,0.0024769485,0.863167,0.0005120267,0.11137266],"study_design_scores_gemma":[0.0004186934,0.000044304594,0.0044656047,0.000009507893,0.0000038233807,0.0000018651633,0.00007157048,0.9897425,0.0018994884,0.0017272854,0.0015089099,0.00010641456],"about_ca_topic_score_codex":0.0000065589456,"about_ca_topic_score_gemma":0.0005107541,"teacher_disagreement_score":0.96967125,"about_ca_system_score_codex":0.000012686194,"about_ca_system_score_gemma":0.00002970652,"threshold_uncertainty_score":0.28906775},"labels":[],"label_agreement":null},{"id":"W1988384836","doi":"10.1109/tcomm.2015.2396916","title":"Queue-Aware Transmission Scheduling for Cooperative Wireless Communications","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Dynamic priority scheduling; Mathematical optimization; Fair-share scheduling; Round-robin scheduling; Scheduling (production processes); Rate-monotonic scheduling; Queue; Computer network; Mathematics; Quality of service","score_opus":0.13224458012143012,"score_gpt":0.3476252542649352,"score_spread":0.21538067414350506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988384836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016034329,0.0011308027,0.974417,0.019797921,0.00028018298,0.00091944076,0.00004102151,0.0005240696,0.0027292534],"genre_scores_gemma":[0.82749534,0.003880562,0.16624483,0.0007730963,0.000023735816,0.0008548306,0.000050329425,0.00003727988,0.00063998264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753636,0.00072372484,0.0006064185,0.00045427572,0.00030337364,0.00037585557],"domain_scores_gemma":[0.99060357,0.001106095,0.00016912617,0.0067081633,0.0010638856,0.0003491434],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007986386,0.00031335646,0.0003342785,0.00028444143,0.0021134845,0.0002916004,0.0061979354,0.00015376859,0.000017108498],"category_scores_gemma":[0.00003117578,0.00032225423,0.00020619883,0.0011517962,0.0003473673,0.00082108227,0.000088286324,0.00073381286,0.00008790977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001081919,0.0027335575,0.000012870347,0.00003736001,0.0002837596,0.0000011669996,0.010827418,0.027899476,0.004162681,0.27692243,0.0032198962,0.67379117],"study_design_scores_gemma":[0.0013461321,0.00022258317,0.000008708222,0.00014516903,0.00004319875,0.000011523195,0.0005549458,0.9183315,0.0056651607,0.0017509058,0.071438424,0.00048174727],"about_ca_topic_score_codex":0.000023657733,"about_ca_topic_score_gemma":0.00026638698,"teacher_disagreement_score":0.890432,"about_ca_system_score_codex":0.00024684364,"about_ca_system_score_gemma":0.00047586087,"threshold_uncertainty_score":0.99992293},"labels":[],"label_agreement":null},{"id":"W1988474002","doi":"10.1049/iet-com.2008.0579","title":"A cooperative turbo coding scheme for wireless fading channels","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Fading; Decodes; Decoding methods; Turbo; Algorithm; Turbo code; Wireless; Cooperative diversity; Coding (social sciences); Computer network; Telecommunications; Mathematics","score_opus":0.0820978407727377,"score_gpt":0.33642992564150187,"score_spread":0.2543320848687642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988474002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031829805,0.0019474018,0.9442252,0.0377738,0.00025524138,0.0009062372,0.000009795499,0.00053444743,0.011164879],"genre_scores_gemma":[0.8996555,0.0015519806,0.09640559,0.0017132667,0.0000605939,0.00016616382,0.000036265676,0.000011381145,0.0003992336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986321,0.00022788146,0.00035513024,0.00031368213,0.00014395603,0.000327249],"domain_scores_gemma":[0.9957972,0.00055770145,0.00013745455,0.0029398615,0.000455042,0.00011271088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005039235,0.00018925562,0.00023745609,0.0001335723,0.0012896224,0.000361372,0.0038531716,0.00007099281,0.000011403589],"category_scores_gemma":[0.00014259035,0.00019487675,0.00010447984,0.0007554851,0.00010162587,0.0006369986,0.0007277051,0.00029727275,0.000030900726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058899177,0.000179307,0.000029534263,0.0000048278225,0.00003099373,4.2800383e-7,0.003865649,0.00017038328,0.008851589,0.8945849,0.0040542926,0.088222235],"study_design_scores_gemma":[0.0009737836,0.00019508791,0.0004267082,0.00017285453,0.000014059253,0.000012611563,0.00020251937,0.8980055,0.0045948285,0.006322813,0.08848854,0.0005906991],"about_ca_topic_score_codex":0.000002551327,"about_ca_topic_score_gemma":0.000021416006,"teacher_disagreement_score":0.89783514,"about_ca_system_score_codex":0.00009105445,"about_ca_system_score_gemma":0.00009587531,"threshold_uncertainty_score":0.9918863},"labels":[],"label_agreement":null},{"id":"W1988559730","doi":"10.1109/wcnc.2010.5506609","title":"On Packet-Level Non-Altruistic Node Cooperation in Wireless Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Node (physics); Network packet; Diversity gain; Wireless; Cooperative diversity; Wireless network; Telecommunications; Fading; Engineering; Channel (broadcasting)","score_opus":0.031184962955623233,"score_gpt":0.27624335902406805,"score_spread":0.24505839606844482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988559730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084534995,0.000011999202,0.895349,0.0012517684,0.0006556277,0.00017801627,5.1990236e-7,0.000105415886,0.017912626],"genre_scores_gemma":[0.99008375,0.00008240803,0.0075072558,0.0016852011,0.00007561359,0.00002403598,0.0000074185227,0.000008103216,0.0005262126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990615,0.00008171018,0.00022116103,0.00028232473,0.0001260552,0.00022724774],"domain_scores_gemma":[0.99875265,0.00023649119,0.000043326138,0.0007821173,0.000108397544,0.000077006975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036401447,0.00012696019,0.00013138425,0.000099142635,0.00016689254,0.00018038785,0.00079506374,0.00007781138,0.00011278526],"category_scores_gemma":[0.00007595746,0.00011195677,0.000026378228,0.0005136061,0.000036133548,0.00022573955,0.00021380279,0.00046075048,0.000095083495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065760964,0.00010837029,0.00088711723,0.0000020779676,0.0000035864457,0.0000040761824,0.00023488331,0.0020722558,0.0021856197,0.8972015,0.0025139675,0.09478],"study_design_scores_gemma":[0.00035707076,0.000032922206,0.008917879,0.000023111632,8.316849e-7,0.0000029157968,0.0000055060614,0.9889387,0.0004886393,0.0004744844,0.00058115995,0.00017679141],"about_ca_topic_score_codex":0.000016192986,"about_ca_topic_score_gemma":0.0016043001,"teacher_disagreement_score":0.9868664,"about_ca_system_score_codex":0.00002972199,"about_ca_system_score_gemma":0.00005633519,"threshold_uncertainty_score":0.45654646},"labels":[],"label_agreement":null},{"id":"W1988563807","doi":"10.1049/iet-com.2013.0078","title":"Signal‐to‐noise‐ratio maximisation for linear multi‐antenna relay communications","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Iran Telecommunication Research Center","keywords":"Relay; Signal-to-noise ratio (imaging); Computer science; Maximal-ratio combining; Antenna (radio); SIGNAL (programming language); Telecommunications; Physics; Fading","score_opus":0.12449000689496947,"score_gpt":0.34261841902958534,"score_spread":0.21812841213461587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988563807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047864963,0.0011204378,0.92907214,0.06434991,0.00014739342,0.0018942959,0.000019628675,0.00045336128,0.0024642104],"genre_scores_gemma":[0.47907332,0.0016383146,0.5140422,0.002302354,0.000036797504,0.0018335677,0.00014935201,0.00002850864,0.00089559896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976765,0.000553369,0.00070788694,0.0004259899,0.00022638375,0.00040987975],"domain_scores_gemma":[0.98742145,0.0011877662,0.0002458668,0.009688371,0.0011995186,0.00025704372],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00070718536,0.00026745643,0.00028161053,0.00026009534,0.0017249531,0.00041851486,0.009068804,0.000119707656,0.00007823165],"category_scores_gemma":[0.00034781528,0.00027994314,0.00016147041,0.0011011654,0.00023205676,0.0010181708,0.0031851148,0.0004404782,0.0008064101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015582036,0.0017252776,0.0011095073,0.00003999685,0.00021445563,3.5409232e-7,0.012950258,0.0017931579,0.06713106,0.6492146,0.040888324,0.2249174],"study_design_scores_gemma":[0.0005085609,0.00007313964,0.0029487093,0.00006096133,0.000017311006,0.0000033509757,0.00016895203,0.85709876,0.0005565476,0.0013710378,0.13681726,0.00037539733],"about_ca_topic_score_codex":0.00007833321,"about_ca_topic_score_gemma":0.00037504314,"teacher_disagreement_score":0.8553056,"about_ca_system_score_codex":0.0001413289,"about_ca_system_score_gemma":0.00015682558,"threshold_uncertainty_score":0.99997157},"labels":[],"label_agreement":null},{"id":"W1988817035","doi":"10.1109/icccn.2013.6614158","title":"Network Coding Based Encryption System for Advanced Metering Infrastructure","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Encryption; Metering mode; Computer network; Embedded system; Computer security; Engineering","score_opus":0.02377571023878973,"score_gpt":0.2520727448046821,"score_spread":0.2282970345658924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988817035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033848952,0.000105950036,0.9922978,0.00057350774,0.00036788586,0.00044754415,3.1105765e-7,0.00033717623,0.0024848771],"genre_scores_gemma":[0.6983163,0.000011933898,0.30097553,0.00041607628,0.000065091204,0.0001324802,0.000003150459,0.000005888086,0.00007359821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918187,0.00006720643,0.0001989653,0.00022102341,0.000094634604,0.00023628016],"domain_scores_gemma":[0.9990245,0.00018091619,0.000075876844,0.0004893013,0.00016653044,0.000062876505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020610385,0.000110151166,0.00013046511,0.00004576463,0.00029118411,0.00022514547,0.000599403,0.000039353312,0.000049431717],"category_scores_gemma":[0.000026282258,0.00009502661,0.000047975846,0.0002789777,0.000012112464,0.00052122603,0.0001745967,0.00007780132,0.00002381092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010552306,0.000015270309,0.00025439417,0.00009384218,0.000022494596,5.5695506e-7,0.00027289486,0.08127241,0.037407897,0.45640692,0.008513913,0.41572884],"study_design_scores_gemma":[0.00038775033,0.000039549235,0.00083239976,0.00008468307,0.0000026868058,0.0000020384398,0.00003773277,0.9912324,0.0020557276,0.001035738,0.0041227834,0.00016653776],"about_ca_topic_score_codex":0.0000019018643,"about_ca_topic_score_gemma":0.0000033045815,"teacher_disagreement_score":0.90996,"about_ca_system_score_codex":0.00007589766,"about_ca_system_score_gemma":0.000025659847,"threshold_uncertainty_score":0.38750726},"labels":[],"label_agreement":null},{"id":"W1988956019","doi":"10.1109/glocom.2009.5426101","title":"Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Resource allocation; Mathematical optimization; Transmission (telecommunications); Channel (broadcasting); Computational complexity theory; Range (aeronautics); Decoding methods; Linear network coding; Computer network; Algorithm; Mathematics; Telecommunications; Engineering","score_opus":0.015190736226470979,"score_gpt":0.258964138700792,"score_spread":0.243773402474321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988956019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08257282,0.00059367385,0.90994835,0.0033603255,0.00003937704,0.00022875027,1.7224873e-7,0.0001332046,0.0031233197],"genre_scores_gemma":[0.9658056,0.0012224539,0.031532545,0.0009492589,0.000023845023,0.000009674731,0.000004981203,0.000003845879,0.00044778865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991153,0.00015643136,0.00019579753,0.00028119245,0.00008064464,0.00017061773],"domain_scores_gemma":[0.99949783,0.0000864856,0.0000417568,0.0002086136,0.000097597105,0.00006769572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038149656,0.0001139062,0.00013242579,0.000095965195,0.00018201361,0.00017066082,0.00021768431,0.00006292354,0.00002340287],"category_scores_gemma":[0.00003109576,0.00010519521,0.000013705722,0.00052005757,0.000024325258,0.00050735514,0.00012130373,0.0001834365,0.000010539138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005815449,0.0001848345,0.0032846967,0.000004268242,0.000027501934,0.0000041959647,0.0025159377,0.17412986,0.0026248698,0.31987116,0.0047212862,0.49257323],"study_design_scores_gemma":[0.00029929233,0.00012789718,0.011068397,0.000016752365,0.0000021008896,0.0000129871705,0.000013387054,0.98737925,0.00021999545,0.00011081244,0.0006140245,0.00013508301],"about_ca_topic_score_codex":0.000005092513,"about_ca_topic_score_gemma":0.00009095941,"teacher_disagreement_score":0.8832328,"about_ca_system_score_codex":0.00004340726,"about_ca_system_score_gemma":0.00002807617,"threshold_uncertainty_score":0.42897364},"labels":[],"label_agreement":null},{"id":"W1989431552","doi":"10.1049/iet-com.2013.0206","title":"Simplified maximum‐likelihood detectors for full‐rate alternate‐relaying cooperative systems","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Maximum likelihood; Detector; Computer science; Statistics; Mathematics; Telecommunications","score_opus":0.05475262002154921,"score_gpt":0.29903515101822525,"score_spread":0.24428253099667604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989431552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013773385,0.0037006084,0.96045864,0.011099672,0.00060028647,0.0023249865,0.000023056542,0.0006323153,0.0073870313],"genre_scores_gemma":[0.95757085,0.0016968898,0.038088884,0.0006728315,0.00005954908,0.0015442603,0.00005016614,0.000030827076,0.00028571984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780595,0.000616672,0.00056071853,0.00039663268,0.00016459606,0.00045545137],"domain_scores_gemma":[0.9934444,0.0011305908,0.00023306154,0.0041416036,0.0008639183,0.00018645682],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00066690723,0.0002579186,0.00029598348,0.00015207763,0.0013027452,0.00081369077,0.004749648,0.00009607158,0.000037501097],"category_scores_gemma":[0.00019528637,0.00024726338,0.000116888696,0.0006423892,0.00013740806,0.0008826629,0.0015355189,0.0003691551,0.00032219177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023322968,0.0005608595,0.0005282301,0.000066752065,0.00037613988,0.0000014481055,0.006066929,0.0028064149,0.05107711,0.72245234,0.01990984,0.19613063],"study_design_scores_gemma":[0.0010788856,0.00019981634,0.0007735594,0.0001307317,0.000027133721,0.000019744306,0.0004984735,0.9178485,0.0010821335,0.008730744,0.068896554,0.00071372575],"about_ca_topic_score_codex":0.000100871366,"about_ca_topic_score_gemma":0.00015951043,"teacher_disagreement_score":0.94379747,"about_ca_system_score_codex":0.0001220718,"about_ca_system_score_gemma":0.00012317541,"threshold_uncertainty_score":0.999998},"labels":[],"label_agreement":null},{"id":"W1989462391","doi":"10.1109/iwcmc.2013.6583661","title":"The Directional Relay (DR) scheme-aided LTE-A communication systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Relay; Interference (communication); Scheme (mathematics); Enhanced Data Rates for GSM Evolution; Computer science; Signal-to-noise ratio (imaging); SIGNAL (programming language); Relay channel; Antenna (radio); Signal-to-interference-plus-noise ratio; Terminal (telecommunication); Noise (video); Reuse; Computer network; Topology (electrical circuits); Electronic engineering; Telecommunications; Mathematics; Engineering; Electrical engineering; Power (physics); Artificial intelligence; Physics","score_opus":0.03141303472193066,"score_gpt":0.2628464660113347,"score_spread":0.23143343128940405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989462391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011450558,0.014070654,0.6794022,0.05972045,0.0013505613,0.0012679222,6.1401886e-7,0.0011592607,0.23157783],"genre_scores_gemma":[0.9412134,0.0033941548,0.03254768,0.00064254465,0.00006294365,0.00027611924,0.0000053142858,0.000010022339,0.021847796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891466,0.0003268321,0.00024209156,0.00016066546,0.00018781211,0.0001679558],"domain_scores_gemma":[0.99758637,0.00054296775,0.00008384158,0.0014182713,0.00030902345,0.000059525675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053393847,0.000088575114,0.0000822869,0.00003612623,0.001001697,0.00069076766,0.0016102133,0.000035723737,0.00007443948],"category_scores_gemma":[0.00008402718,0.00005818694,0.000038666753,0.0003675988,0.00007039188,0.0005607528,0.000579828,0.00018660667,0.0005005552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010094759,0.00003072803,0.0004998712,0.000001563827,0.00002098663,9.304672e-8,0.00022620591,0.00020503957,0.0011320306,0.8985757,0.07495058,0.024356179],"study_design_scores_gemma":[0.00021595303,0.000020655574,0.0063922065,0.00003309158,0.0000019618776,0.0000112287835,0.0001320042,0.63850886,0.0003956272,0.0013107944,0.35277516,0.00020245709],"about_ca_topic_score_codex":0.00008173442,"about_ca_topic_score_gemma":0.00006028842,"teacher_disagreement_score":0.92976284,"about_ca_system_score_codex":0.000052384235,"about_ca_system_score_gemma":0.000037262045,"threshold_uncertainty_score":0.77043444},"labels":[],"label_agreement":null},{"id":"W1989607297","doi":"10.1109/wcl.2012.120312.120718","title":"Performance of Non-Symmetric Relaying Networks in the Presence of Interferers with Unequal Powers","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Rayleigh fading; Upper and lower bounds; Computer science; Topology (electrical circuits); Moment-generating function; Monte Carlo method; Fading; Interference (communication); Applied mathematics; Algorithm; Mathematics; Telecommunications; Statistics; Probability density function; Combinatorics; Decoding methods; Mathematical analysis; Channel (broadcasting)","score_opus":0.036815811878722564,"score_gpt":0.27313305761606765,"score_spread":0.23631724573734508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989607297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8750735,0.00072168186,0.11978511,0.0028038376,0.00012185908,0.00028322742,7.7726327e-7,0.000026017213,0.0011839983],"genre_scores_gemma":[0.9904326,0.0014154875,0.007508084,0.0005549338,0.000015564967,0.000055413424,0.0000035434418,0.000009899771,0.0000044750705],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998307,0.0005493992,0.0004479005,0.0001483765,0.0002536808,0.00029363498],"domain_scores_gemma":[0.99567336,0.0009582325,0.0003036426,0.002893709,0.00012608938,0.000044963977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011252218,0.00014246548,0.00022578091,0.00027792127,0.00019735246,0.00003548919,0.0044990266,0.000043734617,0.0000016790708],"category_scores_gemma":[0.000030322366,0.000107896994,0.00005124067,0.0020990733,0.000350163,0.0006468621,0.00051181566,0.00045725945,0.0000020586788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017275888,0.0019095731,0.44167492,0.00019823169,0.00026548194,0.0000029507532,0.07661229,0.13315287,0.034945436,0.078394756,0.0024254047,0.23024532],"study_design_scores_gemma":[0.0005688441,0.00013117422,0.059714593,0.0004514158,0.000016805727,0.000009982532,0.0007374764,0.935922,0.0017227428,0.0000029640928,0.0004259533,0.0002960041],"about_ca_topic_score_codex":0.00003533623,"about_ca_topic_score_gemma":0.000038986444,"teacher_disagreement_score":0.8027692,"about_ca_system_score_codex":0.00005123556,"about_ca_system_score_gemma":0.000036599176,"threshold_uncertainty_score":0.83603853},"labels":[],"label_agreement":null},{"id":"W1990004194","doi":"10.1002/wcm.383","title":"Channel‐relay price pair: towards arbitrating incentives in wireless <i>ad hoc</i> networks","year":2006,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Relay; Node (physics); Wireless network; Wireless; Game theory; Nash equilibrium; Bargaining problem; Incentive; Shared resource; Channel (broadcasting); Mathematical optimization; Telecommunications; Microeconomics; Economics","score_opus":0.018853788712976285,"score_gpt":0.26401166148029115,"score_spread":0.24515787276731488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990004194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3726559,0.037504334,0.5830778,0.0015852314,0.0002367987,0.00084111263,0.0000029705295,0.0005179527,0.0035779353],"genre_scores_gemma":[0.9699936,0.0118006375,0.017609773,0.00028743825,0.00006707171,0.00012058543,0.00003378827,0.000026227031,0.000060910592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973152,0.0006228851,0.00075063057,0.00055314426,0.00020983176,0.00054828305],"domain_scores_gemma":[0.99669194,0.0005912588,0.00032006943,0.0020779835,0.00021069845,0.00010804817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010761413,0.00031382122,0.00040465582,0.00020670774,0.0010883302,0.0004085155,0.0024469222,0.00012913547,0.0000029988373],"category_scores_gemma":[0.00001837871,0.0003318626,0.00008898302,0.0012180808,0.00025279028,0.00049495534,0.0029848528,0.0007223601,0.0000039757574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009696885,0.0006295294,0.004006916,0.000044186167,0.000036134712,0.0000067340093,0.0043894122,0.016663913,0.0011874458,0.07127655,0.00022380592,0.9015257],"study_design_scores_gemma":[0.00054297654,0.00005793233,0.0050462275,0.00029238596,0.00000562637,0.000014605417,0.00028952648,0.98517114,0.00014243605,0.00022286065,0.007805647,0.0004086281],"about_ca_topic_score_codex":0.00006465937,"about_ca_topic_score_gemma":0.00030551368,"teacher_disagreement_score":0.96850723,"about_ca_system_score_codex":0.00011661979,"about_ca_system_score_gemma":0.00009704356,"threshold_uncertainty_score":0.99991333},"labels":[],"label_agreement":null},{"id":"W1990056525","doi":"10.1155/2014/193954","title":"Advanced MIMO Techniques in the Heterogeneous Networks","year":2014,"lang":"en","type":"article","venue":"International Journal of Antennas and Propagation","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Beijing; China; Telecommunications; Wireless broadband; Wireless; Broadband; Research center; Center (category theory); Mobile broadband; Engineering; Library science; Computer science; Engineering management; Political science; Wireless network","score_opus":0.016140846998289878,"score_gpt":0.2771078529408341,"score_spread":0.26096700594254424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990056525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042186256,0.00079652976,0.9483418,0.00762961,0.00032406315,0.000091827795,1.6534771e-7,0.0000140799575,0.00061569293],"genre_scores_gemma":[0.99221677,0.0015602052,0.0051411134,0.000929712,0.00013733488,0.000002864736,8.514352e-7,0.0000022481427,0.000008924118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992815,0.00015631682,0.0002424093,0.00006977206,0.00018742494,0.00006256401],"domain_scores_gemma":[0.9993274,0.000104853054,0.000178781,0.00011606549,0.00025398366,0.000018873334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007513368,0.000052789783,0.000072497976,0.00009419844,0.000048190705,0.00014073543,0.00066224614,0.000020942898,0.0000023206273],"category_scores_gemma":[0.000067354704,0.000034395845,0.00002971435,0.00010815574,0.000023926581,0.00032916322,0.00007306484,0.000137606,4.8063316e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002735441,0.000043328382,0.000774906,0.0000015808448,0.000013414344,0.0000117425825,0.00064528786,0.0006282911,0.0016973716,0.025910996,0.000097353055,0.9701484],"study_design_scores_gemma":[0.0013181478,0.00075796695,0.020023199,0.00044396333,0.000009776517,0.0012135053,0.00012913463,0.90865374,0.0051720575,0.010678205,0.051284466,0.00031584964],"about_ca_topic_score_codex":0.0000011913835,"about_ca_topic_score_gemma":0.000010383067,"teacher_disagreement_score":0.96983254,"about_ca_system_score_codex":0.000017715764,"about_ca_system_score_gemma":0.00001320557,"threshold_uncertainty_score":0.14026219},"labels":[],"label_agreement":null},{"id":"W1990058139","doi":"10.1109/icc.2014.6884119","title":"Selective DF relaying in multi-relay networks with different modulation levels","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Carleton University","funders":"","keywords":"Relay; Bit error rate; Computer science; Transmission (telecommunications); Modulation (music); Signal-to-noise ratio (imaging); Set (abstract data type); Expression (computer science); Selection (genetic algorithm); Base station; SIGNAL (programming language); Channel (broadcasting); Electronic engineering; Computer network; Telecommunications; Engineering; Artificial intelligence; Power (physics); Physics","score_opus":0.051480309839851024,"score_gpt":0.27628145342854893,"score_spread":0.2248011435886979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990058139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060509242,0.000052488427,0.9366897,0.00037898164,0.000063534026,0.0001524858,5.2589776e-8,0.00011373859,0.0020398088],"genre_scores_gemma":[0.96562475,0.000033837237,0.033699267,0.00028860243,0.000020982874,0.000021754027,0.0000015134523,0.000007657448,0.0003016552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989716,0.00023684514,0.0001849095,0.00027934153,0.000120690616,0.00020660438],"domain_scores_gemma":[0.99916214,0.00017166874,0.00006190173,0.00046222864,0.000089866786,0.000052190884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028329602,0.00012392938,0.0001408866,0.00009143563,0.00015148176,0.000095048614,0.00043992265,0.00004798039,0.0000114661225],"category_scores_gemma":[0.00003129172,0.00009194284,0.000021901582,0.0004777238,0.000021412163,0.00030386262,0.0001988421,0.00022958234,0.0000066007174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019363262,0.0002227281,0.06476114,0.0000057328743,0.000029320556,0.0000015572043,0.0024797851,0.56157637,0.0007570715,0.12089393,0.00017953131,0.24907346],"study_design_scores_gemma":[0.00041721162,0.000039564657,0.21995421,0.00003085181,8.9692514e-7,0.0000011603158,0.000007271852,0.77914834,0.00012557564,0.000067914516,0.00009202689,0.00011497356],"about_ca_topic_score_codex":0.0000103877455,"about_ca_topic_score_gemma":0.00055964687,"teacher_disagreement_score":0.9051155,"about_ca_system_score_codex":0.00007954085,"about_ca_system_score_gemma":0.000015150096,"threshold_uncertainty_score":0.37493202},"labels":[],"label_agreement":null},{"id":"W1990521196","doi":"10.1109/tvt.2013.2269152","title":"Distributed Channel Selection in Time-Varying Radio Environment: Interference Mitigation Game With Uncoupled Stochastic Learning","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Potential game; Nash equilibrium; Stochastic game; Computer science; Channel (broadcasting); Interference (communication); Game theory; Mathematical optimization; Selection (genetic algorithm); Channel allocation schemes; Function (biology); Distributed algorithm; Distributed computing; Computer network; Wireless; Telecommunications; Mathematics; Artificial intelligence; Mathematical economics","score_opus":0.009249489396784908,"score_gpt":0.2050348044586364,"score_spread":0.19578531506185148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990521196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13045041,0.00005558926,0.8676408,0.0011171886,0.00003509139,0.0003326509,8.0740324e-7,0.00035683028,0.000010618967],"genre_scores_gemma":[0.9970395,0.000086658416,0.0024494699,0.000041290074,0.0000056991767,0.0002764998,0.0000059846425,0.000014109847,0.000080768215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881065,0.00012247809,0.0002340922,0.00039101165,0.0001620539,0.00027974477],"domain_scores_gemma":[0.9993779,0.00007263671,0.000089861525,0.00033765813,0.00007133463,0.000050584862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001313358,0.0001816273,0.00018976009,0.0004628097,0.00023456117,0.00008493025,0.0005406086,0.0001560531,0.00007090828],"category_scores_gemma":[0.000009980413,0.00017583767,0.000036578927,0.0010908403,0.00010428086,0.0003590872,0.000012445485,0.0007088374,0.0001603132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018234801,0.00019920623,0.000092594724,0.0000059494255,0.00004319796,0.0000045035954,0.00031355993,0.91057825,0.0388937,0.00034335957,0.000007121531,0.049500298],"study_design_scores_gemma":[0.00059152907,0.00027872436,0.00028171937,0.000099549936,0.000009149844,0.00003846235,0.000030251089,0.982428,0.01569337,0.0002900502,0.00004406508,0.000215106],"about_ca_topic_score_codex":0.000013058837,"about_ca_topic_score_gemma":0.000019413177,"teacher_disagreement_score":0.8665891,"about_ca_system_score_codex":0.0002079346,"about_ca_system_score_gemma":0.000029862864,"threshold_uncertainty_score":0.71704525},"labels":[],"label_agreement":null},{"id":"W1990842717","doi":"10.1002/ett.1231","title":"Antenna combining for multi‐antenna multi‐relay channels","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Antenna (radio); Beamforming; Computer science; Maximal-ratio combining; Channel (broadcasting); Antenna diversity; Constraint (computer-aided design); Topology (electrical circuits); Power (physics); Electronic engineering; Diversity gain; Telecommunications; Computer network; Electrical engineering; MIMO; Mathematics; Engineering; Fading; Physics","score_opus":0.09208213444534645,"score_gpt":0.32128555549961807,"score_spread":0.2292034210542716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990842717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040759135,0.0005724772,0.9924837,0.0021419618,0.0005064319,0.00060468505,0.0000137846255,0.0006234721,0.0026459065],"genre_scores_gemma":[0.66100675,0.0010259454,0.33534732,0.00078675913,0.000031382355,0.00006050474,0.000023118537,0.000047088193,0.0016711522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770683,0.0005276317,0.0006325231,0.00045715625,0.00016828864,0.0005075481],"domain_scores_gemma":[0.99593383,0.00072548504,0.00019142816,0.0025821258,0.00036350478,0.00020362494],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017508363,0.00027752953,0.00023699047,0.00038466728,0.0018608783,0.00023681117,0.0029067164,0.00006159118,0.000038322283],"category_scores_gemma":[0.00009421543,0.00029252368,0.00022318949,0.00092094974,0.00013149454,0.0004461011,0.00010325382,0.00063767185,0.00023571536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011710408,0.0063119126,0.00014254497,0.000049728787,0.0004880312,0.00001891071,0.017259832,0.0054732277,0.028734207,0.06989294,0.001486776,0.8700248],"study_design_scores_gemma":[0.0035865735,0.00034947286,0.0045305784,0.00021405882,0.000049590046,0.00003511717,0.00059722154,0.9028281,0.0026607104,0.00006896819,0.08408567,0.0009939146],"about_ca_topic_score_codex":0.0000062743625,"about_ca_topic_score_gemma":0.00015097581,"teacher_disagreement_score":0.8973549,"about_ca_system_score_codex":0.00009753349,"about_ca_system_score_gemma":0.000050226707,"threshold_uncertainty_score":0.9999527},"labels":[],"label_agreement":null},{"id":"W1991008499","doi":"10.1109/vetecf.2010.5594267","title":"Interference Aware Relay Assignment Schemes for Multiuser Cognitive Radio Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cognitive radio; Relay; Interference (communication); Computer science; Computational complexity theory; Constraint (computer-aided design); Single antenna interference cancellation; Computer network; Mathematical optimization; Algorithm; Telecommunications; Mathematics; Wireless; Decoding methods","score_opus":0.04924985002454341,"score_gpt":0.3061412943846655,"score_spread":0.25689144436012207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991008499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006419153,0.00016660048,0.98915625,0.00064853305,0.0007082713,0.00042989643,0.0000026247774,0.00016444827,0.002304212],"genre_scores_gemma":[0.97840154,0.000058385267,0.01879426,0.00022057514,0.000065288245,0.00016591462,0.000005055595,0.0000072398716,0.0022817457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991683,0.00006616341,0.00019134203,0.00027815465,0.00011025502,0.00018577997],"domain_scores_gemma":[0.99867773,0.0003938725,0.00006568378,0.000499817,0.00028091637,0.00008198114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030793448,0.000115058014,0.00012908742,0.000050398117,0.00020310508,0.00022644585,0.00079156173,0.000054328797,0.000049290156],"category_scores_gemma":[0.00011997817,0.0000931519,0.000046105124,0.00014529358,0.000043436266,0.00030015834,0.00031984664,0.00020921745,0.000045821056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033598037,0.00027639433,0.0022215473,0.000045300178,0.00011889679,0.0000034304824,0.0026942717,0.000082986524,0.020251535,0.71100396,0.011802647,0.25146544],"study_design_scores_gemma":[0.0011160934,0.00014668208,0.00070782553,0.00015551099,0.000009948497,0.000012222301,0.00028904033,0.8975912,0.012492231,0.00012263036,0.086938895,0.00041774882],"about_ca_topic_score_codex":0.000004330639,"about_ca_topic_score_gemma":0.00004269887,"teacher_disagreement_score":0.97198236,"about_ca_system_score_codex":0.000023463655,"about_ca_system_score_gemma":0.000049801118,"threshold_uncertainty_score":0.37986246},"labels":[],"label_agreement":null},{"id":"W1991017500","doi":"10.1049/iet-com.2014.0397","title":"Cooperative clustering‐based medium access control for broadcasting in vehicular <i>ad‐hoc</i> networks","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Vehicular ad hoc network; Broadcasting (networking); Wireless ad hoc network; Computer network; Access control; Mobile ad hoc network; Control (management); Telecommunications; Wireless; Artificial intelligence","score_opus":0.05955099436901137,"score_gpt":0.32680505706810997,"score_spread":0.26725406269909857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991017500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043877086,0.0026624103,0.97919637,0.015001989,0.00018506144,0.00074874196,0.0000056730823,0.000190683,0.0015702936],"genre_scores_gemma":[0.95172715,0.0011558209,0.04284038,0.0034960918,0.000054657336,0.00059622596,0.000054502918,0.000022968448,0.000052188643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977126,0.0008583888,0.0005248226,0.0003695537,0.00014518635,0.0003894377],"domain_scores_gemma":[0.99376565,0.0022728434,0.00019944164,0.0032121819,0.00043218394,0.0001176985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013090683,0.00022025617,0.00032621413,0.00015735571,0.0007519104,0.0004330755,0.00523064,0.00010225781,0.000009655832],"category_scores_gemma":[0.00043739995,0.00022596118,0.000101343074,0.00083055126,0.0001579814,0.0005848788,0.0013337078,0.0004521457,0.000009119707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101538266,0.00085519097,0.0030282747,0.000060575887,0.00012430687,0.0000017917585,0.0028949657,0.61035895,0.0017866562,0.09026439,0.005092098,0.28543127],"study_design_scores_gemma":[0.0015209785,0.00006572646,0.0011810258,0.00009795677,0.000009305263,0.0000017786335,0.000019465417,0.919246,0.00006440878,0.00022937125,0.077322856,0.00024112535],"about_ca_topic_score_codex":0.000008228964,"about_ca_topic_score_gemma":0.0016775517,"teacher_disagreement_score":0.9512884,"about_ca_system_score_codex":0.00009659669,"about_ca_system_score_gemma":0.00012868046,"threshold_uncertainty_score":0.9719918},"labels":[],"label_agreement":null},{"id":"W1991070227","doi":"10.1109/tvt.2014.2337880","title":"Compute-and-Forward: Optimization Over Multisource–Multirelay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Multicast; Transmission (telecommunications); Mathematical optimization; Constraint (computer-aided design); Optimization problem; Network topology; Throughput; Transmission delay; Limit (mathematics); Topology (electrical circuits); Computer network; Distributed computing; Algorithm; Mathematics; Wireless; Telecommunications","score_opus":0.009463640773458426,"score_gpt":0.23151500208498912,"score_spread":0.2220513613115307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991070227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045791026,0.00021394223,0.9919987,0.0018136799,0.00031691947,0.00019600133,6.9559576e-7,0.00072551146,0.00015546424],"genre_scores_gemma":[0.92765236,0.00059956306,0.07104393,0.0005329853,0.000022456685,0.000045288594,0.0000018428996,0.000017004888,0.00008455145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877393,0.0001472136,0.00024772694,0.00042368946,0.00013761508,0.00026983643],"domain_scores_gemma":[0.9987617,0.00012675504,0.00007925475,0.0008590398,0.0000959057,0.00007730595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022342423,0.00019231625,0.0002166437,0.0003545423,0.0004544273,0.00008148534,0.0006764698,0.0002659662,0.000021936607],"category_scores_gemma":[0.000011293492,0.00019066215,0.00007225508,0.00077085267,0.00013967091,0.0001896408,0.000022173268,0.000505869,0.000020678173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031590346,0.0000625135,0.000030499094,0.0000020953196,0.000023290404,0.0000012696361,0.000052687752,0.74017894,0.00016341243,0.0082360655,0.00003919033,0.2512069],"study_design_scores_gemma":[0.00055890693,0.00010725066,0.000094886636,0.000028312876,0.000012019966,0.000021446804,0.0000062831436,0.9925259,0.0011483594,0.0001233569,0.0051666917,0.00020662742],"about_ca_topic_score_codex":0.0000040506743,"about_ca_topic_score_gemma":0.000015543981,"teacher_disagreement_score":0.9230733,"about_ca_system_score_codex":0.00004546265,"about_ca_system_score_gemma":0.000013248177,"threshold_uncertainty_score":0.77749765},"labels":[],"label_agreement":null},{"id":"W1991137903","doi":"10.1145/1631272.1631443","title":"On the benefits of cooperative video broadcast over WMANs and WLANs","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Broadcasting (networking); Energy consumption; TRACE (psycholinguistics); Mobile device; Channel (broadcasting); Real-time computing; Mobile telephony; Mobile radio; Electrical engineering; Engineering","score_opus":0.035475679426920946,"score_gpt":0.27054896901270564,"score_spread":0.2350732895857847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991137903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5950426,0.0032815505,0.20694865,0.05100413,0.00018673115,0.00070433615,0.0000059985186,0.000222133,0.14260389],"genre_scores_gemma":[0.99414,0.0006814837,0.0009896143,0.0037237438,0.000011922738,0.0000026854216,4.8475766e-7,0.0000018196325,0.0004481922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994693,0.00008068439,0.00011394502,0.00014112022,0.00010329305,0.000091678645],"domain_scores_gemma":[0.9991572,0.00025432778,0.0000336995,0.00044503808,0.00007884475,0.000030896506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001609004,0.00007391257,0.00008668901,0.000031240183,0.00015074862,0.00006780972,0.0004474866,0.000018800582,0.00007493504],"category_scores_gemma":[0.000039656512,0.00004432805,0.000019563704,0.00023561023,0.000041137446,0.00013826703,0.00012245472,0.00008827586,0.000008683922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026399362,0.000027201102,0.000043007996,3.6186788e-7,0.0000040314617,1.5630985e-7,0.0008113581,0.00015451897,0.0005466196,0.9083694,0.0021689218,0.08787176],"study_design_scores_gemma":[0.003098856,0.0029524972,0.26766065,0.00048235012,0.000027438966,0.000034286117,0.0004896255,0.5917757,0.04627104,0.023163756,0.062600315,0.0014434478],"about_ca_topic_score_codex":0.0000030591787,"about_ca_topic_score_gemma":0.000023587034,"teacher_disagreement_score":0.8852057,"about_ca_system_score_codex":0.000007992968,"about_ca_system_score_gemma":0.000014096193,"threshold_uncertainty_score":0.18076456},"labels":[],"label_agreement":null},{"id":"W1991158040","doi":"10.1109/atnac.2011.6096652","title":"Exact performance analysis of multihop relaying systems operating in co-channel interference using the generalized transformed characteristic function","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Interference (communication); Independent and identically distributed random variables; Computer science; Channel (broadcasting); Ergodic theory; Topology (electrical circuits); Co-channel interference; Outage probability; Characteristic function (probability theory); Function (biology); Probability density function; Electronic engineering; Mathematics; Random variable; Telecommunications; Engineering; Statistics","score_opus":0.12458902922708438,"score_gpt":0.30052201175722,"score_spread":0.17593298253013562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991158040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137246,0.00010681851,0.48525602,0.000014155054,0.000099826284,0.00013592676,6.019926e-7,0.000026969941,0.0006350655],"genre_scores_gemma":[0.9970523,0.0002966956,0.0024983229,0.00006247013,0.000012176657,0.000024780422,0.000004945082,0.000005784704,0.000042521282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986437,0.00027579494,0.000514145,0.00023334022,0.00014038503,0.00019265524],"domain_scores_gemma":[0.99902064,0.000104666084,0.00016129391,0.00054100505,0.00013693853,0.000035462497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007547443,0.00013164432,0.00028788258,0.00030314265,0.00022443611,0.00008919121,0.0006685423,0.00004208312,0.000040871593],"category_scores_gemma":[0.000027634664,0.00009208834,0.000073969866,0.0012809655,0.000037268474,0.0005257671,0.00010803136,0.0001696513,0.0000022168015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029998523,0.0008112485,0.12135816,0.00035110346,0.0023932084,0.000011740182,0.17207038,0.33798885,0.20928049,0.047410544,0.0000336741,0.10799061],"study_design_scores_gemma":[0.00021571903,0.00004166484,0.028775152,0.00007835041,0.00005170616,0.0000020723537,0.0003289212,0.9691265,0.0012521378,0.000002905213,0.0000094404495,0.00011538824],"about_ca_topic_score_codex":0.00021057186,"about_ca_topic_score_gemma":0.00012554435,"teacher_disagreement_score":0.63113767,"about_ca_system_score_codex":0.00005951187,"about_ca_system_score_gemma":0.00003860977,"threshold_uncertainty_score":0.37552533},"labels":[],"label_agreement":null},{"id":"W1991160811","doi":"10.1109/vtcfall.2014.6966033","title":"Joint Transceiver Optimization for MIMO Multiuser Relaying Networks with Channel Uncertainties","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; MIMO; Computer science; Robustness (evolution); Optimization problem; Channel state information; Channel (broadcasting); Mathematical optimization; Algorithm; Mathematics; Wireless; Power (physics); Telecommunications","score_opus":0.03676574437239908,"score_gpt":0.24140465618332577,"score_spread":0.2046389118109267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991160811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003748344,0.00011721364,0.99510247,0.0016679192,0.0001197305,0.0002734945,2.0694067e-7,0.00018425735,0.0021598528],"genre_scores_gemma":[0.75164765,0.0001682142,0.24659875,0.0008846646,0.000059848986,0.000057973597,0.000006308141,0.000011792301,0.00056481257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991967,0.00008229841,0.00016652326,0.00024945487,0.0000984523,0.00020657298],"domain_scores_gemma":[0.999109,0.00013121775,0.000059160233,0.00044464433,0.00019956574,0.00005638111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031458243,0.000120859324,0.00013457541,0.000059732145,0.00030592675,0.00013799369,0.00042397945,0.00004440547,0.000024214556],"category_scores_gemma":[0.000025129346,0.00009188227,0.00004698734,0.00023939558,0.000036064295,0.00034593788,0.00006555262,0.00009177538,0.0000028702236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000110980445,0.000019909294,0.000029042081,0.0000054785155,0.000013129826,1.128564e-7,0.0008011027,0.950772,0.00003131158,0.028922059,0.00065263535,0.018742125],"study_design_scores_gemma":[0.00053445157,0.00008985188,0.0001120036,0.000036948597,0.0000051692155,0.0000014911355,0.0000461689,0.9961616,0.00016657195,0.00008667174,0.0025997476,0.00015931913],"about_ca_topic_score_codex":0.0000052374776,"about_ca_topic_score_gemma":0.000042456086,"teacher_disagreement_score":0.7512728,"about_ca_system_score_codex":0.000023572196,"about_ca_system_score_gemma":0.000017336373,"threshold_uncertainty_score":0.37468502},"labels":[],"label_agreement":null},{"id":"W1991265952","doi":"10.1109/vetecf.2010.5594487","title":"Throughput and Spectral Efficiency in ARQ-Based Cooperative Ad Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Medical Research Council","keywords":"Throughput; Computer science; Spectral efficiency; Wireless ad hoc network; Fading; Computer network; Automatic repeat request; Channel (broadcasting); Wireless; Telecommunications","score_opus":0.019875039250246945,"score_gpt":0.26922954865400145,"score_spread":0.2493545094037545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991265952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17308468,0.0014268017,0.8096857,0.0036053632,0.00038497863,0.00029342234,3.9348126e-7,0.00018182264,0.0113368435],"genre_scores_gemma":[0.97473645,0.00054918637,0.023387538,0.0010601567,0.00003479684,0.000013442807,0.0000016431148,0.0000057817956,0.00021099551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990012,0.000103574086,0.00019383237,0.0003306442,0.00010851224,0.00026221934],"domain_scores_gemma":[0.9990529,0.00018992608,0.000037576727,0.00056103326,0.00007625527,0.00008231002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034839808,0.00013487242,0.00014744114,0.00008211182,0.00018160146,0.00019203495,0.0006441403,0.000062648425,0.00009235368],"category_scores_gemma":[0.00004597081,0.000112933834,0.000025947294,0.0005972417,0.00011565078,0.00028657998,0.00025184976,0.00043340834,0.00001376202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002855318,0.00042762642,0.006130689,0.0000073039078,0.00001399563,0.000024722563,0.0027460905,0.007454999,0.006475426,0.66635233,0.0016229419,0.30871528],"study_design_scores_gemma":[0.0006035722,0.00009193006,0.0099597685,0.000015562082,0.000001224516,0.0000057133307,0.000024919183,0.9830304,0.00086376315,0.00020795166,0.004978983,0.00021623225],"about_ca_topic_score_codex":0.0000038180497,"about_ca_topic_score_gemma":0.0011377124,"teacher_disagreement_score":0.9755754,"about_ca_system_score_codex":0.000018974371,"about_ca_system_score_gemma":0.000074197065,"threshold_uncertainty_score":0.46053082},"labels":[],"label_agreement":null},{"id":"W1991684514","doi":"10.1109/itw.2013.6691229","title":"Source broadcasting over erasure channels: Distortion bounds and code design","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Binary erasure channel; Erasure code; Erasure; Broadcasting (networking); Computer network; Decoding methods; Source code; Latency (audio); Channel (broadcasting); Fountain code; Linear network coding; Lossy compression; Channel code; Coding (social sciences); Theoretical computer science; Algorithm; Channel capacity; Telecommunications; Linear code; Block code; Mathematics; Network packet","score_opus":0.053474291612997354,"score_gpt":0.2609578469817037,"score_spread":0.20748355536870636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991684514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019118095,0.00060565287,0.9769525,0.0009910162,0.00010939801,0.000145722,1.0226692e-7,0.00016336468,0.001914165],"genre_scores_gemma":[0.9711242,0.00016478497,0.025163064,0.000626162,0.00005012228,0.000024410496,8.496246e-7,0.000006302075,0.0028401564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992765,0.000117426105,0.0001353688,0.00020359544,0.000109561865,0.00015752079],"domain_scores_gemma":[0.9993359,0.00012252663,0.000046820052,0.0003358758,0.00008563292,0.00007327848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024616873,0.00008855206,0.00008356252,0.000041929437,0.0002886513,0.00040773614,0.00033741785,0.000031592575,0.00011247849],"category_scores_gemma":[0.000044916684,0.000076282624,0.000017999324,0.00018798749,0.00003402863,0.0005649178,0.00027021824,0.0000971791,0.000042501066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003702174,0.00006251901,0.002912054,0.000011926706,0.00002316675,8.4256703e-7,0.0038354022,0.0013706863,0.0059547196,0.022063494,0.026222527,0.937539],"study_design_scores_gemma":[0.00021048209,0.00004254519,0.005959726,0.000028387285,0.0000022819631,0.000008871845,0.000034353186,0.9670869,0.0005672261,0.0007417236,0.025127709,0.00018976539],"about_ca_topic_score_codex":0.000016399457,"about_ca_topic_score_gemma":0.000018521365,"teacher_disagreement_score":0.96571624,"about_ca_system_score_codex":0.000027492826,"about_ca_system_score_gemma":0.00001702752,"threshold_uncertainty_score":0.3931809},"labels":[],"label_agreement":null},{"id":"W1991784756","doi":"10.1109/pimrc.2011.6139993","title":"A Stackelberg game for cooperative transmission and random access in cognitive radio networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cognitive radio; Stackelberg competition; Computer science; Relay; Computer network; Random access; Transmission (telecommunications); Cooperative diversity; Nash equilibrium; Telecommunications; Mathematical optimization; Wireless; Fading; Mathematics; Channel (broadcasting)","score_opus":0.09328849345665448,"score_gpt":0.3243101519473786,"score_spread":0.23102165849072415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991784756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074366145,0.0009973643,0.9854687,0.00029584902,0.000057099667,0.00065733795,9.2426217e-7,0.000061332794,0.005024809],"genre_scores_gemma":[0.9882708,0.0020372067,0.008683392,0.0005206235,0.00001932101,0.00012555666,0.0000046292384,0.000007664303,0.00033079233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901175,0.00017593197,0.00022181061,0.00030819775,0.00006821345,0.00021409085],"domain_scores_gemma":[0.999047,0.0004472552,0.00004501607,0.00021299126,0.00015503427,0.00009271758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038060095,0.00013264925,0.00020469076,0.00008851429,0.00012630028,0.00014956215,0.0005361804,0.000053389285,0.00009598793],"category_scores_gemma":[0.000045433546,0.000106828695,0.000035649864,0.00036445828,0.00006244289,0.0006960628,0.000208089,0.00013600127,0.0000013567246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011891392,0.00042657516,0.0028351715,0.000024337118,0.000092316295,0.000013272058,0.03134258,0.0004125716,0.00024334421,0.13653716,0.0018346708,0.82504886],"study_design_scores_gemma":[0.0074102557,0.00022703882,0.0064827846,0.00016877045,0.00001111195,0.000007375235,0.00017052,0.97993153,0.0017317785,0.0013843746,0.0021088799,0.0003655478],"about_ca_topic_score_codex":0.000017319842,"about_ca_topic_score_gemma":0.00014295903,"teacher_disagreement_score":0.9808342,"about_ca_system_score_codex":0.000018002578,"about_ca_system_score_gemma":0.000044213404,"threshold_uncertainty_score":0.4356348},"labels":[],"label_agreement":null},{"id":"W1991926347","doi":"10.1109/bsc.2008.4563209","title":"Lossy source coding for non-uniform sources using LDGM codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossy compression; Algorithm; Computer science; Rate–distortion theory; Distributed source coding; Source code; Coding (social sciences); Theoretical computer science; Variable-length code; Generator matrix; Mathematics; Data compression; Decoding methods; Statistics","score_opus":0.08416726329741155,"score_gpt":0.3006257736321311,"score_spread":0.21645851033471958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991926347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054900695,0.00013024684,0.9389493,0.00046340833,0.00010408332,0.00018990446,6.750493e-7,0.00017499605,0.005086735],"genre_scores_gemma":[0.83144003,0.00022425313,0.16560306,0.00064069533,0.000084833686,0.000012516978,0.0000021009198,0.000010487705,0.0019820435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907553,0.000036515994,0.0002171741,0.00025090156,0.00014356947,0.00027629425],"domain_scores_gemma":[0.9989232,0.000224577,0.00007848877,0.0005402254,0.00015037668,0.00008312725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026732322,0.00013138229,0.0001669071,0.0000899774,0.00092328916,0.00013540982,0.0008938871,0.000043880053,0.000028272536],"category_scores_gemma":[0.000040986866,0.00011709434,0.00007901327,0.0003232186,0.00007860623,0.00040066664,0.00038719174,0.00010124746,0.000018118984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082931794,0.00059781707,0.016481165,0.00015288864,0.00027632428,0.000026605749,0.035481114,0.044052627,0.044682384,0.5770388,0.02822838,0.25289893],"study_design_scores_gemma":[0.00030907392,0.000034893572,0.00019809435,0.00002875689,0.0000033461154,0.000033399876,0.00008053482,0.9697463,0.004704987,0.00017859177,0.02448285,0.00019918938],"about_ca_topic_score_codex":0.000013075397,"about_ca_topic_score_gemma":0.000026206118,"teacher_disagreement_score":0.92569363,"about_ca_system_score_codex":0.00004607876,"about_ca_system_score_gemma":0.00006745822,"threshold_uncertainty_score":0.7101287},"labels":[],"label_agreement":null},{"id":"W1992166214","doi":"10.1109/wcnc.2013.6554598","title":"An enhanced cooperative MAC protocol based on perceptron training","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Computer network; Relay; Handshaking; Network packet; Throughput; Perceptron; Robustness (evolution); Hidden node problem; Wireless; Node (physics); Distributed computing; Wireless network; Machine learning; Artificial neural network; Telecommunications; Engineering","score_opus":0.05437261073583295,"score_gpt":0.3316080191097253,"score_spread":0.2772354083738924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992166214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025926277,0.0000015197318,0.89830154,0.0016642276,0.000049172686,0.025704717,2.8562735e-7,0.00034762928,0.07133829],"genre_scores_gemma":[0.9050893,0.0000013568977,0.040247675,0.0031300345,0.000038686165,0.050751176,0.0000028034726,0.000009175386,0.0007297827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880725,0.00026657505,0.00018323092,0.00033568102,0.00017464737,0.00023264333],"domain_scores_gemma":[0.9987066,0.00009425525,0.00004401791,0.000831024,0.00020074405,0.00012337479],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019866225,0.0001458748,0.00013003631,0.000073213225,0.00026628186,0.00033520875,0.0009056873,0.00003878192,0.001976418],"category_scores_gemma":[0.00002651795,0.00011360478,0.000034286135,0.00030270204,0.00003929545,0.0006683539,0.00009097119,0.00016722541,0.00035272253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022208187,0.00039698495,0.00006218156,0.000009741977,0.000010330742,0.0000012644708,0.0075994655,0.0057584713,0.08481577,0.071886666,0.0029499016,0.826487],"study_design_scores_gemma":[0.0006649048,0.00050220545,0.0015674343,0.00003581445,6.944571e-7,5.529518e-7,0.00018768152,0.98011625,0.012313115,0.00009975347,0.0042718397,0.00023976932],"about_ca_topic_score_codex":0.000005303974,"about_ca_topic_score_gemma":0.000020714366,"teacher_disagreement_score":0.9743578,"about_ca_system_score_codex":0.000043990527,"about_ca_system_score_gemma":0.00009059674,"threshold_uncertainty_score":0.99893594},"labels":[],"label_agreement":null},{"id":"W1992604414","doi":"10.1109/vtcf.2006.101","title":"Spectral Efficiency and User Diversity Gains Through Cooperative Fixed Relays","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer science; Computer network; Software deployment; Wireless; Incentive; Cooperative diversity; Wireless network; Computer security; Diversity (politics); Telecommunications","score_opus":0.03402347925261589,"score_gpt":0.2591022634570504,"score_spread":0.2250787842044345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992604414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3955971,0.00071244984,0.5963369,0.0038128973,0.00013953072,0.00027479263,0.000002122301,0.00047425894,0.0026499599],"genre_scores_gemma":[0.9879393,0.0004793659,0.0109458985,0.00024271352,0.000023442006,0.00002249172,0.0000029103062,0.000006744537,0.00033710958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862146,0.00011502415,0.00021716359,0.0005265074,0.00017159093,0.0003482377],"domain_scores_gemma":[0.99873406,0.00006716217,0.000091099544,0.0008063323,0.00025854653,0.000042785232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017385633,0.00020716042,0.00023766803,0.00015566648,0.00080187916,0.000120511584,0.0012982792,0.00019893312,0.000020590755],"category_scores_gemma":[0.000041862255,0.0001951349,0.000042295713,0.0008631088,0.00047505967,0.00039223285,0.0011592173,0.00042880443,0.000039062932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043423483,0.00011696636,0.0079783145,0.0000049616206,0.000023122737,0.000050908933,0.0005686099,0.00042562553,0.01614063,0.9699293,0.001050587,0.0037066564],"study_design_scores_gemma":[0.005929397,0.0013604936,0.045029506,0.00042869255,0.000121245095,0.00047675899,0.0007552194,0.5166177,0.2679637,0.08784647,0.06964804,0.00382274],"about_ca_topic_score_codex":0.000035484896,"about_ca_topic_score_gemma":0.00015084016,"teacher_disagreement_score":0.8820828,"about_ca_system_score_codex":0.00005267487,"about_ca_system_score_gemma":0.00007625378,"threshold_uncertainty_score":0.795737},"labels":[],"label_agreement":null},{"id":"W1992627689","doi":"10.1109/pimrc.2011.6139886","title":"Radio propagation measurements and channel characterisation pertinent to urban microcellular communications systems incorporating relay links","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Relay; Narrowband; Fading; Emulation; Relay channel; Computer science; Channel (broadcasting); Base station; Computer network; Communications system; Radio propagation; Electronic engineering; Mobile radio; Telecommunications; Engineering; Physics","score_opus":0.13641412841277226,"score_gpt":0.2615910893100599,"score_spread":0.12517696089728766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992627689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11404663,0.0015188494,0.87426674,0.003123819,0.00032311847,0.0012401388,0.0000011424756,0.00035657757,0.0051229536],"genre_scores_gemma":[0.9681349,0.0001585166,0.030843869,0.000350103,0.000039749306,0.000111055946,0.000014978097,0.000011020065,0.0003358123],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998698,0.00026804802,0.00039012558,0.0002911677,0.00018809606,0.00016455304],"domain_scores_gemma":[0.9981878,0.000033873876,0.00018778026,0.0011372342,0.0003285886,0.00012473797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007999049,0.0001414986,0.00014678905,0.000112779795,0.0007479826,0.0003673238,0.00094792614,0.00007720738,0.000004138724],"category_scores_gemma":[0.000056968867,0.00013115928,0.000024307388,0.00037101,0.000039485196,0.0005010136,0.0006383893,0.00021041035,0.000034532106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007819018,0.0012915258,0.05089507,0.00022060622,0.0002755885,0.000006346456,0.12774028,0.0005219149,0.50150764,0.18229873,0.004348917,0.13081521],"study_design_scores_gemma":[0.00072668295,0.0002742467,0.026903681,0.0003589552,0.00002416878,0.000029191511,0.0004492556,0.94725776,0.017462812,0.00017824631,0.005584674,0.00075035123],"about_ca_topic_score_codex":0.00007264795,"about_ca_topic_score_gemma":0.000042021114,"teacher_disagreement_score":0.9467358,"about_ca_system_score_codex":0.0000873305,"about_ca_system_score_gemma":0.000046063084,"threshold_uncertainty_score":0.57529527},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05245409162886313,"score_gpt":0.30287878348957065,"score_spread":0.25042469186070754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992756898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10657401,0.011235801,0.8550136,0.007805365,0.0007336887,0.0010147894,0.000004413207,0.0007428709,0.01687543],"genre_scores_gemma":[0.9729083,0.013315384,0.0124986395,0.0006770844,0.00006921481,0.00028295565,0.00006907909,0.000026747633,0.00015257811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708027,0.0012113319,0.00065328716,0.0002792113,0.0002208606,0.000555051],"domain_scores_gemma":[0.99302363,0.0005960206,0.00021997195,0.0057146675,0.00025923466,0.00018649665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013005923,0.0002513256,0.00029976963,0.0002550309,0.00080780627,0.00024301955,0.005026893,0.00015575836,0.00002148097],"category_scores_gemma":[0.000042817614,0.0002738738,0.00008033913,0.0015674361,0.00022436421,0.0018485317,0.0013163788,0.0007385642,0.00010062612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067734973,0.00078122795,0.011783137,0.000008082515,0.000028848703,5.283426e-7,0.0035020246,0.0013689535,0.0022290726,0.8461893,0.0013586356,0.13274342],"study_design_scores_gemma":[0.00078294304,0.000026500933,0.017360294,0.00016586114,0.000011964892,0.000018112676,0.00014601908,0.963201,0.0009207227,0.00035895154,0.016371598,0.000636029],"about_ca_topic_score_codex":0.000042982985,"about_ca_topic_score_gemma":0.0005651914,"teacher_disagreement_score":0.96183205,"about_ca_system_score_codex":0.00021524633,"about_ca_system_score_gemma":0.000085667605,"threshold_uncertainty_score":0.99997133},"labels":[],"label_agreement":null},{"id":"W1992777992","doi":"10.1109/pimrc.2008.4699956","title":"Code construction for the selective TDMA cooperative broadcast channel","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Time division multiple access; Computer science; Multiplexing; Computer network; Base station; Broadcasting (networking); Channel (broadcasting); Asynchronous communication; Telecommunications link; Code (set theory); Telecommunications","score_opus":0.06535334524032409,"score_gpt":0.2847389282996819,"score_spread":0.2193855830593578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992777992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093542266,0.0005695798,0.98817414,0.0038755331,0.00025781489,0.00042258025,0.0000027873994,0.00013908857,0.0056230365],"genre_scores_gemma":[0.96942157,0.0016310518,0.025266277,0.0013535242,0.00011172537,0.00015156575,0.0000034032025,0.00000791707,0.0020529656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926984,0.00008901716,0.00014323695,0.00022268362,0.00010271792,0.00017251115],"domain_scores_gemma":[0.9986754,0.00040569768,0.000051479423,0.00041741575,0.00040844578,0.00004156397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017690046,0.00010292319,0.00010565755,0.0000381631,0.001092321,0.000073560164,0.0006224754,0.000031388045,0.000023783768],"category_scores_gemma":[0.00006891366,0.0000684881,0.000048910082,0.0004224928,0.00015238595,0.00028994534,0.00017232199,0.00012129315,0.000023148265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042841828,0.00011092513,0.0002064916,0.0000043886184,0.00013113918,0.000002418241,0.011181463,0.0024294609,0.0013099973,0.73898846,0.05276783,0.1928246],"study_design_scores_gemma":[0.0010307101,0.0002164702,0.0016490518,0.000014306316,0.000009463398,0.00019814048,0.00042665732,0.87755156,0.011717047,0.001118288,0.10572658,0.00034175633],"about_ca_topic_score_codex":0.0000055011333,"about_ca_topic_score_gemma":0.000050580547,"teacher_disagreement_score":0.96848613,"about_ca_system_score_codex":0.00004033747,"about_ca_system_score_gemma":0.00009095848,"threshold_uncertainty_score":0.84013605},"labels":[],"label_agreement":null},{"id":"W1992880174","doi":"10.1049/iet-com.2013.0134","title":"Modulation network coding","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Modulation (music); Linear network coding; Computer network; Physics; Network packet","score_opus":0.06457034901352429,"score_gpt":0.29760729472007863,"score_spread":0.23303694570655434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992880174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020354309,0.0016532064,0.90619075,0.027163016,0.0002406828,0.0005106708,8.0852413e-7,0.0006099156,0.061595544],"genre_scores_gemma":[0.87021154,0.0015544652,0.12672746,0.0008946007,0.000049714312,0.00014036214,0.000016609787,0.000008331179,0.00039690177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891114,0.0002785426,0.00026789922,0.00018217675,0.00012950735,0.00023072085],"domain_scores_gemma":[0.99564946,0.00029830725,0.00010028881,0.0036220793,0.00024598208,0.000083870866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029452887,0.00010711574,0.000114431685,0.000060923332,0.00077496015,0.0003110615,0.003188776,0.0000454991,0.000115381474],"category_scores_gemma":[0.00005532285,0.000109477565,0.000052501204,0.00068219303,0.00007890172,0.0008409998,0.0015014966,0.00022887814,0.0005564651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.160108e-7,0.00005504499,0.0008883597,0.0000018215023,0.000015790902,1.0359496e-7,0.00057917135,0.0009694587,0.0008239127,0.818336,0.019538546,0.15879147],"study_design_scores_gemma":[0.0001628634,0.000015505453,0.025174085,0.0000326035,0.000003457597,0.000004279522,0.000028092449,0.88113445,0.00004246563,0.018226847,0.074959464,0.00021589591],"about_ca_topic_score_codex":0.000021297212,"about_ca_topic_score_gemma":0.000049009326,"teacher_disagreement_score":0.880165,"about_ca_system_score_codex":0.000048683567,"about_ca_system_score_gemma":0.00003625208,"threshold_uncertainty_score":0.7152419},"labels":[],"label_agreement":null},{"id":"W1993001665","doi":"10.1109/vetecf.2010.5594222","title":"Low-Density Parity-Check Codes for Two-Way Relay Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decodes; Relay; Relay channel; Code word; Computer science; Low-density parity-check code; Decoding methods; Single antenna interference cancellation; Parity bit; Interference (communication); Soft-decision decoder; Joint (building); Belief propagation; Channel (broadcasting); Algorithm; Theoretical computer science; Computer network; Physics; Engineering","score_opus":0.03973839416307632,"score_gpt":0.29984987285623255,"score_spread":0.2601114786931562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993001665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08497265,0.000049266902,0.9013074,0.0044424976,0.0010022629,0.0002947876,0.0000011055607,0.00029271297,0.0076373364],"genre_scores_gemma":[0.9319393,0.00004043408,0.06434848,0.001092536,0.00013989313,0.000031100793,0.0000037304342,0.000006726277,0.0023978057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991556,0.000059314105,0.00016934422,0.00027957436,0.00011111202,0.00022507425],"domain_scores_gemma":[0.9985124,0.00023307213,0.00005144652,0.0008871135,0.00021870132,0.00009729786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057170604,0.000109639805,0.00014037163,0.00004496986,0.0003450835,0.00020007214,0.00096166186,0.000056163146,0.00007152696],"category_scores_gemma":[0.000116766736,0.00009467666,0.00006649055,0.0002079128,0.000052357642,0.0002881127,0.0004404285,0.00024856106,0.00007368923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007670821,0.00011778815,0.00036762474,0.000008400103,0.000016790864,0.0000013666487,0.00069956284,0.000082409555,0.032828104,0.8908121,0.010941858,0.06411633],"study_design_scores_gemma":[0.0014035157,0.00012398606,0.0024655713,0.0000355552,0.000009629134,0.000020636933,0.00003350554,0.6978379,0.18345642,0.008799751,0.10514015,0.0006733706],"about_ca_topic_score_codex":0.000010525147,"about_ca_topic_score_gemma":0.00049303146,"teacher_disagreement_score":0.88201237,"about_ca_system_score_codex":0.000012557022,"about_ca_system_score_gemma":0.00003664438,"threshold_uncertainty_score":0.3860802},"labels":[],"label_agreement":null},{"id":"W1993644394","doi":"10.1186/1687-1499-2012-103","title":"A multi-layered OFDM system with parallel transmission for multicell cooperative cellular networks","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Korea Communications Commission","keywords":"Computer science; Orthogonal frequency-division multiplexing; Overhead (engineering); Transmission (telecommunications); Computer network; Multimedia Broadcast Multicast Service; Base station; Control channel; Channel state information; Spectral efficiency; Multicast; Synchronization (alternating current); Channel (broadcasting); Electronic engineering; Telecommunications; Wireless","score_opus":0.06652007441007651,"score_gpt":0.2919522977660479,"score_spread":0.2254322233559714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993644394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003440691,0.022746347,0.9713752,0.0011532947,0.00028698088,0.00055396813,0.0000013056173,0.00012537914,0.00031677834],"genre_scores_gemma":[0.86356664,0.014615916,0.12106682,0.00027027528,0.00028093474,0.000085533415,0.000011536967,0.00003462924,0.00006773492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753225,0.0008192025,0.0005587079,0.00028814975,0.00022156393,0.0005801105],"domain_scores_gemma":[0.9967264,0.0008472702,0.00039500993,0.0013287371,0.00032962355,0.00037298826],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012942305,0.00032305036,0.00038836396,0.00013764326,0.0023252694,0.00045518344,0.0016349357,0.000109324465,0.0000023374414],"category_scores_gemma":[0.000008981443,0.0002505659,0.000108383225,0.00048999296,0.00013435385,0.0006358683,0.00035967072,0.00077636,0.0000036469994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039226943,0.0013296754,0.0031234964,0.000088570116,0.0004257109,0.000014252013,0.0075321374,0.04645995,0.0030645074,0.122489035,0.00046263143,0.81461775],"study_design_scores_gemma":[0.0016262044,0.00021108308,0.0002469298,0.0006471844,0.000029780127,0.000076335906,0.00022805152,0.9618074,0.00007589677,0.0000065113604,0.034692243,0.00035236255],"about_ca_topic_score_codex":0.0000020783393,"about_ca_topic_score_gemma":0.000010666317,"teacher_disagreement_score":0.91534746,"about_ca_system_score_codex":0.0001132736,"about_ca_system_score_gemma":0.000058045578,"threshold_uncertainty_score":0.99999464},"labels":[],"label_agreement":null},{"id":"W1993685308","doi":"10.1109/ccece.2010.5575189","title":"Optimal amplify-and-forward scheme based on superposition modulation over relay channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Superposition principle; Computer science; Transmission (telecommunications); Topology (electrical circuits); Relay; Modulation (music); Quadrature amplitude modulation; Euclidean distance; Channel (broadcasting); Coding (social sciences); Phase-shift keying; Algorithm; Bit error rate; Mathematics; Telecommunications; Physics; Mathematical analysis; Artificial intelligence","score_opus":0.022771065828133364,"score_gpt":0.27134987144627754,"score_spread":0.24857880561814416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993685308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2974499,0.000010782032,0.6959223,0.0022104275,0.00026685215,0.00014075961,6.2632466e-7,0.0001646372,0.0038337181],"genre_scores_gemma":[0.9170929,0.00001738335,0.08143078,0.0010715484,0.00006191234,0.000015006228,0.000010321558,0.0000059544445,0.00029418193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992685,0.00005548716,0.00013140417,0.00024744426,0.00015790018,0.00013928085],"domain_scores_gemma":[0.99917835,0.00009771301,0.00003327132,0.0005414232,0.00007318638,0.00007603713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026498127,0.00010035946,0.000083395775,0.00008966698,0.00021144238,0.0001815764,0.00032123175,0.00007090593,0.00015896001],"category_scores_gemma":[0.000031481777,0.00008868245,0.000029836441,0.00019856002,0.000030141242,0.00038292192,0.00014370136,0.00024460664,0.0000402923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000309994,0.00017604156,0.0016181162,0.000007458086,0.00001438402,0.000002160783,0.0005563051,0.021712108,0.07358382,0.83567554,0.0016374703,0.06498558],"study_design_scores_gemma":[0.00028006505,0.00005433523,0.005873407,0.000009866327,0.0000012013081,0.0000018672167,0.0000021718388,0.9876518,0.0020938583,0.00012075739,0.0037879688,0.00012270609],"about_ca_topic_score_codex":0.0000039962715,"about_ca_topic_score_gemma":0.000009685603,"teacher_disagreement_score":0.9659397,"about_ca_system_score_codex":0.000016908036,"about_ca_system_score_gemma":0.00002116511,"threshold_uncertainty_score":0.36163652},"labels":[],"label_agreement":null},{"id":"W1993949281","doi":"10.1109/qbsc.2014.6841216","title":"Systematic network coding for transmission over two-hop lossy links","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Computer science; Network packet; Computer network; Transmission delay; Lossy compression; End-to-end delay; Processing delay; Decoding methods; Packet forwarding; Algorithm; Real-time computing","score_opus":0.03073858271783578,"score_gpt":0.2987702835744823,"score_spread":0.2680317008566465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993949281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025146457,0.00053936156,0.98877305,0.001070992,0.00025134848,0.0004854579,1.2873927e-7,0.00021220469,0.008416021],"genre_scores_gemma":[0.8674616,0.00021406326,0.12752038,0.002256999,0.00027558082,0.00009840253,0.000003406336,0.00001665976,0.0021528609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987356,0.00023322307,0.00034566014,0.00026186547,0.00015355037,0.00027011146],"domain_scores_gemma":[0.9982476,0.0007359706,0.00009472811,0.00071306207,0.00010913758,0.000099502766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010537859,0.00013433692,0.00025775074,0.00003712799,0.0006462891,0.0004224312,0.00087220164,0.00007369021,0.000033011685],"category_scores_gemma":[0.00007026017,0.00010346306,0.00010122087,0.00029453094,0.000018395696,0.00023950597,0.00015828031,0.00016581007,0.00002782447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007907568,0.000041427782,0.00006593774,0.0011753072,0.000036011865,4.197694e-7,0.00052568497,0.0029424643,0.0009393568,0.9350505,0.009465098,0.04974988],"study_design_scores_gemma":[0.0004927301,0.000047342077,0.000038412716,0.0013160435,0.000010112264,0.0000027264098,0.0000056857893,0.9806023,0.00025311593,0.0026544111,0.0144019,0.0001751813],"about_ca_topic_score_codex":0.0000018673768,"about_ca_topic_score_gemma":0.000013029022,"teacher_disagreement_score":0.9776599,"about_ca_system_score_codex":0.000028555636,"about_ca_system_score_gemma":0.000022652866,"threshold_uncertainty_score":0.49707985},"labels":[],"label_agreement":null},{"id":"W1993961741","doi":"10.1109/tvt.2014.2376779","title":"Distributed Resource Allocation for Multihop Decode-and-Forward Relay Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Computer network; Resource allocation; Multiplexing; Network packet; Optimization problem; Relay channel; Distributed computing; Telecommunications; Algorithm","score_opus":0.016415433345752243,"score_gpt":0.24947457116182822,"score_spread":0.23305913781607598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993961741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007914934,0.0002847358,0.9854957,0.0050663846,0.00020500232,0.00040926045,0.0000073723113,0.0005659124,0.000050719555],"genre_scores_gemma":[0.9844422,0.000195709,0.014752155,0.00014923126,0.000016004196,0.000300112,0.000008572318,0.000014095015,0.00012193071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888873,0.00012346312,0.0002585614,0.00038312335,0.00011300553,0.00023312758],"domain_scores_gemma":[0.9986131,0.00021287781,0.00008430108,0.0008729167,0.00015525921,0.000061535786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036915808,0.00015054295,0.00019743865,0.00027272853,0.00044597278,0.00007590262,0.0006230714,0.00021781311,0.0000017505557],"category_scores_gemma":[0.000040111485,0.00014706443,0.000064990425,0.00056745764,0.000096203235,0.00012981638,0.000010728271,0.00027984238,0.00001604193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040345796,0.00028733705,0.000048249287,0.000056221284,0.00014619192,0.0000023016016,0.000306508,0.13970163,0.011718588,0.22438137,0.0008164159,0.6224948],"study_design_scores_gemma":[0.0006172316,0.00017961049,0.00003263421,0.00004705174,0.000019682542,0.000024430352,0.00003971091,0.9000736,0.011801751,0.0003710083,0.08659246,0.00020083752],"about_ca_topic_score_codex":0.000003384222,"about_ca_topic_score_gemma":0.000021360516,"teacher_disagreement_score":0.9765273,"about_ca_system_score_codex":0.00006521322,"about_ca_system_score_gemma":0.0000202262,"threshold_uncertainty_score":0.59971136},"labels":[],"label_agreement":null},{"id":"W1994070335","doi":"10.1109/twc.2012.060212111755","title":"Blind Detection with Unique Identification in Two-Way Relay Channel","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; Computer science; Transmission (telecommunications); Channel (broadcasting); Relay channel; Bit error rate; Node (physics); Algorithm; Phase-shift keying; Noise (video); Gaussian noise; Modulation (music); Signal-to-noise ratio (imaging); Likelihood-ratio test; Keying; Topology (electrical circuits); Telecommunications; Power (physics); Mathematics; Statistics; Artificial intelligence","score_opus":0.05313939294247307,"score_gpt":0.3057568682331776,"score_spread":0.25261747529070455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994070335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039039493,0.00030648737,0.9570913,0.0015550801,0.0002686482,0.00047944515,0.00000440289,0.00027524095,0.0009799374],"genre_scores_gemma":[0.990908,0.0017253924,0.0063593374,0.0001881116,0.000024462437,0.0005163486,0.000008885686,0.000027108175,0.00024232647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979681,0.0006297933,0.00047050914,0.00031352133,0.00024507358,0.00037301244],"domain_scores_gemma":[0.9958676,0.00034487736,0.00017849349,0.0032550958,0.00020551756,0.00014840017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074289145,0.0002241165,0.00020353611,0.0004949771,0.00083877175,0.0001461984,0.0018776592,0.00008512789,0.0000137873485],"category_scores_gemma":[0.000007903053,0.00022316008,0.000072960254,0.0017805721,0.00015557042,0.001280024,0.00003059181,0.0007506575,0.00009417312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021805894,0.005467371,0.00069055986,0.0000418221,0.00021219336,0.0000028730904,0.018134773,0.05972374,0.050560594,0.07360994,0.00009396379,0.7912441],"study_design_scores_gemma":[0.0043664635,0.00026229228,0.010564791,0.00039415047,0.00007837285,0.00009972372,0.0006343931,0.824919,0.15221637,0.00050444616,0.00446918,0.0014907926],"about_ca_topic_score_codex":0.000076933284,"about_ca_topic_score_gemma":0.0031985508,"teacher_disagreement_score":0.95186853,"about_ca_system_score_codex":0.00023921678,"about_ca_system_score_gemma":0.00006634033,"threshold_uncertainty_score":0.91002035},"labels":[],"label_agreement":null},{"id":"W1994190919","doi":"10.1109/tsp.2012.2193577","title":"Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing $M$-PSK Modulation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Modulation (music); Channel (broadcasting); Computer science; Phase-shift keying; Electronic engineering; Telecommunications; Bit error rate; Physics; Engineering; Acoustics","score_opus":0.06523552115367368,"score_gpt":0.3175493525100683,"score_spread":0.2523138313563946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994190919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004497466,0.00059230917,0.9935942,0.0003316,0.0002822424,0.0003725379,0.0000018924225,0.00022045821,0.0001072658],"genre_scores_gemma":[0.9563708,0.000082737126,0.042916562,0.00025588775,0.00013952254,0.00013026722,0.0000060931975,0.000023678725,0.00007447722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986778,0.00010219959,0.000329596,0.0003157183,0.00020080364,0.0003739084],"domain_scores_gemma":[0.999032,0.00023284968,0.00014778218,0.00027742863,0.00016461399,0.00014533111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006337885,0.00019967768,0.00018203059,0.00018999657,0.0010916225,0.0002962451,0.0002881073,0.00010049119,0.000009397279],"category_scores_gemma":[0.0000074814657,0.00019869253,0.00006846195,0.00048087395,0.000046416055,0.001624371,0.000007630723,0.00031107818,0.000007753441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002842834,0.00006359086,0.000009377879,0.000017373086,0.000012312031,9.345975e-8,0.00092089747,0.44674253,0.00045101775,0.00055267796,0.000014872365,0.55118686],"study_design_scores_gemma":[0.00067907653,0.00005797002,0.00012291336,0.00011115274,0.000023908906,0.000009784379,0.000028781482,0.9964669,0.0017529625,0.00032994762,0.00018194868,0.00023470372],"about_ca_topic_score_codex":0.000002741474,"about_ca_topic_score_gemma":0.000006576243,"teacher_disagreement_score":0.9518733,"about_ca_system_score_codex":0.00007693756,"about_ca_system_score_gemma":0.00003865249,"threshold_uncertainty_score":0.83959883},"labels":[],"label_agreement":null},{"id":"W1994384216","doi":"10.1109/vetecf.2010.5594221","title":"An Optimality-Robustness Tradeoff in the Compress-and-Forward Relay Scheme","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Robustness (evolution); Decoding methods; Computer science; Flexibility (engineering); Relay channel; Scheme (mathematics); Algorithm; Mathematics","score_opus":0.03602264493812735,"score_gpt":0.3054330624734502,"score_spread":0.26941041753532285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994384216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64490443,0.00016624416,0.32937926,0.012233192,0.00020049771,0.00025841122,4.985068e-7,0.00016531476,0.012692149],"genre_scores_gemma":[0.91651475,0.00007075124,0.08239591,0.00088869454,0.000029968147,0.000015256241,0.0000014568866,0.000003433886,0.00007979997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991337,0.00020265013,0.00015696207,0.00021743885,0.00013256121,0.0001566798],"domain_scores_gemma":[0.9987427,0.00016018533,0.00002984044,0.00096916844,0.00004192504,0.000056198147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079724897,0.00008699475,0.000096563264,0.00004695419,0.00018603534,0.00025141228,0.0015666473,0.00004660582,0.00004584805],"category_scores_gemma":[0.000023953738,0.000057859263,0.000021421167,0.0003061593,0.00008080531,0.00046205238,0.00022162615,0.00041307491,0.0000062442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042677966,0.00016956877,0.0038477408,0.0000043058876,0.0000057100287,0.000004559512,0.0030540954,0.0008886458,0.0048589786,0.9401204,0.0007137232,0.046327993],"study_design_scores_gemma":[0.00030678674,0.00003551179,0.028820017,0.0000074424875,0.0000014885054,0.000022845561,0.00012175028,0.9561752,0.00035499968,0.0002849518,0.013701828,0.00016716181],"about_ca_topic_score_codex":0.00000973234,"about_ca_topic_score_gemma":0.00025469388,"teacher_disagreement_score":0.95528656,"about_ca_system_score_codex":0.0000051547067,"about_ca_system_score_gemma":0.000021166488,"threshold_uncertainty_score":0.29112464},"labels":[],"label_agreement":null},{"id":"W1994389448","doi":"10.1016/j.aeue.2014.01.004","title":"Intra-layer network coding for lossy communication of progressive codes","year":2014,"lang":"en","type":"article","venue":"AEU - International Journal of Electronics and Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Multicast; Linear network coding; Computer science; Computer network; Coding (social sciences); Lossy compression; Layer (electronics); Network layer; Distributed computing; Mathematics; Artificial intelligence","score_opus":0.03168205306804645,"score_gpt":0.32437364256878076,"score_spread":0.2926915895007343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994389448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013780378,0.038621888,0.9168518,0.027085053,0.00034949946,0.0004190142,0.000008535394,0.000044283206,0.0028395145],"genre_scores_gemma":[0.89725083,0.021102859,0.08110409,0.0003753866,0.0000852688,0.0000218516,0.000016814967,0.000009281608,0.00003360887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851716,0.00030665606,0.0006309653,0.00011884932,0.00024175657,0.00018459816],"domain_scores_gemma":[0.99555314,0.0010018909,0.0008113071,0.0010307598,0.0015375069,0.00006541657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012987053,0.00011703533,0.00024539584,0.00013400505,0.00030883262,0.00015929123,0.0035399152,0.00005416831,0.000006269709],"category_scores_gemma":[0.00025187898,0.000110236215,0.000108340566,0.00022586479,0.00016351957,0.00042347613,0.0007374196,0.00032518108,7.129609e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025021596,0.000096289325,0.0003441233,0.0000052582636,0.00015867066,1.543073e-7,0.00049161573,0.00026083502,0.00088949525,0.9074184,0.0010057125,0.08930448],"study_design_scores_gemma":[0.0034747848,0.0011566944,0.0031183064,0.000904683,0.0001441208,0.00024816438,0.0002162374,0.47122627,0.004918322,0.20714723,0.30678505,0.00066014426],"about_ca_topic_score_codex":0.000002599252,"about_ca_topic_score_gemma":0.00004886204,"teacher_disagreement_score":0.8834705,"about_ca_system_score_codex":0.00007153463,"about_ca_system_score_gemma":0.00014659954,"threshold_uncertainty_score":0.6578102},"labels":[],"label_agreement":null},{"id":"W1994542080","doi":"10.1109/pimrc.2011.6139928","title":"Joint cooperative scheduling and power control for interference-limited wireless networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Handshaking; Computer network; Power control; Scheduling (production processes); Wireless network; Relay; Distributed computing; Wireless ad hoc network; Quality of service; Maximum throughput scheduling; Wireless; Throughput; Dynamic priority scheduling; Power (physics); Round-robin scheduling; Mathematical optimization; Telecommunications","score_opus":0.06815721892113275,"score_gpt":0.2662773299172543,"score_spread":0.19812011099612153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994542080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011393265,0.00030884874,0.9830775,0.00049134454,0.0001697565,0.00034308233,9.951154e-7,0.00012974291,0.0040854327],"genre_scores_gemma":[0.96505594,0.00020960183,0.0332524,0.0012348681,0.000023398412,0.000037820908,0.0000018116535,0.000007966133,0.00017616984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990734,0.000108189684,0.00023661299,0.00029443996,0.000059212507,0.00022817097],"domain_scores_gemma":[0.9989592,0.00016398115,0.00006711275,0.0004128335,0.00029917562,0.000097732904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031703993,0.0001423983,0.00020012642,0.00006237779,0.00023605893,0.0001482617,0.00047817503,0.000055395307,0.00007109627],"category_scores_gemma":[0.000048853508,0.00011522255,0.000042393232,0.00019747103,0.00007155291,0.00033029405,0.00027213944,0.00014919176,0.000005816001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067559784,0.000115294846,0.0005929703,0.000006183041,0.00009246811,0.000002099871,0.005621673,0.00028834798,0.0013914779,0.91915864,0.0007324183,0.07193087],"study_design_scores_gemma":[0.00088029,0.00020319707,0.0012486143,0.000042832606,0.0000058927476,0.000004705015,0.00015344695,0.9955748,0.0009907522,0.00041437018,0.00027206383,0.0002090362],"about_ca_topic_score_codex":0.000004496856,"about_ca_topic_score_gemma":0.00003240768,"teacher_disagreement_score":0.99528646,"about_ca_system_score_codex":0.000018145483,"about_ca_system_score_gemma":0.000031102372,"threshold_uncertainty_score":0.46986392},"labels":[],"label_agreement":null},{"id":"W1994643890","doi":"10.1109/glocom.2012.6503483","title":"Power assignment in multi-relay adaptive DF cooperative networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Retransmission; Rayleigh fading; Relay; Computer science; Throughput; Signal-to-noise ratio (imaging); Fading; Automatic repeat request; Maximal-ratio combining; Power (physics); Algorithm; Electronic engineering; Wireless; Computer network; Decoding methods; Telecommunications; Engineering; Network packet; Physics","score_opus":0.06193705900981254,"score_gpt":0.29768659260929636,"score_spread":0.2357495335994838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994643890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014718977,0.0010756857,0.98065734,0.000532963,0.00028712704,0.00023399046,2.7091065e-7,0.000096302545,0.015644437],"genre_scores_gemma":[0.97049594,0.00022087539,0.02684672,0.001080694,0.000031993128,0.000044342978,0.0000014421095,0.000007816302,0.0012701475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986529,0.00031220863,0.00024249773,0.00023573247,0.00014719904,0.00040948106],"domain_scores_gemma":[0.9990082,0.00016223114,0.0000535281,0.0005428626,0.000091958456,0.00014124556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054659776,0.00015602756,0.00016269075,0.00008050806,0.00014501317,0.00008309619,0.00066893623,0.00006377674,0.00026114145],"category_scores_gemma":[0.000030427816,0.00012869123,0.00003960825,0.0005240768,0.00004394356,0.0007221657,0.00053654466,0.00027509793,0.00012654533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025930089,0.0012193535,0.013048942,0.0000016763902,0.00006911635,0.000008192941,0.011773303,0.044225384,0.0006227808,0.8807234,0.007928225,0.040353663],"study_design_scores_gemma":[0.0007964414,0.000093173476,0.025299687,0.000033814824,0.0000020098855,0.0000043345008,0.00026764948,0.9645622,0.00038209785,0.000016789865,0.00818771,0.00035412773],"about_ca_topic_score_codex":0.0000063892358,"about_ca_topic_score_gemma":0.000065979315,"teacher_disagreement_score":0.96902406,"about_ca_system_score_codex":0.000129216,"about_ca_system_score_gemma":0.000034583085,"threshold_uncertainty_score":0.5247876},"labels":[],"label_agreement":null},{"id":"W1994688078","doi":"10.1007/s11276-014-0703-4","title":"Multi-hop routing with cooperative transmission: a cross-layer approach","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Cooperative diversity; Antenna diversity; Wireless ad hoc network; Geographic routing; Static routing; Distributed computing; Wireless; Fading; Routing protocol; Routing (electronic design automation); Channel (broadcasting); Telecommunications","score_opus":0.035280303532826816,"score_gpt":0.2807114819705152,"score_spread":0.24543117843768839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994688078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070414715,0.00038144737,0.9877194,0.0003205971,0.0001352005,0.00026575435,3.1539358e-7,0.00030566723,0.00383012],"genre_scores_gemma":[0.9204124,0.00020268519,0.07797227,0.00063756056,0.00019344744,0.00005831209,0.0000095089035,0.000026678626,0.00048712027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979451,0.00039128997,0.00032644393,0.00060340815,0.00024969323,0.0004841239],"domain_scores_gemma":[0.9982749,0.00019474055,0.00012588454,0.0009363385,0.00027299047,0.0001951251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061180384,0.0002877831,0.00032053038,0.000057387482,0.00072139915,0.0005090714,0.0012880261,0.00012820933,0.000022005997],"category_scores_gemma":[0.000017208651,0.0002193826,0.00007020717,0.0007425909,0.00014486257,0.00048340994,0.00030043992,0.0005176482,0.000014808197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087073204,0.00046043438,0.004885925,0.000023619428,0.00010859142,0.00001098399,0.0056169047,0.29767773,0.0007833689,0.11312113,0.0007727065,0.57645154],"study_design_scores_gemma":[0.0010871904,0.00007786706,0.0018874891,0.00009085976,0.0000056797617,0.000016715228,0.000032371205,0.99243766,0.00017071763,0.000012004711,0.003835104,0.00034636448],"about_ca_topic_score_codex":0.0000064740116,"about_ca_topic_score_gemma":0.000018197601,"teacher_disagreement_score":0.91337097,"about_ca_system_score_codex":0.00004308492,"about_ca_system_score_gemma":0.00005961812,"threshold_uncertainty_score":0.89461625},"labels":[],"label_agreement":null},{"id":"W1994721667","doi":"10.1002/ett.1411","title":"Performance analysis of best‐path selection scheme for multi‐hop amplify‐and‐forward relaying","year":2010,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Memorial University of Newfoundland","keywords":"Cumulative distribution function; Rayleigh fading; Probability density function; Outage probability; Path loss; Fading; Channel (broadcasting); Moment-generating function; Expression (computer science); Channel capacity; Probability of error; Mathematics; Computer science; Selection (genetic algorithm); Statistics; Topology (electrical circuits); Hop (telecommunications); Closed-form expression; Algorithm; Telecommunications; Wireless; Combinatorics; Mathematical analysis","score_opus":0.05175647231645616,"score_gpt":0.3003629027905945,"score_spread":0.24860643047413836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994721667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05559861,0.000098634606,0.9406665,0.00056729786,0.0000892455,0.00028119172,0.000016176353,0.00016556431,0.002516767],"genre_scores_gemma":[0.7204547,0.0013320539,0.2777386,0.00008648036,0.000009357004,0.000050704777,0.000019644796,0.000016292148,0.0002921727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987067,0.00026275113,0.00041972517,0.00029615007,0.00011898177,0.00019567039],"domain_scores_gemma":[0.9976003,0.00033970887,0.00018104137,0.0014915429,0.00029620584,0.00009115534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007042841,0.00015743823,0.0002206904,0.00051332347,0.0010368578,0.00009277853,0.0011858516,0.000053300897,0.000039520743],"category_scores_gemma":[0.000060942482,0.00016529817,0.00015148273,0.0016124336,0.00010616196,0.00036440618,0.000055514953,0.00059053337,0.000021057802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048098096,0.001962468,0.0044942005,0.00006110786,0.001550097,3.49317e-7,0.0055434215,0.016728202,0.059578333,0.041151457,0.00019444204,0.8686878],"study_design_scores_gemma":[0.0004904707,0.00014509553,0.016230019,0.00003156329,0.0002277929,0.000004751151,0.00007406481,0.96893144,0.001756068,0.000011117608,0.011837202,0.000260448],"about_ca_topic_score_codex":0.000008573575,"about_ca_topic_score_gemma":0.00023038937,"teacher_disagreement_score":0.9522032,"about_ca_system_score_codex":0.000028892355,"about_ca_system_score_gemma":0.000043127046,"threshold_uncertainty_score":0.7974777},"labels":[],"label_agreement":null},{"id":"W1994844879","doi":"10.1016/j.comnet.2013.08.023","title":"Joint optimal AF relay assignment and power allocation in wireless cooperative networks","year":2013,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Relay; Joint (building); Wireless; Computer network; Power (physics); Telecommunications; Wireless network","score_opus":0.01999029148705226,"score_gpt":0.23507457953705535,"score_spread":0.2150842880500031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994844879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033505816,0.0010442572,0.9621177,0.0015711952,0.0005688934,0.0005748158,1.7982373e-7,0.00014686365,0.00047031336],"genre_scores_gemma":[0.97213584,0.0010761962,0.024823394,0.0015046333,0.00019637977,0.00012369883,0.000011093822,0.000020561387,0.00010821602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977557,0.00040854007,0.0005127892,0.00062376144,0.00019822952,0.00050097954],"domain_scores_gemma":[0.998451,0.00020354023,0.00014256565,0.0008004546,0.00021038599,0.00019207434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005017742,0.0003022153,0.0003468029,0.0001308279,0.00025706846,0.0005780977,0.0007949532,0.0001583939,0.00005828724],"category_scores_gemma":[0.00000864018,0.00028261897,0.000055370576,0.00060274,0.0001071326,0.00077602797,0.0011206918,0.0005590374,0.000032011336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007848654,0.00015206229,0.0011775981,0.0000046361383,0.000041606483,0.000012096038,0.0011503963,0.7331239,0.00009266888,0.03945781,0.01019387,0.21458548],"study_design_scores_gemma":[0.0005370873,0.00012376442,0.014693967,0.000109942885,0.0000029520218,0.000013966843,0.000019107814,0.98337495,0.000026679154,0.00005031652,0.0007151571,0.00033209662],"about_ca_topic_score_codex":0.000013003522,"about_ca_topic_score_gemma":0.000021118734,"teacher_disagreement_score":0.93863,"about_ca_system_score_codex":0.00012221253,"about_ca_system_score_gemma":0.000041292693,"threshold_uncertainty_score":0.99996257},"labels":[],"label_agreement":null},{"id":"W1994884821","doi":"10.1109/icassp.2013.6638609","title":"Orthogonally-distributed space-time block codes for relay channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Orthogonality; Block code; Diversity gain; Relay; Space–time block code; Computer science; Algorithm; Detector; MIMO; Channel (broadcasting); Topology (electrical circuits); Block (permutation group theory); Coding gain; Matrix (chemical analysis); Coding (social sciences); Decoding methods; Mathematics; Telecommunications; Combinatorics; Statistics","score_opus":0.02687731412869535,"score_gpt":0.2607855209152771,"score_spread":0.23390820678658178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994884821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0132285645,0.0002461116,0.9637599,0.016330525,0.00018802258,0.00065006345,0.0000067269334,0.00040658133,0.0051835193],"genre_scores_gemma":[0.8976591,0.00013447503,0.08654758,0.0012138805,0.00009860421,0.00021215215,0.000039946455,0.000012874637,0.014081378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991309,0.000066835935,0.00018655107,0.00024976092,0.00011424499,0.00025173134],"domain_scores_gemma":[0.99865687,0.00025013578,0.00005729837,0.00061450514,0.00031817547,0.00010302229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022512878,0.000118735305,0.00014892024,0.000049667873,0.00023288457,0.00025225998,0.0008487636,0.00004754285,0.00031219175],"category_scores_gemma":[0.00007534277,0.00009938707,0.000067650835,0.00030072298,0.000030405768,0.00035158,0.0003444779,0.00008449217,0.0005136448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009891492,0.00021789018,0.00030342056,0.000017397599,0.00010102711,0.0000018177461,0.0007110455,0.0032056991,0.017146673,0.50708985,0.42334834,0.04784699],"study_design_scores_gemma":[0.0004351911,0.00008301805,0.00081774103,0.00002107602,0.000004301553,0.0000067789724,0.000014181433,0.87966025,0.003236209,0.0018359988,0.11360848,0.00027680583],"about_ca_topic_score_codex":0.0000053589993,"about_ca_topic_score_gemma":0.000008004464,"teacher_disagreement_score":0.8844305,"about_ca_system_score_codex":0.00002550618,"about_ca_system_score_gemma":0.000041274034,"threshold_uncertainty_score":0.6602036},"labels":[],"label_agreement":null},{"id":"W1995086650","doi":"10.1109/vtcfall.2012.6399064","title":"Asymptotic Outage Probability for Amplify-and-Forward CDMA Systems over Nakagami-m Fading Channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Nakagami distribution; Moment-generating function; Probability density function; Computer science; Outage probability; Code division multiple access; Fading distribution; Base station; Maximal-ratio combining; Signal-to-noise ratio (imaging); Algorithm; Mathematics; Statistics; Telecommunications; Topology (electrical circuits); Rayleigh fading; Decoding methods; Combinatorics","score_opus":0.06711081507705863,"score_gpt":0.2983342425316742,"score_spread":0.23122342745461555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995086650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033845402,0.0011425397,0.9595162,0.0005273286,0.0009557236,0.0008570533,0.0000026035266,0.00025245704,0.0029006859],"genre_scores_gemma":[0.986681,0.000073166586,0.011580016,0.00027345272,0.00017137683,0.00013504147,0.0000034653428,0.000010449292,0.0010720756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987387,0.00013816696,0.00027082127,0.0002895602,0.000149832,0.00041294144],"domain_scores_gemma":[0.9986131,0.0003491601,0.000079756996,0.0006785516,0.00010362543,0.00017579956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010349394,0.00015544798,0.00021361544,0.000064172375,0.00028597866,0.00028344555,0.0005735556,0.00006626047,0.000020999412],"category_scores_gemma":[0.00010784824,0.00012873951,0.000059437578,0.00020930251,0.000041305935,0.00074629183,0.00046293283,0.00011444022,0.000024630925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068003633,0.000111951456,0.007838798,0.00010358584,0.00004119252,2.2074423e-7,0.0025457025,0.00039089075,0.00047756726,0.96899134,0.0016014142,0.017890517],"study_design_scores_gemma":[0.0012789324,0.00017099148,0.011113942,0.00014541105,0.000028570405,0.000026558519,0.00017509078,0.8650581,0.0006916996,0.004007714,0.11637545,0.0009274978],"about_ca_topic_score_codex":0.000006703722,"about_ca_topic_score_gemma":0.000005367003,"teacher_disagreement_score":0.96498364,"about_ca_system_score_codex":0.00007238337,"about_ca_system_score_gemma":0.000023610617,"threshold_uncertainty_score":0.52498454},"labels":[],"label_agreement":null},{"id":"W1995434282","doi":"10.1109/wcl.2012.061212.120206","title":"Opportunistic Energy Efficient Cooperative Communication","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Efficient energy use; Metric (unit); Transmission (telecommunications); Signal-to-noise ratio (imaging); Energy (signal processing); Computer network; Wireless; Selection (genetic algorithm); Performance metric; Scheme (mathematics); Telecommunications; Engineering; Mathematics; Electrical engineering; Power (physics)","score_opus":0.0531044485982936,"score_gpt":0.2841344898953911,"score_spread":0.23103004129709748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995434282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027799606,0.0042706565,0.9282598,0.028836498,0.0005643958,0.0003687334,0.000011106308,0.0006361992,0.009253024],"genre_scores_gemma":[0.97249,0.003412544,0.018476333,0.005146676,0.00006676214,0.00013208229,0.00008305138,0.000028876186,0.00016367614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970927,0.0012034536,0.0005407265,0.0003000775,0.00031777134,0.0005452668],"domain_scores_gemma":[0.9920342,0.0006613082,0.00025894522,0.0065066195,0.00026729537,0.00027161065],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008102516,0.000286939,0.00028670015,0.00022389863,0.0013044631,0.00024993694,0.0056863124,0.000083604915,0.000029708614],"category_scores_gemma":[0.00004843697,0.0002962296,0.00011072719,0.0009620049,0.00043177733,0.0007396848,0.0015548135,0.00043952576,0.00012624194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004884463,0.00055383024,0.00034913496,0.0000065272598,0.000072046874,0.0000010390502,0.0032430664,0.0014499221,0.025122449,0.90873003,0.009695883,0.05077117],"study_design_scores_gemma":[0.001179684,0.000056292254,0.0020341163,0.00022370534,0.000061343984,0.00007496281,0.0003678689,0.75422645,0.007284608,0.00024270815,0.23266605,0.0015822329],"about_ca_topic_score_codex":0.000034468998,"about_ca_topic_score_gemma":0.00003782278,"teacher_disagreement_score":0.9446904,"about_ca_system_score_codex":0.00020918946,"about_ca_system_score_gemma":0.000086652275,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W1995554557","doi":"10.1002/net.10016","title":"Deterministic radio broadcasting at low cost","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Université du Québec à Montréal","funders":"","keywords":"Broadcasting (networking); Computer science; Node (physics); Computer network; Focus (optics); Wireless ad hoc network; Network topology; Radio networks; Upper and lower bounds; Distributed computing; Topology (electrical circuits); Wireless network; Telecommunications; Wireless; Mathematics; Combinatorics","score_opus":0.04961796621044182,"score_gpt":0.2585936795697521,"score_spread":0.20897571335931028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995554557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047518555,0.0026677558,0.9719701,0.0006164755,0.00077267207,0.00024718078,4.872414e-7,0.00035845433,0.018615011],"genre_scores_gemma":[0.9921687,0.0010316448,0.0036353855,0.0007788099,0.000245228,0.000022500073,0.0000025612374,0.000011876266,0.0021032407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890417,0.000121030855,0.00021414882,0.00028586216,0.00013786131,0.00033694215],"domain_scores_gemma":[0.9987213,0.0002509202,0.00008059159,0.00076781487,0.000058019385,0.00012132523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018087203,0.00013449808,0.00014286372,0.0000434084,0.0004361391,0.00016501977,0.00090592867,0.000062162275,0.0002773052],"category_scores_gemma":[0.000047843914,0.0001335525,0.000053994318,0.0003999151,0.0000495492,0.00018814256,0.00057121186,0.00022100606,0.00023359295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002509434,0.000044114215,0.0007710766,0.0000039376628,0.00001023818,0.000025425858,0.0005393076,0.009658021,0.00005918477,0.0054850206,0.02258658,0.9608146],"study_design_scores_gemma":[0.00021312489,0.000018178825,0.00072902767,0.000039378785,0.0000026962903,0.00003679717,0.0000022804275,0.968635,0.000022809341,0.000018910849,0.03012069,0.00016109797],"about_ca_topic_score_codex":6.2745795e-7,"about_ca_topic_score_gemma":0.000013154084,"teacher_disagreement_score":0.9874169,"about_ca_system_score_codex":0.000087886954,"about_ca_system_score_gemma":0.000007175176,"threshold_uncertainty_score":0.54461133},"labels":[],"label_agreement":null},{"id":"W1995565104","doi":"10.1109/isit.2012.6283959","title":"On decoding delay of intra-session random linear network coding for line networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Linear network coding; Network packet; Computer science; Coding (social sciences); Session (web analytics); Erasure; Computer network; Algorithm; Mathematics; Statistics; World Wide Web","score_opus":0.04918258104434521,"score_gpt":0.314321720572559,"score_spread":0.26513913952821383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995565104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032049385,0.0008775306,0.99241006,0.00037695706,0.0007697362,0.00033420548,6.464604e-7,0.00011761952,0.0019083045],"genre_scores_gemma":[0.89942324,0.00072508387,0.09835354,0.0007586273,0.00053658814,0.000032114855,0.000008810235,0.000013158074,0.00014884504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861234,0.0001641291,0.00041339672,0.00021239686,0.00014916004,0.00044855595],"domain_scores_gemma":[0.9974923,0.0014578443,0.00016983588,0.00058334676,0.00016069693,0.00013596992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013419527,0.00016101192,0.00027838172,0.000072070245,0.00032031492,0.00004978013,0.00068746996,0.00008412096,0.00004918186],"category_scores_gemma":[0.00017559118,0.00012953067,0.00011240235,0.0004517428,0.000031977102,0.0003742047,0.00031298926,0.00018826182,0.000007243545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020265576,0.00019985119,0.00084078155,0.000020936588,0.00005330067,5.250967e-7,0.00053759944,0.08520867,0.00051195076,0.66018635,0.0118561,0.24038126],"study_design_scores_gemma":[0.0012302854,0.00010770638,0.00011276454,0.00014019835,0.000009014547,0.000002912398,0.000009203358,0.9911827,0.0019443453,0.000498126,0.004579207,0.00018354338],"about_ca_topic_score_codex":0.0000014082672,"about_ca_topic_score_gemma":0.000007795196,"teacher_disagreement_score":0.90597403,"about_ca_system_score_codex":0.000035130233,"about_ca_system_score_gemma":0.000024534347,"threshold_uncertainty_score":0.52821076},"labels":[],"label_agreement":null},{"id":"W1995769095","doi":"10.1109/tit.2012.2191663","title":"On the Optimum Diversity–Multiplexing Tradeoff of the Two-User Gaussian Interference Channel With Rayleigh Fading","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rayleigh fading; Fading; Channel state information; Multiplexing; Computer science; Gaussian; Algorithm; Diversity gain; Code rate; Channel (broadcasting); Electronic engineering; Topology (electrical circuits); Mathematics; Telecommunications; Decoding methods; Wireless; Physics; Engineering","score_opus":0.029814992904834463,"score_gpt":0.23582685325856598,"score_spread":0.2060118603537315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995769095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009477829,0.000013542004,0.9834822,0.0008757563,0.00040072645,0.000255696,0.000005646082,0.00006824705,0.005420393],"genre_scores_gemma":[0.9982827,0.000026527452,0.0006201061,0.0008929406,0.000014236168,0.000025818817,7.772926e-7,0.0000046728146,0.00013224935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897784,0.00026271062,0.00023390405,0.00008373405,0.00024268847,0.00019914193],"domain_scores_gemma":[0.9985749,0.00047886078,0.00016576714,0.0006406291,0.00008571085,0.000054128413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006606781,0.00013400054,0.00010205864,0.00012929244,0.0010046468,0.000082792,0.0010147652,0.00003594962,0.00007173346],"category_scores_gemma":[0.0000144087435,0.00007541991,0.000076969176,0.00046240198,0.000120108765,0.0015907093,0.00003206726,0.0003309167,0.00003552519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000158541,0.0001669011,0.000049956216,0.000018325105,0.00009291456,1.0973573e-7,0.054565124,0.10115011,0.00024062874,0.8002798,0.00022921005,0.043048363],"study_design_scores_gemma":[0.007101017,0.001144133,0.0055176406,0.0022047246,0.00019330173,0.00008848045,0.01656172,0.69614583,0.24795288,0.014738612,0.006039671,0.0023120134],"about_ca_topic_score_codex":0.000003693958,"about_ca_topic_score_gemma":0.000006490167,"teacher_disagreement_score":0.9888048,"about_ca_system_score_codex":0.000061163744,"about_ca_system_score_gemma":0.000027265263,"threshold_uncertainty_score":0.77270323},"labels":[],"label_agreement":null},{"id":"W1996197208","doi":"10.1109/tsp.2012.2224344","title":"Quantization and Bit Allocation for Channel State Feedback in Relay-Assisted Wireless Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantization (signal processing); Channel state information; Computer science; Relay; Wireless network; Wireless; Channel (broadcasting); Node (physics); Computer network; Algorithm; Telecommunications; Engineering","score_opus":0.0494279372898304,"score_gpt":0.28544705479551574,"score_spread":0.23601911750568533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996197208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016860802,0.00067813374,0.98146456,0.00042341146,0.00015134156,0.00027941703,0.0000011605599,0.00009770348,0.000043488017],"genre_scores_gemma":[0.99295247,0.00035613385,0.0062676203,0.00020209668,0.000036656435,0.00008831639,0.0000037094353,0.00001559105,0.00007742765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998975,0.00010666331,0.00027279655,0.00024052041,0.00012490188,0.00028013292],"domain_scores_gemma":[0.99935895,0.00013834599,0.00010456859,0.00017949795,0.00013411167,0.00008450762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045420715,0.0001383998,0.00014132394,0.0001455373,0.00040980498,0.00016734978,0.00021660278,0.00006741434,0.00000334975],"category_scores_gemma":[0.0000028551292,0.00014115917,0.00003193829,0.0006718278,0.000039023453,0.0010198485,0.0000044601406,0.00019921474,0.0000025881493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044068598,0.00019499553,0.00007186414,0.000040505387,0.0000103187895,2.4138487e-7,0.001965819,0.0851742,0.0021565876,0.00046097016,0.000018262015,0.90986216],"study_design_scores_gemma":[0.00049280544,0.000048641657,0.0011394019,0.00016065106,0.000007866518,0.000005369222,0.000057166682,0.994029,0.00368977,0.00008802167,0.00009949785,0.00018182033],"about_ca_topic_score_codex":0.0000040241334,"about_ca_topic_score_gemma":0.000049895487,"teacher_disagreement_score":0.9760916,"about_ca_system_score_codex":0.00006891626,"about_ca_system_score_gemma":0.000045883047,"threshold_uncertainty_score":0.57563037},"labels":[],"label_agreement":null},{"id":"W1996240237","doi":"10.1109/pimrc.2010.5671869","title":"Construction of new delay-tolerant Space-Time Codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block code; Asynchronous communication; Computer science; Construct (python library); Synchronization (alternating current); Luby transform code; Transmission (telecommunications); Linear code; Topology (electrical circuits); Algorithm; Mathematics; Decoding methods; Computer network; Telecommunications; Combinatorics","score_opus":0.021514866180464203,"score_gpt":0.25887093557703683,"score_spread":0.23735606939657264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996240237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117187604,0.000090034955,0.84918094,0.003411313,0.000367133,0.000096128744,4.3541448e-7,0.00015200929,0.029514397],"genre_scores_gemma":[0.7426969,0.000054105174,0.25547615,0.00012887118,0.000039270024,0.000001174168,8.4167834e-7,0.0000027163899,0.0015999867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995444,0.000030254825,0.00013342343,0.000116431416,0.00008895956,0.00008655679],"domain_scores_gemma":[0.9992566,0.000057410092,0.00005277134,0.0004783117,0.000094365234,0.000060522096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013445468,0.00005696687,0.00009455833,0.000045950466,0.00006856393,0.00004484303,0.0004669859,0.000031657757,0.0003723122],"category_scores_gemma":[0.000020955014,0.000048577185,0.000029606534,0.00021405812,0.000056190896,0.00018967305,0.00016640482,0.00011612105,0.0000534783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025494096,0.000021460648,0.00045262027,0.0000015972889,0.000009322887,4.8284676e-7,0.0004094501,0.000031617987,0.054119043,0.71978056,0.0033050464,0.22186626],"study_design_scores_gemma":[0.00075911975,0.00008710642,0.002510123,0.00002745707,0.000008139894,0.00008611636,0.000039780654,0.83669186,0.07857588,0.008310941,0.07255272,0.00035074324],"about_ca_topic_score_codex":0.000016678809,"about_ca_topic_score_gemma":0.000070610455,"teacher_disagreement_score":0.83666027,"about_ca_system_score_codex":0.0000048647894,"about_ca_system_score_gemma":0.000059722424,"threshold_uncertainty_score":0.40765578},"labels":[],"label_agreement":null},{"id":"W1996538682","doi":"10.1109/wowmom.2012.6263709","title":"Performance modeling of multicast with network coding in multi-channel multi-radio wireless mesh networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer network; Multicast; Computer science; Wireless mesh network; Linear network coding; Source-specific multicast; Throughput; Distributed computing; Network packet; Xcast; Wireless network; Wireless; Telecommunications","score_opus":0.07789237613606333,"score_gpt":0.2816889860212038,"score_spread":0.20379660988514048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996538682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11495844,0.0003995699,0.8837844,0.00005724205,0.00018760937,0.0002418473,2.3868424e-7,0.00010223676,0.00026840292],"genre_scores_gemma":[0.9205196,0.0009795857,0.07819935,0.00009679163,0.00007632484,0.000029591982,0.000001994477,0.00001884624,0.00007793433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820244,0.0001589501,0.00047150164,0.00030418535,0.00019839178,0.00066455477],"domain_scores_gemma":[0.9986812,0.00013707878,0.00013687302,0.0007242143,0.00016405595,0.00015656432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008628012,0.00023203233,0.00034618226,0.000114956485,0.00021452155,0.00005747189,0.0008888155,0.00008526907,0.000009132085],"category_scores_gemma":[0.000017110302,0.00019315646,0.000049266608,0.0008297602,0.0000657099,0.0009007496,0.00046838511,0.00033436058,0.0000060216194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024417823,0.0002826177,0.05472631,0.000021421381,0.000023140608,0.0000014054417,0.002229184,0.923674,0.00005265057,0.008526941,0.0000285657,0.010409353],"study_design_scores_gemma":[0.000986004,0.000035378194,0.007568151,0.00022161007,0.0000049902214,0.00000777519,0.00009022973,0.9907164,0.00008968435,0.0000015047405,0.000011573528,0.00026671015],"about_ca_topic_score_codex":0.000025734525,"about_ca_topic_score_gemma":0.00025134836,"teacher_disagreement_score":0.8055851,"about_ca_system_score_codex":0.00006638673,"about_ca_system_score_gemma":0.000038165024,"threshold_uncertainty_score":0.7876692},"labels":[],"label_agreement":null},{"id":"W1996784277","doi":"10.1109/ccece.2008.4564608","title":"Two channel estimation methods for amplify-and-forward relay networks","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Channel (broadcasting); Quantization (signal processing); Computer science; Relay channel; Estimator; Terminal (telecommunication); Algorithm; Telecommunications; Mathematics; Statistics","score_opus":0.04092668455162749,"score_gpt":0.2804431612591722,"score_spread":0.2395164767075447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996784277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027087543,0.00040593985,0.99438345,0.0013176616,0.00016290796,0.0003610115,0.0000015189172,0.00019178075,0.0004669565],"genre_scores_gemma":[0.84077966,0.00087835354,0.15748072,0.00056709663,0.000107666965,0.000106262785,0.00000649653,0.000017639746,0.00005609743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833274,0.000027615148,0.000297664,0.00058921665,0.00012255991,0.00063022773],"domain_scores_gemma":[0.9985656,0.00020783226,0.00008114753,0.00020878544,0.00034735867,0.0005892902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034231023,0.00031322366,0.00034687875,0.0003390667,0.00046928515,0.00042102652,0.00061144045,0.00013589127,0.0000054069315],"category_scores_gemma":[0.00008862816,0.00031435682,0.000047353802,0.000505745,0.000063686915,0.0004111845,0.00015822878,0.0004548771,0.0000027664069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000774577,0.000015802869,0.00008365046,0.000020401956,0.000026686597,0.0000029093562,0.00069032377,0.0025987846,0.00012412448,0.5951141,0.00031966146,0.40099582],"study_design_scores_gemma":[0.0003681862,0.00021342246,0.0010775967,0.0000750721,0.000007917871,0.00007193198,0.00000548315,0.99439776,0.00008182841,0.0013138124,0.0020009435,0.00038601996],"about_ca_topic_score_codex":0.00016684478,"about_ca_topic_score_gemma":0.00011740034,"teacher_disagreement_score":0.991799,"about_ca_system_score_codex":0.000106229476,"about_ca_system_score_gemma":0.00023710675,"threshold_uncertainty_score":0.99993086},"labels":[],"label_agreement":null},{"id":"W1996918931","doi":"10.1109/bsc.2008.4563229","title":"Joint protocol and relay node selection in collaborative networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Computer network; Bandwidth (computing); Node (physics); Channel capacity; Channel (broadcasting); Relay channel; Resource allocation; Resource (disambiguation); Wireless; Selection (genetic algorithm); Power (physics); Telecommunications; Engineering","score_opus":0.0374807515510434,"score_gpt":0.2858126144929421,"score_spread":0.24833186294189868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996918931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006714029,0.00008406898,0.9503257,0.0018902749,0.000050973464,0.02371621,1.1981855e-7,0.00021867936,0.016999897],"genre_scores_gemma":[0.8975037,0.00034557405,0.07483169,0.0009765677,0.000049490187,0.025120478,7.2992646e-7,0.000008902062,0.0011628702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929684,0.00014846445,0.00016313326,0.00019000207,0.00007414984,0.00012739172],"domain_scores_gemma":[0.99959904,0.000044113247,0.000041713192,0.0001680015,0.00010540641,0.000041709456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019834518,0.000074666175,0.00009559517,0.00007173494,0.0001944451,0.00005089084,0.00018026601,0.000036898826,0.000020956526],"category_scores_gemma":[0.000023508803,0.00006450472,0.0000104285255,0.00083853974,0.00003763419,0.00028830074,0.00017999948,0.00015143794,0.000005777192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001675783,0.0009488339,0.116983,0.00004386207,0.00007012492,0.00007473513,0.021097794,0.07025613,0.006774418,0.50448954,0.05645995,0.22263405],"study_design_scores_gemma":[0.0006719489,0.000075201235,0.03908665,0.000023560091,4.3879538e-7,0.000026585387,0.000020477148,0.94837844,0.0006019488,0.00007937891,0.010887829,0.00014753328],"about_ca_topic_score_codex":0.000007272797,"about_ca_topic_score_gemma":0.00015501445,"teacher_disagreement_score":0.8907897,"about_ca_system_score_codex":0.000041766354,"about_ca_system_score_gemma":0.00005964573,"threshold_uncertainty_score":0.2630426},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07297752707014883,"score_gpt":0.31019186475112437,"score_spread":0.23721433768097555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996977547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13559107,0.005898416,0.80636823,0.022017246,0.0009796291,0.0010157085,0.0000034663874,0.0007637064,0.027362516],"genre_scores_gemma":[0.94501364,0.0020616641,0.052163046,0.00040602655,0.00017844424,0.00004574483,0.000004192037,0.0000208236,0.00010641366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974245,0.0011398771,0.00046304057,0.00019436656,0.00031951253,0.00045869342],"domain_scores_gemma":[0.99657863,0.00077297643,0.00030304326,0.0014659057,0.0006644666,0.00021497952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009728209,0.00020995023,0.00023045579,0.00042792555,0.00101402,0.00022172027,0.0022080825,0.000095090196,0.000020024636],"category_scores_gemma":[0.00018537458,0.00018133158,0.000055166085,0.002460227,0.000088146335,0.0011248116,0.00024414892,0.0016501878,0.000046102574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004727105,0.0043199346,0.0934171,0.000017805982,0.00063285686,0.000024603434,0.024072047,0.011626682,0.013682267,0.441419,0.008899793,0.40141517],"study_design_scores_gemma":[0.0077154664,0.002953546,0.34474885,0.0025730622,0.00016012751,0.0045231534,0.00085297483,0.5167961,0.01025124,0.0052471594,0.10072519,0.003453121],"about_ca_topic_score_codex":0.000008169967,"about_ca_topic_score_gemma":0.00020533406,"teacher_disagreement_score":0.80942255,"about_ca_system_score_codex":0.000411842,"about_ca_system_score_gemma":0.00023788294,"threshold_uncertainty_score":0.7799124},"labels":[],"label_agreement":null},{"id":"W1997123782","doi":"10.1109/glocom.2011.6133977","title":"Channel Training and Coherent Decodings in Amplify-and-Forward Relay Network","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Relay; Computer science; Transmitter; Channel (broadcasting); Relay channel; Channel state information; Algorithm; Linear network coding; Diversity gain; List decoding; Bit error rate; Space–time code; Antenna diversity; Antenna (radio); Telecommunications; Computer network; Fading; Wireless; Concatenated error correction code; Block code","score_opus":0.10637470923204223,"score_gpt":0.2704711043773119,"score_spread":0.1640963951452697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997123782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12761296,0.003944319,0.7987811,0.002064659,0.00041425787,0.0005035406,4.7462333e-7,0.00036186102,0.06631683],"genre_scores_gemma":[0.96963614,0.0012666979,0.028112935,0.00071511767,0.000025883575,0.000016531349,5.370061e-7,0.0000053214912,0.00022083349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992286,0.000071859795,0.00017710788,0.00023375965,0.000064265725,0.00022441668],"domain_scores_gemma":[0.9994854,0.0000945302,0.000040723215,0.00026708198,0.000024350913,0.00008791357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004535177,0.00009649432,0.00013862413,0.00005593672,0.00013142714,0.00007205406,0.00033144676,0.00004218975,0.000037964426],"category_scores_gemma":[0.000020210682,0.00008472365,0.000014491061,0.00023789775,0.00004300573,0.00023853598,0.00042353818,0.00015317596,0.000006342379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013111641,0.00006182894,0.011084849,0.000008494722,0.000024520486,0.000009101162,0.039994918,0.00014124192,0.000054626027,0.56575406,0.0017736943,0.38107955],"study_design_scores_gemma":[0.0024807886,0.00040760878,0.13302056,0.00036574143,0.000015652848,0.00009431296,0.0015092994,0.7852941,0.00031467437,0.029127514,0.046037983,0.0013317367],"about_ca_topic_score_codex":0.000017188775,"about_ca_topic_score_gemma":0.00022413282,"teacher_disagreement_score":0.8420232,"about_ca_system_score_codex":0.000013936253,"about_ca_system_score_gemma":0.000015819653,"threshold_uncertainty_score":0.34549302},"labels":[],"label_agreement":null},{"id":"W1997264450","doi":"10.1109/ccece.2008.4564510","title":"A novel relay selection method for decode-and-forward relaying","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Power (physics); Diversity gain; Monte Carlo method; Algorithm; Decoding methods; Mathematics; Artificial intelligence; Fading","score_opus":0.03908169575653625,"score_gpt":0.24893398651796414,"score_spread":0.2098522907614279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997264450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011217703,0.0001542295,0.9858121,0.001697727,0.00010791729,0.0003277424,0.0000022944778,0.00020527198,0.00047501439],"genre_scores_gemma":[0.79223156,0.00045881636,0.2064353,0.00057083135,0.00009222114,0.00008866536,0.0000025309816,0.000018178172,0.00010187088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982536,0.000014893729,0.00029361705,0.000651586,0.00016732253,0.0006190024],"domain_scores_gemma":[0.99861306,0.00016368285,0.00007817014,0.00016015918,0.00043341343,0.0005515081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028453284,0.0003052144,0.00032911552,0.00041420019,0.00054466136,0.00038169633,0.00054723176,0.0001468625,0.000006543468],"category_scores_gemma":[0.00009435159,0.00031101942,0.000054879452,0.00061374257,0.00004036463,0.00042613517,0.00013689061,0.00045535783,0.0000032750347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014009971,0.000032373795,0.000703911,0.000037315578,0.00004607181,0.0000038114101,0.0012961109,0.0004989215,0.0035136666,0.8079974,0.00056622527,0.18529017],"study_design_scores_gemma":[0.0003997214,0.00026243957,0.0025279154,0.00008286001,0.000008576446,0.00020004642,0.0000071350187,0.99148834,0.00032648415,0.00037435602,0.0039268094,0.00039529425],"about_ca_topic_score_codex":0.00034351603,"about_ca_topic_score_gemma":0.00041932857,"teacher_disagreement_score":0.99098945,"about_ca_system_score_codex":0.0001479341,"about_ca_system_score_gemma":0.00036734284,"threshold_uncertainty_score":0.9999342},"labels":[],"label_agreement":null},{"id":"W1997594669","doi":"10.1109/tsp.2013.2274277","title":"Joint Design of Multiple Non-Regenerative MIMO Relaying Matrices With Power Constraints","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"MIMO; Coordinate descent; Mathematical optimization; Constraint (computer-aided design); Relay; Mathematics; Power (physics); Transmitter power output; Computer science; Control theory (sociology); Algorithm; Beamforming; Telecommunications; Channel (broadcasting)","score_opus":0.045428124299153556,"score_gpt":0.25727279850732593,"score_spread":0.21184467420817238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997594669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010070973,0.00017923868,0.9884805,0.0002104133,0.00005374602,0.00037098437,0.0000014181678,0.00009366064,0.0005390585],"genre_scores_gemma":[0.8923219,0.000036363745,0.10735048,0.00013425652,0.000009396474,0.00006855164,3.4539548e-7,0.000013492485,0.00006522119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987222,0.00014364891,0.00032895667,0.00031471462,0.00026124882,0.00022925805],"domain_scores_gemma":[0.99880475,0.00021056291,0.00018733705,0.00030662477,0.00040071196,0.00009003077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020078447,0.00018925013,0.00022034471,0.00018919751,0.00046863942,0.00020494698,0.00042606838,0.00005742958,0.00013900231],"category_scores_gemma":[0.0000041752874,0.00015247033,0.000054122775,0.0006211943,0.00017782701,0.00090267183,0.0000057893553,0.00027450203,0.00003114441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057430872,0.00041052856,0.00003899701,0.000061672894,0.00009953498,0.0000066855564,0.00652942,0.18375222,0.27124858,0.00025531923,0.00014756306,0.5373921],"study_design_scores_gemma":[0.000752086,0.00031931553,0.00020053891,0.00045174622,0.000017641569,0.000023838671,0.00038276968,0.77489644,0.22253716,0.00006789859,0.000019985706,0.0003305919],"about_ca_topic_score_codex":0.000008223144,"about_ca_topic_score_gemma":0.0000047912395,"teacher_disagreement_score":0.8822509,"about_ca_system_score_codex":0.000046151104,"about_ca_system_score_gemma":0.00019144414,"threshold_uncertainty_score":0.62175596},"labels":[],"label_agreement":null},{"id":"W1997685368","doi":"10.1109/icc.2010.5502770","title":"Adaptive Control of Packet Overhead in XOR Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network packet; Computer network; Linear network coding; Overhead (engineering); Throughput; Coding (social sciences); Packet loss; Real-time computing; Wireless","score_opus":0.028294070528355954,"score_gpt":0.2680120011075765,"score_spread":0.23971793057922056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997685368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020904543,0.00021661444,0.94496095,0.0014233156,0.00040716308,0.00022414242,9.893713e-7,0.00008302918,0.031779267],"genre_scores_gemma":[0.97903806,0.00007030351,0.020247372,0.00045424202,0.00005070447,0.000008705335,4.4987843e-7,0.0000035752594,0.00012657978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999223,0.0001009637,0.00022040572,0.00016164817,0.00010713137,0.00018684522],"domain_scores_gemma":[0.998971,0.00031014116,0.0000717638,0.0005101323,0.00008981411,0.00004716747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048334067,0.000078728015,0.00016059805,0.000054132626,0.00006303042,0.00003464863,0.0006508818,0.000042683983,0.00008879379],"category_scores_gemma":[0.000054241453,0.00006933177,0.00003598676,0.0004070284,0.000046903544,0.00021744522,0.00019822433,0.0002405318,0.000013004417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012953306,0.00004792894,0.0056478013,0.0000017711488,0.0000095264095,0.0000017434539,0.00039945176,0.00043253056,0.0044172164,0.93631965,0.0014042836,0.05130515],"study_design_scores_gemma":[0.00148945,0.00010338892,0.037125077,0.00006529241,0.0000034640047,0.0000049503687,0.000045222514,0.9470784,0.0018370567,0.0046364325,0.0073383055,0.0002729451],"about_ca_topic_score_codex":0.000012376604,"about_ca_topic_score_gemma":0.00069879997,"teacher_disagreement_score":0.9581335,"about_ca_system_score_codex":0.000012408054,"about_ca_system_score_gemma":0.00004328845,"threshold_uncertainty_score":0.28272673},"labels":[],"label_agreement":null},{"id":"W1997722127","doi":"10.1109/icc.2010.5501760","title":"Throughput Maximization for User Cooperative Wireless Systems with Adaptive Modulation","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Link adaptation; Throughput; Quadrature amplitude modulation; Computer network; Spectral efficiency; Relay; Bit error rate; QAM; Node (physics); Cooperative diversity; Wireless; Channel (broadcasting); Telecommunications; Fading; Engineering","score_opus":0.03493966290760995,"score_gpt":0.2637120619711515,"score_spread":0.22877239906354155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997722127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010549321,0.000028356091,0.9848014,0.0005712582,0.00029174492,0.00066053134,0.0000019354945,0.00016977458,0.00292565],"genre_scores_gemma":[0.920568,0.00002616757,0.07787484,0.00016431395,0.00007011218,0.00013902399,0.00001368455,0.000010981074,0.001132915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916804,0.0000723276,0.00017140561,0.00028764125,0.00014280122,0.00015776731],"domain_scores_gemma":[0.9985577,0.00013568201,0.000086255466,0.00053165056,0.00063628634,0.00005241311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020617576,0.00012666556,0.00013631655,0.00005314723,0.00030976944,0.0002530174,0.00046077408,0.00005686776,0.000015460415],"category_scores_gemma":[0.000020482545,0.00009437293,0.000023623863,0.0003468316,0.0000454084,0.0007656576,0.00010575519,0.00013494103,0.0000106839925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019831916,0.00003924022,0.00020248759,0.000004125858,0.000020318765,3.0909032e-7,0.0005946965,0.012870496,0.0022121998,0.969659,0.0006406478,0.013736661],"study_design_scores_gemma":[0.0004615224,0.00011676783,0.0006911287,0.000017112758,0.0000036909196,0.0000051559073,0.00006999974,0.99312204,0.0010715493,0.00016741145,0.0041051693,0.00016845248],"about_ca_topic_score_codex":0.000011063173,"about_ca_topic_score_gemma":0.00023679428,"teacher_disagreement_score":0.98025155,"about_ca_system_score_codex":0.00002658968,"about_ca_system_score_gemma":0.00007037671,"threshold_uncertainty_score":0.38484165},"labels":[],"label_agreement":null},{"id":"W1997731677","doi":"10.1109/wcnc.2010.5506419","title":"Closed-Form Error Analysis of Dual-Hop Relaying Systems over Nakagami-m Fading Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Nakagami distribution; Hypergeometric function; Channel state information; Confluent hypergeometric function; Mathematics; Fading distribution; Moment-generating function; Algorithm; Computer science; Topology (electrical circuits); Statistics; Telecommunications; Wireless; Probability density function; Combinatorics; Decoding methods; Rayleigh fading; Mathematical analysis","score_opus":0.04085268309593338,"score_gpt":0.2999734830769199,"score_spread":0.2591207999809865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997731677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6977319,0.00027522718,0.28090024,0.00050325855,0.0013407868,0.00024854112,0.0000026087541,0.00025995373,0.018737476],"genre_scores_gemma":[0.99432266,0.00007734346,0.003957455,0.00015201326,0.000060405677,0.000013635212,0.0000049063083,0.000008134569,0.0014034625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986733,0.00009067767,0.0004169493,0.00030364405,0.00027178868,0.00024359951],"domain_scores_gemma":[0.9981548,0.00022389615,0.00018879779,0.0011331417,0.00020410966,0.000095257754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007226413,0.00014134932,0.00033060097,0.00045459633,0.00021769397,0.00018300815,0.00088185637,0.00008033546,0.00013601177],"category_scores_gemma":[0.00007084135,0.00012114785,0.00016050985,0.0020468067,0.000045502366,0.00047634947,0.0005133841,0.00026717997,0.000019920299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009681368,0.00017904815,0.011643557,0.00004510799,0.0012095324,0.00000768664,0.00944493,0.013181896,0.065490544,0.8633164,0.002019511,0.033452116],"study_design_scores_gemma":[0.00019132084,0.000022234673,0.006401288,0.00002605007,0.00007296493,0.0000023665136,0.00011106271,0.9872843,0.0013023237,0.000078464676,0.004298301,0.00020932626],"about_ca_topic_score_codex":0.000050976745,"about_ca_topic_score_gemma":0.00017528895,"teacher_disagreement_score":0.9741024,"about_ca_system_score_codex":0.000030170833,"about_ca_system_score_gemma":0.000037060447,"threshold_uncertainty_score":0.4940266},"labels":[],"label_agreement":null},{"id":"W1997745642","doi":"10.1109/ccece.2012.6334865","title":"Enhanced ZP-OFDM receiver in multi-relay cooperative networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Relay; Reduction (mathematics); Minimum mean square error; Multiplexing; Bit error rate; Communication complexity; Computational complexity theory; Computer network; Electronic engineering; Telecommunications; Algorithm; Mathematics; Decoding methods; Engineering; Statistics","score_opus":0.05703303983955992,"score_gpt":0.30783193595689273,"score_spread":0.2507988961173328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997745642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008482844,0.0009937194,0.97618043,0.0005180061,0.00040318043,0.00020271451,1.7516386e-7,0.00013355479,0.013085366],"genre_scores_gemma":[0.96860534,0.0008476038,0.027003495,0.0011078389,0.000060856863,0.000036022408,0.0000026625091,0.000008020765,0.002328171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987168,0.00027875774,0.000246847,0.00024025938,0.000112741436,0.00040461606],"domain_scores_gemma":[0.99893796,0.00016814073,0.000051883337,0.0006035285,0.00011363579,0.00012487372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004814861,0.00014690783,0.00016693486,0.000085331776,0.00015312269,0.000087098946,0.00076418987,0.00007147981,0.00021384271],"category_scores_gemma":[0.000059449907,0.00012533828,0.000037931484,0.0007167691,0.000044174314,0.0008557297,0.00043022254,0.00028071503,0.000172582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035740413,0.0013117517,0.012952371,0.000008210774,0.00007639692,0.0000066063194,0.019538946,0.036681935,0.007778956,0.56968904,0.010182454,0.3417376],"study_design_scores_gemma":[0.0010654391,0.00004622122,0.024817323,0.000048867987,0.0000027015294,0.000003734215,0.000112218426,0.9591994,0.0045899274,0.000017195776,0.009651321,0.00044564335],"about_ca_topic_score_codex":0.00000973061,"about_ca_topic_score_gemma":0.00021277912,"teacher_disagreement_score":0.96012247,"about_ca_system_score_codex":0.00007603825,"about_ca_system_score_gemma":0.00003053272,"threshold_uncertainty_score":0.5111147},"labels":[],"label_agreement":null},{"id":"W1997777170","doi":"10.1109/mascot.2008.4770563","title":"Optimal Layered Multicast with Network Coding: Mathematical Model and Empirical Studies","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multicast; Computer science; Linear network coding; Throughput; Upload; Coding (social sciences); Computer network; Simulated annealing; Application layer; Node (physics); Network layer; Distributed computing; Convex optimization; Decoding methods; Layer (electronics); Algorithm; Regular polygon; Network packet; Wireless; Mathematics","score_opus":0.1933319837970504,"score_gpt":0.3555951409002022,"score_spread":0.1622631571031518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997777170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07681235,0.0005974689,0.91638935,0.0019150806,0.000018140676,0.00013078736,1.8639417e-7,0.00017213715,0.0039645187],"genre_scores_gemma":[0.6765748,0.0006940477,0.32145253,0.00049232534,0.0000238146,0.000012316053,2.1951755e-7,0.000005511479,0.0007444271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990959,0.00006332384,0.00018634328,0.0002587752,0.00016239192,0.00023324593],"domain_scores_gemma":[0.9990494,0.00025184662,0.00003630296,0.00042828076,0.00012860706,0.00010556389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018628595,0.00013272208,0.00022342344,0.00002850965,0.00039909978,0.00005837731,0.000366982,0.000031046744,0.000011178888],"category_scores_gemma":[0.000044111614,0.0000900621,0.000023223607,0.00023415692,0.00019896742,0.00021894152,0.0005455231,0.00012976828,0.000015291504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007331188,0.00040816452,0.008691867,0.00004521129,0.00024513464,0.00009415516,0.019684935,0.2123632,0.00013674867,0.7193947,0.028888443,0.009974137],"study_design_scores_gemma":[0.00031776886,0.000060344377,0.0005435247,0.000028327322,0.0000040505756,0.00009890924,0.00006643155,0.99782753,0.00003086293,0.00054826634,0.0003291492,0.00014486034],"about_ca_topic_score_codex":2.0508259e-7,"about_ca_topic_score_gemma":0.000006981337,"teacher_disagreement_score":0.7854643,"about_ca_system_score_codex":0.000018726114,"about_ca_system_score_gemma":0.000043026797,"threshold_uncertainty_score":0.3672626},"labels":[],"label_agreement":null},{"id":"W1998050154","doi":"10.1109/tcomm.2013.102313.110741","title":"Coding Opportunity Densification Strategies for Instantly Decodable Network Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Goodput; Linear network coding; Network packet; Erasure; Coding (social sciences); Computer science; Monotonic function; Theoretical computer science; Algorithm; Mathematical optimization; Mathematics; Computer network; Telecommunications; Wireless; Throughput","score_opus":0.11632450337673955,"score_gpt":0.317877816346718,"score_spread":0.20155331296997847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998050154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005155793,0.00027515332,0.98342806,0.006372391,0.00036244566,0.00094598753,0.000012022226,0.00044945802,0.0076389066],"genre_scores_gemma":[0.89787495,0.0030244226,0.096629724,0.0008420689,0.000037187594,0.0009917585,0.000022059918,0.000025274927,0.0005525312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810386,0.00035450468,0.00054567336,0.00037242568,0.00019780814,0.0004257274],"domain_scores_gemma":[0.9945217,0.0011324916,0.00020782046,0.0033252276,0.00059799297,0.00021481913],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005870255,0.00024203994,0.00024928892,0.00019072398,0.0024354565,0.0006811095,0.0026907371,0.00011089036,0.00011133705],"category_scores_gemma":[0.000034018005,0.0002590115,0.00014883504,0.0008874408,0.00016280283,0.0015561756,0.000042488253,0.00046634607,0.00011771394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014409908,0.0005371994,0.000019776493,0.000029290093,0.00012836045,3.8547805e-7,0.001673662,0.01760429,0.0054379464,0.739955,0.009886073,0.22471362],"study_design_scores_gemma":[0.0007962028,0.00015962435,0.00035265688,0.00016961701,0.000048333364,0.000013538017,0.0008215153,0.93136334,0.0020164817,0.021297853,0.042275533,0.0006853033],"about_ca_topic_score_codex":0.000044841243,"about_ca_topic_score_gemma":0.00037993255,"teacher_disagreement_score":0.91375905,"about_ca_system_score_codex":0.00015450513,"about_ca_system_score_gemma":0.00031485484,"threshold_uncertainty_score":0.99998623},"labels":[],"label_agreement":null},{"id":"W1998107430","doi":"10.1109/glocom.2013.6831628","title":"Multisource buffer-aided relay networks: Adaptive rate transmission","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Relay; Computer network; Transmission (telecommunications); Throughput; Network packet; A priori and a posteriori; Telecommunications link; Node (physics); Schedule; Channel (broadcasting); Channel state information; Selection (genetic algorithm); Link adaptation; Wireless; Telecommunications; Engineering; Fading","score_opus":0.028438651393010595,"score_gpt":0.24456491889731638,"score_spread":0.21612626750430577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998107430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027862422,0.00067695015,0.9825083,0.0030411633,0.000114739196,0.00029974233,8.311409e-8,0.00031645506,0.010256327],"genre_scores_gemma":[0.8932023,0.0008480341,0.09922523,0.0013924233,0.000050410414,0.000053582346,0.0000021994522,0.000011631938,0.0052141794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987059,0.00033991947,0.0002384447,0.00031732794,0.00012251166,0.00027587358],"domain_scores_gemma":[0.9986598,0.00026634242,0.000059442184,0.0006984289,0.00016057827,0.00015542885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030862156,0.00015354011,0.00015149669,0.000056843484,0.0002780708,0.00020413568,0.00097323564,0.00006464258,0.0004789259],"category_scores_gemma":[0.000022154252,0.00012031353,0.000065329295,0.00042074986,0.000042662068,0.00064406544,0.00027914322,0.00022577714,0.0003388647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010475592,0.000105190564,0.00012755815,0.0000031202446,0.000030369327,0.000004076588,0.0013955217,0.010144174,0.004670611,0.062709734,0.028191289,0.89260787],"study_design_scores_gemma":[0.00032296768,0.00005570462,0.002541746,0.00003029912,0.0000022004174,0.0000039936185,0.000029719507,0.9756544,0.00076212717,0.00028781395,0.020114088,0.00019490311],"about_ca_topic_score_codex":0.000029594907,"about_ca_topic_score_gemma":0.000011203237,"teacher_disagreement_score":0.96551025,"about_ca_system_score_codex":0.00003191973,"about_ca_system_score_gemma":0.00002341791,"threshold_uncertainty_score":0.5243903},"labels":[],"label_agreement":null},{"id":"W1998127639","doi":"10.1109/noms.2014.6838315","title":"Power allocation and scheduling in practical implementations of wireless network coding","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Linear network coding; Relay; Network packet; Computer network; Wireless; Scheduling (production processes); Broadcasting (networking); Transmitter power output; Wireless network; Coding (social sciences); Synchronization (alternating current); Sleep mode; Implementation; Power consumption; Power (physics); Real-time computing; Telecommunications; Engineering; Transmitter; Channel (broadcasting)","score_opus":0.04306100613729998,"score_gpt":0.3411315370473877,"score_spread":0.2980705309100877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998127639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08767034,0.000045077002,0.90589696,0.0028099215,0.00004693012,0.00007887422,6.585004e-8,0.000025979762,0.0034258354],"genre_scores_gemma":[0.89164585,0.00012549448,0.10794048,0.0002511274,0.00001254025,0.000005954018,0.0000011140273,0.0000022597221,0.000015173755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934334,0.00013638086,0.00020114736,0.00012800227,0.0000787615,0.00011237098],"domain_scores_gemma":[0.9992822,0.00032526595,0.0000617623,0.00023050066,0.000068469555,0.000031797495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061349175,0.000048905073,0.000084652005,0.00004849925,0.0000832605,0.00004981557,0.00016717309,0.000019202733,0.00002392204],"category_scores_gemma":[0.000072556846,0.000047231282,0.000010783832,0.0002998659,0.00002478012,0.0002933739,0.00019034703,0.00007771491,0.000002157284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013528377,0.000018757779,0.006326849,0.0000025975123,0.000003145158,1.0965433e-7,0.00043482662,0.00060873816,0.0008948031,0.97613895,0.000095835254,0.015474017],"study_design_scores_gemma":[0.0003631523,0.00004225516,0.026110893,0.000045525434,0.0000020458851,0.0000034832851,0.00014138542,0.9690577,0.0006958571,0.0021870125,0.001240889,0.00010982113],"about_ca_topic_score_codex":0.000005447619,"about_ca_topic_score_gemma":0.00009911723,"teacher_disagreement_score":0.97395194,"about_ca_system_score_codex":0.000013537966,"about_ca_system_score_gemma":0.000026305435,"threshold_uncertainty_score":0.19260357},"labels":[],"label_agreement":null},{"id":"W1998315817","doi":"10.1109/vtcfall.2014.6966128","title":"Phase-Forward - A Robust Transmission Scheme for Two-Way Cooperative Communication with Non-Linear Power Amplifiers","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Amplifier; Computer science; Distortion (music); Fading; Transmission (telecommunications); Electronic engineering; Benchmark (surveying); Linear amplifier; Communications system; Bit error rate; SIGNAL (programming language); Power (physics); Telecommunications; RF power amplifier; Decoding methods; Engineering; Physics; Bandwidth (computing)","score_opus":0.039046450423013676,"score_gpt":0.3093789534523251,"score_spread":0.2703325030293114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998315817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025342868,0.00016346104,0.9832881,0.0025463998,0.00003824904,0.0005746774,0.0000017249852,0.00017564626,0.010677474],"genre_scores_gemma":[0.56190723,0.00013217525,0.4359686,0.0010222468,0.000023985482,0.00010776373,0.00002993485,0.000017873612,0.0007901978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986646,0.00019504962,0.00028900697,0.00037645752,0.00019367534,0.000281185],"domain_scores_gemma":[0.99775964,0.00030704224,0.00010360535,0.0012176946,0.00045885143,0.00015318001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006430254,0.00021075782,0.00024429098,0.00008850315,0.00061529176,0.00018394702,0.0012416263,0.000058107722,0.00007678493],"category_scores_gemma":[0.00003657867,0.00015735862,0.00007009967,0.00046001794,0.000104708066,0.00056000496,0.0001849308,0.00021230712,0.000024733587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003357481,0.0011237583,0.000060387698,0.000032380536,0.0001454616,8.6562244e-7,0.006361801,0.0076324255,0.017816562,0.5537242,0.010940638,0.40182573],"study_design_scores_gemma":[0.004376238,0.0006906733,0.000019358786,0.000079631805,0.000008636198,0.000003903279,0.00008766132,0.912522,0.0054657073,0.00016667103,0.07627728,0.0003022007],"about_ca_topic_score_codex":0.0000065481504,"about_ca_topic_score_gemma":0.000036371734,"teacher_disagreement_score":0.9048896,"about_ca_system_score_codex":0.00004646665,"about_ca_system_score_gemma":0.00007679605,"threshold_uncertainty_score":0.64168984},"labels":[],"label_agreement":null},{"id":"W1998322187","doi":"10.1109/cwit.2013.6621597","title":"A unified relay framework with both D-F and C-F relay nodes","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Relay channel; Decoding methods; Node (physics); Upstream (networking); Computer science; Link Access Procedure for Frame Relay; Computer network; Downstream (manufacturing); Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics; Engineering; Power (physics); Physics","score_opus":0.02036239418552719,"score_gpt":0.24407757200435737,"score_spread":0.22371517781883019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998322187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05300667,0.00055916986,0.91247433,0.0070849555,0.00005466604,0.00019666961,9.281566e-8,0.0002463585,0.026377104],"genre_scores_gemma":[0.750619,0.0003417974,0.24557506,0.0012921074,0.000014519111,0.000019924915,3.7025555e-7,0.0000054296056,0.002131795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993305,0.00007467262,0.00011200023,0.00022055082,0.000106451575,0.00015579758],"domain_scores_gemma":[0.99894357,0.00019816263,0.000035926838,0.0006555465,0.00008023571,0.00008656898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013111917,0.00009546532,0.00009741263,0.00004323217,0.0001861289,0.00026649426,0.00049246143,0.000045371,0.0001565008],"category_scores_gemma":[0.000031829593,0.0000653437,0.000013215522,0.00031582516,0.000059105845,0.0004285355,0.00030118285,0.00018574318,0.00008779441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042123143,0.000037789217,0.0038254845,0.0000044099156,0.00002015461,0.0000024753665,0.0014904259,0.00010715012,0.00035141662,0.9294684,0.0039851856,0.060702924],"study_design_scores_gemma":[0.002353183,0.0007297728,0.17499995,0.0005934165,0.000025395942,0.00013325339,0.0006629627,0.69986784,0.001891571,0.028638404,0.08815945,0.0019447628],"about_ca_topic_score_codex":0.000018033485,"about_ca_topic_score_gemma":0.000022262,"teacher_disagreement_score":0.90083,"about_ca_system_score_codex":0.000012073768,"about_ca_system_score_gemma":0.00002471452,"threshold_uncertainty_score":0.26646388},"labels":[],"label_agreement":null},{"id":"W1998326624","doi":"10.1109/vtcfall.2014.6965892","title":"BICM-Based Cooperative Communication Systems with Relay Selection: Constellation and Multiplexer Design","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Relay; Computer science; Quadrature amplitude modulation; Rayleigh fading; Bit error rate; Algorithm; Signal-to-noise ratio (imaging); Modulation (music); Electronic engineering; Communications system; Orthogonal frequency-division multiplexing; Diversity gain; Fading; Telecommunications; Channel (broadcasting); Decoding methods; Engineering","score_opus":0.034241867284645046,"score_gpt":0.24465980394453138,"score_spread":0.21041793665988634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998326624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002068964,0.0002766171,0.9900656,0.0008271786,0.000033291457,0.0002528524,1.3582641e-7,0.00016681658,0.006308595],"genre_scores_gemma":[0.8670665,0.0000964784,0.13233504,0.00028448898,0.000012204274,0.000019435975,0.0000035763742,0.0000061343517,0.00017615267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987347,0.0006699936,0.00016119883,0.00020569109,0.000119407196,0.000109012806],"domain_scores_gemma":[0.998534,0.00057713856,0.000082097526,0.00049081974,0.00025976842,0.000056151865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056549197,0.00010227024,0.00010853918,0.000070784496,0.0004162557,0.00027163106,0.00030131114,0.00004317236,0.00001865249],"category_scores_gemma":[0.000035349334,0.00008211014,0.000010883245,0.0003878675,0.00008670718,0.00032110472,0.00008615246,0.00011578666,0.000011446078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004226747,0.00006433617,0.0026266736,0.000011888367,0.000033376542,3.501618e-7,0.0007724755,0.55475986,0.0010373967,0.418805,0.0018652438,0.01998112],"study_design_scores_gemma":[0.0004917938,0.00013347312,0.0003942023,0.0000460664,0.000004033476,0.000009610395,0.000027451088,0.99361855,0.0012243995,0.00001787163,0.003904254,0.00012828993],"about_ca_topic_score_codex":0.000010403687,"about_ca_topic_score_gemma":0.000043005202,"teacher_disagreement_score":0.8649975,"about_ca_system_score_codex":0.000026361362,"about_ca_system_score_gemma":0.000056448043,"threshold_uncertainty_score":0.33483544},"labels":[],"label_agreement":null},{"id":"W1998593674","doi":"10.1109/icosp.2010.5655086","title":"Optimum 4-QAM relay amplification for the amplify-and-forward half-duplex cooperative wireless system","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; QAM; Wireless; Quadrature amplitude modulation; Computer science; Signal-to-noise ratio (imaging); Electronic engineering; Constellation; Telecommunications; Power (physics); Decoding methods; Topology (electrical circuits); Bit error rate; Electrical engineering; Engineering; Physics","score_opus":0.03301861277887982,"score_gpt":0.2814837325175727,"score_spread":0.24846511973869287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998593674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065147746,0.00022328262,0.9790471,0.010686484,0.00052445685,0.00080712483,0.000003262235,0.00029468985,0.0018987939],"genre_scores_gemma":[0.9583414,0.00021998334,0.039229173,0.00051802443,0.00011115768,0.0002945988,0.000009945851,0.000013654078,0.0012620384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988078,0.00011015825,0.0002894329,0.0003931034,0.0001584778,0.00024103269],"domain_scores_gemma":[0.99742395,0.00083108776,0.0001095846,0.0011723466,0.00036565718,0.000097406286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008178952,0.00016809332,0.00017796854,0.0000535031,0.0009260831,0.0004615135,0.0012123481,0.0000892885,0.00002186384],"category_scores_gemma":[0.000082170955,0.000109786975,0.000054997847,0.00031546102,0.00012162907,0.0003547981,0.00036006223,0.00032200044,0.00003891412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064404016,0.000019816458,0.0000377528,0.000009704019,0.00002230201,1.8888467e-7,0.0006149685,0.00017586027,0.004923817,0.9521241,0.0024128472,0.039652202],"study_design_scores_gemma":[0.0003776392,0.000049549675,0.0005899681,0.000019922069,0.000012250156,0.000017016753,0.0002957084,0.9022833,0.0019156216,0.00006476422,0.09415957,0.00021470495],"about_ca_topic_score_codex":0.000016390277,"about_ca_topic_score_gemma":0.0001426476,"teacher_disagreement_score":0.9520593,"about_ca_system_score_codex":0.000034092107,"about_ca_system_score_gemma":0.000067617344,"threshold_uncertainty_score":0.7122776},"labels":[],"label_agreement":null},{"id":"W1998694399","doi":"10.1109/iccs.2014.7024879","title":"A partial coherent detector for orthogonal modulations in two-way relay communications with physical network coding and fading","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Detector; Fading; Telecommunications link; Computer science; Relay; Bit error rate; Upper and lower bounds; Algorithm; Electronic engineering; Coding (social sciences); Decoding methods; Interference (communication); Topology (electrical circuits); Theoretical computer science; Telecommunications; Mathematics; Physics; Engineering; Statistics; Channel (broadcasting)","score_opus":0.04460702129512321,"score_gpt":0.31022374718270623,"score_spread":0.265616725887583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998694399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079801865,0.00007825118,0.91675425,0.0017184108,0.00004250563,0.00033737457,9.192223e-7,0.000090800655,0.0011756192],"genre_scores_gemma":[0.9305698,0.000043692347,0.06890205,0.00018099173,0.00008440933,0.00015220659,0.000005906694,0.000009113638,0.00005179331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896455,0.00020974877,0.0002079462,0.00026366193,0.00010683854,0.0002472647],"domain_scores_gemma":[0.99828064,0.0006510765,0.00007404694,0.0008216047,0.00009129639,0.000081318634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041406462,0.00012326136,0.00017741504,0.000058366582,0.0004577086,0.00014085954,0.0006219959,0.000021715094,0.000004588247],"category_scores_gemma":[0.000042144,0.0001037253,0.00003432922,0.0003894499,0.00008667836,0.00026498325,0.00042882675,0.00017118732,0.0000029361656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015966983,0.00008876273,0.0051041646,0.0000057978264,0.000018532422,2.0757118e-7,0.0010355274,0.021203067,0.00065683795,0.9010396,0.00009825319,0.070733294],"study_design_scores_gemma":[0.00071423844,0.00006815547,0.0047923904,0.00005029079,0.000006108586,0.0000029536316,0.000013543615,0.9896987,0.00007663127,0.0013763653,0.0030468577,0.00015374956],"about_ca_topic_score_codex":0.000008869532,"about_ca_topic_score_gemma":0.0009933697,"teacher_disagreement_score":0.96849567,"about_ca_system_score_codex":0.000035356374,"about_ca_system_score_gemma":0.00002968438,"threshold_uncertainty_score":0.4229795},"labels":[],"label_agreement":null},{"id":"W1998826964","doi":"10.1109/pacrim.2013.6625440","title":"Outage performance of MIMO cognitive relay networks with antenna selection","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cognitive radio; Nakagami distribution; Relay; Computer science; Fading; MIMO; Interference (communication); Antenna (radio); Selection (genetic algorithm); Computer network; 3G MIMO; Transmitter power output; Electronic engineering; Telecommunications; Power (physics); Wireless; Engineering; Transmitter; Physics; Artificial intelligence","score_opus":0.017033470997210892,"score_gpt":0.2310677381432545,"score_spread":0.2140342671460436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998826964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27853394,0.00011628475,0.71429163,0.00023994557,0.00004084706,0.0001792194,8.7899664e-8,0.000087161694,0.0065109036],"genre_scores_gemma":[0.9871696,0.00031543104,0.011067703,0.00027464473,0.000017949142,0.000022783677,0.0000013849824,0.000004791433,0.0011256717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993881,0.00006188244,0.00014376658,0.0001589771,0.0001014327,0.00014587014],"domain_scores_gemma":[0.9992239,0.000082875245,0.000073711606,0.00023043936,0.00034673235,0.000042370073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012518352,0.00008244313,0.00010250275,0.00005091515,0.00012170552,0.000059003665,0.00032912416,0.000029060284,0.00011621567],"category_scores_gemma":[0.000010817725,0.000060007478,0.00001938863,0.00048275542,0.000047796446,0.0005430142,0.00012952516,0.00013089558,0.00003757004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013046832,0.00052292465,0.20849758,0.00005634989,0.0002381777,0.000003107155,0.0042804177,0.011739268,0.008339158,0.042365007,0.004557718,0.7192698],"study_design_scores_gemma":[0.00023389293,0.00021440462,0.036703434,0.00006453454,0.0000031626562,0.000007194665,0.00003845409,0.9614142,0.0010577779,0.0000066701514,0.0001506521,0.00010557623],"about_ca_topic_score_codex":0.000012662122,"about_ca_topic_score_gemma":0.000031642052,"teacher_disagreement_score":0.94967496,"about_ca_system_score_codex":0.000013134643,"about_ca_system_score_gemma":0.000024105311,"threshold_uncertainty_score":0.2447034},"labels":[],"label_agreement":null},{"id":"W1998892986","doi":"10.1109/jsac.2013.130815","title":"Relay Selection and Performance Analysis in Multiple-User Networks","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":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Quadratic equation; Signal-to-noise ratio (imaging); Computational complexity theory; Scheme (mathematics); Computer network; Mathematical optimization; Algorithm; Telecommunications; Mathematics; Power (physics); Artificial intelligence","score_opus":0.04608209517420501,"score_gpt":0.2970217211579288,"score_spread":0.25093962598372377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998892986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.878786,0.0031180477,0.11475726,0.001982541,0.00020927306,0.00022585643,6.238433e-7,0.0000952741,0.00082510617],"genre_scores_gemma":[0.9760283,0.012506154,0.011063511,0.00024153847,0.00006249204,0.000028895342,0.000005570418,0.000010040518,0.000053455213],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979102,0.0008653773,0.0004956977,0.00017346468,0.00017828014,0.00037696146],"domain_scores_gemma":[0.9976285,0.0007163246,0.00020450067,0.0010551608,0.00024797852,0.00014753126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011592747,0.00015678987,0.00024315546,0.0008533255,0.0005674335,0.0001640002,0.0013533299,0.00009474903,0.000010879065],"category_scores_gemma":[0.00016621956,0.00015157105,0.00005460175,0.0049983016,0.000053640495,0.0008902754,0.00025098436,0.0012540127,0.000006904126],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024940173,0.00042313253,0.90507585,0.0000020506168,0.000100348785,7.4938754e-7,0.0012738435,0.057527915,0.00016861834,0.0036413656,0.00021464884,0.031546533],"study_design_scores_gemma":[0.0002919855,0.000035886078,0.44692433,0.000043790806,0.000015819085,0.000028996163,0.000013145844,0.5509518,0.00003969572,0.00001092644,0.0015232783,0.00012039075],"about_ca_topic_score_codex":0.000012048203,"about_ca_topic_score_gemma":0.0012011654,"teacher_disagreement_score":0.49342385,"about_ca_system_score_codex":0.00024316776,"about_ca_system_score_gemma":0.00006625903,"threshold_uncertainty_score":0.6180888},"labels":[],"label_agreement":null},{"id":"W1998916093","doi":"10.1109/icc.2013.6655044","title":"Efficient use of joint source-destination cooperation in the Gaussian multiple access channel","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Telecommunications link; Computer network; Decoding methods; Relay; Base station; Channel (broadcasting); Markov process; Telecommunications; Power (physics); Mathematics","score_opus":0.1089913211521436,"score_gpt":0.29048843707156596,"score_spread":0.18149711591942236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998916093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25241473,0.000029194816,0.74235994,0.003834038,0.00005624969,0.0004418324,1.8989999e-7,0.000046588382,0.0008172359],"genre_scores_gemma":[0.9953156,0.00002640813,0.0038234398,0.0006204854,0.00001275141,0.000060540482,0.0000028156658,0.0000035122669,0.00013444957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.0002419562,0.00024728963,0.0001545309,0.00015983234,0.00012348309],"domain_scores_gemma":[0.9989591,0.00023649672,0.000079393045,0.00050047727,0.00019841948,0.000026094727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038175916,0.00007621808,0.00008804844,0.000109793305,0.0001253451,0.00036635445,0.00072675454,0.000025535195,0.00003854213],"category_scores_gemma":[0.00018236965,0.000049850725,0.000024551768,0.00058613013,0.000031857955,0.00045764286,0.0002823001,0.000096675954,0.000023788742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009271229,0.0010518396,0.0063577173,0.000032544645,0.000017975295,0.0000017333051,0.022254638,0.5511097,0.0174776,0.17659499,0.006170558,0.21892148],"study_design_scores_gemma":[0.0001689313,0.00001996929,0.044756945,0.000019961111,7.009146e-7,0.0000013003686,0.000057375044,0.9532191,0.0013018453,0.000059873484,0.0003274043,0.00006659681],"about_ca_topic_score_codex":0.00016733682,"about_ca_topic_score_gemma":0.00020947291,"teacher_disagreement_score":0.74290085,"about_ca_system_score_codex":0.000025051171,"about_ca_system_score_gemma":0.00002303156,"threshold_uncertainty_score":0.35327646},"labels":[],"label_agreement":null},{"id":"W1999041413","doi":"10.1049/iet-com.2014.0399","title":"Strategic bargaining in wireless networks: basics, opportunities and challenges","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Higher Education Discipline Innovation Project; Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Wireless network; Telecommunications; Computer network","score_opus":0.24798601825803362,"score_gpt":0.3079864416591468,"score_spread":0.06000042340111317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999041413","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011256038,0.092710316,0.28079075,0.12992868,0.00034184032,0.00073877996,0.0000040315185,0.00091027166,0.48331928],"genre_scores_gemma":[0.84149945,0.1506072,0.0073724715,0.00040023416,0.000021696993,0.00004036825,0.000008509251,0.000008236721,0.000041832798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986076,0.0006254956,0.0002635899,0.00020830479,0.00009086534,0.00020416534],"domain_scores_gemma":[0.9968681,0.0006118128,0.000084043095,0.0022586735,0.00009345498,0.00008396322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008376172,0.000124464,0.00016993326,0.000115494186,0.0003436948,0.00016598808,0.0019997407,0.000055868913,0.0000052855903],"category_scores_gemma":[0.000033498658,0.00013192705,0.000024718405,0.00025197712,0.0001684027,0.0003551039,0.001227667,0.00028536754,0.0000050392773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.35718e-7,0.000032126456,0.00018407605,0.0000033008544,0.000004634698,3.1939533e-7,0.0007970769,0.000077221695,0.000008790805,0.86695594,0.000023621395,0.13191234],"study_design_scores_gemma":[0.00034011714,0.00004649956,0.005100281,0.0001206128,0.0000041332055,0.000007729434,0.0010672667,0.9335851,0.0000064974165,0.0157091,0.043734606,0.0002780672],"about_ca_topic_score_codex":0.000009816514,"about_ca_topic_score_gemma":0.00055680133,"teacher_disagreement_score":0.93350786,"about_ca_system_score_codex":0.000025543472,"about_ca_system_score_gemma":0.00004426399,"threshold_uncertainty_score":0.53798294},"labels":[],"label_agreement":null},{"id":"W1999062841","doi":"10.1109/tcomm.2013.070213.120570","title":"Energy-Efficient Cooperative Routing in Wireless Sensor Networks: A Mixed-Integer Optimization Framework and Explicit Solution","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Mathematical optimization; Wireless sensor network; Relay; Node (physics); Optimization problem; Integer programming; Transmission (telecommunications); Broadcasting (networking); Distributed computing; Computer network; Power (physics); Engineering; Algorithm; Mathematics; Telecommunications","score_opus":0.029147007911218943,"score_gpt":0.262162192802152,"score_spread":0.2330151848909331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999062841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016703398,0.00033931463,0.99226266,0.004178513,0.00021897965,0.0004188082,0.0000031569978,0.0002204934,0.00068773935],"genre_scores_gemma":[0.93810374,0.0035270413,0.05723009,0.0004931657,0.000019013463,0.0004715678,0.000008811342,0.000021486474,0.00012510561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788487,0.0006804956,0.0004967505,0.00041520962,0.00018177273,0.00034090126],"domain_scores_gemma":[0.99657494,0.0008759989,0.00013720764,0.0019687014,0.0003155059,0.0001276206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003342996,0.00024608948,0.00024651046,0.00028766994,0.0010306636,0.0003280417,0.0012115181,0.00015198189,0.00004718651],"category_scores_gemma":[0.000021461534,0.000254919,0.000068248555,0.001260966,0.00014693898,0.0005252743,0.00006872441,0.00066414534,0.000024114608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006020511,0.00041043552,0.000023136014,0.0000029616185,0.000028253378,4.6919902e-7,0.0015520564,0.8716273,0.000286368,0.07003667,0.00009075559,0.055935614],"study_design_scores_gemma":[0.0002818943,0.000043614633,0.00011891997,0.00015994113,0.000008725538,0.000006854572,0.0002577339,0.9982163,0.000368534,0.00014406024,0.00013052576,0.00026289703],"about_ca_topic_score_codex":0.00013632643,"about_ca_topic_score_gemma":0.000353983,"teacher_disagreement_score":0.9364334,"about_ca_system_score_codex":0.0001750211,"about_ca_system_score_gemma":0.00005958177,"threshold_uncertainty_score":0.9999903},"labels":[],"label_agreement":null},{"id":"W1999426732","doi":"10.1109/jproc.2010.2096251","title":"Network Coding [Scanning the issue]","year":2011,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network packet; Coding (social sciences); Computer science; Linear network coding; Wish; Computer network; Mathematics; Sociology","score_opus":0.06136549420561277,"score_gpt":0.2546489416619298,"score_spread":0.19328344745631704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999426732","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26619565,0.0047032633,0.058679692,0.033775747,0.006684128,0.0018454372,0.0000014475063,0.0009014839,0.6272131],"genre_scores_gemma":[0.9915164,0.00012689258,0.0062565156,0.0010665455,0.00017401244,0.000013784763,2.9415478e-8,0.0000074528125,0.0008383551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992429,0.000017427734,0.00019263184,0.00015750175,0.00017769546,0.00021184655],"domain_scores_gemma":[0.9991906,0.000060237933,0.00018560338,0.00033010062,0.00020168148,0.00003176206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060934684,0.000095918236,0.00010903781,0.000022433762,0.00045505862,0.000083993815,0.0026945078,0.000028328092,0.000020739979],"category_scores_gemma":[0.00005888528,0.000054742282,0.0000638429,0.00057784125,0.00009717192,0.000297076,0.0006537804,0.00019633575,0.0000130947765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020345897,0.00007328175,0.011229365,0.000039804523,0.00007042545,3.7675642e-7,0.024574984,0.00010671669,0.014333526,0.733883,0.17761225,0.038055878],"study_design_scores_gemma":[0.0017472245,0.00042942233,0.08255106,0.0018666821,0.00016450157,0.00012401053,0.0023742851,0.18319516,0.31778315,0.10973419,0.29795992,0.0020703836],"about_ca_topic_score_codex":0.0000059471504,"about_ca_topic_score_gemma":0.000002199846,"teacher_disagreement_score":0.72532076,"about_ca_system_score_codex":0.000017933138,"about_ca_system_score_gemma":0.000018802035,"threshold_uncertainty_score":0.5007111},"labels":[],"label_agreement":null},{"id":"W1999499117","doi":"10.1109/tcomm.2013.032713.120654","title":"On the Ergodic Capacity of Amplify-and-Forward Relay Channels with Interference in Nakagami-m Fading","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Nakagami distribution; Fading; Ergodic theory; Relay; Interference (communication); Computer science; Signal-to-noise ratio (imaging); Topology (electrical circuits); Channel capacity; Electronic engineering; Channel (broadcasting); Co-channel interference; Independent and identically distributed random variables; Single antenna interference cancellation; Telecommunications; Mathematics; Power (physics); Engineering; Physics; Electrical engineering; Random variable; Statistics","score_opus":0.06422410717492637,"score_gpt":0.2668053767185139,"score_spread":0.20258126954358752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999499117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0591225,0.00012000604,0.92885023,0.00907995,0.000087935616,0.00048753363,0.0000046220316,0.00007931477,0.00216793],"genre_scores_gemma":[0.99289155,0.0010748479,0.005231355,0.0003819679,0.0000032414653,0.00028496017,0.0000010593862,0.000009369325,0.00012167163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875784,0.00041499847,0.00029855358,0.00021329946,0.00013970576,0.00017557564],"domain_scores_gemma":[0.9960264,0.0013200422,0.00010586085,0.002345057,0.00014073467,0.000061919985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034110682,0.00014626939,0.00017182578,0.00020261768,0.00049109745,0.00010795731,0.0019049965,0.00005532604,0.000050334733],"category_scores_gemma":[0.000021692009,0.00010547136,0.000043019423,0.0007045703,0.0002943604,0.0003358792,0.000038541297,0.0006608742,0.000039583305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007016252,0.0020607165,0.00031989778,0.000041708532,0.00024621864,0.0000011917083,0.03054808,0.038422707,0.008600398,0.7262627,0.00084204733,0.1925842],"study_design_scores_gemma":[0.001905193,0.0010845279,0.0047135097,0.0015170337,0.00005145589,0.000040408817,0.0013964864,0.95211834,0.022428613,0.011829259,0.0018245623,0.0010905929],"about_ca_topic_score_codex":0.0001191085,"about_ca_topic_score_gemma":0.00055432564,"teacher_disagreement_score":0.93376905,"about_ca_system_score_codex":0.00006239254,"about_ca_system_score_gemma":0.000042591455,"threshold_uncertainty_score":0.43009973},"labels":[],"label_agreement":null},{"id":"W1999570629","doi":"10.1109/tvt.2011.2165740","title":"Optimal Data Transmission and Channel Code Rate Allocation in Multipath Wireless Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Multipath routing; Computer network; Multipath propagation; Channel (broadcasting); Wireless network; Wireless; Linear network coding; Channel allocation schemes; Distributed computing; Routing (electronic design automation); Routing protocol; Dynamic Source Routing; Telecommunications; Network packet","score_opus":0.05653176751486623,"score_gpt":0.26992566116030114,"score_spread":0.21339389364543493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999570629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049877625,0.00046553786,0.94791275,0.0010880256,0.00010446017,0.00023971002,0.0000030328001,0.0002741932,0.000034641333],"genre_scores_gemma":[0.97551775,0.0024575528,0.021790892,0.00012709961,0.0000065192366,0.000058003054,0.0000058481196,0.0000130535045,0.000023303019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873745,0.00015002488,0.0002548067,0.00052175217,0.00008459237,0.00025135084],"domain_scores_gemma":[0.99857646,0.000049719834,0.000058753536,0.0011923913,0.00006184698,0.00006081437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003828813,0.00016395687,0.00018447981,0.0003621689,0.0002158156,0.0000321519,0.0012200394,0.00022330246,0.00000812192],"category_scores_gemma":[0.000003334693,0.00016222017,0.000025711957,0.0007977237,0.00012221345,0.00036949659,0.00003006787,0.0004991074,0.000006670251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047474965,0.00044013772,0.00004642633,0.000011028551,0.00003840255,0.000029169598,0.0010993948,0.043121062,0.0054668,0.0039762254,0.000020388456,0.9457035],"study_design_scores_gemma":[0.0005312511,0.000110886984,0.000203175,0.00006280871,0.0000088424895,0.00002110227,0.00006131976,0.98563576,0.012567416,0.00012944458,0.000485301,0.00018272149],"about_ca_topic_score_codex":0.00001473847,"about_ca_topic_score_gemma":0.00013803101,"teacher_disagreement_score":0.94552076,"about_ca_system_score_codex":0.00003316633,"about_ca_system_score_gemma":0.000031473435,"threshold_uncertainty_score":0.66151464},"labels":[],"label_agreement":null},{"id":"W1999740312","doi":"10.1109/isit.2012.6283477","title":"Combined decode-forward and layered noisy network coding schemes for relay channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Relay channel; Linear network coding; Encoding (memory); Computer science; Coding (social sciences); Markov chain; Decoding methods; Algorithm; Channel (broadcasting); Topology (electrical circuits); Block (permutation group theory); Markov process; Power (physics); Mathematics; Telecommunications; Computer network; Artificial intelligence; Statistics","score_opus":0.046348315688812196,"score_gpt":0.29104561985688626,"score_spread":0.24469730416807406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999740312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011827256,0.0012927513,0.9811034,0.0020350597,0.0005836672,0.00032676125,6.290346e-7,0.00020195477,0.0026285094],"genre_scores_gemma":[0.9010025,0.000388945,0.09648965,0.0009119625,0.00021546993,0.000054248223,0.0000039491315,0.000010280851,0.0009229551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989909,0.00007291952,0.00020785883,0.00020988502,0.0000974755,0.00042098222],"domain_scores_gemma":[0.9988612,0.00034109736,0.000068166824,0.0004694673,0.00010062779,0.00015943573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006703579,0.00013356804,0.0001778456,0.000045574874,0.00040739906,0.00016625767,0.0005064134,0.000054896136,0.000028208442],"category_scores_gemma":[0.0000713205,0.000117509364,0.000048969352,0.00027045058,0.000033420467,0.00056886196,0.0004885295,0.00010089911,0.000016757325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015698144,0.000050521452,0.003994968,0.000012454284,0.000035100307,2.123718e-7,0.0006976898,0.00020005828,0.00035805046,0.9390463,0.015095315,0.040493634],"study_design_scores_gemma":[0.0015037465,0.00015184403,0.002306083,0.00007667571,0.000013883801,0.000008657914,0.00004751022,0.73501384,0.0025655897,0.002168839,0.25559735,0.0005460066],"about_ca_topic_score_codex":0.0000013518468,"about_ca_topic_score_gemma":0.0000059560452,"teacher_disagreement_score":0.9368774,"about_ca_system_score_codex":0.000023022078,"about_ca_system_score_gemma":0.00001879237,"threshold_uncertainty_score":0.47918928},"labels":[],"label_agreement":null},{"id":"W1999791346","doi":"10.1109/isit.2012.6283638","title":"Lossy source-channel communication over a phase-incoherent interference relay channel","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Relay channel; Interference (communication); Channel (broadcasting); Topology (electrical circuits); Distortion (music); Lossy compression; Computer science; Co-channel interference; Gaussian; Wireless; Telecommunications; Physics; Mathematics; Bandwidth (computing); Combinatorics; Power (physics)","score_opus":0.06393562008494043,"score_gpt":0.3203780019850835,"score_spread":0.25644238190014307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999791346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016592586,0.0025862693,0.96208376,0.0022334172,0.00032966823,0.00026097964,0.0000010160096,0.0003643205,0.015547992],"genre_scores_gemma":[0.990973,0.0007948631,0.0047897804,0.0009626814,0.00008349686,0.000054295357,0.000009557221,0.000013480697,0.0023188507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985507,0.00029274757,0.00031794942,0.00024570528,0.00019858524,0.00039428717],"domain_scores_gemma":[0.99772525,0.00018653563,0.0001302592,0.0016323049,0.00013398143,0.00019166077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006043814,0.00018849949,0.00018043743,0.0001088485,0.00034640005,0.00017895935,0.0017815313,0.00007095537,0.00025205332],"category_scores_gemma":[0.000052505853,0.00016533631,0.00007465941,0.00041994813,0.00007034559,0.0009909215,0.0013822691,0.00030138326,0.00025970823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007839486,0.003375673,0.0017616305,0.000044544166,0.00019088904,0.000002036327,0.04338729,0.0009361375,0.0037532295,0.4476533,0.061034806,0.43778208],"study_design_scores_gemma":[0.0021862965,0.0002467546,0.0024223728,0.00022701998,0.000018036302,0.000030550476,0.00039136386,0.89344835,0.0041950056,0.0014681757,0.09447415,0.0008919347],"about_ca_topic_score_codex":0.000019589052,"about_ca_topic_score_gemma":0.000041060273,"teacher_disagreement_score":0.97438043,"about_ca_system_score_codex":0.00008730697,"about_ca_system_score_gemma":0.000029625191,"threshold_uncertainty_score":0.67422193},"labels":[],"label_agreement":null},{"id":"W1999846467","doi":"10.1109/glocomw.2011.6162407","title":"Single-carrier frequency-domain equalization for multi-relay cooperative systems with relay selection","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Relay; Algorithm; Topology (electrical circuits); Physics; Combinatorics; Mathematics","score_opus":0.12507263917150774,"score_gpt":0.28815411200218277,"score_spread":0.16308147283067503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999846467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057442402,0.00019118752,0.98770976,0.00010735088,0.00021045149,0.0004890222,0.0000017692593,0.00022259737,0.0053236056],"genre_scores_gemma":[0.6733634,0.000027025873,0.3253275,0.00017391884,0.00003376855,0.00015902285,0.000009637256,0.00001537616,0.00089034514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883115,0.00023153033,0.00025663024,0.0003260059,0.0001394612,0.00021518969],"domain_scores_gemma":[0.9987809,0.00011012148,0.00011956499,0.0003980893,0.0005145401,0.00007679456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037817378,0.00014710397,0.00013951572,0.00008726145,0.0003858623,0.00015881032,0.00044313527,0.00007176657,0.000049295177],"category_scores_gemma":[0.00007019984,0.00011800585,0.000033858094,0.00054835185,0.00004893676,0.0005948473,0.000082838575,0.000102398866,0.0000138681735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002344092,0.00013364857,0.00090668106,0.000011172116,0.00004978804,0.0000010532351,0.006049504,0.0010250802,0.0049657947,0.9846876,0.00058643194,0.0015597576],"study_design_scores_gemma":[0.0019315106,0.0011730433,0.00069011346,0.00014467607,0.000022432674,0.000037452333,0.0006291648,0.9754701,0.013978471,0.00029835053,0.004960543,0.0006640941],"about_ca_topic_score_codex":0.000034700322,"about_ca_topic_score_gemma":0.00037721233,"teacher_disagreement_score":0.9843893,"about_ca_system_score_codex":0.000083261235,"about_ca_system_score_gemma":0.0000875782,"threshold_uncertainty_score":0.4812139},"labels":[],"label_agreement":null},{"id":"W1999977746","doi":"10.1109/ciss.2009.5054800","title":"Constellation Design for Cooperative Communication","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Constellation; Computer science; Constellation diagram; Antenna diversity; SIGNAL (programming language); Cooperative diversity; Communications system; Set (abstract data type); Telecommunications; Electronic engineering; Computer network; Decoding methods; Wireless; Bit error rate; Engineering; Fading","score_opus":0.08669155126468887,"score_gpt":0.3158462805663913,"score_spread":0.22915472930170244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999977746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009728964,0.00036626257,0.963198,0.005460501,0.00003158327,0.0003964961,2.388736e-7,0.00015825515,0.030291382],"genre_scores_gemma":[0.72352374,0.0003061087,0.27443606,0.0014615376,0.000010898159,0.0000051768925,0.0000054752663,0.0000020350626,0.0002489824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936026,0.00016965921,0.00015359675,0.00014325623,0.00006589278,0.00010735193],"domain_scores_gemma":[0.99878114,0.00033361296,0.000048453014,0.0005960281,0.00020483961,0.0000359236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038720935,0.000072067094,0.000083777995,0.00004427592,0.00028909807,0.0001411309,0.00061714335,0.000028895609,0.000024832632],"category_scores_gemma":[0.000031120846,0.000064506065,0.000027458844,0.00023426865,0.000023753579,0.00038087487,0.00006269328,0.000056771518,0.000016634127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062820836,0.000034631183,0.0000051081743,5.516433e-7,0.0000046179134,6.426e-8,0.00047352718,0.0021099832,0.0014484753,0.7053588,0.007534215,0.28302374],"study_design_scores_gemma":[0.0005739408,0.00021832461,0.00022997065,0.000017944261,0.000003420204,0.0000034310058,0.000040240713,0.94766533,0.009502075,0.014767512,0.026775243,0.00020256283],"about_ca_topic_score_codex":3.2874442e-7,"about_ca_topic_score_gemma":0.0000017960681,"teacher_disagreement_score":0.9455553,"about_ca_system_score_codex":0.00002707376,"about_ca_system_score_gemma":0.00004074228,"threshold_uncertainty_score":0.26304808},"labels":[],"label_agreement":null},{"id":"W2000053100","doi":"10.1109/icc.2013.6655427","title":"Joint source-relay design in multi-antenna multi-relay networks with prefixed receivers","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Transmitter power output; Precoding; Semidefinite programming; Iterative method; Optimization problem; Algorithm; Mathematical optimization; MIMO; Power (physics); Mathematics; Telecommunications; Beamforming; Transmitter","score_opus":0.07958416042772855,"score_gpt":0.25821578519177407,"score_spread":0.17863162476404554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000053100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005239382,0.00038727315,0.9918251,0.0009399016,0.00014132453,0.00070707535,1.1030535e-7,0.00027251957,0.00048728756],"genre_scores_gemma":[0.6100331,0.00036612424,0.386333,0.0006342029,0.000014268056,0.000103102706,0.000001634879,0.00001730036,0.0024972705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979902,0.0004892112,0.00037733425,0.000490269,0.00018670378,0.00046629758],"domain_scores_gemma":[0.9983186,0.00021512664,0.000121971774,0.0009670692,0.00021157008,0.00016564615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005620709,0.00024870335,0.00026649935,0.00016766807,0.00021999446,0.0002571706,0.0010924037,0.00010120973,0.00017911868],"category_scores_gemma":[0.000059360835,0.00018602965,0.000057193887,0.0007688503,0.0000907876,0.000660418,0.00046097365,0.00042154538,0.00019306132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057587902,0.0009961701,0.013348591,0.000014065125,0.00013951107,0.00002611361,0.008404146,0.7462632,0.0050656246,0.0033739677,0.01081988,0.21149117],"study_design_scores_gemma":[0.001283503,0.00008976706,0.015772758,0.000082471764,0.0000033724,0.000005636026,0.000105401436,0.98153424,0.00019426111,0.0000053677313,0.0006245246,0.000298705],"about_ca_topic_score_codex":0.00015523487,"about_ca_topic_score_gemma":0.00044657494,"teacher_disagreement_score":0.6054921,"about_ca_system_score_codex":0.00010202653,"about_ca_system_score_gemma":0.00006209243,"threshold_uncertainty_score":0.7586069},"labels":[],"label_agreement":null},{"id":"W2000743160","doi":"10.1109/iccchina.2012.6356901","title":"On codebook design for distributed relay beamforming network","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Codebook; Relay; Linde–Buzo–Gray algorithm; Beamforming; Computer science; Relay channel; Power (physics); Power control; Constraint (computer-aided design); Mathematical optimization; Algorithm; Mathematics; Telecommunications","score_opus":0.07678165623281775,"score_gpt":0.29568741940605203,"score_spread":0.2189057631732343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000743160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016178368,0.00030292582,0.9942195,0.00062386156,0.0002748171,0.00030011014,9.343955e-7,0.00017447697,0.0039415895],"genre_scores_gemma":[0.55034196,0.000081829916,0.44607568,0.0017917347,0.0002068763,0.00010588705,0.000013769879,0.0000108176555,0.0013714709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916637,0.00009245905,0.00015255532,0.00013956492,0.00009223864,0.00035680147],"domain_scores_gemma":[0.9985778,0.0007075602,0.000048085698,0.0005015149,0.000063714106,0.000101324214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006687845,0.000096945885,0.00010103122,0.000024945799,0.00033999825,0.00007197781,0.00056750875,0.00003665578,0.000030068117],"category_scores_gemma":[0.00007617939,0.00007966499,0.000045980953,0.00020829632,0.000016027043,0.00032646453,0.00017875645,0.00008724557,0.000050759412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012184552,0.0000469689,0.000084614876,0.0000015460089,0.000011915287,1.175172e-7,0.00022023194,0.010992087,0.00007218923,0.89341795,0.059712335,0.035427865],"study_design_scores_gemma":[0.00054987345,0.0001690954,0.00033358883,0.00004509011,0.0000069921275,0.000004719544,0.000011342948,0.7328826,0.0016938073,0.0051668133,0.25879866,0.00033739774],"about_ca_topic_score_codex":3.788324e-7,"about_ca_topic_score_gemma":0.0000016418734,"teacher_disagreement_score":0.8882511,"about_ca_system_score_codex":0.000046598023,"about_ca_system_score_gemma":0.000023105393,"threshold_uncertainty_score":0.3248644},"labels":[],"label_agreement":null},{"id":"W2000817821","doi":"10.1109/icc.2010.5501930","title":"A Generalized Switching Policy for Incremental Relaying with Adaptive Modulation","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spectral efficiency; Rayleigh fading; Computer science; Transmission (telecommunications); Bit error rate; Link adaptation; Fading; Modulation (music); Reduction (mathematics); Diversity combining; Wireless; Electronic engineering; Topology (electrical circuits); Telecommunications; Mathematics; Channel (broadcasting); Engineering; Physics","score_opus":0.04180828865783948,"score_gpt":0.2985967482790672,"score_spread":0.2567884596212277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000817821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16442844,0.000010715383,0.8307761,0.0015633381,0.00006132295,0.00022150995,3.010576e-7,0.000112094465,0.0028261936],"genre_scores_gemma":[0.6971532,0.000007138895,0.3021557,0.00043414356,0.0000704423,0.000031900945,0.0000021062049,0.0000050304097,0.00014032614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994282,0.00003616492,0.00011939037,0.0001862167,0.00008552271,0.00014450331],"domain_scores_gemma":[0.99934083,0.00007140918,0.000055563993,0.00037709466,0.00010564635,0.000049465547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022885791,0.00008227667,0.000078918376,0.00008769126,0.0003063532,0.00011910037,0.00039945883,0.00002737913,0.000012087113],"category_scores_gemma":[0.000032628323,0.000064382366,0.000027356988,0.00026680692,0.000013496791,0.0004254583,0.00016941062,0.00012524512,0.0000040306627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001457806,0.000016022515,0.0002229967,9.962824e-7,0.000010151721,1.876163e-7,0.00055450184,0.000253469,0.067837186,0.86309797,0.00008951996,0.067902416],"study_design_scores_gemma":[0.00075158454,0.00007691719,0.0014417934,0.000009845203,0.0000023810724,0.0000068696936,0.00002889418,0.988812,0.0040955595,0.0030051395,0.0016170663,0.00015191833],"about_ca_topic_score_codex":0.000050039725,"about_ca_topic_score_gemma":0.00040418928,"teacher_disagreement_score":0.9885586,"about_ca_system_score_codex":0.000031842457,"about_ca_system_score_gemma":0.00006879791,"threshold_uncertainty_score":0.26254368},"labels":[],"label_agreement":null},{"id":"W2000852639","doi":"10.1109/tcomm.2013.032013.120322","title":"Resource Allocation for Selective Relaying Based Cellular Wireless System with Imperfect CSI","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Telecommunications link; Karush–Kuhn–Tucker conditions; Probabilistic logic; Resource allocation; Quality of service; Mathematical optimization; Power control; Transmitter power output; Optimization problem; Fading; Channel state information; Channel (broadcasting); Computer network; Wireless; Power (physics); Mathematics; Algorithm; Telecommunications; Transmitter","score_opus":0.030046302312631026,"score_gpt":0.2506374002990045,"score_spread":0.22059109798637347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000852639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015446615,0.00015789381,0.9885526,0.0046997895,0.00008631823,0.0012771065,0.000007733092,0.00051668216,0.0031572455],"genre_scores_gemma":[0.94732237,0.000095237316,0.04995067,0.0003265635,0.00001621304,0.0019414976,0.000019700668,0.000033136144,0.0002946189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823195,0.00048954255,0.00036043156,0.0004002974,0.00021871082,0.00029907233],"domain_scores_gemma":[0.99479777,0.0010271177,0.00016329685,0.003307078,0.0005814474,0.00012332236],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004099834,0.00023120115,0.00022288668,0.00024059784,0.0017244786,0.00026484646,0.002130942,0.000094810755,0.000010238372],"category_scores_gemma":[0.000009339313,0.00021687109,0.000118841046,0.0009805257,0.00012524851,0.000549968,0.00001891085,0.0004404278,0.00006541212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022321253,0.002962903,0.00010559059,0.00031675908,0.0007842281,0.000002473922,0.008930406,0.13114613,0.0846969,0.26245174,0.0071639996,0.50121564],"study_design_scores_gemma":[0.0008123901,0.00023916863,0.000071798626,0.00019372294,0.00003928372,0.0000071812274,0.00032230705,0.9669553,0.026863962,0.00005518191,0.0040901364,0.0003495876],"about_ca_topic_score_codex":0.000056512323,"about_ca_topic_score_gemma":0.00015229764,"teacher_disagreement_score":0.9457777,"about_ca_system_score_codex":0.0002896287,"about_ca_system_score_gemma":0.00017121101,"threshold_uncertainty_score":0.99957514},"labels":[],"label_agreement":null},{"id":"W2001030250","doi":"10.1109/ictel.2012.6221248","title":"Robust distributed two-way relay beamforming in cognitive radio networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Cognitive radio; Relay; Computer science; Robustness (evolution); Beamforming; Channel state information; Transmitter power output; Quality of service; Transceiver; Optimization problem; Computer network; Mathematical optimization; Channel (broadcasting); Transmitter; Power (physics); Algorithm; Telecommunications; Mathematics; Wireless","score_opus":0.0642448799426006,"score_gpt":0.2877849889801915,"score_spread":0.22354010903759092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001030250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011785664,0.0009928374,0.97643346,0.0004008371,0.00026330433,0.00016628472,0.0000010849955,0.00014612492,0.009810395],"genre_scores_gemma":[0.98428124,0.00029375145,0.014504427,0.00041447824,0.00011355307,0.000024298703,0.00002421975,0.0000074995964,0.00033651796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987903,0.0001642981,0.00025539516,0.00021130555,0.00012572604,0.00045297848],"domain_scores_gemma":[0.9989888,0.00030396166,0.0000649192,0.00042193834,0.0000826432,0.00013773351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006673627,0.00013611249,0.00015829064,0.000085812,0.000184531,0.000099454905,0.00060428504,0.00005222305,0.00010233585],"category_scores_gemma":[0.00007909592,0.00012202788,0.000043917848,0.00081183773,0.000040892723,0.00091008464,0.00047346178,0.00029622563,0.000035433965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039261762,0.00069539074,0.09477311,0.000009278804,0.000086498934,0.000016758617,0.0059878677,0.07051075,0.00019655055,0.43216288,0.008479699,0.38704196],"study_design_scores_gemma":[0.0009259687,0.000027502421,0.021627733,0.00008945672,0.000005859461,0.000019751587,0.00013056838,0.9713454,0.00025427816,0.00005509074,0.005171739,0.0003466359],"about_ca_topic_score_codex":0.000014628344,"about_ca_topic_score_gemma":0.00010626156,"teacher_disagreement_score":0.9724956,"about_ca_system_score_codex":0.000088087196,"about_ca_system_score_gemma":0.000022913538,"threshold_uncertainty_score":0.49761525},"labels":[],"label_agreement":null},{"id":"W2001042213","doi":"10.1109/allerton.2011.6120285","title":"On the complexity of wireless uplink scheduling with successive interference cancellation","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scheduling (production processes); Telecommunications link; Single antenna interference cancellation; Maximum throughput scheduling; Fair-share scheduling; Round-robin scheduling; Wireless; Dynamic priority scheduling; Distributed computing; Computer network; Job shop scheduling; Proportionally fair; Mathematical optimization; Quality of service; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.14974978113713183,"score_gpt":0.2839174538352481,"score_spread":0.13416767269811625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001042213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120360754,0.000030024938,0.8562999,0.000663575,0.00003777752,0.000092931514,1.612023e-7,0.000037479465,0.022477394],"genre_scores_gemma":[0.9833334,0.000031582043,0.016339758,0.00022274301,0.000006089238,0.000006231276,4.2555106e-7,0.0000024962546,0.000057248482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947655,0.000099436154,0.000122031954,0.00013194948,0.00008784538,0.00008218303],"domain_scores_gemma":[0.9990335,0.00020413546,0.00009717815,0.00049335073,0.00014910423,0.000022726685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018726305,0.00006650243,0.0000806718,0.00002903277,0.00013956014,0.00003339088,0.0007823477,0.000016180067,0.00013488311],"category_scores_gemma":[0.000019400191,0.00003752336,0.00001574361,0.00024609084,0.00023128132,0.00012789952,0.00018060983,0.00011681887,0.000007727771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010687469,0.00002411314,0.00046437903,0.0000017961465,0.000006457766,2.0418611e-7,0.0013677949,0.00009747584,0.00035392863,0.9894375,0.00002141425,0.008214252],"study_design_scores_gemma":[0.00028120517,0.00023063099,0.00746794,0.00017814917,0.000004089319,0.0000016363654,0.0001884579,0.9214903,0.050857373,0.019080995,0.000027423852,0.00019176594],"about_ca_topic_score_codex":0.000044372246,"about_ca_topic_score_gemma":0.00014313078,"teacher_disagreement_score":0.9703565,"about_ca_system_score_codex":0.000017202103,"about_ca_system_score_gemma":0.000036809142,"threshold_uncertainty_score":0.15301582},"labels":[],"label_agreement":null},{"id":"W2001066214","doi":"10.1109/tvt.2013.2262957","title":"Optimization of Hierarchical Modulation for Decode-and-Forward Wireless Relay Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Quadrature amplitude modulation; QAM; Space–time block code; Transmission (telecommunications); Computer science; Bit error rate; Electronic engineering; Modulation (music); Wireless; Data stream; Phase-shift keying; Block code; Algorithm; Decoding methods; Telecommunications; Engineering","score_opus":0.013874692293323177,"score_gpt":0.24237495855867075,"score_spread":0.22850026626534758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001066214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020300353,0.000110790665,0.9761461,0.002585319,0.00013067096,0.00047618683,0.0000015190084,0.0002169822,0.000032105334],"genre_scores_gemma":[0.89933705,0.0005572302,0.09975898,0.000095481024,0.000008433308,0.00018965834,0.000003174443,0.000011056084,0.00003890614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909115,0.00006670149,0.00028959938,0.00027636357,0.00009477131,0.00018140767],"domain_scores_gemma":[0.99898714,0.00013340631,0.00008948412,0.0005330833,0.00021105137,0.000045863446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015230259,0.00011792638,0.00018831313,0.00030358165,0.00024256426,0.000036005084,0.00041402108,0.00021990652,0.000015671527],"category_scores_gemma":[0.000010466193,0.00011776144,0.00006563592,0.0005879994,0.00012077837,0.00023102324,0.000010212583,0.00025894848,0.0000035591477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007001846,0.00005244216,0.0000135643695,0.0000049010546,0.000022212687,1.7024763e-7,0.000042267708,0.7155128,0.0009981723,0.015274279,0.000019731953,0.26805246],"study_design_scores_gemma":[0.00037397558,0.00012877464,0.000070950926,0.000026291653,0.00000964256,0.0000072021753,0.000009441996,0.99327356,0.004780795,0.0010277948,0.00017601273,0.00011558364],"about_ca_topic_score_codex":0.0000031698976,"about_ca_topic_score_gemma":0.000008922113,"teacher_disagreement_score":0.8790367,"about_ca_system_score_codex":0.000034462228,"about_ca_system_score_gemma":0.0000213492,"threshold_uncertainty_score":0.48021722},"labels":[],"label_agreement":null},{"id":"W2001106000","doi":"10.1109/iwcmc.2013.6583592","title":"Reliable and energy efficient cooperative relaying scheme (REECR) in wireless sensor networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Medical Research Council","keywords":"Retransmission; Computer network; Computer science; Network packet; Fading; Relay; Wireless sensor network; Automatic repeat request; Energy consumption; Cooperative diversity; Node (physics); Hybrid automatic repeat request; Transmission (telecommunications); Efficient energy use; Transmitter; Reliability (semiconductor); Power control; Channel (broadcasting); Power (physics); Engineering; Telecommunications; Telecommunications link; Electrical engineering","score_opus":0.017267058073853588,"score_gpt":0.23280593712930567,"score_spread":0.21553887905545208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001106000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2166471,0.00119159,0.75916123,0.0025690717,0.00019894612,0.00023488305,1.612092e-7,0.00021873518,0.019778298],"genre_scores_gemma":[0.976656,0.0010427686,0.01924084,0.001078677,0.000026005355,0.000055930766,0.0000017449461,0.000009294337,0.0018886998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988324,0.00011268974,0.00026242837,0.0003624856,0.00012373892,0.00030625318],"domain_scores_gemma":[0.9990024,0.00014464525,0.000051796105,0.00053027464,0.00016517937,0.00010571509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025520267,0.00014998774,0.00018148258,0.00009870165,0.00022029417,0.00024802386,0.00047469258,0.00006696047,0.000078967874],"category_scores_gemma":[0.0000209422,0.00012848315,0.000022375827,0.00063025986,0.000059868977,0.00031406333,0.00059678016,0.0002068462,0.00002725799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008128421,0.00017681574,0.005226126,0.0000078481735,0.00002459731,0.000011388532,0.0012646797,0.049481977,0.005018114,0.83337307,0.004847479,0.1005598],"study_design_scores_gemma":[0.0002980242,0.000026078214,0.0017064121,0.000043022417,7.5294474e-7,0.0000056323047,0.000072269344,0.9955778,0.0004267819,0.0000468613,0.0016136752,0.00018266725],"about_ca_topic_score_codex":0.00012961378,"about_ca_topic_score_gemma":0.00010210274,"teacher_disagreement_score":0.9460958,"about_ca_system_score_codex":0.000049905077,"about_ca_system_score_gemma":0.00003227076,"threshold_uncertainty_score":0.52393913},"labels":[],"label_agreement":null},{"id":"W2001178040","doi":"10.1109/tcomm.2013.020413.120457","title":"Delay-Optimal Distributed Scheduling in Multi-User Multi-Relay Cellular Wireless Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; University of Manitoba","funders":"","keywords":"Computer science; Relay; Scheduling (production processes); Computer network; Time division multiple access; RSS; Base station; Telecommunications link; Wireless; Transmission (telecommunications); Markov process; Wireless network; Real-time computing; Distributed computing; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.054840833267975446,"score_gpt":0.2892029471408835,"score_spread":0.23436211387290806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001178040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010742304,0.00076134386,0.98468053,0.0024516408,0.0002624588,0.0006319358,0.000011510719,0.0003401176,0.00011815328],"genre_scores_gemma":[0.8254053,0.0020927254,0.17135605,0.00026427695,0.000010663444,0.00046091832,0.0000287727,0.000026673131,0.00035463343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766016,0.00059840904,0.00062930305,0.00044468787,0.0001974953,0.00046996036],"domain_scores_gemma":[0.99514633,0.000507186,0.00014578948,0.003707722,0.0003041568,0.00018881363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038198434,0.00029741222,0.0002896255,0.00028595488,0.0010009566,0.00030161763,0.0034713112,0.00018096885,0.00008348675],"category_scores_gemma":[0.000014412118,0.00031721103,0.00015338603,0.0013997642,0.00020028616,0.0008442242,0.000088049164,0.0011886361,0.00023947787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007083882,0.0017025517,0.00021292739,0.000006217386,0.00007160063,0.0000029342189,0.0011549811,0.947853,0.0023403284,0.004812858,0.0001515485,0.041683957],"study_design_scores_gemma":[0.00091065076,0.00003136496,0.00088287913,0.000083701736,0.000012331621,0.000004819645,0.00011520448,0.99519044,0.000914644,0.000013253607,0.0014992972,0.00034140775],"about_ca_topic_score_codex":0.00014132127,"about_ca_topic_score_gemma":0.0009773945,"teacher_disagreement_score":0.814663,"about_ca_system_score_codex":0.0001973106,"about_ca_system_score_gemma":0.00008754737,"threshold_uncertainty_score":0.999928},"labels":[],"label_agreement":null},{"id":"W2001235822","doi":"10.1109/icc.2014.6884234","title":"Relay assignment in multiple source-destination cooperative networks with limited feedback","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Cooperative diversity; Channel state information; Rayleigh fading; Computer science; Signal-to-noise ratio (imaging); Quantization (signal processing); Diversity gain; Selection (genetic algorithm); Channel (broadcasting); Algorithm; Computer network; Fading; Telecommunications; Wireless; Artificial intelligence","score_opus":0.025860552075182543,"score_gpt":0.2338592712943177,"score_spread":0.20799871921913515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001235822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101486305,0.000056962675,0.9795474,0.0013817804,0.00005729725,0.00023288449,7.4197146e-8,0.00016772104,0.008407292],"genre_scores_gemma":[0.971122,0.00006799508,0.02691908,0.0007840149,0.000032123695,0.00004003783,0.0000057168854,0.000010138711,0.0010188395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986785,0.000368693,0.0002250928,0.00031826156,0.00017615594,0.0002333111],"domain_scores_gemma":[0.9986802,0.00045276398,0.00007577018,0.0005541386,0.00016077136,0.00007636248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005054183,0.00014546128,0.00015220768,0.00009865807,0.00019957061,0.00016691598,0.00056174735,0.000051875882,0.000030833387],"category_scores_gemma":[0.00011942554,0.000112075264,0.00002016378,0.00073194044,0.00005012125,0.00033773264,0.00024469648,0.00022666772,0.000031220872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028253467,0.00018354006,0.013414795,0.0000029822008,0.000015312286,0.0000020416164,0.0012227814,0.77125406,0.00031707235,0.058659896,0.0010498974,0.15384935],"study_design_scores_gemma":[0.0008312362,0.00014663502,0.010691496,0.000048494614,0.0000015986333,0.0000033406252,0.00003784716,0.9832136,0.00026060734,0.000025512998,0.0045591933,0.00018042917],"about_ca_topic_score_codex":0.000015041324,"about_ca_topic_score_gemma":0.0005480331,"teacher_disagreement_score":0.96097344,"about_ca_system_score_codex":0.0000867057,"about_ca_system_score_gemma":0.00002982259,"threshold_uncertainty_score":0.45702964},"labels":[],"label_agreement":null},{"id":"W2001408002","doi":"10.1109/allerton.2012.6483450","title":"Performance loss minimization in cooperative networks based on quantized channel feedback","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantization (signal processing); Channel state information; Computer science; Telecommunications link; Relay; Channel (broadcasting); Node (physics); Wireless network; Transmission (telecommunications); Computer network; Wireless; Algorithm; Telecommunications; Engineering","score_opus":0.039036578764164845,"score_gpt":0.26996582316683626,"score_spread":0.23092924440267143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001408002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03803236,0.0002330134,0.9414405,0.0016528564,0.00045117427,0.00033468625,3.689542e-7,0.00016483082,0.017690184],"genre_scores_gemma":[0.9937586,0.00035768747,0.0037390715,0.0017015188,0.00007081163,0.000033705634,0.000009292276,0.000008617453,0.00032064965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882805,0.00023139447,0.00023388222,0.00021379703,0.00015275508,0.00034010067],"domain_scores_gemma":[0.9990327,0.0001793039,0.000061008865,0.00052905484,0.00010680129,0.00009112857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045797802,0.00014749043,0.00015749253,0.00013184256,0.00017094189,0.00008213187,0.0005524865,0.00006030415,0.00008111692],"category_scores_gemma":[0.00003975605,0.00012636567,0.000030308616,0.0008511731,0.000035950303,0.00065573654,0.00015153903,0.0001845664,0.000072159004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009511068,0.0006027735,0.028033253,0.000011616872,0.000011716188,0.0000017962892,0.0015720892,0.870553,0.00006764057,0.06309887,0.0024562625,0.033495825],"study_design_scores_gemma":[0.00066538097,0.000061215615,0.02021819,0.000046740875,0.0000010407078,0.0000010060533,0.000016789338,0.9777611,0.00031578942,0.0000038776257,0.0007383889,0.0001704661],"about_ca_topic_score_codex":0.0000029554271,"about_ca_topic_score_gemma":0.000023992538,"teacher_disagreement_score":0.95572627,"about_ca_system_score_codex":0.0000635781,"about_ca_system_score_gemma":0.000037080168,"threshold_uncertainty_score":0.51530427},"labels":[],"label_agreement":null},{"id":"W2001552039","doi":"10.1109/pimrc.2013.6666276","title":"Multiuser Two-way relaying with power control for SC-FDE systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Beamforming; Node (physics); SC-FDE; Minimum mean square error; Transmitter power output; Relay channel; Interference (communication); Signal-to-noise ratio (imaging); Power (physics); Electronic engineering; Computer network; Equalization (audio); Algorithm; Telecommunications; Decoding methods; Engineering; Transmitter; Mathematics; Channel (broadcasting); Estimator","score_opus":0.025548484613691417,"score_gpt":0.25930099450824107,"score_spread":0.23375250989454965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001552039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060942564,0.00032612795,0.9806546,0.001845283,0.0001962061,0.0008218744,5.4447116e-7,0.00020249495,0.009858588],"genre_scores_gemma":[0.96331376,0.00001565776,0.033023503,0.00097499904,0.000033037253,0.00016699338,9.071061e-7,0.000010251993,0.0024609198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991355,0.00008569163,0.00018366615,0.00023726959,0.00012455843,0.00023329788],"domain_scores_gemma":[0.9985568,0.0003022655,0.00006535327,0.0006744301,0.00031709962,0.000084037594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025817094,0.000114335126,0.0001498687,0.000049915645,0.00023295385,0.0003614897,0.0006627109,0.000028237215,0.00006282082],"category_scores_gemma":[0.000032518972,0.000078080135,0.000036215908,0.0001785727,0.000026466983,0.0005391713,0.000118713106,0.00009071155,0.00012560484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036292688,0.00017100447,0.004449215,0.000025486366,0.0001645048,0.0000031836958,0.0024133404,0.0071701733,0.006878473,0.9097248,0.028126879,0.040836666],"study_design_scores_gemma":[0.0021000647,0.00012191478,0.0015447685,0.000058472426,0.0000052870196,0.000009083586,0.000115789495,0.97764504,0.00021154384,0.00011234615,0.017815478,0.00026022142],"about_ca_topic_score_codex":0.000037116657,"about_ca_topic_score_gemma":0.000027838785,"teacher_disagreement_score":0.97047484,"about_ca_system_score_codex":0.000030326946,"about_ca_system_score_gemma":0.000027183607,"threshold_uncertainty_score":0.34858537},"labels":[],"label_agreement":null},{"id":"W2001769497","doi":"10.1145/1362542.1362545","title":"Partial network coding","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Ministry of Science and Technology of the People's Republic of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Wireless sensor network; Linear network coding; Data collection; Computer network; Overhead (engineering); Distributed computing; Coding (social sciences); Distributed data store; Real-time computing; Network packet; Operating system","score_opus":0.05596031599055203,"score_gpt":0.27211063472563984,"score_spread":0.2161503187350878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001769497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020771255,0.0002918734,0.9927582,0.0016553348,0.00091478904,0.00018093418,9.3531247e-7,0.00046945276,0.0016513662],"genre_scores_gemma":[0.9482348,0.0037018948,0.045361802,0.0014910186,0.0003636929,0.000035522637,0.0000034163447,0.00002203498,0.00078585255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982597,0.0002356563,0.0003277904,0.00043067982,0.00023957732,0.000506552],"domain_scores_gemma":[0.9975325,0.00045028393,0.00008272512,0.0016626896,0.00010367297,0.00016816045],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00024293762,0.00022194476,0.00023023368,0.00008483543,0.0013104669,0.000096273674,0.001275336,0.00011694613,0.00013766652],"category_scores_gemma":[0.000023663242,0.00022180472,0.00014889693,0.0008879942,0.00010056463,0.00032669856,0.000051186278,0.0005531824,0.00012811259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043315336,0.00019070653,0.00032377272,0.0000030004906,0.000091904316,0.000056593235,0.000643803,0.75380635,0.00009074912,0.012077642,0.006863625,0.22580852],"study_design_scores_gemma":[0.0008401248,0.0001661863,0.0016665688,0.00007471507,0.000021395717,0.00019248067,0.00002782937,0.94556457,0.0004939912,0.00034945042,0.049960118,0.0006425824],"about_ca_topic_score_codex":0.0000035893022,"about_ca_topic_score_gemma":0.000013182316,"teacher_disagreement_score":0.9473964,"about_ca_system_score_codex":0.000055767494,"about_ca_system_score_gemma":0.000040489875,"threshold_uncertainty_score":0.9999897},"labels":[],"label_agreement":null},{"id":"W2001859535","doi":"10.1109/icassp.2013.6638610","title":"Semi-blind channel estimation for OFDM-based amplify-and-forward two-way relay networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Relay; Orthogonal frequency-division multiplexing; Benchmark (surveying); Computer science; Channel (broadcasting); Cramér–Rao bound; Algorithm; Estimation; Maximum likelihood; Base station; Estimation theory; Statistics; Telecommunications; Mathematics; Engineering; Power (physics)","score_opus":0.03865306906494422,"score_gpt":0.2903852112875245,"score_spread":0.2517321422225803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001859535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022312521,0.00021926385,0.99089766,0.003995967,0.00017589508,0.0006246865,6.6846746e-7,0.00020056783,0.0016540461],"genre_scores_gemma":[0.88390386,0.00009720784,0.11286147,0.0020169201,0.000074177326,0.0002544619,0.000022664306,0.000012385455,0.0007568633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895185,0.000083791034,0.00025747623,0.00031510578,0.000121402554,0.00027037642],"domain_scores_gemma":[0.99856806,0.0003886513,0.000091700196,0.00061728794,0.00021096034,0.00012336744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004036546,0.00015047369,0.00016180333,0.000088645065,0.0003211612,0.00032754787,0.0005669667,0.000072990784,0.000067200446],"category_scores_gemma":[0.000065211156,0.00012877163,0.00005195164,0.0003035021,0.000042432082,0.00052307005,0.00022408967,0.00015121595,0.000049221566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032200376,0.00012998091,0.00020449143,0.00002916551,0.000045461013,5.856703e-7,0.00064577133,0.24964575,0.00036947845,0.22837342,0.028467467,0.49205622],"study_design_scores_gemma":[0.00092923903,0.000057979127,0.00036006607,0.000024458082,0.0000046745095,0.0000017522055,0.0000089581645,0.99442667,0.00022611686,0.0012912727,0.002491406,0.0001774373],"about_ca_topic_score_codex":0.000019073312,"about_ca_topic_score_gemma":0.000033204353,"teacher_disagreement_score":0.8816726,"about_ca_system_score_codex":0.000032614844,"about_ca_system_score_gemma":0.000033039913,"threshold_uncertainty_score":0.52511543},"labels":[],"label_agreement":null},{"id":"W2002414590","doi":"10.1109/glocom.2012.6503858","title":"Sum rate of two-way MIMO AF relay networks with transmit/receive zero-forcing","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; MIMO; Relay; Uncorrelated; Fading; Zero (linguistics); Monte Carlo method; Mathematics; Control theory (sociology); Topology (electrical circuits); Applied mathematics; Computer science; Algorithm; Combinatorics; Statistics; Physics; Beamforming; Decoding methods","score_opus":0.02968955395664764,"score_gpt":0.26155081479877706,"score_spread":0.23186126084212944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002414590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017489098,0.001138558,0.9642235,0.0008938087,0.00020212086,0.00016893222,3.5601343e-7,0.00012017604,0.015763473],"genre_scores_gemma":[0.96227694,0.0004089507,0.035784267,0.0005223918,0.00008023102,0.000012366565,0.0000024058356,0.000012399601,0.00090008037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987596,0.00023843594,0.0002718902,0.0002147014,0.00013004687,0.00038531062],"domain_scores_gemma":[0.9986202,0.00023408346,0.00011197752,0.0007483756,0.00014595123,0.0001394185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007107541,0.00016035994,0.00021561405,0.00007119627,0.00017752359,0.00006346115,0.0007840965,0.000046683024,0.000077553654],"category_scores_gemma":[0.000012136846,0.000119163364,0.00005901875,0.0005898558,0.00007184913,0.00067834207,0.00018044731,0.00022691354,0.000018778026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102296166,0.00033504947,0.029794209,0.000037047314,0.00022327893,0.0000056637423,0.010511047,0.06312744,0.004939403,0.58910334,0.0057375412,0.2960837],"study_design_scores_gemma":[0.0028181477,0.00033774722,0.02062325,0.00032113696,0.00005122988,0.00003427957,0.00015715614,0.93786985,0.016875742,0.0004979927,0.019397862,0.0010155903],"about_ca_topic_score_codex":0.000023727174,"about_ca_topic_score_gemma":0.00010412954,"teacher_disagreement_score":0.9447878,"about_ca_system_score_codex":0.000027878363,"about_ca_system_score_gemma":0.000032053285,"threshold_uncertainty_score":0.48593408},"labels":[],"label_agreement":null},{"id":"W2002474980","doi":"10.1109/glocom.2012.6503859","title":"Multi-way MIMO amplify-and-forward relay networks with zero-forcing","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Relay; Transmission (telecommunications); Computer science; Multiplexing; Signal-to-noise ratio (imaging); Topology (electrical circuits); Channel (broadcasting); Upper and lower bounds; Outage probability; Control theory (sociology); Electronic engineering; Telecommunications; Mathematics; Fading; Engineering; Physics; Power (physics)","score_opus":0.04035425495653385,"score_gpt":0.27035210178743274,"score_spread":0.22999784683089888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002474980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054576495,0.0015448399,0.9871744,0.00053464057,0.00015739337,0.00013509407,1.5134202e-7,0.00020647357,0.0047893673],"genre_scores_gemma":[0.81885105,0.00045638293,0.17848106,0.0008519858,0.00005989849,0.000014427586,0.0000018547055,0.000010201421,0.0012731495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989785,0.00010384741,0.00017463161,0.00022827454,0.00012764029,0.0003871347],"domain_scores_gemma":[0.9988688,0.00014762895,0.000062217485,0.00066033035,0.000068167,0.00019282928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045761003,0.00014874985,0.00014991465,0.00005557454,0.0003137304,0.0001557382,0.0005408455,0.000059425416,0.000035137855],"category_scores_gemma":[0.000019100684,0.000107602915,0.000027498218,0.00032555216,0.000053709045,0.00068022776,0.00049134326,0.00024041646,0.00003693761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003782695,0.00036924556,0.091024496,0.00002413841,0.00016148954,0.000006620872,0.0074044545,0.011657744,0.0011480482,0.46151036,0.011232401,0.41542318],"study_design_scores_gemma":[0.0009069548,0.00008885541,0.028438143,0.00006875276,0.000013853098,0.00004904285,0.0000809274,0.91911334,0.0003246497,0.000037471134,0.05035032,0.00052768755],"about_ca_topic_score_codex":0.000009763985,"about_ca_topic_score_gemma":0.000043653374,"teacher_disagreement_score":0.9074556,"about_ca_system_score_codex":0.000027761707,"about_ca_system_score_gemma":0.000015172657,"threshold_uncertainty_score":0.43879196},"labels":[],"label_agreement":null},{"id":"W2002491494","doi":"10.1109/icspcs.2011.6140819","title":"Global Optimization Algorithm and sub-optimal algorithms for power allocation in two-way relay assisted cognitive radio networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristics; Computer science; Relay; Optimization problem; Mathematical optimization; Cognitive radio; Algorithm; Computational complexity theory; Convex optimization; Power (physics); Regular polygon; Mathematics; Wireless; Telecommunications","score_opus":0.04147790953455797,"score_gpt":0.2913436177375987,"score_spread":0.24986570820304074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002491494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016429173,0.00045662175,0.9943435,0.00017506495,0.00020031029,0.00050107355,0.0000036292874,0.00012634837,0.002550533],"genre_scores_gemma":[0.47369412,0.00036458572,0.5254506,0.0002618927,0.000031220963,0.000077986966,0.000032369317,0.000009317355,0.00007793825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986846,0.00017246522,0.00031644027,0.0004239153,0.00012378662,0.0002787933],"domain_scores_gemma":[0.9990194,0.00015146643,0.00010704735,0.00031578614,0.00030678284,0.000099532954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005014665,0.00017415397,0.00018462686,0.00009075688,0.00018008058,0.00012843694,0.0003839988,0.00007726507,0.0000322624],"category_scores_gemma":[0.000055011285,0.00017007734,0.00004334039,0.0006534294,0.000069167676,0.0005938562,0.00022945847,0.000115637646,0.000002773202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008587356,0.00033479667,0.0018230684,0.000005276964,0.00007179691,0.000007811373,0.0018812014,0.045160387,0.000015625466,0.041481394,0.0005666202,0.9085662],"study_design_scores_gemma":[0.0012214088,0.00010845879,0.016023088,0.00003482269,0.000009112103,0.000017400902,0.00006636391,0.9820553,0.00008243368,0.00008218311,0.00007910887,0.00022031768],"about_ca_topic_score_codex":0.00003103819,"about_ca_topic_score_gemma":0.00011510291,"teacher_disagreement_score":0.9368949,"about_ca_system_score_codex":0.00009549275,"about_ca_system_score_gemma":0.00004844734,"threshold_uncertainty_score":0.69355524},"labels":[],"label_agreement":null},{"id":"W2003437631","doi":"10.1109/tpds.2014.2308201","title":"Cooperative Coverage Extension for Relay-Union Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Relay; Computer network; Bandwidth (computing); Distributed computing; Quality of service; Bandwidth allocation; Heuristic; Dynamic bandwidth allocation; The Internet","score_opus":0.0279010927372669,"score_gpt":0.25711513339742925,"score_spread":0.22921404066016235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003437631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008919959,0.00045559378,0.99629986,0.0007188108,0.0007456203,0.00050527183,0.000040572646,0.00016510725,0.00017716257],"genre_scores_gemma":[0.9970212,0.0007899948,0.0012622616,0.00020249744,0.000058883696,0.00017740733,0.000044013,0.000011062507,0.0004327015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860483,0.00035655277,0.0002719377,0.0003867905,0.00013470494,0.0002452082],"domain_scores_gemma":[0.9986296,0.00038543486,0.0000910779,0.00054442935,0.00021525155,0.00013418529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048843253,0.00019036133,0.00025674552,0.00006578997,0.0007042608,0.00023727804,0.0003062475,0.00010954092,0.0000037498105],"category_scores_gemma":[0.0000144137475,0.00016585851,0.00007514948,0.00028750146,0.000046301204,0.0002669429,0.000006544033,0.00019999623,0.000010127011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036209396,0.00008064541,0.0000060800785,0.000012791641,0.000026776388,7.013283e-7,0.00009849851,0.96317875,0.00018360918,0.014601119,0.0018757876,0.01989901],"study_design_scores_gemma":[0.00092238764,0.00022911945,0.00011548486,0.00007163774,0.000011905688,0.000014675094,0.00002693028,0.9780272,0.000045725286,0.00006088915,0.020261774,0.00021222008],"about_ca_topic_score_codex":0.0000093014605,"about_ca_topic_score_gemma":0.000018325929,"teacher_disagreement_score":0.99612916,"about_ca_system_score_codex":0.000046132798,"about_ca_system_score_gemma":0.000023059622,"threshold_uncertainty_score":0.67635137},"labels":[],"label_agreement":null},{"id":"W2004261678","doi":"10.1109/acssc.2011.6190209","title":"Joint power control and relay design in underlay cognitive networks with multiple transmitter-receiver pairs","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université du Québec","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar Foundation","keywords":"Underlay; Transmitter; Relay; Computer science; Transmitter power output; Hop (telecommunications); Interference (communication); Channel (broadcasting); Cognitive radio; Computer network; Power control; Joint (building); Control channel; Co-channel interference; Signal-to-noise ratio (imaging); Power (physics); Telecommunications; Electronic engineering; Telecommunications link; Wireless; Engineering; Physics","score_opus":0.052856192051831605,"score_gpt":0.22943233549367248,"score_spread":0.17657614344184086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004261678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011706758,0.00033743004,0.9832276,0.000416248,0.00003926095,0.0003829808,3.6441878e-7,0.00008938031,0.0037999614],"genre_scores_gemma":[0.96764594,0.00017274807,0.030809876,0.0012244954,0.0000063824696,0.000019027233,5.5017307e-7,0.000009145004,0.00011185542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988163,0.0003540015,0.00019275505,0.0003029809,0.0000968034,0.00023711927],"domain_scores_gemma":[0.99907357,0.00040918513,0.00004884947,0.00028532255,0.00009637545,0.000086708074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042755602,0.00014770239,0.0001803056,0.00008181486,0.00010887812,0.000062342384,0.00028242558,0.00005383552,0.000081032056],"category_scores_gemma":[0.000023282213,0.00011022599,0.000025518975,0.00027811556,0.00009548185,0.00033016928,0.00007237854,0.00020904369,0.000008503281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027055352,0.0026960517,0.215575,0.00004158574,0.0008969424,0.0004644171,0.18651183,0.019547114,0.0016272445,0.090316266,0.0043192003,0.4752988],"study_design_scores_gemma":[0.004411122,0.00047171974,0.18775971,0.00013923411,0.000013371558,0.00002121165,0.0005297391,0.80560035,0.00033544356,0.00017659823,0.00012596857,0.00041554702],"about_ca_topic_score_codex":0.000024142135,"about_ca_topic_score_gemma":0.00029068466,"teacher_disagreement_score":0.9559392,"about_ca_system_score_codex":0.000021028558,"about_ca_system_score_gemma":0.000029546944,"threshold_uncertainty_score":0.44948855},"labels":[],"label_agreement":null},{"id":"W2004310226","doi":"10.1109/icc.2012.6363736","title":"Decoding techniques for coded full-rate cooperative systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Detector; Decoding methods; Computer science; Bit error rate; Interference (communication); Algorithm; Maximum a posteriori estimation; Reliability (semiconductor); Real-time computing; Electronic engineering; Channel (broadcasting); Telecommunications; Mathematics; Maximum likelihood; Engineering; Statistics; Physics","score_opus":0.06575605713487163,"score_gpt":0.31942562882070874,"score_spread":0.2536695716858371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004310226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010230589,0.00090364943,0.98499554,0.0006486135,0.00035378055,0.00050769164,0.0000015163015,0.00041603015,0.011150094],"genre_scores_gemma":[0.8975714,0.00025115992,0.09949818,0.000590912,0.0001628357,0.00025632806,0.000004790198,0.000010343732,0.0016540575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990356,0.00017134185,0.00022050619,0.00018189508,0.000082092825,0.0003085544],"domain_scores_gemma":[0.99876314,0.00030529813,0.00006735546,0.0005037831,0.0002554995,0.000104923914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090334076,0.00012381218,0.00015836292,0.00006858943,0.00032497957,0.00023518107,0.0006523415,0.000046387973,0.00002063267],"category_scores_gemma":[0.000080693644,0.000101258935,0.000043822703,0.00027553126,0.000026477634,0.00075098034,0.00026128648,0.00008542539,0.000034182438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062518216,0.00005008009,0.00012668237,0.000010275089,0.000019120322,1.7639766e-7,0.00078000483,0.0000380968,0.013616123,0.94869137,0.009369585,0.027292266],"study_design_scores_gemma":[0.0005236537,0.00020767735,0.00019128372,0.00010068383,0.000011509959,0.000022947488,0.00023747733,0.65835446,0.05958126,0.0002878913,0.27982935,0.0006518088],"about_ca_topic_score_codex":0.0000026156604,"about_ca_topic_score_gemma":0.000009482682,"teacher_disagreement_score":0.9484034,"about_ca_system_score_codex":0.000054401098,"about_ca_system_score_gemma":0.000032657244,"threshold_uncertainty_score":0.41292194},"labels":[],"label_agreement":null},{"id":"W2004496619","doi":"10.1109/icc.2010.5502041","title":"Bandwidth-Efficient Bit-Interleaved Coded Modulation over NAF Relay Channels: Error Performance and Precoder Design","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relay; Coding gain; Upper and lower bounds; Precoding; Algorithm; Phase-shift keying; Bandwidth (computing); Bit error rate; Expression (computer science); Modulation (music); Channel (broadcasting); Electronic engineering; Decoding methods; MIMO; Mathematics; Telecommunications; Engineering; Physics","score_opus":0.043205253436949795,"score_gpt":0.2703127813700613,"score_spread":0.2271075279331115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004496619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39587277,0.00005670811,0.6012744,0.00056337746,0.0004249926,0.00022886341,2.4590625e-7,0.00013838631,0.0014402892],"genre_scores_gemma":[0.95426214,0.0000979477,0.043821,0.0003079245,0.000048491816,0.000027004946,0.0000019638003,0.00000960535,0.0014239238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989232,0.00011536755,0.00022684959,0.00034229166,0.00016984531,0.00022246812],"domain_scores_gemma":[0.9989201,0.00013261805,0.00007545507,0.00064550963,0.00012973876,0.000096607786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005518275,0.00014839381,0.00013407592,0.00010266328,0.0002953032,0.00021346685,0.00052603736,0.0000726486,0.000159834],"category_scores_gemma":[0.000043749704,0.00012348118,0.000030734987,0.00027627187,0.00005782564,0.00039018536,0.00032763035,0.0002581077,0.000035904537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014226166,0.00056982273,0.0049692676,0.000058977585,0.00009447997,0.0000047161643,0.013977596,0.15378894,0.08263984,0.06711492,0.01004449,0.6665947],"study_design_scores_gemma":[0.00036953937,0.000059957503,0.0074173715,0.000022739046,0.0000025041397,0.0000077708655,0.000008991532,0.9860358,0.003383066,0.00009119641,0.002423463,0.00017759773],"about_ca_topic_score_codex":0.000003633923,"about_ca_topic_score_gemma":0.000030693533,"teacher_disagreement_score":0.83224684,"about_ca_system_score_codex":0.0000217584,"about_ca_system_score_gemma":0.000032716882,"threshold_uncertainty_score":0.50354165},"labels":[],"label_agreement":null},{"id":"W2004785456","doi":"10.1109/twc.2013.091213.130652","title":"Corrections to \"Achievable Rate Region under Joint Distributed Beamforming and Power Allocation for Two-Way Relay Networks\" [Nov 12 4026-4037]","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Beamforming; Computer science; Joint (building); Novelty; Wireless; Computer network; Power (physics); Telecommunications; Engineering","score_opus":0.047245263849709195,"score_gpt":0.27494823484063957,"score_spread":0.22770297099093037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004785456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008066451,0.00020460023,0.9743612,0.0145793175,0.00050468394,0.001477674,0.000016079694,0.00038775263,0.00040226537],"genre_scores_gemma":[0.9681174,0.0013254749,0.02699804,0.0012051744,0.000027692393,0.0015257231,0.000055622175,0.000041190007,0.00070367433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778926,0.00042674446,0.0006195312,0.0005312459,0.0001749576,0.00045824694],"domain_scores_gemma":[0.9951358,0.0008495247,0.00020427855,0.0029949192,0.00053720933,0.00027828143],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005070607,0.0003200092,0.00032290994,0.00031703568,0.0024087795,0.00044510572,0.0014855403,0.00013243862,0.000026648453],"category_scores_gemma":[0.000028925917,0.00033594924,0.00014686196,0.0010642225,0.00017636061,0.0009744758,0.000081260485,0.00057993777,0.000055627013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000764516,0.0014977239,0.000060549064,0.00003035697,0.00031867184,7.2101693e-7,0.0047579226,0.67021513,0.012771457,0.09460814,0.0062640104,0.2093989],"study_design_scores_gemma":[0.0010124155,0.00023361036,0.0009907483,0.000183252,0.000051140414,0.000019572908,0.00038844981,0.9857809,0.0022159,0.00056216907,0.007950443,0.0006113799],"about_ca_topic_score_codex":0.0001544831,"about_ca_topic_score_gemma":0.0010353375,"teacher_disagreement_score":0.96005094,"about_ca_system_score_codex":0.00025747312,"about_ca_system_score_gemma":0.00008703531,"threshold_uncertainty_score":0.9999093},"labels":[],"label_agreement":null},{"id":"W2005089581","doi":"10.1109/tvt.2013.2243178","title":"Low-Complexity Timing Synchronization for Decode-and-Forward Cooperative Communication Systems With Multiple Relays","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Estimator; Relay; Synchronization (alternating current); Fading; Computer science; Computational complexity theory; Algorithm; Channel (broadcasting); Real-time computing; Mathematics; Telecommunications; Decoding methods; Statistics","score_opus":0.027287964079231033,"score_gpt":0.2517749090052838,"score_spread":0.22448694492605278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005089581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027639015,0.00037447235,0.9673187,0.002636928,0.000093293915,0.0014151408,0.0000052116216,0.0004551951,0.00006200654],"genre_scores_gemma":[0.9472729,0.0004331621,0.050773222,0.00013036773,0.0000072920316,0.0012702231,0.0000093832205,0.000020080277,0.00008334315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880534,0.00014265486,0.00028662468,0.00038680702,0.00012600115,0.00025256543],"domain_scores_gemma":[0.9980786,0.00023242508,0.00011965454,0.0010197185,0.00048616205,0.00006346272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019351418,0.00019724268,0.00023988563,0.00029354022,0.00083447224,0.00017232189,0.00069646974,0.00018247504,0.000011566092],"category_scores_gemma":[0.000022933618,0.00017523434,0.000042329797,0.00070899446,0.00024635624,0.0004847319,0.000018606366,0.00034777698,0.000030309251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082492516,0.0008801233,0.0003504172,0.0001594837,0.00038360895,0.0000047502926,0.0020823437,0.33833045,0.011964339,0.18742642,0.00054318196,0.4577924],"study_design_scores_gemma":[0.0008133317,0.00025196455,0.00007933469,0.00013525748,0.000020135201,0.00003302136,0.00016982776,0.9856019,0.011428065,0.00046381372,0.00074916816,0.00025420674],"about_ca_topic_score_codex":0.000026921978,"about_ca_topic_score_gemma":0.00016553716,"teacher_disagreement_score":0.9196339,"about_ca_system_score_codex":0.00011645437,"about_ca_system_score_gemma":0.00005082044,"threshold_uncertainty_score":0.7145849},"labels":[],"label_agreement":null},{"id":"W2005136859","doi":"10.1109/mascots.2012.54","title":"A Measurement Study of Network Coding in Peer-to-Peer Video-on-Demand Systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Linear network coding; Coding (social sciences); Video on demand; Live streaming; Peer-to-peer; Video streaming; Computer network; Multimedia; On demand; Network packet","score_opus":0.10426139459272889,"score_gpt":0.3126130877817105,"score_spread":0.2083516931889816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005136859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35155725,0.002820997,0.59969324,0.0044749235,0.0025607198,0.0028631866,6.172347e-7,0.00027211118,0.035756968],"genre_scores_gemma":[0.9980058,0.000018429273,0.0011689109,0.00024382026,0.00010812702,0.00006001744,2.287237e-7,0.000006438886,0.00038823485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99785656,0.00037890946,0.0003749248,0.00021012282,0.00085607823,0.0003234048],"domain_scores_gemma":[0.99847376,0.000115735755,0.00007901828,0.0007510422,0.00045985443,0.00012055848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004006765,0.00012224879,0.00022844133,0.00012373814,0.00011298667,0.00008792578,0.00074865913,0.000027714297,0.000011205147],"category_scores_gemma":[0.00015614665,0.000102013604,0.00002651873,0.0007221427,0.000009087553,0.0002270687,0.00041958858,0.00013196099,0.000033601005],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009645399,0.004827665,0.2911672,0.000077138546,0.00022953757,0.000007769898,0.05866146,0.10766491,0.0019735794,0.41423303,0.083901644,0.03715962],"study_design_scores_gemma":[0.007505499,0.0028210122,0.44498846,0.0020133124,0.000054005435,0.000017400425,0.0075583835,0.4219781,0.0013998266,0.00024446036,0.109229825,0.0021897145],"about_ca_topic_score_codex":0.00003449958,"about_ca_topic_score_gemma":0.00017446929,"teacher_disagreement_score":0.64644855,"about_ca_system_score_codex":0.00010857022,"about_ca_system_score_gemma":0.000025210125,"threshold_uncertainty_score":0.4159994},"labels":[],"label_agreement":null},{"id":"W2005686751","doi":"10.1109/lwc.2014.2357032","title":"Joint Cooperative Routing and Power Allocation for Collision Minimization in Wireless Sensor Networks With Multiple Flows","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Collision; Routing (electronic design automation); Computer network; Mathematical optimization; Dynamic Source Routing; Static routing; Link-state routing protocol; Minification; Time constraint; Constraint (computer-aided design); Equal-cost multi-path routing; Routing protocol; Distributed computing; Engineering; Mathematics","score_opus":0.027816884016450803,"score_gpt":0.25285235047095966,"score_spread":0.22503546645450886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005686751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26538435,0.00009120058,0.72553,0.008024436,0.00009233001,0.00068821135,0.0000025071836,0.0001040157,0.00008292759],"genre_scores_gemma":[0.92385507,0.0005005111,0.073653325,0.0015500239,0.000033126493,0.0003034043,0.000058894937,0.000028729748,0.000016919163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978386,0.0006838212,0.00051199226,0.0004589474,0.00017797,0.0003286263],"domain_scores_gemma":[0.9963742,0.0010696248,0.0002488974,0.0018723862,0.0003424878,0.00009241241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074191584,0.00025271272,0.0003233015,0.00020359932,0.00073601655,0.00028210302,0.0011950606,0.00009415552,0.0000012479289],"category_scores_gemma":[0.00010077049,0.00024121124,0.000045014553,0.0007499864,0.00017732503,0.0005698891,0.00036983812,0.00032255324,0.0000027398692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002316678,0.0008964322,0.013399526,0.00008003264,0.00018018945,0.0000029881014,0.016778097,0.59810656,0.12725252,0.11150903,0.0019703377,0.12959263],"study_design_scores_gemma":[0.0012398066,0.00007535945,0.003259537,0.00019011403,0.000008616412,0.000005860212,0.00014062846,0.9925829,0.0012393373,0.000010509316,0.0009294788,0.00031785254],"about_ca_topic_score_codex":0.000029225737,"about_ca_topic_score_gemma":0.0007664673,"teacher_disagreement_score":0.65847075,"about_ca_system_score_codex":0.00012808887,"about_ca_system_score_gemma":0.000049981874,"threshold_uncertainty_score":0.9836309},"labels":[],"label_agreement":null},{"id":"W2005713623","doi":"10.1109/tit.2013.2284914","title":"A Unified Relay Framework With Both D-F and C-F Relay Nodes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Relay channel; Decoding methods; Node (physics); Upstream (networking); Computer science; Computer network; Link Access Procedure for Frame Relay; Downstream (manufacturing); Topology (electrical circuits); Cover (algebra); Mathematics; Telecommunications; Combinatorics; Engineering; Physics; Power (physics)","score_opus":0.011658895052271386,"score_gpt":0.22406793583766005,"score_spread":0.21240904078538866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005713623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066006146,0.000045774086,0.9870042,0.00091895385,0.00014395609,0.0002452814,0.0000016943178,0.00021896769,0.004820566],"genre_scores_gemma":[0.9609341,0.0002861046,0.036697224,0.0015715306,0.000008853499,0.0000963869,0.0000015397834,0.000006429694,0.0003978203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918085,0.0001410621,0.00023963326,0.00012024246,0.00016335958,0.00015486097],"domain_scores_gemma":[0.9988016,0.00034210715,0.00009093185,0.00054979563,0.00012972833,0.000085847576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003053004,0.00013001429,0.00010537779,0.00017609973,0.00041850348,0.00030291927,0.000360261,0.00007501783,0.00017080517],"category_scores_gemma":[0.000011972908,0.00010318125,0.000030173029,0.00039672302,0.000086123386,0.0025042882,0.0000058206506,0.00033031488,0.0002677626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058524132,0.00006885247,0.000015640258,0.000019321616,0.000056100966,4.6296998e-7,0.009656335,0.016005058,0.00009409226,0.5277018,0.00039945022,0.44592434],"study_design_scores_gemma":[0.005870376,0.0015755128,0.0070263147,0.0012641446,0.000115169496,0.00023185642,0.005156796,0.8370654,0.01612034,0.08136109,0.041223552,0.0029894428],"about_ca_topic_score_codex":0.00000466563,"about_ca_topic_score_gemma":0.0000033870201,"teacher_disagreement_score":0.9543335,"about_ca_system_score_codex":0.000034848897,"about_ca_system_score_gemma":0.000039342147,"threshold_uncertainty_score":0.42076093},"labels":[],"label_agreement":null},{"id":"W2005972201","doi":"10.1109/wcnc.2014.6952331","title":"Joint resource optimization for OFDMA cellular networks with user cooperation and QoS provisioning","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Resource allocation; Orthogonal frequency-division multiple access; Optimization problem; Subcarrier; Mathematical optimization; Quality of service; Relay; Throughput; Frequency-division multiple access; Computer network; Orthogonal frequency-division multiplexing; Wireless; Power (physics); Channel (broadcasting); Algorithm; Telecommunications; Mathematics","score_opus":0.018419908118359987,"score_gpt":0.2196777700973292,"score_spread":0.20125786197896922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005972201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019478144,0.00018225862,0.994802,0.0016584201,0.00004839066,0.00036316522,1.3394144e-7,0.000116808376,0.0008810258],"genre_scores_gemma":[0.6216908,0.00015373119,0.37591097,0.0011077459,0.0001370031,0.00008868058,0.000016797389,0.00001550217,0.0008787784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992419,0.00010888469,0.00016142274,0.0002574168,0.00008746428,0.00014294112],"domain_scores_gemma":[0.9992166,0.00010991223,0.00006689034,0.0003661014,0.00018226504,0.000058239035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004051797,0.0001003896,0.000111080895,0.00004821082,0.00036923643,0.00030028072,0.00022892686,0.000039759158,0.000016543305],"category_scores_gemma":[0.000041555933,0.00007585056,0.000016046199,0.00020993479,0.000027545011,0.00033250675,0.00016056065,0.00007614591,9.1543063e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013808097,0.000025714842,0.00016426377,0.000008966896,0.000010117315,1.5502233e-7,0.0003044002,0.8236567,0.0006317538,0.099388964,0.001809392,0.07398577],"study_design_scores_gemma":[0.00040316867,0.000117054195,0.0000675329,0.000041326435,0.000004499867,0.0000014112219,0.000010238544,0.98013717,0.00094376976,0.000014287069,0.01813546,0.00012405499],"about_ca_topic_score_codex":0.0000017474823,"about_ca_topic_score_gemma":0.0000119465185,"teacher_disagreement_score":0.619743,"about_ca_system_score_codex":0.00001394912,"about_ca_system_score_gemma":0.000017948405,"threshold_uncertainty_score":0.30930963},"labels":[],"label_agreement":null},{"id":"W2006002274","doi":"10.1002/ett.2620","title":"SNR‐dependent radius control sphere detection for MIMO systems and relay networks","year":2013,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Decoding methods; Algorithm; Heuristic; Computer science; Computational complexity theory; Spatial multiplexing; Channel (broadcasting); RADIUS; Range (aeronautics); Mathematics; Topology (electrical circuits); Mathematical optimization; Telecommunications; Engineering; Computer network","score_opus":0.019165273636171053,"score_gpt":0.2517599748176927,"score_spread":0.23259470118152165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006002274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019590496,0.004770359,0.98218113,0.007407726,0.0002474181,0.0011621237,0.0000039321258,0.0019604568,0.00030778802],"genre_scores_gemma":[0.9518874,0.007644693,0.03824811,0.000087146786,0.000009914202,0.0018369603,0.0000037717498,0.000021591131,0.0002603793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855006,0.00017999223,0.00042017552,0.00038152165,0.00012816738,0.00034005678],"domain_scores_gemma":[0.9966091,0.0007482603,0.00016196842,0.002178482,0.00025025068,0.000051945222],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003468561,0.00023082252,0.00025184933,0.00029300665,0.0013852041,0.0003286577,0.0016663291,0.00019676819,0.000016105017],"category_scores_gemma":[0.00008856155,0.00022573452,0.00008691499,0.0006855878,0.00016302003,0.0005643339,0.00007601249,0.0005814579,0.000022068221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000744363,0.00014552832,0.000028174776,0.000015061911,0.00010336381,2.1754778e-7,0.00020514346,0.057593644,0.0011828094,0.015400274,0.00031680157,0.92500156],"study_design_scores_gemma":[0.0007573815,0.00016111633,0.00020743224,0.00006621049,0.000031435575,0.000017258391,0.00083983183,0.9840451,0.0012900844,0.00084931985,0.011384694,0.00035013512],"about_ca_topic_score_codex":0.000052745814,"about_ca_topic_score_gemma":0.0001234161,"teacher_disagreement_score":0.9499284,"about_ca_system_score_codex":0.000121446115,"about_ca_system_score_gemma":0.000028360486,"threshold_uncertainty_score":0.9999149},"labels":[],"label_agreement":null},{"id":"W2006030374","doi":"10.1109/icspcs.2011.6140851","title":"Radio resources reuse and partitioning for OFDMA multi-hop relay cellular networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Reuse; Cellular network; Computer network; Radio resource management; Relay; Throughput; Power control; Wireless; Wireless network; Telecommunications; Power (physics); Engineering","score_opus":0.08110638489949806,"score_gpt":0.2614636648988774,"score_spread":0.18035727999937934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006030374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022985136,0.0025058365,0.97229135,0.0006780164,0.00012441537,0.000190263,3.8240628e-7,0.0001681094,0.00105649],"genre_scores_gemma":[0.7619085,0.0012165948,0.23499256,0.00042573886,0.00006114618,0.00006497003,0.000002011917,0.000009899216,0.0013185844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922776,0.00009239978,0.00017871756,0.0002488767,0.000060327,0.00019190156],"domain_scores_gemma":[0.9989196,0.00013251578,0.000061027884,0.0007154007,0.000088723194,0.00008273618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003607061,0.00009590578,0.00011104269,0.000045914865,0.00038465305,0.000115338844,0.0007314457,0.000048095702,0.000044991524],"category_scores_gemma":[0.00006660358,0.00008446627,0.0000372258,0.00017585911,0.000056617355,0.00027924785,0.00047493656,0.00010249022,0.0000047580156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109917426,0.0006132801,0.02646777,0.00006009481,0.00022649537,0.00001970138,0.06086111,0.0029681157,0.0068100104,0.55546,0.029176557,0.31722698],"study_design_scores_gemma":[0.0005503177,0.0000646636,0.0034676956,0.000042683667,0.00000829605,0.0000030938709,0.000077092474,0.9684232,0.001842433,0.00035236205,0.024959689,0.00020848772],"about_ca_topic_score_codex":0.000007865756,"about_ca_topic_score_gemma":0.000036517133,"teacher_disagreement_score":0.96545506,"about_ca_system_score_codex":0.000011304272,"about_ca_system_score_gemma":0.000009657852,"threshold_uncertainty_score":0.34444347},"labels":[],"label_agreement":null},{"id":"W2006332913","doi":"10.5555/1535571.1535582","title":"Cooperative protocols design for wireless ad-hoc networks with multi-hop routing","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Cooperative diversity; Wireless ad hoc network; Fading; Physical layer; Diversity gain; Distributed computing; MIMO; Wireless network; Wireless; Multi-user MIMO; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Routing protocol; Telecommunications; Routing (electronic design automation); Channel (broadcasting)","score_opus":0.12741902920161716,"score_gpt":0.32627945984306234,"score_spread":0.19886043064144518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006332913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004962431,0.00018849227,0.98742723,0.000406595,0.000038434802,0.010702403,4.502762e-7,0.00029177457,0.00044836567],"genre_scores_gemma":[0.3721295,0.0002840564,0.6124237,0.00084079296,0.000055715027,0.012358841,0.000003964588,0.000026829854,0.0018765932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985519,0.00023225382,0.0002733254,0.00041772416,0.00015510242,0.0003696691],"domain_scores_gemma":[0.9982247,0.00038639686,0.000109934124,0.0006888572,0.00048154112,0.000108585446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043029655,0.0002097437,0.00024169759,0.00005025966,0.00085660524,0.00016669632,0.0009720635,0.000061224775,0.000017206377],"category_scores_gemma":[0.000043356522,0.00015595721,0.000048465867,0.00052411016,0.000097869604,0.00047190255,0.00025628597,0.0001904572,0.000010771959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007824431,0.0014037058,0.0026659411,0.00004976253,0.00031702287,0.000067974666,0.018144486,0.22373997,0.0032970519,0.14308289,0.019349728,0.587099],"study_design_scores_gemma":[0.0014249106,0.00037410017,0.00026365145,0.00008038618,0.0000026104983,0.000021423812,0.000047331927,0.99021304,0.0016265322,0.000008900448,0.005647499,0.00028960846],"about_ca_topic_score_codex":0.0000010381289,"about_ca_topic_score_gemma":0.000040856474,"teacher_disagreement_score":0.76647305,"about_ca_system_score_codex":0.00005429449,"about_ca_system_score_gemma":0.00017048804,"threshold_uncertainty_score":0.6588402},"labels":[],"label_agreement":null},{"id":"W2006885019","doi":"10.1002/dac.1166","title":"Distributed BLAST with relay selection for multi‐antenna AF relaying","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Computer science; Transmission (telecommunications); Selection (genetic algorithm); Antenna (radio); Outage probability; Computer network; Multiplexing; Scheme (mathematics); Telecommunications; Electronic engineering; Fading; Mathematics; Channel (broadcasting); Engineering; Power (physics)","score_opus":0.04487768823135036,"score_gpt":0.32018601430935484,"score_spread":0.2753083260780045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006885019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028757636,0.000512934,0.96665436,0.0024983129,0.0011472765,0.00016044555,0.0000056114463,0.000045407374,0.00021804024],"genre_scores_gemma":[0.92584336,0.00038393834,0.07341193,0.00007944234,0.00014020066,0.000026565987,0.00001551685,0.000010636177,0.00008842787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998662,0.00018491645,0.00055430626,0.000116418145,0.00036604443,0.000116309435],"domain_scores_gemma":[0.99579966,0.00033960634,0.00077599357,0.00053589937,0.0024766636,0.00007216059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010537619,0.00010303335,0.00015478983,0.00019121266,0.00022669647,0.0003768376,0.0022715158,0.000063550586,0.00000655268],"category_scores_gemma":[0.0002398121,0.00008752888,0.00008251137,0.00025790642,0.000054871078,0.0007503308,0.00019718986,0.00043905183,0.0000053711583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000546467,0.00085386436,0.01639605,0.000021015621,0.0011638202,0.000011743872,0.004438944,0.031121632,0.06871171,0.82613796,0.007021217,0.043575592],"study_design_scores_gemma":[0.0019353145,0.00015778243,0.0030024885,0.00030906478,0.000018926788,0.00044790545,0.00021815678,0.8983424,0.001117968,0.00010499822,0.09412861,0.00021640908],"about_ca_topic_score_codex":0.0000101724845,"about_ca_topic_score_gemma":0.0000948933,"teacher_disagreement_score":0.8970857,"about_ca_system_score_codex":0.0000743113,"about_ca_system_score_gemma":0.00012648654,"threshold_uncertainty_score":0.42210793},"labels":[],"label_agreement":null},{"id":"W2006923457","doi":"10.1109/wcnc.2008.91","title":"Asymptotic BER Analysis of Threshold Digital Relaying Schemes in Cooperative Wireless Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bit error rate; Rayleigh fading; Relay; Computer science; Fading; Signal-to-noise ratio (imaging); Diversity combining; Wireless; Maximal-ratio combining; Electronic engineering; Channel (broadcasting); Algorithm; Computer network; Telecommunications; Engineering; Physics","score_opus":0.04266277040886956,"score_gpt":0.2664423065411698,"score_spread":0.22377953613230023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006923457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77162755,0.000753348,0.21417056,0.00016222718,0.00006907676,0.00015221104,0.0000016432691,0.000076268894,0.012987144],"genre_scores_gemma":[0.998291,0.00029971063,0.00064960663,0.000061914,0.000007702726,0.000011537387,0.0000057926914,0.0000045922397,0.0006681004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989463,0.00006992281,0.00036745044,0.00024996005,0.0002016124,0.0001647263],"domain_scores_gemma":[0.9989139,0.00016257656,0.00008641954,0.0005985945,0.00018958481,0.000048932397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018259477,0.00011216169,0.0003260147,0.00035190058,0.00012276908,0.00010499839,0.00065901555,0.000040346116,0.000018777691],"category_scores_gemma":[0.000032249813,0.0000952161,0.00007963013,0.0025597487,0.00007608321,0.0006395886,0.00031536244,0.00012748648,0.000010334393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013085999,0.0003897272,0.292538,0.000019421226,0.0008871141,0.000035828,0.0059838383,0.09272176,0.0018360609,0.59811944,0.0005567087,0.0068989918],"study_design_scores_gemma":[0.0002325509,0.000026120757,0.010912534,0.000039389437,0.00001856056,0.0000052931236,0.00012387836,0.9877889,0.00042436083,0.000010690181,0.00025540186,0.00016229725],"about_ca_topic_score_codex":0.000012332795,"about_ca_topic_score_gemma":0.00004924927,"teacher_disagreement_score":0.89506716,"about_ca_system_score_codex":0.000046888723,"about_ca_system_score_gemma":0.00005808461,"threshold_uncertainty_score":0.38827997},"labels":[],"label_agreement":null},{"id":"W2007082708","doi":"10.1002/ett.1168","title":"E‐model based comparison of multiple description coding and layered coding in packet networks","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Automatic repeat request; Network packet; Hybrid automatic repeat request; Packet loss; Go-Back-N ARQ; Computer science; Coding (social sciences); Selective Repeat ARQ; Computer network; Real-time computing; Algorithm; Mathematics; Statistics","score_opus":0.083164908306086,"score_gpt":0.3031603996088944,"score_spread":0.2199954913028084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007082708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010958809,0.00035025013,0.98405886,0.00058035745,0.000057724137,0.00022605486,0.000003828414,0.00013424513,0.0036298875],"genre_scores_gemma":[0.9168129,0.00077578373,0.08214766,0.0001684033,0.000007105395,0.000010484611,0.000012198604,0.000019154792,0.000046325986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981672,0.00054926396,0.000620965,0.0002647801,0.0001406722,0.00025711334],"domain_scores_gemma":[0.9975868,0.0007679346,0.00018756991,0.0012371582,0.00012471728,0.000095847325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013710313,0.00016225051,0.00022265152,0.00038418363,0.0005174691,0.000092050606,0.0009913346,0.00004966551,0.000010745811],"category_scores_gemma":[0.00005716563,0.00018256142,0.00006586369,0.0008256359,0.00010701763,0.00032775252,0.00005945196,0.0005373774,0.000006213178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006941901,0.0013847809,0.007065517,0.00002790834,0.00004314336,0.0000024258543,0.0052180146,0.5470431,0.010817184,0.01838637,0.00017411466,0.40976802],"study_design_scores_gemma":[0.0006322792,0.000053931253,0.017099276,0.00011200288,0.000007057685,0.0000016936596,0.00016086604,0.9798791,0.0014444992,0.000034095112,0.00039903895,0.00017619571],"about_ca_topic_score_codex":0.000010674226,"about_ca_topic_score_gemma":0.00086394924,"teacher_disagreement_score":0.90585405,"about_ca_system_score_codex":0.00008613304,"about_ca_system_score_gemma":0.000034705736,"threshold_uncertainty_score":0.74446386},"labels":[],"label_agreement":null},{"id":"W2007083670","doi":"10.1155/2008/950951","title":"Theory and Applications in Multiuser/Multiterminal Communications","year":2008,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Web application; World Wide Web","score_opus":0.06690800020567274,"score_gpt":0.3135470046189373,"score_spread":0.24663900441326458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007083670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3324953,0.15272816,0.47987437,0.015988402,0.0005600318,0.002033257,0.000010288269,0.0005865968,0.015723575],"genre_scores_gemma":[0.8270141,0.16049083,0.01181306,0.00044804547,0.00007789382,0.000063423606,0.000007137879,0.00001597901,0.00006955199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974836,0.0012171855,0.00054555933,0.00027931022,0.00017608593,0.00029826915],"domain_scores_gemma":[0.9948315,0.0019175014,0.00026735847,0.002653257,0.00014668073,0.00018369338],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013293794,0.0002186811,0.00027345918,0.00029936148,0.002438912,0.00024692592,0.0027961994,0.000078070814,0.0000035604633],"category_scores_gemma":[0.000033215783,0.00020508638,0.000058070906,0.0006982948,0.00051012065,0.00049452885,0.0016874134,0.0009994158,0.000005518519],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018972023,0.00032781233,0.025157673,0.0000068917225,0.000034369514,0.00000987093,0.0041862815,0.000044845554,0.00019120493,0.31391418,0.00008862252,0.6560193],"study_design_scores_gemma":[0.0032872208,0.00033959796,0.12162307,0.0011058083,0.000047016492,0.001981894,0.0010143961,0.46350273,0.0000730652,0.012128409,0.39335048,0.0015463221],"about_ca_topic_score_codex":0.000004590458,"about_ca_topic_score_gemma":0.00007314136,"teacher_disagreement_score":0.65447295,"about_ca_system_score_codex":0.00006887003,"about_ca_system_score_gemma":0.00006629935,"threshold_uncertainty_score":0.99885976},"labels":[],"label_agreement":null},{"id":"W2007432287","doi":"10.1049/iet-com.2013.0444","title":"Optimal power allocation and relay selection for multiple code division multiple access peer‐to‐peer communication","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Computer network; Asynchronous communication; Transmitter power output; Reciprocal; Power (physics); Transmitter; Channel (broadcasting)","score_opus":0.06531774646321586,"score_gpt":0.34811415746964885,"score_spread":0.282796411006433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007432287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028011322,0.0004155505,0.9199068,0.04889249,0.00012983457,0.0010934281,0.000017348937,0.00036678946,0.0011664495],"genre_scores_gemma":[0.76113117,0.00046027577,0.23647141,0.00078861904,0.000020747668,0.00045485504,0.00017900468,0.000025526764,0.0004684153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761724,0.00069001113,0.0005190455,0.00047345556,0.0003761079,0.0003241213],"domain_scores_gemma":[0.9918414,0.002187134,0.00024041506,0.0038976406,0.0016416301,0.00019179957],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0019802789,0.00024130527,0.00025446402,0.00023654242,0.0017359832,0.0006709963,0.004323117,0.00013157722,0.000010167918],"category_scores_gemma":[0.0021965744,0.00025747274,0.00008313522,0.00079952495,0.00014408474,0.0011627103,0.0028557554,0.00038852863,0.00003480611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016942574,0.0017982225,0.04412261,0.00007860086,0.0002538406,1.6395806e-7,0.023237256,0.05807285,0.022013333,0.46173638,0.07648775,0.31202957],"study_design_scores_gemma":[0.00072028284,0.000108121974,0.015567145,0.00005573172,0.000012663421,0.0000033087374,0.000070546535,0.73884153,0.00074999523,0.00040201083,0.24317774,0.00029092538],"about_ca_topic_score_codex":0.000058028836,"about_ca_topic_score_gemma":0.0012707446,"teacher_disagreement_score":0.73311985,"about_ca_system_score_codex":0.00012219344,"about_ca_system_score_gemma":0.00006535145,"threshold_uncertainty_score":0.9999877},"labels":[],"label_agreement":null},{"id":"W2007601909","doi":"10.1049/joe.2013.0121","title":"Outage performance of a cognitive amplify‐and‐forward relay network with primary user interference over Nakagami‐ <i>m</i> fading channels","year":2013,"lang":"en","type":"article","venue":"The Journal of Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Nakagami distribution; Fading; Relay; Interference (communication); Cognitive radio; Computer science; Electronic engineering; Computer network; Telecommunications; Engineering; Channel (broadcasting); Physics; Wireless; Power (physics)","score_opus":0.013466148852024141,"score_gpt":0.21206625156509054,"score_spread":0.1986001027130664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007601909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6560869,0.0007862089,0.34266162,0.00010256236,0.000120706754,0.00009043726,2.1418089e-7,0.000014663465,0.00013664081],"genre_scores_gemma":[0.99404585,0.0010883496,0.004593459,0.00013524726,0.00007926514,0.000003541863,2.4280925e-7,0.000009504631,0.00004451143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992535,0.000055830216,0.00028201862,0.00007388023,0.00015740699,0.00017733131],"domain_scores_gemma":[0.99892503,0.00040336285,0.00021614096,0.00020838292,0.00018515413,0.000061929175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005261152,0.000116044044,0.00020248794,0.0000692686,0.00008033867,0.00006462965,0.00055575237,0.000026367698,0.0000094731495],"category_scores_gemma":[0.000038097343,0.00007325163,0.000029962006,0.00024032497,0.00003935276,0.00063184893,0.0002599541,0.00035095477,0.0000022253553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029571986,0.00012874672,0.015752485,0.00026004677,0.0006654664,0.000015224171,0.024107909,0.8629758,0.022586046,0.0058161635,0.0012148145,0.066181615],"study_design_scores_gemma":[0.0013983517,0.0010237743,0.06670194,0.0041875015,0.00007775509,0.00035464443,0.00018772476,0.9216118,0.0029783673,0.00005163456,0.0009316731,0.00049483747],"about_ca_topic_score_codex":0.0000017345712,"about_ca_topic_score_gemma":7.2219916e-7,"teacher_disagreement_score":0.33806816,"about_ca_system_score_codex":0.00002547628,"about_ca_system_score_gemma":0.000026228397,"threshold_uncertainty_score":0.29871148},"labels":[],"label_agreement":null},{"id":"W2007859804","doi":"10.1109/glocom.2008.ecp.936","title":"Two-Fold Pricing to Guarantee Individual Profits and Maximum Social Welfare in Wireless Access Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Relay; Computer science; Network packet; Profit (economics); Wireless; Wireless network; Microeconomics; Economics; Telecommunications","score_opus":0.06252144799633369,"score_gpt":0.3074723990767388,"score_spread":0.2449509510804051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007859804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7778584,0.00021376155,0.20304379,0.0117646605,0.00018560716,0.0005047864,9.0038947e-7,0.00019231992,0.0062358347],"genre_scores_gemma":[0.99505013,0.00018119093,0.0030670972,0.0014442847,0.00007276477,0.00003398271,0.0000026593746,0.000009185748,0.00013867789],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987266,0.00013614244,0.00025254258,0.00035388477,0.00020418747,0.00032663697],"domain_scores_gemma":[0.9994108,0.000060377395,0.000054378583,0.00032566205,0.00008178774,0.00006696834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031286175,0.00014917194,0.00019840283,0.00015922968,0.000445434,0.00024317607,0.0012426598,0.000056430763,0.00001455589],"category_scores_gemma":[0.000013917424,0.00013971687,0.000026506179,0.0009665609,0.000046461188,0.0005841085,0.0015641456,0.00023843833,0.000004344426],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030045616,0.00015852207,0.040750522,0.000014574084,0.00003479305,0.00005690569,0.011329673,0.001696524,0.00020284989,0.43610078,0.0030774863,0.50654733],"study_design_scores_gemma":[0.0024915726,0.00012939738,0.5378087,0.00010967764,0.00000856119,0.00008090678,0.0002947328,0.45285395,0.0004848455,0.0005579343,0.004123819,0.0010559197],"about_ca_topic_score_codex":0.000029482391,"about_ca_topic_score_gemma":0.00037620513,"teacher_disagreement_score":0.5054914,"about_ca_system_score_codex":0.000038050457,"about_ca_system_score_gemma":0.00003807573,"threshold_uncertainty_score":0.5697489},"labels":[],"label_agreement":null},{"id":"W2007946941","doi":"10.1109/icassp.2013.6638607","title":"Distributed concatenated Alamouti code designs for one-way relay networks using uniquely-factorable PSK constellation","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Space–time block code; Relay; Computer science; Block code; Code (set theory); Phase-shift keying; Topology (electrical circuits); Algorithm; Constellation; Channel (broadcasting); Theoretical computer science; Telecommunications; Mathematics; Decoding methods; Bit error rate; Combinatorics; Physics; Power (physics)","score_opus":0.13249036988037408,"score_gpt":0.3048604231427238,"score_spread":0.17237005326234975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007946941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095817605,0.0002058257,0.9857545,0.0011207233,0.0001810638,0.00090679264,0.000006181517,0.00034924631,0.0018939124],"genre_scores_gemma":[0.933664,0.00015193048,0.06513081,0.00047867277,0.000027941847,0.000030659026,0.00008655374,0.000016418984,0.00041300632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984427,0.00024352293,0.00040638668,0.0003661436,0.00014227975,0.0003989468],"domain_scores_gemma":[0.9979875,0.00047868793,0.00017309052,0.00069123873,0.0005240413,0.00014542532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004153983,0.00019343056,0.00024071326,0.000074751464,0.00046473372,0.00041535095,0.0007236248,0.00013201193,0.0002286324],"category_scores_gemma":[0.000059815262,0.00017806403,0.00007117155,0.00057805196,0.0000813956,0.0007390266,0.00025204892,0.00018623253,0.000026545207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005901955,0.00046069155,0.0072887037,0.000048957092,0.00033745592,0.0000033880701,0.0009154457,0.3563899,0.061021872,0.451389,0.051766302,0.07031925],"study_design_scores_gemma":[0.0004964669,0.000040911018,0.00058232906,0.000037179354,0.000011222799,0.0000034498446,0.000019185918,0.98995775,0.0040792036,0.000823643,0.003688108,0.00026055722],"about_ca_topic_score_codex":0.00004821262,"about_ca_topic_score_gemma":0.000040685627,"teacher_disagreement_score":0.9240823,"about_ca_system_score_codex":0.00014256297,"about_ca_system_score_gemma":0.0000822283,"threshold_uncertainty_score":0.72612405},"labels":[],"label_agreement":null},{"id":"W2007986210","doi":"10.1109/vtcfall.2012.6399250","title":"Optimization of Scheduling and Routing in Wireless Ad-Hoc Networks Using Cubic Games","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Linear network coding; Mathematical optimization; Multicast; Wireless network; Scheduling (production processes); Theoretical computer science; Distributed computing; Computer network; Wireless; Mathematics; Network packet","score_opus":0.04440653116057496,"score_gpt":0.28790746527750455,"score_spread":0.24350093411692958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007986210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22255836,0.0027037892,0.7742428,0.00006334385,0.0000637117,0.00005486935,2.8854336e-8,0.000028483519,0.00028458697],"genre_scores_gemma":[0.8218602,0.0013799693,0.17666243,0.000061047256,0.000019979707,0.0000014485778,5.555961e-7,0.0000041538265,0.000010190175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993268,0.00009961126,0.00020710898,0.00011649325,0.00006893185,0.00018104307],"domain_scores_gemma":[0.9994953,0.000094510295,0.000080209145,0.00023119316,0.000053712643,0.00004505562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004479401,0.00007024637,0.000116737894,0.0000772404,0.00008139006,0.0000497271,0.00022559933,0.00003644919,0.00000916552],"category_scores_gemma":[0.000023790986,0.000067374305,0.00001505889,0.0004154498,0.000026428957,0.00056062936,0.00030453072,0.00009669315,3.550029e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047336002,0.00006479822,0.03259091,0.000010979072,0.00000937331,3.2630723e-7,0.0026328522,0.7158751,0.0014016494,0.05593977,0.0000047057747,0.19146481],"study_design_scores_gemma":[0.00013880845,0.0000063851444,0.0016771811,0.000068918285,0.0000016403119,0.0000023666719,0.0000880944,0.99760646,0.0003043449,0.000009491802,0.000017471257,0.000078831916],"about_ca_topic_score_codex":0.000003971094,"about_ca_topic_score_gemma":0.000012609486,"teacher_disagreement_score":0.5993019,"about_ca_system_score_codex":0.000025230756,"about_ca_system_score_gemma":0.00001636195,"threshold_uncertainty_score":0.27474445},"labels":[],"label_agreement":null},{"id":"W2008233780","doi":"10.1109/bsc.2010.5473024","title":"Performance of turbo coded cooperative asynchronous DS-CDMA in frequency-selective fading channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Code division multiple access; Fading; Telecommunications link; Asynchronous communication; Turbo code; Single antenna interference cancellation; Relay; Interference (communication); Base station; Turbo; Cooperative diversity; Detector; Electronic engineering; Channel (broadcasting); Computer network; Decoding methods; Telecommunications; Engineering; Physics","score_opus":0.02128992494726598,"score_gpt":0.26234913864667725,"score_spread":0.24105921369941127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008233780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92917323,0.00010046,0.036959857,0.00047130228,0.0004260732,0.0003214317,9.97588e-7,0.00010433583,0.03244232],"genre_scores_gemma":[0.98084605,0.0001647147,0.01855672,0.00017782139,0.000041778596,0.000033871438,0.0000021998098,0.000008236541,0.00016860705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877965,0.0001205496,0.00033433342,0.00031975718,0.0001644126,0.00028131087],"domain_scores_gemma":[0.9987205,0.00016990227,0.00010517898,0.00060924527,0.00032751597,0.000067616245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043753712,0.00016222111,0.00024697668,0.00018294755,0.00016524184,0.000070036665,0.0010325764,0.00007811117,0.00011117372],"category_scores_gemma":[0.000095384705,0.00014319493,0.00003915295,0.00092704274,0.00010560738,0.0006482325,0.00029948907,0.00045875716,0.000027838358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004680736,0.0005720553,0.04746149,0.000046205612,0.000085464395,0.000012563024,0.025554169,0.0056975773,0.3769399,0.42609867,0.0005917318,0.11689335],"study_design_scores_gemma":[0.0010496654,0.0003916693,0.023812333,0.000101300386,0.000004158495,0.000020229074,0.00008872335,0.76858044,0.20432886,0.00082458166,0.00027292382,0.00052510115],"about_ca_topic_score_codex":0.00003602736,"about_ca_topic_score_gemma":0.00056365307,"teacher_disagreement_score":0.7628829,"about_ca_system_score_codex":0.000060509778,"about_ca_system_score_gemma":0.00015930201,"threshold_uncertainty_score":0.583932},"labels":[],"label_agreement":null},{"id":"W2008359784","doi":"10.1109/tcomm.2014.2378257","title":"On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels with Memory","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Algorithm; Block code; Queue; Hamming distance; Binary number; Mathematics; Fading; Sequential decoding; Hamming code; Computer science; Theoretical computer science; Computer network; Arithmetic","score_opus":0.049836312430617154,"score_gpt":0.2807018596210243,"score_spread":0.23086554719040714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008359784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122665055,0.00023909316,0.95829207,0.027982283,0.00008647778,0.0005565345,0.000016340686,0.00010029726,0.0004603942],"genre_scores_gemma":[0.9770377,0.00071104517,0.020984191,0.00085718627,0.00001754434,0.00032059167,0.0000041641315,0.000016708349,0.00005082416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987559,0.0003258609,0.00023166435,0.0003211242,0.00014334689,0.00022213944],"domain_scores_gemma":[0.99344397,0.0030266666,0.00013270267,0.0031590909,0.00013622557,0.00010136798],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005765845,0.00018463892,0.00018345362,0.000101754784,0.002315914,0.00028681263,0.0019802565,0.000054613225,0.0000042148754],"category_scores_gemma":[0.000043732365,0.00014256133,0.000047889083,0.00024242348,0.00034918988,0.00027963976,0.00005397904,0.0003232744,0.0000036623626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025029315,0.0008566455,0.00041956824,0.00011524891,0.00021752882,9.2443327e-7,0.0039581414,0.0040426403,0.0024213584,0.23219714,0.0008093049,0.7547112],"study_design_scores_gemma":[0.0020569204,0.00095830456,0.0011303731,0.00057240215,0.00008059667,0.0000052981636,0.00019973902,0.97452694,0.004474528,0.012227647,0.0031840699,0.00058319466],"about_ca_topic_score_codex":0.000010284183,"about_ca_topic_score_gemma":0.00017998526,"teacher_disagreement_score":0.97048426,"about_ca_system_score_codex":0.000043022428,"about_ca_system_score_gemma":0.00004675216,"threshold_uncertainty_score":0.9989829},"labels":[],"label_agreement":null},{"id":"W2008442270","doi":"10.1109/iwcmc.2013.6583702","title":"On the performance analysis of cooperative vehicular relaying in LTE-A networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Relay; Fading; Transmission (telecommunications); Computer network; Multipath propagation; Cooperative diversity; Vehicular ad hoc network; Wireless; Wireless ad hoc network; Channel (broadcasting); Antenna diversity; Real-time computing; Power (physics); Telecommunications","score_opus":0.025289621993799114,"score_gpt":0.24889946281428,"score_spread":0.22360984082048088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008442270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80742323,0.00015215567,0.1827447,0.0019139034,0.00004080564,0.0002143348,9.673689e-8,0.000032543903,0.007478253],"genre_scores_gemma":[0.9976127,0.0003392175,0.0007954669,0.0009912242,0.0000051452926,0.00003410738,0.0000012761748,0.0000025912254,0.00021824581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914896,0.00020165103,0.0002210428,0.00016327701,0.00012580307,0.00013926065],"domain_scores_gemma":[0.9986712,0.00043108972,0.000061774204,0.0006705521,0.0001395925,0.000025842983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000412647,0.000081644655,0.0001619047,0.00016236509,0.00013373153,0.000076592645,0.0007709439,0.000028997207,0.00023489681],"category_scores_gemma":[0.000044750243,0.000049704293,0.000055022592,0.0022451235,0.00004114452,0.0002634156,0.00022961349,0.00018747017,0.000025836487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025493457,0.00006713403,0.010364568,0.0000015857936,0.00016162184,5.211021e-7,0.0012656495,0.5584036,0.00030668432,0.40772972,0.0008956804,0.020800669],"study_design_scores_gemma":[0.00006807687,0.00002820934,0.035585385,0.000016847545,0.00000875287,1.359212e-7,0.00003730462,0.963816,0.00026902376,0.000036004916,0.0000693402,0.000064959095],"about_ca_topic_score_codex":0.000024245226,"about_ca_topic_score_gemma":0.00007112546,"teacher_disagreement_score":0.4076937,"about_ca_system_score_codex":0.00002602653,"about_ca_system_score_gemma":0.000016224827,"threshold_uncertainty_score":0.25719553},"labels":[],"label_agreement":null},{"id":"W2009408211","doi":"10.1109/icuwb.2015.7324437","title":"Distributed Collaborative Beamforming Design in Scattered-Environments","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Beamforming; Monochromatic color; Computer science; Channel (broadcasting); Wireless; Power (physics); Topology (electrical circuits); Scattering; Constant (computer programming); Wireless network; Computational complexity theory; Algorithm; Distributed computing; Computer network; Mathematics; Telecommunications; Physics; Optics; Combinatorics","score_opus":0.07314297206326222,"score_gpt":0.28527472772794354,"score_spread":0.21213175566468134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009408211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018527855,0.00018648204,0.9933209,0.0016697214,0.00006530202,0.00017350315,9.604959e-7,0.00005023838,0.0026801152],"genre_scores_gemma":[0.8950271,0.00008775083,0.10400025,0.00047302328,0.000011697789,0.000030287858,0.000007998067,0.0000045179445,0.00035736934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991444,0.00019738234,0.00016531261,0.00018344175,0.00014321129,0.00016629044],"domain_scores_gemma":[0.9993491,0.00006332089,0.00004164435,0.00041050953,0.000040828294,0.00009456745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044717407,0.00008486198,0.000098258526,0.00006207763,0.00006558349,0.00009014493,0.00062976795,0.000026553498,0.00001335785],"category_scores_gemma":[0.000054802767,0.00007621514,0.000011782114,0.0006391289,0.000028565555,0.0004883519,0.00035000645,0.000085833904,0.00007638432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013357346,0.001495653,0.029757142,0.000011823261,0.00012084146,0.00009093722,0.03761427,0.08308659,0.01075629,0.32627383,0.09049359,0.42016548],"study_design_scores_gemma":[0.0030707975,0.00028289712,0.008918443,0.00007307039,0.0000048778065,0.00001216181,0.0012849201,0.8694807,0.01208301,0.0044747954,0.09950745,0.0008068737],"about_ca_topic_score_codex":0.0000028648074,"about_ca_topic_score_gemma":0.000020474024,"teacher_disagreement_score":0.89317435,"about_ca_system_score_codex":0.00013489442,"about_ca_system_score_gemma":0.00007583294,"threshold_uncertainty_score":0.31079632},"labels":[],"label_agreement":null},{"id":"W2009553166","doi":"10.1109/wcnc.2010.5506466","title":"Cross-Layer Scheduling Design for OFDMA Two-Way Amplify-And-Forward Relay Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subcarrier; Computer science; Orthogonal frequency-division multiple access; Relay; Scheduling (production processes); Frequency-division multiple access; Orthogonal frequency-division multiplexing; Channel state information; Computer network; Physical layer; Transmitter; Mathematical optimization; Channel (broadcasting); Power (physics); Wireless; Telecommunications; Mathematics","score_opus":0.06542950531234137,"score_gpt":0.33611347660389523,"score_spread":0.27068397129155386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009553166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017429622,0.0003353775,0.97866476,0.0012855123,0.0005578552,0.00034339842,5.976819e-7,0.00022313168,0.0011597428],"genre_scores_gemma":[0.6367297,0.00025334206,0.3609697,0.0008218461,0.00016086476,0.000080726146,0.0000019871477,0.000012853151,0.00096899696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987767,0.000087683016,0.00027347583,0.00039610255,0.000120670295,0.0003454088],"domain_scores_gemma":[0.99811125,0.0006506556,0.00008434628,0.0007805534,0.00022539913,0.00014779577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010429452,0.00016697907,0.00017790541,0.00006545268,0.000554536,0.0005658386,0.0009653709,0.0001110615,0.00010559546],"category_scores_gemma":[0.00013020415,0.00014186966,0.00006405348,0.0002709575,0.000085936925,0.00047677866,0.0004989096,0.00041888625,0.000018408744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031903266,0.00006966853,0.0026396916,0.000009261962,0.00005001016,0.0000014085786,0.0005276766,0.04464332,0.011772839,0.65645134,0.0017618503,0.28204098],"study_design_scores_gemma":[0.00058183016,0.00003911572,0.0008673163,0.000013574742,0.0000055853197,0.0000066068806,0.000005620188,0.9819367,0.002015276,0.00080979086,0.013491087,0.00022752208],"about_ca_topic_score_codex":0.000005524224,"about_ca_topic_score_gemma":0.000050072365,"teacher_disagreement_score":0.93729335,"about_ca_system_score_codex":0.000013891711,"about_ca_system_score_gemma":0.00004483579,"threshold_uncertainty_score":0.5785277},"labels":[],"label_agreement":null},{"id":"W2009686316","doi":"10.1109/lcomm.2014.2345671","title":"Exact Outage Probability for a Wireless Diversity Network With Spatially Random Mobile Relays","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relay; Outage probability; Node (physics); Wireless network; Computer network; Wireless; Coverage probability; Probability distribution; Random variable; Topology (electrical circuits); Quality of service; Fading; Channel (broadcasting); Telecommunications; Mathematics; Statistics; Engineering","score_opus":0.03775288137458517,"score_gpt":0.25917808943687987,"score_spread":0.2214252080622947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009686316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04262615,0.0001625101,0.9455007,0.009047203,0.00016751596,0.0015210967,0.0000045696243,0.00027106004,0.0006992325],"genre_scores_gemma":[0.86177844,0.00021980953,0.13497828,0.002195386,0.00007583015,0.0006676102,0.000022896145,0.00001626647,0.000045500277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793947,0.00075543247,0.00033370726,0.00040151595,0.00021236665,0.0003575338],"domain_scores_gemma":[0.9935662,0.0013139772,0.00021732754,0.0045504933,0.0002416204,0.00011037519],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012664989,0.00021209304,0.00030107048,0.0000683119,0.0018065455,0.00018335332,0.004324504,0.000059960756,0.0000062004096],"category_scores_gemma":[0.000061465056,0.00019324783,0.00011883763,0.00049695314,0.00028951926,0.0004414144,0.001729772,0.00032312478,0.000015514983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081486494,0.0019654343,0.044455465,0.00023121579,0.0007379221,0.0000050142535,0.019900134,0.15018277,0.011457522,0.27728847,0.047685,0.44527617],"study_design_scores_gemma":[0.0066072536,0.00051602576,0.004837267,0.0002622638,0.000105712366,0.00001457563,0.000053176893,0.8216515,0.000567634,0.0033818348,0.16069467,0.0013080693],"about_ca_topic_score_codex":0.000024140567,"about_ca_topic_score_gemma":0.00044224234,"teacher_disagreement_score":0.8191523,"about_ca_system_score_codex":0.00010895772,"about_ca_system_score_gemma":0.00005438363,"threshold_uncertainty_score":0.99949294},"labels":[],"label_agreement":null},{"id":"W2009745523","doi":"10.1002/wcm.318","title":"A performance evaluation of distributed dynamic channel allocation protocols for mobile networks","year":2006,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Base station; Blocking (statistics); Channel (broadcasting); Mutual exclusion; Wireless; Channel allocation schemes; Protocol (science); Distributed computing; Resource allocation; Interference (communication); Reuse; Telecommunications","score_opus":0.04189709636627776,"score_gpt":0.33102909367776395,"score_spread":0.2891319973114862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009745523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15529038,0.0021558632,0.8333288,0.00014314172,0.000050601207,0.008730139,0.000008452608,0.00012259961,0.0001700331],"genre_scores_gemma":[0.9784706,0.0006914506,0.009928826,0.000020484898,0.000026524911,0.0106235435,0.00021240168,0.000013438249,0.000012700205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841774,0.000302654,0.0005424577,0.00028944574,0.0002164361,0.00023126721],"domain_scores_gemma":[0.99670887,0.0003362165,0.00036554772,0.001634104,0.00091215054,0.00004311674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015136886,0.00016084252,0.000238853,0.00010109234,0.00069606537,0.000111278096,0.0012985939,0.00007057082,0.0000015446848],"category_scores_gemma":[0.000020916383,0.00016754208,0.00005989875,0.00052067585,0.00013546266,0.0002757117,0.0007892665,0.00015402472,6.536092e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007864846,0.00029474913,0.00046275894,0.000051175648,0.000021117547,2.9224577e-8,0.0005093623,0.25215387,0.0009238745,0.008720259,0.00007215943,0.7367828],"study_design_scores_gemma":[0.0006669016,0.00012638562,0.0030169205,0.00018257325,0.000017428123,0.0000028476957,0.00006771998,0.9935359,0.00021128583,0.0001521884,0.0018451231,0.0001747526],"about_ca_topic_score_codex":0.00001210547,"about_ca_topic_score_gemma":0.000041224794,"teacher_disagreement_score":0.82339996,"about_ca_system_score_codex":0.00009373534,"about_ca_system_score_gemma":0.00009506223,"threshold_uncertainty_score":0.68321675},"labels":[],"label_agreement":null},{"id":"W2010444331","doi":"10.1109/jcn.2014.000094","title":"Power allocation framework for OFDMA-based decode-and-forward cellular relay networks","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Relay; Telecommunications link; Orthogonal frequency-division multiple access; Cellular network; Computer network; Power (physics); Resource allocation; Base station; Knapsack problem; Scheme (mathematics); Mathematical optimization; Orthogonal frequency-division multiplexing; Algorithm; Mathematics","score_opus":0.0236229432684266,"score_gpt":0.2850686972271793,"score_spread":0.2614457539587527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010444331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019627477,0.017151464,0.97089446,0.009299691,0.00024039774,0.00018738944,6.458682e-7,0.000032823318,0.00023040574],"genre_scores_gemma":[0.7812031,0.013743108,0.20380875,0.0010553784,0.00011752102,0.000025009555,0.0000042468605,0.000014316172,0.000028552222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984033,0.0004172523,0.0006183477,0.00017878434,0.00015087925,0.0002314272],"domain_scores_gemma":[0.9954251,0.0018998815,0.0005654084,0.0014224049,0.00051388587,0.0001733173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017323387,0.00017061229,0.00031736545,0.00014018475,0.0006158922,0.00025127517,0.0015901354,0.00016361516,0.000009017434],"category_scores_gemma":[0.00016855297,0.00015148812,0.000120224126,0.0003664216,0.00014927855,0.0003529948,0.0003681746,0.00060008554,6.041387e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005352055,0.00020662567,0.0013677076,0.000016546646,0.000116415096,5.216888e-7,0.00065771915,0.03738908,0.00011120854,0.63864124,0.0019549443,0.31948447],"study_design_scores_gemma":[0.00049425114,0.0002108452,0.00082253834,0.00019550891,0.000030175572,0.000009071632,0.000026267942,0.93839794,0.00002772671,0.0037859061,0.05582705,0.00017273496],"about_ca_topic_score_codex":0.0000010595552,"about_ca_topic_score_gemma":0.0000093072385,"teacher_disagreement_score":0.90100884,"about_ca_system_score_codex":0.00003217228,"about_ca_system_score_gemma":0.000055878463,"threshold_uncertainty_score":0.6177506},"labels":[],"label_agreement":null},{"id":"W2010596631","doi":"10.1007/s00453-012-9739-y","title":"Switching to Directional Antennas with Constant Increase in Radius and Hop Distance","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; RADIUS; Graph; Constant (computer programming); Unit disk graph; Mathematics; Combinatorics; Theory of computation; Physics; Topology (electrical circuits); Computer science; Telecommunications; Algorithm; Computer network; Wireless","score_opus":0.011620697721961748,"score_gpt":0.23252055098040855,"score_spread":0.2208998532584468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010596631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14362116,0.00072569394,0.8459467,0.0048285886,0.000091415925,0.0003668521,0.0000016846378,0.0001142479,0.0043036314],"genre_scores_gemma":[0.93882984,0.00012207947,0.060153294,0.0007023393,0.000023779108,0.000045992616,0.0000010267657,0.0000054033103,0.00011622221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992498,0.00007077064,0.00013602164,0.00025184362,0.00011436704,0.00017716772],"domain_scores_gemma":[0.99932534,0.00012852396,0.000031910255,0.00031438086,0.00007900474,0.00012081625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014544372,0.00009652916,0.00011656385,0.00008627324,0.00012764393,0.00015437318,0.0003139235,0.000018550307,0.000017102067],"category_scores_gemma":[0.00003428716,0.00007962176,0.000010801693,0.00042588878,0.00003656089,0.00033967747,0.00021292067,0.00012812918,0.000020608099],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029756266,0.00014661533,0.008249238,0.00000994986,0.000030173936,0.000041843352,0.0029714208,0.00006742174,0.0069167074,0.06933225,0.0011867104,0.9110179],"study_design_scores_gemma":[0.0029600295,0.00041237983,0.16324434,0.0006203326,0.000010801098,0.00031499614,0.00032504168,0.7813873,0.0018105893,0.005001921,0.042495273,0.0014169668],"about_ca_topic_score_codex":0.00012030501,"about_ca_topic_score_gemma":0.00020991686,"teacher_disagreement_score":0.909601,"about_ca_system_score_codex":0.00004254682,"about_ca_system_score_gemma":0.000040543924,"threshold_uncertainty_score":0.3246881},"labels":[],"label_agreement":null},{"id":"W2010692329","doi":"10.1109/tcomm.2013.021413.110555","title":"Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of the Butterfly Network","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear network coding; Price of anarchy; Nash equilibrium; Computer science; Game theory; Bottleneck; Network packet; Computer network; Pairwise comparison; Non-cooperative game; Mathematical optimization; Packet forwarding; Price of stability; Mathematical economics; Mathematics","score_opus":0.04708077613640651,"score_gpt":0.2783337920222419,"score_spread":0.23125301588583538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010692329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010796829,0.00027050287,0.98138404,0.0039566103,0.00019423374,0.00049191574,0.0000050966014,0.00014324345,0.0027575097],"genre_scores_gemma":[0.9838845,0.0011129074,0.014056842,0.0005022609,0.0000192853,0.00019989851,0.000005265179,0.000016785165,0.00020222152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783146,0.00080068153,0.00048824138,0.00029977702,0.00025308251,0.0003267526],"domain_scores_gemma":[0.99383783,0.00076062564,0.00028310786,0.0046994314,0.00032322467,0.00009577271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039126584,0.0002189344,0.0003285218,0.00020275499,0.0009814259,0.00022235718,0.0036728408,0.00007637024,0.00015543029],"category_scores_gemma":[0.000005825097,0.00015559491,0.00024107509,0.0041430146,0.0003697286,0.00040919683,0.000083370986,0.0005891492,0.000027343045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035408666,0.00081170886,0.0017656574,0.000021834876,0.0018640482,6.235164e-7,0.00330054,0.72668874,0.0009403787,0.2213442,0.0010691715,0.04215768],"study_design_scores_gemma":[0.00042770588,0.00014510244,0.0048136674,0.00038604587,0.0005209903,0.000005828847,0.00026431165,0.9876571,0.00045093725,0.0041658934,0.0007898802,0.00037248817],"about_ca_topic_score_codex":0.00005715194,"about_ca_topic_score_gemma":0.0008788268,"teacher_disagreement_score":0.9730877,"about_ca_system_score_codex":0.00008088203,"about_ca_system_score_gemma":0.000096413794,"threshold_uncertainty_score":0.7548433},"labels":[],"label_agreement":null},{"id":"W2010985693","doi":"10.1109/lsp.2013.2244882","title":"Selection Combining for Differential Amplify-and-Forward Relaying Over Rayleigh-Fading Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Maximal-ratio combining; Rayleigh fading; Fading; Selection (genetic algorithm); Channel (broadcasting); Bit error rate; Algorithm; Differential (mechanical device); Channel state information; Computer science; Signal-to-noise ratio (imaging); Mathematics; Telecommunications; Statistics; Topology (electrical circuits); Wireless; Engineering; Artificial intelligence; Combinatorics","score_opus":0.0307345730189498,"score_gpt":0.26614186653302313,"score_spread":0.23540729351407333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010985693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23058842,0.00009802849,0.76675624,0.0017898179,0.00026454456,0.0002660154,3.165149e-7,0.00017451121,0.00006207843],"genre_scores_gemma":[0.9872776,0.000018408473,0.009994591,0.0022596186,0.0002462663,0.00012148822,0.0000035534993,0.0000221393,0.000056295914],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865705,0.000088293295,0.00027670318,0.00040301183,0.00019346167,0.00038149825],"domain_scores_gemma":[0.9992566,0.00018741068,0.00015815746,0.00017946908,0.00011951727,0.00009885711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024607877,0.00019648428,0.0002040741,0.00014820269,0.00082687417,0.0008782284,0.00046376736,0.000067694215,0.00002570156],"category_scores_gemma":[0.000018204426,0.00018950556,0.000058295638,0.00030603082,0.000059423208,0.0010681527,0.00012620263,0.0002692607,0.000010320643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018113255,0.000049903614,0.00061805267,0.00010395321,0.000051703602,0.0000011617954,0.003031067,0.00238096,0.71853507,0.0020313922,0.005243321,0.2679353],"study_design_scores_gemma":[0.00081234524,0.00007214661,0.00078619405,0.00021278973,0.000017084341,0.0000125775605,0.000028291646,0.98419535,0.011741899,0.0007219766,0.00096349313,0.00043587253],"about_ca_topic_score_codex":0.000007866325,"about_ca_topic_score_gemma":0.0000011655114,"teacher_disagreement_score":0.9818144,"about_ca_system_score_codex":0.000064226,"about_ca_system_score_gemma":0.00003081901,"threshold_uncertainty_score":0.8468777},"labels":[],"label_agreement":null},{"id":"W2010995690","doi":"10.1186/1687-1499-2014-204","title":"Turbo codes for multi-hop wireless sensor networks with decode-and-forward mechanism","year":2014,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Computer science; Retransmission; Computer network; Decoding methods; Wireless sensor network; Network packet; Forward error correction; Algorithm; Real-time computing","score_opus":0.055557197428365186,"score_gpt":0.29845272760027,"score_spread":0.2428955301719048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010995690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020880105,0.0037383349,0.97129077,0.002886291,0.00027150282,0.00037372374,0.000001768347,0.00013493918,0.00042258133],"genre_scores_gemma":[0.8618345,0.029737024,0.10697394,0.0010190567,0.00024800576,0.000054533546,0.0000067633523,0.000039564136,0.00008661088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763197,0.0007122319,0.00053458195,0.00040705813,0.00022391533,0.000490239],"domain_scores_gemma":[0.99600405,0.0013976322,0.00043357204,0.0015406768,0.00033696703,0.00028712174],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015554188,0.00033782705,0.0004520212,0.00017141819,0.0023519883,0.0007595946,0.0017212005,0.000117383315,0.0000035250278],"category_scores_gemma":[0.000028719647,0.00027684943,0.000094512856,0.0004115634,0.00020586039,0.00038086306,0.00075303373,0.0008214421,0.0000023603122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058511705,0.00013269583,0.0008727941,0.000013717393,0.000112594345,0.0000028488637,0.00082140934,0.0013883641,0.00022444257,0.12722565,0.00016560081,0.86898136],"study_design_scores_gemma":[0.0011020276,0.0003024367,0.0005525701,0.00041694485,0.000032694184,0.00016382926,0.00007971376,0.9751017,0.00008114896,0.00045068105,0.021316929,0.00039932752],"about_ca_topic_score_codex":0.000002818473,"about_ca_topic_score_gemma":0.00009600939,"teacher_disagreement_score":0.97371334,"about_ca_system_score_codex":0.000056487817,"about_ca_system_score_gemma":0.00004595328,"threshold_uncertainty_score":0.99996835},"labels":[],"label_agreement":null},{"id":"W2011057833","doi":"10.1109/glocom.2011.6134065","title":"Amplify-and-Forward Multihop Relaying with Adaptive M-QAM in Nakagami-m Fading","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Fading; QAM; Quadrature amplitude modulation; Spectral efficiency; Bit error rate; Mathematics; Harmonic mean; Algorithm; Upper and lower bounds; Transmission (telecommunications); Computer science; Topology (electrical circuits); Statistics; Telecommunications; Mathematical analysis; Decoding methods","score_opus":0.0780760931170578,"score_gpt":0.2578012177056916,"score_spread":0.1797251245886338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011057833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071120605,0.00039040827,0.8549296,0.0003974978,0.00007526211,0.00026472908,3.067496e-7,0.00023280106,0.07258875],"genre_scores_gemma":[0.8892244,0.00018523948,0.109973095,0.00030714198,0.000007849152,0.000017303542,4.0002715e-7,0.0000066866187,0.00027787907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991377,0.00009232637,0.0001681977,0.000283475,0.000105487605,0.00021284148],"domain_scores_gemma":[0.9992738,0.00010897307,0.000049990867,0.0004336296,0.000059016336,0.000074642245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027862846,0.000117628275,0.00013533236,0.000121743135,0.00014172123,0.00006238716,0.0005085008,0.000039091614,0.000033389988],"category_scores_gemma":[0.00002167502,0.00009201253,0.000016824466,0.00040325834,0.000051120343,0.0004831775,0.00039465612,0.00020790541,0.000022259095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054453736,0.0001198321,0.025726805,0.00000767939,0.000037049715,0.000031287425,0.024215575,0.0001445299,0.0005405297,0.7670628,0.00018120698,0.18187825],"study_design_scores_gemma":[0.0030003963,0.0006247036,0.09729506,0.00038993804,0.000015096734,0.000078165096,0.0023043067,0.8828301,0.003190887,0.002785255,0.006191516,0.0012945705],"about_ca_topic_score_codex":0.000056054723,"about_ca_topic_score_gemma":0.00026786354,"teacher_disagreement_score":0.8826856,"about_ca_system_score_codex":0.000037219954,"about_ca_system_score_gemma":0.000028344408,"threshold_uncertainty_score":0.37521622},"labels":[],"label_agreement":null},{"id":"W2011224560","doi":"10.1109/icassp.2010.5496178","title":"Distortion exponents of source transmission over two-way relaying cooperative networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Exponent; Upper and lower bounds; Relay channel; Distortion (music); Bandwidth (computing); Topology (electrical circuits); Decoding methods; Channel state information; Signal-to-noise ratio (imaging); Transmission (telecommunications); Coding (social sciences); Telecommunications; Electronic engineering; Computer network; Wireless; Mathematics; Physics; Engineering; Power (physics); Statistics","score_opus":0.019713138017145162,"score_gpt":0.2793062527933526,"score_spread":0.25959311477620745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011224560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09741393,0.00013470824,0.89775723,0.00027489098,0.0002644116,0.00012518256,1.8316973e-7,0.00010255985,0.0039269193],"genre_scores_gemma":[0.98736143,0.000166088,0.01133568,0.00019630828,0.00004972751,0.0000095216565,0.0000043088808,0.000008576523,0.0008683866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897856,0.00012785484,0.0002885495,0.000248936,0.00018266462,0.00017342035],"domain_scores_gemma":[0.99894565,0.00011710628,0.00010270227,0.00060060003,0.00014035801,0.00009357888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033718403,0.00012240327,0.00015133552,0.000063270134,0.0002427657,0.000065906104,0.00064580166,0.00006296333,0.00020984323],"category_scores_gemma":[0.000026843469,0.00010133073,0.00006182876,0.00036405472,0.000059877697,0.0004257232,0.00020526345,0.0003308727,0.000008663471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000295406,0.00022397973,0.002795385,0.00000821901,0.00003097781,0.0000018453503,0.002807253,0.009114995,0.14582236,0.12062878,0.0017573767,0.7167793],"study_design_scores_gemma":[0.0006672475,0.000055021428,0.005162534,0.000045850098,0.000005432237,0.0000044985745,0.000025420304,0.96833396,0.01139394,0.00009067259,0.013988331,0.00022710781],"about_ca_topic_score_codex":0.000013752683,"about_ca_topic_score_gemma":0.000046749763,"teacher_disagreement_score":0.959219,"about_ca_system_score_codex":0.000019836812,"about_ca_system_score_gemma":0.000026320513,"threshold_uncertainty_score":0.4132147},"labels":[],"label_agreement":null},{"id":"W2011230090","doi":"10.1109/wcnc.2014.6952820","title":"Video dissemination protocols in urban vehicular ad hoc network: A performance evaluation study","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Coding (social sciences); Routing protocol; Vehicular ad hoc network; Dissemination; Wireless ad hoc network; Distributed computing; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.04643543401176039,"score_gpt":0.3462958543997192,"score_spread":0.29986042038795885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011230090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7535483,0.00041582866,0.20350328,0.0013555373,0.00021902453,0.029015057,1.2154459e-7,0.00032519683,0.011617653],"genre_scores_gemma":[0.9889221,0.000034579636,0.0033182253,0.00013052828,0.00004815582,0.007289748,0.000003258519,0.00000602678,0.00024733267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817663,0.00062134117,0.0002920286,0.00030680845,0.0003903547,0.00021282912],"domain_scores_gemma":[0.9987332,0.00013168766,0.00008161133,0.00078443787,0.00022458307,0.000044482465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031420367,0.000115097,0.00013724383,0.000090282905,0.00018676362,0.00016030256,0.0007232226,0.000034248988,0.000040211944],"category_scores_gemma":[0.00012601902,0.00010143447,0.000024151144,0.0007278433,0.000015011149,0.0005687009,0.00028393,0.00014349348,0.000031286345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011159487,0.00029237816,0.038608495,0.0000064355268,0.0000067181973,4.0301748e-7,0.0027127496,0.005940723,0.0001333588,0.0049106805,0.0017484907,0.9456284],"study_design_scores_gemma":[0.0005156632,0.00021181015,0.17476249,0.000079584264,0.0000025403406,5.649703e-7,0.000029122702,0.81816375,0.000079201935,0.00008672453,0.00594517,0.00012340589],"about_ca_topic_score_codex":0.0000010819824,"about_ca_topic_score_gemma":0.00010508712,"teacher_disagreement_score":0.945505,"about_ca_system_score_codex":0.00009225347,"about_ca_system_score_gemma":0.00004248007,"threshold_uncertainty_score":0.41363776},"labels":[],"label_agreement":null},{"id":"W2011271871","doi":"10.1109/ciss.2012.6310738","title":"Fair scheduling and resource allocation for wireless cellular network with shared relays","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Computer network; Frequency reuse; Scheduling (production processes); Beamforming; Wireless; Resource allocation; Wireless network; Distributed computing; Telecommunications; Base station; Engineering","score_opus":0.0334930284043891,"score_gpt":0.2493609794119187,"score_spread":0.2158679510075296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011271871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018259462,0.0013121781,0.97651273,0.00142944,0.000054537268,0.00030880014,2.4374663e-7,0.00012976072,0.0019928527],"genre_scores_gemma":[0.8304985,0.00007628312,0.16844286,0.00042490725,0.00013127699,0.000057534082,0.000008131459,0.0000086101245,0.0003518601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926895,0.00006397222,0.00013037543,0.00018675183,0.000091675545,0.00025830287],"domain_scores_gemma":[0.99917847,0.00015406121,0.000056865705,0.00042906165,0.00008422582,0.00009729062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004595973,0.000095320414,0.00009965394,0.000028992294,0.0003128863,0.0001270334,0.00035983368,0.0000376432,0.000008209995],"category_scores_gemma":[0.000014904157,0.000077573844,0.00001841397,0.00025341916,0.000028036977,0.0004859202,0.00021133394,0.000086069245,0.0000051515235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034732628,0.000076108045,0.0053272676,0.000027594222,0.000041443785,4.5632115e-7,0.0028494967,0.003466769,0.002809631,0.8685094,0.0039495276,0.112907544],"study_design_scores_gemma":[0.0007081106,0.000105778505,0.0021483134,0.00010503809,0.000013457308,0.000008173344,0.0001532136,0.9007303,0.0023407694,0.0003751104,0.09293946,0.00037226107],"about_ca_topic_score_codex":0.0000012999416,"about_ca_topic_score_gemma":0.000010733383,"teacher_disagreement_score":0.8972635,"about_ca_system_score_codex":0.0000197042,"about_ca_system_score_gemma":0.000018694582,"threshold_uncertainty_score":0.31633696},"labels":[],"label_agreement":null},{"id":"W2011560054","doi":"10.1109/isit.2007.4557081","title":"On the Capacity Bounds of Undirected Networks","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Linear network coding; Coding (social sciences); Upper and lower bounds; Computer science; Routing (electronic design automation); Throughput; Undirected graph; Computer network; Combinatorics; Mathematics; Theoretical computer science; Graph; Telecommunications","score_opus":0.08223840861993871,"score_gpt":0.2909392029363034,"score_spread":0.20870079431636468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011560054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009083741,0.00033811806,0.90836203,0.0019616375,0.0006117559,0.0002376875,9.692446e-7,0.00017071624,0.07923336],"genre_scores_gemma":[0.9904899,0.00064606493,0.006814789,0.0012916547,0.00006322386,0.000014203834,0.0000046088226,0.000007566726,0.00066797325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870515,0.0002841373,0.0002960909,0.00029458915,0.00023011945,0.00018990847],"domain_scores_gemma":[0.9968211,0.0007938822,0.00018774356,0.0019234952,0.00022647662,0.000047293408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009749334,0.00017006272,0.00021237897,0.000088053406,0.00017595282,0.00014581895,0.0023737336,0.00015266851,0.00011474142],"category_scores_gemma":[0.00010070675,0.000111362824,0.00010773098,0.00041566524,0.0001118553,0.00004528206,0.0020849088,0.00081329985,0.000011272523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032516432,0.000047798534,0.000043315955,0.0000054619404,0.000034167926,4.836966e-7,0.0003012818,0.003544787,0.000022032564,0.97113836,0.0065707285,0.01828833],"study_design_scores_gemma":[0.00013909592,0.000050970866,0.0031571926,0.00022871324,0.000009365363,0.0000019373429,0.000011448016,0.9655571,0.0009643937,0.021889366,0.007626188,0.0003642566],"about_ca_topic_score_codex":0.000028606632,"about_ca_topic_score_gemma":0.00012868602,"teacher_disagreement_score":0.98140615,"about_ca_system_score_codex":0.00006076044,"about_ca_system_score_gemma":0.000073237265,"threshold_uncertainty_score":0.45412442},"labels":[],"label_agreement":null},{"id":"W2012009673","doi":"10.1007/s11277-007-9420-y","title":"Bandwidth-efficient Bit-interleaved Coded Cooperative Communications","year":2007,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Saskatchewan","funders":"","keywords":"Computer science; Spectral efficiency; Bandwidth (computing); Encoder; Concatenation (mathematics); Algorithm; Electronic engineering; Telecommunications; Arithmetic; Mathematics; Channel (broadcasting)","score_opus":0.06251393009816986,"score_gpt":0.3235055057780729,"score_spread":0.26099157567990305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012009673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03451962,0.008089162,0.858326,0.032068755,0.00040745857,0.0011326463,0.000043069973,0.0010952139,0.064318076],"genre_scores_gemma":[0.95345306,0.002909913,0.041336846,0.0013709322,0.000048813712,0.00011483601,0.00011069342,0.000032558844,0.00062233885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969129,0.0007332318,0.00077305833,0.0005182113,0.00045751804,0.0006050915],"domain_scores_gemma":[0.98988116,0.0014272797,0.0002804288,0.007246705,0.00086107134,0.00030337373],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016878842,0.00035569808,0.00038452228,0.0003285003,0.0023031055,0.00036047163,0.009465519,0.00014124022,0.00007076865],"category_scores_gemma":[0.00013947875,0.00036108782,0.00019712574,0.0016234675,0.0008640221,0.00042796633,0.0043818434,0.000947989,0.00024641128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003248451,0.0011583442,0.00059448264,0.00001361259,0.00014748673,0.0000053963267,0.017652623,0.00009280947,0.009452708,0.8345614,0.0021493942,0.13413927],"study_design_scores_gemma":[0.0012944547,0.00013360562,0.004425046,0.00020642804,0.000036358444,0.00005740221,0.0020710889,0.89452165,0.001745466,0.00061351544,0.09394341,0.00095158006],"about_ca_topic_score_codex":0.00004272575,"about_ca_topic_score_gemma":0.0012788216,"teacher_disagreement_score":0.91893345,"about_ca_system_score_codex":0.00029046714,"about_ca_system_score_gemma":0.0002447232,"threshold_uncertainty_score":0.9998841},"labels":[],"label_agreement":null},{"id":"W2012040679","doi":"10.1109/icgcs.2010.5543006","title":"Raptor-network coding strategies for energy efficient cooperative DVB-H multimedia communications","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Linear network coding; Network packet; Raptor code; Efficient energy use; Digital Video Broadcasting; Energy consumption; Fountain code; Physical layer; Wireless; Telecommunications; Decoding methods; Block code","score_opus":0.04121523889911017,"score_gpt":0.30142411054100665,"score_spread":0.2602088716418965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012040679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009920478,0.00037637306,0.9765248,0.002646224,0.0006652243,0.00032284684,0.0000038680987,0.00032281585,0.018145848],"genre_scores_gemma":[0.7712252,0.0003245949,0.22676016,0.00081052,0.00014664272,0.00018627102,0.00002365507,0.000013140396,0.0005097674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985945,0.00017180193,0.00034016586,0.00035484595,0.00016068963,0.00037799895],"domain_scores_gemma":[0.9962252,0.0010209322,0.00011203419,0.002026552,0.00047943348,0.00013586327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743828,0.00019971818,0.00021521519,0.00007728125,0.001014705,0.0004754356,0.0025802385,0.00009016758,0.000076655466],"category_scores_gemma":[0.000099643985,0.0001770502,0.00009057654,0.0005412511,0.00020910491,0.00035899566,0.0009295204,0.00031326662,0.000021442425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039968936,0.000073682735,0.00001827313,0.0000020522791,0.000019944337,2.2270167e-7,0.0007742365,0.0024925277,0.005601303,0.9585755,0.0050199158,0.02741833],"study_design_scores_gemma":[0.00042183543,0.00004436905,0.00012225934,0.000015787104,0.000005388841,0.0000031961645,0.00016144659,0.89953387,0.0011013646,0.0015794677,0.0967583,0.00025270498],"about_ca_topic_score_codex":0.000014565323,"about_ca_topic_score_gemma":0.00090699136,"teacher_disagreement_score":0.956996,"about_ca_system_score_codex":0.000029044599,"about_ca_system_score_gemma":0.00020999271,"threshold_uncertainty_score":0.7804394},"labels":[],"label_agreement":null},{"id":"W2012067885","doi":"10.1109/icc.2010.5501940","title":"A Decentralized Power Allocation Scheme for Amplify-And-Forward Multi-Hop Relaying Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Hop (telecommunications); Outage probability; Computer science; Fading; Signal-to-noise ratio (imaging); Power (physics); Control theory (sociology); Topology (electrical circuits); Electronic engineering; Mathematics; Telecommunications; Engineering; Decoding methods; Physics","score_opus":0.04523792728449308,"score_gpt":0.30894360842594115,"score_spread":0.2637056811414481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012067885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020341372,0.000358962,0.9758369,0.0013605532,0.00050882425,0.0004571564,7.874179e-7,0.00020291004,0.00093255955],"genre_scores_gemma":[0.77722555,0.00019806983,0.22152312,0.00033843017,0.000021553016,0.00008647512,0.0000047348763,0.00000826561,0.0005937766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991608,0.000052338863,0.00021916,0.00025913265,0.000101979575,0.00020657742],"domain_scores_gemma":[0.9988796,0.00017885429,0.000070227594,0.000571464,0.0001999032,0.00009996122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047321102,0.0001060378,0.00012936583,0.000057436537,0.00026280936,0.0002796108,0.00052482856,0.00007194576,0.00002226411],"category_scores_gemma":[0.00014730675,0.00009174748,0.000036803907,0.00017287485,0.000030403537,0.00034114494,0.00021218725,0.00016778,0.0000181935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010205696,0.00007092275,0.000894905,0.000017889151,0.000029253555,2.884882e-7,0.001087834,0.000033344273,0.058105726,0.91448605,0.0018622332,0.023401354],"study_design_scores_gemma":[0.0013451182,0.00003842446,0.0011141031,0.00003143266,0.000005684124,0.00000998687,0.00012813315,0.8603611,0.0013944404,0.00016763106,0.13511181,0.00029214763],"about_ca_topic_score_codex":0.000009571153,"about_ca_topic_score_gemma":0.000054289438,"teacher_disagreement_score":0.91431844,"about_ca_system_score_codex":0.000018260647,"about_ca_system_score_gemma":0.000037225494,"threshold_uncertainty_score":0.37413538},"labels":[],"label_agreement":null},{"id":"W2012158206","doi":"10.1109/tcomm.2011.122111.100197a","title":"Adaptive Power Loading for Multi-Relay OFDM Regenerative Networks with Relay Selection","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Orthogonal frequency-division multiplexing; Bit error rate; Computer science; Selection (genetic algorithm); Relay channel; Electronic engineering; Power (physics); Multiplexing; Channel (broadcasting); Engineering; Telecommunications","score_opus":0.12782066954455967,"score_gpt":0.30019273838400484,"score_spread":0.17237206883944517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012158206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030843285,0.00032787016,0.9955446,0.0005547564,0.00021550946,0.00055172463,0.000008589928,0.0002971778,0.002191318],"genre_scores_gemma":[0.6559148,0.000499772,0.3423581,0.00021156423,0.000009913951,0.00045963432,0.00000449693,0.000023007253,0.0005187249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848706,0.00035148207,0.0003310077,0.00038535026,0.00014388426,0.00030119452],"domain_scores_gemma":[0.9968891,0.00037949247,0.00017015082,0.0019907346,0.00044853712,0.000121988785],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00033540427,0.00022977657,0.00019034167,0.00020079558,0.0016331063,0.00009896317,0.001652443,0.00011816489,0.000053213866],"category_scores_gemma":[0.000010461801,0.00022182234,0.00012529573,0.00088898133,0.00018600447,0.0005774032,0.000026059872,0.0005774085,0.000026206346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006744541,0.0047594695,0.00013287431,0.000018275712,0.0013211687,0.0000038750563,0.03395426,0.37998226,0.0025750308,0.41524804,0.0024992756,0.15883105],"study_design_scores_gemma":[0.0008047815,0.00053937495,0.00013212478,0.0000812028,0.000044233566,0.00001557247,0.00020907732,0.9896912,0.0065265954,0.000057258767,0.001556556,0.00034205403],"about_ca_topic_score_codex":0.000025503916,"about_ca_topic_score_gemma":0.0008264122,"teacher_disagreement_score":0.6556063,"about_ca_system_score_codex":0.0001280995,"about_ca_system_score_gemma":0.00011282272,"threshold_uncertainty_score":0.99966663},"labels":[],"label_agreement":null},{"id":"W2012285052","doi":"10.1109/wimob.2010.5645006","title":"Iterative detection for zero-padded OFDM in non-regenerative cooperative wireless networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Decoding methods; Algorithm; Wireless; Reduction (mathematics); Relay; Minimum mean square error; Channel (broadcasting); Multiplexing; Computational complexity theory; Bit error rate; Wireless broadband; Wireless network; Electronic engineering; Telecommunications; Mathematics; Engineering; Statistics","score_opus":0.019997774846523937,"score_gpt":0.27433083549564347,"score_spread":0.25433306064911954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012285052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06193559,0.000046341556,0.9334927,0.00064281654,0.0006637792,0.00082316174,0.0000021043156,0.0001183313,0.0022751428],"genre_scores_gemma":[0.9779686,0.000056932844,0.019683838,0.0006766797,0.00014511945,0.00039123947,0.000012875695,0.000016540822,0.0010481969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983871,0.00018880531,0.00038189683,0.0005296722,0.0001404447,0.0003720823],"domain_scores_gemma":[0.9982087,0.00039868956,0.0001133467,0.0006730878,0.00049713743,0.000109014654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004349781,0.00025438657,0.0002903288,0.00017148093,0.00043287725,0.00031493133,0.00082967576,0.00014688312,0.000048851678],"category_scores_gemma":[0.00008454219,0.00022293544,0.00007947033,0.00084658,0.00009295846,0.0007722853,0.00028331354,0.00054425315,0.000018750665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009613535,0.00033311232,0.0003746426,0.000010465885,0.00007329465,0.000005532792,0.0078784125,0.006348275,0.2986126,0.3377449,0.0023768777,0.34614578],"study_design_scores_gemma":[0.0009653867,0.00015190161,0.00093887036,0.000021560018,0.0000030749013,0.0000036614836,0.00006419456,0.9283769,0.0674055,0.00035769676,0.0013978163,0.0003134519],"about_ca_topic_score_codex":0.000013135811,"about_ca_topic_score_gemma":0.0031458838,"teacher_disagreement_score":0.9220286,"about_ca_system_score_codex":0.000064205014,"about_ca_system_score_gemma":0.00007877136,"threshold_uncertainty_score":0.9091044},"labels":[],"label_agreement":null},{"id":"W2012303827","doi":"10.1109/spawc.2010.5670815","title":"Exact performance analysis of decode-and-forward opportunistic relaying","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Phase-shift keying; Computer science; Bit error rate; Outage probability; Keying; Expression (computer science); Signal-to-noise ratio (imaging); Binary number; Modulation (music); Decoding methods; Computer network; Algorithm; Telecommunications; Electronic engineering; Mathematics; Arithmetic; Engineering; Fading","score_opus":0.03583899808680141,"score_gpt":0.28419597062465496,"score_spread":0.24835697253785355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012303827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58317184,0.000060736926,0.39590657,0.0004083585,0.00010028502,0.000054050794,6.6089007e-7,0.00007285808,0.02022462],"genre_scores_gemma":[0.9758124,0.00045600368,0.023183158,0.00014973847,0.000006802581,0.0000030946092,0.00000244416,0.000002452717,0.00038392068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940705,0.000030465044,0.00019273648,0.00015931285,0.00010439707,0.00010602079],"domain_scores_gemma":[0.9990107,0.00012850402,0.00007206891,0.0006286224,0.00009088944,0.000069227375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037448946,0.000065867665,0.00015558323,0.0001922305,0.00012513292,0.00004904246,0.0005163855,0.000028876695,0.00013839004],"category_scores_gemma":[0.00004851585,0.00005537998,0.00004967019,0.00077792385,0.000046706722,0.00023452069,0.00029566154,0.0001386724,0.000005591766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039308093,0.000050739778,0.067659646,0.000012178601,0.00027430264,0.0000014175938,0.00083240145,0.00026217144,0.009658497,0.40573293,0.000216109,0.5152957],"study_design_scores_gemma":[0.00007498278,0.000019925443,0.06479814,0.000005274445,0.000055444372,0.0000021836418,0.000010569608,0.9322052,0.00056610175,0.000064952204,0.0021020223,0.00009519427],"about_ca_topic_score_codex":0.0000044671933,"about_ca_topic_score_gemma":0.00007513082,"teacher_disagreement_score":0.93194306,"about_ca_system_score_codex":0.000005473722,"about_ca_system_score_gemma":0.000029634342,"threshold_uncertainty_score":0.22583301},"labels":[],"label_agreement":null},{"id":"W2012414551","doi":"10.1109/pimrc.2011.6139721","title":"Downlink distributed beamforming through relays with imperfect CSI","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Imperfect; Beamforming; Telecommunications link; Context (archaeology); MIMO; Channel (broadcasting); Wireless; Quality of service; Transmission (telecommunications); Computer network; Electronic engineering; Distributed computing; Telecommunications; Engineering","score_opus":0.05366235968428994,"score_gpt":0.2551982373942352,"score_spread":0.20153587770994524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012414551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054838136,0.00015846241,0.9408243,0.0005138168,0.00006935589,0.00015915393,0.000001069927,0.00029186238,0.05249818],"genre_scores_gemma":[0.8240739,0.00023819659,0.17468491,0.0006271831,0.000022479662,0.00002577707,0.00000816183,0.0000070619913,0.00031229467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919933,0.0000568405,0.0001582079,0.00024140197,0.00012007151,0.00022414356],"domain_scores_gemma":[0.9989152,0.00005871111,0.00005423676,0.00080631394,0.00010494841,0.00006056912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017026076,0.000120193894,0.00011807221,0.00002896571,0.00024594227,0.000077171724,0.0008841952,0.000035484198,0.00013877773],"category_scores_gemma":[0.00001721443,0.00008336404,0.000035723562,0.0004707329,0.000048248483,0.0008793864,0.00038112252,0.00015474625,0.00006861802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022063405,0.00013302181,0.0024043033,0.000006473272,0.000052282805,0.000014655543,0.005672975,0.000054175725,0.0006394229,0.9234639,0.0024232785,0.06511347],"study_design_scores_gemma":[0.0058363015,0.002774046,0.04051807,0.0004922057,0.00009443339,0.000497596,0.0011500992,0.29186907,0.085238665,0.018485755,0.548993,0.0040507475],"about_ca_topic_score_codex":0.000021213331,"about_ca_topic_score_gemma":0.000044755045,"teacher_disagreement_score":0.9049781,"about_ca_system_score_codex":0.000031825766,"about_ca_system_score_gemma":0.000042055977,"threshold_uncertainty_score":0.33994865},"labels":[],"label_agreement":null},{"id":"W2012477281","doi":"10.1016/j.comnet.2012.05.006","title":"Network coding for unicast in a WiFi hotspot: Promises, challenges, and testbed implementation","year":2012,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer network; Unicast; Computer science; Linear network coding; Multicast; Hotspot (geology); Wireless network; Testbed; Backhaul (telecommunications); Wireless; Network packet; Telecommunications; Base station","score_opus":0.08024926658814768,"score_gpt":0.3134396161311884,"score_spread":0.23319034954304074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012477281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002763642,0.021006715,0.972752,0.0013944621,0.0007013682,0.0008239728,7.9497937e-7,0.0001513332,0.00040575737],"genre_scores_gemma":[0.9085789,0.006877248,0.08240134,0.0008100378,0.0011005156,0.00016379365,0.000019960507,0.000021639338,0.000026601201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982774,0.00022261136,0.0003730763,0.000372152,0.00011031606,0.0006444171],"domain_scores_gemma":[0.9986373,0.0004269116,0.00013263816,0.0005633135,0.00008113392,0.00015868862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010415782,0.00020726715,0.00026368408,0.000116123105,0.0002261765,0.00014998268,0.0006228401,0.000085737185,0.000004521949],"category_scores_gemma":[0.000010970682,0.0002110096,0.000044899876,0.0004482816,0.00003987954,0.0006401669,0.00065545656,0.00021283029,0.0000024735423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120379345,0.000066016626,0.0021488047,0.00001781441,0.000017874063,0.000001104815,0.0014689077,0.002034348,0.000010375827,0.2169182,0.0032387823,0.77406573],"study_design_scores_gemma":[0.0014782012,0.00013031895,0.05619062,0.00015647878,0.000010187436,0.000021202994,0.000040695322,0.90958816,0.000008262282,0.0011736251,0.030780775,0.0004215029],"about_ca_topic_score_codex":0.0000018180435,"about_ca_topic_score_gemma":0.00005283893,"teacher_disagreement_score":0.9075538,"about_ca_system_score_codex":0.000066738896,"about_ca_system_score_gemma":0.000028476334,"threshold_uncertainty_score":0.86047214},"labels":[],"label_agreement":null},{"id":"W2012502281","doi":"10.1016/j.comcom.2008.01.049","title":"A joint selfish routing and channel assignment game in wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Nash equilibrium; Routing (electronic design automation); Mathematical optimization; Wireless mesh network; Computer network; Channel (broadcasting); Best response; Game theory; Heuristic; Distributed computing; Wireless; Wireless network; Mathematical economics; Telecommunications; Mathematics","score_opus":0.07761816825018782,"score_gpt":0.2696275960658492,"score_spread":0.19200942781566138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012502281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011981725,0.0011193706,0.9801368,0.004879563,0.00015795919,0.00031452486,7.5094533e-7,0.00023136337,0.0011779347],"genre_scores_gemma":[0.9530384,0.0077513163,0.0380463,0.00095504866,0.00005755539,0.00007447379,0.000011447276,0.0000137367015,0.000051742798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816054,0.0004993102,0.00047116439,0.00036873925,0.00016672396,0.00033352105],"domain_scores_gemma":[0.9966237,0.0003152906,0.00014588531,0.002660361,0.00012417328,0.00013062147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051566283,0.00019684368,0.0002808541,0.00016939885,0.0006103365,0.0001636765,0.0023683358,0.00007591236,0.0000039725956],"category_scores_gemma":[0.000017134475,0.00020979725,0.000058565376,0.0006965653,0.0001932856,0.00040978618,0.0038345046,0.0004949017,0.000010116848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009018496,0.0011524103,0.010420531,0.00002255267,0.00012374221,0.000041911087,0.027549515,0.0058024838,0.00028628227,0.6213069,0.005946453,0.32733822],"study_design_scores_gemma":[0.00041636615,0.00003306233,0.024622567,0.00009283876,0.0000028669706,0.000057614325,0.000025276599,0.9726041,0.000017453474,0.00030351512,0.0015874567,0.000236863],"about_ca_topic_score_codex":0.000017093957,"about_ca_topic_score_gemma":0.00008083864,"teacher_disagreement_score":0.96680164,"about_ca_system_score_codex":0.00010464614,"about_ca_system_score_gemma":0.00006595732,"threshold_uncertainty_score":0.8555283},"labels":[],"label_agreement":null},{"id":"W2012683364","doi":"10.1109/lcomm.2013.112713.132078","title":"Outage Probability Analysis for Multi-User Single-Relay OFDMA DF Networks in Frequency Selective Rayleigh Fading Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rayleigh fading; Fading; Computer science; Relay; Fading distribution; Orthogonal frequency-division multiple access; Probability density function; Channel (broadcasting); Cumulative distribution function; Relay channel; Orthogonal frequency-division multiplexing; Computer network; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics; Statistics; Physics","score_opus":0.0875628406979625,"score_gpt":0.3045806306989202,"score_spread":0.21701779000095772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012683364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02994416,0.00046689852,0.9573129,0.010747037,0.00024492524,0.0008176045,0.000004839436,0.00020246848,0.00025917136],"genre_scores_gemma":[0.8150968,0.00021485104,0.18205884,0.0018957311,0.00005235299,0.0005801971,0.000030264519,0.000019400388,0.000051536892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969657,0.0011509937,0.000649339,0.0005787457,0.00017105775,0.0004841519],"domain_scores_gemma":[0.99431646,0.0011677566,0.00028774576,0.0038063219,0.00031347715,0.00010824059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014254403,0.00027570224,0.0004484642,0.00049428036,0.0006681257,0.00026091156,0.0039724796,0.0001175778,0.000006690501],"category_scores_gemma":[0.00024849264,0.00029000462,0.00025344474,0.002713945,0.00020749496,0.0005949615,0.00063080015,0.00053186296,0.0000077126915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000463001,0.002354058,0.08832638,0.00006256424,0.001373724,0.000001962262,0.015821248,0.6864126,0.03961219,0.116775945,0.0022948906,0.04691815],"study_design_scores_gemma":[0.0007273002,0.00004376122,0.007048988,0.00006034969,0.00007923842,9.590342e-7,0.000018568004,0.98823386,0.0007379703,0.00042001024,0.0022050461,0.0004239476],"about_ca_topic_score_codex":0.00006725605,"about_ca_topic_score_gemma":0.0012075942,"teacher_disagreement_score":0.7851527,"about_ca_system_score_codex":0.0003189277,"about_ca_system_score_gemma":0.000039389328,"threshold_uncertainty_score":0.99995524},"labels":[],"label_agreement":null},{"id":"W2012789807","doi":"10.1109/icc.2012.6364914","title":"A cellular automaton model for connectivity preserving deployment of mobile wireless sensors","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Wireless sensor network; Cellular automaton; Software deployment; Distributed computing; Wireless; Cellular network; Wireless network; Automaton; Real-time computing; Computer network; Algorithm; Theoretical computer science; Telecommunications","score_opus":0.053499301088610764,"score_gpt":0.2948552914845225,"score_spread":0.24135599039591174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012789807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34567082,0.00022850775,0.65298575,0.00008304127,0.000049083083,0.00024874444,7.7549873e-7,0.00009825641,0.00063504966],"genre_scores_gemma":[0.95684654,0.0000478281,0.042604864,0.00006543532,0.000017356688,0.00010242915,0.0000010303723,0.0000073187875,0.0003072182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925613,0.00008026959,0.00018253329,0.00014586891,0.000116691604,0.0002185274],"domain_scores_gemma":[0.99893886,0.00019959046,0.000075219614,0.0005986529,0.00011423233,0.00007343045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047049063,0.00008620481,0.00014669064,0.000041898496,0.00011060075,0.00002792496,0.0005345537,0.00003168221,0.000014925462],"category_scores_gemma":[0.00002162092,0.00007695149,0.000058576552,0.00014814227,0.000019751295,0.000394617,0.00042765113,0.000052230807,0.0000031925333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021973814,0.0009632064,0.004084234,0.00014953222,0.00008887965,3.8038883e-7,0.0125420615,0.050873827,0.16182722,0.70619935,0.003313495,0.05993583],"study_design_scores_gemma":[0.00017179125,0.000022669636,0.00014280295,0.000013204495,0.0000032378248,6.065011e-7,0.0000283837,0.94343483,0.055314735,0.00017544215,0.00059958425,0.00009268101],"about_ca_topic_score_codex":0.000005655576,"about_ca_topic_score_gemma":0.0000099456265,"teacher_disagreement_score":0.892561,"about_ca_system_score_codex":0.000030822648,"about_ca_system_score_gemma":0.000030681236,"threshold_uncertainty_score":0.31379905},"labels":[],"label_agreement":null},{"id":"W2012897804","doi":"10.1109/isit.2007.4557084","title":"On The Limitations of The Naive Lattice Decoding","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Lattice (music); List decoding; Fading; Mathematics; MIMO; Sequential decoding; Algorithm; Word error rate; Full Rate; Upper and lower bounds; Computer science; Lattice reduction; Discrete mathematics; Statistics; Block code; Concatenated error correction code; Speech recognition; Physics","score_opus":0.13673849700210133,"score_gpt":0.30618811328911855,"score_spread":0.1694496162870172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012897804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05040875,0.00010826788,0.6888935,0.019283082,0.00022443081,0.00017130138,1.8609853e-7,0.000053009324,0.24085748],"genre_scores_gemma":[0.9906691,0.000091923386,0.0063032606,0.0022847597,0.000009928998,0.0000020891541,6.980765e-8,0.0000016225846,0.00063727103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995502,0.00008133382,0.00010824541,0.000070412054,0.000108498105,0.00008126217],"domain_scores_gemma":[0.99701667,0.0022734771,0.000046406287,0.00056111376,0.00008664454,0.000015712068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005451671,0.000037718957,0.000035113793,0.000022083828,0.000269486,0.000032614877,0.00089527795,0.000011661805,0.000017369679],"category_scores_gemma":[0.00032155964,0.000018564346,0.000033095464,0.0003974647,0.000040810628,0.00007209456,0.00023646839,0.000092534545,0.000018873985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.399188e-7,0.000011020329,0.000083342384,1.8925513e-7,0.0000030840067,5.8023232e-8,0.0007181722,0.00003682985,0.00027270816,0.9627683,0.00087470433,0.035231043],"study_design_scores_gemma":[0.0010812611,0.0002782837,0.16115148,0.00028686327,0.000033549997,0.000017176704,0.0027684418,0.45155364,0.108895406,0.100377955,0.17274077,0.00081517413],"about_ca_topic_score_codex":0.0000015551706,"about_ca_topic_score_gemma":0.000079432284,"teacher_disagreement_score":0.94026035,"about_ca_system_score_codex":0.0000133029625,"about_ca_system_score_gemma":0.000018239509,"threshold_uncertainty_score":0.20726956},"labels":[],"label_agreement":null},{"id":"W2012907214","doi":"10.1109/icc.2012.6364366","title":"Opportunistic scheduling in a bidirectional communication link with relaying","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; Computer science; Computer network; Scheduling (production processes); Linear network coding; Node (physics); Data transmission; Distributed computing; Network packet; Engineering","score_opus":0.07129739776453606,"score_gpt":0.294237841388315,"score_spread":0.22294044362377893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012907214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035533924,0.0016945044,0.9102141,0.0055575594,0.00012181225,0.00017270447,2.0862512e-7,0.00026189594,0.04644329],"genre_scores_gemma":[0.8604541,0.00037401094,0.13852848,0.00033064518,0.000028444638,0.00001862972,0.000003792477,0.0000045802944,0.0002573234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929816,0.00013953094,0.0001561289,0.00011272765,0.00011396928,0.00017949473],"domain_scores_gemma":[0.999076,0.00016204712,0.000049904633,0.0005727911,0.0000662616,0.00007301042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005738002,0.000071502225,0.00007910619,0.00010367871,0.00018259813,0.0000689933,0.0004958064,0.00002852275,0.0000418033],"category_scores_gemma":[0.000042510037,0.000060523296,0.000014676672,0.0004891636,0.000029273622,0.00063490856,0.00024919191,0.0001928359,0.000029593206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006818021,0.000117983625,0.042076513,0.0000048880115,0.000012255121,0.0000012404886,0.0016897501,0.0007876416,0.00056374073,0.83356214,0.00013632899,0.12104071],"study_design_scores_gemma":[0.0014233984,0.000099429104,0.11483422,0.00038648178,0.000011330661,0.0001095608,0.00040362895,0.834292,0.00078442035,0.0016423849,0.04515194,0.0008612238],"about_ca_topic_score_codex":0.000009922643,"about_ca_topic_score_gemma":0.00005787344,"teacher_disagreement_score":0.8335043,"about_ca_system_score_codex":0.00005692154,"about_ca_system_score_gemma":0.000050656385,"threshold_uncertainty_score":0.24680685},"labels":[],"label_agreement":null},{"id":"W2012999227","doi":"10.1155/2010/693158","title":"Physical-Layer Network Coding for Wireless Cooperative Networks","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Linear network coding; Physical layer; Computer network; Wireless network; Coding (social sciences); Layer (electronics); Wireless; Application layer; Network layer; Telecommunications","score_opus":0.0523988194462425,"score_gpt":0.31522449744703934,"score_spread":0.2628256780007968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012999227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07326584,0.0040856847,0.9087178,0.006788438,0.0025491863,0.0008462561,0.000003901273,0.0003060152,0.0034368827],"genre_scores_gemma":[0.96773624,0.016853297,0.012006539,0.0012276641,0.001913483,0.00009842789,0.00001376818,0.00004926212,0.00010131389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997359,0.0005693713,0.00062820985,0.00046555372,0.00027153277,0.0007063527],"domain_scores_gemma":[0.99441326,0.0022004715,0.0004906729,0.0020695091,0.00050115515,0.0003249388],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015636894,0.00039618043,0.0005083273,0.00014402079,0.0037358177,0.0010836328,0.00298035,0.0001473058,0.00000807375],"category_scores_gemma":[0.000042109874,0.00035632926,0.00019393157,0.0008277173,0.00028302651,0.0006297256,0.0011044915,0.002025215,0.000006384501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040337203,0.0001879892,0.00093301624,0.0000072303287,0.00011498124,0.000004603566,0.000900074,0.0037768353,0.0021651206,0.41844368,0.0022161363,0.57120997],"study_design_scores_gemma":[0.000770083,0.00019257484,0.00044437186,0.00024496287,0.00002630576,0.00009494543,0.000038953753,0.92744786,0.000121673074,0.0015377223,0.068609774,0.0004708022],"about_ca_topic_score_codex":0.0000015262905,"about_ca_topic_score_gemma":0.00008099716,"teacher_disagreement_score":0.923671,"about_ca_system_score_codex":0.00005798349,"about_ca_system_score_gemma":0.00009575433,"threshold_uncertainty_score":0.9999533},"labels":[],"label_agreement":null},{"id":"W2013035896","doi":"10.1109/bsc.2010.5472937","title":"Relay selection with analog network coding in bidirectional networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Linear network coding; Outage probability; Computer science; Relay channel; Computer network; Coding (social sciences); Selection (genetic algorithm); Terminal (telecommunication); Protocol (science); Topology (electrical circuits); Channel (broadcasting); Mathematics; Fading; Engineering; Power (physics); Electrical engineering; Statistics; Artificial intelligence","score_opus":0.015569594594578419,"score_gpt":0.24673034876769914,"score_spread":0.23116075417312074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013035896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020414038,0.00007236045,0.95874256,0.0008150832,0.0004787518,0.00012537042,5.5360108e-8,0.00024855766,0.01910321],"genre_scores_gemma":[0.95114255,0.00013528724,0.047648687,0.00030421972,0.00021837083,0.000018339078,0.0000020986188,0.0000067309834,0.0005237115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911237,0.000091909395,0.00016751852,0.00025572136,0.00012264244,0.00024982612],"domain_scores_gemma":[0.9993336,0.00013917101,0.000052087697,0.00031777905,0.000096392745,0.000060939623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047745253,0.000102100945,0.00010706129,0.00009730606,0.00024514913,0.00012663814,0.00042072454,0.00006484183,0.00010535468],"category_scores_gemma":[0.00001940038,0.000084600986,0.000022936534,0.0013790721,0.000033627723,0.0003410376,0.00013633551,0.0005121289,0.000011529405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023630948,0.00008889844,0.11106956,0.0000020521525,0.000023847811,0.0000057123584,0.00020439317,0.16863586,0.0010829045,0.6483321,0.006273093,0.06425796],"study_design_scores_gemma":[0.00023584656,0.00004114042,0.042040687,0.000018181898,0.0000015205384,0.00003104362,0.000004921999,0.9503618,0.00009013716,0.00017222734,0.006846407,0.00015610806],"about_ca_topic_score_codex":0.00001713121,"about_ca_topic_score_gemma":0.0047139702,"teacher_disagreement_score":0.9307285,"about_ca_system_score_codex":0.000033480024,"about_ca_system_score_gemma":0.000052589316,"threshold_uncertainty_score":0.34499282},"labels":[],"label_agreement":null},{"id":"W2013436747","doi":"10.1109/icc.2013.6655581","title":"Interference management for multimedia femtocell networks with coalition formation game","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Femtocell; Computer science; Computer network; Scheduling (production processes); Partition (number theory); Software deployment; Stochastic game; Game theory; Wireless network; Wireless; Throughput; Distributed computing; Interference (communication); Channel (broadcasting); Telecommunications; Mathematical optimization","score_opus":0.032760023684864574,"score_gpt":0.25126884113271747,"score_spread":0.2185088174478529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013436747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006975156,0.000048667825,0.98957783,0.000928458,0.00006993392,0.0007269475,2.1188468e-7,0.00013721881,0.0078131985],"genre_scores_gemma":[0.8318396,0.00016260387,0.16596702,0.0005853875,0.000022783439,0.00033725586,0.000014651099,0.0000044727312,0.0010662025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993969,0.00003823974,0.00015428688,0.00016328518,0.00008122597,0.00016603776],"domain_scores_gemma":[0.99926585,0.000073236966,0.0000586535,0.00039061226,0.00016042359,0.000051225194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012680794,0.00008790046,0.000074683456,0.000050672068,0.00009622404,0.00021487022,0.00048784137,0.000023028899,0.00007354467],"category_scores_gemma":[0.0000040242053,0.000066405875,0.000021854863,0.00017671956,0.000019581217,0.0007981241,0.00017920518,0.00005817727,0.00006316252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001730933,0.00009186895,0.000116198586,0.000037936297,0.000030073961,5.994257e-7,0.0010039003,0.0034155536,0.00016767814,0.15182324,0.019860515,0.8234351],"study_design_scores_gemma":[0.00038918477,0.00007492858,0.0009319407,0.000036138517,0.0000028802936,0.0000017736604,0.00006112324,0.9939185,0.00025706645,0.00042094366,0.0037937667,0.000111797875],"about_ca_topic_score_codex":0.0000036459703,"about_ca_topic_score_gemma":0.000024444309,"teacher_disagreement_score":0.9905029,"about_ca_system_score_codex":0.000032207805,"about_ca_system_score_gemma":0.0000058373143,"threshold_uncertainty_score":0.27079532},"labels":[],"label_agreement":null},{"id":"W2013757387","doi":"10.1109/icc.2012.6364525","title":"Partial decode-forward coding schemes for the Gaussian two-way relay channel","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decodes; Relay; Relay channel; Decoding methods; Computer science; Transmission (telecommunications); Topology (electrical circuits); Coding (social sciences); Gaussian; Channel (broadcasting); Code word; MIMO; Computer network; Telecommunications; Mathematics; Physics; Combinatorics; Statistics","score_opus":0.06744252935709472,"score_gpt":0.3205438879840399,"score_spread":0.25310135862694516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013757387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008769438,0.0011857101,0.9843866,0.006676472,0.0006069029,0.00027073297,7.318207e-7,0.00015050976,0.0058453507],"genre_scores_gemma":[0.97428167,0.0003173918,0.022459008,0.0012205247,0.00034660104,0.000104803796,0.0000019417128,0.000009497855,0.0012585907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900407,0.000080294616,0.00019687526,0.0001834007,0.00013441632,0.00040096784],"domain_scores_gemma":[0.9985756,0.0004251446,0.000065018496,0.0007392542,0.000078265555,0.000116660725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082354515,0.00012082541,0.000116141964,0.00003978897,0.00064195687,0.00017097578,0.0010128272,0.00003399536,0.00007013932],"category_scores_gemma":[0.00008609869,0.00007737553,0.00008472539,0.00025269148,0.000045074004,0.0005440142,0.00043830817,0.00012960547,0.0000670122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069460466,0.00004705179,0.00044762142,0.0000040219907,0.000033300465,1.5787103e-7,0.0014991913,0.00014971508,0.0003651552,0.8876206,0.008356581,0.10146962],"study_design_scores_gemma":[0.00049515883,0.000031489733,0.0005955811,0.000019164827,0.000011906842,0.000006500971,0.000094248484,0.6355996,0.0070804073,0.0003534609,0.35547757,0.00023491567],"about_ca_topic_score_codex":0.000003961762,"about_ca_topic_score_gemma":0.000027058086,"teacher_disagreement_score":0.9734047,"about_ca_system_score_codex":0.000029772422,"about_ca_system_score_gemma":0.000025793755,"threshold_uncertainty_score":0.4937478},"labels":[],"label_agreement":null},{"id":"W2013869503","doi":"10.1109/wcnc.2010.5506440","title":"Performance Bounds for AF Multi-Hop Relaying over Nakagami Fading","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Independent and identically distributed random variables; Nakagami distribution; Upper and lower bounds; Fading; Hop (telecommunications); Rayleigh fading; Relay; Moment-generating function; Mathematics; Topology (electrical circuits); Cumulative distribution function; Algorithm; Harmonic mean; Computer science; Statistics; Telecommunications; Probability density function; Combinatorics; Random variable; Mathematical analysis; Physics; Decoding methods","score_opus":0.04929428058298174,"score_gpt":0.30515024680280173,"score_spread":0.25585596621982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013869503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2996928,0.00007494842,0.68782884,0.0007832168,0.000795155,0.00022789926,5.0718035e-7,0.00027340587,0.010323223],"genre_scores_gemma":[0.8508797,0.00009967691,0.1456581,0.00057027774,0.00006886087,0.000033838656,0.000001643236,0.0000086184,0.002679263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919116,0.000023979634,0.00017860664,0.00025131018,0.00010807907,0.0002468724],"domain_scores_gemma":[0.9989079,0.00015406312,0.00005452023,0.000689101,0.0001232418,0.000071127964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000403175,0.0001093135,0.00010453056,0.000071174014,0.0005153472,0.00022735813,0.0009124436,0.00005470369,0.00006843189],"category_scores_gemma":[0.00007545159,0.00009713663,0.00005569369,0.00025369806,0.000037162077,0.00065224135,0.00035619823,0.00023912478,0.00003630084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014848439,0.00015724712,0.017560761,0.000038034847,0.000037402708,0.0000011250728,0.003393871,0.0002599973,0.10659293,0.3069771,0.006763387,0.5582033],"study_design_scores_gemma":[0.00048940367,0.000029876235,0.0069956784,0.000016504913,0.0000021837536,0.0000035404491,0.000014411599,0.9162007,0.0030691081,0.0000686648,0.07291566,0.00019425988],"about_ca_topic_score_codex":0.0000023533728,"about_ca_topic_score_gemma":0.00006464182,"teacher_disagreement_score":0.9159407,"about_ca_system_score_codex":0.00002337951,"about_ca_system_score_gemma":0.00004145097,"threshold_uncertainty_score":0.3963686},"labels":[],"label_agreement":null},{"id":"W2013931105","doi":"10.1109/isit.2012.6284666","title":"Buffer-aided relaying in a three node network","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer network; Ergodic theory; Node (physics); Computer science; Fading; Relay channel; Transmission (telecommunications); Channel (broadcasting); Topology (electrical circuits); Telecommunications; Engineering; Mathematics; Electrical engineering; Power (physics)","score_opus":0.06358704169181581,"score_gpt":0.28765018317927843,"score_spread":0.22406314148746262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013931105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03452318,0.0026459186,0.9008105,0.0023010732,0.00044202353,0.00015395194,5.83797e-8,0.00022813972,0.05889516],"genre_scores_gemma":[0.93780077,0.00016339985,0.06060152,0.0010565345,0.000116419666,0.000014626498,5.4390887e-7,0.000005082403,0.00024108606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911577,0.000106400985,0.00017650619,0.00014064647,0.00010386565,0.00035679527],"domain_scores_gemma":[0.9990787,0.00015585356,0.00003387529,0.00062309974,0.000029626412,0.000078834884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064316794,0.00008438567,0.000106076404,0.00004992972,0.00012702198,0.000068913716,0.0006960942,0.00003567017,0.00007547802],"category_scores_gemma":[0.000037505582,0.0000740557,0.000029526173,0.00057130295,0.000016722037,0.0005468832,0.0005256876,0.00016705898,0.000124354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033999281,0.000079577745,0.14530663,0.0000024297588,0.000008087962,0.0000021037338,0.0011913294,0.0009701885,0.00022633959,0.7578221,0.004152467,0.09023536],"study_design_scores_gemma":[0.0010644023,0.000043883443,0.36684602,0.00014137529,0.0000051642173,0.000028705064,0.00005476245,0.5669941,0.00035918082,0.009866648,0.05383861,0.00075715804],"about_ca_topic_score_codex":0.000011211211,"about_ca_topic_score_gemma":0.00019475192,"teacher_disagreement_score":0.9032776,"about_ca_system_score_codex":0.000041627485,"about_ca_system_score_gemma":0.000018309169,"threshold_uncertainty_score":0.3019904},"labels":[],"label_agreement":null},{"id":"W2014044889","doi":"10.1109/qbsc.2012.6221345","title":"Outage capacity regions of multicarrier DF relaying in underwater acoustic channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rician fading; Underwater acoustic communication; Underwater; Computer science; Channel capacity; Channel (broadcasting); Fading; Outage probability; Gaussian; Telecommunications; Electronic engineering; Acoustics; Physics; Engineering; Geology","score_opus":0.09282202437251814,"score_gpt":0.2931861107798057,"score_spread":0.2003640864072876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014044889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1149023,0.00017283735,0.87651247,0.000981167,0.000249879,0.00013655458,4.1448877e-7,0.00006938384,0.0069749653],"genre_scores_gemma":[0.9846636,0.00006359411,0.014340872,0.00026980886,0.00002637972,0.0000090036665,5.506616e-7,0.0000045851566,0.0006216274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991993,0.00012516632,0.00020323043,0.00012681361,0.000103761704,0.0002417272],"domain_scores_gemma":[0.99915415,0.0001418485,0.000045586672,0.00052473677,0.000055303342,0.00007837325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039037908,0.000079233476,0.00012270475,0.00009540612,0.000078404584,0.000028059929,0.00046144897,0.000041165407,0.00004664934],"category_scores_gemma":[0.00006315202,0.00006625438,0.00003435797,0.00031252604,0.000049317863,0.00043765444,0.00031153572,0.00014154943,0.000024030265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013578881,0.0007733718,0.04513497,0.00006362012,0.00006722203,0.0000055061696,0.056965534,0.006734,0.056815498,0.80948913,0.002252958,0.021684589],"study_design_scores_gemma":[0.0017752172,0.00010219304,0.03588481,0.00028212558,0.000023408678,0.000029304512,0.001193263,0.91711295,0.027389554,0.0039473725,0.011221615,0.0010381829],"about_ca_topic_score_codex":0.000018802717,"about_ca_topic_score_gemma":0.00006657985,"teacher_disagreement_score":0.91037893,"about_ca_system_score_codex":0.00003859383,"about_ca_system_score_gemma":0.000015118227,"threshold_uncertainty_score":0.27017754},"labels":[],"label_agreement":null},{"id":"W2014320365","doi":"10.1109/tvt.2010.2062549","title":"PIS: A Practical Incentive System for Multihop Wireless Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Incentive; Payment; Network packet; Payment system; Computer security; Relay; Wireless; Wireless network; Telecommunications","score_opus":0.01941089694427826,"score_gpt":0.2810752707781586,"score_spread":0.2616643738338803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014320365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014558442,0.000060437025,0.9789367,0.0037867813,0.0011069957,0.0005371046,0.0000035368641,0.0009131149,0.000096886586],"genre_scores_gemma":[0.95486045,0.00009462726,0.044348832,0.00016184105,0.000040253726,0.00041461433,0.0000014382839,0.000018556522,0.00005939843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987037,0.00008822963,0.0002717297,0.00045295028,0.00013740853,0.00034594274],"domain_scores_gemma":[0.9982206,0.000248048,0.00010263094,0.0010825864,0.0002667328,0.000079389145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028337535,0.00018797388,0.00023230627,0.00029499512,0.00052539166,0.00008465831,0.00086281955,0.00037217393,0.000008130393],"category_scores_gemma":[0.000020550362,0.00018170093,0.0001198297,0.00081363623,0.00016965633,0.0002365959,0.000015452913,0.0009983294,0.00003201691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007355895,0.00076771446,0.000031155956,0.000040645744,0.0002143881,0.00003941298,0.0002874776,0.00821638,0.048172984,0.384063,0.0003573847,0.5577359],"study_design_scores_gemma":[0.00078244146,0.00015581376,0.000014252992,0.000054735472,0.000026043464,0.00009409359,0.00009564182,0.93502164,0.055498596,0.00020034374,0.0077872733,0.00026913936],"about_ca_topic_score_codex":0.0000026559158,"about_ca_topic_score_gemma":0.00009526399,"teacher_disagreement_score":0.940302,"about_ca_system_score_codex":0.000075772674,"about_ca_system_score_gemma":0.00007352304,"threshold_uncertainty_score":0.74095494},"labels":[],"label_agreement":null},{"id":"W2014439852","doi":"10.1109/mwc.2009.5281257","title":"Topology control for service-oriented wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Computer science; Computer network; Topology control; Wireless mesh network; Network topology; Logical topology; Topology (electrical circuits); Unicast; Distributed computing; Wireless network; Wireless; Multicast; Key distribution in wireless sensor networks; Telecommunications; Engineering","score_opus":0.038611588100833094,"score_gpt":0.3044249413355768,"score_spread":0.2658133532347437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014439852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005111608,0.0006947869,0.9498599,0.04052765,0.00042089954,0.0007536933,0.000010969612,0.00045624084,0.0021642107],"genre_scores_gemma":[0.9750194,0.0017652367,0.015188012,0.007390255,0.0001343126,0.0002735708,0.00005018887,0.000018151095,0.00016084826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979584,0.00046756578,0.0005286757,0.000401756,0.00016203821,0.000481526],"domain_scores_gemma":[0.9936625,0.0008011977,0.00023370612,0.0044546844,0.000685451,0.00016248297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005006902,0.0002534716,0.0003797405,0.00013456524,0.0010926112,0.00016122201,0.0049311505,0.00015597283,0.0000088343395],"category_scores_gemma":[0.000023914585,0.00026477213,0.0001378119,0.0009517115,0.00014540787,0.00042524395,0.00038782196,0.00041743112,0.000024630077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018381956,0.00025499202,0.00009327696,0.0000043793166,0.000043982218,5.7816976e-7,0.00065399776,0.0004262571,0.0019534572,0.8712107,0.0022210893,0.12311894],"study_design_scores_gemma":[0.0013479256,0.00011452094,0.001172736,0.00004925083,0.000023466246,0.000010390406,0.00005301892,0.96998805,0.00028294403,0.0023811422,0.024214184,0.00036236984],"about_ca_topic_score_codex":0.000011685468,"about_ca_topic_score_gemma":0.00018823391,"teacher_disagreement_score":0.9699078,"about_ca_system_score_codex":0.00009020955,"about_ca_system_score_gemma":0.00011300357,"threshold_uncertainty_score":0.99998045},"labels":[],"label_agreement":null},{"id":"W2014452425","doi":"10.1016/j.adhoc.2010.06.001","title":"Joint random access and power control game in ad hoc networks with noncooperative users","year":2010,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Nash equilibrium; Random access; Wireless ad hoc network; Power control; Best response; Mathematical optimization; Game theory; Asynchronous communication; Constraint (computer-aided design); Strategy; Uniqueness; Node (physics); Non-cooperative game; Distributed computing; Computer network; Power (physics); Wireless; Mathematical economics; Mathematics; Telecommunications","score_opus":0.016625956451294745,"score_gpt":0.2597311546715967,"score_spread":0.24310519822030194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014452425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10902265,0.018256353,0.8649581,0.0032795793,0.0010243973,0.0012936172,0.0000022835861,0.0002571884,0.0019058149],"genre_scores_gemma":[0.983545,0.010614866,0.0031527844,0.00228396,0.0001238795,0.00008557879,0.000007501952,0.00003265769,0.0001537703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756664,0.00038654148,0.00047389197,0.00068635464,0.00024749534,0.0006390682],"domain_scores_gemma":[0.9976576,0.0005303608,0.00020032347,0.0010988961,0.00025641578,0.00025637844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086678757,0.00038252425,0.0005629058,0.00014394007,0.00030080235,0.0007421263,0.0013020822,0.00021582677,0.000076780656],"category_scores_gemma":[0.000059631402,0.00030747987,0.00007335812,0.00090438715,0.00025624462,0.0010648819,0.0006438169,0.0013368005,0.000008223036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019305035,0.0005043776,0.012193683,0.000017770222,0.0003720855,0.00020127762,0.008162225,0.26824784,0.00047758373,0.016595433,0.0067235627,0.68457365],"study_design_scores_gemma":[0.007594531,0.00028919787,0.017387219,0.00015210755,0.000019133016,0.00003714148,0.000054310545,0.9577434,0.000020889185,0.00009592104,0.015998267,0.00060784817],"about_ca_topic_score_codex":0.0000038011926,"about_ca_topic_score_gemma":0.0019426602,"teacher_disagreement_score":0.8745223,"about_ca_system_score_codex":0.000050551902,"about_ca_system_score_gemma":0.00010458826,"threshold_uncertainty_score":0.9999377},"labels":[],"label_agreement":null},{"id":"W2014724511","doi":"10.1109/icc.2014.6884184","title":"Analysis on two-cell shared relay networks with linear receivers","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Telecommunications link; Base station; Ergodic theory; Computer science; Wireless; Computer network; Relay channel; Outage probability; Dual (grammatical number); Topology (electrical circuits); Telecommunications; Decoding methods; Electrical engineering; Mathematics; Engineering; Fading; Physics; Power (physics)","score_opus":0.01886336445150008,"score_gpt":0.25102040130273034,"score_spread":0.23215703685123026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014724511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032377117,0.000043422584,0.92715627,0.0009455014,0.000053540236,0.000071703405,1.9087858e-7,0.00017298294,0.068318665],"genre_scores_gemma":[0.9491948,0.00012224625,0.046193864,0.0015468809,0.00004885526,0.000006487154,0.000008428444,0.000006698169,0.0028717471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989994,0.00018587823,0.00014156668,0.0003226917,0.00016326163,0.00018720058],"domain_scores_gemma":[0.9984909,0.00019661935,0.00006701812,0.0010418709,0.000109941335,0.00009362071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003320393,0.000118295706,0.00016590349,0.00014313053,0.00019880044,0.00012174465,0.00086518825,0.000032542084,0.0001521038],"category_scores_gemma":[0.00001648743,0.00008752392,0.000069432,0.0014565634,0.000027206976,0.00018302262,0.00018671721,0.00018049327,0.000085208456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029156921,0.000114230694,0.004935365,0.000001938795,0.00018071022,0.0000029217822,0.00046568352,0.89573747,0.000051708204,0.039988965,0.004504135,0.053987723],"study_design_scores_gemma":[0.000362892,0.00011019032,0.0013594622,0.00000893283,0.000028421651,4.670009e-7,0.00000715918,0.9859943,0.00010917848,0.0000101022815,0.011863117,0.00014581828],"about_ca_topic_score_codex":0.00000863468,"about_ca_topic_score_gemma":0.00013701295,"teacher_disagreement_score":0.94595706,"about_ca_system_score_codex":0.000028268432,"about_ca_system_score_gemma":0.000015915146,"threshold_uncertainty_score":0.3569122},"labels":[],"label_agreement":null},{"id":"W2014738898","doi":"10.1109/glocom.2011.6134058","title":"Buffers Improve the Performance of Relay Selection","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Selection (genetic algorithm); Diversity gain; Computer science; Network packet; Transmission (telecommunications); Relay channel; Outage probability; Control theory (sociology); Computer network; Telecommunications; Power (physics); Channel (broadcasting); Fading; Physics; Artificial intelligence","score_opus":0.04136997729331115,"score_gpt":0.26222721440170926,"score_spread":0.2208572371083981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014738898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31485653,0.0013240676,0.60448396,0.0022339493,0.0022114464,0.0009472705,0.0000013545706,0.0004214508,0.07351997],"genre_scores_gemma":[0.9849541,0.0017362132,0.011401045,0.0001666766,0.000039315662,0.000032381744,0.0000013611334,0.0000054234883,0.0016634669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918234,0.00011903475,0.00022083381,0.00023713424,0.00012441745,0.00011623053],"domain_scores_gemma":[0.99849075,0.00006037738,0.0001733061,0.0010528442,0.00019811868,0.00002457854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004110017,0.0001177406,0.00013520422,0.000050878894,0.00013821204,0.00005546481,0.0017348882,0.000086627675,0.000053654614],"category_scores_gemma":[0.00001683574,0.00007634818,0.00006726458,0.00019461948,0.000051924373,0.00012090748,0.0018928606,0.00047347177,0.000017624861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003191549,0.00020584172,0.0038312427,0.00019788672,0.0002234127,4.361879e-7,0.009089012,0.008494658,0.00906579,0.4305695,0.007831632,0.5304587],"study_design_scores_gemma":[0.0001231803,0.00012402944,0.004438283,0.00009105244,0.000012447098,0.0000031615293,0.00001619063,0.95725894,0.033355087,0.00055606,0.0037644515,0.00025712402],"about_ca_topic_score_codex":0.000026601392,"about_ca_topic_score_gemma":0.000028086848,"teacher_disagreement_score":0.94876426,"about_ca_system_score_codex":0.00003486165,"about_ca_system_score_gemma":0.000106554115,"threshold_uncertainty_score":0.32238826},"labels":[],"label_agreement":null},{"id":"W2014814998","doi":"10.1109/icc.2012.6364614","title":"Energy-aware relay selection for multiuser relay networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Relay channel; Computer network; Energy (signal processing); Artificial intelligence; Physics; Power (physics)","score_opus":0.03591163095592464,"score_gpt":0.27906830315348197,"score_spread":0.24315667219755732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014814998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059729995,0.00053326495,0.99503535,0.00067812455,0.0004774754,0.00011515147,1.9946634e-7,0.00025670356,0.0023064327],"genre_scores_gemma":[0.93839604,0.00031436924,0.054880064,0.0011135539,0.00027143655,0.00007254139,0.000006220011,0.000011340978,0.0049344557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991408,0.00009739333,0.00016954659,0.00018584107,0.000088679786,0.0003177576],"domain_scores_gemma":[0.99909,0.0001877606,0.00005491973,0.00041895633,0.00014209091,0.000106277315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003510871,0.00010726666,0.000099136174,0.00005387589,0.00030997195,0.00008190649,0.0004747028,0.00007399201,0.0000538299],"category_scores_gemma":[0.000016773685,0.00009288524,0.00006099736,0.000368415,0.000014586233,0.0006081052,0.0002056998,0.00011219086,0.00001799552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001442004,0.00017082151,0.006066527,0.0000048177203,0.000040312734,1.3761607e-7,0.0006878523,0.0065023657,0.00041947316,0.5485219,0.06845267,0.36911872],"study_design_scores_gemma":[0.00019496611,0.000026417045,0.00052422995,0.0000071977342,0.0000031018,0.0000036879828,0.0000073447422,0.8579735,0.0005703108,0.00003453128,0.14052296,0.0001317168],"about_ca_topic_score_codex":0.000007781659,"about_ca_topic_score_gemma":0.000076690485,"teacher_disagreement_score":0.94015527,"about_ca_system_score_codex":0.00005170467,"about_ca_system_score_gemma":0.000018892366,"threshold_uncertainty_score":0.378775},"labels":[],"label_agreement":null},{"id":"W2014964990","doi":"10.1109/icc.2014.6884185","title":"Distributed precoding for two-way relaying with OFDM","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Precoding; Rician fading; Diversity gain; Orthogonal frequency-division multiplexing; Diversity scheme; Computer science; Rayleigh fading; Fading; Coding gain; Coding (social sciences); Zero-forcing precoding; Algorithm; Electronic engineering; Telecommunications; Mathematics; Statistics; MIMO; Decoding methods; Engineering; Channel (broadcasting)","score_opus":0.035013459572475494,"score_gpt":0.2770607438391846,"score_spread":0.24204728426670913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014964990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025333737,0.00003961086,0.9842929,0.0016607948,0.00007234835,0.0001657057,8.0815914e-7,0.00020122614,0.011033182],"genre_scores_gemma":[0.88014734,0.000013180273,0.118907236,0.00039457396,0.000039875256,0.000036279005,0.0000075295634,0.000006018277,0.000447976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932325,0.0000655958,0.00012981189,0.00021359943,0.00008611218,0.00018165572],"domain_scores_gemma":[0.99894994,0.00028723598,0.000050990977,0.0005353027,0.000119009375,0.000057534984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036788653,0.000085472755,0.00010261111,0.00003492601,0.00027873032,0.00014964076,0.00060347735,0.000018326735,0.000015622823],"category_scores_gemma":[0.00006958,0.00006423838,0.000029350484,0.00024780288,0.000020014168,0.0002741144,0.00018908094,0.000073831245,0.000011812124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010297277,0.00003019704,0.0007842325,0.000007836436,0.000017001392,2.564956e-7,0.00030076184,0.00093535695,0.0010655061,0.79524297,0.0026299262,0.19897565],"study_design_scores_gemma":[0.0009361784,0.00013531088,0.000896614,0.000048443824,0.000005313729,0.000005907393,0.000020458441,0.9287898,0.0032236539,0.0011029015,0.06459438,0.00024102608],"about_ca_topic_score_codex":0.0000019635206,"about_ca_topic_score_gemma":0.000039623643,"teacher_disagreement_score":0.9278545,"about_ca_system_score_codex":0.000025480853,"about_ca_system_score_gemma":0.000017255492,"threshold_uncertainty_score":0.2619565},"labels":[],"label_agreement":null},{"id":"W2015157017","doi":"10.1109/twc.2015.2403330","title":"On Achievable SNR Region for Multi-User Multi-Carrier Asynchronous Bidirectional Relay Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transceiver; Relay; Subcarrier; Beamforming; Computer science; Asynchronous communication; Signal-to-noise ratio (imaging); SIGNAL (programming language); Computer network; Electronic engineering; Topology (electrical circuits); Power (physics); Telecommunications; Wireless; Electrical engineering; Orthogonal frequency-division multiplexing; Engineering; Physics","score_opus":0.11091211863363154,"score_gpt":0.32306184875854305,"score_spread":0.2121497301249115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015157017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007613083,0.0005360002,0.9928076,0.0030630233,0.0008840798,0.0008018173,0.000024708304,0.00051254756,0.0006088737],"genre_scores_gemma":[0.8782115,0.0018720118,0.11476729,0.00088668405,0.000053321328,0.0008990022,0.000034415687,0.000056320914,0.003219429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764156,0.0005789642,0.00051331753,0.00054685306,0.0002878564,0.0004314704],"domain_scores_gemma":[0.99427277,0.000870673,0.00019803047,0.0037828109,0.0005766182,0.0002990705],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00058750506,0.00033409946,0.00031522007,0.00030650725,0.0016777611,0.00022291712,0.0026997703,0.00020886768,0.000013619757],"category_scores_gemma":[0.000044631553,0.00034553214,0.00022773341,0.00091585226,0.00022146537,0.0005584921,0.00005326235,0.0008273268,0.000071130264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002333696,0.0049372604,0.00009619142,0.000019429533,0.00033345356,0.0000035429273,0.0029554362,0.6568087,0.0003801078,0.13832362,0.008919052,0.18698987],"study_design_scores_gemma":[0.0020197164,0.00023395092,0.00010560719,0.00009554901,0.000029976358,0.00001645878,0.00007528733,0.9692872,0.0006410256,0.00010663709,0.026968587,0.00041995858],"about_ca_topic_score_codex":0.00003221167,"about_ca_topic_score_gemma":0.000576455,"teacher_disagreement_score":0.8780404,"about_ca_system_score_codex":0.00038110217,"about_ca_system_score_gemma":0.0002479672,"threshold_uncertainty_score":0.9998997},"labels":[],"label_agreement":null},{"id":"W2015292074","doi":"10.1186/1687-1499-2011-120","title":"Two-way relaying using constant envelope modulation and phase-superposition-phase-forward","year":2011,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rayleigh fading; Relay; Computer science; Phase (matter); Transmission (telecommunications); Modulation (music); Superposition principle; Phase-shift keying; Topology (electrical circuits); Control theory (sociology); Bit error rate; Fading; Electronic engineering; Power (physics); Telecommunications; Channel (broadcasting); Physics; Electrical engineering; Acoustics; Engineering","score_opus":0.12568303085487825,"score_gpt":0.33838387701040396,"score_spread":0.2127008461555257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015292074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40882987,0.011261484,0.5721894,0.0010787868,0.00045043838,0.00035215213,0.0000032643518,0.00015391453,0.00568072],"genre_scores_gemma":[0.92155135,0.023806619,0.054096963,0.00037104214,0.00012290505,0.000009769806,0.000006799393,0.000022271766,0.00001231089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978652,0.00064680754,0.0006208826,0.00030844982,0.00022551413,0.0003331422],"domain_scores_gemma":[0.9976433,0.00035264585,0.00038792827,0.0011674806,0.00022337685,0.00022525345],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010573867,0.0002488107,0.0002962346,0.00024741198,0.0023857604,0.00047959492,0.0011012186,0.00007204412,0.000015258449],"category_scores_gemma":[0.000017022272,0.0002370705,0.00006905043,0.0005222616,0.00022168926,0.00083478185,0.00074099615,0.00071122404,0.0000032825667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049305494,0.00032229398,0.0015797864,0.000006229493,0.000082806444,0.000014323515,0.0038766768,0.00013985155,0.0042162323,0.091458514,0.000041984145,0.898212],"study_design_scores_gemma":[0.00254657,0.000292179,0.0007388542,0.0005416403,0.000036382335,0.0004932312,0.00017889918,0.98762256,0.00021031455,0.002007459,0.004898632,0.00043330513],"about_ca_topic_score_codex":0.000006529802,"about_ca_topic_score_gemma":0.000014124579,"teacher_disagreement_score":0.98748267,"about_ca_system_score_codex":0.00009159892,"about_ca_system_score_gemma":0.000065926855,"threshold_uncertainty_score":0.998913},"labels":[],"label_agreement":null},{"id":"W2015348377","doi":"10.1049/iet-com.2014.0232","title":"Low‐complexity amplify‐and‐forward relaying protocol for non‐coherent chaos‐based communication system","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Hôpital Notre-Dame; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Node (physics); Scheme (mathematics); Keying; Energy (signal processing); Power (physics); Telecommunications; Electronic engineering; Mathematics","score_opus":0.1186391054477795,"score_gpt":0.35949130293284765,"score_spread":0.24085219748506814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015348377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016935634,0.00008469041,0.9333931,0.00874212,0.00006846541,0.046929482,0.000010605826,0.0005862706,0.01001589],"genre_scores_gemma":[0.59040445,0.000057138586,0.22773044,0.0006417087,0.00003702142,0.18094225,0.000076659904,0.00003023153,0.00008011816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975282,0.0008806716,0.0006289404,0.00039932266,0.00022174472,0.00034110658],"domain_scores_gemma":[0.9910333,0.0012367931,0.00036859224,0.0067541627,0.00044051016,0.00016662358],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015262999,0.00026015862,0.00032972926,0.0001521734,0.0018827865,0.00037915586,0.0047013494,0.00011960529,0.0000091507945],"category_scores_gemma":[0.00017295478,0.00025895637,0.00011450786,0.00047528977,0.0003098842,0.00043316177,0.0019406741,0.00044503895,0.00003593878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022273716,0.0003286842,0.00025878055,0.00024496994,0.000030278512,8.192496e-8,0.0010155836,0.00016612318,0.00056441914,0.9366358,0.0021921333,0.058540855],"study_design_scores_gemma":[0.0016476928,0.00011986188,0.0012922327,0.00048032726,0.000016052074,0.0000049049604,0.00010985497,0.84031814,0.00042963438,0.0022726804,0.15291974,0.00038885622],"about_ca_topic_score_codex":0.000025053936,"about_ca_topic_score_gemma":0.00018915435,"teacher_disagreement_score":0.9343631,"about_ca_system_score_codex":0.00015946943,"about_ca_system_score_gemma":0.00010817483,"threshold_uncertainty_score":0.9999863},"labels":[],"label_agreement":null},{"id":"W2015393887","doi":"10.1109/glocom.2013.6831678","title":"Receiver design for alternate-relaying cooperative systems with multiple antennas at the destination","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Network packet; Exploit; Algorithm; Bandwidth (computing); Node (physics); Detector; Computer network; Telecommunications; Engineering","score_opus":0.06255740347786809,"score_gpt":0.26696624991772283,"score_spread":0.20440884643985474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015393887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011014133,0.00027658514,0.98409766,0.0014934902,0.00013472479,0.001337674,6.0973116e-7,0.00011771503,0.0015273792],"genre_scores_gemma":[0.9542386,0.00009487433,0.03984303,0.0003889647,0.000029239302,0.0005111561,0.0000037465813,0.000010207085,0.004880203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989972,0.00024416074,0.00017257498,0.0002484326,0.00014111683,0.00019649678],"domain_scores_gemma":[0.9978713,0.0009032929,0.00008915845,0.000500629,0.0005852258,0.00005043007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040786868,0.0001229751,0.000110491,0.000037688314,0.0006598405,0.00038393406,0.00068147806,0.000027027194,0.000035574394],"category_scores_gemma":[0.00010468873,0.00006795494,0.000024295103,0.00025466608,0.000057705965,0.0005658958,0.00021064826,0.00008368985,0.000090822745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024274772,0.00038356835,0.010849331,0.0000745712,0.00042608753,0.000011056567,0.014261022,0.261891,0.06004441,0.34895048,0.09225556,0.21061018],"study_design_scores_gemma":[0.00048628377,0.00011525692,0.0006572633,0.000038456004,0.000003762231,0.000019823265,0.00009089721,0.9942694,0.0022141621,0.000060938408,0.0019027141,0.00014109374],"about_ca_topic_score_codex":0.000055712455,"about_ca_topic_score_gemma":0.000084071,"teacher_disagreement_score":0.94425464,"about_ca_system_score_codex":0.00008542363,"about_ca_system_score_gemma":0.000037080987,"threshold_uncertainty_score":0.5075026},"labels":[],"label_agreement":null},{"id":"W2015492054","doi":"10.1109/chinasip.2013.6625373","title":"Power Allocation in training for two-way amplify-and-forward relay network","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Node (physics); Channel state information; Power (physics); Channel (broadcasting); Scheme (mathematics); Training (meteorology); Relay channel; Computer network; Telecommunications; Wireless; Engineering; Mathematics","score_opus":0.050876482132789655,"score_gpt":0.2949038260082233,"score_spread":0.24402734387543362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015492054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014847885,0.00037189832,0.9648834,0.005136928,0.00017546966,0.0005047959,1.765288e-7,0.00012217781,0.013957271],"genre_scores_gemma":[0.91426814,0.00009261166,0.08335935,0.0014334777,0.000043969518,0.00013883825,0.0000031516286,0.0000067422448,0.00065372646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915564,0.0000766162,0.0002169311,0.00022994482,0.00007600937,0.0002448584],"domain_scores_gemma":[0.9991462,0.0002735355,0.00004697817,0.00038350027,0.00008495404,0.00006483747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049518136,0.00009218996,0.00012246202,0.0000559265,0.00014347403,0.00016750234,0.000420192,0.000039618455,0.000084312174],"category_scores_gemma":[0.0000505754,0.00008143063,0.00002592116,0.0002905507,0.00002377505,0.00044908817,0.00018926854,0.000114046554,0.000033052056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042110573,0.000027093149,0.00075443694,0.0000032168914,0.000011544791,2.6265744e-7,0.0035809616,0.0026851809,0.00055372476,0.70250636,0.0077694613,0.2821035],"study_design_scores_gemma":[0.0011669138,0.00010862202,0.015711395,0.00006225991,0.0000028541697,0.0000059819563,0.00025977613,0.92386276,0.00013153571,0.010986882,0.047310114,0.00039088444],"about_ca_topic_score_codex":0.000013755076,"about_ca_topic_score_gemma":0.000107212705,"teacher_disagreement_score":0.9211776,"about_ca_system_score_codex":0.000026993628,"about_ca_system_score_gemma":0.000026050824,"threshold_uncertainty_score":0.33206448},"labels":[],"label_agreement":null},{"id":"W2015553615","doi":"10.1186/1687-6180-2012-251","title":"Doubly selective channel estimation for amplify-and-forward relay networks","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Estimator; Channel (broadcasting); Relay; Computer science; Algorithm; Mean squared error; Bit error rate; Minimum mean square error; Sequence (biology); Basis (linear algebra); Exponential function; Computational complexity theory; Telecommunications; Mathematics; Statistics","score_opus":0.03399911896842289,"score_gpt":0.32874617059190525,"score_spread":0.29474705162348236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015553615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016285883,0.018940605,0.9776373,0.0005149116,0.00026963357,0.00018307417,3.2841476e-7,0.000049480717,0.0007761045],"genre_scores_gemma":[0.9540858,0.0021122934,0.042889733,0.0005252282,0.00031243256,0.000027158567,0.0000016228595,0.000014498037,0.000031207237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862653,0.00015908296,0.00037168583,0.00021643323,0.00021029654,0.0004159635],"domain_scores_gemma":[0.99885845,0.00036327535,0.0003058958,0.00013606028,0.00018388277,0.00015242606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011589398,0.00017370177,0.00020383058,0.0001809484,0.0005929149,0.00029094872,0.00043251412,0.00006118854,0.0000036529866],"category_scores_gemma":[0.000103794206,0.00014890448,0.000043290012,0.0005038574,0.00004828045,0.0030551217,0.00009511365,0.0005766558,0.0000028048598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068617126,0.00007259642,0.0005067684,0.000018880379,0.0000064451892,0.000001596102,0.0012944676,0.15786037,0.000057152698,0.005286335,0.00008555124,0.83474123],"study_design_scores_gemma":[0.0007962362,0.00020473485,0.0010880991,0.00037683014,0.000006917203,0.0001161111,0.00006494247,0.9867838,0.00027398535,0.003937722,0.0060750255,0.00027561415],"about_ca_topic_score_codex":1.3289733e-7,"about_ca_topic_score_gemma":0.0000017628007,"teacher_disagreement_score":0.95245725,"about_ca_system_score_codex":0.00012284164,"about_ca_system_score_gemma":0.000053196458,"threshold_uncertainty_score":0.60721487},"labels":[],"label_agreement":null},{"id":"W2016089181","doi":"10.1109/vtcfall.2012.6399193","title":"Threshold-Triggered Selective Phase-Forward of Differential PSK in Cooperative Communication","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Phase-shift keying; Transmission (telecommunications); Computer science; Modulation (music); Distortion (music); Quantization (signal processing); Differential coding; Amplifier; Bit error rate; Topology (electrical circuits); Control theory (sociology); Electronic engineering; Telecommunications; Mathematics; Algorithm; Decoding methods; Physics; Bandwidth (computing); Engineering","score_opus":0.043301759327840486,"score_gpt":0.3199039369717228,"score_spread":0.27660217764388234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016089181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41206598,0.002417012,0.54799974,0.001058853,0.0002134672,0.00065979606,0.0000038577946,0.00016523711,0.035416063],"genre_scores_gemma":[0.99355054,0.00058926607,0.005492984,0.000110287336,0.000021780255,0.000033620352,0.000010841133,0.0000064678675,0.00018420616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987477,0.00031688157,0.0003472429,0.00016622813,0.00016726513,0.0002546979],"domain_scores_gemma":[0.9985987,0.00018208755,0.00011446807,0.0008096622,0.00021891984,0.000076165205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039280212,0.00013063764,0.00023684834,0.00015294879,0.00013058052,0.000048189664,0.0009776189,0.00005557608,0.00011641162],"category_scores_gemma":[0.000041836258,0.000112919995,0.000051663723,0.00078727136,0.00007561408,0.0007433537,0.0004803444,0.00021956653,0.000019211682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078761674,0.0023240189,0.012268969,0.000013792616,0.00009791967,5.1752016e-7,0.014048992,0.0002735821,0.025794933,0.8429006,0.0025110596,0.09968688],"study_design_scores_gemma":[0.011615915,0.0007492616,0.07543045,0.00027121475,0.000045376706,0.000016883068,0.00082501717,0.6701407,0.23044214,0.0029732399,0.0059980256,0.0014917973],"about_ca_topic_score_codex":0.000014892402,"about_ca_topic_score_gemma":0.000104516024,"teacher_disagreement_score":0.8399273,"about_ca_system_score_codex":0.00007286839,"about_ca_system_score_gemma":0.000052608804,"threshold_uncertainty_score":0.46047437},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science","score_opus":0.10484732654309496,"score_gpt":0.3769582704969661,"score_spread":0.27211094395387114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016312880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011782162,0.00023470337,0.4887358,0.46326777,0.0009919226,0.00018594584,0.000008444619,0.00017266413,0.0346206],"genre_scores_gemma":[0.95719814,0.00012070118,0.02478593,0.015186342,0.0004271472,0.00001176286,0.000021031528,0.0000097101965,0.0022392047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983546,0.00020617446,0.00038247646,0.00030487933,0.00056120334,0.00019064402],"domain_scores_gemma":[0.9975913,0.00085376884,0.00028662512,0.0006404011,0.00057601125,0.00005184901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006868031,0.00013466897,0.0001856507,0.000068471294,0.00012699261,0.00026604248,0.0012253844,0.00007195487,0.00010198474],"category_scores_gemma":[0.00014253343,0.00013352935,0.00008253825,0.0005142141,0.000038026406,0.00049257034,0.0004115693,0.00023834419,0.000049682898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003153094,0.00017731829,0.0007027345,0.000009797281,0.000037518043,0.0000018919388,0.0002377434,0.00071616686,0.00042751382,0.9654897,0.02403728,0.0081307925],"study_design_scores_gemma":[0.002517456,0.00011841132,0.07173222,0.00079524686,0.000022676173,0.00002766426,0.0003873508,0.28267974,0.004052586,0.086199574,0.5501182,0.0013488831],"about_ca_topic_score_codex":0.000043064327,"about_ca_topic_score_gemma":0.00021821434,"teacher_disagreement_score":0.94541603,"about_ca_system_score_codex":0.000058968413,"about_ca_system_score_gemma":0.000046152716,"threshold_uncertainty_score":0.5445169},"labels":[],"label_agreement":null},{"id":"W2016683006","doi":"10.1109/itw.2011.6089572","title":"On the generalization of decode-and-forward and compress-and-forward for Gaussian relay channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Generalization; Gaussian; Relay; Topology (electrical circuits); Computer science; Scheme (mathematics); Algorithm; Mathematics; Combinatorics; Physics; Mathematical analysis; Power (physics)","score_opus":0.07196603899773912,"score_gpt":0.27609146152405145,"score_spread":0.20412542252631233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016683006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0513442,0.0005785099,0.93968576,0.0025920505,0.0001075806,0.00038493492,0.0000019494744,0.000050118968,0.005254873],"genre_scores_gemma":[0.9792376,0.00095219293,0.018608928,0.0007825881,0.000015059628,0.000029313002,0.0000017557413,0.000005693668,0.0003668753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993941,0.000080003374,0.00016196733,0.00018129076,0.000073320814,0.00010929235],"domain_scores_gemma":[0.9992559,0.00020294993,0.00006854873,0.00034750605,0.000073834155,0.000051244027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003153782,0.00008746394,0.000118820746,0.000048385577,0.00020438958,0.000057917496,0.00030299192,0.00003360547,0.000023702229],"category_scores_gemma":[0.000039386785,0.00005612599,0.000022593322,0.000109525434,0.000074285235,0.00014683312,0.00025985387,0.000053745916,0.0000011982211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010071826,0.000017468788,0.00032404246,0.000007810139,0.000014382561,8.869394e-8,0.0020579982,0.00003888968,0.00018580764,0.9779561,0.00090295647,0.01848434],"study_design_scores_gemma":[0.0009248121,0.00039166663,0.006862112,0.0000952531,0.000022323298,0.0000089520445,0.000130091,0.9438531,0.011511457,0.027552655,0.008316199,0.00033138465],"about_ca_topic_score_codex":0.000009343498,"about_ca_topic_score_gemma":0.000026883488,"teacher_disagreement_score":0.9504035,"about_ca_system_score_codex":0.0000053140866,"about_ca_system_score_gemma":0.000009564594,"threshold_uncertainty_score":0.22887515},"labels":[],"label_agreement":null},{"id":"W2016755560","doi":"10.1007/s11277-013-1115-y","title":"A Two-Way MIMO Relaying Scheme with Partial Channel State Information","year":2013,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Channel state information; MIMO; Channel (broadcasting); Precoding; Block (permutation group theory); Lagrange multiplier; Scheme (mathematics); Multiplier (economics); Mathematical optimization; Wireless; Telecommunications; Mathematics","score_opus":0.03911372216403112,"score_gpt":0.2711581161934786,"score_spread":0.23204439402944751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016755560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18975793,0.0019143384,0.7246408,0.046045944,0.00024354902,0.0017780195,0.000022923487,0.0012208879,0.03437563],"genre_scores_gemma":[0.94881445,0.00069766655,0.048843935,0.0010297045,0.000022881995,0.0003463516,0.000053787076,0.00001247119,0.00017873908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985426,0.0002586968,0.00036098782,0.00020607293,0.00030170384,0.00032990202],"domain_scores_gemma":[0.9969187,0.00020617829,0.00020007722,0.0020348344,0.00048814848,0.00015208697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031538086,0.00019455045,0.0001816787,0.00014913207,0.0010098785,0.00052302337,0.0024652365,0.00004432514,0.000053352764],"category_scores_gemma":[0.00003105937,0.00017465102,0.000060716997,0.00070501264,0.00020077788,0.00267181,0.0011093923,0.0004571612,0.00040525416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043994398,0.00056325394,0.002601321,0.000052851567,0.00025657789,0.0000026316357,0.054940064,0.0006783969,0.0038157161,0.58057404,0.0051541924,0.35131696],"study_design_scores_gemma":[0.0008773921,0.00007666767,0.0025628323,0.00011163369,0.00000821896,0.000022875543,0.00084518327,0.9748689,0.0002594886,0.00054421416,0.019384665,0.00043793372],"about_ca_topic_score_codex":0.00014313219,"about_ca_topic_score_gemma":0.000171592,"teacher_disagreement_score":0.9741905,"about_ca_system_score_codex":0.00008820026,"about_ca_system_score_gemma":0.00014343666,"threshold_uncertainty_score":0.776727},"labels":[],"label_agreement":null},{"id":"W2016931804","doi":"10.1109/tit.2014.2313551","title":"On the Capacity of the Half-Duplex Diamond Channel Under Fixed Scheduling","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nortel Networks Inc","keywords":"Scheduling (production processes); Computer science; Topology (electrical circuits); Channel capacity; Channel (broadcasting); Coding (social sciences); Mathematical optimization; Computer network; Mathematics; Engineering; Electrical engineering","score_opus":0.030280084414875487,"score_gpt":0.2322366907169289,"score_spread":0.20195660630205342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016931804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01666439,0.000007196491,0.9756491,0.0029488713,0.00046293144,0.00019551237,0.0000033135364,0.00006990211,0.0039987485],"genre_scores_gemma":[0.9965438,0.000028713694,0.0005993918,0.0026739866,0.0000128290185,0.00003425978,6.7770725e-7,0.000004113336,0.000102187085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998863,0.00040936173,0.00027927794,0.00008650286,0.00023223365,0.00012963834],"domain_scores_gemma":[0.9980124,0.0008181835,0.0001574174,0.00084817846,0.00012964966,0.000034154637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095262233,0.00011031185,0.000095395466,0.00009711553,0.0006356232,0.00009175174,0.000864874,0.000049569462,0.00007128478],"category_scores_gemma":[0.00005068623,0.00006653334,0.00009986792,0.00040793727,0.00012075699,0.00063449756,0.000009911811,0.00031063918,0.000078594094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011978463,0.000035180088,3.9619596e-7,0.0000057442408,0.000017167793,5.79729e-9,0.0027125445,0.17060329,0.00019339679,0.8011545,0.00008468791,0.025181144],"study_design_scores_gemma":[0.0005383532,0.00009981249,0.00030306468,0.00012682646,0.000015228011,0.0000033453102,0.000490058,0.8993724,0.05053986,0.046240803,0.002024229,0.00024603782],"about_ca_topic_score_codex":0.000003603856,"about_ca_topic_score_gemma":0.000010410832,"teacher_disagreement_score":0.97987944,"about_ca_system_score_codex":0.000041321822,"about_ca_system_score_gemma":0.00003226299,"threshold_uncertainty_score":0.48887637},"labels":[],"label_agreement":null},{"id":"W2017256181","doi":"10.1109/isit.2013.6620723","title":"On uniform matroidal networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Matroid; Linear network coding; Computer science; Coding (social sciences); Theoretical computer science; Simple (philosophy); Computational complexity theory; Discrete mathematics; Mathematics; Algorithm; Computer network","score_opus":0.020185783950513878,"score_gpt":0.24511216361187277,"score_spread":0.2249263796613589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017256181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031392835,0.00005195462,0.8697246,0.0031150654,0.00013107933,0.00010551354,2.7720349e-8,0.00019759413,0.12353491],"genre_scores_gemma":[0.9799819,0.000102069724,0.013582004,0.002970202,0.000033202086,0.000017595432,8.199258e-7,0.000003472107,0.0033087553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995224,0.00003376743,0.00009316672,0.00012582204,0.000079127654,0.00014575102],"domain_scores_gemma":[0.9992421,0.00008127532,0.000020242094,0.0005407617,0.000056906836,0.00005867306],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000835556,0.00006365389,0.000055715736,0.000034157485,0.00011730298,0.00017847797,0.0006937581,0.000022716906,0.0005721441],"category_scores_gemma":[0.000009268976,0.000048724272,0.000024760508,0.00020546502,0.000014090919,0.00028787015,0.00024398032,0.00010277266,0.0008607355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.342194e-7,0.000014707785,0.000037778747,2.530493e-7,0.0000023589735,2.444923e-7,0.000035592013,0.0006422398,0.000032504533,0.8668575,0.022796469,0.10957997],"study_design_scores_gemma":[0.00012017532,0.000045839246,0.0019419944,0.0000064413753,3.9135074e-7,0.0000021802068,0.000006082928,0.98545575,0.00009053586,0.004866742,0.007356561,0.000107327054],"about_ca_topic_score_codex":0.0000057144653,"about_ca_topic_score_gemma":0.0000086044865,"teacher_disagreement_score":0.9848135,"about_ca_system_score_codex":0.000018071707,"about_ca_system_score_gemma":0.000009463596,"threshold_uncertainty_score":0.9999172},"labels":[],"label_agreement":null},{"id":"W2017258654","doi":"10.1109/icc.2010.5501867","title":"A Metrics-Based Approach for the Analysis of Two-Hop Detect-and-Forward Relay Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Relay; Computer science; Relay channel; Hop (telecommunications); Probabilistic logic; Binary number; Bit error rate; Channel (broadcasting); Topology (electrical circuits); Reliability (semiconductor); Binary symmetric channel; Algorithm; Probability density function; Decoding methods; Mathematics; Telecommunications; Channel code; Statistics; Artificial intelligence; Arithmetic","score_opus":0.048909091120999754,"score_gpt":0.3052334028771306,"score_spread":0.2563243117561308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017258654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003788907,0.0002630573,0.99382114,0.000783928,0.00008199307,0.00021594187,0.0000012742573,0.000045161123,0.0009986081],"genre_scores_gemma":[0.7993896,0.000049940063,0.20002788,0.00031110825,0.000016157166,0.000047810467,0.00000226344,0.0000032924772,0.00015192913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928796,0.000061314946,0.00018443882,0.00020387411,0.00013261377,0.00012979853],"domain_scores_gemma":[0.9979467,0.00090553076,0.00008500445,0.00082303473,0.00019132829,0.000048444792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008817965,0.00008200367,0.00018002966,0.00031925816,0.00019790675,0.00009289016,0.0008986482,0.00003399911,0.00002346196],"category_scores_gemma":[0.00016246102,0.000050970786,0.00013410184,0.002469033,0.00006126827,0.000092264134,0.00021472541,0.00013761819,7.947981e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022660706,0.00012326267,0.0010039704,0.000017999768,0.0009862469,2.1737861e-7,0.0012761683,0.05873956,0.0075006858,0.27559605,0.0007793691,0.6539538],"study_design_scores_gemma":[0.00024566238,0.000022534232,0.00032876828,9.621709e-7,0.00010428769,2.7819198e-7,0.000013305762,0.99292624,0.0031348194,0.00010357456,0.003046519,0.00007307627],"about_ca_topic_score_codex":0.000012752514,"about_ca_topic_score_gemma":0.00009823236,"teacher_disagreement_score":0.93418664,"about_ca_system_score_codex":0.0000068891463,"about_ca_system_score_gemma":0.000029216235,"threshold_uncertainty_score":0.20785283},"labels":[],"label_agreement":null},{"id":"W2017328258","doi":"10.1109/vetecf.2010.5594546","title":"Balance the Trade-Off between the Accessibility and Performance of Distributed Routing Schemes in Multi-Hop Wireless Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hop (telecommunications); Computer network; Geographic routing; Wireless; Routing (electronic design automation); Routing protocol; Dynamic Source Routing; Distributed computing; Static routing; Wireless network; Energy consumption; Telecommunications; Engineering","score_opus":0.0367519530030982,"score_gpt":0.2930925448059299,"score_spread":0.2563405918028317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017328258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82540363,0.00019967459,0.17224196,0.001826654,0.00006109932,0.00015535337,0.0000011426346,0.00003237276,0.00007809422],"genre_scores_gemma":[0.9972733,0.00035165437,0.0021954258,0.00012073251,0.000030728475,0.00001089623,0.0000026986468,0.0000032935839,0.000011248452],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905735,0.00015815075,0.00028036043,0.00020829806,0.00010848118,0.00018732942],"domain_scores_gemma":[0.9985197,0.0005071621,0.00010997403,0.00078043377,0.00004971625,0.00003296888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010626969,0.00009998875,0.00014761141,0.000017341816,0.0002920778,0.000111861365,0.001366807,0.00004968615,0.000005503763],"category_scores_gemma":[0.00006733655,0.00005434546,0.000025381183,0.00048896717,0.0001921403,0.00030825366,0.000597362,0.0004902468,4.2848393e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034853622,0.000025749348,0.7461619,0.0000046588384,0.0000062571003,1.0355761e-7,0.00047788097,0.00009460215,0.00032506618,0.0050190175,0.000021725204,0.24785957],"study_design_scores_gemma":[0.00011953228,0.0000062008867,0.47293475,0.000012397691,0.0000011206844,4.9376837e-7,0.000017863182,0.5263102,0.00041020906,0.000008028076,0.00013487725,0.000044340315],"about_ca_topic_score_codex":0.000009315435,"about_ca_topic_score_gemma":0.00017267611,"teacher_disagreement_score":0.5262156,"about_ca_system_score_codex":0.000010389388,"about_ca_system_score_gemma":0.000026880232,"threshold_uncertainty_score":0.25398904},"labels":[],"label_agreement":null},{"id":"W2017547849","doi":"10.1109/icassp.2010.5496052","title":"OFDM amplify-and-forward two-way relaying for MIMO multiuser networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Subcarrier; MIMO; Upper and lower bounds; Beamforming; Transmission (telecommunications); Orthogonal frequency-division multiplexing; Precoding; Computer network; Signal-to-noise ratio (imaging); Node (physics); Topology (electrical circuits); Electronic engineering; Telecommunications; Mathematics; Channel (broadcasting); Engineering; Electrical engineering","score_opus":0.03130215936034319,"score_gpt":0.29662066981857266,"score_spread":0.26531851045822946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017547849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012439748,0.0001680634,0.9791005,0.0017754554,0.0005411547,0.00027981857,5.831906e-7,0.00021789005,0.005476791],"genre_scores_gemma":[0.84192944,0.00017551822,0.15514451,0.001365284,0.00014179495,0.00005192449,0.0000037223892,0.000011710326,0.0011760695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990596,0.00004974578,0.00021074132,0.00031398356,0.00009260879,0.00027333174],"domain_scores_gemma":[0.99852455,0.00041160602,0.00006029926,0.00075471326,0.0001286802,0.00012015187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050815736,0.00013136522,0.00014523864,0.000056215595,0.0003835388,0.00022790126,0.0007682429,0.00007647089,0.00004944241],"category_scores_gemma":[0.00008519758,0.000111330766,0.000054481556,0.00020472774,0.000051717816,0.00033908183,0.00049458427,0.0003328277,0.000017521881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009401228,0.000044338,0.0015232685,0.000005948307,0.000024086086,8.4413216e-7,0.00063263223,0.00046210948,0.0039451793,0.68020135,0.0059457016,0.30720517],"study_design_scores_gemma":[0.0006814019,0.000031530704,0.0013406276,0.000011555177,0.0000051140046,0.0000073773313,0.000020164263,0.9127953,0.00044409488,0.00081021694,0.08361977,0.00023281206],"about_ca_topic_score_codex":0.000009308046,"about_ca_topic_score_gemma":0.00026184195,"teacher_disagreement_score":0.91233325,"about_ca_system_score_codex":0.000010516286,"about_ca_system_score_gemma":0.000020083564,"threshold_uncertainty_score":0.4539937},"labels":[],"label_agreement":null},{"id":"W2017620294","doi":"10.1117/12.538822","title":"&lt;title&gt;CodedStream: live media streaming with overlay coded multicast&lt;/title&gt;","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Xcast; Pragmatic General Multicast; Protocol Independent Multicast; Overlay multicast; Distance Vector Multicast Routing Protocol; IP multicast; Reliable multicast; Distributed computing","score_opus":0.015668251954363575,"score_gpt":0.23186653095317272,"score_spread":0.21619827899880914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017620294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8961659,0.0004811854,0.001978059,0.0014821243,0.0004103751,0.00042808318,0.000019382702,0.00018635528,0.09884853],"genre_scores_gemma":[0.66404474,0.0005298392,0.33336538,0.00015817763,0.00026955825,0.000072738476,0.000007607909,0.000057571957,0.0014943964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988019,4.565961e-8,0.00029632388,0.00025947572,0.0004043916,0.00023789886],"domain_scores_gemma":[0.9986732,0.00014900143,0.0001629934,0.00009304382,0.00083422934,0.0000875583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030042874,0.00018999403,0.0002153924,0.00006236099,0.00007688716,0.00010760722,0.0008550035,0.00009072468,0.00008754431],"category_scores_gemma":[0.00032511444,0.00015067506,0.00018781594,0.0002798299,0.00011984789,0.00029837684,0.00014884915,0.00020237331,0.000021149679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008880263,0.000060372942,0.00005179224,0.000048456604,0.00012612202,1.3444715e-7,0.0002807119,0.000033614728,0.047092885,0.94305545,0.0072857575,0.001955849],"study_design_scores_gemma":[0.0042542056,0.00084307895,0.001749237,0.0015839749,0.0003344221,0.000111869675,0.0015296895,0.47904357,0.13411057,0.0057558413,0.36853847,0.0021450617],"about_ca_topic_score_codex":7.809207e-7,"about_ca_topic_score_gemma":3.2979406e-7,"teacher_disagreement_score":0.9372996,"about_ca_system_score_codex":0.00008737878,"about_ca_system_score_gemma":0.00004250078,"threshold_uncertainty_score":0.6144351},"labels":[],"label_agreement":null},{"id":"W2017737452","doi":"10.1016/j.comcom.2004.08.015","title":"Markov chain analysis of collaborative codes in random multi access communication systems","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Aloha; Computer science; Asynchronous communication; Markov chain; Random access; Transmission (telecommunications); Computer network; Synchronizing; Throughput; Real-time computing; Telecommunications; Wireless","score_opus":0.060390661011432985,"score_gpt":0.3395680111710763,"score_spread":0.27917735015964334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017737452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008064406,0.008298536,0.9778289,0.003292644,0.000123709,0.0007785128,0.000022349483,0.00016516855,0.001425781],"genre_scores_gemma":[0.8195759,0.006182693,0.17373505,0.00018442092,0.000009512918,0.00016287326,0.00011493082,0.000010913956,0.000023708644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968196,0.0014173867,0.00090022775,0.00035942037,0.0002464309,0.00025690466],"domain_scores_gemma":[0.9920295,0.00097612635,0.0004644183,0.005743298,0.0006929598,0.00009372014],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011609062,0.00022719619,0.00065634964,0.001031023,0.0004170873,0.0003683024,0.00799884,0.00009544119,0.000005999627],"category_scores_gemma":[0.00007978042,0.00023538344,0.00015605628,0.006599704,0.00029467675,0.00085550407,0.0036661697,0.00037095087,0.0000073721203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033901833,0.0015160205,0.009644902,0.000030545536,0.0010845294,0.0000026040298,0.013626149,0.30587965,0.00028047347,0.64127725,0.00030968478,0.02631427],"study_design_scores_gemma":[0.0022175005,0.000034666857,0.034511834,0.00018649643,0.00009541153,0.0000020875823,0.00015215625,0.96013707,0.00007481706,0.00035762604,0.0019362278,0.00029409016],"about_ca_topic_score_codex":0.00026678975,"about_ca_topic_score_gemma":0.002663783,"teacher_disagreement_score":0.81151146,"about_ca_system_score_codex":0.00020774156,"about_ca_system_score_gemma":0.00024933976,"threshold_uncertainty_score":0.99736834},"labels":[],"label_agreement":null},{"id":"W2018225121","doi":"10.1109/isit.2007.4557369","title":"A Multimessage Capacity Region for Undirected Ring Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Unicast; Multicast; Routing (electronic design automation); Computer science; Enhanced Data Rates for GSM Evolution; Ring (chemistry); Set (abstract data type); Simple (philosophy); Extension (predicate logic); Topology (electrical circuits); Undirected graph; Computer network; Mathematics; Combinatorics; Discrete mathematics; Distributed computing; Theoretical computer science; Graph; Telecommunications","score_opus":0.0709669057438666,"score_gpt":0.29191985883591576,"score_spread":0.22095295309204915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018225121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003330101,0.00012322926,0.9829144,0.00040149424,0.00017368927,0.00020167328,8.4414324e-8,0.00030926487,0.012546105],"genre_scores_gemma":[0.8922295,0.00007265764,0.10621896,0.00045269573,0.00006727777,0.000011568083,0.0000015977294,0.000005689664,0.00094005966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992753,0.00004481464,0.00016468446,0.00020120096,0.000069545786,0.00024443175],"domain_scores_gemma":[0.9989575,0.00031820333,0.00005010467,0.00048168682,0.00012145648,0.00007101921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005482931,0.000083350154,0.00009270587,0.00005958106,0.00024552154,0.00008103821,0.00054068764,0.000045955832,0.000007828448],"category_scores_gemma":[0.000057010435,0.00007577623,0.000047450067,0.00036399855,0.000024040975,0.00021655954,0.00017435748,0.00010501539,0.0000049900536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001847405,0.0000797662,0.0008759408,0.0000066170523,0.000024185545,0.00000406643,0.0007911589,0.0007387922,0.0010013668,0.48390335,0.004099452,0.5084568],"study_design_scores_gemma":[0.00039239653,0.000025459174,0.004323378,0.000020023419,0.0000022618192,0.000006296543,0.000011980185,0.97687757,0.0014495285,0.00034921724,0.016381942,0.00015996704],"about_ca_topic_score_codex":0.000007199834,"about_ca_topic_score_gemma":0.00015549651,"teacher_disagreement_score":0.9761388,"about_ca_system_score_codex":0.000043718817,"about_ca_system_score_gemma":0.000011404958,"threshold_uncertainty_score":0.3090065},"labels":[],"label_agreement":null},{"id":"W2018476156","doi":"10.1109/isit.2012.6283071","title":"Min-cost multicast networks in Euclidean space","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Xcast; Pragmatic General Multicast; Multicast address; Protocol Independent Multicast; Unicast; Distributed computing; Distance Vector Multicast Routing Protocol","score_opus":0.05043679571172477,"score_gpt":0.30038153942933327,"score_spread":0.2499447437176085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018476156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063077854,0.0010861943,0.9402904,0.0031362462,0.00037966607,0.00021272701,1.3149716e-7,0.00014538354,0.048441477],"genre_scores_gemma":[0.9744904,0.00023453191,0.02355733,0.00063639897,0.000083716994,0.000013347158,0.0000011584965,0.000005223413,0.0009779066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915516,0.00011764361,0.00015608645,0.00014593845,0.00008603822,0.00033915398],"domain_scores_gemma":[0.9990779,0.00015210026,0.000030636587,0.00058362965,0.000036171652,0.00011952782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004153128,0.00008984106,0.00009882038,0.0000669582,0.00008103025,0.00007880515,0.0006371464,0.000036718448,0.000098945646],"category_scores_gemma":[0.00003934217,0.0000793135,0.000027963652,0.00046114845,0.000023501094,0.00047138095,0.0004394938,0.00016363215,0.00013099436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043889104,0.00031769162,0.043359835,0.0000029627283,0.000009225198,0.0000050642016,0.0022033686,0.0015698491,0.00019821075,0.6279343,0.008861565,0.31553358],"study_design_scores_gemma":[0.00043574793,0.000018698542,0.03480631,0.00002648535,0.0000016501899,0.00000796724,0.000059798385,0.86170644,0.00024407875,0.00008623596,0.10232539,0.00028121014],"about_ca_topic_score_codex":0.000009691385,"about_ca_topic_score_gemma":0.00014685663,"teacher_disagreement_score":0.9681826,"about_ca_system_score_codex":0.000039024624,"about_ca_system_score_gemma":0.000011765824,"threshold_uncertainty_score":0.32343104},"labels":[],"label_agreement":null},{"id":"W2018503434","doi":"10.1007/s11277-010-0174-6","title":"A Survey of Distributed Relay Selection Schemes in Cooperative Wireless Ad hoc Networks","year":2010,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Cooperative diversity; Computer network; Relay channel; Selection (genetic algorithm); Wireless; Transmission (telecommunications); MIMO; Antenna diversity; Wireless ad hoc network; Node (physics); Transmitter; Channel (broadcasting); Distributed computing; Telecommunications; Fading","score_opus":0.04737057116960437,"score_gpt":0.3060006424950873,"score_spread":0.25863007132548294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018503434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76494014,0.0044146148,0.22615723,0.0029302991,0.00023854314,0.0005513254,0.000071545124,0.00021974999,0.00047656553],"genre_scores_gemma":[0.98872954,0.0044592284,0.0062246583,0.0001119471,0.000016084736,0.00010388677,0.00026865257,0.000018250312,0.00006777105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974946,0.0009810579,0.00056877,0.00037396114,0.0002529803,0.00032867864],"domain_scores_gemma":[0.99588543,0.000986399,0.00026220674,0.0018544107,0.0008953992,0.00011616021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012124783,0.00023148027,0.00036722588,0.00019510972,0.000558996,0.0001286008,0.0029395227,0.00017434363,0.00003546316],"category_scores_gemma":[0.00021995344,0.00024098171,0.00007997675,0.0023461366,0.00039767555,0.00048802356,0.0010798727,0.0012828836,0.000009975137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021581388,0.003299312,0.15662819,0.000057055502,0.00033399058,0.0000054165557,0.013362291,0.0049962467,0.047470495,0.32886678,0.0022180132,0.4425464],"study_design_scores_gemma":[0.0005099333,0.000056502835,0.11704056,0.00006975115,0.0000059822705,0.0000071282707,0.00010074913,0.8782755,0.00040449918,0.000021117823,0.0032283566,0.00027989442],"about_ca_topic_score_codex":0.00013160601,"about_ca_topic_score_gemma":0.021870298,"teacher_disagreement_score":0.8732793,"about_ca_system_score_codex":0.00009276709,"about_ca_system_score_gemma":0.00028954563,"threshold_uncertainty_score":0.995978},"labels":[],"label_agreement":null},{"id":"W2018822015","doi":"10.1109/glocom.2012.6503850","title":"Opportunistic scheduling in dual-hop multiuser relay networks in the presence of co-channel interference","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Outage probability; Relay; Co-channel interference; Computer science; Interference (communication); Scheduling (production processes); Computer network; Hop (telecommunications); Channel (broadcasting); Dual (grammatical number); Relay channel; Single antenna interference cancellation; Topology (electrical circuits); Fading; Mathematics; Mathematical optimization; Engineering; Physics; Electrical engineering","score_opus":0.09527781068218759,"score_gpt":0.32390132889771145,"score_spread":0.22862351821552385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018822015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076002434,0.0009864093,0.9146527,0.0010839106,0.00024921645,0.00030124368,4.845919e-7,0.000046000063,0.0066776127],"genre_scores_gemma":[0.9936455,0.00052417134,0.005268878,0.00038085072,0.00003094489,0.00002507764,0.000001919213,0.000004507931,0.00011817786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986199,0.0004057138,0.000351649,0.00017565905,0.0001496749,0.00029740605],"domain_scores_gemma":[0.9983675,0.00069975347,0.00009076742,0.0007218015,0.00006231259,0.00005789613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015245663,0.00010791595,0.0001498248,0.00010783316,0.000066206114,0.00005430719,0.0009514562,0.00005069409,0.0000273879],"category_scores_gemma":[0.00019570864,0.000077598306,0.000028465889,0.0006032131,0.00006976831,0.00047937426,0.00043964532,0.0003299857,0.0000094852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005740199,0.0013597193,0.072276585,0.000052933174,0.000032685184,0.000038756618,0.065384395,0.13731644,0.0018234486,0.65890783,0.0019717012,0.060778104],"study_design_scores_gemma":[0.00022343085,0.000025568223,0.011983756,0.00011480551,0.0000012846765,0.000007906904,0.00045444077,0.9865279,0.00012544663,0.00011132903,0.0002991994,0.00012490473],"about_ca_topic_score_codex":0.000028658977,"about_ca_topic_score_gemma":0.00017591388,"teacher_disagreement_score":0.917643,"about_ca_system_score_codex":0.00002619131,"about_ca_system_score_gemma":0.000033871027,"threshold_uncertainty_score":0.3164367},"labels":[],"label_agreement":null},{"id":"W2019319094","doi":"10.1109/iccnc.2014.6785332","title":"Joint network channel fountain scheme for reliable communication in wireless networks","year":2014,"lang":"en","type":"article","venue":"2014 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; École de Technologie Supérieure","funders":"","keywords":"Linear network coding; Computer science; Computer network; Fading; Fountain code; Channel (broadcasting); Wireless network; Transmitter; Binary erasure channel; Relay; Coding (social sciences); Channel state information; Wireless; Decoding methods; Bit error rate; Transmission (telecommunications); Data transmission; Channel capacity; Telecommunications; Block code; Concatenated error correction code","score_opus":0.07965022580115572,"score_gpt":0.3098904738972154,"score_spread":0.2302402480960597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019319094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027596676,0.0021304775,0.9466895,0.013178176,0.0010204907,0.00080888765,0.000003326085,0.00036827874,0.033041213],"genre_scores_gemma":[0.94196135,0.008855767,0.04671414,0.0014191658,0.00043179994,0.00016570346,0.00014845456,0.000034343142,0.0002692698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968991,0.00069058925,0.0008504397,0.00065434765,0.00030642227,0.00059907243],"domain_scores_gemma":[0.9948914,0.00102886,0.0005388679,0.0028349664,0.00055791374,0.00014797435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026657907,0.00036977662,0.0004567739,0.00026063743,0.001115093,0.00064674555,0.0041977405,0.00018229877,0.00001588155],"category_scores_gemma":[0.00009668249,0.00040097153,0.000117968964,0.00054566254,0.0002301233,0.0003546531,0.0022870407,0.0008109709,0.000019083524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002461761,0.000141005,0.0011019893,0.000009208526,0.000042879394,2.9272417e-7,0.00038969406,0.010888135,0.00002355162,0.9077378,0.0058811484,0.073759675],"study_design_scores_gemma":[0.00080664875,0.000098086166,0.0017110661,0.0006075098,0.0000070505184,0.0000069127655,0.000054207583,0.94242114,0.0000065945887,0.01795009,0.035927866,0.00040282548],"about_ca_topic_score_codex":0.000055325298,"about_ca_topic_score_gemma":0.0002957858,"teacher_disagreement_score":0.9392017,"about_ca_system_score_codex":0.0001588958,"about_ca_system_score_gemma":0.00008448307,"threshold_uncertainty_score":0.9998442},"labels":[],"label_agreement":null},{"id":"W2020098995","doi":"10.1109/vetecs.2012.6240339","title":"Performance Analysis and Power Allocation of Multi-Hop Multi-Branch Relays with Data Storage over Generalized Fading Channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Fading; Computer science; Hop (telecommunications); Channel (broadcasting); Transmitter power output; Computer network; Relay channel; Software deployment; Optimization problem; Power (physics); Electronic engineering; Algorithm; Engineering; Transmitter","score_opus":0.07574418289819088,"score_gpt":0.30573391350624274,"score_spread":0.22998973060805186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020098995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37395114,0.00045330334,0.6252021,0.00007665831,0.00006249501,0.00011839263,0.0000016635779,0.000036677746,0.00009758788],"genre_scores_gemma":[0.8973151,0.000538831,0.10161236,0.00014260906,0.00001753119,0.000010240327,0.000019038238,0.0000066110006,0.00033769215],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902564,0.00011075538,0.00021725516,0.0002810589,0.00016154593,0.00020375077],"domain_scores_gemma":[0.9983288,0.000059395108,0.00012447874,0.001277039,0.00012314052,0.00008716781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057713315,0.00012458519,0.00020713148,0.0001787661,0.00015320459,0.000063462394,0.00078993494,0.00003792234,0.00004577643],"category_scores_gemma":[0.000019618185,0.000096877025,0.00002615753,0.0009093666,0.00004703857,0.0016662045,0.0005173215,0.0000940103,0.000004098947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011876787,0.0015889003,0.66359746,0.00012539419,0.0022368925,0.0000023234268,0.03269259,0.046064988,0.06846352,0.016814528,0.0012994795,0.16699514],"study_design_scores_gemma":[0.00056116417,0.000021500484,0.076377496,0.000015822494,0.00004226855,0.000001695287,0.000018235802,0.9206901,0.0014690228,3.585374e-7,0.00065821706,0.00014412707],"about_ca_topic_score_codex":0.000023695891,"about_ca_topic_score_gemma":0.0000648586,"teacher_disagreement_score":0.8746251,"about_ca_system_score_codex":0.000021579088,"about_ca_system_score_gemma":0.00001899289,"threshold_uncertainty_score":0.39505303},"labels":[],"label_agreement":null},{"id":"W2020139201","doi":"10.1109/twc.2014.022714.131351","title":"Impact of Propagation Environment on Energy-Efficient Relay Placement: Model and Performance Analysis","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Relay; Telecommunications link; Relay channel; Computer science; Linear network coding; Efficient energy use; Coding (social sciences); Energy (signal processing); Node (physics); Computer network; Power (physics); Electronic engineering; Electrical engineering; Engineering; Mathematics; Statistics; Physics","score_opus":0.028601961149851914,"score_gpt":0.26412659066059524,"score_spread":0.23552462951074332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020139201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16931112,0.000057193378,0.8294757,0.00033239325,0.000019332158,0.00013095998,0.000007929719,0.000057547255,0.0006078447],"genre_scores_gemma":[0.9895453,0.002813793,0.007327077,0.000064277505,0.000003397722,0.00010232323,0.000010491053,0.000010577269,0.00012275997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986525,0.00030099708,0.0003534314,0.00028227246,0.0002445266,0.00016624283],"domain_scores_gemma":[0.9968497,0.00025724462,0.00017219814,0.002544311,0.000087849476,0.000088653986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033169467,0.00017330512,0.00022766793,0.00038508233,0.0006031943,0.00005205646,0.0010647291,0.000056986475,0.000013764231],"category_scores_gemma":[0.0000033315835,0.00015853776,0.0001530145,0.0007480135,0.00015049915,0.00016314251,0.00003417201,0.0002390146,0.000008159934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149349125,0.0004237671,0.00007263358,0.000003184523,0.00012890871,1.882028e-8,0.0004581712,0.9146016,0.0007772726,0.011514959,0.0000065083077,0.07199803],"study_design_scores_gemma":[0.0002763834,0.00025139636,0.0018900707,0.000030821,0.000072658746,7.1460215e-7,0.000007971237,0.99552286,0.0017139912,0.000024321374,0.000055167508,0.00015363024],"about_ca_topic_score_codex":0.000014570258,"about_ca_topic_score_gemma":0.00003501756,"teacher_disagreement_score":0.8221486,"about_ca_system_score_codex":0.00014379114,"about_ca_system_score_gemma":0.000045441277,"threshold_uncertainty_score":0.6464982},"labels":[],"label_agreement":null},{"id":"W2020156973","doi":"10.1109/glocom.2013.6831626","title":"Performance analysis of amplify-and-forward relaying with optimum combining in the presence of co-channel interference","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Interference (communication); Moment-generating function; Maximal-ratio combining; Node (physics); Diversity gain; Signal-to-noise ratio (imaging); Channel state information; Topology (electrical circuits); Co-channel interference; Computer science; Channel (broadcasting); Diversity combining; Telecommunications; Power (physics); Computer network; Fading; Mathematics; Statistics; Engineering; Probability density function; Wireless; Electrical engineering; Physics","score_opus":0.04061133698337884,"score_gpt":0.2770023050743063,"score_spread":0.23639096809092744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020156973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75896686,0.000102362406,0.23414733,0.00039435946,0.000012431725,0.00016827829,3.6238984e-7,0.000016813285,0.0061911903],"genre_scores_gemma":[0.99441665,0.00030976764,0.0050988956,0.00010236735,0.0000015475899,0.00002093248,0.0000012010958,0.0000020556347,0.00004658147],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991886,0.00012434923,0.00025399786,0.0001582408,0.00015310071,0.0001217154],"domain_scores_gemma":[0.9987837,0.00038065654,0.00012286533,0.00056001625,0.00012813136,0.000024610597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004701985,0.0000782537,0.00020161428,0.00018938465,0.000071820556,0.000055080185,0.0009359148,0.000021524407,0.000023765298],"category_scores_gemma":[0.000027982176,0.000047601985,0.000025276368,0.0011442106,0.00010571344,0.0004078601,0.0002617968,0.0001387314,0.0000018516115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008342668,0.0005122289,0.5025094,0.00016476617,0.0009048811,0.0000028870916,0.10096386,0.110550255,0.0047101383,0.15524974,0.00065130345,0.1236971],"study_design_scores_gemma":[0.00014204788,0.00010608209,0.069094166,0.00006705909,0.000017442613,0.0000014638183,0.00062322314,0.92941046,0.00041017606,0.000043851534,0.000011832206,0.00007220564],"about_ca_topic_score_codex":0.000067363464,"about_ca_topic_score_gemma":0.000057446647,"teacher_disagreement_score":0.8188602,"about_ca_system_score_codex":0.0000076389715,"about_ca_system_score_gemma":0.000018736735,"threshold_uncertainty_score":0.19411527},"labels":[],"label_agreement":null},{"id":"W2020172085","doi":"10.1109/glocom.2011.6133588","title":"Cooperative Frequency-Domain Beamforming for Broadband SC-FDE Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Beamforming; SC-FDE; Frequency domain; Computer science; Equalization (audio); Interference (communication); Signal-to-noise ratio (imaging); Signal-to-interference-plus-noise ratio; Power (physics); Broadband; Computational complexity theory; Mathematical optimization; Telecommunications; Algorithm; Mathematics; Channel (broadcasting); Physics","score_opus":0.07455090245022031,"score_gpt":0.27480824051249236,"score_spread":0.20025733806227206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020172085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002937208,0.000635263,0.925596,0.00021592747,0.00033171842,0.00048052892,0.0000021207593,0.00017882934,0.06962243],"genre_scores_gemma":[0.6287571,0.00011583826,0.36860538,0.0004449563,0.0000614574,0.00018164502,0.0000050887666,0.000013092578,0.0018154558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998934,0.00010352607,0.00027361914,0.00029647382,0.000118926444,0.00027349326],"domain_scores_gemma":[0.9987615,0.0001390524,0.000075783966,0.00066466513,0.00026274376,0.00009627575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046006058,0.0001444662,0.00017913003,0.00007721807,0.000395086,0.0001701468,0.0009994381,0.000049371127,0.000060888964],"category_scores_gemma":[0.00004607908,0.000118727716,0.000056107423,0.00030500142,0.000050483348,0.00059594197,0.0002346122,0.00010040022,0.000041125535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032804326,0.000037446778,0.00016605506,0.0000067057213,0.000020843976,0.0000011068615,0.0031705922,0.00002177952,0.0015951184,0.9889036,0.0011397108,0.004933794],"study_design_scores_gemma":[0.006897941,0.0020668944,0.0029838048,0.0006822659,0.000058998732,0.00014268154,0.0041986676,0.69508374,0.035919387,0.07415565,0.17392196,0.00388804],"about_ca_topic_score_codex":0.0000374879,"about_ca_topic_score_gemma":0.00007821844,"teacher_disagreement_score":0.9147479,"about_ca_system_score_codex":0.000051165083,"about_ca_system_score_gemma":0.00008023444,"threshold_uncertainty_score":0.4841576},"labels":[],"label_agreement":null},{"id":"W2020296254","doi":"10.1109/icc.2012.6364408","title":"Relay selection and resource allocation for multi-user cooperative LTE-A uplink","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Relay; Resource allocation; Telecommunications link; Quality of service; Subgradient method; Throughput; Computer network; Mathematical optimization; Optimization problem; LTE Advanced; Subcarrier; Resource management (computing); Power (physics); Wireless; Orthogonal frequency-division multiplexing; Telecommunications; Mathematics; Algorithm","score_opus":0.06753807069704383,"score_gpt":0.31764733959200914,"score_spread":0.2501092688949653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020296254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005748506,0.0005201131,0.99064195,0.0016371959,0.00008435236,0.00030211176,2.5915872e-7,0.00013514826,0.00093036244],"genre_scores_gemma":[0.7144437,0.0001982615,0.2774665,0.00095123635,0.00009044842,0.00008808204,0.0000074854574,0.000009690929,0.006744589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933165,0.0000971975,0.00014128315,0.00018160806,0.000062531966,0.00018573581],"domain_scores_gemma":[0.9993148,0.0001402221,0.000044316534,0.00024733337,0.0001720355,0.00008132373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044369983,0.00009013663,0.00008484394,0.000052446987,0.00033686782,0.00010325564,0.00022718642,0.000046896424,0.000015476644],"category_scores_gemma":[0.00007950901,0.00007799772,0.00002077,0.00025766576,0.000020963738,0.00060117943,0.00015216158,0.000092226524,0.000016105443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016514467,0.00017663577,0.0031503087,0.000009946322,0.00003162032,5.3316704e-8,0.004471062,0.00056547514,0.0067690727,0.87820405,0.008946822,0.09765841],"study_design_scores_gemma":[0.00052820705,0.000066065295,0.0034506202,0.000011754606,0.000005491182,0.000005495729,0.00006615977,0.8046567,0.0049132225,0.000019815954,0.18609694,0.00017957076],"about_ca_topic_score_codex":0.0000027934257,"about_ca_topic_score_gemma":0.000037245543,"teacher_disagreement_score":0.87818426,"about_ca_system_score_codex":0.000036664944,"about_ca_system_score_gemma":0.000020883475,"threshold_uncertainty_score":0.31806546},"labels":[],"label_agreement":null},{"id":"W2020595470","doi":"10.1007/s11432-009-0210-x","title":"Transmission scheme and performance analysis for decode-and-forward MIMO two-way relay systems","year":2009,"lang":"en","type":"article","venue":"Science in China Series F Information Sciences","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Transmission (telecommunications); Channel state information; Computer science; MIMO; Quantization (signal processing); Beamforming; Transmission system; Algorithm; Relay channel; Outage probability; Maximal-ratio combining; Topology (electrical circuits); Control theory (sociology); Electronic engineering; Decoding methods; Mathematics; Telecommunications; Fading; Wireless; Engineering; Artificial intelligence","score_opus":0.02389058718194931,"score_gpt":0.2941667466596237,"score_spread":0.2702761594776744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020595470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6365225,0.0005070122,0.35579705,0.0032483186,0.00019855582,0.00039660328,0.000001832371,0.00008763,0.0032404803],"genre_scores_gemma":[0.95687926,0.0010785474,0.041733995,0.00023450868,0.000009284777,0.000020712576,0.000001926313,0.0000010884327,0.000040691415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829096,0.00004712392,0.0004729326,0.000330094,0.0005016347,0.00035726337],"domain_scores_gemma":[0.99908537,0.000081296,0.0001812763,0.00033629764,0.00018449867,0.00013124825],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032487763,0.00014213179,0.00020933323,0.0008628892,0.0014073759,0.0012944086,0.0012075949,0.00003517899,0.0000032473108],"category_scores_gemma":[0.00012672645,0.00011088855,0.000036216374,0.0046806606,0.0006808623,0.011985412,0.00017285875,0.0001123151,0.0000022400875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037466183,0.000035062472,0.032638006,0.000052812647,0.000011412245,3.2891145e-7,0.01773474,0.032820027,0.00089279516,0.22075137,0.00004861858,0.69497734],"study_design_scores_gemma":[0.00021488986,0.0001999609,0.104651466,0.00004253411,0.0000045422657,0.000010274174,0.0003044923,0.8914512,0.0003279997,0.0004476668,0.0021736117,0.00017137303],"about_ca_topic_score_codex":0.000016944503,"about_ca_topic_score_gemma":0.000020437985,"teacher_disagreement_score":0.8586312,"about_ca_system_score_codex":0.00005107089,"about_ca_system_score_gemma":0.00016542412,"threshold_uncertainty_score":0.99989265},"labels":[],"label_agreement":null},{"id":"W2020606722","doi":"10.1109/sips.2006.352551","title":"Performance Analysis of a New Transmission Scheme for Multi-Relay Channels","year":2006,"lang":"en","type":"article","venue":"SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Fading; Computer science; Transmission (telecommunications); Relay channel; Upper and lower bounds; Cooperative diversity; Bit error rate; Diversity gain; Topology (electrical circuits); Signal-to-noise ratio (imaging); Computer network; Channel (broadcasting); Electronic engineering; Telecommunications; Mathematics; Engineering; Electrical engineering; Physics","score_opus":0.11242642753121203,"score_gpt":0.35890967048861233,"score_spread":0.24648324295740032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020606722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0153868925,0.0013580796,0.9821325,0.0001642909,0.00010234631,0.0007409703,0.0000028059308,0.0000743095,0.00003778153],"genre_scores_gemma":[0.9312742,0.00016804226,0.067717224,0.00008076216,0.0000825286,0.000105534025,0.000030673087,0.000014659975,0.00052639795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982304,0.0001784341,0.00063571765,0.00039507795,0.00028953428,0.00027080867],"domain_scores_gemma":[0.99886507,0.00020619895,0.000359674,0.00023995554,0.00023220222,0.000096918426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008012555,0.0002072488,0.00035282556,0.00040459674,0.00041911288,0.00029668727,0.0003668322,0.00006990736,0.00001425713],"category_scores_gemma":[0.0000052062032,0.00018505276,0.00009410516,0.0012816224,0.000033670276,0.00050850754,0.00002694965,0.00010353238,0.0000014133229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014524233,0.0001999783,0.00067245576,0.00025755097,0.00027930463,7.6289894e-7,0.0041843345,0.21620801,0.03225891,0.0024658528,0.0033098806,0.7400177],"study_design_scores_gemma":[0.0010783386,0.0001383201,0.00043648467,0.00024858429,0.00009454851,0.0000015209778,0.00022844627,0.99089605,0.005291925,0.00001797213,0.001349004,0.00021882754],"about_ca_topic_score_codex":0.000020001746,"about_ca_topic_score_gemma":0.000007682486,"teacher_disagreement_score":0.9158873,"about_ca_system_score_codex":0.000051847248,"about_ca_system_score_gemma":0.00013289605,"threshold_uncertainty_score":0.7546233},"labels":[],"label_agreement":null},{"id":"W2020652262","doi":"10.1016/j.automatica.2013.06.011","title":"On optimal policies for control and estimation over a Gaussian relay channel","year":2013,"lang":"en","type":"article","venue":"Automatica","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Seventh Framework Programme; European Commission","keywords":"Relay; Channel (broadcasting); Control theory (sociology); Gaussian; Estimation; Control (management); Computer science; Optimal control; Linear-quadratic-Gaussian control; Mathematical optimization; Mathematics; Engineering; Telecommunications; Artificial intelligence; Physics","score_opus":0.01777633166114852,"score_gpt":0.2757596521927528,"score_spread":0.2579833205316043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020652262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043446206,0.000089705,0.943619,0.010611378,0.00006662093,0.000557202,0.0000014649548,0.00020247862,0.0014059469],"genre_scores_gemma":[0.94964767,0.000018146467,0.048598256,0.0013873585,0.000017250302,0.00015748896,0.000001681176,0.0000058157084,0.00016636423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942875,0.00004795519,0.00014439817,0.00014034646,0.000085643704,0.0001529064],"domain_scores_gemma":[0.9991506,0.00034885327,0.000054421816,0.00033641,0.000050343027,0.000059369842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013294136,0.000085728745,0.00011065572,0.000060232367,0.00018463236,0.00020252739,0.00026359834,0.00003097027,0.000023154003],"category_scores_gemma":[0.0001095906,0.000070576505,0.000025576532,0.00010635296,0.00003398046,0.00030985358,0.00008016536,0.000054533753,0.000050332976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074001364,0.00008753255,0.000028879595,0.000028578956,0.0000376698,5.7679404e-7,0.0038122009,0.003661637,0.00045192524,0.8629791,0.016085127,0.11281934],"study_design_scores_gemma":[0.00044606838,0.00009545756,0.0066887117,0.000034553275,0.0000035551925,0.000002798498,0.0000113777105,0.9874244,0.00004710153,0.004822296,0.0003352388,0.00008844805],"about_ca_topic_score_codex":0.0000052379846,"about_ca_topic_score_gemma":0.000002017971,"teacher_disagreement_score":0.98376274,"about_ca_system_score_codex":0.000017941828,"about_ca_system_score_gemma":0.000015621225,"threshold_uncertainty_score":0.28780264},"labels":[],"label_agreement":null},{"id":"W2020661221","doi":"10.1109/tcomm.2013.021513.100278","title":"Energy-Aware Power Allocation in Cooperative Communication Systems with Imperfect CSI","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transmitter power output; Computer science; Relay; Power budget; Channel state information; Quality of service; Computer network; Communications system; Power (physics); Transmission (telecommunications); Signal-to-noise ratio (imaging); Efficient energy use; Energy (signal processing); Wireless; Imperfect; Electronic engineering; Channel (broadcasting); Telecommunications; Power control; Engineering; Electrical engineering; Transmitter; Mathematics","score_opus":0.025986993013217587,"score_gpt":0.2581110792061994,"score_spread":0.23212408619298183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020661221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023485573,0.0011937224,0.98248535,0.006243257,0.00013976543,0.00080381654,0.000007728551,0.00032243185,0.0064553735],"genre_scores_gemma":[0.98703927,0.0041572847,0.0060111373,0.00048494068,0.000006943815,0.0015700583,0.000027774073,0.000030905067,0.0006717155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732697,0.0010843956,0.00055266166,0.0004112501,0.000290408,0.00033429379],"domain_scores_gemma":[0.99334997,0.0006838985,0.00017722261,0.005000738,0.0006498607,0.00013830385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038436014,0.00029867096,0.00029592685,0.00041879615,0.0009689401,0.00046505156,0.0031729303,0.00012491009,0.00008875132],"category_scores_gemma":[0.0000070255924,0.00027400866,0.00007475706,0.0016268321,0.00023562011,0.0014015653,0.000055572404,0.00065272575,0.00016358832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117226075,0.006408582,0.00048707137,0.000053182714,0.00063420547,0.0000065720074,0.017520437,0.18828501,0.0072086616,0.45868802,0.006838479,0.31375253],"study_design_scores_gemma":[0.001313255,0.0003507172,0.0009475549,0.00037053906,0.00002354506,0.00003354017,0.0009389036,0.9856468,0.0019232159,0.00038004477,0.0073153037,0.00075660984],"about_ca_topic_score_codex":0.0005390433,"about_ca_topic_score_gemma":0.0019002791,"teacher_disagreement_score":0.98469067,"about_ca_system_score_codex":0.00028064055,"about_ca_system_score_gemma":0.00017758184,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W2020685204","doi":"10.1109/icassp.2013.6638525","title":"On joint source-channel decoding and interference cancellation in CDMA-based large-scale wireless sensor networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Decoding methods; Multiuser detection; Single antenna interference cancellation; Code division multiple access; Minimum mean square error; Algorithm; Interference (communication); Channel (broadcasting); Joint (building); Electronic engineering; Telecommunications; Mathematics; Engineering; Statistics","score_opus":0.028961156118949047,"score_gpt":0.2444903809660271,"score_spread":0.21552922484707804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020685204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18658027,0.0000775278,0.81035876,0.0012148945,0.00009504121,0.00018965334,1.8379544e-7,0.000083458384,0.0014001913],"genre_scores_gemma":[0.99295336,0.00013938043,0.005390513,0.0011305013,0.000025052394,0.000030868814,0.00000213212,0.0000077157765,0.0003204509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894845,0.00014069672,0.00023733152,0.00030969456,0.00009981495,0.00026403385],"domain_scores_gemma":[0.9991462,0.00020571434,0.000067659545,0.00041052207,0.00008450793,0.00008538056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000284971,0.0001330346,0.00015449374,0.00012179002,0.00015626477,0.0002039837,0.0003134993,0.00005574482,0.00008301523],"category_scores_gemma":[0.000021608072,0.00011868803,0.000025557709,0.0003027163,0.000028693086,0.00023442147,0.00023952595,0.00020927643,0.000026331396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050593833,0.00047142716,0.016499173,0.000052017604,0.000028306844,0.0000073693554,0.009098223,0.29429653,0.0040834323,0.062299456,0.005749887,0.6073636],"study_design_scores_gemma":[0.00035002004,0.000039703078,0.0038516454,0.000100514124,7.7227344e-7,0.0000011939851,0.000086207656,0.99452525,0.00056688307,0.000220473,0.00010522891,0.00015213146],"about_ca_topic_score_codex":0.000055230386,"about_ca_topic_score_gemma":0.0007339096,"teacher_disagreement_score":0.8063731,"about_ca_system_score_codex":0.00006265586,"about_ca_system_score_gemma":0.000022686774,"threshold_uncertainty_score":0.48399574},"labels":[],"label_agreement":null},{"id":"W2020694184","doi":"10.1109/ccece.2008.4564880","title":"SEP formula for single relay selection in a multiple relay environment over rayleigh fading channels","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Relay; Rayleigh fading; Fading; Nakagami distribution; Relay channel; Computer science; Selection (genetic algorithm); Space–time code; Channel (broadcasting); Transmission (telecommunications); Wireless; Electronic engineering; Algorithm; Telecommunications; Computer network; Engineering","score_opus":0.038152775770506846,"score_gpt":0.20734165213762734,"score_spread":0.1691888763671205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020694184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24067904,0.00021473884,0.7563229,0.0009703614,0.00019554525,0.0007817474,0.0000033837666,0.0002212085,0.0006110673],"genre_scores_gemma":[0.98739904,0.00037369036,0.011573782,0.00028063712,0.0001088934,0.00014443263,0.0000047919766,0.00002263178,0.000092101356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980125,0.000018270457,0.0003538877,0.00065867294,0.00020082998,0.00075584813],"domain_scores_gemma":[0.9990392,0.00013620668,0.00008447341,0.0001577099,0.00015877001,0.00042365908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020321363,0.00033183198,0.00033773234,0.00052823615,0.0003624151,0.0002986798,0.00058601075,0.00015954206,0.000015825457],"category_scores_gemma":[0.0000654391,0.00035035584,0.00006311618,0.00059216283,0.00004211761,0.000512593,0.0001285942,0.00045787037,0.000006752053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013779209,0.0005844552,0.01819809,0.00021779307,0.00017818275,0.000083882565,0.014254025,0.049307864,0.05349133,0.6181953,0.0020387261,0.2433126],"study_design_scores_gemma":[0.0006381189,0.00036042652,0.0035751485,0.00011921574,0.000004106176,0.00005790135,0.0000059423755,0.9903028,0.0012512116,0.00018671881,0.0030585723,0.00043982806],"about_ca_topic_score_codex":0.00027681325,"about_ca_topic_score_gemma":0.00036424535,"teacher_disagreement_score":0.9409949,"about_ca_system_score_codex":0.00041515648,"about_ca_system_score_gemma":0.0002132375,"threshold_uncertainty_score":0.99989486},"labels":[],"label_agreement":null},{"id":"W2020869491","doi":"10.1109/tsp.2012.2197203","title":"Performance Tradeoffs in Amplify-and-Forward Bidirectional Network Beamforming","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Computer science; Transceiver; Quality of service; Transmitter power output; Relay; Channel (broadcasting); Power (physics); Power control; Signal-to-noise ratio (imaging); Computer network; Mathematical optimization; Transmitter; Telecommunications; Wireless; Mathematics","score_opus":0.04019692337185633,"score_gpt":0.27211098790002874,"score_spread":0.23191406452817243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020869491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01757589,0.0011138464,0.9789893,0.00033137627,0.000226559,0.00011002633,5.719065e-7,0.00013238112,0.0015200514],"genre_scores_gemma":[0.98043394,0.0004658293,0.018384,0.00045854773,0.000118526536,0.00003709973,6.826696e-7,0.0000116885,0.0000896691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988119,0.00009013307,0.00026386467,0.00022474855,0.00021304532,0.0003963217],"domain_scores_gemma":[0.9994366,0.00014741081,0.000064031185,0.00018079791,0.000055600143,0.00011553126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005768577,0.00015278737,0.0001490665,0.00016243331,0.0006043694,0.000119182856,0.00028844396,0.000068894406,0.00002307954],"category_scores_gemma":[0.0000025224485,0.00014974758,0.000037876194,0.00074209087,0.000053030857,0.0015424904,0.0000067057435,0.0004045918,0.000015243782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001968699,0.0001216028,0.00045370977,0.00001853573,0.00000974209,5.414752e-7,0.0014798929,0.030655194,0.00041096422,0.00049331,0.000029373832,0.96630746],"study_design_scores_gemma":[0.0007170779,0.00013193545,0.0031621987,0.0004170572,0.000020128564,0.00011072983,0.00015020017,0.97666734,0.005168015,0.00013754699,0.012730411,0.0005873771],"about_ca_topic_score_codex":0.0000026969594,"about_ca_topic_score_gemma":0.000008078434,"teacher_disagreement_score":0.96572006,"about_ca_system_score_codex":0.000082793274,"about_ca_system_score_gemma":0.00006040027,"threshold_uncertainty_score":0.6106529},"labels":[],"label_agreement":null},{"id":"W2020902645","doi":"10.1109/glocomw.2014.7063545","title":"Device-centric radio access virtualization for 5G networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Radio access network; Computer network; Virtualization; Quality of service; Cellular network; Radio resource management; Network virtualization; Base station; Cloud computing; Wireless network; Wireless; Telecommunications; Operating system; Mobile station","score_opus":0.05204813553091035,"score_gpt":0.31514582745119724,"score_spread":0.26309769192028687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020902645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025252852,0.00019639311,0.99015474,0.0010517692,0.00028545284,0.00025560815,1.0125595e-7,0.00018050717,0.0076228767],"genre_scores_gemma":[0.98406565,0.00034710218,0.012045855,0.0024717262,0.00016100603,0.00005384771,0.000007616213,0.000008287472,0.0008389316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922913,0.00011820339,0.00017099144,0.00021182197,0.000089851,0.00017998926],"domain_scores_gemma":[0.9989276,0.00027974474,0.00006347456,0.00051089074,0.00015415695,0.00006412302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037224052,0.000084636624,0.000100989826,0.00006667114,0.00024046827,0.00034765192,0.0011971213,0.00003867665,0.000039373706],"category_scores_gemma":[0.00008587845,0.00007540113,0.00003962883,0.0005532926,0.00001382146,0.0005215879,0.00017731146,0.000056497367,0.000016144659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039136753,0.000037283728,0.0005268434,0.000006148428,0.000009437934,8.5636835e-8,0.0001556426,0.010989819,0.000044627817,0.7335749,0.012254267,0.24239703],"study_design_scores_gemma":[0.0002947649,0.000022456528,0.0015861008,0.000008641483,0.0000023452567,8.268705e-7,0.0000013763906,0.9288169,0.00015578597,0.00051115185,0.06849171,0.00010794661],"about_ca_topic_score_codex":0.0000021621056,"about_ca_topic_score_gemma":0.000023515087,"teacher_disagreement_score":0.9838131,"about_ca_system_score_codex":0.000029048584,"about_ca_system_score_gemma":0.00002143625,"threshold_uncertainty_score":0.33524156},"labels":[],"label_agreement":null},{"id":"W2021080064","doi":"10.1109/iccnc.2013.6504227","title":"A queueing theoretic model for opportunistic network coding","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Network packet; Linear network coding; Queueing theory; Computer network; Coding (social sciences); Markov process; Markov chain; Markovian arrival process; Point process; Discrete time and continuous time; Real-time computing; Mathematics","score_opus":0.13543242226646177,"score_gpt":0.33071047068999304,"score_spread":0.19527804842353128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021080064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000835985,0.0006286373,0.9536414,0.013479263,0.00065562234,0.00064235186,0.0000047541785,0.00035132957,0.029760666],"genre_scores_gemma":[0.92267686,0.0055144564,0.06885776,0.0014207319,0.00029518723,0.00017858994,0.00006341272,0.00002632116,0.00096670166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978505,0.0002703459,0.00058926165,0.0005268779,0.00027575443,0.00048731224],"domain_scores_gemma":[0.9961105,0.0008748868,0.0003766248,0.0017767907,0.0006805734,0.00018064305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082521443,0.00030757394,0.00030239802,0.00015852533,0.0012289772,0.0009908198,0.00357457,0.000103923216,0.000055277236],"category_scores_gemma":[0.000077942204,0.00030885858,0.000106503285,0.00029829534,0.0002371959,0.00038347894,0.0017999222,0.0004677455,0.00004254013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005217704,0.000055546356,0.00011978579,0.000006547258,0.000043322216,2.820912e-7,0.0005968541,0.0046975412,0.0000436088,0.89874387,0.006287671,0.089399755],"study_design_scores_gemma":[0.00033151364,0.00005080063,0.0002015646,0.00031301548,0.00001116336,0.000008920275,0.00005701208,0.934812,0.0000023911778,0.054554097,0.009334207,0.00032330106],"about_ca_topic_score_codex":0.000031669446,"about_ca_topic_score_gemma":0.00005111279,"teacher_disagreement_score":0.93011445,"about_ca_system_score_codex":0.00008946755,"about_ca_system_score_gemma":0.00012580177,"threshold_uncertainty_score":0.99993634},"labels":[],"label_agreement":null},{"id":"W2021123566","doi":"10.1016/j.comcom.2014.12.004","title":"Resource allocation in multi-relay multi-user OFDM systems for heterogeneous traffic","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Subgradient method; Relay; Resource allocation; Subcarrier; Mathematical optimization; Quality of service; Transmitter power output; Transmission (telecommunications); Optimization problem; Computer network; Power (physics); Orthogonal frequency-division multiplexing; Algorithm; Telecommunications; Channel (broadcasting)","score_opus":0.09055135908521074,"score_gpt":0.3130213031296813,"score_spread":0.22246994404447057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021123566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020239227,0.0028004893,0.99061704,0.002950141,0.00026960747,0.00086118147,0.0000034424245,0.0003239114,0.00015025803],"genre_scores_gemma":[0.6460417,0.00068292045,0.35175696,0.0006123844,0.000059448736,0.0003894992,0.00006617441,0.00002683966,0.00036406607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974946,0.0009058749,0.0006255976,0.0004647561,0.00015553265,0.0003536469],"domain_scores_gemma":[0.9942349,0.0008552894,0.0002041085,0.0043091713,0.0002752381,0.00012126492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094777055,0.00023654828,0.00030686476,0.00025354043,0.00055563054,0.0003219992,0.0046209083,0.000114100156,0.0000018132249],"category_scores_gemma":[0.0000831301,0.00025084036,0.00011494981,0.000596217,0.00011315397,0.00031861386,0.0014101741,0.00031570578,0.00004173619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012830527,0.0014577869,0.00049243524,0.00006644575,0.00008260563,0.0000010950832,0.0051418995,0.519387,0.00031913124,0.21284592,0.0042438917,0.25594893],"study_design_scores_gemma":[0.00091038755,0.000050140334,0.0007797744,0.000079815145,0.0000053265176,0.000007798656,0.000017000932,0.7988768,0.00001884263,0.000015081747,0.19901267,0.0002263093],"about_ca_topic_score_codex":0.000012878397,"about_ca_topic_score_gemma":0.00030497,"teacher_disagreement_score":0.6440178,"about_ca_system_score_codex":0.0001286056,"about_ca_system_score_gemma":0.000057067395,"threshold_uncertainty_score":0.9999944},"labels":[],"label_agreement":null},{"id":"W2021603150","doi":"10.1109/glocom.2011.6133845","title":"Joint Relay Selection and Power Allocation for Decode-and-Forward Cellular Relay Network with Imperfect CSI","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Relay channel; Mathematical optimization; Telecommunications link; Channel state information; Resource allocation; Selection (genetic algorithm); Channel (broadcasting); Power (physics); Computer network; Wireless; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.032001803146949566,"score_gpt":0.23168409601991838,"score_spread":0.19968229287296882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021603150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07178704,0.0006127359,0.9240066,0.00046989348,0.00009062753,0.00034480973,1.6216167e-7,0.00013505918,0.0025531026],"genre_scores_gemma":[0.8552266,0.0003996248,0.14353888,0.0002966653,0.000030619773,0.00004834039,0.0000022286088,0.000010787015,0.0004462864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909955,0.000092500515,0.0001869564,0.0003195754,0.00008836957,0.00021303566],"domain_scores_gemma":[0.9992459,0.00008384708,0.00007753783,0.0003442182,0.00016192454,0.00008659928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053826655,0.000130959,0.00013835919,0.000055017703,0.00033961926,0.00009955328,0.00020468929,0.0000578385,0.0000288632],"category_scores_gemma":[0.000024204732,0.0001012185,0.000028187998,0.0002740599,0.000035882233,0.00036621708,0.00015956277,0.00011757802,0.0000051306697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025233577,0.00023151947,0.015521279,0.000053766376,0.00025391692,0.00000380874,0.011186215,0.0030449824,0.011152898,0.81576186,0.010338281,0.13219911],"study_design_scores_gemma":[0.0016777428,0.0017964839,0.019886808,0.00012528591,0.000056517427,0.00007741063,0.000111399924,0.93418217,0.017901707,0.002138065,0.021215191,0.000831249],"about_ca_topic_score_codex":0.000011374384,"about_ca_topic_score_gemma":0.00014758782,"teacher_disagreement_score":0.93113714,"about_ca_system_score_codex":0.000029246428,"about_ca_system_score_gemma":0.000035873123,"threshold_uncertainty_score":0.41275707},"labels":[],"label_agreement":null},{"id":"W2021669325","doi":"10.1145/1089761.1089769","title":"MAC coding for QoS guarantees in multi-hop mobile wireless networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Aloha; Computer network; Linear network coding; Wireless network; Repetition code; Coding (social sciences); Scheduling (production processes); Quality of service; Fountain code; Wireless; Linear code; Theoretical computer science; Throughput; Block code; Distributed computing; Algorithm; Network packet; Decoding methods; Mathematics; Telecommunications; Mathematical optimization","score_opus":0.049986887147298854,"score_gpt":0.3148038054945995,"score_spread":0.26481691834730064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021669325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008932484,0.000707279,0.98765725,0.0008899088,0.00019197556,0.00043964465,5.3319127e-7,0.00015603489,0.0010248936],"genre_scores_gemma":[0.9303023,0.00089730765,0.06673187,0.0008659176,0.00011358517,0.00017657234,0.0000030045856,0.000009075539,0.00090032024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990266,0.00007056188,0.00026164335,0.00027167852,0.00008317265,0.00028637407],"domain_scores_gemma":[0.9990895,0.00022980673,0.00005025047,0.0004952757,0.00008554466,0.000049672086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003698522,0.00011960305,0.00015918874,0.000087352644,0.0001624319,0.00012713808,0.00087386335,0.000051859515,0.000043144453],"category_scores_gemma":[0.00001737205,0.00010984868,0.000054979704,0.00035913667,0.00002693862,0.00036987942,0.00028865115,0.00013998471,0.000018473518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137164725,0.00022809725,0.0010355865,0.000009731395,0.000013623012,0.0000017854454,0.0016030495,0.028311543,0.0015106415,0.13350372,0.0043172007,0.8294513],"study_design_scores_gemma":[0.0006455394,0.000025757186,0.0003687331,0.00003286458,0.0000010893958,0.0000017966997,0.00004408304,0.9774278,0.00077090884,0.000022120506,0.020504912,0.0001544337],"about_ca_topic_score_codex":0.0000055756677,"about_ca_topic_score_gemma":0.00055752444,"teacher_disagreement_score":0.94911623,"about_ca_system_score_codex":0.000058723122,"about_ca_system_score_gemma":0.000024067518,"threshold_uncertainty_score":0.44794995},"labels":[],"label_agreement":null},{"id":"W2021672277","doi":"10.1109/tcomm.2013.032013.120601","title":"Analysis of the Generalized DF-CF for Gaussian Relay Channels: Decode or Compress?","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Rayleigh fading; Topology (electrical circuits); Mathematics; Gaussian; Asymptotic analysis; Channel (broadcasting); Bounded function; Signal-to-noise ratio (imaging); Fading; Relay channel; Node (physics); Decoding methods; Computer science; Algorithm; Telecommunications; Power (physics); Statistics; Combinatorics; Engineering; Mathematical analysis","score_opus":0.08890690206518086,"score_gpt":0.3245589423044543,"score_spread":0.23565204023927344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021672277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024288897,0.0002737162,0.9847478,0.010353216,0.00028360655,0.0007402305,0.000033737902,0.000113984686,0.0010248189],"genre_scores_gemma":[0.95374393,0.001387828,0.04176375,0.00059691764,0.000010394938,0.00075971877,0.000010588089,0.000013943835,0.0017129481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984215,0.00046318313,0.00047434482,0.00024931095,0.00018064847,0.00021101459],"domain_scores_gemma":[0.9937092,0.0009215842,0.00020404463,0.0047308044,0.00035206025,0.00008228015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027469613,0.00016158995,0.00029602778,0.00030841812,0.0011035713,0.00013980275,0.004039789,0.00007298939,0.00017334417],"category_scores_gemma":[0.000022834693,0.00011573567,0.00035369868,0.002237014,0.00018903549,0.0003281727,0.000056656514,0.00028226298,0.000020559688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110912544,0.0036641567,0.00029624673,0.000059899605,0.0055032573,3.5630987e-7,0.0129264975,0.47297764,0.01096944,0.12304058,0.012682646,0.35776836],"study_design_scores_gemma":[0.00048535294,0.000053055945,0.0009301279,0.000040274732,0.00027617696,0.0000015427696,0.00007290922,0.9809121,0.0030115328,0.00028235262,0.013739451,0.00019513817],"about_ca_topic_score_codex":0.0000900199,"about_ca_topic_score_gemma":0.0013383126,"teacher_disagreement_score":0.95131505,"about_ca_system_score_codex":0.00006058824,"about_ca_system_score_gemma":0.00008767993,"threshold_uncertainty_score":0.848789},"labels":[],"label_agreement":null},{"id":"W2021756556","doi":"10.1109/netcod.2012.6261896","title":"Gamma Codes: A low-overhead linear-complexity network coding solution","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Linear network coding; Linear code; Block code; Computer science; Decoding methods; Concatenated error correction code; Overhead (engineering); Theoretical computer science; Algorithm; Coding (social sciences); Random access; Fountain code; Encoding (memory); Mathematics; Computer network","score_opus":0.10036712283567054,"score_gpt":0.3153580397686064,"score_spread":0.21499091693293584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021756556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003840406,0.0007950356,0.97058535,0.0014568152,0.000476225,0.00015676954,6.6164375e-7,0.00036506538,0.022323683],"genre_scores_gemma":[0.88675815,0.00037179462,0.11024778,0.0014725779,0.00046707073,0.0000141689015,0.000006595613,0.000008396398,0.00065345294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856055,0.00020744243,0.000255974,0.00022439232,0.00020124557,0.0005504033],"domain_scores_gemma":[0.9987391,0.00016253302,0.00008249123,0.0007294022,0.00010954311,0.00017690498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007775904,0.0001482706,0.0001728215,0.000045842997,0.00047716757,0.00011511523,0.00080341176,0.000058071342,0.0001905901],"category_scores_gemma":[0.00003834409,0.0001357871,0.000070099704,0.0005336537,0.00006948778,0.0007949471,0.0006377078,0.00020382256,0.0002675545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009327749,0.00015963746,0.0038904832,0.000012033294,0.000022868344,8.890888e-7,0.001069714,0.00040125815,0.0009771693,0.904215,0.033108335,0.056133304],"study_design_scores_gemma":[0.00048578565,0.00004581481,0.014122645,0.00009444836,0.000007798798,0.000021416614,0.000031562024,0.90673864,0.0010677538,0.0016053987,0.07529114,0.0004875658],"about_ca_topic_score_codex":0.0000118589915,"about_ca_topic_score_gemma":0.00007584739,"teacher_disagreement_score":0.9063374,"about_ca_system_score_codex":0.00008235934,"about_ca_system_score_gemma":0.000038121943,"threshold_uncertainty_score":0.5537237},"labels":[],"label_agreement":null},{"id":"W2021924106","doi":"10.1049/iet-com.2012.0596","title":"Performance analysis of adaptive <i>M</i> ‐ary quadrature amplitude modulation for amplify‐and‐forward opportunistic relaying under outdated channel state information","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Channel state information; Quadrature (astronomy); Adaptive quadrature; Channel (broadcasting); Computer science; Amplitude; Amplitude modulation; Quadrature amplitude modulation; Modulation (music); Telecommunications; Electronic engineering; Control theory (sociology); Physics; Wireless; Frequency modulation; Bandwidth (computing); Acoustics; Engineering; Bit error rate; Artificial intelligence; Optics","score_opus":0.06497505384593932,"score_gpt":0.2883537230713588,"score_spread":0.2233786692254195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021924106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018538088,0.0002858958,0.9761124,0.0029167132,0.00006124839,0.0007644093,0.00006968001,0.00013632506,0.0011152067],"genre_scores_gemma":[0.96356785,0.0018422018,0.033046704,0.0005689601,0.000005980503,0.0002503455,0.0006470022,0.000008258118,0.00006269589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986925,0.0001774895,0.0005681366,0.00018477767,0.00017346539,0.00020363413],"domain_scores_gemma":[0.99631655,0.00046763773,0.00039313626,0.001965589,0.0007432449,0.00011384598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045027546,0.00015976839,0.00028161437,0.00038383238,0.00055717333,0.0001906403,0.0013388781,0.00007947602,0.000011368756],"category_scores_gemma":[0.000089788,0.00015834824,0.00008896123,0.0012579174,0.00012610557,0.0018376299,0.00068506907,0.0002357201,0.00001072219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073822004,0.00048251648,0.003457489,0.0001423749,0.0024029699,1.3835937e-7,0.024552468,0.12230392,0.0035812291,0.54952353,0.0032514436,0.2902281],"study_design_scores_gemma":[0.00023706065,0.00005090628,0.02889332,0.000032971042,0.00009739118,7.9114204e-7,0.00023403061,0.9671997,0.000026906204,0.0016873481,0.0013635508,0.00017601476],"about_ca_topic_score_codex":0.000054246004,"about_ca_topic_score_gemma":0.00007510823,"teacher_disagreement_score":0.94502974,"about_ca_system_score_codex":0.00006172165,"about_ca_system_score_gemma":0.000086647786,"threshold_uncertainty_score":0.64572537},"labels":[],"label_agreement":null},{"id":"W2022172304","doi":"10.1109/wd.2011.6098177","title":"Equi-spaced relay selection in cooperative communication networks with power control","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Relay; Linear network coding; Computer network; Computer science; Transmitter power output; Node (physics); Power control; Topology control; Network topology; Wireless; Coding (social sciences); Topology (electrical circuits); Wireless network; Efficient energy use; Wireless mesh network; Routing protocol; Routing (electronic design automation); Power (physics); Distributed computing; Key distribution in wireless sensor networks; Telecommunications; Engineering; Channel (broadcasting); Electrical engineering; Network packet","score_opus":0.028830461889176526,"score_gpt":0.2463242928789669,"score_spread":0.21749383098979036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022172304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009167803,0.00036715934,0.95757073,0.0008132742,0.000040431743,0.00034626893,1.5839932e-7,0.00019114924,0.031503044],"genre_scores_gemma":[0.9735483,0.0002599272,0.024867367,0.00079378334,0.000007529801,0.00003868936,0.0000019913869,0.000009629256,0.0004727599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869996,0.00045429624,0.00023242917,0.00025902202,0.000118647644,0.00023566285],"domain_scores_gemma":[0.9988342,0.00013908025,0.00009025839,0.00062164513,0.00025015164,0.0000646978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048462846,0.00014352727,0.00017019932,0.000109466964,0.00021830955,0.000095149764,0.0008030434,0.00006689628,0.0001677842],"category_scores_gemma":[0.000026296439,0.00011344454,0.000024394923,0.0008668835,0.0000675747,0.0006293122,0.00019420098,0.00032532748,0.000024316467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037807217,0.00075694197,0.029142147,0.0000047181784,0.00014567487,0.0000111278305,0.019223202,0.07127902,0.0011806758,0.85315955,0.0035261551,0.021192726],"study_design_scores_gemma":[0.0018752593,0.00038434908,0.03339325,0.00006569575,0.000006031608,0.00001534256,0.00020249393,0.9619147,0.00048418588,0.00011362345,0.0011920494,0.00035300112],"about_ca_topic_score_codex":0.00004693237,"about_ca_topic_score_gemma":0.0015589389,"teacher_disagreement_score":0.9643805,"about_ca_system_score_codex":0.000078594254,"about_ca_system_score_gemma":0.000058185964,"threshold_uncertainty_score":0.46261343},"labels":[],"label_agreement":null},{"id":"W2022435419","doi":"10.1109/vetecf.2010.5594284","title":"Multi-Hop Relay Networks with Multiple-Antenna Equipped Source and Destination","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Cumulative distribution function; Hop (telecommunications); Diversity gain; Moment-generating function; Monte Carlo method; Computer science; Coding gain; Upper and lower bounds; Topology (electrical circuits); Outage probability; Probability density function; Telecommunications; Mathematics; Fading; Statistics; Decoding methods; Combinatorics; Physics; Mathematical analysis","score_opus":0.027162995013540643,"score_gpt":0.26032872787708,"score_spread":0.23316573286353937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022435419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059149202,0.00011652861,0.9386788,0.0009252292,0.00010543448,0.00014936004,9.424009e-8,0.00023282057,0.0006425131],"genre_scores_gemma":[0.77034897,0.00008591146,0.22827226,0.00033531064,0.000029579973,0.000011718227,0.0000017262737,0.000007713728,0.00090683217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991874,0.00007357662,0.00014659228,0.00028032577,0.00011162535,0.00020049662],"domain_scores_gemma":[0.99883616,0.00025708432,0.00006546035,0.0005694954,0.00017033254,0.00010146024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032295956,0.0001215707,0.000104251536,0.00005972477,0.00029006356,0.0002004601,0.00050689623,0.000057825317,0.000018941628],"category_scores_gemma":[0.00011804932,0.00009181172,0.000017662987,0.00031227848,0.00008414462,0.00036764407,0.00036922027,0.00032016422,0.000009982363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060242597,0.00036095973,0.1101519,0.000015121982,0.000062519786,0.00001478883,0.0033706736,0.0073875263,0.08296032,0.05365817,0.00093681575,0.741021],"study_design_scores_gemma":[0.00058829214,0.00004108067,0.022235293,0.000015100032,0.0000027335088,0.000024998863,0.000019282303,0.9740921,0.00015697046,0.000009487343,0.0026632433,0.0001513721],"about_ca_topic_score_codex":0.000010620135,"about_ca_topic_score_gemma":0.000756592,"teacher_disagreement_score":0.9667046,"about_ca_system_score_codex":0.0000093946,"about_ca_system_score_gemma":0.000022318884,"threshold_uncertainty_score":0.37439734},"labels":[],"label_agreement":null},{"id":"W2022525018","doi":"10.1145/1582379.1582649","title":"Power allocation and distributed beamforming optimization in relay-assisted multiuser communications","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Maximization; Beamforming; Mathematical optimization; Computer science; Optimization problem; Resource allocation; Power (physics); Convex optimization; Distributed algorithm; Dual (grammatical number); Constraint (computer-aided design); Regular polygon; Distributed computing; Mathematics; Telecommunications; Computer network","score_opus":0.03304371434631673,"score_gpt":0.28691552046852214,"score_spread":0.2538718061222054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022525018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041813487,0.00042322185,0.9809105,0.01059087,0.000027978394,0.00017877847,7.326721e-7,0.00014258058,0.0035439804],"genre_scores_gemma":[0.7834184,0.00077687774,0.21516335,0.00052382034,0.000002869191,0.000009339251,0.000033639444,0.000002764949,0.00006889298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922544,0.00011819645,0.0002488958,0.00018466507,0.00008911017,0.00013372007],"domain_scores_gemma":[0.99873865,0.000098329816,0.000065015745,0.00093247334,0.00011436916,0.00005118843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026926276,0.000089127614,0.00009798485,0.00011144149,0.00020888213,0.0001268959,0.0006927534,0.00004771799,0.000013908626],"category_scores_gemma":[0.000069844544,0.0000866937,0.000017107825,0.0006378924,0.00003375547,0.0006229301,0.00027249323,0.00013633432,0.0000041608196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020248062,0.00085203844,0.00465819,0.000006788374,0.00002507826,0.0000030887609,0.00519181,0.09040224,0.00416946,0.5206068,0.0011166333,0.37294757],"study_design_scores_gemma":[0.00036436773,0.000030786712,0.03202683,0.00002671219,0.0000015247755,0.0000047878675,0.000057916066,0.9645476,0.00007935138,0.00016370999,0.0025676638,0.00012875418],"about_ca_topic_score_codex":0.000004792383,"about_ca_topic_score_gemma":0.00006096025,"teacher_disagreement_score":0.8741453,"about_ca_system_score_codex":0.000061970975,"about_ca_system_score_gemma":0.00002494833,"threshold_uncertainty_score":0.35352665},"labels":[],"label_agreement":null},{"id":"W2022536625","doi":"10.1109/icc.2011.5963199","title":"RISE: Receipt-Free Cooperation Incentive Scheme for Multihop Wireless Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cheating; Computer network; Payment; Receipt; Computer science; Overhead (engineering); Scheme (mathematics); Computer security; Incentive; Wireless; Telecommunications","score_opus":0.06454176585778063,"score_gpt":0.27686056512031876,"score_spread":0.21231879926253813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022536625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002412133,0.00029148711,0.985818,0.00057189434,0.00034473086,0.00044145115,0.0000013805409,0.0002368445,0.009882067],"genre_scores_gemma":[0.76698786,0.0006877694,0.2298583,0.0007486868,0.00009889253,0.00013935515,0.000011365873,0.00001445131,0.0014533382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989271,0.00011544628,0.00025573547,0.00033544828,0.00010603522,0.000260236],"domain_scores_gemma":[0.99819094,0.000124619,0.000085593245,0.0011014097,0.00040963484,0.00008781852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037673282,0.00014411776,0.00015036513,0.000059357906,0.0003520666,0.00012558524,0.0015344099,0.000074654454,0.00011371853],"category_scores_gemma":[0.00008672679,0.00012966606,0.000059356964,0.00040396454,0.00005407723,0.00060048467,0.0006699633,0.00014425364,0.000025614077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046106034,0.00019047943,0.0006185102,0.0000071271434,0.000043719516,0.0000012266482,0.0020120533,0.000120966026,0.00093584554,0.7912223,0.032988645,0.17181306],"study_design_scores_gemma":[0.0008006578,0.0000784376,0.0008179708,0.000023508472,0.000004060427,0.0000012511649,0.000031405667,0.9831354,0.0028254935,0.0006264419,0.011419731,0.00023565382],"about_ca_topic_score_codex":0.000011190396,"about_ca_topic_score_gemma":0.00013198289,"teacher_disagreement_score":0.9830144,"about_ca_system_score_codex":0.00004559279,"about_ca_system_score_gemma":0.000046113135,"threshold_uncertainty_score":0.5287628},"labels":[],"label_agreement":null},{"id":"W2022676089","doi":"10.1007/s10623-008-9261-z","title":"An intrinsical description of group codes","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Abelian group; Group code; General linear group; Group (periodic table); Combinatorics; Linear code; Code (set theory); Discrete mathematics; Isomorphism (crystallography); Group algebra; Algebra over a field; Pure mathematics; Block code; Decoding methods; Symmetric group; Algorithm; Computer science; Physics","score_opus":0.04610486165626739,"score_gpt":0.277141148110304,"score_spread":0.2310362864540366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022676089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12918852,0.0010322713,0.8686641,0.00024645065,0.000037804366,0.00010023398,0.0000012190892,0.00009593934,0.00063344656],"genre_scores_gemma":[0.92493445,0.0013562351,0.07331816,0.00035242375,0.00002338424,0.00000477883,0.0000051513316,0.000003205685,0.000002237739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991168,0.00017176541,0.00019729443,0.00022943414,0.00013013244,0.0001545725],"domain_scores_gemma":[0.9992337,0.000056937268,0.000066268905,0.0004496277,0.00009485777,0.00009859063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028962424,0.00011168012,0.0001687758,0.0001750692,0.00016366097,0.00014737675,0.00045889433,0.000047124257,0.000006918296],"category_scores_gemma":[0.000008967069,0.000100145524,0.000060279643,0.00057036954,0.000093276765,0.0004373104,0.000053626176,0.0000975032,9.849957e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001528541,0.00017838541,0.0021070412,0.0000041327353,0.000011898891,0.000001458296,0.00054919894,0.00001418382,0.04765539,0.7056717,0.00021955442,0.24357173],"study_design_scores_gemma":[0.0027351268,0.0060926843,0.55948895,0.00027848838,0.000079751655,0.000065162574,0.00046708906,0.21398608,0.018718038,0.1823055,0.014124968,0.0016581304],"about_ca_topic_score_codex":0.0000039895494,"about_ca_topic_score_gemma":0.000013173217,"teacher_disagreement_score":0.7957459,"about_ca_system_score_codex":0.000005476637,"about_ca_system_score_gemma":0.000010473119,"threshold_uncertainty_score":0.40838158},"labels":[],"label_agreement":null},{"id":"W2023115409","doi":"10.1109/twc.2014.022114.130369","title":"Linear Transceiver Design for Nonorthogonal Amplify-and-Forward Protocol Using a Bit Error Rate Criterion","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Transceiver; Computer science; Bit error rate; Detector; Idle; Algorithm; Antenna diversity; Minimum mean square error; Channel (broadcasting); Decoding methods; Real-time computing; Electronic engineering; Computer network; Telecommunications; Wireless; Mathematics; Statistics; Engineering","score_opus":0.12147714997563026,"score_gpt":0.3544316919464053,"score_spread":0.23295454197077503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023115409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076785445,0.000022771736,0.983491,0.00230305,0.000101191436,0.012953571,0.000020308791,0.000226177,0.00011409985],"genre_scores_gemma":[0.699349,0.00017396265,0.27007857,0.0005781964,0.000031958898,0.029616248,0.000008892058,0.000037765825,0.00012540435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977736,0.00088051526,0.0004677845,0.00041006567,0.0001585789,0.00030949677],"domain_scores_gemma":[0.99619704,0.0010334977,0.0001476466,0.0021845144,0.00028547464,0.00015180431],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00087257463,0.0002610973,0.0002835311,0.000233737,0.0015786124,0.00019414302,0.0017104842,0.00012100034,0.000017607086],"category_scores_gemma":[0.00001566725,0.00026532568,0.0001435649,0.0005074682,0.00021517418,0.0005175619,0.00002657145,0.00044353498,0.000015623067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046599915,0.002159632,0.000033800243,0.00021606879,0.00031689022,0.0000010388713,0.0057392917,0.11294365,0.06003743,0.07399438,0.00038230923,0.7437095],"study_design_scores_gemma":[0.0011065953,0.00019175358,0.00005854619,0.00010649611,0.000033041713,0.000008772872,0.000019402349,0.9764114,0.00462733,0.00040493,0.016704688,0.00032706663],"about_ca_topic_score_codex":0.000012040243,"about_ca_topic_score_gemma":0.000103060105,"teacher_disagreement_score":0.86346775,"about_ca_system_score_codex":0.00007540733,"about_ca_system_score_gemma":0.00012140429,"threshold_uncertainty_score":0.9999799},"labels":[],"label_agreement":null},{"id":"W2023544465","doi":"10.1109/tcomm.2011.091911.100189","title":"Binary Soliton-Like Rateless Coding for the Y-Network","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Computer science; Luby transform code; Linear network coding; Decoding methods; Binary erasure channel; Computer network; Binary number; Variable-length code; Coding (social sciences); Theoretical computer science; Algorithm; Block code; Linear code; Channel (broadcasting); Channel capacity; Mathematics; Network packet","score_opus":0.14080348725088326,"score_gpt":0.31156643319474675,"score_spread":0.1707629459438635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023544465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085134125,0.001022057,0.98940706,0.003671128,0.00081172347,0.00058203825,0.000008868911,0.00027638802,0.0041356203],"genre_scores_gemma":[0.9322009,0.0061215903,0.05923602,0.0009565312,0.000044099823,0.0007080531,0.0000044680173,0.000021454125,0.0007068702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986269,0.00030928562,0.00033854344,0.00026559632,0.0001384709,0.0003212278],"domain_scores_gemma":[0.9939957,0.0014372427,0.00011240384,0.0041431403,0.00022650289,0.00008497737],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00060338265,0.00017869145,0.00016449952,0.000074556956,0.0027667985,0.00012977658,0.0042629745,0.00006914351,0.00005284716],"category_scores_gemma":[0.000008725238,0.00014713382,0.00016501542,0.0007512537,0.0002176386,0.00034991308,0.000053822092,0.0004368328,0.00006191685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009359742,0.001392874,0.000037309834,0.000023309114,0.00043629494,0.0000015533661,0.010424077,0.016369361,0.0010539435,0.52455443,0.0141552435,0.431458],"study_design_scores_gemma":[0.00094801944,0.00025586528,0.00068592903,0.00012875893,0.00010315659,0.000019270405,0.0003989307,0.85440856,0.0032611443,0.004284606,0.13485569,0.0006500569],"about_ca_topic_score_codex":0.000017531274,"about_ca_topic_score_gemma":0.00023012747,"teacher_disagreement_score":0.9321158,"about_ca_system_score_codex":0.00006248393,"about_ca_system_score_gemma":0.00009255766,"threshold_uncertainty_score":0.99853146},"labels":[],"label_agreement":null},{"id":"W2023580604","doi":"10.1109/tcomm.2012.042712.110410","title":"Cooperative AF Relaying in Spectrum-Sharing Systems: Performance Analysis under Average Interference Power Constraints and Nakagami-m Fading","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Relay; Rayleigh fading; Computer science; Cognitive radio; Spectral efficiency; Interference (communication); Signal-to-noise ratio (imaging); Electronic engineering; Wireless; Telecommunications; Power (physics); Engineering; Channel (broadcasting); Physics","score_opus":0.05721254112731804,"score_gpt":0.2918700804958549,"score_spread":0.23465753936853684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023580604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06553273,0.0012277997,0.9275256,0.00074931514,0.00022756588,0.00028646176,0.000007416731,0.00013567095,0.0043074903],"genre_scores_gemma":[0.9934882,0.0030860775,0.0029150813,0.00019544952,0.000008718364,0.00011054098,0.0000045703764,0.000013629834,0.00017776256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982513,0.00038940794,0.00047920318,0.0003395262,0.00016506707,0.00037549261],"domain_scores_gemma":[0.99702907,0.0005019593,0.00012570352,0.0020890061,0.000109069,0.00014519233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069084123,0.00022374006,0.0003043756,0.00061964197,0.00088341744,0.00027171063,0.0015504698,0.00008489628,0.00006077169],"category_scores_gemma":[0.000012519626,0.00023295905,0.000082543884,0.001817412,0.00025181827,0.0011703065,0.00008799845,0.00072995527,0.000037065653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007642077,0.0025352594,0.037709065,0.00008301347,0.0021388521,0.0000055995383,0.0666612,0.47005928,0.003617844,0.34110132,0.00007912724,0.07593302],"study_design_scores_gemma":[0.0006881622,0.00008931748,0.014040156,0.0003300995,0.00010438239,0.000047738642,0.0012815248,0.98139626,0.0009869307,0.000083161234,0.00034877754,0.00060347194],"about_ca_topic_score_codex":0.000031833908,"about_ca_topic_score_gemma":0.00025235777,"teacher_disagreement_score":0.92795545,"about_ca_system_score_codex":0.00023367481,"about_ca_system_score_gemma":0.000052260657,"threshold_uncertainty_score":0.9499794},"labels":[],"label_agreement":null},{"id":"W2024148770","doi":"10.1109/vtcfall.2012.6399223","title":"Clique-Based Capacity Analysis of Wireless Ad-Hoc Networks with Cooperative Relaying in Multi-Flow Scenario","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Cooperative diversity; Wireless network; Fading; Throughput; Wireless; Transmission (telecommunications); Reliability (semiconductor); Interference (communication); Channel capacity; Diversity gain; Power (physics); Channel (broadcasting); Telecommunications","score_opus":0.06327770540938062,"score_gpt":0.28670231760644754,"score_spread":0.22342461219706694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024148770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15820184,0.00070322055,0.8401995,0.00021123423,0.00005587947,0.00017237553,0.0000011721845,0.000068349975,0.000386454],"genre_scores_gemma":[0.87680244,0.00022255338,0.12245379,0.00040553792,0.000009751827,0.000022138094,0.00000971576,0.000008098191,0.00006596058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983543,0.00042921727,0.0003737011,0.0002878673,0.00019413262,0.00036077498],"domain_scores_gemma":[0.9983589,0.0002962708,0.00014951151,0.0007977239,0.0002718655,0.00012571753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079469493,0.00018159724,0.0004052238,0.00033792903,0.000155237,0.00006627652,0.000673926,0.000079597485,0.00004483628],"category_scores_gemma":[0.000032249027,0.00014213038,0.00008728214,0.0030865974,0.00010947028,0.00052019756,0.00019976459,0.0003186704,0.0000031177258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007448126,0.00073312054,0.25689715,0.000011314184,0.0004183648,0.0000033122317,0.006669707,0.6683736,0.00033397804,0.011503178,0.00008284901,0.05489893],"study_design_scores_gemma":[0.0005746536,0.000052963343,0.04200541,0.000048438065,0.000042899323,5.953585e-7,0.00009120822,0.956439,0.00037607268,8.4563834e-7,0.0001721603,0.00019571804],"about_ca_topic_score_codex":0.000035698642,"about_ca_topic_score_gemma":0.003511858,"teacher_disagreement_score":0.71860063,"about_ca_system_score_codex":0.00010738029,"about_ca_system_score_gemma":0.00008229255,"threshold_uncertainty_score":0.57959086},"labels":[],"label_agreement":null},{"id":"W2024161647","doi":"10.1109/glocom.2012.6503759","title":"Opportunistic relaying with time-division broadcast in bidirectional cooperative networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Relay; Computer network; Division (mathematics); Broadcasting (networking); Set (abstract data type); Multiplexing; Outage probability; Broadcast communication network; Scheme (mathematics); Distributed computing; Topology (electrical circuits); Telecommunications; Fading; Power (physics); Mathematics; Channel (broadcasting)","score_opus":0.03777058859506188,"score_gpt":0.26880973457750607,"score_spread":0.23103914598244418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024161647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080521945,0.00046911646,0.95932317,0.0004898047,0.00016722447,0.00017171801,4.091143e-7,0.00016799652,0.031158395],"genre_scores_gemma":[0.98671633,0.00018035903,0.010581771,0.00042779304,0.000059550217,0.000019079986,0.000008391043,0.000008743118,0.001997957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989625,0.00018660851,0.00018957736,0.00020671454,0.00016027832,0.00029432873],"domain_scores_gemma":[0.999146,0.00019386437,0.000051455572,0.00037940327,0.00010249111,0.00012679878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048762673,0.00012625258,0.00013563929,0.000106246516,0.00022003174,0.000102082115,0.00039058184,0.00004257812,0.00023206491],"category_scores_gemma":[0.000031746757,0.000097533004,0.00002086983,0.00069745985,0.00004218238,0.000712424,0.0002714855,0.00021818833,0.000096411895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052572017,0.00072334905,0.066474214,0.000007794224,0.000066793305,0.00002261373,0.0027549095,0.026117861,0.0016031411,0.4688524,0.008555807,0.42476854],"study_design_scores_gemma":[0.00048242672,0.00009422408,0.022351276,0.00007993186,0.0000032062756,0.000032634336,0.000042173135,0.96717215,0.00011395355,0.000027066708,0.009284383,0.00031658995],"about_ca_topic_score_codex":0.00000597334,"about_ca_topic_score_gemma":0.000018873245,"teacher_disagreement_score":0.97866416,"about_ca_system_score_codex":0.00006919203,"about_ca_system_score_gemma":0.000054609052,"threshold_uncertainty_score":0.39772806},"labels":[],"label_agreement":null},{"id":"W2024165348","doi":"10.1109/lsp.2010.2102017","title":"Relay Selection in Dual-Hop Vehicular Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Selection (genetic algorithm); Computer science; Rayleigh fading; Channel (broadcasting); Algorithm; Artificial intelligence; Fading; Computer network; Physics","score_opus":0.016658020982744527,"score_gpt":0.25113018062649,"score_spread":0.2344721596437455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024165348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32110783,0.00017336689,0.67400825,0.0039545894,0.00027548568,0.00010022016,6.538381e-8,0.00016910775,0.00021106904],"genre_scores_gemma":[0.9872453,0.000021422287,0.009029054,0.003400159,0.00023202528,0.000019320982,0.0000011245154,0.000012855903,0.000038688624],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880755,0.00012380828,0.00024053181,0.00033431593,0.00019126768,0.0003025407],"domain_scores_gemma":[0.9994508,0.00007069487,0.00009674484,0.00023381236,0.000080607526,0.00006736057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005261423,0.00014308513,0.00013178193,0.00014525774,0.0002819129,0.00029463042,0.00044730815,0.00008337385,0.00001626161],"category_scores_gemma":[0.000015483449,0.00014192399,0.00004038657,0.00085315556,0.000062561754,0.0005923013,0.00008926687,0.00077793986,0.000016128046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009631962,0.00006982034,0.0014731927,0.00001419675,0.000009298922,0.00003607247,0.0009469327,0.13238044,0.664246,0.0008603765,0.0028033722,0.19715066],"study_design_scores_gemma":[0.00024917346,0.000017526847,0.0020060693,0.0000619125,0.0000028023944,0.00003460573,0.0000047231774,0.99045825,0.004099755,0.000046289526,0.002793743,0.00022514339],"about_ca_topic_score_codex":0.0000059604245,"about_ca_topic_score_gemma":0.00006561045,"teacher_disagreement_score":0.8580778,"about_ca_system_score_codex":0.00004457994,"about_ca_system_score_gemma":0.00005917557,"threshold_uncertainty_score":0.5787492},"labels":[],"label_agreement":null},{"id":"W2024228560","doi":"10.1109/isit.2012.6283958","title":"How fast can dense codes achieve the min-cut capacity of line networks?","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Lossless compression; Bernoulli's principle; Computer science; Linear network coding; Coding (social sciences); Poisson distribution; Line (geometry); Algorithm; Mathematics; Data compression; Computer network; Statistics","score_opus":0.05920949760973222,"score_gpt":0.2634234295883816,"score_spread":0.2042139319786494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024228560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059702266,0.00076764316,0.91749275,0.01917041,0.00031441383,0.0001743755,0.000001930541,0.00008640194,0.0022898156],"genre_scores_gemma":[0.9903267,0.00036010452,0.0066920524,0.0009991137,0.00013441403,0.000007777843,0.0000016930961,0.0000047474546,0.0014733666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911976,0.00022897543,0.00014379385,0.00012173573,0.00013777243,0.0002479779],"domain_scores_gemma":[0.99862945,0.00025088375,0.0000860941,0.0008118064,0.00013524652,0.00008653219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048380368,0.00010419347,0.00013274161,0.000028750914,0.00020832097,0.00012119537,0.0009778639,0.000035831315,0.000016995295],"category_scores_gemma":[0.000049570757,0.000058284375,0.000052505624,0.0003347559,0.00011392025,0.0002967725,0.00044759092,0.00016697923,0.0000043106247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002112764,0.00038949808,0.010031425,0.00001635253,0.0001301308,0.0000012018841,0.013193564,0.0015315451,0.00552061,0.6327867,0.017068993,0.31930885],"study_design_scores_gemma":[0.0008635224,0.00025374428,0.019023847,0.000097637436,0.000042885444,0.000056078574,0.00095683633,0.88536334,0.02896923,0.00081416377,0.06268845,0.00087023876],"about_ca_topic_score_codex":0.000022916376,"about_ca_topic_score_gemma":0.0006119664,"teacher_disagreement_score":0.9306245,"about_ca_system_score_codex":0.000021039637,"about_ca_system_score_gemma":0.00002050769,"threshold_uncertainty_score":0.23767678},"labels":[],"label_agreement":null},{"id":"W2024371039","doi":"10.1109/wimob.2010.5644849","title":"An efficient relay assignment scheme for multiuser cognitive radio networks with discrete power control","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Cognitive radio; Computer science; Integer programming; Mathematical optimization; Optimization problem; Scheme (mathematics); Generalized assignment problem; Power control; Interference (communication); Integer (computer science); Linear programming; Power (physics); Algorithm; Wireless; Computer network; Mathematics; Telecommunications","score_opus":0.012899522245034796,"score_gpt":0.2705992731268626,"score_spread":0.2576997508818278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024371039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022822293,0.000067378576,0.973513,0.0008049978,0.00023556036,0.00073010137,0.000002883267,0.00016599736,0.0016578094],"genre_scores_gemma":[0.917931,0.000009957743,0.08075839,0.00086565554,0.00005778409,0.00009630336,0.0000077415725,0.000014768064,0.00025837918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987784,0.000106765125,0.0001974939,0.00040808247,0.00018590229,0.00032335665],"domain_scores_gemma":[0.99834824,0.0003668179,0.00008629643,0.0007406566,0.00027925067,0.0001787363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004862512,0.00017697155,0.00017628094,0.00004801041,0.00032826644,0.0002239454,0.0007187291,0.000068551,0.00009038075],"category_scores_gemma":[0.000043822172,0.00012418906,0.000055019675,0.00020180592,0.000091732494,0.0002489854,0.00011582433,0.000297755,0.0000107473625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013424115,0.0025787703,0.013267822,0.000019940024,0.0007336407,0.000028729322,0.008412914,0.20051219,0.026213774,0.6447624,0.00618961,0.09593783],"study_design_scores_gemma":[0.0022106178,0.00031156512,0.0026734755,0.000022976568,0.000010114784,0.000004492217,0.00005835163,0.99120355,0.0005387565,0.000009622673,0.0027061251,0.00025037688],"about_ca_topic_score_codex":0.0000021090673,"about_ca_topic_score_gemma":0.000058500267,"teacher_disagreement_score":0.8951087,"about_ca_system_score_codex":0.000024033585,"about_ca_system_score_gemma":0.000049157683,"threshold_uncertainty_score":0.50642824},"labels":[],"label_agreement":null},{"id":"W2024623390","doi":"10.1109/glocom.2011.6133843","title":"Two-Dimensional Superposition Modulation and Power Allocation for Cooperative Wireless Communication System","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Goodput; Rayleigh fading; Computer science; Relay; Spectral efficiency; Superposition principle; Transmitter power output; Transmission (telecommunications); Modulation (music); Network packet; Signal-to-noise ratio (imaging); Wireless; Bit error rate; Node (physics); Electronic engineering; Maximal-ratio combining; Communications system; Quadrature amplitude modulation; Power (physics); Computer network; Fading; Throughput; Telecommunications; Channel (broadcasting); Mathematics; Engineering; Physics; Transmitter","score_opus":0.04366883935684779,"score_gpt":0.26677342385537656,"score_spread":0.22310458449852877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024623390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10463336,0.00024233056,0.8880559,0.0007864484,0.00010935162,0.0006497285,0.0000022219365,0.00024290702,0.005277699],"genre_scores_gemma":[0.9060797,0.000036752626,0.093397655,0.00021175588,0.000011039445,0.00010392222,0.000035692552,0.00000768199,0.000115821975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906844,0.00019673485,0.00023897074,0.00025295792,0.0001156135,0.00012729483],"domain_scores_gemma":[0.9986977,0.00012666549,0.00008035142,0.0005634412,0.00047313634,0.0000587089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040702242,0.00011641559,0.00012220035,0.00007697443,0.0004402281,0.0000978257,0.00036971242,0.00004647721,0.0000171707],"category_scores_gemma":[0.000014080723,0.000107638414,0.000028508255,0.00019741543,0.000051412542,0.0007465025,0.00020631458,0.00007423978,0.000010123911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017867866,0.00005048459,0.00010173008,0.000007701981,0.000015589374,1.4890745e-7,0.0020337827,0.00016854779,0.0067203864,0.9798923,0.00018250827,0.010808928],"study_design_scores_gemma":[0.00067777827,0.00010040402,0.0034946615,0.00006469679,0.000007202245,0.000012371945,0.00019435311,0.988585,0.0057174573,0.00081311254,0.00013815096,0.00019483738],"about_ca_topic_score_codex":0.000021699176,"about_ca_topic_score_gemma":0.000043945416,"teacher_disagreement_score":0.98841643,"about_ca_system_score_codex":0.00006907831,"about_ca_system_score_gemma":0.000034477205,"threshold_uncertainty_score":0.4389367},"labels":[],"label_agreement":null},{"id":"W2024633871","doi":"10.1016/j.dam.2009.02.013","title":"Broadcasting from multiple originators","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Graph; Broadcasting (networking); Wheel graph; Discrete mathematics; Computer science; Graph power; Computer network; Line graph","score_opus":0.028759445797102177,"score_gpt":0.26979773367387655,"score_spread":0.24103828787677437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024633871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02497398,0.00014243164,0.9313123,0.00047199367,0.00007646306,0.0002029608,0.0000021521262,0.00034669324,0.042471014],"genre_scores_gemma":[0.710622,0.000044493823,0.28889373,0.0003278297,0.000041493604,0.000009574122,0.000007001505,0.0000069452262,0.00004690992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990721,0.000016102744,0.0002584398,0.00024501196,0.00019225142,0.00021608957],"domain_scores_gemma":[0.998687,0.00024499887,0.00011318108,0.0008328217,0.000041012874,0.00008093461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015597063,0.00015125045,0.00018542557,0.000047565405,0.00019145335,0.00017049702,0.00093001773,0.0000435354,0.000026440637],"category_scores_gemma":[0.000057672827,0.00013446432,0.0000469511,0.00030218755,0.000026575219,0.00016679299,0.00019799198,0.00014885682,0.00010748041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017104709,0.00006726376,0.00003141262,0.0000055263645,0.000011796432,0.000001912646,0.0023832459,0.000069522845,0.00957833,0.87162423,0.0004081012,0.11581696],"study_design_scores_gemma":[0.001158132,0.00006318724,0.0015770466,0.00014080021,0.000024268626,0.0000060370376,0.00040208828,0.74473053,0.017265638,0.21803014,0.015696073,0.0009060826],"about_ca_topic_score_codex":0.0000018583469,"about_ca_topic_score_gemma":0.0000034221741,"teacher_disagreement_score":0.744661,"about_ca_system_score_codex":0.000031354273,"about_ca_system_score_gemma":0.000021736063,"threshold_uncertainty_score":0.5483296},"labels":[],"label_agreement":null},{"id":"W2024637881","doi":"10.1109/ispacs.2011.6146093","title":"Edge node based greedy routing algorithm (ENBGCR)for cooperative wireless ad hoc networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Cooperative diversity; Wireless Routing Protocol; Greedy algorithm; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Algorithm; Distributed computing; Fading; Routing protocol; Wireless; Channel (broadcasting); Routing (electronic design automation); Telecommunications","score_opus":0.06252300682788582,"score_gpt":0.27184068720576554,"score_spread":0.20931768037787973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024637881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000415045,0.0006335126,0.9901517,0.0005445902,0.00040657053,0.0004154467,0.0000030353374,0.00032858827,0.007101527],"genre_scores_gemma":[0.55361974,0.0004689167,0.44097987,0.0034086397,0.00014506678,0.00014984935,0.000022133998,0.000031229676,0.0011745446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834067,0.00020012246,0.00035349018,0.0004899859,0.00016039805,0.00045534747],"domain_scores_gemma":[0.9980666,0.0002842166,0.00011886943,0.00093241106,0.00044580997,0.00015206134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005848531,0.0002450487,0.0002679771,0.00008688409,0.0005625281,0.00019010052,0.0014077029,0.00009510483,0.00015355209],"category_scores_gemma":[0.000040246865,0.00021580633,0.00010961307,0.0005891696,0.00008486072,0.00046509763,0.00045831015,0.0002461784,0.000035412453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021938777,0.0001739354,0.00018717721,0.0000058345336,0.000045845958,0.000005053597,0.0020854957,0.0005900357,0.00016119858,0.07403289,0.003844542,0.9188461],"study_design_scores_gemma":[0.0006828321,0.00011768373,0.00040223505,0.000041671865,0.000007367096,0.0000028518978,0.00006865323,0.99029255,0.0012899787,0.00007416204,0.006695015,0.00032502037],"about_ca_topic_score_codex":0.0000075645808,"about_ca_topic_score_gemma":0.000075568685,"teacher_disagreement_score":0.9897025,"about_ca_system_score_codex":0.00006288509,"about_ca_system_score_gemma":0.000117551484,"threshold_uncertainty_score":0.8800327},"labels":[],"label_agreement":null},{"id":"W2024982724","doi":"10.1109/tcomm.2012.082812.110390","title":"Multiple CFO Mitigation in Amplify-and-Forward Cooperative OFDM Transmission","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Decoding methods; Computer science; Carrier frequency offset; Interference (communication); Algorithm; Transmission (telecommunications); Multiplexing; Decodes; Electronic engineering; Telecommunications; Channel (broadcasting); Engineering; Frequency offset","score_opus":0.05104095675021321,"score_gpt":0.30287572687776193,"score_spread":0.25183477012754873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024982724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003584999,0.0015247737,0.98471844,0.006410198,0.00017167143,0.0004038103,0.000007653399,0.00017836054,0.003000078],"genre_scores_gemma":[0.96823037,0.006326657,0.024511028,0.00043156667,0.000017337528,0.00020273082,0.000012691202,0.000015312698,0.00025229726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825436,0.00061032054,0.00040632658,0.0002516715,0.00017385044,0.00030346547],"domain_scores_gemma":[0.9970341,0.0008203358,0.00008225672,0.001760664,0.00012224558,0.00018044088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005255141,0.00019708634,0.00020943565,0.00028513026,0.000821104,0.000082941675,0.0012258148,0.00010570958,0.00005588544],"category_scores_gemma":[0.000021092686,0.00019164693,0.00005752006,0.0008534617,0.00021081416,0.0009851814,0.000026808724,0.0005777722,0.000057786132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047206766,0.0020527807,0.0013088827,0.000028666313,0.00009275158,7.463967e-7,0.029920014,0.005638032,0.015927553,0.12848377,0.00073110336,0.8157685],"study_design_scores_gemma":[0.004243591,0.000387906,0.01650626,0.00058337825,0.00007319627,0.000047685466,0.0013102934,0.79617,0.02239404,0.0019427205,0.15472914,0.0016118009],"about_ca_topic_score_codex":0.000044378972,"about_ca_topic_score_gemma":0.00030546886,"teacher_disagreement_score":0.9646454,"about_ca_system_score_codex":0.00011214773,"about_ca_system_score_gemma":0.00004813111,"threshold_uncertainty_score":0.7815135},"labels":[],"label_agreement":null},{"id":"W2025012020","doi":"10.1109/glocomw.2012.6477616","title":"Delay performance of opportunistic network coding for a bidirectional relaying link","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Relay; Network packet; Computer network; Linear network coding; Transmission delay; Scheduling (production processes); End-to-end delay; Processing delay; Network delay; Node (physics); Real-time computing; Engineering","score_opus":0.08577836556351305,"score_gpt":0.29779500175155804,"score_spread":0.212016636188045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025012020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013397607,0.0006069639,0.9752983,0.0005079383,0.0005716572,0.0001667377,7.9975393e-7,0.00010802325,0.009342012],"genre_scores_gemma":[0.90583634,0.00043618432,0.09255376,0.00024091866,0.00024792194,0.00002720298,0.00000404182,0.0000057316115,0.000647922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925065,0.00004630013,0.00022727455,0.00011681354,0.00010567681,0.00025326264],"domain_scores_gemma":[0.9990625,0.00030184205,0.000093750954,0.00032627763,0.00013554297,0.00008010326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007017671,0.00007773948,0.00011690457,0.00004732644,0.00027575283,0.000028686483,0.0004006114,0.00003351907,0.000038321352],"category_scores_gemma":[0.000051476985,0.00007064527,0.000049490598,0.00029683375,0.000026359608,0.00039512356,0.00019660385,0.000083625804,0.000008232768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001538264,0.00005387124,0.015416765,0.000031388645,0.00003285951,1.7040765e-7,0.00045251095,0.0011123716,0.0009039653,0.78464603,0.0046493374,0.19268534],"study_design_scores_gemma":[0.00029305613,0.00009518174,0.005686666,0.00008523783,0.000010083203,0.000017605216,0.0000122916845,0.929369,0.00078015495,0.00024913801,0.06318101,0.00022057742],"about_ca_topic_score_codex":8.037133e-7,"about_ca_topic_score_gemma":0.0000016791741,"teacher_disagreement_score":0.92825663,"about_ca_system_score_codex":0.000027607357,"about_ca_system_score_gemma":0.000046499943,"threshold_uncertainty_score":0.28808305},"labels":[],"label_agreement":null},{"id":"W2025091709","doi":"10.1109/icoin.2012.6164400","title":"Capacity-optimal relay and base station placement in wireless networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"RSS; Base station; Computer science; Relay; Transmitter power output; Computer network; Wireless network; Cellular network; Wireless; Real-time computing; Algorithm; Power (physics); Telecommunications; Channel (broadcasting)","score_opus":0.041860516393725546,"score_gpt":0.2666277808050712,"score_spread":0.22476726441134567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025091709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24890359,0.00022196096,0.7481936,0.0005790197,0.00009707044,0.00009369061,1.6877364e-7,0.000044644272,0.0018662481],"genre_scores_gemma":[0.9715119,0.0003483395,0.027528912,0.0003779096,0.000028130542,0.000013268918,0.0000023907114,0.0000030974918,0.00018603372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933755,0.00013115865,0.00013505314,0.00012216392,0.00008091171,0.00019313575],"domain_scores_gemma":[0.999509,0.00010076009,0.000031194177,0.0002535754,0.000029176166,0.00007629367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903874,0.000068228466,0.00007118025,0.000054501543,0.00008736097,0.00006165595,0.00019141634,0.000027596472,0.000036883626],"category_scores_gemma":[0.000010766996,0.00006194982,0.000009768031,0.0002178479,0.000021978603,0.0004970339,0.00020134145,0.000120200864,0.000007667961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020923266,0.000302289,0.06080908,0.0000116699575,0.000017649956,0.000002264152,0.008855854,0.021114215,0.00096866034,0.71788096,0.0042077457,0.18580869],"study_design_scores_gemma":[0.00030146822,0.00002239051,0.01691441,0.000014747206,0.0000011282614,0.0000029090288,0.000062539846,0.98101103,0.0002449377,0.00001569766,0.0012944969,0.00011421917],"about_ca_topic_score_codex":0.000010468762,"about_ca_topic_score_gemma":0.00007869497,"teacher_disagreement_score":0.95989686,"about_ca_system_score_codex":0.00004002945,"about_ca_system_score_gemma":0.000009844306,"threshold_uncertainty_score":0.252624},"labels":[],"label_agreement":null},{"id":"W2025326060","doi":"10.1155/2011/310647","title":"The Exploration of Network Coding in IEEE 802.15.4 Networks","year":2011,"lang":"en","type":"article","venue":"International Journal of Digital Multimedia Broadcasting","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Superframe; Exploit; Computer network; IEEE 802.15; Linear network coding; Multicast; Coding (social sciences); Efficient energy use; Wireless; Protocol stack; Wireless sensor network; Telecommunications; Computer security","score_opus":0.09095593817519135,"score_gpt":0.2964840506562626,"score_spread":0.20552811248107125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025326060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029738603,0.0011937858,0.9606577,0.00061548146,0.003583793,0.00014248677,0.0000015200134,0.000029532692,0.004037095],"genre_scores_gemma":[0.98617303,0.00059899286,0.012724726,0.00004808568,0.00041662104,0.0000030849005,0.0000014239122,0.000008058556,0.0000259927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835,0.000094246534,0.00082645274,0.000120335644,0.00040476987,0.00020415495],"domain_scores_gemma":[0.99747545,0.000789607,0.0007408498,0.00020763736,0.00072034914,0.000066106455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077935075,0.000113641276,0.00017326917,0.00014409557,0.000094757524,0.00024527963,0.0015714802,0.000040897074,0.000006490124],"category_scores_gemma":[0.00054413616,0.000087966,0.00009777961,0.0003480633,0.00007681839,0.002219347,0.00027679058,0.0002972491,0.0000036926028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010982259,0.00015247929,0.0165014,0.0000031105183,0.00011677612,0.000050703056,0.004624804,0.025573876,0.0002818282,0.007761513,0.0004513299,0.94437236],"study_design_scores_gemma":[0.0011579854,0.00015922697,0.009284828,0.00056353543,0.000007775651,0.000103079794,0.00034464657,0.9827773,0.00079868274,0.0032810064,0.0012867767,0.00023513722],"about_ca_topic_score_codex":0.0000036383015,"about_ca_topic_score_gemma":0.000021513742,"teacher_disagreement_score":0.95720345,"about_ca_system_score_codex":0.00006864888,"about_ca_system_score_gemma":0.00006933015,"threshold_uncertainty_score":0.35871494},"labels":[],"label_agreement":null},{"id":"W2025342085","doi":"10.1109/tvt.2013.2263509","title":"Performance of Differential Amplify-and-Forward Relaying in Multinode Wireless Communications","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rayleigh fading; Pairwise error probability; Bit error rate; Wireless; Signal-to-noise ratio (imaging); Autoregressive model; Autocorrelation; Fading; Computer science; Phase-shift keying; Electronic engineering; Algorithm; Channel (broadcasting); Mathematics; Engineering; Telecommunications; Statistics","score_opus":0.020994264308093813,"score_gpt":0.25114818193188193,"score_spread":0.23015391762378812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025342085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61979717,0.000107708,0.37822953,0.0014232085,0.00005285337,0.00018474813,8.2887567e-7,0.0001213606,0.00008260355],"genre_scores_gemma":[0.9886345,0.0019010683,0.009209176,0.00005719616,0.000002395942,0.00015307359,0.0000010667266,0.000008599017,0.00003291958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990763,0.000097363336,0.00030529217,0.00022790983,0.0001013154,0.00019183253],"domain_scores_gemma":[0.9984196,0.000101197365,0.00008189803,0.0012655479,0.000095796546,0.00003596333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010999573,0.00012334737,0.00020145497,0.00043523288,0.00022744345,0.000028320319,0.0011159537,0.00016067234,0.000017973553],"category_scores_gemma":[0.0000053787653,0.00012152421,0.000040143463,0.0006887925,0.00022768254,0.00023777869,0.000041965603,0.00054206495,0.000023277511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000981296,0.000479649,0.0027901507,0.000032402768,0.00005387921,0.0000013468391,0.0007430174,0.0025024405,0.079450265,0.018521994,0.000015920066,0.8953991],"study_design_scores_gemma":[0.0006120758,0.00012123007,0.0036556325,0.000108894805,0.0000094531215,0.000015695605,0.000084160994,0.9575542,0.037155274,0.00021526043,0.00025358482,0.00021452161],"about_ca_topic_score_codex":0.00002709255,"about_ca_topic_score_gemma":0.000064610824,"teacher_disagreement_score":0.9550518,"about_ca_system_score_codex":0.000039660834,"about_ca_system_score_gemma":0.00002171195,"threshold_uncertainty_score":0.49556133},"labels":[],"label_agreement":null},{"id":"W2025585226","doi":"10.1109/vtcfall.2013.6692370","title":"Power Allocation in Training for Amplify-and-Forward Relay Network","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Channel (broadcasting); Relay channel; Node (physics); Minimum mean square error; Mean squared error; Channel state information; Power (physics); Telecommunications; Statistics; Mathematics; Wireless; Engineering","score_opus":0.05259331293627771,"score_gpt":0.2879458002356032,"score_spread":0.23535248729932545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025585226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01154275,0.00033684153,0.970914,0.005634563,0.00012987597,0.00041330943,1.1295404e-7,0.000098320634,0.010930211],"genre_scores_gemma":[0.9050273,0.00013644372,0.09271438,0.0013585433,0.000029802533,0.0001196377,0.000002271021,0.0000049475234,0.00060672435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934256,0.000053433196,0.00017127777,0.0001811492,0.000058247282,0.00019332823],"domain_scores_gemma":[0.999331,0.0002128312,0.00003470851,0.0003058333,0.00006588522,0.000049731643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037465084,0.00006997767,0.000095158946,0.00004382151,0.00011153933,0.00013180624,0.00034153982,0.000038183967,0.000065695276],"category_scores_gemma":[0.00004461844,0.00006176967,0.000019336836,0.00023419071,0.000017650618,0.00037757913,0.00014857059,0.00008689916,0.000024702362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002986633,0.000021587333,0.00091073965,0.0000029498906,0.000008660775,1.722302e-7,0.0034220756,0.0013045167,0.00029971646,0.7183152,0.010260854,0.26545054],"study_design_scores_gemma":[0.00079584634,0.00010754719,0.028255006,0.000055470166,0.0000021532826,0.000004777406,0.0002689965,0.87398773,0.000074996344,0.014378367,0.081718735,0.00035036608],"about_ca_topic_score_codex":0.0000073078036,"about_ca_topic_score_gemma":0.000052765146,"teacher_disagreement_score":0.89348453,"about_ca_system_score_codex":0.000019718324,"about_ca_system_score_gemma":0.00002296156,"threshold_uncertainty_score":0.2518894},"labels":[],"label_agreement":null},{"id":"W2026520051","doi":"10.1109/icc.2010.5502232","title":"Cooperative Relay Communication Performance under Spectrum-Sharing Resource Requirements","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Computer science; Computer network; Bandwidth (computing); Interference (communication); Shared resource; Transmission (telecommunications); Context (archaeology); Spectral efficiency; Resource (disambiguation); Telecommunications; Power (physics)","score_opus":0.04810530028057277,"score_gpt":0.29208627249747127,"score_spread":0.2439809722168985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026520051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48908746,0.00029477634,0.19581354,0.01376725,0.00044042311,0.00051818084,9.077541e-7,0.0007962952,0.29928118],"genre_scores_gemma":[0.97657716,0.00036366566,0.017763335,0.0012803166,0.000039825536,0.000022556584,0.000009923591,0.0000110193705,0.0039322153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882984,0.00010658325,0.00027689137,0.0003299381,0.00020813591,0.00024862183],"domain_scores_gemma":[0.99757737,0.00009924269,0.00009352988,0.0020164687,0.0001245891,0.000088775836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056218496,0.0001439696,0.00012589063,0.000086726046,0.0006888659,0.00026524064,0.0022714206,0.000063603096,0.0002820283],"category_scores_gemma":[0.000040274208,0.00012994891,0.000035205958,0.00049044937,0.000093191484,0.00087190664,0.0012710867,0.0005498596,0.00017817035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009392791,0.000098149765,0.0018429322,0.0000048298016,0.000026888905,7.578243e-7,0.0015413186,0.0009906307,0.0082023,0.9381227,0.0026552498,0.046504863],"study_design_scores_gemma":[0.0013102442,0.00016992053,0.028615927,0.000130818,0.00001102927,0.000039023773,0.00022587641,0.76722354,0.03801565,0.0027487911,0.16056396,0.00094524596],"about_ca_topic_score_codex":0.0000076135652,"about_ca_topic_score_gemma":0.00021004677,"teacher_disagreement_score":0.9353739,"about_ca_system_score_codex":0.00005065354,"about_ca_system_score_gemma":0.00004413635,"threshold_uncertainty_score":0.5299163},"labels":[],"label_agreement":null},{"id":"W2026540849","doi":"10.1007/s11276-013-0546-4","title":"Fair resource allocation and DF relay selection for multiuser OFDMA-based cooperative networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Relay; Mathematical optimization; Subcarrier; Resource allocation; Selection (genetic algorithm); Optimization problem; Joint (building); Iterative method; Simple (philosophy); Power (physics); Algorithm; Orthogonal frequency-division multiplexing; Computer network; Mathematics","score_opus":0.017391700644767995,"score_gpt":0.2446251056722959,"score_spread":0.2272334050275279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026540849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020264765,0.00096886896,0.97399175,0.0030660296,0.00021778842,0.0010285272,8.6757933e-7,0.00029772503,0.00016369669],"genre_scores_gemma":[0.98584574,0.0006178344,0.01023422,0.0017180972,0.00028061282,0.0007526986,0.000039462215,0.00003363712,0.0004776817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981331,0.00031664528,0.0003763415,0.00056722376,0.00015927012,0.00044739887],"domain_scores_gemma":[0.998069,0.000547707,0.00018020894,0.00054828654,0.00049355207,0.0001612502],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004366271,0.00027172823,0.00027510585,0.00009829172,0.00069492083,0.00042942975,0.0006250092,0.00020675638,0.000031297182],"category_scores_gemma":[0.000042110543,0.00025642506,0.000070802744,0.00067836506,0.000099721874,0.00058525044,0.00022320259,0.0003823152,0.000008764763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003135889,0.00008878113,0.0014515033,0.000012362727,0.000043805587,3.1608027e-7,0.0003252444,0.7306079,0.0004073463,0.021329923,0.013424191,0.23227721],"study_design_scores_gemma":[0.000825094,0.00010020039,0.0021830753,0.000089296016,0.0000116254305,0.0000023887787,0.000028471875,0.9887632,0.00022950937,0.000031091386,0.0074218153,0.0003142116],"about_ca_topic_score_codex":0.00002847629,"about_ca_topic_score_gemma":0.00014342197,"teacher_disagreement_score":0.965581,"about_ca_system_score_codex":0.00008155277,"about_ca_system_score_gemma":0.000056904886,"threshold_uncertainty_score":0.9999888},"labels":[],"label_agreement":null},{"id":"W2026640919","doi":"10.1109/icnp.2012.6459966","title":"Airlift: Video conferencing as a cloud service using inter-datacenter networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cloud computing; Computer science; Scalability; Airlift; Videoconferencing; Computer network; Network packet; Throughput; Linear network coding; Service provider; Service (business); Multimedia; Database; Wireless; Telecommunications; Operating system","score_opus":0.07911203174835972,"score_gpt":0.3130779261219503,"score_spread":0.23396589437359055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026640919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025069509,0.0004922685,0.9617827,0.0015953635,0.0008892645,0.00012969137,3.4573404e-7,0.00020821359,0.0098326495],"genre_scores_gemma":[0.9758335,0.00012621224,0.0160787,0.007341692,0.00031292593,0.000005749324,0.000004798098,0.000011329478,0.00028513896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873585,0.00019360482,0.0002653143,0.00023691035,0.000137713,0.0004306049],"domain_scores_gemma":[0.99853814,0.00011658835,0.000084792475,0.0009130221,0.00016361082,0.00018387355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048214183,0.00016191127,0.00016084293,0.000067397326,0.00024259884,0.00025352088,0.0011334545,0.00005918576,0.0002832237],"category_scores_gemma":[0.000029788873,0.00014333412,0.00004882355,0.00048401585,0.000021219546,0.0011232037,0.0013938696,0.00023554874,0.00020487586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032599895,0.00040953115,0.020999758,0.000035976147,0.00015877791,0.0000070745373,0.012252458,0.0023872512,0.0028475914,0.78742117,0.015870305,0.15757753],"study_design_scores_gemma":[0.0003086579,0.000020584752,0.00085825485,0.00009668596,0.000008360464,0.000038747705,0.00013789744,0.95555323,0.0005273081,0.000114591385,0.042037923,0.00029776653],"about_ca_topic_score_codex":0.000063990265,"about_ca_topic_score_gemma":0.00013429699,"teacher_disagreement_score":0.95316595,"about_ca_system_score_codex":0.000072775736,"about_ca_system_score_gemma":0.000048237875,"threshold_uncertainty_score":0.58449954},"labels":[],"label_agreement":null},{"id":"W2026698357","doi":"10.3934/amc.2012.6.443","title":"An algebraic approach for decoding spread codes","year":2012,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Finite field; Decoding methods; Dimension (graph theory); Combinatorics; Discrete mathematics; Algebraic number; Coding theory; List decoding; Linear code; Factorization; Matrix (chemical analysis); Extension (predicate logic); Rank (graph theory); Block code; Concatenated error correction code; Algorithm","score_opus":0.07231315160863089,"score_gpt":0.3736553630367348,"score_spread":0.3013422114281039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026698357","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012580182,0.011332126,0.97489005,0.00020859635,0.000040346422,0.00033942968,0.0000033417857,0.00006389579,0.011864196],"genre_scores_gemma":[0.47384554,0.0035037384,0.52248645,0.00002747225,0.00000839996,0.00010182583,0.000011421192,0.000005904253,0.000009213919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901813,0.00011843566,0.00041519883,0.00011935903,0.00011276312,0.00021609858],"domain_scores_gemma":[0.9959603,0.0009500464,0.00021023629,0.0026849979,0.00013195554,0.00006247167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009363141,0.000106710206,0.00021673975,0.00012207344,0.00019450752,0.000039200146,0.0030566491,0.00003719001,0.0000031780014],"category_scores_gemma":[0.00017574655,0.00010502201,0.000049837978,0.00039659208,0.00012752015,0.0015102011,0.00047698687,0.00012423877,0.0000022373051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.548567e-7,0.00055438763,0.00061810575,0.000046349975,0.0000060991724,7.2579898e-9,0.003086102,0.0003439181,0.00052245974,0.966573,0.000016654138,0.028231952],"study_design_scores_gemma":[0.0004053505,0.000058672023,0.00043623443,0.00013283313,0.000013692557,0.00000468924,0.00083783537,0.89985186,0.0017926298,0.088137254,0.008027208,0.00030174947],"about_ca_topic_score_codex":8.5508935e-7,"about_ca_topic_score_gemma":0.000023068964,"teacher_disagreement_score":0.89950794,"about_ca_system_score_codex":0.000030182544,"about_ca_system_score_gemma":0.000023789022,"threshold_uncertainty_score":0.5680065},"labels":[],"label_agreement":null},{"id":"W2026804562","doi":"10.1155/2008/586067","title":"Real-Time Communications in Large-Scale Wireless Networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Digital Multimedia Broadcasting","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Wireless network; Wireless broadband; Wireless; Quality of service; Wi-Fi array; Municipal wireless network; Wireless mesh network; Wireless WAN; Cognitive radio; Network packet; Fixed wireless; Throughput; Telecommunications","score_opus":0.04102657310718558,"score_gpt":0.3017624987138302,"score_spread":0.2607359256066446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026804562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5934777,0.0011351771,0.38218263,0.004440325,0.0017361491,0.00027148053,0.000018707564,0.00017379274,0.016564019],"genre_scores_gemma":[0.96349186,0.0017749477,0.034265924,0.000087074244,0.00022078126,0.0000034059485,0.000013239336,0.00001192902,0.00013085554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831873,0.00010448582,0.0007352346,0.00016029422,0.0004453207,0.00023596187],"domain_scores_gemma":[0.9975856,0.000634195,0.0004540794,0.000484926,0.00072087743,0.00012032507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042579335,0.00013699234,0.000231941,0.00029809016,0.0001378558,0.00022750454,0.0029353332,0.000055465996,0.000017331527],"category_scores_gemma":[0.0002863039,0.00013413027,0.00011572959,0.00039754642,0.00010272035,0.0016079473,0.00096182956,0.00040812825,0.000029436003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011245825,0.0017248698,0.14708515,0.0000064881174,0.00026194265,0.00059613166,0.0149459625,0.009606685,0.004379052,0.0030070017,0.0020507204,0.81622356],"study_design_scores_gemma":[0.0010777751,0.00004357736,0.014549464,0.0001706489,0.0000027864164,0.00045644594,0.000091015354,0.9815773,0.00007894017,0.0000881965,0.0016895671,0.00017429997],"about_ca_topic_score_codex":0.0000047748267,"about_ca_topic_score_gemma":0.000014275282,"teacher_disagreement_score":0.9719706,"about_ca_system_score_codex":0.00014338238,"about_ca_system_score_gemma":0.00012459682,"threshold_uncertainty_score":0.5469674},"labels":[],"label_agreement":null},{"id":"W2026871614","doi":"10.1109/isit.2012.6283518","title":"Broadcast approaches to dual-hop parallel relay networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Rayleigh fading; Decoding methods; Upper and lower bounds; Ergodic theory; Hop (telecommunications); Transmission (telecommunications); Channel (broadcasting); Block Error Rate; Fading; Constraint (computer-aided design); Computer network; Topology (electrical circuits); Power (physics); Algorithm; Telecommunications; Mathematics; Telecommunications link","score_opus":0.18043655909797,"score_gpt":0.2795355560878664,"score_spread":0.09909899698989641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026871614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094903354,0.0011222764,0.95170766,0.0034152176,0.00022710617,0.00016267024,8.276939e-8,0.0002145551,0.04220138],"genre_scores_gemma":[0.8928348,0.00017322888,0.10107045,0.0019971393,0.00020926261,0.00003672,0.0000021667206,0.000008879696,0.0036673576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989271,0.00013900135,0.00018216806,0.00021854139,0.00013660763,0.0003965388],"domain_scores_gemma":[0.998674,0.00013491805,0.000036063626,0.0008725333,0.000034786313,0.000247732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049889315,0.00012629532,0.0001237665,0.000060545015,0.00020808072,0.00013845864,0.0007354709,0.000049517177,0.00008912628],"category_scores_gemma":[0.000033138367,0.00010621896,0.00004653374,0.0005172695,0.000022235354,0.0005100639,0.0008453814,0.00016301195,0.0003335709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038528015,0.000098537734,0.0008953302,0.0000015478079,0.0000144129335,7.3383103e-7,0.001933388,0.0078102276,0.000031175645,0.7777103,0.022315552,0.1891849],"study_design_scores_gemma":[0.0002808996,0.00005283564,0.0041059377,0.000018673965,0.0000045849433,0.000016514037,0.00008824608,0.74407893,0.00010630785,0.00011103263,0.2506893,0.00044674912],"about_ca_topic_score_codex":0.0000027316974,"about_ca_topic_score_gemma":0.000010121761,"teacher_disagreement_score":0.89188576,"about_ca_system_score_codex":0.000031535354,"about_ca_system_score_gemma":0.000014950098,"threshold_uncertainty_score":0.43314835},"labels":[],"label_agreement":null},{"id":"W2027091837","doi":"10.1109/lwc.2015.2421910","title":"Performance Analysis of Non-Orthogonal AF Relaying in Cognitive Radio Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Mathematical optimization; Computer science; Probability density function; Signal-to-noise ratio (imaging); Underlay; Channel (broadcasting); Transmission (telecommunications); Optimization problem; Quadratic growth; Quadratic equation; Topology (electrical circuits); Mathematics; Algorithm; Wireless; Telecommunications; Statistics","score_opus":0.06310172859259572,"score_gpt":0.30368277000474037,"score_spread":0.24058104141214465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027091837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67547077,0.0004969243,0.32038555,0.0020266608,0.000108670356,0.00017634992,0.0000026322002,0.000056414177,0.0012760307],"genre_scores_gemma":[0.9897264,0.0015464637,0.007757155,0.00080440775,0.000018883056,0.00007200567,0.000042676853,0.000011236222,0.000020720168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816585,0.00045482864,0.0005573525,0.0002866644,0.00025901545,0.00027627242],"domain_scores_gemma":[0.9964503,0.0005392529,0.0002670477,0.0023553688,0.00027755823,0.00011046073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009383394,0.00017235399,0.00038972884,0.0006504614,0.00022035353,0.000072005816,0.0029029606,0.00006661755,0.000004857519],"category_scores_gemma":[0.000040206967,0.00018703466,0.00012418212,0.0037121526,0.00025829824,0.0005490423,0.0006998549,0.00046351852,0.000007061967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007763058,0.0007368356,0.35648042,0.000022918095,0.001298395,0.000010417203,0.01693558,0.40909338,0.00572156,0.008151955,0.0021767819,0.1992941],"study_design_scores_gemma":[0.00047867539,0.000021299533,0.06265117,0.00010012693,0.00007277865,0.000002346839,0.000111831585,0.9360404,0.00014261635,0.000004155084,0.00017526845,0.00019932436],"about_ca_topic_score_codex":0.000031996984,"about_ca_topic_score_gemma":0.000261074,"teacher_disagreement_score":0.526947,"about_ca_system_score_codex":0.00012686351,"about_ca_system_score_gemma":0.00009708363,"threshold_uncertainty_score":0.76270527},"labels":[],"label_agreement":null},{"id":"W2027150172","doi":"10.1109/tcomm.2012.071812.110739","title":"Joint Optimal Threshold-Based Relaying and ML Detection in Network-Coded Two-Way Relay Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Phase-shift keying; Detector; Linear network coding; Relay channel; Binary number; Transmission (telecommunications); Node (physics); Bit error rate; Algorithm; Channel (broadcasting); Topology (electrical circuits); Computer network; Electronic engineering; Telecommunications; Mathematics; Engineering; Network packet; Physics; Arithmetic; Electrical engineering; Power (physics)","score_opus":0.07165189234788484,"score_gpt":0.29551240790146066,"score_spread":0.22386051555357583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027150172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0207834,0.0014773489,0.9726559,0.002637239,0.000528062,0.00040338672,0.0000026451323,0.0002702898,0.0012417561],"genre_scores_gemma":[0.9578729,0.001462157,0.039806176,0.00042843228,0.00004842232,0.0002576901,0.0000041205935,0.000023802933,0.000096261014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804896,0.0005164021,0.00046959164,0.0003094764,0.00019224822,0.00046329826],"domain_scores_gemma":[0.9966594,0.00043425907,0.00013001481,0.0024932576,0.00010892184,0.0001741693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010167428,0.00022810549,0.00023751886,0.00031983943,0.0011639498,0.00016079465,0.0011577226,0.00010926781,0.000022078302],"category_scores_gemma":[0.000014746507,0.0002452379,0.00009683554,0.001092478,0.00015047312,0.0008142473,0.00005365658,0.00085259875,0.000039223836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056065604,0.0013841079,0.00044051086,0.000020545884,0.00008876355,0.0000018647171,0.005272569,0.7375899,0.00839945,0.024262488,0.00018256009,0.22230119],"study_design_scores_gemma":[0.00096240913,0.00008372735,0.0009126319,0.00013059833,0.000021459959,0.000017711627,0.00006899271,0.986245,0.008830781,0.00018388269,0.0021695069,0.0003733261],"about_ca_topic_score_codex":0.000036790367,"about_ca_topic_score_gemma":0.0005040106,"teacher_disagreement_score":0.93708956,"about_ca_system_score_codex":0.00016950029,"about_ca_system_score_gemma":0.000052291605,"threshold_uncertainty_score":1},"labels":[],"label_agreement":null},{"id":"W2027158797","doi":"10.1109/acssc.2011.6190211","title":"A relay selection approach to bidirectional collaborative communications with imperfect CSI","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Transceiver; Relay; Computer science; Channel (broadcasting); Relay channel; Computer network; Selection (genetic algorithm); Imperfect; Probabilistic logic; Power (physics); Topology (electrical circuits); Electronic engineering; Telecommunications; Electrical engineering; Engineering; Wireless; Artificial intelligence","score_opus":0.06216117467259078,"score_gpt":0.2740156997657796,"score_spread":0.21185452509318883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027158797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024546948,0.0001246884,0.7571005,0.00068291184,0.00004543115,0.00032518612,7.9903583e-7,0.000295635,0.23897013],"genre_scores_gemma":[0.58514684,0.00011626378,0.4132792,0.00040545035,0.000013471355,0.00013933257,0.0000033841916,0.0000067249885,0.0008893275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990083,0.00024692144,0.00015435378,0.00027858166,0.00014652761,0.0001653195],"domain_scores_gemma":[0.9983342,0.00007977325,0.000053354594,0.0009844425,0.0004437267,0.00010447137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002848455,0.00011908091,0.00011423944,0.00014286775,0.00048050276,0.00009709364,0.0011227909,0.000035995472,0.00004366269],"category_scores_gemma":[0.00002235117,0.000094503564,0.00002493435,0.0020152435,0.000060021852,0.0004010966,0.00042427363,0.00017197471,0.000065037464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055582215,0.00071575196,0.0033053914,0.000004476578,0.00011189435,5.3266325e-7,0.015367603,0.00039590674,0.0017153345,0.9327488,0.007908414,0.037670314],"study_design_scores_gemma":[0.001941913,0.0019098367,0.042393807,0.00010159275,0.00004863751,0.0002003557,0.001452157,0.7369097,0.016144993,0.00088804075,0.19621357,0.0017954266],"about_ca_topic_score_codex":0.00003141194,"about_ca_topic_score_gemma":0.0002661628,"teacher_disagreement_score":0.93186074,"about_ca_system_score_codex":0.00007468743,"about_ca_system_score_gemma":0.00013890698,"threshold_uncertainty_score":0.38537434},"labels":[],"label_agreement":null},{"id":"W2027179404","doi":"10.1109/pimrc.2013.6666126","title":"Multi-destination relaying protocol for enhanced spectral efficiency","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Computer science; Computer network; Transmission (telecommunications); Spectral efficiency; Network packet; Interference (communication); Wireless; Protocol (science); Topology (electrical circuits); Power (physics); Mathematics; Telecommunications; Channel (broadcasting)","score_opus":0.07068622285175118,"score_gpt":0.3486827461316435,"score_spread":0.2779965232798923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027179404","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005703243,0.0000024228489,0.92569697,0.00071853446,0.00004116569,0.06631986,5.643299e-8,0.00020146435,0.0064492286],"genre_scores_gemma":[0.22829112,0.0000012460624,0.50067526,0.0002601359,0.000030369112,0.269035,7.5974003e-7,0.0000060709986,0.0017000083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992889,0.000046344536,0.00017661712,0.000213206,0.00009047621,0.00018444865],"domain_scores_gemma":[0.9991911,0.000113332564,0.000059328657,0.00037886587,0.00021050172,0.000046844478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019521834,0.00008152791,0.0000714327,0.0000519164,0.00023476538,0.00018409033,0.0005991716,0.000025331845,0.00010650789],"category_scores_gemma":[0.00009629204,0.00006723865,0.000035753692,0.00025540323,0.000018689787,0.0004886397,0.00014341448,0.00006923009,0.00009751932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009770976,0.0005017996,0.00022536045,0.000047782567,0.00001154415,3.628747e-7,0.0022340138,0.00074302015,0.27133545,0.27009323,0.005316947,0.4494807],"study_design_scores_gemma":[0.0010776998,0.000102777085,0.0025680454,0.000029217712,7.075536e-7,0.0000013109254,0.00001906926,0.952997,0.038922362,0.0008026156,0.003301566,0.00017757446],"about_ca_topic_score_codex":0.0000041510298,"about_ca_topic_score_gemma":0.0000091847,"teacher_disagreement_score":0.95225406,"about_ca_system_score_codex":0.000037021437,"about_ca_system_score_gemma":0.000033263677,"threshold_uncertainty_score":0.2741913},"labels":[],"label_agreement":null},{"id":"W2027348201","doi":"10.1007/s11767-010-0315-9","title":"Joint iterative decoding for simple-encoding systematic irregular-LDPC-based coded cooperation in non-ideal relay channel","year":2010,"lang":"en","type":"article","venue":"Journal of Electronics (China)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Relay; Decoding methods; Relay channel; Computer science; Ideal (ethics); Joint (building); Encoding (memory); Theoretical computer science; Channel (broadcasting); Algorithm; Code (set theory); Simple (philosophy); Tanner graph; Topology (electrical circuits); Mathematics; Telecommunications; Error floor; Artificial intelligence; Combinatorics","score_opus":0.02070989556513358,"score_gpt":0.27979646609224146,"score_spread":0.2590865705271079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027348201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15505072,0.0008046951,0.8401885,0.0025440482,0.00051168585,0.0007359055,0.0000015767208,0.000030696297,0.0001321767],"genre_scores_gemma":[0.9759854,0.00017346426,0.023323413,0.00024126671,0.00014620349,0.000048976868,0.0000061111723,0.000022762588,0.00005241241],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997484,0.00033693475,0.0010454388,0.00028281607,0.00035120719,0.0004995804],"domain_scores_gemma":[0.99740595,0.0004181507,0.00087510486,0.00055418623,0.0006044658,0.00014215977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031818291,0.00025779652,0.0006314971,0.00046130124,0.00040630114,0.000409296,0.0010134138,0.0001261724,0.000008682755],"category_scores_gemma":[0.0006953955,0.00022313272,0.00021147507,0.00066031475,0.000035843936,0.0008384538,0.00012337838,0.0010439347,0.0000027505557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042423373,0.0010547219,0.0005002498,0.0027813048,0.00040387132,0.00008540117,0.015756555,0.12841706,0.4947035,0.34061587,0.0039036868,0.011353538],"study_design_scores_gemma":[0.0015904678,0.0004979678,0.00035099385,0.0010160591,0.000026054337,0.000083878935,0.000037624515,0.9819869,0.012448042,0.0014853345,0.0002088679,0.00026780923],"about_ca_topic_score_codex":0.0000025560278,"about_ca_topic_score_gemma":0.00030993958,"teacher_disagreement_score":0.8535698,"about_ca_system_score_codex":0.00032977122,"about_ca_system_score_gemma":0.0005206401,"threshold_uncertainty_score":0.90990883},"labels":[],"label_agreement":null},{"id":"W2027567075","doi":"10.1109/ccece.2012.6335051","title":"Cooperative communication system with systematic Raptor codes","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Raptor code; Computer science; Fountain code; Relay; Decoding methods; Coding gain; Forward error correction; Computer network; Code word; Concatenated error correction code; Theoretical computer science; Real-time computing; Telecommunications; Block code","score_opus":0.033494307093758995,"score_gpt":0.2618137202275814,"score_spread":0.22831941313382242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027567075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002873989,0.0039070193,0.95789397,0.0005552133,0.00010476073,0.00066094287,6.119761e-7,0.00050925306,0.033494215],"genre_scores_gemma":[0.9726416,0.00013065207,0.026201135,0.00022837023,0.000022848868,0.00013044271,0.0000037409052,0.000008415812,0.0006328179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854094,0.0006209766,0.00026489596,0.00014546538,0.00019431303,0.00023340294],"domain_scores_gemma":[0.99786335,0.00029027637,0.00012011238,0.0013572609,0.0002542182,0.00011479758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077901414,0.00013860042,0.00025127485,0.00006420868,0.00037879677,0.00019441957,0.00107253,0.000033394535,0.000020151989],"category_scores_gemma":[0.000032687505,0.00009152263,0.000029203438,0.0004438677,0.000053119275,0.00089779374,0.00031196646,0.00011963824,0.0001571242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030814037,0.000055792996,0.00041772172,0.000496576,0.000041980897,3.20626e-7,0.002387477,0.00005516143,0.00015092257,0.99549574,0.00054740504,0.00034782267],"study_design_scores_gemma":[0.003847498,0.0006389204,0.0065511265,0.021775948,0.0001972206,0.0005728246,0.014604677,0.92837656,0.012269064,0.00009780331,0.008048435,0.0030199524],"about_ca_topic_score_codex":0.000006374458,"about_ca_topic_score_gemma":0.000028412092,"teacher_disagreement_score":0.9953979,"about_ca_system_score_codex":0.000097583,"about_ca_system_score_gemma":0.00003618579,"threshold_uncertainty_score":0.37321842},"labels":[],"label_agreement":null},{"id":"W2027585786","doi":"10.1109/icc.2004.1312562","title":"On the construction of space-time Hamiltonian constellations from group codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hamiltonian (control theory); Transmitter; Combinatorics; Diagonal; Constellation diagram; Discrete mathematics; Telecommunications; Computer science; Decoding methods; Algorithm; Geometry; Bit error rate","score_opus":0.022828057004971394,"score_gpt":0.2366377759914751,"score_spread":0.2138097189865037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027585786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14546922,0.00015164813,0.76215374,0.014696597,0.00017144857,0.0002237529,0.000005732451,0.0001550852,0.07697279],"genre_scores_gemma":[0.95614415,0.00009317821,0.043225948,0.0004097096,0.000013858396,0.000003079613,0.0000032081182,0.0000025945662,0.00010424296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945223,0.0000883361,0.0001406175,0.00012958917,0.00011169251,0.000077509845],"domain_scores_gemma":[0.9988882,0.00040720214,0.00006408348,0.00054751115,0.00006554388,0.000027452914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012993114,0.000065607725,0.00008650549,0.000039612736,0.00019372364,0.000058121783,0.00043516286,0.000024652922,0.00024957015],"category_scores_gemma":[0.000036488524,0.000044922235,0.000034698613,0.00026164798,0.00014627357,0.00011547501,0.00012198567,0.00008312412,0.000088934656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013495383,0.000020371852,0.00008562946,2.8319243e-7,0.00000952853,1.4572932e-7,0.00025354445,0.00039104957,0.0028746054,0.99009395,0.00024006811,0.006029462],"study_design_scores_gemma":[0.0032665664,0.000514558,0.02239728,0.0004643362,0.000043400905,0.000032213433,0.0008449574,0.24105729,0.08552238,0.6220309,0.0226866,0.0011395139],"about_ca_topic_score_codex":0.000032085383,"about_ca_topic_score_gemma":0.00006947804,"teacher_disagreement_score":0.81067497,"about_ca_system_score_codex":0.00002645421,"about_ca_system_score_gemma":0.000036902988,"threshold_uncertainty_score":0.27326182},"labels":[],"label_agreement":null},{"id":"W2027609975","doi":"10.1049/iet-com.2012.0407","title":"Optimisation of power allocation for asymmetric relay placement in multi‐hop relay systems","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Hop (telecommunications); Computer science; Computer network; Relay channel; Power (physics)","score_opus":0.08193746046152525,"score_gpt":0.32313633456929924,"score_spread":0.241198874107774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027609975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100267,0.0046032537,0.96758485,0.008688312,0.0003002956,0.0025863382,0.000007740458,0.00015991963,0.0060425927],"genre_scores_gemma":[0.8485949,0.0013659471,0.14861816,0.00011225376,0.0000059719755,0.0008115342,0.0000443618,0.000010814608,0.0004360466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984054,0.00038711153,0.00061697955,0.00022521167,0.00017264193,0.00019268673],"domain_scores_gemma":[0.99550897,0.00078713015,0.00028626027,0.002762047,0.000595731,0.000059848277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008141979,0.00012810757,0.00019689235,0.00034943986,0.00023592782,0.00012038171,0.0021965269,0.000080611026,0.000014823423],"category_scores_gemma":[0.00029890673,0.000131733,0.00006196049,0.0011190586,0.00007102202,0.0005653801,0.00059355766,0.00019617833,0.000041629908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024091094,0.0024492515,0.0040655937,0.00011299005,0.0001610923,2.7839252e-7,0.015716197,0.08955373,0.013599832,0.7783992,0.016748218,0.079169504],"study_design_scores_gemma":[0.00095166266,0.00009217413,0.007752453,0.000117078765,0.000008232976,0.0000018691675,0.0004922356,0.9741909,0.0004198681,0.00014439366,0.015604903,0.00022426293],"about_ca_topic_score_codex":0.000100632606,"about_ca_topic_score_gemma":0.00009956183,"teacher_disagreement_score":0.8846371,"about_ca_system_score_codex":0.00016033617,"about_ca_system_score_gemma":0.000083966384,"threshold_uncertainty_score":0.53719157},"labels":[],"label_agreement":null},{"id":"W2027767081","doi":"10.1109/vtcfall.2014.6965982","title":"Exploiting Self-Information to Improve the Performance of Multi-Way Relay Channels","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Additive white Gaussian noise; Quadrature amplitude modulation; Rayleigh fading; Computer science; Precoding; Telecommunications link; Relay; Throughput; QAM; Channel (broadcasting); Transmission (telecommunications); Electronic engineering; Fading; Computer network; Algorithm; Telecommunications; Bit error rate; Wireless; Engineering; MIMO; Physics","score_opus":0.02543156988999696,"score_gpt":0.25172141249183233,"score_spread":0.22628984260183538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027767081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14695272,0.000021416334,0.84610313,0.0017248911,0.0002631328,0.00022584543,1.9200822e-7,0.000150151,0.0045585097],"genre_scores_gemma":[0.956598,0.000056645782,0.042048875,0.0010352137,0.000031662403,0.00002539626,6.332324e-7,0.0000025008794,0.00020107777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934906,0.0000728313,0.00022572897,0.00009394002,0.00012551947,0.00013294644],"domain_scores_gemma":[0.999004,0.00010628023,0.00009003771,0.00059216656,0.00016659804,0.000040927902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006837184,0.000069061396,0.00007854168,0.00005201661,0.0002037087,0.000090573434,0.000824192,0.000020024572,0.000008928687],"category_scores_gemma":[0.00006994147,0.000045622008,0.000025888208,0.00029501328,0.000012597797,0.00078924635,0.00039529477,0.00008637828,0.000087792076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056401836,0.000059693084,0.0004872125,0.000033762095,0.000018370158,4.53031e-8,0.020060828,0.009157807,0.005168674,0.11758491,0.0011258092,0.84629726],"study_design_scores_gemma":[0.0001471267,0.000070463924,0.00072770857,0.00001730282,0.0000010928898,7.9697065e-7,0.000060441693,0.97059816,0.014881076,0.0000072413277,0.013413321,0.00007526398],"about_ca_topic_score_codex":0.000003852684,"about_ca_topic_score_gemma":0.0000037931322,"teacher_disagreement_score":0.9614404,"about_ca_system_score_codex":0.000018265891,"about_ca_system_score_gemma":0.000014169084,"threshold_uncertainty_score":0.18604115},"labels":[],"label_agreement":null},{"id":"W2028600906","doi":"10.1109/tsp.2012.2208960","title":"A Closed-Form Power Allocation and Signal Alignment for a Diagonalized MIMO Two-Way Relay Channel With Linear Receivers","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Precoding; Relay; Computer science; MIMO; Channel state information; Channel (broadcasting); Computational complexity theory; Node (physics); Relay channel; Algorithm; Power (physics); Topology (electrical circuits); Mathematics; Wireless; Telecommunications","score_opus":0.035308565902751735,"score_gpt":0.2824881752021955,"score_spread":0.24717960929944377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028600906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010836564,0.0004887701,0.9869067,0.0008393576,0.00009885878,0.000427997,0.0000040702,0.00012376354,0.00027392365],"genre_scores_gemma":[0.968112,0.000112876,0.03086571,0.00046209543,0.000056729208,0.00017286127,0.000003257296,0.000021131635,0.00019333775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987272,0.00008648564,0.00024974797,0.00032436367,0.00026202857,0.00035015936],"domain_scores_gemma":[0.9990947,0.00017043676,0.0001245016,0.00024230237,0.0001994152,0.00016861604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004519163,0.00020934133,0.00018437124,0.00014260692,0.00070261257,0.00014291436,0.00028927566,0.00006247146,0.00003040644],"category_scores_gemma":[0.0000026631621,0.00017889867,0.00006038668,0.00039330922,0.000078249825,0.0009790597,0.000006114138,0.00021309595,0.0000075979115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000654424,0.0009193556,0.000050289662,0.000115827715,0.00018134565,0.0000025844506,0.01898771,0.02552621,0.015659105,0.0021797267,0.00018299744,0.93554044],"study_design_scores_gemma":[0.0043270686,0.00088497926,0.00015692796,0.00055311894,0.00011154866,0.000048591668,0.0005433532,0.914603,0.072959684,0.00032403303,0.0045881667,0.00089953834],"about_ca_topic_score_codex":0.000004019378,"about_ca_topic_score_gemma":0.000013177702,"teacher_disagreement_score":0.95727545,"about_ca_system_score_codex":0.0000983381,"about_ca_system_score_gemma":0.00009241802,"threshold_uncertainty_score":0.72952765},"labels":[],"label_agreement":null},{"id":"W2028608901","doi":"10.1109/icassp.2014.6855077","title":"Multi-antenna relay network beamforming design for multiuser peer-to-peer communications","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Beamforming; Computer science; Computational complexity theory; Mathematical optimization; Antenna (radio); Relaxation (psychology); Transmitter power output; Power (physics); Algorithm; Computer network; Mathematics; Telecommunications","score_opus":0.12297676371267505,"score_gpt":0.3370728254138115,"score_spread":0.21409606170113646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028608901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000105929525,0.00015762853,0.97880614,0.018121865,0.00033174176,0.0007254676,0.0000012882816,0.00032834648,0.0014216144],"genre_scores_gemma":[0.14953685,0.00008316909,0.8396116,0.003162635,0.00009192344,0.00021733282,0.000012577153,0.00002056495,0.0072633503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981594,0.00034581017,0.00038906446,0.00037709667,0.00027699943,0.00045163225],"domain_scores_gemma":[0.99470484,0.0012836688,0.00010317896,0.0027589737,0.00095953885,0.00018978438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025371348,0.00019560562,0.000227042,0.000096992015,0.00092549925,0.00025987558,0.0033028354,0.00007532296,0.000017989356],"category_scores_gemma":[0.00082902075,0.00017551446,0.000100989986,0.00058969966,0.000056825236,0.000407108,0.0013515647,0.00022339985,0.00013248085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000473027,0.0005076956,0.0010849141,0.000019604613,0.00012800582,6.8652014e-7,0.00743454,0.05820783,0.0068894597,0.4478783,0.18113506,0.2966666],"study_design_scores_gemma":[0.00038696587,0.00005579762,0.0003167948,0.000026376109,0.000005188709,0.0000014369266,0.000023356564,0.7120315,0.0001492787,0.00021585198,0.28659037,0.00019711262],"about_ca_topic_score_codex":0.000009465848,"about_ca_topic_score_gemma":0.00016007444,"teacher_disagreement_score":0.6538236,"about_ca_system_score_codex":0.000056020144,"about_ca_system_score_gemma":0.000048412974,"threshold_uncertainty_score":0.7157272},"labels":[],"label_agreement":null},{"id":"W2028653892","doi":"10.1109/jsac.2012.120813","title":"GestureFlow: QoE-Aware Streaming of Multi-TouchGestures in Interactive Multimedia Applications","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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Gesture; Computer science; Session (web analytics); Multimedia; Mobile device; Network packet; Interactive media; Protocol (science); Quality of experience; Gesture recognition; Human–computer interaction; Computer network; Artificial intelligence; Quality of service; World Wide Web","score_opus":0.05588061973757499,"score_gpt":0.34641265444898034,"score_spread":0.2905320347114054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028653892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2608922,0.023895686,0.6879263,0.012045737,0.0017750632,0.003852627,0.000054851942,0.00059259153,0.008964933],"genre_scores_gemma":[0.955124,0.003769694,0.040646642,0.0001778107,0.00007613208,0.0001436998,0.000014090329,0.00001689781,0.000031000607],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997532,0.0008880512,0.00073611137,0.00020332188,0.000254462,0.00038605166],"domain_scores_gemma":[0.9956837,0.0013944247,0.00042272094,0.001807699,0.0005246251,0.00016680766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007116211,0.00021128508,0.00031204187,0.0006772041,0.00032089272,0.00008722898,0.0028842622,0.00011106215,0.000013315922],"category_scores_gemma":[0.0002998453,0.00020276464,0.00007689689,0.0019969326,0.0001121203,0.00076111685,0.00041073642,0.0014654838,0.000017055287],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012376685,0.0151779,0.2667031,0.000047889247,0.00031699004,0.000012839583,0.040965036,0.0073039625,0.021383675,0.030758344,0.0016650422,0.61554146],"study_design_scores_gemma":[0.0033346603,0.00021822228,0.7423604,0.001110272,0.000034572557,0.00016224677,0.0011156873,0.22928755,0.0048161377,0.0005698562,0.016029706,0.0009607058],"about_ca_topic_score_codex":0.000025758069,"about_ca_topic_score_gemma":0.00076054083,"teacher_disagreement_score":0.6942318,"about_ca_system_score_codex":0.00032449694,"about_ca_system_score_gemma":0.00017374867,"threshold_uncertainty_score":0.8268502},"labels":[],"label_agreement":null},{"id":"W2028697940","doi":"10.1109/ciss.2010.5464731","title":"Semi-blind channel estimation for amplify-and-forward two-way relay networks employing constant-modulus constellations","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Algorithm; Constant (computer programming); Computer science; Channel (broadcasting); Transmission (telecommunications); Relay; Constellation; Computational complexity theory; Signal-to-noise ratio (imaging); Sequence (biology); Mathematics; Telecommunications; Statistics","score_opus":0.039909168490224974,"score_gpt":0.30784661329107316,"score_spread":0.2679374448008482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028697940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006547158,0.00019618291,0.98341435,0.0016887677,0.00067740853,0.00055979786,0.0000032767916,0.00026892114,0.006644122],"genre_scores_gemma":[0.8973837,0.00014498073,0.101338595,0.00053702143,0.000099541554,0.000060712373,0.000021466112,0.000013735094,0.00040026076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873805,0.000075514465,0.00035649794,0.00038508634,0.00013492876,0.00030993894],"domain_scores_gemma":[0.9981388,0.00063233817,0.00013261162,0.0006977446,0.00024667877,0.00015182683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006467947,0.00017886894,0.0002027222,0.00012359353,0.0007193824,0.0003520964,0.00051904656,0.000112383415,0.00004179805],"category_scores_gemma":[0.00015301142,0.00016717703,0.00005840456,0.0003692976,0.00013586233,0.0004947044,0.00032310042,0.00035882063,0.000014204308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020301215,0.000051322935,0.0005188044,0.00001032088,0.00003887298,9.231237e-7,0.00077385735,0.03341526,0.0010897797,0.7975979,0.0023457536,0.16413695],"study_design_scores_gemma":[0.0008954303,0.000033040767,0.00017402065,0.000023479202,0.000010489156,0.000022229031,0.00002436439,0.99123317,0.00021671053,0.0026088562,0.0045296666,0.00022853988],"about_ca_topic_score_codex":0.0000087770095,"about_ca_topic_score_gemma":0.00023223413,"teacher_disagreement_score":0.9578179,"about_ca_system_score_codex":0.000023333325,"about_ca_system_score_gemma":0.000064445165,"threshold_uncertainty_score":0.6817282},"labels":[],"label_agreement":null},{"id":"W2028715916","doi":"10.1109/mascots.2013.52","title":"DeltaNC: Efficient File Updates for Network-Coding-Based Cloud Storage Systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cloud storage; Erasure code; Cloud computing; Linear network coding; Byte; File system; Upload; Computer data storage; Distributed data store; File system fragmentation; File size; Operating system; Storage efficiency; Computer network; Computer file; Decoding methods; Journaling file system; Algorithm","score_opus":0.02511738272390741,"score_gpt":0.24749697744251845,"score_spread":0.22237959471861105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028715916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011255791,0.0006101676,0.99162644,0.0010146546,0.0009429196,0.0007779132,0.00001004961,0.00032859686,0.0035636788],"genre_scores_gemma":[0.9582069,0.000029872288,0.038240373,0.00091557926,0.00026681114,0.000532766,0.000048813872,0.000015463673,0.0017434474],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874395,0.0001173205,0.0002803679,0.00031796345,0.00015942541,0.00038094886],"domain_scores_gemma":[0.9981423,0.00050185586,0.000099211946,0.0008356818,0.0003055139,0.000115432034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037636494,0.00015460915,0.00018372509,0.00005435145,0.00038227413,0.00045912885,0.0010381159,0.000050862105,0.00069978874],"category_scores_gemma":[0.000058757858,0.00012927515,0.00007645177,0.0003829833,0.000031928223,0.00017702271,0.00024828519,0.00010013257,0.00022296356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036332651,0.00006888103,0.0000814274,0.000018957155,0.000015839349,6.223886e-7,0.00012288442,0.21659634,0.00014060621,0.17088038,0.60562164,0.0064488165],"study_design_scores_gemma":[0.0002574767,0.000043161548,0.00019812435,0.00004221977,0.000002378159,0.0000013702388,0.000016023216,0.9437773,0.00010554471,0.000101733094,0.055276345,0.00017827167],"about_ca_topic_score_codex":0.00002104908,"about_ca_topic_score_gemma":0.00002306719,"teacher_disagreement_score":0.9570813,"about_ca_system_score_codex":0.0000589748,"about_ca_system_score_gemma":0.000056840014,"threshold_uncertainty_score":0.76621956},"labels":[],"label_agreement":null},{"id":"W2028914099","doi":"10.1109/icc.2013.6655366","title":"Performance analysis of decode-and-forward relaying with optimum combining in the presence of co-channel interference","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Interference (communication); Diversity gain; Co-channel interference; Maximal-ratio combining; Relay; Signal-to-noise ratio (imaging); Channel (broadcasting); Topology (electrical circuits); Computer science; Probability density function; Outage probability; Diversity combining; Expression (computer science); Electronic engineering; Fading; Telecommunications; Power (physics); Mathematics; Statistics; Physics; Engineering","score_opus":0.036966810475007286,"score_gpt":0.2758831701904573,"score_spread":0.23891635971545006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028914099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7655358,0.00010251223,0.22865461,0.00035235888,0.000010867075,0.0001396668,2.447311e-7,0.0000138965015,0.005190058],"genre_scores_gemma":[0.9923509,0.0003517409,0.0071324008,0.00009558474,0.0000013458532,0.000020053121,8.686685e-7,0.0000020438197,0.0000450914],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991934,0.00012135935,0.00025840872,0.00015744462,0.00014877353,0.00012061671],"domain_scores_gemma":[0.99879605,0.00037103807,0.00012169412,0.00054847205,0.00013809968,0.000024662068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047876727,0.0000773662,0.00019937732,0.00019402152,0.000070718044,0.000051275136,0.00094303285,0.000019641326,0.000023545468],"category_scores_gemma":[0.000030216574,0.000047204107,0.000028027293,0.0011566808,0.000098085016,0.00042967094,0.00026129093,0.00012079521,0.0000017122806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068497255,0.00041164065,0.5773909,0.00012347936,0.000745609,0.0000026276743,0.08173379,0.11792634,0.0029836658,0.08859616,0.0004795633,0.12953772],"study_design_scores_gemma":[0.00013110774,0.00009433874,0.0694901,0.00006454375,0.000016407354,0.00000138959,0.00049117475,0.9290811,0.00051814894,0.00003977966,0.000006711771,0.000065239234],"about_ca_topic_score_codex":0.000056907294,"about_ca_topic_score_gemma":0.0000880661,"teacher_disagreement_score":0.8111547,"about_ca_system_score_codex":0.000007942047,"about_ca_system_score_gemma":0.000020174255,"threshold_uncertainty_score":0.19249275},"labels":[],"label_agreement":null},{"id":"W2028921197","doi":"10.1007/978-3-540-77255-2_32","title":"Video Multicast over Wireless Ad Hoc Networks Using Distributed Optimization","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Multicast; Computer network; Wireless ad hoc network; Source-specific multicast; Protocol Independent Multicast; Xcast; Pragmatic General Multicast; Distributed computing; Distance Vector Multicast Routing Protocol; Linear network coding; Reliable multicast; Optimized Link State Routing Protocol; Wireless; Routing (electronic design automation); Network packet; Routing protocol","score_opus":0.042493849402785534,"score_gpt":0.2917538287261767,"score_spread":0.2492599793233912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028921197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007587465,0.0025772857,0.9947797,0.00023127839,0.0012780987,0.00039729773,0.0000053176886,0.00019630813,0.0004588272],"genre_scores_gemma":[0.13929139,0.0020334285,0.85607314,0.0018400134,0.0005288148,0.0000073278584,0.00005176733,0.000066499735,0.00010765045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964206,0.000081391045,0.00067077955,0.0013058591,0.00077504397,0.00074629864],"domain_scores_gemma":[0.9965593,0.0005762934,0.00036702838,0.0017812828,0.00049166556,0.00022437816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010570615,0.0005611101,0.0005241316,0.00064338394,0.0005739353,0.000746467,0.0032826774,0.00039287366,0.000046892837],"category_scores_gemma":[0.000079260375,0.0005522946,0.00013184626,0.0013058282,0.000613289,0.0007497859,0.0022003644,0.0010430741,0.0000086548125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045666998,0.000016763513,0.000018428898,0.000005955464,0.000006799382,0.00001898639,0.0001611005,0.612601,0.000025594822,0.0026209962,0.000007958858,0.3845119],"study_design_scores_gemma":[0.0003047273,0.00005322194,0.000077027595,0.00041709616,0.000008710912,0.000032180225,1.3359022e-7,0.9958311,0.00008124266,0.0010859221,0.0014933309,0.000615334],"about_ca_topic_score_codex":0.0000036969243,"about_ca_topic_score_gemma":0.000090225156,"teacher_disagreement_score":0.38389656,"about_ca_system_score_codex":0.00059301354,"about_ca_system_score_gemma":0.0003309534,"threshold_uncertainty_score":0.99969286},"labels":[],"label_agreement":null},{"id":"W2028952488","doi":"10.1109/icc.2012.6364786","title":"Energy efficient broadcasting in WSNs with cocasting and power control","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer network; Computer science; Linear network coding; Wireless sensor network; Network packet; Broadcasting (networking); Multicast; Routing protocol; Relay; Efficient energy use; Packet forwarding; Network topology; Distributed computing; Power control; Energy conservation; Power (physics); Engineering; Electrical engineering","score_opus":0.020990624937246686,"score_gpt":0.24140064252403953,"score_spread":0.22041001758679285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028952488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09826074,0.0010237388,0.8848712,0.00043983443,0.000057947032,0.000057778863,1.0516992e-7,0.00006724992,0.015221447],"genre_scores_gemma":[0.9898472,0.000021290027,0.009474741,0.0005402196,0.000017018901,0.000004194837,1.8046329e-7,0.0000039442266,0.00009123562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993418,0.00008136725,0.00011964364,0.00013148389,0.00008926069,0.0002364301],"domain_scores_gemma":[0.99943185,0.00018828928,0.000036399084,0.00022531489,0.000041600757,0.00007657022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031983326,0.00007635201,0.000092238006,0.0000616491,0.0001048521,0.00006923896,0.00020324686,0.00001719288,0.00001574235],"category_scores_gemma":[0.00002545107,0.000057655117,0.000008809239,0.00026907725,0.00002724636,0.00018179869,0.00017676434,0.000074925425,0.000003023148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027476337,0.00029770075,0.07665809,0.0000080135205,0.000024624384,0.000012532733,0.008539107,0.0073756124,0.0025886747,0.5104227,0.00021106754,0.3938344],"study_design_scores_gemma":[0.00084418716,0.000052934367,0.014496064,0.000054081596,0.0000019403822,0.000042119496,0.0001345935,0.9805796,0.00030428512,0.000016158885,0.0032849626,0.00018908641],"about_ca_topic_score_codex":0.000011910254,"about_ca_topic_score_gemma":0.000034042234,"teacher_disagreement_score":0.97320396,"about_ca_system_score_codex":0.000020012705,"about_ca_system_score_gemma":0.000014925893,"threshold_uncertainty_score":0.23511074},"labels":[],"label_agreement":null},{"id":"W2029359097","doi":"10.1016/j.phycom.2013.03.003","title":"Introduction to the Special Issue on Network Coding and its Applications to Wireless Communications","year":2013,"lang":"en","type":"article","venue":"Physical Communication","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless; Computer network; Coding (social sciences); Wireless network; Telecommunications","score_opus":0.038737554655470054,"score_gpt":0.30539111830734894,"score_spread":0.26665356365187887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029359097","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011264856,0.00083176093,0.18026687,0.77552253,0.0003933447,0.0050577126,0.0000063650577,0.0005314779,0.026125109],"genre_scores_gemma":[0.9766928,0.0011433181,0.009865654,0.004263605,0.0057270476,0.0017539529,0.000028706105,0.000020459393,0.00050448475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833876,0.0005212646,0.00027506336,0.00036988044,0.00022473425,0.0002702745],"domain_scores_gemma":[0.9946529,0.00070583273,0.00010484349,0.0040286193,0.0003304579,0.00017733705],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004372957,0.00017810188,0.00018807541,0.00007965213,0.0014223828,0.0004020359,0.0034963517,0.000038170543,0.000042774795],"category_scores_gemma":[0.00010532433,0.0001494004,0.000046001158,0.0011906885,0.000075734344,0.0004476203,0.0023505029,0.00040741795,0.0017401903],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041959115,0.00013008555,0.000009030571,0.000003201341,0.000012387128,1.691485e-8,0.0017148637,0.0007638166,0.00093491847,0.62865233,0.08247532,0.28529984],"study_design_scores_gemma":[0.00012161102,0.00008393784,0.0016516584,0.000038406855,0.00000896644,0.000001710779,0.000093044575,0.097291276,0.00042563712,0.0037915548,0.8962375,0.00025472423],"about_ca_topic_score_codex":0.000014154528,"about_ca_topic_score_gemma":0.00008703264,"teacher_disagreement_score":0.96542794,"about_ca_system_score_codex":0.0000851349,"about_ca_system_score_gemma":0.000026050824,"threshold_uncertainty_score":0.99987763},"labels":[],"label_agreement":null},{"id":"W2029752978","doi":"10.1109/infcom.2010.5462081","title":"Topological Properties Affect the Power of Network Coding in Decentralized Broadcast","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Network topology; Overlay network; Locality; Heuristics; Distributed computing; Coding (social sciences); Theoretical computer science; Computer network; Topology (electrical circuits); Mathematics; The Internet","score_opus":0.04657045576723875,"score_gpt":0.28475481501011196,"score_spread":0.2381843592428732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029752978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.904492,0.0012887138,0.06871561,0.007173451,0.0007368226,0.00048032682,1.8484934e-7,0.00014186236,0.016971018],"genre_scores_gemma":[0.9938267,0.00027695764,0.005312474,0.00042200123,0.000020755788,0.000010678419,1.8064466e-7,0.0000025919173,0.00012764616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991758,0.00019283457,0.00018644311,0.00013932989,0.00010482962,0.00020075249],"domain_scores_gemma":[0.9991417,0.00019673348,0.00004663018,0.00053120306,0.000052410465,0.00003135839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005915301,0.00007619772,0.00012535845,0.000025367712,0.00012262716,0.00006680636,0.00094376935,0.000040136565,0.0001717107],"category_scores_gemma":[0.00010282614,0.000041169173,0.000039935996,0.00036704936,0.00011925875,0.0001299499,0.00041419483,0.00025067248,0.00000815639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020593787,0.00009315785,0.014947263,0.0000039762504,0.000011083036,0.0000023575064,0.002235937,0.00029795308,0.020607363,0.9241135,0.0013130927,0.03635372],"study_design_scores_gemma":[0.0039084055,0.0005867556,0.34576282,0.00038584956,0.000017513608,0.00009551479,0.0008129734,0.47036445,0.044409785,0.00964554,0.12252452,0.0014858879],"about_ca_topic_score_codex":0.000009857805,"about_ca_topic_score_gemma":0.00029674039,"teacher_disagreement_score":0.914468,"about_ca_system_score_codex":0.000008468314,"about_ca_system_score_gemma":0.000026950218,"threshold_uncertainty_score":0.18801115},"labels":[],"label_agreement":null},{"id":"W2029877651","doi":"10.1016/j.tcs.2015.04.027","title":"On the complexity of neighbourhood learning in radio networks","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Neighbourhood (mathematics); Schedule; Node (physics); Class (philosophy); Generalization; Radio networks; Upper and lower bounds; Degree (music); Binary logarithm; Graph; Algorithm; Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Wireless network; Artificial intelligence; Wireless; Telecommunications","score_opus":0.06630140433264756,"score_gpt":0.2858921960271714,"score_spread":0.21959079169452386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029877651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027059702,0.000071571994,0.9580583,0.004387183,0.00023260165,0.00013117475,1.01147315e-7,0.00007366991,0.009985712],"genre_scores_gemma":[0.985111,0.000016489355,0.014190629,0.00062761386,0.000039978157,0.0000042090082,2.5903148e-7,0.0000039101647,0.0000059322133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806535,0.00051052024,0.00026192956,0.00034022177,0.00047740122,0.00034459715],"domain_scores_gemma":[0.99808043,0.00063537195,0.00008021642,0.00084499666,0.00020045359,0.0001585576],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0032589454,0.00011939902,0.00017918993,0.00012327965,0.0002663704,0.00018035121,0.002985739,0.000029802984,0.000033524822],"category_scores_gemma":[0.0003314181,0.00007944577,0.000038721715,0.0016274811,0.003424998,0.00025422385,0.0012599517,0.0004217075,0.000016178366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061991927,0.00004179765,0.00013382282,6.021198e-7,0.0000012249628,0.0000014109135,0.0006373544,0.013745652,0.000020234536,0.96798944,0.00005950982,0.017362718],"study_design_scores_gemma":[0.00018344744,0.00016026858,0.0025755342,0.000031073047,6.3603534e-7,0.0000046677596,0.000010775862,0.853053,0.0001973575,0.14364503,0.000047690875,0.00009052511],"about_ca_topic_score_codex":0.0000027072404,"about_ca_topic_score_gemma":0.0000030405247,"teacher_disagreement_score":0.95805126,"about_ca_system_score_codex":0.00006711945,"about_ca_system_score_gemma":0.00012619667,"threshold_uncertainty_score":0.9992871},"labels":[],"label_agreement":null},{"id":"W2030053411","doi":"10.1109/tsp.2012.2212890","title":"Beamforming in Non-Regenerative MIMO Broadcast Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Beamforming; Relay; MIMO; Computer science; Precoding; Linear network coding; Relay channel; Base station; Antenna (radio); Algorithm; Topology (electrical circuits); Computer network; Telecommunications; Mathematics","score_opus":0.03426371818376893,"score_gpt":0.2818749132106069,"score_spread":0.24761119502683798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030053411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007696416,0.0011807055,0.98924506,0.00022995943,0.00026653643,0.00016688142,5.927901e-7,0.00011012523,0.0011037509],"genre_scores_gemma":[0.9833826,0.00015820422,0.015655698,0.00039064535,0.000112630274,0.000054511787,0.0000010348101,0.000017419903,0.00022727158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985764,0.00013205748,0.00032957376,0.00028733586,0.00020973325,0.00046492077],"domain_scores_gemma":[0.99922216,0.00012243971,0.00009696861,0.00032356163,0.00009501947,0.00013986131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993879,0.00020274134,0.0001919817,0.00022641334,0.0005854324,0.00018113911,0.0005168278,0.00009308644,0.000036697686],"category_scores_gemma":[0.0000024702488,0.00019542311,0.00006948423,0.0010033266,0.000054511114,0.0015404995,0.000009112644,0.0005607209,0.000028045697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136938415,0.00020084214,0.000050395716,0.000009722772,0.0000104484625,0.0000020087282,0.0034584831,0.19812137,0.002645382,0.00025092435,0.000043334807,0.7951934],"study_design_scores_gemma":[0.00040426812,0.000055602228,0.00020968911,0.00022117987,0.00000803767,0.000017558306,0.00012509245,0.9820157,0.015778664,0.000020217303,0.0008305103,0.00031345995],"about_ca_topic_score_codex":0.0000052192736,"about_ca_topic_score_gemma":0.000027863778,"teacher_disagreement_score":0.9756862,"about_ca_system_score_codex":0.00012917448,"about_ca_system_score_gemma":0.00006804315,"threshold_uncertainty_score":0.7969123},"labels":[],"label_agreement":null},{"id":"W2030103362","doi":"10.1109/wcnc.2013.6554645","title":"Joint relay, subcarrier and power allocation for OFDMA-based femtocell networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subcarrier; Femtocell; Computer science; Relay; Resource allocation; Macrocell; Computer network; Throughput; Frequency-division multiple access; Orthogonal frequency-division multiplexing; Orthogonal frequency-division multiple access; Transmitter power output; Mathematical optimization; Wireless; Channel (broadcasting); Power (physics); Telecommunications; Base station; Mathematics","score_opus":0.03319601924488723,"score_gpt":0.24784417863008307,"score_spread":0.21464815938519582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030103362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009683587,0.00047384488,0.97865695,0.008322744,0.00013356534,0.0004913137,2.6216557e-7,0.00011979017,0.0021179642],"genre_scores_gemma":[0.96036166,0.00016098976,0.035596512,0.0025286626,0.000027939659,0.00018794122,0.0000040090076,0.000007947991,0.0011243217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992836,0.000058123274,0.00017699867,0.00022933994,0.00007853486,0.00017341168],"domain_scores_gemma":[0.99903315,0.00012653161,0.000055058128,0.0004710711,0.00022856488,0.00008563447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023883744,0.00009761563,0.0001020856,0.00004814234,0.00018144537,0.00021826195,0.00033643754,0.000049608432,0.00015001763],"category_scores_gemma":[0.000028621656,0.00008220213,0.000037044185,0.000182148,0.00003291829,0.0003099526,0.00015990912,0.00008370671,0.000018340445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001863366,0.00021223894,0.0033102762,0.000032013326,0.000058236295,7.921919e-7,0.0010962376,0.009695618,0.007116099,0.5144266,0.11813994,0.3458933],"study_design_scores_gemma":[0.00032462316,0.000053658587,0.004168138,0.000013727342,0.0000025409129,6.9609115e-7,0.000012800304,0.9860253,0.00082044187,0.000371579,0.008070927,0.00013560503],"about_ca_topic_score_codex":0.000009911385,"about_ca_topic_score_gemma":0.000015264257,"teacher_disagreement_score":0.9763296,"about_ca_system_score_codex":0.000019676036,"about_ca_system_score_gemma":0.000031871252,"threshold_uncertainty_score":0.33521056},"labels":[],"label_agreement":null},{"id":"W2030386826","doi":"10.1109/bsc.2008.4563194","title":"Capacity of random network coding under a probabilistic error model","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Linear network coding; Network packet; Probability of error; Upper and lower bounds; Coding (social sciences); Algorithm; Computer science; Channel capacity; Limiting; Mathematics; Statistics; Computer network","score_opus":0.1288256952206653,"score_gpt":0.2846156130954367,"score_spread":0.1557899178747714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030386826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024736956,0.00012552708,0.9644592,0.00064451713,0.00007012258,0.00016794821,3.4615647e-7,0.000109690125,0.009685735],"genre_scores_gemma":[0.9061704,0.0001566779,0.09275577,0.00036893017,0.000022835648,0.000012084512,6.4328896e-7,0.000004395479,0.0005082619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909854,0.000115071,0.00024848018,0.00019226779,0.00015509613,0.00019056453],"domain_scores_gemma":[0.9989175,0.00019210554,0.000076216624,0.0006040684,0.00014977004,0.00006030997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031888808,0.00009573741,0.00018952905,0.00003516632,0.00024706539,0.000021008878,0.0006617689,0.00003342668,0.000027533832],"category_scores_gemma":[0.00005305414,0.000080566606,0.00006133305,0.00037468298,0.000107028136,0.00020407217,0.00028420254,0.000113545495,0.000008549215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012863196,0.00006399271,0.00021645574,0.000008074243,0.000015880047,8.7183975e-7,0.0009683614,0.2797078,0.00054334983,0.7143857,0.0025933257,0.0014833579],"study_design_scores_gemma":[0.00051632023,0.00001622018,0.0005062327,0.000020160236,0.0000026965483,0.000009017495,0.0000048493016,0.9906795,0.00018180031,0.007819161,0.0001400841,0.00010398225],"about_ca_topic_score_codex":0.000005203014,"about_ca_topic_score_gemma":0.00003927887,"teacher_disagreement_score":0.8814334,"about_ca_system_score_codex":0.000030855004,"about_ca_system_score_gemma":0.000081200764,"threshold_uncertainty_score":0.3285411},"labels":[],"label_agreement":null},{"id":"W2030507266","doi":"10.1109/icc.2012.6364012","title":"Relay selection in network coded communications with power control","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Relay; Linear network coding; Computer network; Unicast; Power control; Node (physics); Distributed computing; Network topology; Routing protocol; Wireless network; Wireless; Coding (social sciences); Transmitter power output; Efficient energy use; Topology (electrical circuits); Routing (electronic design automation); Power (physics); Multicast; Telecommunications; Network packet; Engineering; Channel (broadcasting)","score_opus":0.02863433499923073,"score_gpt":0.2738309378211862,"score_spread":0.2451966028219555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030507266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053565833,0.0012298927,0.95886105,0.003945257,0.00008563663,0.0002573777,1.9597903e-7,0.00019936847,0.030064628],"genre_scores_gemma":[0.94041145,0.00017742137,0.057908073,0.0011044836,0.00002704435,0.000024278856,0.0000013432004,0.000005618777,0.00034029127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990594,0.00028675512,0.00016677045,0.00011709492,0.0000974372,0.00027256276],"domain_scores_gemma":[0.9988319,0.00020383597,0.000053387663,0.00075405766,0.000085211635,0.000071582646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005463551,0.00008477765,0.00010912795,0.000055818542,0.0002125898,0.0000627227,0.0008390079,0.00003529923,0.000053549487],"category_scores_gemma":[0.000014486613,0.000068058725,0.000018850233,0.0007703576,0.000041644762,0.0005414982,0.00022455532,0.00020972766,0.000046127734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002518656,0.000320783,0.13408221,0.0000017454512,0.000036264344,4.3270447e-7,0.0023086946,0.0047895527,0.00034109622,0.8366319,0.006189096,0.015273012],"study_design_scores_gemma":[0.0019501338,0.00015314357,0.15261322,0.00006415682,0.000009586309,0.00003091479,0.00009116045,0.754695,0.000117158124,0.00028232296,0.08951927,0.00047395602],"about_ca_topic_score_codex":0.00000873069,"about_ca_topic_score_gemma":0.0004255217,"teacher_disagreement_score":0.93505484,"about_ca_system_score_codex":0.000055776076,"about_ca_system_score_gemma":0.000033532597,"threshold_uncertainty_score":0.2775354},"labels":[],"label_agreement":null},{"id":"W2030626227","doi":"10.1016/j.dam.2010.12.002","title":"Messy broadcasting — Decentralized broadcast schemes with limited knowledge","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Broadcasting (networking); Mathematics; Atomic broadcast; Computer science; Computer network","score_opus":0.025570749307354167,"score_gpt":0.27676043545745355,"score_spread":0.2511896861500994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030626227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07627346,0.00030266427,0.84691447,0.00038367012,0.00017319882,0.0005708429,0.0000022889908,0.0006109912,0.07476839],"genre_scores_gemma":[0.6039893,0.00010720263,0.39550206,0.00010105424,0.000046467296,0.00005941701,0.000008578219,0.000027747728,0.00015816801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860454,0.000027540571,0.00035738587,0.00036486506,0.00024731035,0.00039838656],"domain_scores_gemma":[0.99796325,0.00028333286,0.00018812316,0.0012442623,0.00015745583,0.00016359298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032645313,0.00026901482,0.00030387114,0.00009498306,0.00033480208,0.00031275552,0.0012726719,0.00008410026,0.00007417012],"category_scores_gemma":[0.00007832742,0.0002100267,0.000057975383,0.00065867405,0.00013254175,0.00023262203,0.000528103,0.0004310993,0.000108149936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009193308,0.00017156659,0.00006609958,0.00006048409,0.000046729787,0.0000028886975,0.003886798,0.0000144127125,0.04182309,0.86760503,0.00032073012,0.08599297],"study_design_scores_gemma":[0.0061793495,0.00021032868,0.0010303953,0.0006435833,0.00016388524,0.00020926743,0.0013421754,0.6642053,0.09304231,0.016872969,0.21289115,0.0032092866],"about_ca_topic_score_codex":7.950977e-7,"about_ca_topic_score_gemma":0.000027183562,"teacher_disagreement_score":0.8507321,"about_ca_system_score_codex":0.000021942402,"about_ca_system_score_gemma":0.000082569466,"threshold_uncertainty_score":0.856464},"labels":[],"label_agreement":null},{"id":"W2030820691","doi":"10.1109/icc.2010.5502353","title":"Demodulate-and-Forward Relaying with Higher Order Modulations: Impact of Channel State Uncertainty","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Demodulation; Quadrature amplitude modulation; Rayleigh fading; QAM; Relay; Computer science; Independent and identically distributed random variables; Fading; Channel state information; Pulse-amplitude modulation; Modulation (music); Bit error rate; Telecommunications; Algorithm; Topology (electrical circuits); Channel (broadcasting); Mathematics; Electronic engineering; Statistics; Wireless; Physics; Detector; Pulse (music); Engineering; Random variable","score_opus":0.02259251718323432,"score_gpt":0.2823954979454451,"score_spread":0.2598029807622108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030820691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61262864,0.00008891358,0.38357085,0.00084357226,0.000099381155,0.00016941165,0.0000013786455,0.00011506525,0.0024828124],"genre_scores_gemma":[0.97150826,0.000090316506,0.027721282,0.000096322314,0.000012716181,0.000007778516,0.000002247176,0.00000738565,0.00055366394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992762,0.000047527716,0.00017836106,0.0002048727,0.00012738576,0.00016560999],"domain_scores_gemma":[0.99889314,0.00008902503,0.000083387094,0.0005874243,0.00026576506,0.00008127645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021997985,0.00011448634,0.00014133737,0.0000823776,0.00014997966,0.000070948736,0.0003861317,0.000035059085,0.00007795176],"category_scores_gemma":[0.000023165774,0.00007621332,0.000034956374,0.00047205843,0.000072110895,0.0003671985,0.00022466417,0.00018677767,0.0000050776775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014295365,0.0003412026,0.047923498,0.00003632144,0.0004709117,0.0000073095516,0.0066080294,0.30725172,0.027087092,0.36837438,0.0013678044,0.24038877],"study_design_scores_gemma":[0.0004896884,0.0001179988,0.10915501,0.000022518436,0.000005487701,0.0000076276374,0.0000101246815,0.88666195,0.00030636005,0.002521358,0.0004909483,0.0002109184],"about_ca_topic_score_codex":0.00009579732,"about_ca_topic_score_gemma":0.0002035007,"teacher_disagreement_score":0.57941025,"about_ca_system_score_codex":0.000018619545,"about_ca_system_score_gemma":0.00006817096,"threshold_uncertainty_score":0.3107889},"labels":[],"label_agreement":null},{"id":"W2031096037","doi":"10.1109/icc.2013.6655437","title":"Misbehavior detection in amplify-and-forward cooperative OFDM systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Computer network; Reliability (semiconductor); Jamming; Node (physics); Scheme (mathematics); Network topology; Multiplexing; Distributed computing; Power (physics); Channel (broadcasting); Engineering; Telecommunications","score_opus":0.030420577044481888,"score_gpt":0.26689828500646867,"score_spread":0.23647770796198678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031096037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3221431,0.0009314833,0.66406417,0.0012732936,0.00039345675,0.0009586833,5.4749245e-7,0.00027769158,0.009957596],"genre_scores_gemma":[0.99671215,0.00021060387,0.0015366229,0.00020373265,0.000016653188,0.00013605422,8.6348774e-7,0.0000043672876,0.0011789746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991951,0.0001482732,0.00019528536,0.0002156981,0.00009228425,0.00015333513],"domain_scores_gemma":[0.9993396,0.00007852485,0.000035069203,0.00035760817,0.00012282701,0.00006638059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019184705,0.00009348483,0.0001239649,0.0000920048,0.00012050274,0.00029738655,0.00027317432,0.00004627384,0.000057526355],"category_scores_gemma":[0.000022910084,0.00007719446,0.000014772028,0.0003339078,0.00002851636,0.0005317419,0.00021464624,0.00014424657,0.00012761107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007457366,0.00022749513,0.0055683646,0.000026437352,0.000026681304,0.000007848133,0.0041180085,0.0007207282,0.045598887,0.21032944,0.0026598785,0.7307088],"study_design_scores_gemma":[0.0010098573,0.00018612872,0.05149786,0.00007738509,0.0000052447213,0.000048879407,0.00057605765,0.925301,0.0065246117,0.00025806465,0.013944416,0.0005704717],"about_ca_topic_score_codex":0.00021509771,"about_ca_topic_score_gemma":0.00029058123,"teacher_disagreement_score":0.9245803,"about_ca_system_score_codex":0.000046051005,"about_ca_system_score_gemma":0.000018287561,"threshold_uncertainty_score":0.3147899},"labels":[],"label_agreement":null},{"id":"W2031241818","doi":"10.1109/wcnc.2014.6951937","title":"Analysis of relay capacity over generalized fading channels with cochannel interference","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Quest University Canada","funders":"","keywords":"Fading; Relay; Nakagami distribution; Multipath propagation; Computer science; Beamforming; Interference (communication); Electronic engineering; Computer network; Co-channel interference; Topology (electrical circuits); Telecommunications; Engineering; Channel (broadcasting); Electrical engineering; Physics","score_opus":0.04896208829483004,"score_gpt":0.271021168162672,"score_spread":0.22205907986784199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031241818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23433027,0.00002987198,0.7627886,0.00017295958,0.00005634559,0.000047849844,4.9513915e-7,0.000057043293,0.0025166017],"genre_scores_gemma":[0.9778142,0.000056568402,0.021381877,0.00033794725,0.000015724563,0.0000074695963,0.000002159375,0.000003975773,0.00038009413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904865,0.00017812263,0.0002128961,0.00025149458,0.00015429161,0.00015454621],"domain_scores_gemma":[0.998732,0.0001658316,0.000114986346,0.0007592464,0.00017630897,0.00005166683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038936376,0.000108965985,0.00027546412,0.00024336949,0.000099397635,0.00007103277,0.00079757365,0.000031299707,0.000115664756],"category_scores_gemma":[0.000049857295,0.000080700804,0.000075449054,0.0013661456,0.0000561376,0.0002401181,0.00027731102,0.000095669966,0.000004876541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035729023,0.00016372954,0.011453747,0.000018308438,0.0011699954,0.000001177756,0.00907764,0.07775678,0.010973335,0.8593183,0.00071364746,0.029317614],"study_design_scores_gemma":[0.00019620098,0.00006562216,0.0029745782,0.000029590288,0.000049878465,8.096851e-7,0.000011189515,0.99342066,0.002642048,0.0001285815,0.0003464931,0.00013435399],"about_ca_topic_score_codex":0.000040465486,"about_ca_topic_score_gemma":0.00020723627,"teacher_disagreement_score":0.9156639,"about_ca_system_score_codex":0.000021996408,"about_ca_system_score_gemma":0.000014089574,"threshold_uncertainty_score":0.32908833},"labels":[],"label_agreement":null},{"id":"W2031332034","doi":"10.1109/jcn.2008.6389840","title":"Minimum energy cooperative path routing in all-wireless networks: NP-completeness and heuristic algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Dijkstra's algorithm; Algorithm; Shortest path problem; Constrained Shortest Path First; Heuristic; Routing (electronic design automation); Link-state routing protocol; Private Network-to-Network Interface; Scalability; Mathematical optimization; Destination-Sequenced Distance Vector routing; K shortest path routing; Routing protocol; Computer network; Mathematics; Theoretical computer science; Graph","score_opus":0.05751421122980483,"score_gpt":0.28816879013880614,"score_spread":0.23065457890900132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031332034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025812637,0.029861895,0.94077784,0.0027131988,0.00020629549,0.00013050638,0.0000011049801,0.000032598753,0.00046390534],"genre_scores_gemma":[0.86447763,0.12535135,0.00937402,0.00063928764,0.000098040946,0.000010089138,0.000004858028,0.00001220101,0.00003254608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978377,0.0006960342,0.0007891063,0.00020904472,0.0001737019,0.00029438938],"domain_scores_gemma":[0.99708086,0.0009444762,0.00044857958,0.0009817049,0.00037695593,0.00016740704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089081505,0.00020492513,0.0004437178,0.00017832921,0.00062739634,0.00016711427,0.0014910293,0.000099828925,0.0000032526805],"category_scores_gemma":[0.00004525313,0.00018315938,0.00006338172,0.0006290984,0.00028860132,0.0005088869,0.0010344055,0.00062541454,3.0838933e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012137519,0.0010367876,0.017718071,0.000018165832,0.00038738083,0.00019412766,0.010715376,0.028589323,0.00031579347,0.26650608,0.0045230514,0.6698745],"study_design_scores_gemma":[0.000735197,0.0001337972,0.0047423295,0.00015868412,0.000013284553,0.00047363478,0.00011388424,0.9876091,0.000004395396,0.00021808043,0.005579403,0.0002182153],"about_ca_topic_score_codex":0.00002445713,"about_ca_topic_score_gemma":0.00010849077,"teacher_disagreement_score":0.9590198,"about_ca_system_score_codex":0.000052594238,"about_ca_system_score_gemma":0.000085382046,"threshold_uncertainty_score":0.7469023},"labels":[],"label_agreement":null},{"id":"W2031672799","doi":"10.1109/jsac.2009.090909","title":"On node density - outage probability tradeoff in wireless networks","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Computer science; Poisson distribution; Node (physics); Interference (communication); Wireless network; Coverage probability; Stochastic geometry; Channel (broadcasting); Topology (electrical circuits); Single antenna interference cancellation; Wireless; Algorithm; Mathematics; Statistics; Telecommunications","score_opus":0.05145683581558002,"score_gpt":0.30388491776213444,"score_spread":0.2524280819465544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031672799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79987854,0.00078564294,0.15656467,0.03369362,0.00047579754,0.0008932005,0.0000028657412,0.0003216427,0.007384044],"genre_scores_gemma":[0.98989105,0.0020801593,0.0060042455,0.0019136503,0.000047358768,0.000019008266,0.000006668042,0.000010560707,0.00002727081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675214,0.0015017921,0.0007006602,0.000323129,0.00030207259,0.00042023155],"domain_scores_gemma":[0.9956915,0.0009427342,0.00025003252,0.002641983,0.0003152438,0.00015854002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001196409,0.00023317311,0.00033042315,0.0003945153,0.00056495884,0.00025508986,0.0035692598,0.00013246715,0.000009743004],"category_scores_gemma":[0.0002779998,0.000224921,0.00008435477,0.0021950093,0.00008845729,0.0004040094,0.00019353665,0.002244056,0.000013665861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033450196,0.009524301,0.02617508,0.000011038406,0.00008286962,0.00009688918,0.0055189044,0.10422941,0.0030150681,0.48287296,0.0046598166,0.36347917],"study_design_scores_gemma":[0.0017354138,0.0004290096,0.29336497,0.0005724339,0.000008272898,0.00011578464,0.00002672201,0.6832288,0.00038490756,0.01836462,0.001153341,0.00061572826],"about_ca_topic_score_codex":0.000008313095,"about_ca_topic_score_gemma":0.0007081039,"teacher_disagreement_score":0.5789994,"about_ca_system_score_codex":0.00050453324,"about_ca_system_score_gemma":0.00019744111,"threshold_uncertainty_score":0.97494316},"labels":[],"label_agreement":null},{"id":"W2031910502","doi":"10.1109/atc.2010.5672710","title":"Performance of decode-and-forward cooperative relaying over Rayleigh fading channels with impulsive noise","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rayleigh fading; QAM; Quadrature amplitude modulation; Impulse noise; Fading; Upper and lower bounds; Electronic engineering; Computer science; Gaussian noise; Relay; Control theory (sociology); Telecommunications; Mathematics; Algorithm; Power (physics); Physics; Bit error rate; Engineering; Decoding methods; Mathematical analysis","score_opus":0.014258201336762347,"score_gpt":0.2505325361934346,"score_spread":0.23627433485667224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031910502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9252314,0.00007797618,0.067820996,0.00033057967,0.00016263973,0.00018858774,6.648028e-7,0.00007267975,0.006114491],"genre_scores_gemma":[0.9783681,0.00031305794,0.020574996,0.00025596903,0.000033265846,0.000017893362,0.0000013383917,0.000009523729,0.000425826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904287,0.00005317998,0.0002276283,0.00028969574,0.00016839083,0.0002182371],"domain_scores_gemma":[0.9988087,0.00015848246,0.00011314833,0.00055555784,0.00026729025,0.00009683776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029395334,0.00015675243,0.00020950787,0.00010270733,0.0002907108,0.000102759564,0.00058840506,0.00005265237,0.000076449636],"category_scores_gemma":[0.000039318194,0.00011506765,0.0000295727,0.0004192066,0.00011841564,0.0007270349,0.00042180228,0.00030186813,0.00000902247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022291741,0.00029968473,0.107027836,0.00011340715,0.00028620317,0.000016668248,0.028389536,0.007881584,0.21444099,0.4081116,0.0011884212,0.23202117],"study_design_scores_gemma":[0.0012011653,0.00042912507,0.017298589,0.00013709853,0.000014398558,0.00004769038,0.00012975985,0.9191432,0.059175543,0.00008145869,0.0018262552,0.0005157064],"about_ca_topic_score_codex":0.000007922565,"about_ca_topic_score_gemma":0.00005343196,"teacher_disagreement_score":0.9112616,"about_ca_system_score_codex":0.000015586758,"about_ca_system_score_gemma":0.00006202037,"threshold_uncertainty_score":0.46923223},"labels":[],"label_agreement":null},{"id":"W2031944747","doi":"10.1109/glocom.2011.6133973","title":"MMSE-Based Non-Regenerative Parallel MIMO Relaying with Simplified Receiver","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Karush–Kuhn–Tucker conditions; Computer science; Constraint (computer-aided design); Spatial multiplexing; Minimum mean square error; Multiplexing; Bit error rate; Power (physics); Electronic engineering; Control theory (sociology); Algorithm; Mathematical optimization; Decoding methods; Mathematics; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.0730111740034265,"score_gpt":0.25674301578988795,"score_spread":0.18373184178646146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031944747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077929785,0.00008407301,0.9153416,0.0008567067,0.00006299888,0.00020016277,3.2037204e-7,0.0001921857,0.07546894],"genre_scores_gemma":[0.7617656,0.000042118518,0.23560792,0.0013845966,0.000018335968,0.00003237807,0.0000024209269,0.000009115118,0.0011375148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895316,0.00012236607,0.00018262159,0.0003439592,0.00015807016,0.00023983855],"domain_scores_gemma":[0.9986588,0.000089824076,0.00007794558,0.0008806881,0.00018869214,0.00010404931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016859802,0.00016182334,0.00015201738,0.000078010475,0.00029427823,0.00009035703,0.0009056616,0.000045554927,0.00021232004],"category_scores_gemma":[0.00001435635,0.00011892465,0.000042057523,0.00043839918,0.00007199731,0.00036978943,0.00019119417,0.00016646479,0.000105371655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030012502,0.00072378776,0.007941719,0.000025107887,0.0002274041,0.00007752323,0.016695516,0.004709162,0.009547001,0.81072867,0.023255875,0.12576811],"study_design_scores_gemma":[0.0048901928,0.0010769073,0.030626876,0.00022145527,0.00003588496,0.000024944025,0.00039004625,0.8786868,0.05854516,0.0020293673,0.021556208,0.0019161422],"about_ca_topic_score_codex":0.000022196291,"about_ca_topic_score_gemma":0.000112221336,"teacher_disagreement_score":0.87397766,"about_ca_system_score_codex":0.00003449469,"about_ca_system_score_gemma":0.00011186203,"threshold_uncertainty_score":0.48496065},"labels":[],"label_agreement":null},{"id":"W2032262780","doi":"10.1109/tcsi.2011.2165418","title":"A 4-GHz Active Scatterer in 130-nm CMOS for Phase Sweep Amplify-and-Forward","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"CMOS; Relay; Fading; Electronic engineering; Transmission (telecommunications); Channel (broadcasting); Phase (matter); Repeater (horology); Modulation (music); Reflection (computer programming); Computer science; Power (physics); Electrical engineering; Physics; Telecommunications; Engineering; Acoustics; Encoding (memory)","score_opus":0.06616008579617134,"score_gpt":0.27908081832989934,"score_spread":0.212920732533728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032262780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06664413,0.00053231046,0.9283142,0.00036032032,0.00057245226,0.0010861935,0.00002583839,0.00011015019,0.0023543763],"genre_scores_gemma":[0.99831283,0.00041725638,0.0003556478,0.00022114572,0.000021248632,0.0002580236,0.0000018536081,0.000016462258,0.00039553794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986533,0.0001734657,0.0003105909,0.00044154332,0.00014870064,0.0002724281],"domain_scores_gemma":[0.99901104,0.00014880857,0.00008148424,0.0005141296,0.00007476621,0.00016975978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035784443,0.00019572477,0.0002845882,0.00019666902,0.00033510005,0.00012477393,0.0003365451,0.00009518338,0.000015190511],"category_scores_gemma":[0.000007524742,0.00017970445,0.00007381045,0.00027456565,0.00008292848,0.00030868922,0.0000058491255,0.00019988143,0.0000054485777],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005526396,0.00038024774,0.000018310666,0.00009156786,0.00013430582,0.0000144085325,0.0091574,0.00041882653,0.010056412,0.011255636,0.00009422192,0.9683234],"study_design_scores_gemma":[0.0459892,0.0067819627,0.009043026,0.0036800045,0.00056858384,0.0016846693,0.013183542,0.7255377,0.06063055,0.0027477036,0.12280274,0.007350319],"about_ca_topic_score_codex":0.000053195286,"about_ca_topic_score_gemma":0.00009023884,"teacher_disagreement_score":0.9609731,"about_ca_system_score_codex":0.000060085884,"about_ca_system_score_gemma":0.00004949111,"threshold_uncertainty_score":0.73281354},"labels":[],"label_agreement":null},{"id":"W2032301438","doi":"10.1109/jcn.2014.000008","title":"Robust relay design for two-way multi-antenna relay systems with imperfect CSI","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Computer science; Robustness (evolution); Relay channel; Mathematical optimization; Channel state information; Semidefinite programming; Upper and lower bounds; Optimization problem; Beamforming; Convex optimization; Transmitter power output; Control theory (sociology); Channel (broadcasting); Algorithm; Wireless; Telecommunications; Power (physics); Regular polygon; Mathematics; Transmitter","score_opus":0.08228219557442572,"score_gpt":0.2903345700520073,"score_spread":0.20805237447758157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032301438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008246277,0.013045947,0.98379755,0.0015442371,0.0002299432,0.00032100023,5.9812027e-7,0.000036543264,0.00019957949],"genre_scores_gemma":[0.72198415,0.008886623,0.2687085,0.00016461937,0.0001064389,0.000031903437,0.0000021784745,0.000015951737,0.00009960785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979655,0.0008698471,0.00059200893,0.00017097454,0.0001576596,0.00024399659],"domain_scores_gemma":[0.9952081,0.0016727723,0.00059178105,0.0016795612,0.000694004,0.0001537682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026133955,0.00017727951,0.00036077658,0.00013939764,0.0007032723,0.0003262126,0.002018256,0.000077269775,0.0000015983723],"category_scores_gemma":[0.00009963157,0.00013016094,0.000093454066,0.0003913486,0.0001371047,0.00048030488,0.0004169276,0.0005212304,0.0000011634058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025267803,0.0006331365,0.0017165211,0.000046207697,0.00048165108,0.000005207854,0.0022984145,0.6538215,0.00093567814,0.14827947,0.0066433703,0.18488613],"study_design_scores_gemma":[0.0013071925,0.00047759278,0.00035713927,0.0002631205,0.0000389456,0.00012838098,0.000052684965,0.9842055,0.00001031066,0.000044291693,0.01293853,0.00017634698],"about_ca_topic_score_codex":0.000004289531,"about_ca_topic_score_gemma":0.00003222208,"teacher_disagreement_score":0.7211596,"about_ca_system_score_codex":0.00004703275,"about_ca_system_score_gemma":0.00006907239,"threshold_uncertainty_score":0.54090726},"labels":[],"label_agreement":null},{"id":"W2032843226","doi":"10.1109/wcsp.2012.6542822","title":"A timing synchronization scheme in coordinated base-stations cooperative communications","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Synchronization (alternating current); Base station; Computer science; Scheme (mathematics); Real-time computing; Time synchronization; SIGNAL (programming language); Joint (building); Base (topology); Computer network; Distributed computing; Engineering","score_opus":0.08655843407550322,"score_gpt":0.32620931792507046,"score_spread":0.23965088384956723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032843226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025752513,0.0011135684,0.97172624,0.0047039264,0.00009839955,0.00028384957,0.0000019831602,0.00022030355,0.019276507],"genre_scores_gemma":[0.88952374,0.00039037017,0.10896325,0.00056837837,0.000017193175,0.00006596783,0.000043711618,0.00000794301,0.00041945567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884707,0.00032763678,0.0002811355,0.00016766941,0.00010083171,0.000275657],"domain_scores_gemma":[0.9981906,0.00026875292,0.00006748489,0.0011348901,0.00024251804,0.00009578246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004863076,0.00011603381,0.00012486051,0.00018278148,0.0003677757,0.00011852012,0.0010629683,0.00004430759,0.00013765918],"category_scores_gemma":[0.0001633608,0.000114876064,0.00002513862,0.0014529902,0.00006882939,0.0012823157,0.00062629225,0.00020231551,0.00015662161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022911554,0.00042095652,0.012537289,0.000005809844,0.000020003514,6.374807e-7,0.0060272496,0.00065241475,0.0020723843,0.93919945,0.0025254309,0.036536057],"study_design_scores_gemma":[0.00041701863,0.000019512689,0.0047539575,0.000042851025,0.0000031460577,0.000004662979,0.00027480684,0.98528683,0.0005483391,0.00010877367,0.008300987,0.00023912327],"about_ca_topic_score_codex":0.000017380713,"about_ca_topic_score_gemma":0.00021060994,"teacher_disagreement_score":0.9846344,"about_ca_system_score_codex":0.00013751218,"about_ca_system_score_gemma":0.00008277089,"threshold_uncertainty_score":0.468451},"labels":[],"label_agreement":null},{"id":"W2032843434","doi":"10.1109/icassp.2007.366497","title":"Optimal Precoder for Amplify-and-Forward Half-Duplex Cooperative System","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Coding gain; Quadrature amplitude modulation; Farey sequence; Pairwise error probability; QAM; Relay; Diversity gain; Computer science; Algorithm; Expression (computer science); Mathematics; Control theory (sociology); Topology (electrical circuits); Decoding methods; Bit error rate; Discrete mathematics; Fading; Power (physics); Physics; Combinatorics","score_opus":0.04176172914819873,"score_gpt":0.3012851952351089,"score_spread":0.2595234660869101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032843434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035703948,0.00034115923,0.984068,0.0010559362,0.00016894136,0.0004289165,0.0000015866847,0.000261834,0.010103237],"genre_scores_gemma":[0.74835056,0.0000750224,0.24820271,0.0005113157,0.000075039796,0.00005055461,0.0000061924934,0.000010504341,0.0027180954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998962,0.0000586291,0.0002623483,0.00031423627,0.00011639104,0.00028641272],"domain_scores_gemma":[0.9987477,0.0003629166,0.000057278663,0.00046953373,0.00023995806,0.0001226019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080011075,0.00013713045,0.00017328415,0.000072936535,0.00035261342,0.00020624568,0.0005667849,0.000059052374,0.000019207597],"category_scores_gemma":[0.000041659157,0.00011326566,0.000043467815,0.00023216194,0.00004534975,0.00032692496,0.00032873414,0.00011036812,0.000025386318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022298434,0.000035591704,0.0000872317,0.000023369976,0.000036245765,0.0000017244588,0.0012248192,0.00056534086,0.0007403884,0.9351951,0.0049964343,0.05707148],"study_design_scores_gemma":[0.00089564483,0.00018684848,0.00060513866,0.00005141328,0.000009877475,0.000033011544,0.00048614442,0.8428283,0.0045205397,0.00004042493,0.14995773,0.00038496268],"about_ca_topic_score_codex":0.000005854256,"about_ca_topic_score_gemma":0.000074143485,"teacher_disagreement_score":0.9351547,"about_ca_system_score_codex":0.000058709207,"about_ca_system_score_gemma":0.000041233918,"threshold_uncertainty_score":0.46188396},"labels":[],"label_agreement":null},{"id":"W2033078983","doi":"","title":"On optimal power allocation of layered coding in noisy wireless relay networks","year":2012,"lang":"en","type":"article","venue":"Wireless Personal Multimedia Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Linear network coding; Computer network; Coding (social sciences); Wireless; Relay channel; Node (physics); Scalability; Wireless network; Power (physics); Engineering; Telecommunications; Mathematics","score_opus":0.04115262192504403,"score_gpt":0.2962624722956794,"score_spread":0.2551098503706354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033078983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63191015,0.004124777,0.34943026,0.0064690304,0.00076556945,0.0010337827,0.000017920242,0.00034072215,0.0059077893],"genre_scores_gemma":[0.97482854,0.0018025141,0.022762073,0.00028968498,0.000046052883,0.00012786817,0.000053780004,0.000025758462,0.00006374404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762505,0.000609636,0.00060701213,0.00030824967,0.0003565793,0.000493471],"domain_scores_gemma":[0.9956083,0.0014626851,0.00029307863,0.0021886167,0.00025362472,0.00019364714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009626156,0.00025602488,0.00035261785,0.00027955338,0.00035790584,0.00006543373,0.0026856249,0.00015984337,0.0000449925],"category_scores_gemma":[0.00013484649,0.00026798664,0.00011647957,0.0009890574,0.00026067215,0.0006741476,0.0009788428,0.0007103612,0.000045233566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001442621,0.004287866,0.021798166,0.00004856382,0.0002037819,0.0000045283705,0.06722368,0.012042317,0.015051155,0.6598398,0.0016035471,0.21775235],"study_design_scores_gemma":[0.00070676755,0.000054080527,0.01969951,0.0001990315,0.000007838952,0.000006159752,0.00038166906,0.9774707,0.000486402,0.000021957156,0.0006512456,0.00031462449],"about_ca_topic_score_codex":0.000037157337,"about_ca_topic_score_gemma":0.00010758359,"teacher_disagreement_score":0.9654284,"about_ca_system_score_codex":0.00018513155,"about_ca_system_score_gemma":0.00010004755,"threshold_uncertainty_score":0.99997723},"labels":[],"label_agreement":null},{"id":"W2033140050","doi":"10.1109/glocomw.2012.6477614","title":"Dual-hop AF relaying systems in mixed nakagami-m and Rician links","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Nakagami distribution; Fading; Cumulative distribution function; Probability density function; Mathematics; Fading distribution; Statistics; Computer science; Applied mathematics; Rayleigh fading","score_opus":0.045773638528914834,"score_gpt":0.2758745247070126,"score_spread":0.2301008861780978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033140050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5705441,0.031133821,0.28886327,0.0050330963,0.0023394974,0.0006719083,6.5954714e-7,0.0005757692,0.10083787],"genre_scores_gemma":[0.99374133,0.000511473,0.0045270454,0.00036153087,0.00006585806,0.000012961685,7.1792937e-7,0.0000050434824,0.0007740168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912673,0.00018588408,0.00019348775,0.00015448619,0.0001004017,0.00023902027],"domain_scores_gemma":[0.99925053,0.00015145914,0.00004245344,0.00042426088,0.000038585844,0.00009269453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064037327,0.00008562802,0.00011897496,0.00008248984,0.00022151432,0.00026914527,0.00029549067,0.00007360269,0.000006396026],"category_scores_gemma":[0.00003880455,0.000074849966,0.00001596264,0.0003757881,0.000021107471,0.0004926106,0.00041861256,0.00023333002,0.000037996368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005394187,0.00018626792,0.060657106,0.000039395603,0.000025374271,0.000009427668,0.008483521,0.0002209007,0.003582428,0.7053465,0.004609243,0.21683441],"study_design_scores_gemma":[0.0015345799,0.0000945647,0.20021786,0.0003625633,0.000009696683,0.00009830374,0.0013793902,0.6307477,0.00070822635,0.00037607984,0.16344015,0.0010308924],"about_ca_topic_score_codex":0.000032696706,"about_ca_topic_score_gemma":0.000077204895,"teacher_disagreement_score":0.7049704,"about_ca_system_score_codex":0.00003568231,"about_ca_system_score_gemma":0.0000152276625,"threshold_uncertainty_score":0.3052293},"labels":[],"label_agreement":null},{"id":"W2033185214","doi":"10.1109/lcomm.2015.2472531","title":"Capacity Bounds for a Class of Diamond Networks With Conferencing Relays","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Upper and lower bounds; Channel capacity; Relay; Wireless network; Gaussian; Channel (broadcasting); Wireless; Backhaul (telecommunications); Telecommunications; Mathematics","score_opus":0.11803532122572682,"score_gpt":0.2908637812203323,"score_spread":0.17282845999460547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033185214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028325574,0.0005095804,0.95384395,0.014673351,0.00015145705,0.00046299488,0.0000042218467,0.00011337748,0.0019155174],"genre_scores_gemma":[0.876051,0.00019526311,0.12208188,0.0014023951,0.000029567718,0.00017922583,0.0000135951,0.0000126567,0.000034382127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987807,0.00028333097,0.00032749012,0.00021322614,0.00016544077,0.00022980558],"domain_scores_gemma":[0.9955282,0.00052275654,0.00022114834,0.0031649629,0.00044620575,0.00011668656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063864526,0.00014449013,0.0002236802,0.00010899071,0.00032338212,0.00011802526,0.0028635226,0.000053043586,0.0000011967124],"category_scores_gemma":[0.00007229854,0.0001334659,0.000062730454,0.00051904225,0.00031710666,0.0003649387,0.0004222951,0.00027534584,0.0000032932853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016230375,0.0008811039,0.012937897,0.00008249866,0.0005429046,0.0000033214305,0.02630732,0.0694907,0.028452298,0.70726216,0.08349215,0.07038536],"study_design_scores_gemma":[0.0017504584,0.00021810296,0.0014369944,0.00016771749,0.000040397594,0.000016520587,0.00017844343,0.92642105,0.001565084,0.0006393641,0.06705768,0.0005081697],"about_ca_topic_score_codex":0.000025040295,"about_ca_topic_score_gemma":0.0002626262,"teacher_disagreement_score":0.8569304,"about_ca_system_score_codex":0.000102306156,"about_ca_system_score_gemma":0.00012452037,"threshold_uncertainty_score":0.5442582},"labels":[],"label_agreement":null},{"id":"W2033323506","doi":"10.1109/ciss.2012.6310794","title":"Channel quantization and bit allocation in multi-source multi-relay cooperative networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The King's University; University of Toronto","funders":"","keywords":"Quantization (signal processing); Computer science; Channel state information; Relay; Upper and lower bounds; Bit error rate; Algorithm; Mathematical optimization; Mathematics; Decoding methods; Telecommunications; Wireless; Power (physics); Physics","score_opus":0.07266910559173065,"score_gpt":0.30446279094103806,"score_spread":0.23179368534930742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033323506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010135129,0.0015548101,0.98694515,0.00065027736,0.00016747315,0.00025379844,1.6972177e-7,0.00011520122,0.00017798654],"genre_scores_gemma":[0.9727944,0.0011976103,0.024658047,0.00061221304,0.000038637147,0.000031221156,0.00000903568,0.000009702068,0.0006491471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889886,0.0002517789,0.00024088599,0.00023884438,0.00009345213,0.00027616057],"domain_scores_gemma":[0.99923044,0.00011516282,0.000067297406,0.00035843256,0.00012455034,0.00010410422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005428929,0.00013842272,0.0001368911,0.000095192634,0.000194681,0.000117142554,0.00033933893,0.000074959346,0.000013044186],"category_scores_gemma":[0.000071894996,0.00012499742,0.000018451005,0.0006208775,0.000044163375,0.00086956803,0.00030734477,0.00017293953,0.000021046579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034264925,0.0019962236,0.10586363,0.0000317805,0.00008361988,0.000002567995,0.041429028,0.36788875,0.0030972387,0.27400485,0.0014812194,0.20408683],"study_design_scores_gemma":[0.0005514122,0.00001773263,0.034051124,0.000025177604,0.0000018453999,0.000002984671,0.00010925626,0.9639376,0.0002366736,0.0000025087877,0.0008987358,0.0001649815],"about_ca_topic_score_codex":0.00003130055,"about_ca_topic_score_gemma":0.00043751494,"teacher_disagreement_score":0.96265924,"about_ca_system_score_codex":0.000045301753,"about_ca_system_score_gemma":0.000018509254,"threshold_uncertainty_score":0.5097246},"labels":[],"label_agreement":null},{"id":"W2033599745","doi":"10.1109/tsp.2010.2094193","title":"On the Energy Efficiency of LT Codes in Proactive Wireless Sensor Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Defence Research and Development Canada","funders":"","keywords":"Frequency-shift keying; Computer science; Wireless sensor network; Keying; Code rate; Electronic engineering; Efficient energy use; Spectral efficiency; Fading; Real-time computing; Channel (broadcasting); Algorithm; Telecommunications; Computer network; Engineering; Decoding methods; Demodulation; Electrical engineering","score_opus":0.023769246292815443,"score_gpt":0.2565869090159476,"score_spread":0.23281766272313217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033599745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06554469,0.000054903652,0.9329083,0.0004035444,0.00012135167,0.00011882645,8.7972364e-7,0.000054646116,0.000792848],"genre_scores_gemma":[0.9983736,0.000048475773,0.0011810631,0.00026278186,0.000022183849,0.00004062203,2.8724392e-7,0.000009995093,0.00006095414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988753,0.00017019692,0.00025538326,0.00026617295,0.00022522816,0.00020767629],"domain_scores_gemma":[0.9988222,0.0005011411,0.000111004956,0.00037385945,0.00014731871,0.00004445167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037084537,0.00014276475,0.00015635368,0.00014770315,0.00038986755,0.00010093664,0.0006550746,0.000073052084,0.00002757435],"category_scores_gemma":[0.0000057942425,0.00010482047,0.0000561913,0.00085177826,0.00013713421,0.00023140994,0.0000058787127,0.0005768222,0.0000025196039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068903806,0.00061167456,0.000010045409,0.000012267492,0.000020897249,0.000003124264,0.0022211769,0.1386902,0.052964035,0.019827466,0.000023359396,0.78554684],"study_design_scores_gemma":[0.00020021202,0.00007984027,0.000055076212,0.00010111502,0.00000459726,0.000004362367,0.000049113678,0.8951669,0.10390614,0.00024566858,0.000052297986,0.00013469829],"about_ca_topic_score_codex":0.000009320205,"about_ca_topic_score_gemma":0.00014154743,"teacher_disagreement_score":0.93282896,"about_ca_system_score_codex":0.000029467274,"about_ca_system_score_gemma":0.00009917932,"threshold_uncertainty_score":0.42744547},"labels":[],"label_agreement":null},{"id":"W2033611811","doi":"10.3390/s130404884","title":"Estimation of Distribution Algorithm for Resource Allocation in Green Cooperative Cognitive Radio Sensor Networks","year":2013,"lang":"en","type":"article","venue":"Sensors","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Throughput; Heuristic; Resource allocation; Mathematical optimization; Cognitive radio; Optimization problem; Computer network; Wireless; Power (physics); Algorithm; Telecommunications","score_opus":0.021871340259181044,"score_gpt":0.2676694551101651,"score_spread":0.24579811485098405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033611811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059083894,0.00013317219,0.93880415,0.0008745335,0.000055655357,0.0008199375,0.000013068611,0.00005412823,0.00016144245],"genre_scores_gemma":[0.97093916,0.00008236957,0.028236587,0.00011491505,0.00004410617,0.00011599853,0.00022738054,0.000009451621,0.0002300519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882615,0.0002550618,0.00033104036,0.00025759687,0.00012786344,0.00020229882],"domain_scores_gemma":[0.99865395,0.00046113628,0.00014747081,0.0002866481,0.00039796814,0.00005282901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032531103,0.00012755394,0.00018768359,0.00007977475,0.00012639114,0.000060697454,0.00026991515,0.00007254882,0.000009013779],"category_scores_gemma":[0.00015358234,0.00012583674,0.00004549835,0.00054407294,0.000071129696,0.00031050932,0.000088658664,0.00013050917,0.00001124069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009945006,0.00006997248,0.000079479134,0.000007947443,0.00001932483,5.734859e-7,0.001258587,0.06289559,0.00014998164,0.004483134,0.0004256265,0.93059987],"study_design_scores_gemma":[0.0005537205,0.000079671874,0.0031202652,0.000072887655,0.00000566184,0.0000028580887,0.00019043419,0.994068,0.0012629775,0.00012538648,0.0003805614,0.0001375412],"about_ca_topic_score_codex":0.00005717674,"about_ca_topic_score_gemma":0.000028956598,"teacher_disagreement_score":0.93117243,"about_ca_system_score_codex":0.00007760494,"about_ca_system_score_gemma":0.00003349233,"threshold_uncertainty_score":0.51314735},"labels":[],"label_agreement":null},{"id":"W2033644422","doi":"10.1109/twc.2011.120611.11006","title":"Amplify-and-Forward Selection Cooperation over Rayleigh Fading Channels with Imperfect CSI","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rayleigh fading; Relay; Fading; Computer science; Channel (broadcasting); Upper and lower bounds; Imperfect; Bandwidth (computing); Selection (genetic algorithm); Signal-to-noise ratio (imaging); Telecommunications; Relay channel; Algorithm; Channel capacity; Statistics; Mathematics","score_opus":0.05018551072171268,"score_gpt":0.2727535342234887,"score_spread":0.222568023501776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033644422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03192902,0.00017596477,0.9642873,0.00066002697,0.00018951853,0.00044710503,0.0000061371175,0.00042343576,0.0018815112],"genre_scores_gemma":[0.9777954,0.0027949486,0.018465007,0.00033756837,0.000021171445,0.00029106808,0.000009036658,0.000031344614,0.00025444146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982737,0.00040831574,0.0003631447,0.0004303981,0.00021262579,0.00031184786],"domain_scores_gemma":[0.9972214,0.00027857558,0.00013768012,0.0019393736,0.0002686446,0.00015430966],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00034900804,0.00027819065,0.00025415086,0.00030693968,0.0016335583,0.00023911925,0.0014115369,0.00012289341,0.00007986093],"category_scores_gemma":[0.0000060065126,0.00025875226,0.00007274107,0.0010444893,0.00020691693,0.00096825394,0.000038893115,0.00063944823,0.000040781793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003069571,0.0030048403,0.0011224202,0.00007496607,0.0008130687,0.0000061874193,0.034918316,0.016813962,0.032901634,0.36671048,0.000670703,0.5426565],"study_design_scores_gemma":[0.0022607057,0.0009590219,0.001843989,0.00030821146,0.00013848262,0.00013105228,0.00024939244,0.93288124,0.052999318,0.0005272383,0.006323329,0.0013780138],"about_ca_topic_score_codex":0.000082340084,"about_ca_topic_score_gemma":0.00048818128,"teacher_disagreement_score":0.9458664,"about_ca_system_score_codex":0.00012143117,"about_ca_system_score_gemma":0.000098867546,"threshold_uncertainty_score":0.99998647},"labels":[],"label_agreement":null},{"id":"W2033959431","doi":"10.1109/cwit.2013.6621608","title":"Scheduling in omnidirectional relay networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Omnidirectional antenna; Relay; Scheduling (production processes); Wireless; Duplex (building); Scheme (mathematics); Wireless network; Mathematical optimization; Greedy algorithm; Computer network; Algorithm; Mathematics; Telecommunications; Antenna (radio)","score_opus":0.02530905105783359,"score_gpt":0.25522782077194367,"score_spread":0.22991876971411007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033959431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021858685,0.00038686546,0.94411945,0.0030224568,0.00021514067,0.000110701825,1.3730774e-8,0.00015592994,0.030130748],"genre_scores_gemma":[0.9353909,0.00024609626,0.06257892,0.0007568307,0.00003865746,0.000028057055,6.0047523e-7,0.0000028588486,0.0009571167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994339,0.00006867286,0.00013527916,0.0001490193,0.0000723785,0.00014075791],"domain_scores_gemma":[0.9994743,0.00009209467,0.000021054244,0.00030861897,0.00006236242,0.000041610387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018580616,0.000055448134,0.00006155431,0.000064192354,0.000086167856,0.000119527045,0.0004461142,0.00002986214,0.0002993737],"category_scores_gemma":[0.00002403456,0.000049397335,0.000020189229,0.00043436798,0.000013554789,0.00043188664,0.00022722651,0.0001523443,0.00017563348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011128352,0.000078833815,0.010899077,0.0000014382199,0.0000082198285,0.0000017185463,0.00031334572,0.077752225,0.00046497164,0.6066983,0.0053358953,0.2984449],"study_design_scores_gemma":[0.00009867924,0.0000060329435,0.018918408,0.000009721184,1.7494479e-7,0.0000024297844,0.000008007358,0.97828513,0.000049350267,0.0005065925,0.002042927,0.00007253496],"about_ca_topic_score_codex":0.000021991107,"about_ca_topic_score_gemma":0.0000614652,"teacher_disagreement_score":0.9135322,"about_ca_system_score_codex":0.000029761843,"about_ca_system_score_gemma":0.000018666733,"threshold_uncertainty_score":0.32779318},"labels":[],"label_agreement":null},{"id":"W2034225814","doi":"10.1109/twc.2014.022114.131050","title":"SLNC for Multi-Source Multi-Relay BICM-OFDM Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise error probability; Orthogonal frequency-division multiplexing; Relay; Computer science; Diversity scheme; Subcarrier; Cooperative diversity; Fading; Diversity gain; Linear network coding; Coding gain; Upper and lower bounds; Antenna diversity; Algorithm; Telecommunications; Channel (broadcasting); Computer network; Wireless; Mathematics; Decoding methods; Physics","score_opus":0.09465042618791646,"score_gpt":0.3208330489491569,"score_spread":0.2261826227612404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034225814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066060206,0.00046986176,0.99431074,0.0020512051,0.0006436664,0.0008404818,0.000022850854,0.0006235629,0.00037700686],"genre_scores_gemma":[0.84169185,0.0013629575,0.15341048,0.0004409216,0.000032088683,0.0008622027,0.000015327294,0.000043294833,0.0021408724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976038,0.0007069064,0.0005807452,0.0004798879,0.00022731817,0.00040137226],"domain_scores_gemma":[0.9931154,0.001148825,0.00020754673,0.0049216873,0.00041422047,0.00019227652],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00070025807,0.00030208784,0.00034712686,0.0002898931,0.0018958361,0.00031954827,0.0041115214,0.0001530771,0.000009024054],"category_scores_gemma":[0.000031774038,0.00031110088,0.00022164843,0.0007638795,0.00020557284,0.000438461,0.00005326809,0.0005712794,0.000124802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003494685,0.00332727,0.000056629582,0.00008937758,0.0002930675,4.7647447e-7,0.0042284727,0.112973504,0.0077007823,0.14803614,0.0012852084,0.72197413],"study_design_scores_gemma":[0.0011088529,0.00008198192,0.00007246846,0.000102925944,0.000025241654,0.0000062837953,0.00007590128,0.9366312,0.0012151767,0.000016212502,0.060317665,0.00034608494],"about_ca_topic_score_codex":0.000046970687,"about_ca_topic_score_gemma":0.00043483407,"teacher_disagreement_score":0.84103125,"about_ca_system_score_codex":0.00013376417,"about_ca_system_score_gemma":0.00008394253,"threshold_uncertainty_score":0.99993414},"labels":[],"label_agreement":null},{"id":"W2034388573","doi":"10.1109/qbsc.2012.6221366","title":"Outage performance of Decode and Forward incremental relaying in an overlay spectrum sharing environment","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Overlay; Interference (communication); Exploit; Computer network; Channel (broadcasting); Silence; Outage probability; Computer security; Fading","score_opus":0.03491444429316554,"score_gpt":0.26433862744771813,"score_spread":0.2294241831545526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034388573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98064,0.00029560918,0.016727954,0.00011349904,0.000034371216,0.00007593134,1.79752e-7,0.000019945162,0.0020925307],"genre_scores_gemma":[0.9882398,0.00050551037,0.01107873,0.00008865341,0.000013146924,0.0000046849323,9.0407883e-7,0.0000036276658,0.00006492103],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993849,0.000033892742,0.00016825333,0.00014017914,0.000096118965,0.00017666502],"domain_scores_gemma":[0.99951106,0.000024095114,0.000043335276,0.00035556388,0.000003987904,0.00006195302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004039113,0.00006796032,0.00008865962,0.00006172843,0.000071625465,0.000031142474,0.00034767363,0.000018844303,0.000052020914],"category_scores_gemma":[0.00000375416,0.000063365485,0.000012336928,0.00008766689,0.000021818478,0.0008998533,0.0006136957,0.00008380203,0.000006337924],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000513973,0.0000789534,0.9517048,0.000007309919,0.0000041720346,2.8252848e-7,0.002166205,0.00017254266,0.005764823,0.019289771,0.000008143657,0.020797836],"study_design_scores_gemma":[0.00043324957,0.00012019485,0.6021819,0.00003908441,0.000002496582,0.0000056886342,0.0001302943,0.38299724,0.013189948,0.00006125621,0.0006333686,0.00020527],"about_ca_topic_score_codex":0.000007651222,"about_ca_topic_score_gemma":0.000036264824,"teacher_disagreement_score":0.38282472,"about_ca_system_score_codex":0.000050853872,"about_ca_system_score_gemma":0.000004830315,"threshold_uncertainty_score":0.25839695},"labels":[],"label_agreement":null},{"id":"W2034406516","doi":"10.1109/glocom.2014.7037597","title":"iCoMe: A novel incentivized cooperative mobile resource management mechanism","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Resource management (computing); Resource allocation; Service provider; Quality of service; Computer network; Mobile computing; Distributed computing; Cloud computing; Service (business); Business; Operating system","score_opus":0.021503956242554655,"score_gpt":0.25585161434381215,"score_spread":0.2343476581012575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034406516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012372208,0.00005319659,0.89433235,0.0007485197,0.00009845114,0.0003196363,3.8194455e-7,0.0002478132,0.10296245],"genre_scores_gemma":[0.9061078,0.00013553516,0.083997466,0.002288654,0.000032732692,0.00013128725,0.0000042107317,0.000010117794,0.0072922357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882126,0.00017417835,0.00020835223,0.0003558846,0.00020752614,0.00023281976],"domain_scores_gemma":[0.99870646,0.00011605781,0.000057017693,0.0009396995,0.00009676893,0.00008398087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051934767,0.00014297523,0.00016004713,0.00009175002,0.00029096453,0.0002063244,0.0011972947,0.000033366636,0.000116371964],"category_scores_gemma":[0.000011884884,0.00012238031,0.000047744332,0.000497081,0.000034255194,0.00025272171,0.0011200003,0.0001270029,0.00014050401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002866497,0.000083393585,0.0000047685703,0.000003109989,0.00001749748,6.4534527e-7,0.0003590534,0.00008999537,0.0013506489,0.9325369,0.0014101396,0.06414101],"study_design_scores_gemma":[0.0016011575,0.00014354024,0.00018618802,0.000047403028,0.000007969274,0.0000054920906,0.00015907767,0.5009316,0.0047387127,0.0025255315,0.4892448,0.00040852922],"about_ca_topic_score_codex":0.0000017869033,"about_ca_topic_score_gemma":0.000009537469,"teacher_disagreement_score":0.93001133,"about_ca_system_score_codex":0.000044410463,"about_ca_system_score_gemma":0.000012584314,"threshold_uncertainty_score":0.49905244},"labels":[],"label_agreement":null},{"id":"W2034590911","doi":"10.1155/wcn/2006/17202","title":"Multiuser Cooperative Diversity for Wireless Networks","year":2006,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary; University of Alberta","funders":"","keywords":"Computer science; Diversity (politics); Wireless; Wireless network; Cooperative diversity; Computer network; Telecommunications","score_opus":0.0526718227756188,"score_gpt":0.2860927339793834,"score_spread":0.2334209112037646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034590911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04286167,0.009725682,0.938523,0.004924599,0.00073849765,0.00054266874,0.0000040779473,0.00019610752,0.0024837176],"genre_scores_gemma":[0.97191525,0.018969432,0.0077441717,0.0006431159,0.00046569825,0.000034758887,0.000017002447,0.0000235372,0.00018701713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979732,0.00053632166,0.0005036792,0.00033231566,0.0002225138,0.00043197282],"domain_scores_gemma":[0.9966532,0.0010792804,0.00034848618,0.0013500275,0.0004138846,0.00015513098],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009817152,0.00026905225,0.0003261663,0.00015360651,0.0046666325,0.0006194393,0.002383108,0.00010248507,0.000005054073],"category_scores_gemma":[0.000013330751,0.00024838795,0.00013084256,0.0005384153,0.00019155178,0.0005269599,0.0020177066,0.0007307972,0.000003063952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007078784,0.00042926217,0.007728823,0.000009953524,0.00012376226,0.000009865526,0.0011597719,0.0066041965,0.0002965445,0.28410777,0.0051647653,0.6942945],"study_design_scores_gemma":[0.0011386524,0.00016720092,0.002695434,0.00021855855,0.000022490085,0.000058135953,0.000055880337,0.9265031,0.000053927874,0.0010710261,0.06759161,0.00042394857],"about_ca_topic_score_codex":0.0000111681975,"about_ca_topic_score_gemma":0.00013154415,"teacher_disagreement_score":0.9307788,"about_ca_system_score_codex":0.00010213707,"about_ca_system_score_gemma":0.000048104943,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W2034691237","doi":"10.1109/bsc.2008.4563230","title":"Multiuser diversity and cooperative relaying in wireless networks with short-term power constraint","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Aloha; Computer science; Fading; Computer network; Scheduling (production processes); Antenna diversity; Wireless network; Wireless; Cooperative diversity; Channel (broadcasting); Exploit; Throughput; Transmission (telecommunications); Telecommunications; Engineering; Computer security","score_opus":0.04247181019599774,"score_gpt":0.24832467628273047,"score_spread":0.20585286608673273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034691237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6663795,0.00012130291,0.3294447,0.00021294488,0.000035040193,0.00014639997,2.0641859e-7,0.0000684067,0.0035914711],"genre_scores_gemma":[0.9932076,0.0006046696,0.0056254743,0.00038002056,0.0000071591508,0.000005934295,0.0000010133384,0.000004663473,0.0001635114],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99913573,0.00011209201,0.0001429736,0.00029079863,0.00011792618,0.00020047875],"domain_scores_gemma":[0.9993255,0.00011885988,0.000026494645,0.0003408023,0.000104384395,0.000083929415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016806548,0.00012780509,0.00015845546,0.00006290157,0.00082422973,0.00004903173,0.00040677306,0.000046049925,0.000035803216],"category_scores_gemma":[0.000007977326,0.00010119592,0.00001622018,0.00032551144,0.00020835787,0.00040412226,0.0013808017,0.00018526518,0.0000021732353],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041452233,0.0001625726,0.9079597,0.0000035873259,0.000044594533,0.00022135745,0.019126693,0.0025249175,0.00028069646,0.048137285,0.00022859902,0.021268558],"study_design_scores_gemma":[0.001559881,0.00019812805,0.5300804,0.00011973894,0.000005030907,0.00019327886,0.00045406976,0.4662987,0.00022091447,0.000014936013,0.00024053421,0.0006144122],"about_ca_topic_score_codex":0.000015421198,"about_ca_topic_score_gemma":0.00026047867,"teacher_disagreement_score":0.4637738,"about_ca_system_score_codex":0.000039227554,"about_ca_system_score_gemma":0.000032280263,"threshold_uncertainty_score":0.6339392},"labels":[],"label_agreement":null},{"id":"W2034776565","doi":"10.1049/iet-com.2013.0421","title":"Lower bound on the bit error rate of a decode‐and‐forward relay network under chaos shift keying communication system","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Relay; Bit error rate; Computer science; CHAOS (operating system); Keying; Bit (key); Telecommunications; Computer network; Decoding methods; Physics; Computer security","score_opus":0.05583631251590348,"score_gpt":0.29127147032641026,"score_spread":0.23543515781050678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034776565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07912028,0.0105446065,0.6899907,0.15791541,0.00074170233,0.0022022119,0.000014665867,0.0010067859,0.058463614],"genre_scores_gemma":[0.9821371,0.0019855227,0.013766926,0.0017582964,0.000036008412,0.00014918724,0.000015753312,0.000022633003,0.00012860853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964017,0.002224306,0.00058593566,0.0002914232,0.00019785481,0.00029873638],"domain_scores_gemma":[0.988537,0.0032329168,0.00040077584,0.0074872426,0.00024454683,0.00009751567],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027304008,0.00022017662,0.00030208105,0.00010293582,0.0017257072,0.00025888774,0.004917081,0.00009789553,0.000013978936],"category_scores_gemma":[0.00019684173,0.00017577985,0.00010786138,0.00077778194,0.00041112426,0.00031086756,0.0023536594,0.0005717598,0.00005828134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007975548,0.00007813203,0.00017455603,0.00001164418,0.00004573582,8.491581e-8,0.0016095483,0.0020647394,0.000078043035,0.99052185,0.0013438107,0.0040638777],"study_design_scores_gemma":[0.00088205916,0.00021561838,0.014121281,0.0010834379,0.00007012429,0.000012889926,0.00064143393,0.8784637,0.0001756615,0.018927513,0.08474367,0.0006626327],"about_ca_topic_score_codex":0.00004541545,"about_ca_topic_score_gemma":0.00043007842,"teacher_disagreement_score":0.97159433,"about_ca_system_score_codex":0.000091541726,"about_ca_system_score_gemma":0.00007155907,"threshold_uncertainty_score":0.9995739},"labels":[],"label_agreement":null},{"id":"W2034937481","doi":"10.1109/tvt.2014.2380827","title":"Cooperative ARQ-Based Energy-Efficient Routing in Multihop Wireless Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Retransmission; Computer network; Computer science; Energy consumption; Physical layer; Relay; Automatic repeat request; Transmission (telecommunications); Hybrid automatic repeat request; Cooperative diversity; Routing protocol; Efficient energy use; Wireless; Distributed computing; Routing (electronic design automation); Channel (broadcasting); Engineering; Fading; Network packet; Telecommunications","score_opus":0.012720797582359703,"score_gpt":0.23545401301074284,"score_spread":0.22273321542838315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034937481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031694993,0.000094825315,0.9650152,0.0020549726,0.0002810207,0.0001711051,7.893159e-7,0.00050603924,0.00018107746],"genre_scores_gemma":[0.99420005,0.00008938707,0.0048156884,0.00067848025,0.000016443188,0.00013459817,0.0000017423692,0.00001810891,0.000045482597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823654,0.00031050786,0.00035221642,0.0005233183,0.00017093786,0.00040647193],"domain_scores_gemma":[0.99847275,0.00021444424,0.000089541376,0.0010037398,0.00015328327,0.00006623478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038061713,0.0002328485,0.0002813166,0.000573906,0.00039119643,0.000069470705,0.0009829552,0.0002633129,0.000012383759],"category_scores_gemma":[0.000016874817,0.00023109416,0.00008581996,0.0018296982,0.00015392051,0.00009432776,0.000015907812,0.0006614781,0.000018289467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007012099,0.00021870084,0.00002305515,0.0000016982273,0.000011853645,0.000005989721,0.00007511851,0.7699766,0.0017448151,0.04005086,0.000009482887,0.1878748],"study_design_scores_gemma":[0.00071403687,0.00011415749,0.00003692468,0.00007312104,0.0000050643566,0.0000065810036,0.000024449606,0.9689165,0.02892299,0.00006904259,0.0008747757,0.0002423888],"about_ca_topic_score_codex":0.000014640249,"about_ca_topic_score_gemma":0.0002629472,"teacher_disagreement_score":0.9625051,"about_ca_system_score_codex":0.00013511894,"about_ca_system_score_gemma":0.00005871256,"threshold_uncertainty_score":0.94237465},"labels":[],"label_agreement":null},{"id":"W2035149277","doi":"10.1109/glocomw.2011.6162430","title":"High rate single-carrier frequency-domain equalization for multi-relay cooperative systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Fading; Computer science; Bandwidth (computing); Bit error rate; Equalization (audio); Algorithm; Topology (electrical circuits); Telecommunications; Mathematics; Physics; Combinatorics; Decoding methods","score_opus":0.15528208021935516,"score_gpt":0.29821323272873745,"score_spread":0.1429311525093823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035149277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041274917,0.00035832782,0.9903346,0.00022870551,0.00067525404,0.0006470602,0.000006350107,0.00024308517,0.0033791745],"genre_scores_gemma":[0.70557314,0.00006289292,0.29225415,0.00046715653,0.000053725093,0.00016662732,0.00001937748,0.000016729637,0.0013862094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984488,0.00041715003,0.00037704577,0.00037275022,0.000116812414,0.00026745017],"domain_scores_gemma":[0.99834645,0.0002055266,0.00013230408,0.0006932101,0.00052077934,0.000101705635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006530365,0.0001814586,0.00021114516,0.00009018225,0.0003588302,0.00020492518,0.00082940154,0.0000767906,0.00008515196],"category_scores_gemma":[0.00015092785,0.00015303605,0.0000555094,0.00042515312,0.000058182202,0.00060243654,0.00020230038,0.00009449897,0.000040260726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006318593,0.0000896589,0.000109841814,0.000007147728,0.000026187865,0.0000011332327,0.0032047566,0.00017023378,0.006711895,0.98791486,0.0006740269,0.001083965],"study_design_scores_gemma":[0.005299954,0.0010806634,0.0018346501,0.00026274787,0.00003948941,0.000019012801,0.0011619795,0.9298828,0.035701003,0.0072744773,0.015575037,0.0018681333],"about_ca_topic_score_codex":0.00004773281,"about_ca_topic_score_gemma":0.00013103457,"teacher_disagreement_score":0.98064035,"about_ca_system_score_codex":0.000081447586,"about_ca_system_score_gemma":0.00007124763,"threshold_uncertainty_score":0.6240629},"labels":[],"label_agreement":null},{"id":"W2035154204","doi":"10.1109/lcomm.2011.111011.111729","title":"Capacity of the Gaussian Relay Channel with Correlated Noises to Within a Constant Gap","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Relay channel; Topology (electrical circuits); Gaussian; Quantization (signal processing); Constant (computer programming); Channel (broadcasting); Computer science; Mathematics; Coding (social sciences); Channel capacity; Linear network coding; Corollary; Algorithm; Telecommunications; Computer network; Network packet; Discrete mathematics; Statistics; Combinatorics; Physics","score_opus":0.10624464929136626,"score_gpt":0.2608317638905518,"score_spread":0.15458711459918553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035154204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38123852,0.00045060908,0.51628727,0.07657186,0.00083817675,0.0016549048,0.000019024264,0.00042922853,0.022510424],"genre_scores_gemma":[0.9519071,0.000082172795,0.044196773,0.0036728524,0.0000068394484,0.00006295551,0.0000015224117,0.000011732184,0.000058044217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856955,0.0004594295,0.00035596793,0.00022054893,0.00019562908,0.00019888488],"domain_scores_gemma":[0.9947307,0.00016920848,0.0002455177,0.004567377,0.00019426366,0.00009289941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000369133,0.00015500221,0.00018082258,0.00011593552,0.00050814485,0.000047216177,0.0045066793,0.00004186815,0.000009407433],"category_scores_gemma":[0.000053532673,0.00010906428,0.00006138237,0.0010969002,0.00048487456,0.00022968517,0.0008043007,0.00037647525,0.000022580307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016208562,0.001502339,0.01277996,0.000052718395,0.0005576711,0.000010296594,0.18964215,0.0075032096,0.14920314,0.61035484,0.019797316,0.008434281],"study_design_scores_gemma":[0.0098849,0.0020355189,0.17428741,0.0065529696,0.00059270405,0.0006941651,0.0046143616,0.48570797,0.26193136,0.005603951,0.040802583,0.0072920877],"about_ca_topic_score_codex":0.0000879392,"about_ca_topic_score_gemma":0.00054231385,"teacher_disagreement_score":0.6047509,"about_ca_system_score_codex":0.000059682763,"about_ca_system_score_gemma":0.00008012711,"threshold_uncertainty_score":0.83746064},"labels":[],"label_agreement":null},{"id":"W2035522629","doi":"10.1109/icc.2014.6883459","title":"Effective capacity of dual-hop networks with a concurrent buffer-aided relaying protocol","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Hop (telecommunications); Computer science; Outage probability; Fading; Computer network; Dual (grammatical number); Protocol (science); Buffer (optical fiber); Signal-to-noise ratio (imaging); Power (physics); Electronic engineering; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering","score_opus":0.028359286469846038,"score_gpt":0.2803648896319525,"score_spread":0.25200560316210646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035522629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006313248,0.000012852737,0.9669428,0.00019028001,0.00006990575,0.018728424,1.7408429e-7,0.00014084537,0.0076014786],"genre_scores_gemma":[0.9690045,0.000004848554,0.013327457,0.00017823384,0.00004191148,0.017360223,6.9981894e-7,0.000007938278,0.00007417077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985995,0.00047770925,0.00024498184,0.00028092816,0.00018805254,0.00020877321],"domain_scores_gemma":[0.99838704,0.00043325222,0.00015529747,0.0006986756,0.00024456077,0.00008119871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066603464,0.00014849893,0.00023141317,0.000055457138,0.00016323286,0.00007100121,0.00051795563,0.000045536937,0.000023543345],"category_scores_gemma":[0.00007682833,0.00010590944,0.000046581874,0.00042667665,0.00010367504,0.00024379467,0.00035175006,0.00022974345,0.0000075442017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078906654,0.00038131964,0.005266998,0.00009984364,0.00010709989,0.0000029331804,0.0027926725,0.007762007,0.0024584627,0.54430324,0.0017928063,0.4349537],"study_design_scores_gemma":[0.0020341768,0.00073905766,0.0058861533,0.00026116477,0.000008806595,0.000016713371,0.000021255866,0.9757818,0.005844369,0.00030082645,0.00875175,0.00035392554],"about_ca_topic_score_codex":0.000011974307,"about_ca_topic_score_gemma":0.00004987135,"teacher_disagreement_score":0.9680198,"about_ca_system_score_codex":0.000039067865,"about_ca_system_score_gemma":0.000028893766,"threshold_uncertainty_score":0.43188617},"labels":[],"label_agreement":null},{"id":"W2035869080","doi":"10.1109/tvt.2011.2162972","title":"An Integrated Stimulation and Punishment Mechanism for Thwarting Packet Dropping Attack in Multihop Wireless Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Network packet; Computer science; Transmission delay; Relay; Fast packet switching; Packet forwarding; Processing delay","score_opus":0.04790557429663024,"score_gpt":0.28414075693317725,"score_spread":0.23623518263654703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035869080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21856575,0.000043746884,0.7802469,0.0003581549,0.00012237999,0.00036448002,0.0000011979088,0.0002851007,0.000012256866],"genre_scores_gemma":[0.9571969,0.00017708908,0.04228147,0.00014621527,0.0000069871808,0.00016408636,0.0000031126633,0.000014520939,0.000009649448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998845,0.00011516955,0.00029299842,0.00039595235,0.000080113925,0.00027077502],"domain_scores_gemma":[0.9990647,0.000068183,0.00008514721,0.0005742097,0.00015358269,0.000054218264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030002906,0.00016574466,0.00019211523,0.000388547,0.0002839919,0.00005175211,0.00047408752,0.0002182625,0.000005732798],"category_scores_gemma":[0.000008484955,0.00016648693,0.000040623843,0.00069610466,0.000070554626,0.00030614508,0.000010167469,0.00037799857,0.0000020458474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057670404,0.0005669138,0.00025632305,0.000016785567,0.000061168714,0.000012151046,0.0019238218,0.058403675,0.01908272,0.06852576,0.000008530794,0.8510845],"study_design_scores_gemma":[0.00058808766,0.00023270554,0.00012887632,0.00006570398,0.000008606892,0.000008098634,0.00016540884,0.9689033,0.028520934,0.0011314502,0.00006542463,0.00018140192],"about_ca_topic_score_codex":0.000014139853,"about_ca_topic_score_gemma":0.00026873418,"teacher_disagreement_score":0.91049963,"about_ca_system_score_codex":0.00007523236,"about_ca_system_score_gemma":0.000024431067,"threshold_uncertainty_score":0.678914},"labels":[],"label_agreement":null},{"id":"W2035989326","doi":"10.1109/twc.2014.020414.131260","title":"Design of Low-Density Parity-Check Codes for Half-Duplex Three-Phase Two-Way Relay Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Relay; Computer science; Relay channel; Decoding methods; Topology (electrical circuits); Node (physics); Theoretical computer science; Algorithm; Computer network; Mathematics; Combinatorics; Physics","score_opus":0.0802463359296151,"score_gpt":0.32296372383914174,"score_spread":0.24271738790952663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035989326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005333953,0.00018049777,0.98973364,0.0031072316,0.00030920317,0.0008537678,0.000019569135,0.00028073438,0.00018142143],"genre_scores_gemma":[0.89207894,0.0008985384,0.10619351,0.00024942105,0.000025047315,0.00038663304,0.00001687334,0.000028232993,0.00012278199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975447,0.0007906793,0.00063604175,0.00042482553,0.00025843733,0.0003453358],"domain_scores_gemma":[0.99251175,0.0020471043,0.00028196003,0.004440021,0.0005666883,0.0001524809],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011571457,0.00027969587,0.00044220412,0.0002478461,0.0013431109,0.0001394757,0.0032931336,0.00012572792,0.000018692634],"category_scores_gemma":[0.000039240735,0.0002943255,0.00020443073,0.0007540309,0.00033581723,0.00042973118,0.00005867152,0.00051262183,0.000029159573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019755187,0.0044209175,0.000023286852,0.00009980484,0.0003219103,7.2406465e-7,0.0035286273,0.23466237,0.039902586,0.21094817,0.00062506564,0.505269],"study_design_scores_gemma":[0.0015872389,0.00025091885,0.000027842492,0.00013120356,0.000039467664,0.0000047432904,0.000026769498,0.9610081,0.034486584,0.0009596796,0.0011653365,0.0003121709],"about_ca_topic_score_codex":0.00005483557,"about_ca_topic_score_gemma":0.0005859822,"teacher_disagreement_score":0.88674504,"about_ca_system_score_codex":0.00008806584,"about_ca_system_score_gemma":0.000115329356,"threshold_uncertainty_score":0.999957},"labels":[],"label_agreement":null},{"id":"W2036057600","doi":"10.1109/icc.2010.5502176","title":"Mesh Router Coordinated Relay Selection for Multicast Cooperative Communications in WMN","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Communications Research Centre Canada","funders":"","keywords":"Multicast; Computer network; Computer science; Protocol Independent Multicast; Xcast; Source-specific multicast; Router; Relay; Distributed computing; Pragmatic General Multicast; Heuristics; IP multicast; Wireless mesh network; Selection (genetic algorithm); Heuristic; Wireless; Wireless network; Telecommunications","score_opus":0.04687413756566287,"score_gpt":0.3303703276164768,"score_spread":0.2834961900508139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036057600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021405142,0.00012152137,0.956262,0.012663372,0.00034185912,0.0009439641,0.0000032163912,0.00033334387,0.007925595],"genre_scores_gemma":[0.850849,0.00012445537,0.1470307,0.00053467805,0.000021602478,0.00017392548,0.000013592493,0.000008416416,0.0012436635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900746,0.00016629252,0.00027384362,0.00026558322,0.00007557944,0.00021125868],"domain_scores_gemma":[0.9979891,0.0004140073,0.00005894048,0.0010643385,0.00040899866,0.00006459493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047801874,0.00012133366,0.0001454045,0.0001321153,0.00036129713,0.00017177637,0.0013477617,0.00008076442,0.000062142666],"category_scores_gemma":[0.00018725192,0.00011052054,0.000042069863,0.0007393117,0.000081355625,0.00049660786,0.00046574287,0.00041406357,0.000033447854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012361319,0.00025807382,0.0021596118,0.0000034136974,0.000019246632,2.9698109e-7,0.001707767,0.00021895937,0.026163602,0.9309947,0.0032840697,0.035177894],"study_design_scores_gemma":[0.0007474407,0.000057752342,0.0020789814,0.000012409882,0.0000029324515,0.0000058231076,0.00004211027,0.9637129,0.0032162701,0.000226188,0.02970914,0.00018810574],"about_ca_topic_score_codex":0.000026771295,"about_ca_topic_score_gemma":0.004177167,"teacher_disagreement_score":0.9634939,"about_ca_system_score_codex":0.000046004556,"about_ca_system_score_gemma":0.00007214173,"threshold_uncertainty_score":0.45068967},"labels":[],"label_agreement":null},{"id":"W2036066243","doi":"10.1109/spawc.2014.6941326","title":"Achievable SNR and rate regions for OFDM-based asynchronous two-way relay networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Relay; Subcarrier; Transceiver; Asynchronous communication; Beamforming; Orthogonal frequency-division multiplexing; Multipath propagation; Electronic engineering; Antenna (radio); Signal-to-noise ratio (imaging); Computer network; Power (physics); Telecommunications; Engineering; Wireless","score_opus":0.027551471294125125,"score_gpt":0.2690194970408597,"score_spread":0.24146802574673457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036066243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009502704,0.00031087475,0.9866921,0.0046267672,0.00015693282,0.00024843495,3.6962024e-7,0.00018122629,0.006833075],"genre_scores_gemma":[0.91131693,0.00018363309,0.0840487,0.0030013071,0.0000976414,0.000057028297,0.000006680234,0.000012071819,0.0012760102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989364,0.00021977852,0.00018841834,0.00031965502,0.00006882743,0.00026691225],"domain_scores_gemma":[0.9982485,0.00064418797,0.00006971171,0.00081280817,0.00011517226,0.000109620145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078092894,0.0001306617,0.00015933058,0.0000576832,0.0004607138,0.0002013137,0.0006024348,0.000047696147,0.000020191934],"category_scores_gemma":[0.00008109537,0.00011264648,0.000050462535,0.00025297698,0.0000606122,0.00022165872,0.0002322122,0.00013392049,0.000011917679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012847951,0.000047654812,0.00016786794,0.000006919599,0.000013306142,4.1290042e-7,0.00010333198,0.01790967,0.00025048593,0.90386397,0.008762123,0.068861425],"study_design_scores_gemma":[0.00073045935,0.00010528791,0.00034689845,0.000021024414,0.0000050582785,0.0000021439503,0.0000034071263,0.95441854,0.00022493258,0.0013617467,0.042619716,0.0001607866],"about_ca_topic_score_codex":0.000007893472,"about_ca_topic_score_gemma":0.00012489897,"teacher_disagreement_score":0.9365089,"about_ca_system_score_codex":0.000025672089,"about_ca_system_score_gemma":0.0000386478,"threshold_uncertainty_score":0.459359},"labels":[],"label_agreement":null},{"id":"W2036153400","doi":"10.1109/bsc.2008.4563208","title":"Efficient decoding algorithm for affine reflection group codes of rank 2","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Decoding methods; Rank (graph theory); Algorithm; Reflection (computer programming); Affine transformation; Mathematics; QAM; Quadrature amplitude modulation; Constellation; Group (periodic table); Computer science; Bit error rate; Combinatorics; Pure mathematics","score_opus":0.06048537855005565,"score_gpt":0.30832460744990864,"score_spread":0.247839228899853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036153400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060689715,0.00025020793,0.9892581,0.00031804017,0.0001542719,0.00017035168,7.4876334e-7,0.00010341151,0.003675871],"genre_scores_gemma":[0.5762284,0.00025816515,0.42283347,0.00010319514,0.00003570755,0.000019933133,0.0000024840938,0.00000401836,0.00051462266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993424,0.00004944249,0.00019719913,0.00017380314,0.00010804846,0.00012913009],"domain_scores_gemma":[0.99921185,0.00017042672,0.00006475632,0.00034502932,0.00017355003,0.00003437346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028720617,0.00007114879,0.00012302684,0.000082445054,0.0002565932,0.000021463991,0.000387273,0.000025529447,0.000027513554],"category_scores_gemma":[0.000035505447,0.00006260008,0.000056772653,0.0003592528,0.00003592444,0.00008301939,0.00014085801,0.00004982131,0.0000040721125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009625466,0.00017484534,0.00007296174,0.000008234085,0.000020549478,9.424625e-7,0.00085409224,0.001298345,0.012306473,0.05890659,0.0033081963,0.92303914],"study_design_scores_gemma":[0.0004063921,0.000079342746,0.00029811444,0.000012227728,0.000002040967,0.00001061995,0.000010542026,0.98630875,0.007920816,0.00010324088,0.004764028,0.00008390752],"about_ca_topic_score_codex":0.000004296759,"about_ca_topic_score_gemma":0.00001844443,"teacher_disagreement_score":0.9850104,"about_ca_system_score_codex":0.000031104573,"about_ca_system_score_gemma":0.000021907845,"threshold_uncertainty_score":0.2552757},"labels":[],"label_agreement":null},{"id":"W2036727854","doi":"10.1155/2009/727196","title":"Downlink Resource Allocation for Autonomous Infrastructure-based Multihop Cellular Networks","year":2009,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Base station; Relay; Telecommunications link; Knapsack problem; Transmitter power output; Mathematical optimization; Resource allocation; Throughput; Computer network; Cellular network; Power (physics); Wireless; Algorithm; Telecommunications; Mathematics","score_opus":0.017818442050379385,"score_gpt":0.29138216015064183,"score_spread":0.2735637181002625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036727854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014740345,0.010882682,0.9843526,0.0021392938,0.00015258587,0.00022767353,3.831792e-7,0.000090638394,0.0006801126],"genre_scores_gemma":[0.9272306,0.00040329449,0.06943236,0.0025694335,0.0003053743,0.000010362376,0.0000056930485,0.000013469433,0.00002939508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981876,0.00021056124,0.0005631808,0.00035533062,0.00029062168,0.00039269988],"domain_scores_gemma":[0.9986297,0.00027318037,0.00042232615,0.0003010979,0.00024113916,0.00013255705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084548106,0.00023192253,0.00024478702,0.0002510073,0.0005895999,0.0004567498,0.0010464254,0.00008113056,0.000009636631],"category_scores_gemma":[0.0000901195,0.00020621813,0.00008692003,0.0006470859,0.000049797003,0.0011602006,0.000048568927,0.0006886136,0.000002122359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004800394,0.00004874304,0.00006332377,0.000006550652,0.0000015192326,0.00000631973,0.00015300557,0.3739506,0.00059513695,0.001226724,0.000064412015,0.6238357],"study_design_scores_gemma":[0.0010431091,0.00031777963,0.00061090896,0.000352801,0.0000041908092,0.000020510015,0.000026277605,0.9612085,0.001520015,0.0027466705,0.03187425,0.00027499022],"about_ca_topic_score_codex":7.5410924e-8,"about_ca_topic_score_gemma":0.0000014605463,"teacher_disagreement_score":0.9257566,"about_ca_system_score_codex":0.00020248989,"about_ca_system_score_gemma":0.00016708502,"threshold_uncertainty_score":0.84093314},"labels":[],"label_agreement":null},{"id":"W2037360800","doi":"10.1109/tvt.2014.2335209","title":"Distributed Precoding for OFDM in Two-Way Relaying Communications","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Rician fading; Diversity gain; Orthogonal frequency-division multiplexing; Diversity scheme; Rayleigh fading; Computer science; Fading; Coding gain; Zero-forcing precoding; Electronic engineering; Coding (social sciences); Telecommunications; Algorithm; Mathematics; Engineering; MIMO; Statistics; Decoding methods; Channel (broadcasting)","score_opus":0.03276547086102075,"score_gpt":0.2996851692478048,"score_spread":0.26691969838678403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037360800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075321905,0.0001711881,0.9822382,0.008756189,0.00017202365,0.00037914116,0.0000065767,0.00047601524,0.0002684999],"genre_scores_gemma":[0.9470611,0.000283322,0.052016146,0.00020364788,0.00000854527,0.00035730068,0.000007148822,0.000013592006,0.000049193317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876064,0.00017594667,0.00032964768,0.00034527187,0.00009597202,0.00029250773],"domain_scores_gemma":[0.9974783,0.00036661397,0.00008605312,0.0018989942,0.00012486783,0.000045165078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004702854,0.00015193498,0.00021452864,0.0004839751,0.00050392025,0.00005805904,0.0017409311,0.00013078436,0.0000066852404],"category_scores_gemma":[0.000048936465,0.00016267496,0.00008813936,0.0012048935,0.00012752632,0.00020417862,0.00002935913,0.0005188507,0.000026408943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001657398,0.00047106814,0.00019533066,0.000018339986,0.000058831134,0.0000018718109,0.0003573274,0.030805195,0.012958267,0.23798817,0.00013212525,0.7169969],"study_design_scores_gemma":[0.0012468161,0.00013194916,0.00011395289,0.00010234785,0.000014362442,0.00001637388,0.000051203424,0.9472263,0.022155685,0.004572826,0.024063224,0.00030498212],"about_ca_topic_score_codex":0.0000061799415,"about_ca_topic_score_gemma":0.0002496346,"teacher_disagreement_score":0.9395289,"about_ca_system_score_codex":0.0001191516,"about_ca_system_score_gemma":0.000029317283,"threshold_uncertainty_score":0.66336924},"labels":[],"label_agreement":null},{"id":"W2037867468","doi":"10.1109/twc.2014.2320514","title":"Cooperative Positive Orthogonal Code-Based Forwarding for Multi-Hop Vehicular Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Network packet; Packet forwarding; Relay; Hop (telecommunications); Broadcast radiation; Retransmission; Vehicular ad hoc network; Wireless; Antenna diversity; Wireless ad hoc network; Telecommunications","score_opus":0.05353259411404256,"score_gpt":0.3052209553152469,"score_spread":0.25168836120120436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037867468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009197526,0.00022682741,0.9930651,0.0039018716,0.00029414424,0.0008317772,0.00005439606,0.00035537823,0.0003507363],"genre_scores_gemma":[0.8916767,0.00050653087,0.105405316,0.0013853271,0.000032752792,0.0007382832,0.000058105754,0.00003801309,0.00015894834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754155,0.0007986029,0.00050275394,0.00050851743,0.0002303217,0.00041823887],"domain_scores_gemma":[0.9942235,0.0016967789,0.0001820423,0.0029905022,0.0007261208,0.00018108492],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00071003794,0.00032472625,0.00036517886,0.00023236769,0.002311838,0.00026351123,0.0026908868,0.00015389154,0.000014366936],"category_scores_gemma":[0.000033528522,0.00033647363,0.00027897768,0.0008353925,0.00025875098,0.00044422963,0.00004165769,0.0006501396,0.000025938887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070620394,0.0013242197,0.000034793266,0.000017948827,0.00022938648,7.799019e-7,0.0010921073,0.56615,0.002263251,0.15945055,0.00034876537,0.2690176],"study_design_scores_gemma":[0.001344749,0.00016560058,0.000108666914,0.00011577427,0.000038566413,0.0000034083077,0.000038034283,0.98935044,0.004119174,0.000068929774,0.004261964,0.00038468084],"about_ca_topic_score_codex":0.0000075235253,"about_ca_topic_score_gemma":0.00041926984,"teacher_disagreement_score":0.89075696,"about_ca_system_score_codex":0.0001543931,"about_ca_system_score_gemma":0.00015187883,"threshold_uncertainty_score":0.99990875},"labels":[],"label_agreement":null},{"id":"W2037978136","doi":"10.1049/iet-com.2014.0211","title":"Performance of the generalised quantise‐and‐forward scheme over the multiple‐access relay channel","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Relay channel; Channel state information; Computer science; Channel (broadcasting); Gaussian; Additive white Gaussian noise; Scheme (mathematics); Computer network; Topology (electrical circuits); Algorithm; Telecommunications; Wireless; Mathematics","score_opus":0.06539029703534567,"score_gpt":0.3046555757762541,"score_spread":0.23926527874090842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037978136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8940843,0.003011719,0.04593717,0.047369167,0.0004348596,0.00081317365,0.0000078355415,0.0001952328,0.0081465775],"genre_scores_gemma":[0.98883325,0.0037083556,0.0061890967,0.0010242735,0.000023624456,0.00006262465,0.000003762071,0.000008283372,0.00014674845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987236,0.00050433347,0.0002814264,0.00016074211,0.00017465,0.00015523456],"domain_scores_gemma":[0.99441487,0.00059813453,0.0001919499,0.0045832517,0.0001695228,0.000042265645],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00063839724,0.000112159054,0.00013400138,0.00004354144,0.0010036608,0.00013459321,0.0063557145,0.000041699193,0.0000065483723],"category_scores_gemma":[0.00017031188,0.0000699754,0.00006926092,0.0005542524,0.0003299696,0.00037481086,0.0036738976,0.00029744976,0.000007093892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020965303,0.00042623753,0.12764367,0.00006305764,0.00016526916,1.0408005e-7,0.01020198,0.0043901294,0.008198429,0.7660836,0.010134718,0.07267187],"study_design_scores_gemma":[0.00025524542,0.00001684972,0.1217353,0.000049275204,0.0000069691037,0.0000021728133,0.000015656302,0.84885776,0.00047901215,0.00018797528,0.028288221,0.000105567815],"about_ca_topic_score_codex":0.00003270732,"about_ca_topic_score_gemma":0.00020879493,"teacher_disagreement_score":0.84446764,"about_ca_system_score_codex":0.000018586645,"about_ca_system_score_gemma":0.00004122061,"threshold_uncertainty_score":0.9990204},"labels":[],"label_agreement":null},{"id":"W2038249768","doi":"10.1109/glocom.2011.6134121","title":"Two-Way Amplify-and-Forward MIMO Relay Networks with Antenna Selection","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Computer science; Selection (genetic algorithm); Diversity gain; Outage probability; Antenna (radio); Monte Carlo method; Antenna diversity; Telecommunications; Mathematics; Fading; Decoding methods; Statistics; Power (physics); Beamforming","score_opus":0.038036398972084405,"score_gpt":0.24915245263457744,"score_spread":0.21111605366249303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038249768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004256969,0.00036769517,0.9677304,0.00028412265,0.0000880703,0.00011800885,8.386263e-8,0.0002491669,0.026905494],"genre_scores_gemma":[0.91362643,0.0005508693,0.084083416,0.0006545324,0.00003913509,0.000014115429,0.0000011395259,0.0000084506755,0.0010218883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916244,0.00009873906,0.00014734945,0.0002757524,0.00009923877,0.00021646077],"domain_scores_gemma":[0.9992484,0.000055266002,0.00005589896,0.00043025613,0.00011563243,0.00009454489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025455208,0.00012106218,0.00011859933,0.00006313543,0.0002499512,0.00010214769,0.00044753362,0.000041798525,0.00008784681],"category_scores_gemma":[0.000008695822,0.000089141846,0.000021496517,0.00046007783,0.000052112788,0.0003758207,0.00024315728,0.00020627085,0.000023064225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007990005,0.00017470066,0.023611438,0.000007498786,0.000106850675,0.000009835219,0.0034480295,0.0008370528,0.00064457057,0.7569874,0.002496916,0.21159583],"study_design_scores_gemma":[0.00075186224,0.000313629,0.019557036,0.000045229703,0.000012985301,0.00008981716,0.00007150903,0.96979386,0.0004014827,0.00040782974,0.008141858,0.00041293024],"about_ca_topic_score_codex":0.00003614385,"about_ca_topic_score_gemma":0.0003197079,"teacher_disagreement_score":0.96895677,"about_ca_system_score_codex":0.000020062338,"about_ca_system_score_gemma":0.000021293166,"threshold_uncertainty_score":0.3635099},"labels":[],"label_agreement":null},{"id":"W2038386869","doi":"10.1109/tcomm.2013.041113.120480","title":"Joint Optimization of Source Power Allocation and Cooperative Beamforming for SC-FDMA Multi-User Multi-Relay Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Beamforming; Relay; Joint (building); Optimization problem; Computer science; Mathematical optimization; Power (physics); Interference (communication); Signal-to-noise ratio (imaging); Convex optimization; Noise (video); Electronic engineering; Telecommunications; Mathematics; Algorithm; Regular polygon; Engineering; Channel (broadcasting)","score_opus":0.05336404005613694,"score_gpt":0.2852314857243695,"score_spread":0.23186744566823259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038386869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005719984,0.00049656205,0.9949596,0.0023339407,0.00015356182,0.0011862472,0.000008656365,0.00015658476,0.0001328833],"genre_scores_gemma":[0.59552246,0.001656547,0.40142703,0.00024382357,0.0000064883807,0.00050979375,0.000015308346,0.00002110934,0.00059745857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984307,0.00028538832,0.0005685034,0.00032983746,0.00013965934,0.00024587018],"domain_scores_gemma":[0.99641705,0.00052281405,0.00023442962,0.0019173328,0.00079030887,0.00011806708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037309952,0.00022498086,0.00026269053,0.00022591282,0.0010604362,0.00017572536,0.0011489829,0.00012493359,0.000040766416],"category_scores_gemma":[0.000039395058,0.00022639801,0.0001081302,0.000585224,0.00022725966,0.00086444925,0.000052993957,0.00029197396,0.0000118278795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068161526,0.0005117312,0.000015487953,0.000008203308,0.00006984575,2.846373e-8,0.0021378575,0.963082,0.0016832857,0.0047538565,0.0001315504,0.027599327],"study_design_scores_gemma":[0.0008698568,0.000110131725,0.00017791998,0.00008349139,0.000023521352,0.0000034181153,0.00021219753,0.99464005,0.0022243387,0.000013331691,0.0014078474,0.00023387726],"about_ca_topic_score_codex":0.00004138394,"about_ca_topic_score_gemma":0.00013909284,"teacher_disagreement_score":0.59495044,"about_ca_system_score_codex":0.00008018738,"about_ca_system_score_gemma":0.000071478695,"threshold_uncertainty_score":0.92322433},"labels":[],"label_agreement":null},{"id":"W2038755171","doi":"10.1109/glocom.2012.6503774","title":"Efficient concurrent transmission scheduling for cooperative millimeter wave systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Computer network; Relay; Transmission (telecommunications); Node (physics); Distributed computing; Telecommunications; Engineering","score_opus":0.07975924047305645,"score_gpt":0.3061329077577279,"score_spread":0.22637366728467145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038755171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049819816,0.00468499,0.9868089,0.00050119456,0.00075421843,0.0005201126,0.0000014363154,0.00011882002,0.0016283365],"genre_scores_gemma":[0.95827395,0.00010837128,0.040760774,0.00023414912,0.00010529225,0.00008636803,0.0000047908575,0.00000806021,0.00041826605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892664,0.0001404216,0.0002445274,0.0002114222,0.00014843073,0.00032854886],"domain_scores_gemma":[0.9989735,0.00023377179,0.00005289403,0.00036294886,0.00021293922,0.00016393854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000529249,0.0001362757,0.00016269954,0.000059281763,0.00030483163,0.00013858256,0.0003718216,0.000043259857,0.000030147383],"category_scores_gemma":[0.000027047703,0.000101592435,0.00007045081,0.00022620452,0.000027612716,0.00016713959,0.00013168255,0.00010086171,0.00002985168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011417634,0.0003417926,0.00006586606,0.000048014805,0.000056706318,4.5815878e-7,0.0050942004,0.017951969,0.010306661,0.748872,0.001614618,0.21563633],"study_design_scores_gemma":[0.00037427558,0.000049687053,0.000050045644,0.000052239408,0.0000055379223,0.000004523317,0.00007739254,0.9574994,0.0047138087,0.000009059236,0.036993604,0.00017044626],"about_ca_topic_score_codex":0.0000011597374,"about_ca_topic_score_gemma":4.1149548e-7,"teacher_disagreement_score":0.95329195,"about_ca_system_score_codex":0.000051411324,"about_ca_system_score_gemma":0.000034613382,"threshold_uncertainty_score":0.41428193},"labels":[],"label_agreement":null},{"id":"W2038850055","doi":"10.1109/vtcfall.2012.6399148","title":"The GTCF Method for Exact Analysis of Multihop AF Relaying Systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Independent and identically distributed random variables; Fading; Signal-to-noise ratio (imaging); Computer science; Probability density function; Topology (electrical circuits); Channel (broadcasting); Function (biology); Mathematics; Algorithm; Telecommunications; Statistics; Random variable; Combinatorics","score_opus":0.08277812313934459,"score_gpt":0.3660802633527624,"score_spread":0.2833021402134178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038850055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010957201,0.002026394,0.9933466,0.00040546182,0.00019738855,0.00015833777,6.7587575e-7,0.000042100848,0.0027273267],"genre_scores_gemma":[0.8705879,0.00021807125,0.12831618,0.000074218384,0.00002956405,0.000036427347,0.0000013629013,0.0000032865612,0.0007329995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991195,0.00025756544,0.00022818283,0.00010813847,0.00010840421,0.00017818515],"domain_scores_gemma":[0.9973609,0.0016081514,0.000108242966,0.0007270714,0.00014806206,0.000047574005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018475017,0.00006209558,0.00015931723,0.00009282574,0.0002793357,0.00008487368,0.0007259656,0.000023573739,0.000006543176],"category_scores_gemma":[0.00012659853,0.000038247006,0.00011644764,0.0008387547,0.000013712237,0.00022049824,0.00021275,0.000053552165,0.0000030812112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006023454,0.000054262462,0.0028118116,0.000009739082,0.0006440665,4.802078e-8,0.0023065466,0.0046618106,0.0019795673,0.8083841,0.0013405712,0.17780142],"study_design_scores_gemma":[0.00008379465,0.000009180364,0.0016477153,0.000005330387,0.000064305044,4.2131632e-7,0.00013696449,0.9706172,0.00052512385,0.000021281729,0.026827596,0.00006108726],"about_ca_topic_score_codex":0.000019610421,"about_ca_topic_score_gemma":0.000037508365,"teacher_disagreement_score":0.9659554,"about_ca_system_score_codex":0.000021545291,"about_ca_system_score_gemma":0.000013096423,"threshold_uncertainty_score":0.21484527},"labels":[],"label_agreement":null},{"id":"W2039352782","doi":"10.1109/glocom.2012.6503099","title":"Restricted Isometry Property in Quantized Network Coding of sparse messages","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Restricted isometry property; Decoding methods; Linear network coding; Gaussian; Coding (social sciences); Computer science; Matrix (chemical analysis); Algorithm; Isometry (Riemannian geometry); Distributed source coding; Compressed sensing; Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Network packet; Statistics; Channel code; Computer network; Pure mathematics; Physics","score_opus":0.07429603133602543,"score_gpt":0.2992042671444371,"score_spread":0.22490823580841168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039352782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19521078,0.009144269,0.69552845,0.003235245,0.0010492982,0.0008741034,8.783861e-7,0.0005070779,0.09444993],"genre_scores_gemma":[0.9687797,0.0011480093,0.02910241,0.0001848577,0.000048471793,0.000009173051,0.0000010950386,0.000005262644,0.0007210163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988199,0.00026093534,0.00030943024,0.00014853789,0.0001497684,0.000311447],"domain_scores_gemma":[0.99895406,0.00022156344,0.00009331093,0.00058542966,0.00007552231,0.00007012809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064319914,0.000096071,0.00019781833,0.000139897,0.000079748424,0.000037502097,0.00072348426,0.00004365413,0.000064046144],"category_scores_gemma":[0.00011982792,0.000064681044,0.00003593297,0.0016003037,0.00003386291,0.00048771905,0.0004570731,0.00014725949,0.000016196436],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042757805,0.00057210616,0.22390123,0.000039341718,0.000045480563,0.0000037444618,0.0025225894,0.000774355,0.011160704,0.62905115,0.01831235,0.11357418],"study_design_scores_gemma":[0.0034053398,0.00020344798,0.5253752,0.0006286451,0.000019091776,0.000019238318,0.00032190475,0.3937284,0.01258859,0.0010055733,0.06150647,0.0011980794],"about_ca_topic_score_codex":0.000022373517,"about_ca_topic_score_gemma":0.00003906756,"teacher_disagreement_score":0.7735689,"about_ca_system_score_codex":0.000027975168,"about_ca_system_score_gemma":0.000033980257,"threshold_uncertainty_score":0.26376164},"labels":[],"label_agreement":null},{"id":"W2039501150","doi":"10.1049/iet-com.2013.1000","title":"Performance analysis of relay‐multiplexing scheme in cellular systems employing massive multiple‐input multiple‐output antennas","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"King Saud University","keywords":"Computer science; Relay; Multiplexing; Scheme (mathematics); Electronic engineering; Telecommunications; Mathematics; Physics; Engineering","score_opus":0.06292105140103584,"score_gpt":0.28198273781289385,"score_spread":0.21906168641185803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039501150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53610605,0.0029296563,0.45534998,0.0016415485,0.00023986353,0.00070199464,0.000017525275,0.0003208716,0.002692477],"genre_scores_gemma":[0.9463572,0.0016572004,0.051558338,0.00009252035,0.000020968277,0.00011772397,0.000077408105,0.000020604597,0.000098031225],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694836,0.0009318744,0.0009564186,0.00044170365,0.0003290241,0.00039262488],"domain_scores_gemma":[0.9918297,0.0018688947,0.00048669393,0.005217286,0.00047971067,0.00011769415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013478311,0.00025804463,0.00059348205,0.0008457566,0.000568502,0.00015384537,0.0043558483,0.00012107561,0.0000051808174],"category_scores_gemma":[0.0006691564,0.00027051973,0.00020413054,0.0033051786,0.00021959316,0.00060364715,0.0018694517,0.0005335723,0.000022033164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026087879,0.00068260863,0.70593214,0.000101598715,0.0007735081,0.0000022937809,0.010598818,0.17979474,0.032502204,0.04249066,0.00014522085,0.026950134],"study_design_scores_gemma":[0.0005374982,0.00003039076,0.06578793,0.00018408241,0.00005009003,0.0000010048669,0.00019395172,0.92962354,0.00037437587,0.000010468402,0.002940577,0.0002661195],"about_ca_topic_score_codex":0.00016285818,"about_ca_topic_score_gemma":0.00066261174,"teacher_disagreement_score":0.74982876,"about_ca_system_score_codex":0.0001369281,"about_ca_system_score_gemma":0.00007002282,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W2039538491","doi":"10.1007/s11277-013-1034-y","title":"A Low-Complexity Hybrid Framework for Combining-Type Non-regenerative MIMO Relaying","year":2013,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Relay; Channel (broadcasting); MIMO; Algorithm; Parametric statistics; Decoding methods; Matrix (chemical analysis); Computational complexity theory; Topology (electrical circuits); Telecommunications; Mathematics","score_opus":0.09812330649789267,"score_gpt":0.33027850818480986,"score_spread":0.2321552016869172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039538491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09162938,0.0014538184,0.8815559,0.019952893,0.00038162817,0.001327051,0.00002123311,0.00038629497,0.0032918088],"genre_scores_gemma":[0.7881278,0.0006328115,0.20910557,0.0012451209,0.00006234089,0.0004838329,0.00008191734,0.000025208705,0.00023540604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980539,0.00035323808,0.00044545243,0.00045392007,0.0002527981,0.00044066],"domain_scores_gemma":[0.99449855,0.0012636286,0.00022967687,0.002951218,0.00086607615,0.00019086288],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00035204503,0.00027827482,0.00033427973,0.00012990771,0.0018866784,0.00045433725,0.004138903,0.000097622884,0.00009254512],"category_scores_gemma":[0.00020356037,0.00028605966,0.00016148011,0.0006974709,0.00039435062,0.00071163237,0.0015725261,0.00066409167,0.0002003347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011302773,0.00037154957,0.00027883466,0.000027047343,0.00006893579,6.501435e-7,0.0061613442,0.00003234145,0.0049104583,0.9463722,0.0063850605,0.03538029],"study_design_scores_gemma":[0.0007904067,0.00018926592,0.003108961,0.00031669147,0.000022510316,0.000017191427,0.00068417884,0.9476355,0.0024468128,0.037170265,0.0068484675,0.0007697617],"about_ca_topic_score_codex":0.00004914565,"about_ca_topic_score_gemma":0.00006932369,"teacher_disagreement_score":0.94760317,"about_ca_system_score_codex":0.00012733787,"about_ca_system_score_gemma":0.00021624855,"threshold_uncertainty_score":0.9999592},"labels":[],"label_agreement":null},{"id":"W2039659962","doi":"10.1049/iet-com.2012.0709","title":"Adaptive relaying scheme for cognitive radio networks","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Scheme (mathematics); Computer network; Telecommunications; Wireless; Mathematics","score_opus":0.084550904026496,"score_gpt":0.31188503188884326,"score_spread":0.22733412786234725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039659962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006190915,0.0037234277,0.97397304,0.0072754733,0.000119321565,0.00093590876,0.0000041593494,0.00027887756,0.013070719],"genre_scores_gemma":[0.7838096,0.0017738292,0.2121522,0.0007731544,0.00004479585,0.00092895684,0.000037880814,0.00001577518,0.00046380982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876094,0.0002744553,0.00030779166,0.00026817454,0.00009390868,0.0002947256],"domain_scores_gemma":[0.99524313,0.0014058615,0.00014279758,0.002466826,0.00062867877,0.00011268639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035045174,0.00015546067,0.00017618285,0.00008757702,0.0009839374,0.00025792053,0.00301545,0.0000750223,0.0000481221],"category_scores_gemma":[0.00017776791,0.00015980015,0.00010180792,0.0005527516,0.00016513107,0.00075742125,0.0013291888,0.00034996757,0.0001254887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010070234,0.0002704481,0.0005479068,0.000005871591,0.00014852479,2.552122e-7,0.0025815072,0.00032556587,0.00047865335,0.70378196,0.027498813,0.26435044],"study_design_scores_gemma":[0.0005356577,0.00006755125,0.002097475,0.00008232745,0.000012071609,0.0000048421803,0.00026459823,0.9695414,0.000055975164,0.0030925274,0.023964431,0.00028117764],"about_ca_topic_score_codex":0.000016826727,"about_ca_topic_score_gemma":0.00003932434,"teacher_disagreement_score":0.9692158,"about_ca_system_score_codex":0.0000625168,"about_ca_system_score_gemma":0.00006830738,"threshold_uncertainty_score":0.7567751},"labels":[],"label_agreement":null},{"id":"W2040032009","doi":"10.1109/tvt.2013.2240024","title":"Diversity Analysis of Relay Assignment in Cooperative Networks Based on Sum-Rate Criterion","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Rayleigh fading; Permutation (music); Fading; Function (biology); Computer science; Diversity combining; Algorithm; Mathematics; Order (exchange); Probability density function; Topology (electrical circuits); Discrete mathematics; Combinatorics; Statistics; Decoding methods","score_opus":0.01844009649985587,"score_gpt":0.24413777532269687,"score_spread":0.225697678822841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040032009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13051334,0.000046454425,0.86662114,0.0022769086,0.00009655806,0.00024851173,0.0000021007984,0.00012086132,0.00007415805],"genre_scores_gemma":[0.99788916,0.00016940424,0.0013905092,0.0004201088,0.0000025415925,0.00007826003,0.0000026611276,0.0000059906015,0.0000413648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866617,0.0003036746,0.00028349628,0.000367297,0.00016045003,0.00021892418],"domain_scores_gemma":[0.9986543,0.00016199549,0.000091110014,0.0008726839,0.00017445884,0.000045453715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028603105,0.00015808633,0.00031026138,0.0012146294,0.00041606676,0.000029140685,0.00073207036,0.00019039627,0.000101053956],"category_scores_gemma":[0.000010041,0.00015054352,0.00012383128,0.0033488492,0.00011938363,0.00017864037,0.000037402024,0.00046049044,0.000016378419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011242471,0.0002795932,0.00055711926,0.0000017794911,0.0001251232,0.0000048601946,0.0001436743,0.979945,0.0017370068,0.0013905568,0.000023697141,0.01578032],"study_design_scores_gemma":[0.00037912972,0.0002202844,0.0033550947,0.000035423767,0.00005675799,5.0236974e-7,0.00003310764,0.98677546,0.008885483,0.000039455455,0.000072402894,0.00014688275],"about_ca_topic_score_codex":0.000040893523,"about_ca_topic_score_gemma":0.00021442847,"teacher_disagreement_score":0.86737585,"about_ca_system_score_codex":0.00014067831,"about_ca_system_score_gemma":0.000027015565,"threshold_uncertainty_score":0.6138987},"labels":[],"label_agreement":null},{"id":"W2040483094","doi":"10.1109/tcomm.2010.062310.090065","title":"Selective Cooperative Relaying over Time-Varying Channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Relay channel; Fading; Bandwidth (computing); Computer science; Computer network; Electronic engineering; Power (physics); Channel (broadcasting); Engineering; Physics","score_opus":0.03669912004018087,"score_gpt":0.2961604010098597,"score_spread":0.2594612809696788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040483094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034852247,0.00015302205,0.97136736,0.0046551856,0.00075886166,0.0004763321,0.000011605794,0.00058347464,0.01850895],"genre_scores_gemma":[0.9701575,0.00065284054,0.026574794,0.0007119966,0.000039101225,0.00022555598,0.000007466679,0.00002615696,0.001604593],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832356,0.00038082062,0.00036156276,0.0003953105,0.00022668921,0.0003120499],"domain_scores_gemma":[0.9950467,0.0007827065,0.00011742868,0.0035378786,0.00036734337,0.00014794759],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00040813105,0.00023966706,0.0002212243,0.00026871366,0.0020290522,0.0002941668,0.0028989457,0.00012926472,0.00022443707],"category_scores_gemma":[0.000033938893,0.00024924034,0.00012917514,0.0012494237,0.00020913717,0.000823312,0.000057532416,0.0014623353,0.00042725986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007361042,0.0032923145,0.000077054785,0.000021560234,0.0006198681,0.0000061478845,0.019537086,0.029987652,0.38204306,0.20209587,0.007067032,0.35517874],"study_design_scores_gemma":[0.0011479743,0.00019590845,0.000275378,0.00010765199,0.00004076702,0.000038265156,0.000058120633,0.9195372,0.05095714,0.00127394,0.025454924,0.0009127297],"about_ca_topic_score_codex":0.000015633423,"about_ca_topic_score_gemma":0.00014898436,"teacher_disagreement_score":0.96667224,"about_ca_system_score_codex":0.000088624474,"about_ca_system_score_gemma":0.0001533881,"threshold_uncertainty_score":0.999996},"labels":[],"label_agreement":null},{"id":"W2040597926","doi":"10.1049/iet-com.2009.0517","title":"Decorrelate-and-forward relaying scheme for multiuser wireless code division multiple access networks","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Beamforming; Relay; Rayleigh fading; Code division multiple access; Wireless; Fading; Wireless network; Computer network; Signal-to-noise ratio (imaging); Maximal-ratio combining; Telecommunications; Power (physics); Channel (broadcasting)","score_opus":0.06390249652713585,"score_gpt":0.34557600523625115,"score_spread":0.2816735087091153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040597926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04554379,0.0009432954,0.94571555,0.005408608,0.00046113663,0.00066033343,0.000009224351,0.000350119,0.0009079431],"genre_scores_gemma":[0.8429802,0.0021957904,0.15394223,0.00040861245,0.000036307883,0.00025615256,0.000045701952,0.000023542654,0.00011144534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985727,0.00017872128,0.00041475205,0.00037949963,0.00012358294,0.00033071512],"domain_scores_gemma":[0.9937515,0.0017450983,0.00019097948,0.003813225,0.00033537752,0.000163788],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000713277,0.0002018522,0.00022603998,0.00011554923,0.0015061053,0.0005066044,0.004900737,0.00015853524,0.000011556291],"category_scores_gemma":[0.00032485445,0.00020060713,0.000098248354,0.0004791701,0.00019649247,0.00094643695,0.0038650732,0.000801565,0.00001461539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030034736,0.00057077204,0.067082316,0.000031155778,0.00013564216,8.203305e-7,0.0030294734,0.001948909,0.01147368,0.39946383,0.0059409784,0.5102924],"study_design_scores_gemma":[0.00061548076,0.000019225074,0.007831016,0.000045233428,0.00000911058,0.0000038730677,0.000022649156,0.9375901,0.0001739481,0.0006548679,0.052778676,0.00025577555],"about_ca_topic_score_codex":0.000022296603,"about_ca_topic_score_gemma":0.001321335,"teacher_disagreement_score":0.9356412,"about_ca_system_score_codex":0.000030700598,"about_ca_system_score_gemma":0.000055634795,"threshold_uncertainty_score":0.9997938},"labels":[],"label_agreement":null},{"id":"W2040617340","doi":"10.1109/ahici.2011.6113937","title":"Optimal and suboptimal relay selection and power allocation in multi-relay cooperative network","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Transmitter power output; Selection (genetic algorithm); Power (physics); Mathematical optimization; Computer network; Mathematics; Transmitter","score_opus":0.04872551427326554,"score_gpt":0.27096273196250503,"score_spread":0.22223721768923949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040617340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3030612,0.0008487221,0.6926322,0.00036997502,0.000096284035,0.0002528745,1.731447e-7,0.00011072008,0.002627843],"genre_scores_gemma":[0.8046342,0.0005214664,0.19429721,0.0002082453,0.0000111018135,0.000018189294,0.0000011862816,0.000005850608,0.00030251383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990115,0.00017746048,0.0002075589,0.0003213905,0.00007549985,0.00020655297],"domain_scores_gemma":[0.9994639,0.0000689195,0.00004971914,0.00022385297,0.00011974864,0.00007383985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041109213,0.00012815012,0.00012932942,0.00007841155,0.0002026273,0.000097466094,0.00022445957,0.00006682175,0.00005540117],"category_scores_gemma":[0.000031089556,0.00011595282,0.000013562931,0.00044933075,0.000056809353,0.00057529245,0.0002742205,0.00019565575,0.000009258452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002366463,0.0008977888,0.12344521,0.00001844354,0.00014465145,0.000021907303,0.05732068,0.08854848,0.00489389,0.63785124,0.0030290624,0.08359203],"study_design_scores_gemma":[0.0006381763,0.00017542188,0.095235094,0.000026105365,0.0000032500607,0.00002014246,0.0000937147,0.90244436,0.00048644815,0.000025955605,0.00062972656,0.0002215718],"about_ca_topic_score_codex":0.000030770414,"about_ca_topic_score_gemma":0.0004936933,"teacher_disagreement_score":0.81389594,"about_ca_system_score_codex":0.00003252354,"about_ca_system_score_gemma":0.000033930854,"threshold_uncertainty_score":0.4728419},"labels":[],"label_agreement":null},{"id":"W2040698088","doi":"10.1109/chinasip.2013.6625406","title":"Optimal design of distributed concatenated Alamouti codes for relay networks using uniquely-factorable QAM constellations","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Space–time block code; Quadrature amplitude modulation; Node (physics); Relay; Topology (electrical circuits); Algorithm; Computer science; Additive white Gaussian noise; QAM; Detector; Block code; Mathematics; Bit error rate; Telecommunications; Channel (broadcasting); Decoding methods; Power (physics); Combinatorics; Physics","score_opus":0.07967954121721467,"score_gpt":0.29510126020566363,"score_spread":0.21542171898844897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040698088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007566571,0.00023437859,0.9902917,0.0004583292,0.00008747312,0.000764588,0.0000066844755,0.00015063563,0.0004396282],"genre_scores_gemma":[0.7530669,0.00008836914,0.24653001,0.00008696192,0.000008359074,0.000028209417,0.00002958646,0.000007937819,0.00015368973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988036,0.00021420942,0.00038340015,0.0002307267,0.00009950847,0.00026853182],"domain_scores_gemma":[0.9978717,0.00074694457,0.0001699129,0.0005217362,0.00059899525,0.00009069751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034607275,0.00013985223,0.00023140988,0.00006770638,0.00028075703,0.00015793591,0.0006231495,0.00008605651,0.00013350966],"category_scores_gemma":[0.000078355915,0.00012534433,0.00005939304,0.000513666,0.00011508813,0.0004538569,0.00021360221,0.00011661654,0.000005580199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008816863,0.00006273229,0.00050496875,0.000006323196,0.00005373473,2.993065e-7,0.00015086312,0.91688466,0.0071737636,0.06810323,0.004684626,0.002365993],"study_design_scores_gemma":[0.0003498814,0.000046204295,0.00025540215,0.000027888736,0.0000098624205,0.0000030553465,0.0000360027,0.9937874,0.0045658653,0.0002277855,0.00053179084,0.00015882429],"about_ca_topic_score_codex":0.000030016094,"about_ca_topic_score_gemma":0.000005328823,"teacher_disagreement_score":0.7455003,"about_ca_system_score_codex":0.000056258767,"about_ca_system_score_gemma":0.000104066086,"threshold_uncertainty_score":0.51113933},"labels":[],"label_agreement":null},{"id":"W2040783219","doi":"10.1109/glocom.2006.854","title":"WLC41-2: Adaptive Regenerate and Forward Cooperative Diversity System based on Quadrature Signaling","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Power consumption; Computer science; Quadrature (astronomy); Cooperative diversity; Signal-to-noise ratio (imaging); Upper and lower bounds; Channel (broadcasting); Control theory (sociology); Power (physics); Topology (electrical circuits); Mathematical optimization; Electronic engineering; Telecommunications; Mathematics; Engineering; Fading; Physics; Artificial intelligence","score_opus":0.021268076425171145,"score_gpt":0.22222829303427608,"score_spread":0.20096021660910493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040783219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059618264,0.0014976279,0.90737915,0.0031237379,0.00050775765,0.00043774568,0.000029892528,0.0005621144,0.026843728],"genre_scores_gemma":[0.99137956,0.000016777649,0.00756009,0.0005662924,0.00007937821,0.000008919493,0.000011596868,0.0000066675507,0.0003706942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875,0.00026918136,0.000172391,0.0003813916,0.00020834884,0.00021871127],"domain_scores_gemma":[0.99902225,0.00012575551,0.00008860381,0.00049010804,0.00019363068,0.00007965698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027970248,0.00018007013,0.00019572211,0.0001004609,0.0008943944,0.00020659185,0.000556245,0.000069635586,0.000012978873],"category_scores_gemma":[0.0000116957235,0.00016130194,0.000052314368,0.00047249167,0.000050116414,0.00024757654,0.00056453596,0.00019627303,0.00001802088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121805846,0.00019302304,0.0030824384,0.000033060423,0.0000598622,0.000068688,0.0012685547,0.048660725,0.0015433518,0.90160614,0.019659558,0.023702767],"study_design_scores_gemma":[0.0009826792,0.00022141727,0.0043623433,0.000170037,0.000015284822,0.000007857028,0.00013479669,0.9861137,0.002983014,0.00023171355,0.004335185,0.00044194114],"about_ca_topic_score_codex":0.000054753207,"about_ca_topic_score_gemma":0.00013847345,"teacher_disagreement_score":0.93745303,"about_ca_system_score_codex":0.00012881831,"about_ca_system_score_gemma":0.000043768276,"threshold_uncertainty_score":0.6879049},"labels":[],"label_agreement":null},{"id":"W2041049806","doi":"10.1109/camsap.2011.6135973","title":"On the design and performance of TDBC-based bi-directional network beamforming","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Beamforming; Quality of service; Channel (broadcasting); Relay; Constraint (computer-aided design); Power control; Power (physics); Computer network; Telecommunications; Engineering","score_opus":0.08845424200780025,"score_gpt":0.24351671555798013,"score_spread":0.15506247355017988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041049806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044585638,0.0001139628,0.9437898,0.00035323936,0.000083501574,0.000121821315,6.248429e-8,0.00005362479,0.010898367],"genre_scores_gemma":[0.8799009,0.000096327814,0.11924925,0.000608585,0.000013713966,0.000010291618,1.5852672e-7,0.0000023849436,0.00011843019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950606,0.00009551121,0.000107602384,0.00010189051,0.000088772256,0.000100170364],"domain_scores_gemma":[0.99918926,0.0003767884,0.000045475554,0.0003098789,0.00005486,0.000023721364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077645,0.000058442012,0.000060669277,0.000029069539,0.00022851025,0.000020116646,0.00037966267,0.00001616105,0.00008382166],"category_scores_gemma":[0.000018132125,0.0000365734,0.000017220746,0.00023816779,0.000049075836,0.00011660073,0.000106691245,0.00007536528,0.000006227926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074771706,0.00009903026,0.0039075776,0.000008432753,0.000025731328,4.3128065e-7,0.0010874256,0.012447316,0.00039006872,0.8596313,0.003955531,0.118372366],"study_design_scores_gemma":[0.00012118143,0.00019885878,0.005986509,0.00004117003,0.0000018675929,0.0000018688526,0.000006152322,0.9844013,0.007211349,0.0011366119,0.00080912083,0.00008405081],"about_ca_topic_score_codex":0.000002180915,"about_ca_topic_score_gemma":0.0000028269692,"teacher_disagreement_score":0.9719539,"about_ca_system_score_codex":0.00000806274,"about_ca_system_score_gemma":0.000030055831,"threshold_uncertainty_score":0.17575392},"labels":[],"label_agreement":null},{"id":"W2041176458","doi":"10.1109/lcomm.2012.050912.120103","title":"Two-Way Amplify-and-Forward Relaying with Gaussian Imperfect Channel Estimations","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Computer science; Channel (broadcasting); Gaussian; Reliability (semiconductor); Upper and lower bounds; Signal-to-noise ratio (imaging); Bounded function; Imperfect; Probability density function; Selection (genetic algorithm); Topology (electrical circuits); Algorithm; Telecommunications; Mathematics; Statistics; Power (physics)","score_opus":0.04853330916029852,"score_gpt":0.29870221642690065,"score_spread":0.2501689072666021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041176458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04001729,0.0027798205,0.8985759,0.05031246,0.00029268584,0.00051306793,0.00000535514,0.0005061912,0.006997243],"genre_scores_gemma":[0.8910787,0.0007789617,0.10475713,0.003095122,0.000060833827,0.00014461111,0.000018362503,0.00002072936,0.000045519686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845433,0.00039562793,0.00029427386,0.00024699792,0.00018752179,0.00042126907],"domain_scores_gemma":[0.9957947,0.00047094407,0.00014835906,0.0032939704,0.00008744104,0.00020455093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059715676,0.00021267959,0.0001978436,0.0001971436,0.0011880053,0.0002419235,0.0021638344,0.000046925266,0.000008930217],"category_scores_gemma":[0.000043859804,0.00019006722,0.000050190145,0.00067419966,0.0002598898,0.0011552152,0.00075572636,0.00046963696,0.00008207504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031130614,0.0009205171,0.013789335,0.000065194276,0.0004868079,0.0000058082046,0.033920694,0.0046964865,0.047119487,0.74031615,0.017462775,0.14118563],"study_design_scores_gemma":[0.0070760907,0.00043948286,0.07417611,0.0011320871,0.00040131438,0.0009678986,0.0016775609,0.7475255,0.006896258,0.0017002563,0.15255122,0.0054561878],"about_ca_topic_score_codex":0.000026422746,"about_ca_topic_score_gemma":0.00005972704,"teacher_disagreement_score":0.85106146,"about_ca_system_score_codex":0.00008908175,"about_ca_system_score_gemma":0.00003517564,"threshold_uncertainty_score":0.91372967},"labels":[],"label_agreement":null},{"id":"W2041247631","doi":"10.1002/ett.2868","title":"Cooperative bargaining game‐theoretic methodology for 5G wireless heterogeneous networks","year":2014,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Game theory; Wireless network; Wireless; Cooperative game theory; Computer network; Mathematical economics; Economics; Telecommunications","score_opus":0.058346219076040574,"score_gpt":0.3195025051955383,"score_spread":0.2611562861194977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041247631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076669897,0.0008712493,0.9866475,0.007210983,0.0001629633,0.00052102597,0.0000030309145,0.0024676882,0.0013488508],"genre_scores_gemma":[0.7927848,0.003837004,0.20226106,0.00031183948,0.000012233922,0.00066844333,0.000010690433,0.000029446985,0.00008444916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975454,0.0007788897,0.00051423186,0.0005321511,0.00013548184,0.00049384596],"domain_scores_gemma":[0.9937932,0.0025198136,0.00019000788,0.003125963,0.00031492274,0.00005610235],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010813469,0.0003135959,0.00039744284,0.0004599224,0.0014088452,0.00015880373,0.003448262,0.00023098843,0.00002523858],"category_scores_gemma":[0.00031473796,0.00031343644,0.00017094622,0.0011672998,0.00040191933,0.00028315,0.000103624676,0.00073861104,0.000018645263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012176587,0.00012186736,0.000005610242,0.000006309441,0.00006989303,2.182629e-7,0.000517248,0.10813622,0.00045175312,0.33200383,0.000075472984,0.5585994],"study_design_scores_gemma":[0.00053137983,0.00032614218,0.00001701188,0.00007054531,0.000030854793,0.000017956774,0.00036237904,0.9561139,0.015277742,0.015444582,0.01132948,0.00047802855],"about_ca_topic_score_codex":0.000005161251,"about_ca_topic_score_gemma":0.000059605314,"teacher_disagreement_score":0.8479777,"about_ca_system_score_codex":0.00010574809,"about_ca_system_score_gemma":0.000050351668,"threshold_uncertainty_score":0.99993175},"labels":[],"label_agreement":null},{"id":"W2041253888","doi":"10.1145/2387238.2387296","title":"A reactive solution with a redundancy-based error correction mechanism for video dissemination over vehicular ad hoc networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Ottawa","funders":"","keywords":"Computer science; Computer network; Network packet; Vehicular ad hoc network; Wireless ad hoc network; Redundancy (engineering); Latency (audio); Packet loss; Overhead (engineering); Real-time computing; Wireless; Telecommunications","score_opus":0.02377544339730861,"score_gpt":0.28595026494265163,"score_spread":0.262174821545343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041253888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073556243,0.0003819406,0.9895733,0.000851094,0.0006092398,0.0005159989,7.105743e-7,0.00020777807,0.00050429924],"genre_scores_gemma":[0.9553187,0.000051667146,0.043280747,0.00052470336,0.0000867455,0.00023573045,0.0000231864,0.0000144728665,0.00046405435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895763,0.00011887236,0.00017287799,0.00026335128,0.000182119,0.00030516504],"domain_scores_gemma":[0.99873817,0.0002331553,0.00014348073,0.0004771649,0.00031276044,0.00009528031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044474177,0.00015107116,0.00013320275,0.00009057558,0.0003648785,0.000103499544,0.0002894012,0.0000678365,0.000018056448],"category_scores_gemma":[0.00007270104,0.00012588633,0.000061779014,0.0004255292,0.000027223226,0.0008548668,0.00008302664,0.00014411735,0.000005480083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067132676,0.0011662886,0.0009312742,0.000045140045,0.00018511212,0.0000027078963,0.00484296,0.00454842,0.03590203,0.50971264,0.026888484,0.41510364],"study_design_scores_gemma":[0.00045939325,0.00018408043,0.0012342371,0.000091936156,0.000017463963,0.0000064050296,0.000046306362,0.9880526,0.0057590627,0.00021662134,0.003718059,0.00021383991],"about_ca_topic_score_codex":0.0000035474359,"about_ca_topic_score_gemma":0.000082702674,"teacher_disagreement_score":0.9835042,"about_ca_system_score_codex":0.00017168457,"about_ca_system_score_gemma":0.000052692485,"threshold_uncertainty_score":0.5133496},"labels":[],"label_agreement":null},{"id":"W2041269601","doi":"10.1109/vetecf.2010.5594492","title":"Reliable Network Coded MAC in Vehicular Ad-Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Computer network; Wireless ad hoc network; Network packet; Node (physics); Coding (social sciences); Collision; Reliability (semiconductor); Vehicular ad hoc network; Repetition code; Random access; Decoding methods; Wireless; Computer security; Algorithm; Telecommunications; Block code; Engineering","score_opus":0.01762592602073842,"score_gpt":0.25415842778375125,"score_spread":0.23653250176301283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041269601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0383647,0.0059875925,0.8971391,0.0064682364,0.002483186,0.0005806259,2.992212e-7,0.0007599176,0.048216376],"genre_scores_gemma":[0.90837455,0.0029141076,0.08381893,0.0025001839,0.00018555408,0.000038263828,0.000005172576,0.000016016093,0.0021472133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987489,0.00009648672,0.00027360965,0.00032864683,0.00014617472,0.00040615592],"domain_scores_gemma":[0.9984766,0.00012780898,0.00005730435,0.0011407769,0.00009131654,0.00010618797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006962332,0.0001399703,0.00017407858,0.000060555813,0.00019557364,0.00017618877,0.0012906608,0.00010718177,0.00021232058],"category_scores_gemma":[0.000030673524,0.00012717962,0.000049418137,0.0008864998,0.00004286132,0.00031176323,0.0006085002,0.00060929795,0.00008279801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020137548,0.00016343681,0.007815119,0.0000056800322,0.000022610282,0.000030630265,0.0004447287,0.06393791,0.001456534,0.6261991,0.056214795,0.24368931],"study_design_scores_gemma":[0.0003070415,0.000022462857,0.00328935,0.000020374142,0.0000013311151,0.0000052245705,0.000004585213,0.8103211,0.00008516896,0.0011031434,0.18465142,0.00018881744],"about_ca_topic_score_codex":0.000005384272,"about_ca_topic_score_gemma":0.00094380433,"teacher_disagreement_score":0.87000984,"about_ca_system_score_codex":0.000023471372,"about_ca_system_score_gemma":0.00004678492,"threshold_uncertainty_score":0.5186234},"labels":[],"label_agreement":null},{"id":"W2041447768","doi":"10.1109/wcnc.2013.6554765","title":"Delay optimization in multi-hop wireless networks with network coding","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Linear network coding; Wireless network; Network delay; Network packet; End-to-end delay; Network topology; Wireless ad hoc network; Wireless mesh network; Queuing delay; Processing delay; Distributed computing; Wireless; Wireless WAN; Transmission delay; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.03150124679729069,"score_gpt":0.2551843215070712,"score_spread":0.22368307470978052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041447768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030063016,0.00022021242,0.9928771,0.00068270875,0.000103220555,0.00030524944,3.8390862e-8,0.00017495292,0.0026301919],"genre_scores_gemma":[0.73774564,0.00048517185,0.26067045,0.00069092645,0.000036827463,0.0000573885,0.0000034610916,0.000009911088,0.00030018727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887323,0.00014823936,0.0002398537,0.0002842489,0.000119016506,0.0003354263],"domain_scores_gemma":[0.9990161,0.0001248314,0.00007276074,0.0005455225,0.000158061,0.000082745486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002593273,0.0001408054,0.00015538336,0.00006963507,0.00018797458,0.00027323258,0.0007168823,0.000057556343,0.00012755973],"category_scores_gemma":[0.000009627395,0.00011276507,0.00002201781,0.0009355303,0.000034896286,0.00072282273,0.00030705883,0.00020276954,0.000027292863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020722177,0.000031600135,0.0034347242,0.0000012255118,0.000005700156,0.0000020072175,0.00015911766,0.9532593,0.000010448867,0.013609616,0.0007802945,0.02870391],"study_design_scores_gemma":[0.00041640303,0.000024603938,0.0034375035,0.000053527776,0.000001226772,0.000004916487,0.000020026986,0.9956198,0.0000114362065,0.000017070393,0.00021730551,0.00017620492],"about_ca_topic_score_codex":0.000037685877,"about_ca_topic_score_gemma":0.00034857524,"teacher_disagreement_score":0.73473936,"about_ca_system_score_codex":0.000050276387,"about_ca_system_score_gemma":0.000030032857,"threshold_uncertainty_score":0.45984262},"labels":[],"label_agreement":null},{"id":"W2041551130","doi":"10.1109/isit.2007.4557650","title":"Diversity-Multiplexing Trade-Off In Ad-Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Diversity gain; Multiplexing; Wireless ad hoc network; Computer science; Fading; Rayleigh fading; Diversity (politics); Computer network; Interference (communication); Algorithm; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.04330221938165035,"score_gpt":0.27638597193588854,"score_spread":0.2330837525542382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041551130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022071745,0.002548477,0.962573,0.00143693,0.00021558221,0.00011578188,8.140254e-8,0.00019371568,0.010844714],"genre_scores_gemma":[0.98322046,0.0015494523,0.013877668,0.0010763317,0.00003083437,8.106934e-7,0.0000010203339,0.0000038781886,0.00023952493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991222,0.000069059104,0.00018487524,0.000214273,0.00012847641,0.0002811334],"domain_scores_gemma":[0.99921453,0.00021004675,0.000035077126,0.0004382341,0.000023058325,0.00007903313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073295704,0.0000891191,0.000102414684,0.00011500063,0.00047176023,0.000051854044,0.0009615693,0.000048119866,0.000034742046],"category_scores_gemma":[0.00002021218,0.00008630039,0.000037597547,0.00063583156,0.00002690496,0.00033093427,0.0018461747,0.00021240424,0.000012430796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009451099,0.00006402469,0.010845735,0.000001406915,0.0000062589547,0.000019153975,0.0040861787,0.0013506396,0.000091511996,0.052032586,0.0007377394,0.9307553],"study_design_scores_gemma":[0.00086345227,0.00005202215,0.13512252,0.000041362397,0.0000016984333,0.000007148442,0.00020854225,0.80753064,0.00021266444,0.0003345229,0.055265144,0.00036029375],"about_ca_topic_score_codex":0.0000033973768,"about_ca_topic_score_gemma":0.000760222,"teacher_disagreement_score":0.96114874,"about_ca_system_score_codex":0.00006346735,"about_ca_system_score_gemma":0.000012447368,"threshold_uncertainty_score":0.3628446},"labels":[],"label_agreement":null},{"id":"W2041798060","doi":"10.1109/mwc.2010.5490984","title":"CORE: a coding-aware opportunistic routing mechanism for wireless mesh networks [Accepted from Open Call","year":2010,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nokia (Canada)","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Linear network coding; Routing protocol; Distributed computing; Dynamic Source Routing; Network packet; Virtual routing and forwarding; Packet forwarding; Wireless network; Wireless; Telecommunications","score_opus":0.13731249998083703,"score_gpt":0.3460634148860505,"score_spread":0.2087509149052135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041798060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011445549,0.00003932102,0.9798936,0.003745015,0.0010652586,0.001413221,0.000099581404,0.0004798162,0.0018186287],"genre_scores_gemma":[0.953474,0.0011908015,0.04230792,0.0013540103,0.00015574314,0.0007625956,0.00039818994,0.000058181104,0.00029859986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729913,0.00035572573,0.00080321915,0.0006919503,0.0002685066,0.0005814661],"domain_scores_gemma":[0.99014294,0.0016827139,0.0004351652,0.0065600905,0.00086012547,0.00031894445],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00091840356,0.00038530718,0.00054065377,0.00012717595,0.0021133649,0.0010508657,0.014052405,0.0002581176,0.00006568296],"category_scores_gemma":[0.00015339756,0.00041293784,0.0001653411,0.00073091796,0.0002663516,0.00077782554,0.0041639204,0.0010941806,0.00002879277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010618156,0.00018692034,0.000108820495,0.00000494851,0.00006442508,0.0000016795212,0.0007060389,0.000020694133,0.010711544,0.93428195,0.0015353168,0.05236703],"study_design_scores_gemma":[0.0008719632,0.000042377203,0.0002718638,0.00011763261,0.000038410115,0.000007902817,0.000096728734,0.99156594,0.0007575907,0.0038819192,0.0018097282,0.00053794036],"about_ca_topic_score_codex":0.00025853107,"about_ca_topic_score_gemma":0.0037008005,"teacher_disagreement_score":0.99154526,"about_ca_system_score_codex":0.00010037213,"about_ca_system_score_gemma":0.0003243395,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W2042223646","doi":"10.1155/2008/329727","title":"Average Throughput with Linear Network Coding over Finite Fields: The Combination Network Case","year":2008,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Linear network coding; Computer science; Finite field; Throughput; Coding (social sciences); Code (set theory); Field (mathematics); Algorithm; Theoretical computer science; Computer network; Mathematics; Discrete mathematics; Statistics; Telecommunications; Programming language","score_opus":0.06244388400439737,"score_gpt":0.28702089746397735,"score_spread":0.22457701345957998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042223646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06313028,0.016992673,0.9017004,0.010854404,0.0010587381,0.00062129827,0.0000015864134,0.00026152367,0.0053791264],"genre_scores_gemma":[0.9306423,0.05763642,0.008524207,0.002263474,0.00076786196,0.000023949326,0.000006228675,0.000027584389,0.000107958884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972324,0.0010415253,0.00056110916,0.00031101715,0.0003352825,0.0005187047],"domain_scores_gemma":[0.99494946,0.0022155237,0.00047703303,0.0019487365,0.00024646873,0.0001627774],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001346121,0.00029717817,0.0003208352,0.00008224731,0.0064880275,0.00044217953,0.0018868571,0.0000983729,0.000013356865],"category_scores_gemma":[0.000025482357,0.00021115859,0.00010017891,0.001038944,0.00030066006,0.00056213094,0.0009644771,0.0014547555,0.0000067852434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016556014,0.00052921596,0.02094708,0.00002201303,0.0004992431,0.0015381131,0.012701821,0.24366836,0.000018183988,0.26168472,0.012473429,0.44575226],"study_design_scores_gemma":[0.00097396906,0.0002908861,0.0019113974,0.00049716485,0.000024247147,0.005600841,0.00006437832,0.9073344,0.000004511128,0.0011568149,0.08170931,0.00043207113],"about_ca_topic_score_codex":0.000008655223,"about_ca_topic_score_gemma":0.00014111958,"teacher_disagreement_score":0.89317614,"about_ca_system_score_codex":0.00007148935,"about_ca_system_score_gemma":0.00007966355,"threshold_uncertainty_score":0.9948054},"labels":[],"label_agreement":null},{"id":"W2042257709","doi":"10.1109/wcnc.2012.6213943","title":"Performance analysis and power allocation of AF best relay selection in generic noise","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Mathematical optimization; Selection (genetic algorithm); Signal-to-noise ratio (imaging); Gaussian noise; Noise (video); Gaussian; Noise power; Monomial; Power (physics); Fading; Algorithm; Mathematics; Telecommunications; Artificial intelligence; Discrete mathematics","score_opus":0.026541506523572546,"score_gpt":0.26245615887789187,"score_spread":0.23591465235431933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042257709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8532006,0.000325014,0.14422245,0.00016678838,0.000023966508,0.000040986695,4.3802434e-8,0.000015616066,0.0020045103],"genre_scores_gemma":[0.987214,0.0006875426,0.011822183,0.000057042085,0.0000071566533,0.0000050875065,8.49387e-7,0.0000015737415,0.00020456503],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995615,0.000056095483,0.0001317579,0.00009007995,0.00006776036,0.00009282416],"domain_scores_gemma":[0.99966776,0.000026098538,0.000044254644,0.00017071086,0.00006059722,0.000030560717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027264407,0.00004480474,0.00007945484,0.00018575772,0.000047207643,0.0000162614,0.00015030995,0.000020912226,0.000026612424],"category_scores_gemma":[0.0000097970305,0.000040069186,0.00001671464,0.0013770167,0.000014202307,0.00043791672,0.00009050664,0.000048772665,0.0000057711077],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038276826,0.00014412252,0.9122744,0.000005511828,0.000039927938,3.8450104e-8,0.0016201719,0.0029754138,0.012140597,0.008459185,0.00005274328,0.062284015],"study_design_scores_gemma":[0.00006951184,0.000024931307,0.56582487,0.0000043631367,0.000010089662,9.179365e-7,0.000013953192,0.43094435,0.002785509,0.0000017212049,0.0002662775,0.000053491836],"about_ca_topic_score_codex":0.000014761342,"about_ca_topic_score_gemma":0.000107706226,"teacher_disagreement_score":0.42796892,"about_ca_system_score_codex":0.00002272805,"about_ca_system_score_gemma":0.000010812255,"threshold_uncertainty_score":0.1633974},"labels":[],"label_agreement":null},{"id":"W2042370522","doi":"10.1109/twc.2012.070912.111308","title":"Network Coded Multi-Source Cooperative Communication in BICM-OFDM Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise error probability; Computer science; Orthogonal frequency-division multiplexing; Linear network coding; Relay; Cooperative diversity; Diversity gain; Decoding methods; Antenna diversity; Algorithm; Diversity scheme; Upper and lower bounds; Wireless network; Overhead (engineering); Multiplexing; Computer network; Channel (broadcasting); Telecommunications; Wireless; Fading; Mathematics; Power (physics)","score_opus":0.060951628435851925,"score_gpt":0.30060602851194884,"score_spread":0.23965440007609692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042370522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021415583,0.003873188,0.9879718,0.003049191,0.00038798086,0.0007045116,0.000008200607,0.00045772185,0.0014058822],"genre_scores_gemma":[0.94189197,0.008970079,0.046689983,0.0012485514,0.00004797916,0.0005305477,0.000032890723,0.000047737605,0.0005402431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579406,0.0019115875,0.00080405746,0.00041535503,0.00028430842,0.0007906367],"domain_scores_gemma":[0.9921754,0.0012916132,0.0002527057,0.005713291,0.00029660907,0.0002704034],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012290693,0.0003994667,0.00043982876,0.0003255541,0.0017541084,0.00023714286,0.004489089,0.0002254219,0.00005386084],"category_scores_gemma":[0.000021488155,0.00042980074,0.00015129083,0.0023746886,0.0003559481,0.0013109558,0.00014929599,0.001474618,0.0001254223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000676236,0.0047358023,0.0015413526,0.00001791677,0.00019378727,0.0000014366846,0.011364289,0.6021931,0.0007766161,0.103150696,0.0023818193,0.27357554],"study_design_scores_gemma":[0.0012452744,0.000060944432,0.0017709333,0.00022659739,0.000026285692,0.000013701395,0.00023772023,0.9825943,0.0005691175,0.00008259948,0.012524891,0.00064760714],"about_ca_topic_score_codex":0.00007570844,"about_ca_topic_score_gemma":0.0016874358,"teacher_disagreement_score":0.9412818,"about_ca_system_score_codex":0.00029784127,"about_ca_system_score_gemma":0.00010479087,"threshold_uncertainty_score":0.9998154},"labels":[],"label_agreement":null},{"id":"W2042494064","doi":"10.1109/isit.2012.6283633","title":"A deterministic approach to random access interference channel","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Channel (broadcasting); Interference (communication); Transmission (telecommunications); Throughput; Computer science; Computer network; Interference alignment; Channel capacity; Co-channel interference; Random access; Mathematical optimization; Telecommunications; Topology (electrical circuits); Mathematics; Wireless; MIMO; Combinatorics","score_opus":0.1260835179978463,"score_gpt":0.33668781195506026,"score_spread":0.21060429395721394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042494064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012527917,0.00012037429,0.9108815,0.00041337422,0.00020179196,0.00016045215,1.7085564e-7,0.00011684251,0.086852714],"genre_scores_gemma":[0.9793271,0.000035980014,0.018308612,0.0015129737,0.00006532654,0.000063846346,8.2943274e-7,0.0000041996923,0.00068113423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992534,0.00009046404,0.00013812765,0.00017387849,0.00009219771,0.0002519229],"domain_scores_gemma":[0.999038,0.00009854897,0.00002763845,0.00060489646,0.000058826805,0.00017212435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031220767,0.000092078866,0.00011496301,0.00007636413,0.00012052087,0.00024267938,0.0017113383,0.000020998834,0.000027871001],"category_scores_gemma":[0.00006452467,0.00007352481,0.000029216897,0.00038568187,0.000016368813,0.0006350887,0.0012158715,0.000082166654,0.00012568542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005639486,0.00073910214,0.0013741888,0.00002961775,0.000041198542,0.0000012152074,0.014681944,0.0003644099,0.0008136093,0.5671412,0.013541127,0.40121603],"study_design_scores_gemma":[0.0019835627,0.00014168062,0.011485009,0.000086740445,0.000012856584,0.000055800836,0.00014715345,0.9463659,0.003203766,0.0010953182,0.034379523,0.0010426962],"about_ca_topic_score_codex":0.00000216761,"about_ca_topic_score_gemma":0.0000035322946,"teacher_disagreement_score":0.9780743,"about_ca_system_score_codex":0.00001984996,"about_ca_system_score_gemma":0.000017442137,"threshold_uncertainty_score":0.31801206},"labels":[],"label_agreement":null},{"id":"W2042550030","doi":"10.48550/arxiv.1407.1360","title":"Differential Dual-Hop Relaying under User Mobility","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Fading; Rayleigh fading; Bit error rate; Computer science; Decoding methods; Differential (mechanical device); Algorithm; Fading distribution; Additive white Gaussian noise; Hop (telecommunications); Electronic engineering; Telecommunications; Channel (broadcasting); Engineering","score_opus":0.10653794573959802,"score_gpt":0.2175598021216613,"score_spread":0.11102185638206327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042550030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32811347,0.000049826354,0.66848767,0.00021246039,0.00056391134,0.00018699319,0.0000022528857,0.00025673534,0.0021266807],"genre_scores_gemma":[0.9959285,0.0005292591,0.0010519441,0.000229079,0.000101312995,0.000001770028,0.000015790816,0.000017782273,0.00212451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976914,0.00051761686,0.0002520303,0.0010863676,0.00010773656,0.00034485475],"domain_scores_gemma":[0.996561,0.0002175325,0.00022833001,0.002597896,0.00022095794,0.00017429196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002556694,0.0003304218,0.00035915396,0.00017327422,0.00037225615,0.00023089409,0.0022034363,0.00027431,0.00015531445],"category_scores_gemma":[0.00003981387,0.00036919746,0.00023382016,0.00044188343,0.00013232928,0.0003095989,0.0058062985,0.0008910232,0.00012680452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002511995,0.00023531135,0.0020748023,0.000059535338,0.00014671916,0.00003164027,0.00042056091,0.20169204,0.00029942158,0.7914399,0.0011769255,0.0023980374],"study_design_scores_gemma":[0.0006179395,0.00003723262,0.007329219,0.00013158665,0.00005699685,0.000002739162,0.000043331584,0.96438473,0.00017773305,0.023307523,0.0031765767,0.0007343755],"about_ca_topic_score_codex":0.000025958576,"about_ca_topic_score_gemma":0.000062286344,"teacher_disagreement_score":0.7681324,"about_ca_system_score_codex":0.00023866676,"about_ca_system_score_gemma":0.00013275204,"threshold_uncertainty_score":0.999876},"labels":[],"label_agreement":null},{"id":"W2042557094","doi":"10.1109/twc.2011.110811.110347","title":"On Symbol Mapping for Binary Physical-Layer Network Coding with PSK Modulation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Bureau de Recherches Géologiques et Minières","keywords":"Computer science; Gray code; Binary number; Phase-shift keying; Physical layer; Ambiguity; Algorithm; Constellation; Linear network coding; Relay; Bit error rate; Decoding methods; Theoretical computer science; Computer network; Telecommunications; Mathematics; Wireless; Arithmetic","score_opus":0.0959116904958347,"score_gpt":0.29044748809271925,"score_spread":0.19453579759688455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042557094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019225596,0.000057359895,0.97606903,0.0010677946,0.00019389493,0.00071387074,0.00001005556,0.00038396812,0.002278402],"genre_scores_gemma":[0.94976556,0.00046594677,0.048473895,0.0004052511,0.000038966497,0.00062091224,0.000012354411,0.000036206904,0.000180893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837637,0.00028878867,0.00033509708,0.00041755376,0.00022097166,0.00036122795],"domain_scores_gemma":[0.9955129,0.0008145381,0.00017371376,0.0031191248,0.00026317514,0.00011656174],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002899897,0.00026925394,0.0002719151,0.00021915126,0.0017102086,0.00011330649,0.002068264,0.00007932487,0.000017577544],"category_scores_gemma":[0.0000060618213,0.00025415776,0.0001450805,0.0009945293,0.00015123544,0.0005095189,0.000032606025,0.0004740888,0.000041234784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020107484,0.0023815972,0.00007509487,0.000043276672,0.00033725126,0.000002146465,0.012997921,0.13004035,0.0060236687,0.5482814,0.0007860584,0.29883018],"study_design_scores_gemma":[0.00074273924,0.00035690618,0.0007313767,0.00026993972,0.00003254881,0.000004817305,0.00012077364,0.99133253,0.0028464063,0.0024351142,0.00069303246,0.0004338227],"about_ca_topic_score_codex":0.0000114691375,"about_ca_topic_score_gemma":0.00007972429,"teacher_disagreement_score":0.93053997,"about_ca_system_score_codex":0.00011332541,"about_ca_system_score_gemma":0.000071898525,"threshold_uncertainty_score":0.99999106},"labels":[],"label_agreement":null},{"id":"W2042801978","doi":"10.1109/icc.2012.6364629","title":"Performance evaluation of network-coded multicast in multi-channel multi-radio wireless mesh networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer network; Wireless mesh network; Computer science; Multicast; Linear network coding; Throughput; Network packet; Network performance; Source-specific multicast; Wireless network; Distributed computing; Wireless; Telecommunications","score_opus":0.12026789357994006,"score_gpt":0.3293594813821108,"score_spread":0.20909158780217074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042801978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19196773,0.000943216,0.8051962,0.00011642934,0.00053144095,0.0005456657,4.0317323e-7,0.00010146057,0.00059741084],"genre_scores_gemma":[0.96976113,0.00078205025,0.029046742,0.00010943339,0.00009353059,0.000073374234,0.0000062220824,0.00001414864,0.000113374175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976768,0.00054287584,0.0005236369,0.0002945508,0.00040069822,0.0005614408],"domain_scores_gemma":[0.9982674,0.00016951865,0.0001784088,0.000854109,0.00039493103,0.00013560864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031281768,0.00020422428,0.00028989842,0.00012675235,0.00016061329,0.00004647018,0.0008948554,0.00010519602,0.0000425625],"category_scores_gemma":[0.00006941284,0.00018868948,0.00006473548,0.0008444816,0.000068290465,0.0008910249,0.0004538462,0.00026835062,0.000019322235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039951035,0.001553172,0.093620025,0.000031237167,0.00007786199,9.607886e-7,0.0072956714,0.47916868,0.0006335892,0.02000997,0.0006410599,0.39692783],"study_design_scores_gemma":[0.001417765,0.00002100924,0.1027038,0.00007195359,0.000009912126,0.0000026260616,0.000040506253,0.8952052,0.0002826905,0.0000041032777,0.000038098944,0.00020232066],"about_ca_topic_score_codex":0.000017113547,"about_ca_topic_score_gemma":0.00023877618,"teacher_disagreement_score":0.7777934,"about_ca_system_score_codex":0.0001255012,"about_ca_system_score_gemma":0.00006473306,"threshold_uncertainty_score":0.76945335},"labels":[],"label_agreement":null},{"id":"W2042852713","doi":"10.1109/glocom.2009.5426211","title":"Greedy Sub-Channel Redistribution Routing Scheme in Multi-Hop Wireless OFDMA Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Hop (telecommunications); Equal-cost multi-path routing; Dijkstra's algorithm; Private Network-to-Network Interface; Dynamic Source Routing; Shortest path problem; Distributed computing; Routing (electronic design automation); Routing protocol; Theoretical computer science; Graph","score_opus":0.04830134469215322,"score_gpt":0.28744051119047226,"score_spread":0.23913916649831904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042852713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041931447,0.00040600816,0.9534126,0.0027625696,0.00015641151,0.00015593941,5.0103546e-7,0.0002265699,0.0009479432],"genre_scores_gemma":[0.9932167,0.0005174451,0.0054138443,0.00067168224,0.00005847813,0.000010641929,0.00001064789,0.0000047877857,0.000095807685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987605,0.00012771312,0.00030958475,0.00032082712,0.00014032748,0.0003410079],"domain_scores_gemma":[0.9990998,0.000064188964,0.00008490009,0.00053483393,0.00013574705,0.000080537786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001465,0.00014323591,0.00016518746,0.000082954786,0.00020077232,0.00014069282,0.0007959717,0.0000834225,0.000009023233],"category_scores_gemma":[0.00004372243,0.00013914146,0.000047358964,0.00084217754,0.000025128027,0.00043982026,0.0002806194,0.00028666828,0.000011505341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018707104,0.0004774457,0.003012884,0.000005147289,0.000016064707,0.000019618941,0.0011078047,0.0050968886,0.011921024,0.40377712,0.0019270215,0.5726203],"study_design_scores_gemma":[0.0004481768,0.000026746631,0.014840088,0.000061525105,0.0000010276257,0.0000030175158,0.000024803106,0.9827541,0.001409966,0.0001585054,0.00009429945,0.00017771625],"about_ca_topic_score_codex":0.00001248671,"about_ca_topic_score_gemma":0.00012496079,"teacher_disagreement_score":0.97765726,"about_ca_system_score_codex":0.00009436379,"about_ca_system_score_gemma":0.00003116559,"threshold_uncertainty_score":0.5674024},"labels":[],"label_agreement":null},{"id":"W2042856063","doi":"10.1109/icufn.2012.6261749","title":"CAAHR: Content aware adaptive HARQ retransmission scheme for 4G/LTE network","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Retransmission; Computer science; Hybrid automatic repeat request; Computer network; Network packet; Mobile broadband; Telecommunications link; Wireless network; Automatic repeat request; Throughput; Wireless; Cellular network; Multimedia; Telecommunications","score_opus":0.16958624999769398,"score_gpt":0.3075385157406959,"score_spread":0.13795226574300193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042856063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071113463,0.002199967,0.9887588,0.00206562,0.00046381835,0.0003681437,0.00000135841,0.00019312584,0.005238024],"genre_scores_gemma":[0.8126043,0.00047085388,0.18176155,0.0015094677,0.0003294455,0.00006840532,0.000007542988,0.00001266675,0.0032357597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998887,0.00009904801,0.00021821675,0.00022283322,0.00014645314,0.00042644344],"domain_scores_gemma":[0.9987116,0.00023507331,0.00006521934,0.0005915411,0.00020746913,0.00018909777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050076866,0.00013882009,0.00015895252,0.000032981836,0.00036505854,0.000077815734,0.0007010615,0.000060153165,0.000091069],"category_scores_gemma":[0.000036940015,0.00011200911,0.000090128604,0.0002792266,0.000029031602,0.00054913014,0.00026440257,0.00013786864,0.000041008225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060413142,0.00017057477,0.0030730874,0.00001563234,0.0000661595,7.632445e-7,0.0015402895,0.00015262295,0.0020145923,0.72743386,0.09429261,0.17117937],"study_design_scores_gemma":[0.0012014931,0.00022214383,0.004693343,0.00019039871,0.0000139204585,0.000008043934,0.00014818418,0.5287176,0.0038958057,0.0008820452,0.4594086,0.00061842334],"about_ca_topic_score_codex":0.0000051115658,"about_ca_topic_score_gemma":0.000025796931,"teacher_disagreement_score":0.81189317,"about_ca_system_score_codex":0.000050995306,"about_ca_system_score_gemma":0.00004934989,"threshold_uncertainty_score":0.4567599},"labels":[],"label_agreement":null},{"id":"W2042912048","doi":"10.1109/tit.2013.2286621","title":"Broadcast Approaches to the Diamond Channel","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Decoding methods; Fading; Linear network coding; Channel (broadcasting); Block Error Rate; Transmission (telecommunications); Code rate; Throughput; Algorithm; Topology (electrical circuits); Computer network; Mathematics; Wireless; Telecommunications; Network packet; Telecommunications link","score_opus":0.06331252199397727,"score_gpt":0.2292682476007619,"score_spread":0.16595572560678462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042912048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005321747,0.00003071559,0.9842005,0.0058858595,0.00037678555,0.0004367598,0.0000032057817,0.00015103882,0.008382997],"genre_scores_gemma":[0.9931152,0.00006589117,0.002095999,0.0036755535,0.000024483885,0.00034929859,0.0000019994927,0.0000046208197,0.00066693913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991847,0.0001531641,0.00023053499,0.00009918449,0.00016717886,0.00016520132],"domain_scores_gemma":[0.9989288,0.00016654578,0.000057440688,0.0006796902,0.00008549635,0.000082056285],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004199863,0.000109468805,0.00007573154,0.00015672154,0.0005165565,0.0003367796,0.0008197861,0.000036745118,0.00015668232],"category_scores_gemma":[0.000008790494,0.00007741762,0.00005629161,0.00048843573,0.00003747149,0.0018794605,0.000009651927,0.00019465062,0.002565209],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006188736,0.00003365161,2.3748504e-7,0.0000036009858,0.000015147923,3.5054036e-8,0.009208047,0.028140478,0.00001841176,0.08351511,0.0023366916,0.8767224],"study_design_scores_gemma":[0.0008866423,0.00026828545,0.00058236095,0.00007827329,0.000019322475,0.000025115622,0.0029669974,0.8242993,0.013099892,0.015150043,0.14177929,0.0008444898],"about_ca_topic_score_codex":0.0000041826374,"about_ca_topic_score_gemma":0.000004817831,"teacher_disagreement_score":0.99258304,"about_ca_system_score_codex":0.000037249778,"about_ca_system_score_gemma":0.000024948848,"threshold_uncertainty_score":0.9982114},"labels":[],"label_agreement":null},{"id":"W2043004079","doi":"10.1109/cdc.2013.6760524","title":"Joint optimal relay selection and power allocation for cooperative transmission in wireless sensor networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Computer network; Node (physics); Transmission (telecommunications); Broadcasting (networking); Cooperative diversity; Energy consumption; Wireless sensor network; Efficient energy use; Wireless; Signal-to-noise ratio (imaging); Wireless network; Power (physics); Telecommunications; Engineering; Electrical engineering","score_opus":0.0230778096597824,"score_gpt":0.2550926403168391,"score_spread":0.2320148306570567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043004079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106098264,0.00013015143,0.8901567,0.002596239,0.000050204126,0.00054723356,1.0718495e-7,0.00007215845,0.00034894908],"genre_scores_gemma":[0.9228297,0.00038162386,0.07592897,0.00033806422,0.000017255821,0.00012050069,0.000003858856,0.00000724957,0.0003727733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911994,0.0001270982,0.00022578417,0.0002715932,0.00007347305,0.00018211089],"domain_scores_gemma":[0.99936706,0.00011282927,0.000043551216,0.00018348714,0.00022439584,0.0000686663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026880618,0.00011194404,0.00013072316,0.00007935471,0.00018405252,0.00016713815,0.00017592593,0.000068309964,0.00005463361],"category_scores_gemma":[0.000016655384,0.000094228526,0.000024751806,0.00032813498,0.000022249407,0.0005347721,0.000069941285,0.00014160354,0.00000607419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007100529,0.00037267822,0.00091956306,0.0000261415,0.000056676778,0.0000013261582,0.007989407,0.15829429,0.098128475,0.19703694,0.0059542977,0.5311492],"study_design_scores_gemma":[0.00042365244,0.000107007225,0.0023523907,0.000029762132,0.0000015963059,0.000004525871,0.00006603762,0.9931643,0.003039052,0.000035272536,0.00064164045,0.00013478719],"about_ca_topic_score_codex":0.00001990408,"about_ca_topic_score_gemma":0.00004480739,"teacher_disagreement_score":0.83487,"about_ca_system_score_codex":0.000045561577,"about_ca_system_score_gemma":0.000030683645,"threshold_uncertainty_score":0.3842528},"labels":[],"label_agreement":null},{"id":"W2043097635","doi":"10.1109/tvt.2012.2207439","title":"Power Allocation and Group Assignment for Reducing Network Coding Noise in Multi-Unicast Wireless Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Unicast; Relay; Computer science; Linear network coding; Computer network; Wireless; Wireless network; Power (physics); Multicast; Telecommunications","score_opus":0.03367204915687002,"score_gpt":0.274313694632368,"score_spread":0.24064164547549796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043097635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041501362,0.0012004019,0.9548745,0.0011166877,0.00052615657,0.0005445793,0.0000013869947,0.00020911591,0.000025769097],"genre_scores_gemma":[0.9819899,0.000575051,0.016917948,0.000085567655,0.000021056689,0.0003587962,0.0000015163547,0.000015038855,0.00003510471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877495,0.00012652346,0.0002945135,0.0003144869,0.0001047154,0.00038482287],"domain_scores_gemma":[0.9990435,0.00012721821,0.0000885363,0.00060469395,0.000067298875,0.00006874648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056729815,0.00015639077,0.00021092752,0.00028576245,0.00032759632,0.000062792824,0.00042673104,0.00018828247,0.0000025180918],"category_scores_gemma":[0.000008291719,0.00016071726,0.00004355264,0.0006537968,0.00007504405,0.0003060982,0.000015924841,0.00031902184,0.0000050499048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007386916,0.0020261975,0.001377277,0.00012507346,0.00022924447,0.000009592839,0.0029485072,0.20473367,0.13991702,0.32000107,0.00024626107,0.32831222],"study_design_scores_gemma":[0.0013067463,0.00019933844,0.00060862594,0.00032622454,0.000019892403,0.00004970804,0.00026719426,0.9839996,0.009193434,0.00009255725,0.003520008,0.000416638],"about_ca_topic_score_codex":0.0000063263437,"about_ca_topic_score_gemma":0.000026145462,"teacher_disagreement_score":0.9404886,"about_ca_system_score_codex":0.00014775778,"about_ca_system_score_gemma":0.000018383538,"threshold_uncertainty_score":0.655386},"labels":[],"label_agreement":null},{"id":"W2043153978","doi":"10.1049/iet-com.2013.0558","title":"Uplink scheduling solution for enhancing throughput and fairness in relayed long‐term evolution networks","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Telecommunications link; Computer science; Maximum throughput scheduling; Term (time); Scheduling (production processes); Throughput; Computer network; Fairness measure; Telecommunications; Dynamic priority scheduling; Mathematical optimization; Round-robin scheduling; Wireless; Quality of service; Mathematics","score_opus":0.04230175406491025,"score_gpt":0.3090671617321022,"score_spread":0.2667654076671919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043153978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007415139,0.003203512,0.984142,0.0040586186,0.00014947695,0.00039207618,6.4144587e-7,0.00015127959,0.00048724186],"genre_scores_gemma":[0.88346773,0.00167229,0.114410564,0.00017097793,0.000049968414,0.00015388755,0.000028393026,0.000012339298,0.000033851073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855304,0.00036213695,0.00040729844,0.00031021144,0.00008195908,0.00028538096],"domain_scores_gemma":[0.996732,0.0007011013,0.0001317219,0.0021717744,0.00019376501,0.00006967021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011470534,0.00014701042,0.00019530575,0.00013054599,0.00078112003,0.0001740271,0.0016048674,0.00010674961,0.0000019088814],"category_scores_gemma":[0.00020850556,0.00016240173,0.000053196673,0.00053421996,0.000121846424,0.00059685454,0.0011165375,0.00034637656,0.0000052274922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016502925,0.00020771608,0.0077840346,0.000033208624,0.000030165202,1.8267271e-7,0.0022801277,0.009336953,0.0025757337,0.7518506,0.0001232247,0.22576156],"study_design_scores_gemma":[0.00049768924,0.000037055284,0.020658627,0.00013899538,0.000007760949,0.00000476631,0.00002245464,0.9745748,0.000051259594,0.0033184455,0.0004985909,0.0001895664],"about_ca_topic_score_codex":0.000024402541,"about_ca_topic_score_gemma":0.0022770513,"teacher_disagreement_score":0.96523786,"about_ca_system_score_codex":0.00014111491,"about_ca_system_score_gemma":0.00005477388,"threshold_uncertainty_score":0.66225505},"labels":[],"label_agreement":null},{"id":"W2043202930","doi":"10.1109/twc.2015.2390227","title":"End-to-End Optimum ML Detection for DF Cooperative Diversity Networks in the Presence of Interference","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Royal Military College of Canada; Queen's University","funders":"Defence Research and Development Canada","keywords":"Interference (communication); Relay; Computer science; Channel state information; Detector; Single antenna interference cancellation; Topology (electrical circuits); Co-channel interference; Cooperative diversity; Channel (broadcasting); Diversity gain; Signal-to-noise ratio (imaging); Telecommunications; Computer network; MIMO; Physics; Wireless; Fading; Electrical engineering; Engineering; Power (physics)","score_opus":0.0895101867894733,"score_gpt":0.3059318735439874,"score_spread":0.21642168675451406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043202930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008161578,0.00015369408,0.9872045,0.0029269154,0.00023880428,0.000765424,0.000015921212,0.00006891158,0.00046425156],"genre_scores_gemma":[0.9906615,0.0006012063,0.007955746,0.00032256014,0.000012311964,0.00036367198,0.000004992143,0.00000897685,0.000069026806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981582,0.00073474186,0.00036587735,0.00028355425,0.0002313993,0.00022620228],"domain_scores_gemma":[0.9955336,0.0013513437,0.000121103156,0.0023892059,0.00050145766,0.00010327452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009224198,0.00016512015,0.00021285855,0.00021547565,0.0008831527,0.00010271126,0.0039471765,0.000075409094,0.000006644248],"category_scores_gemma":[0.000045832694,0.00014552662,0.000086239386,0.0012792038,0.00021570337,0.0004480645,0.00015224036,0.00048515393,0.0000069413104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022212033,0.0016656263,0.00015803827,0.000019022893,0.00011153712,0.0000011425045,0.043742836,0.45775715,0.0020741115,0.0390344,0.0006071263,0.4546069],"study_design_scores_gemma":[0.0007258261,0.00039222505,0.0004216798,0.0001086811,0.000021112575,0.0000054914603,0.0010984536,0.9907342,0.004769284,0.00027491545,0.0011909046,0.00025722155],"about_ca_topic_score_codex":0.00012080793,"about_ca_topic_score_gemma":0.0035366428,"teacher_disagreement_score":0.98249996,"about_ca_system_score_codex":0.00012739973,"about_ca_system_score_gemma":0.00010495931,"threshold_uncertainty_score":0.73349017},"labels":[],"label_agreement":null},{"id":"W2043454408","doi":"10.1109/cwit.2013.6621613","title":"An efficient Soliton-like network coding protocol for the resource-constrained Y-network","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Fountain code; Computer science; Relay; Binary erasure channel; Computer network; Decoding methods; Coding (social sciences); Erasure; Erasure code; Luby transform code; Theoretical computer science; Distributed computing; Algorithm; Channel (broadcasting); Channel capacity; Block code; Network packet; Concatenated error correction code; Mathematics","score_opus":0.048374374405783356,"score_gpt":0.3170377769923473,"score_spread":0.26866340258656396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043454408","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054257933,0.00003600333,0.9023831,0.0029686391,0.00020873015,0.08562912,3.6875312e-7,0.0003371556,0.008382661],"genre_scores_gemma":[0.20429474,0.00001262311,0.1806913,0.008039855,0.001834981,0.60319287,0.000008131756,0.000049788752,0.0018757386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981426,0.00025782044,0.00036997444,0.00040140434,0.00021212333,0.0006160966],"domain_scores_gemma":[0.9971613,0.00090202154,0.00012845697,0.0014369683,0.00021981301,0.00015142722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011580599,0.00019972197,0.00018078458,0.00003146942,0.001258144,0.0006645728,0.002011312,0.00006247034,0.00021320253],"category_scores_gemma":[0.000038071128,0.00012895108,0.00009776875,0.0005406315,0.000115756695,0.0002444296,0.00045543347,0.00020069271,0.000053721782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024619501,0.00012857071,0.000199276,0.000012716457,0.000042541637,5.579006e-7,0.00078775483,0.20426704,0.00012940077,0.46132857,0.18844602,0.14463294],"study_design_scores_gemma":[0.000460334,0.00008165979,0.00041836002,0.000036952497,0.0000030827725,0.0000033311387,0.000046914472,0.81250286,0.000034575984,0.00085220573,0.1853838,0.00017591954],"about_ca_topic_score_codex":0.000007816728,"about_ca_topic_score_gemma":0.00002467155,"teacher_disagreement_score":0.7216918,"about_ca_system_score_codex":0.00004018888,"about_ca_system_score_gemma":0.00007517173,"threshold_uncertainty_score":0.9676753},"labels":[],"label_agreement":null},{"id":"W2043571898","doi":"10.1109/atc.2013.6698169","title":"Relay selection based on Bayesian decision theory in cooperative wireless networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brampton Civic Hospital; Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Relay channel; Computer network; Channel state information; Node (physics); Wireless network; Diversity gain; MIMO; Wireless; Cooperative diversity; Selection (genetic algorithm); Bayes' theorem; Channel (broadcasting); Bayesian probability; Telecommunications; Fading; Machine learning; Artificial intelligence; Engineering","score_opus":0.013650431748626015,"score_gpt":0.25355782534212123,"score_spread":0.23990739359349522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043571898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0112662,0.000043457283,0.9781723,0.00092555874,0.00013288192,0.00030289672,6.650871e-8,0.00013710141,0.0090195425],"genre_scores_gemma":[0.9828467,0.000084933214,0.014276077,0.0021779689,0.000029587876,0.00006934441,0.0000021023434,0.000008944543,0.0005043744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998539,0.00049967517,0.00024122646,0.00032897745,0.00016181114,0.0002293604],"domain_scores_gemma":[0.99843645,0.00074859016,0.000048150432,0.0005248572,0.00016505166,0.00007688841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005870259,0.00014157868,0.00014150224,0.00016709199,0.00020923738,0.00021620565,0.00063093,0.00007668354,0.0004351197],"category_scores_gemma":[0.00006754437,0.00011334188,0.000035628673,0.0009717904,0.000031343072,0.00044805213,0.00014542023,0.00030122625,0.00011089607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027868737,0.00015021686,0.001457218,0.0000011718129,0.0000053093513,0.0000016875694,0.0002460505,0.22185533,0.00024175324,0.28185454,0.0031621398,0.49099672],"study_design_scores_gemma":[0.00036199263,0.00009441984,0.0055875406,0.000054968157,6.9568e-7,0.0000010953206,0.000017371125,0.99246126,0.00030360403,0.0006467727,0.00032110454,0.0001491758],"about_ca_topic_score_codex":0.000014165799,"about_ca_topic_score_gemma":0.00018832277,"teacher_disagreement_score":0.97158045,"about_ca_system_score_codex":0.00009792656,"about_ca_system_score_gemma":0.00005259264,"threshold_uncertainty_score":0.47642556},"labels":[],"label_agreement":null},{"id":"W2043907228","doi":"10.1016/j.comnet.2014.12.010","title":"The selective use of redundancy for video streaming over Vehicular Ad Hoc Networks","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Redundancy (engineering); Unicast; Network packet; Video quality; Linear network coding; Wireless ad hoc network; Coding (social sciences); Real-time computing; Wireless; Telecommunications","score_opus":0.052237301848793494,"score_gpt":0.27814415518822083,"score_spread":0.22590685333942734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043907228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003231871,0.010470041,0.9839497,0.00036105138,0.0012518489,0.00051399524,0.0000011205635,0.0001409731,0.00007935003],"genre_scores_gemma":[0.8857629,0.0032541258,0.108270034,0.0013073046,0.0009735287,0.00012613658,0.000021062888,0.00005113223,0.00023382517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798656,0.0003371107,0.0004750632,0.0004529866,0.00024471828,0.0005035838],"domain_scores_gemma":[0.9963298,0.0013090417,0.00028777673,0.0012407133,0.0006530846,0.00017958425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007860069,0.00025126856,0.00031582793,0.00006391114,0.00049231097,0.00046017906,0.001469068,0.000109021064,0.0000012441946],"category_scores_gemma":[0.00008321883,0.00019808399,0.0001639238,0.00069601194,0.000127151,0.0005484082,0.0009340033,0.00035553894,0.000001926323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000616219,0.0000687563,0.0005064939,0.0000053658246,0.00011864961,0.0000035588891,0.0006148052,0.33068684,0.0000086573,0.020793801,0.054701142,0.5924303],"study_design_scores_gemma":[0.0005536454,0.0001801909,0.0011551637,0.00008173393,0.000012491259,0.0000066289213,0.0000072670537,0.9001572,0.000017158065,0.0004749582,0.09714038,0.000213176],"about_ca_topic_score_codex":0.0000028901468,"about_ca_topic_score_gemma":0.000041969957,"teacher_disagreement_score":0.882531,"about_ca_system_score_codex":0.00010130309,"about_ca_system_score_gemma":0.000111852954,"threshold_uncertainty_score":0.8077631},"labels":[],"label_agreement":null},{"id":"W2044052036","doi":"10.1109/glocom.2006.809","title":"WLC33-5: Second Order Statistics of Non-identical Nakagami Fading Channels with Maximal-Ratio Combining","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nakagami distribution; Fade; Fading; Envelope (radar); Independent and identically distributed random variables; Statistics; Order statistic; Correctness; Mathematics; Maximal-ratio combining; Level crossing; Sample (material); Algorithm; Computer science; Topology (electrical circuits); Telecommunications; Random variable; Physics; Combinatorics; Engineering","score_opus":0.017043265798598252,"score_gpt":0.25634433680148916,"score_spread":0.2393010710028909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044052036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04361298,0.00013129268,0.9494901,0.00028562665,0.00021418594,0.00014834422,0.000010108179,0.000064762135,0.0060426053],"genre_scores_gemma":[0.90401524,0.000020500725,0.09496984,0.00017033135,0.000048978083,0.000009868063,0.000019105162,0.000011079467,0.00073506165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987624,0.00008046885,0.00037555624,0.00026850085,0.00024037219,0.00027267713],"domain_scores_gemma":[0.9987668,0.00015491086,0.00015664747,0.0005563208,0.00029972344,0.000065626205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498548,0.00015605568,0.00023738276,0.000089242596,0.00019983195,0.00018850487,0.0006836453,0.00004554265,0.00016153933],"category_scores_gemma":[0.000028873199,0.00014429686,0.000029794577,0.00053117174,0.00008910708,0.00031820868,0.0003217609,0.00016523081,0.000035645186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004308065,0.000540243,0.012621247,0.00011568983,0.00012756992,0.00006886743,0.0027729794,0.008442399,0.0051385458,0.90671676,0.023950262,0.03946238],"study_design_scores_gemma":[0.0021774953,0.00040814443,0.035445746,0.00023007186,0.000029696592,0.00005734712,0.00011373828,0.9345436,0.0057217735,0.0063326396,0.01415037,0.0007893876],"about_ca_topic_score_codex":0.000030137573,"about_ca_topic_score_gemma":0.00025631112,"teacher_disagreement_score":0.9261012,"about_ca_system_score_codex":0.000043153657,"about_ca_system_score_gemma":0.00009008453,"threshold_uncertainty_score":0.5884255},"labels":[],"label_agreement":null},{"id":"W2044203354","doi":"10.1109/cnsr.2011.41","title":"Tradeoffs of Combining Network Coding and Duty Cycling in WSNs","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Transceiver; Computer science; Duty cycle; Efficient energy use; Wireless sensor network; Computer network; Energy consumption; Linear network coding; Network packet; Coding (social sciences); Real-time computing; Cycling; Wireless; Telecommunications; Engineering; Voltage; Electrical engineering","score_opus":0.08841461141252244,"score_gpt":0.26934693710665886,"score_spread":0.18093232569413642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044203354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29484576,0.0014627067,0.6128156,0.00058586913,0.0002980276,0.0002387741,2.3166533e-7,0.00017370393,0.08957929],"genre_scores_gemma":[0.9501654,0.00046436908,0.049157705,0.00014610488,0.000011387741,0.0000028945212,2.4820338e-7,0.0000032395196,0.00004866629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993111,0.0000875544,0.00022813737,0.00015128046,0.00006424649,0.00015766667],"domain_scores_gemma":[0.9994436,0.00013762778,0.000060136845,0.00029160344,0.000026673373,0.000040378873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004513145,0.000067289984,0.00013643636,0.000058104284,0.000079602,0.000025049052,0.00039934702,0.000027609944,0.000026194626],"category_scores_gemma":[0.00002194428,0.00006319726,0.00001887005,0.00034590648,0.000038869282,0.00021352283,0.0003046485,0.000115020775,0.0000017448058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070180304,0.00006918631,0.060356382,0.0000105533445,0.00001155575,0.000003796585,0.008939552,0.00016520955,0.0010168653,0.86695886,0.00018438874,0.062276613],"study_design_scores_gemma":[0.001514399,0.00017780533,0.25400528,0.0004278983,0.000007885084,0.000018385965,0.00046313726,0.7240549,0.0053615267,0.012282726,0.001128993,0.00055709353],"about_ca_topic_score_codex":0.000016673543,"about_ca_topic_score_gemma":0.00007725878,"teacher_disagreement_score":0.8546761,"about_ca_system_score_codex":0.000009229589,"about_ca_system_score_gemma":0.000015011681,"threshold_uncertainty_score":0.25771093},"labels":[],"label_agreement":null},{"id":"W2044331621","doi":"10.1109/twc.2011.101711.100901","title":"Effect of Feedback Delay on the Performance of Cooperative Networks with Relay Selection","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Channel state information; Relay channel; Computer science; Channel (broadcasting); Fading; Selection (genetic algorithm); Cooperative diversity; Transmission (telecommunications); Control theory (sociology); Telecommunications; Wireless; Power (physics)","score_opus":0.03174376254758498,"score_gpt":0.2567002165882132,"score_spread":0.2249564540406282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044331621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3266156,0.00008341347,0.670433,0.0003276998,0.000075831216,0.0003651362,0.000003156453,0.00007436835,0.0020217916],"genre_scores_gemma":[0.994962,0.0015957374,0.0030759377,0.00008616665,0.0000051565576,0.00017767111,0.0000019821525,0.000015366126,0.00007998024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982989,0.0008234384,0.00033008485,0.00019403634,0.00019116349,0.00016237046],"domain_scores_gemma":[0.9962501,0.0011075877,0.00021340503,0.0020903847,0.00029199827,0.00004654488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056101923,0.00017254453,0.00021350388,0.0001262932,0.0006894558,0.000025066796,0.001814596,0.00007067247,0.00004333609],"category_scores_gemma":[0.0000070861556,0.00011890477,0.00008284847,0.0010735424,0.0003466065,0.0002460185,0.00002314593,0.00054229615,0.000011476446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011361575,0.0020827677,0.00079626625,0.000077991004,0.00064801367,9.4310377e-7,0.008981686,0.59075123,0.0051923185,0.13543999,0.00026145033,0.2546312],"study_design_scores_gemma":[0.00050508097,0.002392758,0.00044557362,0.0002535561,0.00004392422,0.000009657731,0.000044035758,0.80512,0.19090405,0.0000038704443,0.00009541371,0.00018207544],"about_ca_topic_score_codex":0.000021101276,"about_ca_topic_score_gemma":0.00014208819,"teacher_disagreement_score":0.6683464,"about_ca_system_score_codex":0.000040072235,"about_ca_system_score_gemma":0.00006513656,"threshold_uncertainty_score":0.5302806},"labels":[],"label_agreement":null},{"id":"W2044443791","doi":"10.1109/bsc.2010.5472988","title":"Outage probability analysis of physical-layer network coding in bidirectional relay networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Outage probability; Linear network coding; Relay; Computer science; Physical layer; Expression (computer science); Computer network; Coding (social sciences); Closed-form expression; Topology (electrical circuits); Fading; Mathematics; Telecommunications; Channel (broadcasting); Statistics; Wireless; Power (physics); Physics","score_opus":0.035425198762879966,"score_gpt":0.2920478347332048,"score_spread":0.2566226359703248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044443791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42261308,0.000059816695,0.5674739,0.00046887976,0.00033055458,0.0002081563,7.8802793e-7,0.00013719867,0.008707606],"genre_scores_gemma":[0.98468465,0.000040064628,0.014870097,0.0001228228,0.00008901182,0.000017326594,0.0000042996767,0.000004451426,0.00016730625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987664,0.00017463042,0.00032275627,0.00032652647,0.00017616087,0.00023348634],"domain_scores_gemma":[0.9984031,0.00045103766,0.00011191476,0.00083101663,0.00014025945,0.000062728264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008473406,0.0001166648,0.00030468623,0.00018949644,0.00011732168,0.00005819013,0.000707934,0.000062037434,0.000100549165],"category_scores_gemma":[0.000080776175,0.00010177186,0.00015674521,0.0033138583,0.00006955216,0.00024631564,0.0003737083,0.00040202032,0.0000043644254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000916744,0.00024402437,0.13940455,0.0000042690067,0.00020066422,0.0000011737499,0.000675888,0.33797815,0.00279989,0.49199566,0.00038772472,0.026298823],"study_design_scores_gemma":[0.00010134398,0.000014067164,0.11096207,0.000007202162,0.000023725079,3.6357483e-7,0.0000030006324,0.88749665,0.00016616874,0.0005935211,0.00052474684,0.000107150954],"about_ca_topic_score_codex":0.000021753194,"about_ca_topic_score_gemma":0.001694172,"teacher_disagreement_score":0.5620715,"about_ca_system_score_codex":0.000029140225,"about_ca_system_score_gemma":0.0000367021,"threshold_uncertainty_score":0.4150136},"labels":[],"label_agreement":null},{"id":"W2044758810","doi":"10.1109/netcod.2012.6261902","title":"Network coding with unequal size overlapping generations","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Computer science; Redundancy (engineering); Coding (social sciences); Network topology; Overhead (engineering); Computational complexity theory; Theoretical computer science; Topology (electrical circuits); Algorithm; Computer network; Mathematics; Statistics","score_opus":0.05261758346130263,"score_gpt":0.2718846124719572,"score_spread":0.2192670290106546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044758810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046249535,0.0005270287,0.961829,0.0013635649,0.00022699151,0.00009849648,1.5590587e-7,0.00021588581,0.031113906],"genre_scores_gemma":[0.8621243,0.00008591401,0.13499099,0.0016001641,0.00029415582,0.000014375745,0.0000013159877,0.0000058988862,0.00088283856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991506,0.00010028839,0.00014096922,0.0001433705,0.00013564691,0.00032917174],"domain_scores_gemma":[0.9990324,0.00024185455,0.00004679843,0.0005002357,0.000072349954,0.00010640479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003345778,0.00009729666,0.00009669117,0.000023178423,0.00044684878,0.0001590862,0.00044859477,0.000025182188,0.00010754393],"category_scores_gemma":[0.00003106231,0.00007668729,0.000022199478,0.00048533207,0.000023606915,0.0007208833,0.00025817682,0.00011092937,0.00005013178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016960698,0.000031475123,0.003305122,0.0000014234331,0.000013285861,4.683308e-7,0.0006679439,0.0029389958,0.00081987906,0.97724307,0.005234986,0.00974165],"study_design_scores_gemma":[0.0015743605,0.00021408357,0.045864657,0.00017058576,0.000032270902,0.000058934667,0.00025387903,0.72598773,0.0020843367,0.0015532124,0.22060184,0.0016040961],"about_ca_topic_score_codex":0.0000024817236,"about_ca_topic_score_gemma":0.00002925986,"teacher_disagreement_score":0.9756899,"about_ca_system_score_codex":0.00003279364,"about_ca_system_score_gemma":0.000036151356,"threshold_uncertainty_score":0.34368446},"labels":[],"label_agreement":null},{"id":"W2044947776","doi":"10.1049/iet-com.2009.0461","title":"Improved channel access protocol for cooperative <i>ad hoc</i> networks","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Relay; Throughput; Bandwidth (computing); Node (physics); Multiple Access with Collision Avoidance for Wireless; Markov chain; Diversity gain; Hidden node problem; Channel (broadcasting); Optimized Link State Routing Protocol; Cooperative diversity; Data transmission; Wireless network; Wireless; MIMO; Telecommunications; Fading; Wi-Fi array","score_opus":0.09320148142979909,"score_gpt":0.3867840101752733,"score_spread":0.2935825287454742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044947776","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004832314,0.00026141864,0.894545,0.015402666,0.00033217415,0.08309118,0.000012912466,0.00048481004,0.0058215098],"genre_scores_gemma":[0.13230015,0.00074394065,0.13502431,0.002811249,0.00018222863,0.72787476,0.000084573934,0.000054461958,0.00092434615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985055,0.00023768915,0.00041715198,0.00037499564,0.00010357767,0.0003611248],"domain_scores_gemma":[0.99329865,0.00064219156,0.00021134753,0.0049614715,0.00073677447,0.00014954533],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00060842535,0.00022723689,0.00022616453,0.00009618454,0.001337884,0.0006938623,0.008041583,0.0001276221,0.000031789208],"category_scores_gemma":[0.00017882153,0.00021402324,0.000111220266,0.00073969224,0.00023097065,0.0009746465,0.002947166,0.0007305913,0.000014445141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011644119,0.0016577747,0.00011651627,0.000053332195,0.0001774656,6.854778e-7,0.0042327642,0.0011164749,0.018466795,0.49619475,0.05508659,0.4227804],"study_design_scores_gemma":[0.00089003576,0.00007845682,0.0001303036,0.000024936558,0.0000050894973,0.000003824483,0.000018758607,0.55019665,0.0006159694,0.0008860186,0.4468863,0.00026363065],"about_ca_topic_score_codex":0.0000036786846,"about_ca_topic_score_gemma":0.0007798167,"teacher_disagreement_score":0.7595207,"about_ca_system_score_codex":0.000035145837,"about_ca_system_score_gemma":0.0001763467,"threshold_uncertainty_score":0.9999622},"labels":[],"label_agreement":null},{"id":"W2045208106","doi":"10.1109/wcnc.2013.6555192","title":"Differential amplify-and-forward relaying in time-varying Rayleigh fading channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Fading; Rayleigh fading; Maximal-ratio combining; Signal-to-noise ratio (imaging); Algorithm; Bit error rate; Computer science; Channel (broadcasting); Fading distribution; Mathematics; Electronic engineering; Statistics; Telecommunications; Engineering","score_opus":0.029339880624989753,"score_gpt":0.25686927901513257,"score_spread":0.2275293983901428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045208106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48296702,0.00029128004,0.4992563,0.0024896082,0.00030488888,0.0004389583,2.1719353e-7,0.00031996603,0.013931759],"genre_scores_gemma":[0.9911802,0.00020429098,0.006960253,0.000413794,0.000044130582,0.00003787489,0.0000019684726,0.000008120728,0.001149356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989379,0.000110527166,0.00023874214,0.00028864818,0.00014718079,0.00027697659],"domain_scores_gemma":[0.99922836,0.00017227765,0.000047685597,0.00041510444,0.000045376182,0.00009121249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018569389,0.00012950363,0.00016956202,0.00014968266,0.00020514205,0.0004440737,0.0007331365,0.00005473033,0.00049538293],"category_scores_gemma":[0.00003279336,0.000113383154,0.0000308681,0.00032370753,0.000027289121,0.00067801634,0.0008573063,0.00021627576,0.00024303274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015391797,0.00028449346,0.018311495,0.000048259888,0.0000879439,0.000015127111,0.012302733,0.0013992902,0.09167105,0.1956798,0.0058161905,0.6743682],"study_design_scores_gemma":[0.00081911316,0.000040490508,0.006318976,0.000115238865,0.0000035220692,0.000012621584,0.000038268612,0.9853003,0.0033427705,0.00207205,0.0014636678,0.00047300148],"about_ca_topic_score_codex":0.000029649784,"about_ca_topic_score_gemma":0.000004740491,"teacher_disagreement_score":0.98390096,"about_ca_system_score_codex":0.000036275367,"about_ca_system_score_gemma":0.000012893406,"threshold_uncertainty_score":0.5424096},"labels":[],"label_agreement":null},{"id":"W2045587254","doi":"10.1109/iswcs.2010.5624364","title":"Outage analysis of opportunistic decode-and-forward relaying","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Outage probability; Computer science; Probability density function; Hop (telecommunications); Expression (computer science); Signal-to-noise ratio (imaging); Transmission (telecommunications); Relay; Function (biology); Topology (electrical circuits); Computer network; Electronic engineering; Telecommunications; Algorithm; Decoding methods; Fading; Statistics; Mathematics; Electrical engineering; Engineering; Power (physics); Physics","score_opus":0.03627547314586514,"score_gpt":0.29588645822240345,"score_spread":0.2596109850765383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045587254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10563189,0.00006361431,0.8707491,0.0008808418,0.00011233266,0.000055295728,0.0000012882035,0.00008303107,0.022422597],"genre_scores_gemma":[0.9629416,0.00014398394,0.036114905,0.00022970593,0.0000059270055,0.0000024566884,0.0000026472396,0.0000022667873,0.0005565269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999435,0.000036263893,0.00018543235,0.00015620959,0.00009407695,0.0000930373],"domain_scores_gemma":[0.99899626,0.00015208988,0.0000652025,0.0006325843,0.000082175655,0.00007171365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003479343,0.00005924055,0.00015461972,0.00018757058,0.00009564847,0.000054507695,0.0005091849,0.000028983806,0.0001510782],"category_scores_gemma":[0.00007833489,0.000050273393,0.00005863947,0.00070502725,0.000043670185,0.0001475532,0.0003430171,0.00012343383,0.0000052313335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011981931,0.000027412569,0.012393718,0.0000030453539,0.00017275398,0.0000017238957,0.00058673753,0.000054831035,0.007553432,0.8532169,0.00017023196,0.12581803],"study_design_scores_gemma":[0.00012605691,0.000019844616,0.02947049,0.0000049010387,0.00011524978,0.0000026289788,0.000032680666,0.96266735,0.0004923531,0.00056722405,0.0063505825,0.00015063696],"about_ca_topic_score_codex":0.000007102042,"about_ca_topic_score_gemma":0.00021620846,"teacher_disagreement_score":0.9626125,"about_ca_system_score_codex":0.0000042008232,"about_ca_system_score_gemma":0.000023956116,"threshold_uncertainty_score":0.20500895},"labels":[],"label_agreement":null},{"id":"W2045761076","doi":"10.1109/glocom.2006.822","title":"WLC35-6: Relay-Assisted Spatial Multiplexing in Wireless Fixed Relay Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Spatial multiplexing; Computer science; MIMO; Multiplexing; Computer network; Wireless; Antenna diversity; Diversity gain; Decoding methods; Electronic engineering; Telecommunications; Power (physics); Channel (broadcasting); Engineering","score_opus":0.019401949209997955,"score_gpt":0.2464339209211083,"score_spread":0.22703197171111034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045761076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1093398,0.00096492073,0.87818474,0.0019680492,0.0007809967,0.00030709105,0.0000021770109,0.00038407271,0.008068134],"genre_scores_gemma":[0.9866971,0.00013155394,0.012190699,0.0003271459,0.00016192383,0.000025968553,0.000025736746,0.000014106177,0.00042580135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982275,0.00028160622,0.00045846382,0.00042027113,0.00019579516,0.0004164005],"domain_scores_gemma":[0.9986346,0.00020456866,0.00013695878,0.00086699205,0.00008435795,0.00007254627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040899016,0.0001953755,0.0002435982,0.0001222485,0.0002570312,0.00019440566,0.0010840241,0.00011917875,0.000044151806],"category_scores_gemma":[0.000034665252,0.00020051713,0.00007918907,0.00079725595,0.000049161856,0.0003165269,0.00054572674,0.00038070965,0.000056097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006198224,0.00064972206,0.07110257,0.000019085182,0.00003799543,0.00013583833,0.00082066946,0.10399887,0.0025990666,0.10395635,0.0187315,0.69788635],"study_design_scores_gemma":[0.00081610575,0.00002401884,0.13929573,0.00007359032,0.0000023677558,0.000010468239,0.00000878753,0.8492877,0.00016417552,0.00013157277,0.009910253,0.00027524526],"about_ca_topic_score_codex":0.00054641295,"about_ca_topic_score_gemma":0.005216967,"teacher_disagreement_score":0.87735724,"about_ca_system_score_codex":0.00015678773,"about_ca_system_score_gemma":0.00005371111,"threshold_uncertainty_score":0.81768507},"labels":[],"label_agreement":null},{"id":"W2046038780","doi":"10.1109/icuwb.2015.7324411","title":"A Set Cover Based Efficient Solution for the Complementary Index Coding Problem","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pfizer (Canada); University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Network packet; Coding (social sciences); Relay; Channel state information; Optimization problem; Set cover problem; Mathematical optimization; Wireless; Algorithm; Set (abstract data type); Computer network; Mathematics; Telecommunications","score_opus":0.13004331363751498,"score_gpt":0.3242830064190353,"score_spread":0.1942396927815203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046038780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024367082,0.00011889926,0.9870694,0.009317616,0.00014828864,0.00049847434,0.0000029319767,0.00009395016,0.0025067576],"genre_scores_gemma":[0.96171016,0.000008586215,0.03548494,0.0024638579,0.000033984215,0.00007896311,0.000011397513,0.0000043721507,0.00020371652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992356,0.00008870207,0.00015368496,0.00016526265,0.0001793158,0.00017744103],"domain_scores_gemma":[0.99896425,0.00029173755,0.00005192914,0.00045698712,0.00017423647,0.000060839222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006657698,0.00007783092,0.00007271514,0.000037601065,0.00032838192,0.00013397224,0.0007094997,0.000016436717,0.000037124217],"category_scores_gemma":[0.000025846339,0.000052347645,0.000038583657,0.00023809244,0.00003167278,0.00010525839,0.0003225814,0.000069897724,0.0000215828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007486502,0.0001948338,0.0012377767,0.0000228865,0.00006348238,9.637845e-7,0.0048598275,0.12994716,0.00080201257,0.4757527,0.2967195,0.090324],"study_design_scores_gemma":[0.00065709953,0.00004062377,0.00018336771,0.000009737519,0.0000030987478,8.798111e-7,0.00006059516,0.91119456,0.00015204016,0.00015782237,0.087464,0.00007619986],"about_ca_topic_score_codex":0.000016459544,"about_ca_topic_score_gemma":0.00005437557,"teacher_disagreement_score":0.9614665,"about_ca_system_score_codex":0.00006244446,"about_ca_system_score_gemma":0.0000996801,"threshold_uncertainty_score":0.25256813},"labels":[],"label_agreement":null},{"id":"W2046267420","doi":"10.1109/bsc.2010.5472941","title":"A survey of physical-layer network coding in wireless networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Computer science; Computer network; Physical layer; Wireless network; Relay; Wireless; Network architecture; Layer (electronics); Data link layer; Network layer; Coding (social sciences); Distributed computing; Telecommunications","score_opus":0.048807296409222246,"score_gpt":0.29941437340406407,"score_spread":0.2506070769948418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046267420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42503998,0.000081814935,0.5663987,0.00023549318,0.0004032249,0.00017193334,4.6340952e-7,0.00009917534,0.007569279],"genre_scores_gemma":[0.9970501,0.00008641236,0.0025230795,0.00016161634,0.000076312,0.000008221981,0.0000027960868,0.0000064840187,0.00008498669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998944,0.00022546022,0.00023783692,0.00021919186,0.000121888086,0.00025166234],"domain_scores_gemma":[0.9984123,0.0005841205,0.00008334172,0.000716329,0.0001458911,0.000057977177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009245352,0.00010509117,0.00021602806,0.000054199998,0.00007839643,0.000058693186,0.0009938929,0.000050719827,0.000026557003],"category_scores_gemma":[0.000057528418,0.00009289368,0.000039083643,0.0010675617,0.00005179546,0.00020883715,0.00047470175,0.00036735402,0.000007389328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010518261,0.00017536999,0.1414829,0.000005682286,0.000016956528,0.0000025366487,0.0005848274,0.007678178,0.006069248,0.6774512,0.0016190588,0.1649035],"study_design_scores_gemma":[0.0001519226,0.000015430569,0.1977265,0.000017745982,6.656939e-7,5.689544e-7,0.0000017046273,0.8013533,0.00035252856,0.0001477209,0.00013097104,0.000100986406],"about_ca_topic_score_codex":0.00009210753,"about_ca_topic_score_gemma":0.004513559,"teacher_disagreement_score":0.79367507,"about_ca_system_score_codex":0.000010083334,"about_ca_system_score_gemma":0.000039035014,"threshold_uncertainty_score":0.37880942},"labels":[],"label_agreement":null},{"id":"W2046524818","doi":"10.1109/icc.2010.5501840","title":"A Linear Algebraic Approach for Loss Tomography in Mesh Topologies Using Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Estimator; Network topology; Network tomography; Packet loss; Linear network coding; Algorithm; Mesh networking; Polygon mesh; Computer science; Algebraic number; Topology (electrical circuits); Upper and lower bounds; Coding (social sciences); Mathematics; Network packet; Mathematical optimization; Statistics; Telecommunications; Computer network","score_opus":0.05687449185443908,"score_gpt":0.30891323814361665,"score_spread":0.25203874628917755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046524818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023815008,0.00017411857,0.97197247,0.0005030499,0.00029548453,0.00029815297,4.1608763e-7,0.000165698,0.0027756086],"genre_scores_gemma":[0.5236817,0.000056267643,0.47580537,0.00029383766,0.000095499556,0.000025864925,0.0000022205209,0.0000051846696,0.0000340422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989867,0.000060098722,0.00022849918,0.00029926084,0.00009231001,0.00033312783],"domain_scores_gemma":[0.99897313,0.00022804375,0.0000591062,0.00060077844,0.00008633971,0.00005257662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006201115,0.0001244033,0.00017283227,0.00012565669,0.0002501342,0.00012681335,0.0009658592,0.000077209916,0.000016340464],"category_scores_gemma":[0.00006595233,0.00011023913,0.000077755285,0.0008221566,0.000082467785,0.00029623814,0.00043517083,0.00026096223,0.0000015257093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007682918,0.00006866389,0.006029579,0.000011527391,0.000014526414,0.0000012877874,0.0004845696,0.0022045025,0.0018909258,0.9672337,0.00064224907,0.021410793],"study_design_scores_gemma":[0.00032494485,0.000026404468,0.0009087676,0.000013940366,0.0000027246938,0.00000776505,0.00004496419,0.9907394,0.00064196036,0.0046129734,0.002470514,0.00020561909],"about_ca_topic_score_codex":0.000008909459,"about_ca_topic_score_gemma":0.00012192543,"teacher_disagreement_score":0.9885349,"about_ca_system_score_codex":0.000015006204,"about_ca_system_score_gemma":0.000040740324,"threshold_uncertainty_score":0.44954214},"labels":[],"label_agreement":null},{"id":"W2046945194","doi":"10.1109/wcnc.2014.6952198","title":"Performance of spectrum-sharing constrained two-way relaying","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Cognitive radio; Interference (communication); Computer network; Transmission (telecommunications); Signal-to-noise ratio (imaging); Ergodic theory; Outage probability; Relay channel; Fading; Telecommunications; Topology (electrical circuits); Power (physics); Wireless; Mathematics; Channel (broadcasting); Engineering; Electrical engineering","score_opus":0.031272012316671774,"score_gpt":0.2625386398533988,"score_spread":0.23126662753672705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046945194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37931693,0.00007345198,0.41315693,0.000781321,0.00013598405,0.000073676485,8.5315015e-8,0.00015486011,0.20630679],"genre_scores_gemma":[0.97687817,0.000103958504,0.022357157,0.00020025787,0.000026764143,0.0000025697548,3.4328187e-7,0.0000033881354,0.00042740366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993602,0.0000432456,0.00019136663,0.00016537971,0.00010152318,0.00013827767],"domain_scores_gemma":[0.9991367,0.000093185205,0.00006576468,0.00061359216,0.00005110307,0.000039654074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000427906,0.00006883255,0.00010836097,0.00005682125,0.00012483806,0.000044705965,0.0008132514,0.000016368618,0.00007583005],"category_scores_gemma":[0.000033086326,0.000060903614,0.000029644427,0.00025549953,0.00004549695,0.00024815986,0.0003837322,0.00009629564,0.000030042147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027461865,0.00002190565,0.009862449,0.000010635365,0.000009005905,2.7128664e-7,0.00041655605,0.00079104496,0.006977844,0.80167055,0.00007640417,0.18016058],"study_design_scores_gemma":[0.0002738815,0.000053276766,0.003161622,0.00004949123,0.0000013731149,0.000005570991,0.000008521188,0.9834707,0.011146317,0.00048128626,0.0012421436,0.00010582256],"about_ca_topic_score_codex":0.000003406587,"about_ca_topic_score_gemma":0.000009578205,"teacher_disagreement_score":0.98267967,"about_ca_system_score_codex":0.000014220237,"about_ca_system_score_gemma":0.00001528243,"threshold_uncertainty_score":0.24835773},"labels":[],"label_agreement":null},{"id":"W2047359730","doi":"10.1109/icc.2010.5501919","title":"On the Detection of Distributed STBC AF Cooperative OFDM Signal in the Presence of Multiple CFOs","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Carrier frequency offset; Bit error rate; Algorithm; Interference (communication); Equalization (audio); Space–time block code; Block code; Minimum mean square error; Frequency domain; Channel (broadcasting); Computational complexity theory; Electronic engineering; Control theory (sociology); Telecommunications; Mathematics; Decoding methods; Engineering; Frequency offset; Statistics","score_opus":0.03349211381079194,"score_gpt":0.267645527064811,"score_spread":0.23415341325401906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047359730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45924538,0.000033306867,0.536358,0.0020953382,0.000100500074,0.00043448,0.0000057140965,0.000024846979,0.0017024422],"genre_scores_gemma":[0.99928004,0.000020364214,0.00048018454,0.00014787969,0.000009351178,0.000025163637,0.0000014165416,0.0000018652194,0.000033710618],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990625,0.0003442252,0.0001945571,0.00012571678,0.00017845587,0.00009458167],"domain_scores_gemma":[0.997427,0.0016711907,0.00008334309,0.00062323327,0.00017982228,0.000015447886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063449226,0.000069230235,0.00009053309,0.000035857673,0.000121382254,0.0000367167,0.0010871623,0.00002965748,0.00004703586],"category_scores_gemma":[0.0003747133,0.00003568345,0.000030178846,0.0005548613,0.00011604334,0.00012979918,0.00018039077,0.00027720394,0.0000036466104],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005041301,0.0003805172,0.0013234519,0.000006416687,0.000019411746,9.202758e-7,0.006072288,0.0020613514,0.4828456,0.46256906,0.0005260329,0.044144534],"study_design_scores_gemma":[0.0004413542,0.00021060793,0.016207706,0.000032124724,0.0000025694173,0.0000024516385,0.0004177513,0.6872629,0.2935025,0.0011215018,0.0006816971,0.00011687049],"about_ca_topic_score_codex":0.000032216205,"about_ca_topic_score_gemma":0.0011041067,"teacher_disagreement_score":0.6852015,"about_ca_system_score_codex":0.000007367227,"about_ca_system_score_gemma":0.000032348547,"threshold_uncertainty_score":0.20202361},"labels":[],"label_agreement":null},{"id":"W2047453076","doi":"10.1109/glocom.2011.6133662","title":"End-to-End Queueing Performance Evaluation for Multiuser Wireless Relay Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Relay; Computer network; Queueing theory; Relay channel; Automatic repeat request; Throughput; Network packet; Wireless network; Base station; Wireless; Real-time computing; Hybrid automatic repeat request; Telecommunications link; Telecommunications","score_opus":0.10277540718736244,"score_gpt":0.3062049686432852,"score_spread":0.20342956145592278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047453076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0712283,0.00012259178,0.91781074,0.00031785428,0.00034411272,0.0005725071,2.5370932e-7,0.00015693187,0.009446705],"genre_scores_gemma":[0.92064565,0.00015779758,0.07760978,0.00072639796,0.00006627922,0.00017469174,0.0000040655755,0.000010477834,0.0006048317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988491,0.00012657524,0.00024012181,0.00031243655,0.00020620608,0.00026557362],"domain_scores_gemma":[0.9986306,0.00013599716,0.00006920753,0.0007147091,0.00035445087,0.000095043804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011753195,0.00012468857,0.00012219432,0.00008570946,0.00031841855,0.000088125606,0.00087066845,0.0000528162,0.00019294638],"category_scores_gemma":[0.000044263674,0.00011133463,0.00004711767,0.00038450974,0.000022501385,0.00055221573,0.00032043757,0.00012189618,0.00004329494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017366785,0.00004953713,0.0013966935,0.000004336604,0.000015772404,2.4259603e-7,0.0027174426,0.004179426,0.00030334026,0.0546396,0.0012289486,0.9354473],"study_design_scores_gemma":[0.00033003464,0.000071455775,0.008858595,0.00003214956,0.000006041565,0.0000013568371,0.000022530696,0.98536634,0.0016527051,0.00005090181,0.0034356026,0.00017226464],"about_ca_topic_score_codex":0.000012944626,"about_ca_topic_score_gemma":0.0001207729,"teacher_disagreement_score":0.9811869,"about_ca_system_score_codex":0.00006444551,"about_ca_system_score_gemma":0.000057708337,"threshold_uncertainty_score":0.45400944},"labels":[],"label_agreement":null},{"id":"W2047562852","doi":"10.1109/vetecs.2010.5494038","title":"Outage Probability of Selection Cooperation with Channel Estimation Errors","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Channel (broadcasting); Selection (genetic algorithm); Computer science; Outage probability; Fading; Signal-to-noise ratio (imaging); Imperfect; Relay channel; Upper and lower bounds; Algorithm; Probability of error; Telecommunications; Mathematics; Artificial intelligence; Power (physics)","score_opus":0.028292857395033365,"score_gpt":0.26744538133420487,"score_spread":0.2391525239391715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047562852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16690488,0.0000046136056,0.8298992,0.0006904989,0.000074046286,0.00019219448,1.9318475e-7,0.00010861369,0.0021257475],"genre_scores_gemma":[0.88582295,0.000004773644,0.11392927,0.000059529484,0.000010882143,0.000016601942,0.0000031258946,0.000002870154,0.00015001056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943006,0.000055970726,0.00015375415,0.00016475267,0.00011148069,0.00008400677],"domain_scores_gemma":[0.9992079,0.00003595483,0.000070597765,0.00036062006,0.0002923622,0.000032577278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030416175,0.00006830625,0.00008065499,0.00005180622,0.00012508153,0.000051671064,0.000277969,0.0000345255,0.00005120471],"category_scores_gemma":[0.000056501794,0.00005212354,0.00001511389,0.00042074232,0.00004192119,0.00048165064,0.000068860194,0.00013406518,0.0000071463364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031132993,0.0003703298,0.003149971,0.000035069093,0.000024691817,3.5004794e-7,0.002905234,0.024039427,0.08441328,0.75031775,0.0003722487,0.1343405],"study_design_scores_gemma":[0.00017925604,0.000099647994,0.004210424,0.000008331641,0.0000022664658,0.0000051178877,0.000007128193,0.96893835,0.025417607,0.0008052514,0.00023605044,0.00009056928],"about_ca_topic_score_codex":0.000009785169,"about_ca_topic_score_gemma":0.0006347285,"teacher_disagreement_score":0.9448989,"about_ca_system_score_codex":0.000014175435,"about_ca_system_score_gemma":0.000059337075,"threshold_uncertainty_score":0.21255364},"labels":[],"label_agreement":null},{"id":"W2047677968","doi":"10.1016/s0304-3975(01)00256-0","title":"The impact of information on broadcasting time in linear radio networks","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Broadcasting (networking); Computer science; Computer network; Node (physics); Radio broadcasting; Range (aeronautics); Theoretical computer science; Telecommunications","score_opus":0.018276620666140598,"score_gpt":0.26989859452200543,"score_spread":0.2516219738558648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047677968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025387473,0.00009835657,0.9673006,0.0006583051,0.0001834478,0.00015359935,2.9722597e-7,0.000064362765,0.0061535523],"genre_scores_gemma":[0.9894935,0.00008749613,0.010231276,0.00013061806,0.00004155031,0.0000028905442,3.2367518e-7,0.000002442962,0.000009922029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865687,0.00017629481,0.00032069633,0.00018501114,0.00031932312,0.00034180123],"domain_scores_gemma":[0.9982645,0.0006623604,0.0000970311,0.0007289227,0.00015384206,0.000093377195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015617223,0.00010955475,0.00013158277,0.00014374217,0.00039546328,0.0002600825,0.0021083574,0.000029176712,0.000038819122],"category_scores_gemma":[0.00017856764,0.00006880631,0.000057917518,0.0015187416,0.00093911676,0.00071172457,0.00064147817,0.00023631843,0.0000691705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063803523,0.000036601028,0.00008390753,7.925748e-7,0.000002459539,6.766022e-7,0.0006545892,0.052440543,0.000043646727,0.6454669,0.00022168893,0.30104178],"study_design_scores_gemma":[0.0001478053,0.00017984943,0.0024015696,0.000033604723,4.490864e-7,0.000005747902,0.0000014124818,0.99503285,0.00007602978,0.0019641526,0.00007251362,0.00008402482],"about_ca_topic_score_codex":0.0000016923832,"about_ca_topic_score_gemma":3.2566896e-7,"teacher_disagreement_score":0.964106,"about_ca_system_score_codex":0.00008182577,"about_ca_system_score_gemma":0.000034952773,"threshold_uncertainty_score":0.39178875},"labels":[],"label_agreement":null},{"id":"W2047762025","doi":"10.1109/ccece.2008.4564496","title":"Performance analysis of distributed Alamouti&amp;#x2019;s code for cooperative diversity networks","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bit error rate; Rayleigh fading; Quadrature amplitude modulation; Maximal-ratio combining; QAM; Computer science; Cooperative diversity; Diversity combining; Expression (computer science); Modulation (music); Antenna diversity; Algorithm; Truncation (statistics); Fading; Mathematics; Electronic engineering; Telecommunications; Physics; Engineering; Decoding methods; Antenna (radio)","score_opus":0.04054784301080097,"score_gpt":0.22323311411619745,"score_spread":0.18268527110539648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047762025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18966046,0.00008808375,0.8092337,0.0003515885,0.00007565262,0.00025697192,0.00003160409,0.00009356177,0.00020833565],"genre_scores_gemma":[0.99271405,0.00072995614,0.0061817416,0.0001923645,0.000044320004,0.000033609947,0.000041281415,0.000009679989,0.00005298873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983669,0.000017843859,0.00032724434,0.00052544294,0.00020161168,0.00056097057],"domain_scores_gemma":[0.99824524,0.00012995466,0.00011548901,0.00025546635,0.00082032644,0.00043353045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018935213,0.00029063283,0.00051267893,0.0005407402,0.00059244793,0.00015556347,0.0009285172,0.00012377235,0.000015732863],"category_scores_gemma":[0.000050891198,0.00029063426,0.000102537466,0.0016612797,0.00009423689,0.00034111572,0.00032394577,0.00032329853,0.0000015856846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115728995,0.0002498876,0.07665174,0.00012736983,0.0016300877,0.000007354131,0.0067475946,0.06564551,0.0010528435,0.7520911,0.0019610692,0.09371969],"study_design_scores_gemma":[0.0002620994,0.00020694808,0.041625533,0.000049052793,0.000059199207,0.000007737508,0.0000061522055,0.95605046,0.00006178324,0.000031834297,0.0013087251,0.000330451],"about_ca_topic_score_codex":0.000195951,"about_ca_topic_score_gemma":0.0010872874,"teacher_disagreement_score":0.890405,"about_ca_system_score_codex":0.00013799306,"about_ca_system_score_gemma":0.00027082828,"threshold_uncertainty_score":0.9999546},"labels":[],"label_agreement":null},{"id":"W2048042797","doi":"10.1109/bsc.2010.5472960","title":"Impact of imperfect channel estimation on the performance of inter-vehicular cooperative networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rayleigh fading; Channel (broadcasting); Phase-shift keying; Bit error rate; Computer science; Imperfect; Transmission (telecommunications); Fading; Modulation (music); Expression (computer science); Telecommunications; Electronic engineering; Algorithm; Engineering","score_opus":0.021728511393477,"score_gpt":0.28361215086834773,"score_spread":0.26188363947487076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048042797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73763365,0.000024713803,0.2605305,0.00030017737,0.00010507408,0.00016006564,4.4193882e-7,0.000026787893,0.0012185946],"genre_scores_gemma":[0.99854064,0.0001115502,0.0011575442,0.00009669481,0.000021260556,0.000012622938,0.0000020716825,0.0000046549694,0.000052931773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992714,0.00012069696,0.00022552894,0.00014072492,0.00011349721,0.00012815613],"domain_scores_gemma":[0.9986284,0.00027595815,0.00012632259,0.0007370519,0.0001976221,0.000034643388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049415877,0.00011109554,0.00014900671,0.000058651698,0.00012926658,0.00003973312,0.0008059566,0.000044185494,0.0000754294],"category_scores_gemma":[0.00007928912,0.000062269646,0.00008594273,0.0004042959,0.00009345504,0.00023732924,0.00021774619,0.0002828049,0.000007334884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099002085,0.0005478071,0.005855189,0.000021745904,0.00024211082,9.635046e-7,0.0042830524,0.4444523,0.05657097,0.2846665,0.0027619572,0.20049842],"study_design_scores_gemma":[0.00012385465,0.00037981602,0.0069729094,0.000034381137,0.0000023440211,0.000002346324,0.0000076010588,0.9797711,0.01259387,0.000024014598,0.00001578935,0.00007197246],"about_ca_topic_score_codex":0.000010638225,"about_ca_topic_score_gemma":0.000018279146,"teacher_disagreement_score":0.5353188,"about_ca_system_score_codex":0.000016633909,"about_ca_system_score_gemma":0.00005053404,"threshold_uncertainty_score":0.25392824},"labels":[],"label_agreement":null},{"id":"W2048048782","doi":"10.48550/arxiv.1305.4905","title":"A Graph Minor Perspective to Multicast Network Coding","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linear network coding; Conjecture; Discrete mathematics; Network topology; Computer science; Mathematics; Theoretical computer science; Algebraic number; Combinatorics; Finite field; Coding (social sciences); Topology (electrical circuits); Computer network","score_opus":0.11092338223359459,"score_gpt":0.22412140574091377,"score_spread":0.11319802350731918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048048782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051829696,0.00032229704,0.9348326,0.0010603196,0.0007667978,0.00075388985,0.000005180531,0.00039328204,0.010035951],"genre_scores_gemma":[0.98587734,0.00065612426,0.010817372,0.00054724474,0.00016806812,0.000006522522,0.0000052644373,0.000020448984,0.0019016188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768895,0.0003047245,0.00021961363,0.001179167,0.00009799873,0.0005095377],"domain_scores_gemma":[0.9967869,0.00020573282,0.00018135484,0.0019258747,0.0005721836,0.0003279392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027812904,0.0003648932,0.0003769768,0.0002860487,0.00041821203,0.00031217502,0.002996017,0.00019486393,0.000093204195],"category_scores_gemma":[0.00007604988,0.0004219185,0.0002213586,0.0012669553,0.00009928643,0.00034222548,0.0053861374,0.00071644445,0.00038248836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125341885,0.00006873934,0.0005606228,0.000013090122,0.0000973744,0.00004914527,0.0015139995,0.1624048,0.00003794952,0.82961714,0.0041214945,0.0015031304],"study_design_scores_gemma":[0.000532219,0.00008342299,0.002689655,0.0003102468,0.00005757017,0.0000054635925,0.00042833458,0.94557023,0.000043375512,0.045425236,0.0038241837,0.0010300755],"about_ca_topic_score_codex":0.00012406244,"about_ca_topic_score_gemma":0.00016556545,"teacher_disagreement_score":0.93404764,"about_ca_system_score_codex":0.00039227091,"about_ca_system_score_gemma":0.00013843464,"threshold_uncertainty_score":0.9998233},"labels":[],"label_agreement":null},{"id":"W2048154502","doi":"10.1109/wimob.2010.5645608","title":"A novel reduced complexity detection scheme for distributed single-carrier frequency domain equalization","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Equalization (audio); Minimum mean square error; Computer science; SC-FDE; Computational complexity theory; Transmission (telecommunications); Frequency domain; Bit error rate; Algorithm; Relay; Scheme (mathematics); Electronic engineering; Telecommunications; Mathematics; Decoding methods; Statistics; Engineering","score_opus":0.10056530065654057,"score_gpt":0.3074454021803659,"score_spread":0.20688010152382535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048154502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039298847,0.000013914666,0.95683783,0.0013776579,0.00041830313,0.0003208113,0.000014030251,0.00026949574,0.0014491125],"genre_scores_gemma":[0.66827345,0.0000025517074,0.33135977,0.00016782699,0.000061458915,0.000043543692,0.000047478545,0.0000064962596,0.000037409573],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999048,0.00005642856,0.00025456055,0.0002955422,0.00013536956,0.00021009434],"domain_scores_gemma":[0.99869347,0.00011632979,0.00010292126,0.0006605782,0.00033944313,0.00008725415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038591377,0.00012202977,0.000121246296,0.0000656906,0.00040582372,0.0001939574,0.00061117497,0.00007920027,0.00005402422],"category_scores_gemma":[0.00022762865,0.00011664352,0.00005977076,0.0005071258,0.000069389935,0.00041329116,0.00017999335,0.00016661278,0.000006468439],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030908154,0.000049376413,0.000028887502,0.0000023116318,0.000004846682,4.9320192e-8,0.00012282659,0.0000021710914,0.64678425,0.34735215,0.00007803303,0.005572033],"study_design_scores_gemma":[0.0030909148,0.00031569332,0.0049621905,0.00004095289,0.000013883192,0.000036738646,0.00009700937,0.54309857,0.31844774,0.10085043,0.028002515,0.001043349],"about_ca_topic_score_codex":0.000011397012,"about_ca_topic_score_gemma":0.0006129182,"teacher_disagreement_score":0.6289746,"about_ca_system_score_codex":0.000055880966,"about_ca_system_score_gemma":0.000047330053,"threshold_uncertainty_score":0.47565848},"labels":[],"label_agreement":null},{"id":"W2048207823","doi":"10.1109/ciss.2009.5054801","title":"Low-complexity cooperation with correlated sources: Diversity order analysis","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Relay; Cooperative diversity; Coding (social sciences); Diversity (politics); Algorithm; Theoretical computer science; Wireless; Diversity gain; Topology (electrical circuits); Decoding methods; Mathematics; Fading; Telecommunications; Physics; Statistics","score_opus":0.037891555796561026,"score_gpt":0.25231103107213704,"score_spread":0.214419475275576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048207823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10789152,0.000036146474,0.8834104,0.0013119358,0.00002233219,0.000089381,3.536134e-7,0.00021818235,0.0070197615],"genre_scores_gemma":[0.98013854,0.000039565475,0.017604366,0.0013877803,0.000009262419,0.0000011034992,0.000013288909,0.0000017403596,0.0008043523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918914,0.000103525956,0.00013054829,0.0002541383,0.00017242208,0.00015023636],"domain_scores_gemma":[0.99893194,0.000035505775,0.000053141288,0.0005928015,0.00031478034,0.00007183789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016619271,0.000104316576,0.00014997052,0.00013050144,0.0006610469,0.00016638513,0.00069187884,0.00003335219,0.00021880603],"category_scores_gemma":[0.000014500549,0.00007975652,0.00004265584,0.0024909799,0.000045450113,0.00040512116,0.00032828617,0.00011767723,0.000036901776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085244756,0.00087290496,0.05699517,0.0000058846044,0.00067226915,0.000019847814,0.008881935,0.061305515,0.0010236704,0.7659251,0.003175789,0.101036645],"study_design_scores_gemma":[0.0005783492,0.00016286968,0.10551057,0.000010708267,0.00008954769,0.0000032990577,0.00004266194,0.8918912,0.00036523366,0.0004973747,0.0005328972,0.0003152804],"about_ca_topic_score_codex":0.000020313983,"about_ca_topic_score_gemma":0.0003416939,"teacher_disagreement_score":0.87224704,"about_ca_system_score_codex":0.000035049055,"about_ca_system_score_gemma":0.000027241787,"threshold_uncertainty_score":0.5084305},"labels":[],"label_agreement":null},{"id":"W2049483782","doi":"10.1109/tvt.2012.2185964","title":"Impact of Channel Estimation Error on the Performance of Amplify-and-Forward Two-Way Relaying","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Bit error rate; Computer science; Signal-to-noise ratio (imaging); Channel state information; Imperfect; Channel (broadcasting); Interference (communication); Algorithm; Control theory (sociology); Power (physics); Telecommunications; Wireless","score_opus":0.03308982267103588,"score_gpt":0.2943612709442491,"score_spread":0.2612714482732132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049483782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5534181,0.00011178152,0.44556096,0.000599963,0.00006877643,0.000118772135,0.0000014973074,0.000065424974,0.000054753218],"genre_scores_gemma":[0.99697655,0.00024294417,0.0026676122,0.00004556515,0.000005937517,0.00003892967,5.4864387e-7,0.000007541797,0.000014352603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922967,0.00008079182,0.00022406285,0.00014380035,0.00012960557,0.00019208489],"domain_scores_gemma":[0.9989364,0.00013541804,0.00012547818,0.00068414357,0.000084154526,0.000034379464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033458258,0.00011869964,0.00016797699,0.00028454105,0.00022273597,0.000010529187,0.00047111628,0.000103924765,0.000011722128],"category_scores_gemma":[0.000014459749,0.000084195635,0.000076827695,0.0006394711,0.00014684742,0.00020839636,0.000011634305,0.00034999833,0.0000112317975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008901158,0.0009710939,0.0016257412,0.000059282756,0.00034982015,0.0000011017721,0.0028118712,0.32788587,0.058100984,0.07876747,0.00007470871,0.529263],"study_design_scores_gemma":[0.0004459582,0.0006408877,0.0028659885,0.00012459484,0.000026882813,0.000031196894,0.00006179879,0.85289925,0.14238116,0.00026014922,0.00007551911,0.00018662466],"about_ca_topic_score_codex":0.0000058539404,"about_ca_topic_score_gemma":0.0000029885625,"teacher_disagreement_score":0.5290764,"about_ca_system_score_codex":0.00004663876,"about_ca_system_score_gemma":0.00002229347,"threshold_uncertainty_score":0.34333983},"labels":[],"label_agreement":null},{"id":"W2049685192","doi":"10.1145/1998476.1998484","title":"MAC design for analog network coding","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Air Force Office of Scientific Research; Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Computer science; Linear network coding; Coding (social sciences); Computer network; Mathematics","score_opus":0.1925076385964771,"score_gpt":0.2977560486081562,"score_spread":0.10524841001167909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049685192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041269373,0.00020124154,0.9712612,0.00025226112,0.00017078116,0.0001870991,1.2341086e-7,0.00015568396,0.02773036],"genre_scores_gemma":[0.3828817,0.0001658943,0.61521447,0.0008589458,0.000059975104,0.000035611207,7.726879e-7,0.000004886402,0.00077776535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993611,0.00008111573,0.00012943723,0.00016944876,0.000054288812,0.00020463212],"domain_scores_gemma":[0.99919474,0.0001795312,0.000037313523,0.0004519487,0.00008310619,0.000053369844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045936301,0.000071377166,0.00008552744,0.000030610223,0.00022460544,0.000058924405,0.0007791775,0.000024644676,0.00010740672],"category_scores_gemma":[0.00002498618,0.00006183967,0.000039469538,0.00026205977,0.00001796535,0.00019671906,0.00020908348,0.000052257983,0.000029949488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059849167,0.000017858236,0.00017879638,0.0000015891032,0.00001101171,6.3828674e-7,0.00044061884,0.00019715924,0.00010146758,0.9207629,0.021300212,0.056981754],"study_design_scores_gemma":[0.00046444908,0.00017909396,0.0018875622,0.000029167339,0.000007680741,0.000005848731,0.000021246819,0.92137074,0.0030954482,0.032910947,0.03967579,0.00035204197],"about_ca_topic_score_codex":0.000001818605,"about_ca_topic_score_gemma":0.000010795508,"teacher_disagreement_score":0.9211736,"about_ca_system_score_codex":0.0000140852635,"about_ca_system_score_gemma":0.000025053112,"threshold_uncertainty_score":0.25217488},"labels":[],"label_agreement":null},{"id":"W2049933019","doi":"10.1109/isit.2007.4557187","title":"On the Maximum Achievable Rates in Wireless Multicast Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Xcast; Linear network coding; Wireless network; Decoding methods; Channel state information; Distributed computing; Wireless; Algorithm; Telecommunications","score_opus":0.03627694956677589,"score_gpt":0.2900153119234476,"score_spread":0.2537383623566717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049933019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057947937,0.000091471746,0.89902216,0.0044122227,0.00015436969,0.00017407608,6.219463e-8,0.00009116726,0.03810654],"genre_scores_gemma":[0.9949408,0.000121500234,0.0021278758,0.0023232952,0.00002620271,0.0000067595915,5.6417014e-7,0.000004440376,0.0004485596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919105,0.00011183057,0.00016726463,0.00017287012,0.000105950625,0.00025102284],"domain_scores_gemma":[0.99843067,0.0008364919,0.000030356921,0.0006180461,0.000041523574,0.000042902982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010093558,0.00008595397,0.00008044915,0.000056925524,0.00017618513,0.00011838167,0.0009250126,0.000033459208,0.00007221452],"category_scores_gemma":[0.0000397806,0.000054319135,0.000024462503,0.0005509464,0.000037985217,0.00013025866,0.00029262618,0.00023698823,0.00005690191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000813641,0.00006646273,0.00078459695,5.7863366e-7,0.0000034428922,0.0000043337873,0.00023294284,0.0009232196,0.00018386057,0.9035883,0.0011336261,0.0930705],"study_design_scores_gemma":[0.00026032666,0.000035978275,0.007919012,0.000029099392,6.172543e-7,0.0000022627662,0.000065605695,0.9864226,0.0010580301,0.0018541984,0.0022109835,0.00014129418],"about_ca_topic_score_codex":0.000009966232,"about_ca_topic_score_gemma":0.00036245087,"teacher_disagreement_score":0.9854994,"about_ca_system_score_codex":0.00003150624,"about_ca_system_score_gemma":0.0000128521515,"threshold_uncertainty_score":0.221507},"labels":[],"label_agreement":null},{"id":"W2050010835","doi":"10.1109/glocom.2012.6503101","title":"TCP VON: Joint congestion control and online network coding for wireless networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear network coding; Computer science; Computer network; TCP Vegas; TCP global synchronization; CUBIC TCP; Network packet; TCP acceleration; Zeta-TCP; TCP Friendly Rate Control; TCP Westwood plus; TCP tuning; Network congestion","score_opus":0.04985606812455381,"score_gpt":0.2804911608248529,"score_spread":0.2306350927002991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050010835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004805422,0.0021719337,0.98815715,0.0032926758,0.0005336741,0.00035088227,0.0000014122196,0.0001637824,0.0005230833],"genre_scores_gemma":[0.96916723,0.0009943709,0.026939753,0.0020112905,0.00062543317,0.000038874223,0.000010508535,0.000009861012,0.00020268986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989298,0.00012828274,0.00024728387,0.00020448821,0.000089542336,0.0004006008],"domain_scores_gemma":[0.99879754,0.00036957065,0.00009267146,0.0004503505,0.00013270999,0.00015713586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071765867,0.00013618264,0.00020816008,0.000034919056,0.00032735546,0.00013402232,0.00039190834,0.00006618907,0.000013984],"category_scores_gemma":[0.00005599563,0.000119468,0.00004612389,0.00020315625,0.000044936303,0.00043491327,0.00032538743,0.0001445048,0.0000034148156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024221397,0.000106546344,0.00486591,0.00001241634,0.00004649965,4.352634e-7,0.00027958173,0.0022477931,0.00039465915,0.66563034,0.015189506,0.3112021],"study_design_scores_gemma":[0.0007809895,0.000048284364,0.011268953,0.000042809494,0.0000106246,0.000008444266,0.000016501783,0.9770268,0.000031037875,0.00027885975,0.010298425,0.00018822122],"about_ca_topic_score_codex":0.0000020597754,"about_ca_topic_score_gemma":0.00002879369,"teacher_disagreement_score":0.97477907,"about_ca_system_score_codex":0.000029301826,"about_ca_system_score_gemma":0.000016285496,"threshold_uncertainty_score":0.4871764},"labels":[],"label_agreement":null},{"id":"W2050151257","doi":"10.4108/chinacom.2010.133","title":"Filter-and-forward beamforming for multiple multi-antenna relays","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Beamforming; Relay; Computer science; Antenna (radio); Transmission (telecommunications); Electronic engineering; Filter (signal processing); Telecommunications; Acoustics; Engineering; Physics; Power (physics)","score_opus":0.05557038966368142,"score_gpt":0.2899716627498672,"score_spread":0.23440127308618577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050151257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01039863,0.00006890863,0.9864636,0.0013332678,0.00037557125,0.0003192949,0.000001541005,0.00016210333,0.00087707205],"genre_scores_gemma":[0.5362486,0.000056582572,0.4621252,0.0004944025,0.00003609463,0.00006260549,0.000002512093,0.0000061173805,0.0009678477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993029,0.000019987649,0.00016966533,0.00023752592,0.000068740155,0.00020113384],"domain_scores_gemma":[0.99891293,0.0002797263,0.000045608296,0.0005642386,0.00010925097,0.000088242574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030247844,0.00009997993,0.000110375055,0.000056185756,0.00030089886,0.00012793593,0.0006282384,0.00004879477,0.000023460902],"category_scores_gemma":[0.00018538587,0.00008317517,0.00005167185,0.00012957079,0.000037775575,0.0003651855,0.00031391386,0.00017678944,0.000016877317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000141084265,0.00016004422,0.005023598,0.000022305509,0.00003557914,0.0000016291111,0.0027111918,0.000027320388,0.1606677,0.30558053,0.0025597683,0.5231962],"study_design_scores_gemma":[0.0005954896,0.000033815573,0.0010629173,0.00000929114,0.0000025393329,0.000006905636,0.00003136841,0.9272522,0.0031649824,0.00021473851,0.067465104,0.0001606994],"about_ca_topic_score_codex":0.000005390658,"about_ca_topic_score_gemma":0.00030417248,"teacher_disagreement_score":0.9272248,"about_ca_system_score_codex":0.00000748684,"about_ca_system_score_gemma":0.00001973411,"threshold_uncertainty_score":0.3391785},"labels":[],"label_agreement":null},{"id":"W2050198768","doi":"10.1155/2013/590872","title":"Mathematical and Numerical Modeling of Information Dissemination in Mobile Networks","year":2013,"lang":"en","type":"article","venue":"Journal of Applied Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Broadcasting (networking); Dissemination; Computer network; Channel (broadcasting); Wireless; Relay; Multipath propagation; Bandwidth (computing); Wireless network; Distributed computing; Telecommunications","score_opus":0.015661325992573957,"score_gpt":0.2627627746606429,"score_spread":0.24710144866806893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050198768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051889043,0.000104295774,0.9459238,0.00008335055,0.000021453878,0.0001725837,7.6798464e-8,0.000007762711,0.0017976027],"genre_scores_gemma":[0.8082268,0.0001971204,0.19152425,0.000023794626,0.000011146586,0.000011511058,3.3108466e-7,0.0000029456419,0.0000020822342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989606,0.000014498301,0.00069705927,0.000044758108,0.00018961084,0.000093475624],"domain_scores_gemma":[0.99898857,0.00023150061,0.000364662,0.00018506136,0.00018086346,0.00004934362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050564395,0.000074007825,0.00022972167,0.00013850965,0.000028675702,0.00007668694,0.0003180009,0.000043783475,0.000015261912],"category_scores_gemma":[0.000059683418,0.000058803682,0.000029929332,0.0002447183,0.000021513311,0.00061323494,0.00012739522,0.00016278496,0.00000456764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106572725,0.00037740718,0.000033993783,0.00021113938,0.000028654567,8.496856e-7,0.013746062,0.1468696,0.001306488,0.61016613,0.00024933912,0.22699969],"study_design_scores_gemma":[0.00015885968,0.00003217838,0.000043921216,0.00011526526,0.00000393717,0.000013942094,0.0003772456,0.9737678,0.00013887428,0.025272511,0.000019549156,0.00005587089],"about_ca_topic_score_codex":2.5414346e-7,"about_ca_topic_score_gemma":1.438019e-7,"teacher_disagreement_score":0.8268983,"about_ca_system_score_codex":0.000025666022,"about_ca_system_score_gemma":0.000018919685,"threshold_uncertainty_score":0.23979445},"labels":[],"label_agreement":null},{"id":"W2050244778","doi":"10.1109/wcnc.2010.5506435","title":"Channel Training and Estimation in Distributed Space-Time Coded Relay Networks with Multiple Transmit/Receive Antennas","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Transmitter; Computer science; Channel (broadcasting); MIMO; Relay channel; Training (meteorology); Coding (social sciences); Topology (electrical circuits); Computer network; Electronic engineering; Algorithm; Mathematics; Engineering; Statistics; Electrical engineering","score_opus":0.020723573002439148,"score_gpt":0.2400525262692505,"score_spread":0.21932895326681134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050244778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07022744,0.00007718773,0.9269734,0.00188135,0.00006335098,0.00022414119,0.0000022095342,0.00014311804,0.00040781233],"genre_scores_gemma":[0.9482167,0.000093267416,0.05140283,0.00012832784,0.0000155632,0.000021294125,0.000022487673,0.000008415228,0.00009114865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999084,0.000087655775,0.00018971808,0.00028850063,0.000105676736,0.0002444617],"domain_scores_gemma":[0.9991376,0.000252515,0.000060801754,0.00037215996,0.00008126136,0.00009566464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035314084,0.00014247253,0.00018542472,0.00008339466,0.0001697103,0.00013775681,0.00036295867,0.00007373401,0.000017266326],"category_scores_gemma":[0.000061344464,0.00011564451,0.00001976411,0.00052946,0.00007826816,0.00042689085,0.000091106114,0.00037053842,0.000004916736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028285064,0.0006572641,0.0135590825,0.000036787238,0.00015394861,0.00006928972,0.045579307,0.40220273,0.018579632,0.052656725,0.0011861161,0.46503627],"study_design_scores_gemma":[0.0008203919,0.000054352528,0.011515606,0.00004421901,0.0000029228179,0.000016115291,0.00006793122,0.9868472,0.00018140677,0.00008355357,0.00019516164,0.00017113567],"about_ca_topic_score_codex":0.000015931893,"about_ca_topic_score_gemma":0.0010298314,"teacher_disagreement_score":0.87798923,"about_ca_system_score_codex":0.000016244263,"about_ca_system_score_gemma":0.000033694385,"threshold_uncertainty_score":0.47158462},"labels":[],"label_agreement":null},{"id":"W2050313358","doi":"10.1145/2379790.2379798","title":"Algorithms for stochastic optimization of multicast content delivery with network coding","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Multicast; Mathematical optimization; Probabilistic logic; Service provider; Optimization problem; Linear network coding; Content delivery network; Stochastic optimization; Approximation algorithm; Heuristics; Provisioning; Distributed computing; Computer network; Service (business); Algorithm; Artificial intelligence","score_opus":0.08668518469541037,"score_gpt":0.3061312561095786,"score_spread":0.21944607141416822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050313358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003755388,0.00093348883,0.99618983,0.0010477764,0.000070899136,0.0011291951,0.000020638885,0.00015675824,0.00007588444],"genre_scores_gemma":[0.49473318,0.0005752102,0.50420195,0.000082908926,0.000042421485,0.00031075126,0.000027486285,0.0000133902595,0.000012731171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986236,0.00013890355,0.0004551003,0.0002858733,0.00015649459,0.00034003117],"domain_scores_gemma":[0.99480623,0.0021429106,0.00025030234,0.0022028591,0.00043166953,0.00016605151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004711542,0.00020419419,0.0002567651,0.00014870899,0.001194157,0.00007565589,0.0014310948,0.000071071125,0.000005502773],"category_scores_gemma":[0.000041373627,0.00019433045,0.0000746224,0.0006597595,0.00024597702,0.00032925696,0.00016219588,0.00025380618,0.0000037308887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023346258,0.0008196095,0.00019950703,0.000030805124,0.00013712753,3.9523936e-8,0.0016446626,0.24124824,0.00040146962,0.02569279,0.000030570834,0.72977185],"study_design_scores_gemma":[0.00075190875,0.000095191164,0.00044668512,0.00010333714,0.00005914519,0.00000836385,0.0001999041,0.9964414,0.00016341878,0.00009261613,0.0013998387,0.0002381563],"about_ca_topic_score_codex":0.0000100682555,"about_ca_topic_score_gemma":0.000013303619,"teacher_disagreement_score":0.7551932,"about_ca_system_score_codex":0.00005057885,"about_ca_system_score_gemma":0.00005279109,"threshold_uncertainty_score":0.91846114},"labels":[],"label_agreement":null},{"id":"W2050717811","doi":"10.1109/icuwb.2015.7324493","title":"Outage Minimization for Asymmetric Bi-Directional Relaying with Individual Peak-Power Limits","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Relay; Term (time); Minification; Computer science; Limit (mathematics); Node (physics); Channel (broadcasting); Mathematical optimization; Power (physics); Outage probability; Topology (electrical circuits); Computer network; Mathematics; Engineering; Electrical engineering; Physics","score_opus":0.09391641523175595,"score_gpt":0.2954145027058758,"score_spread":0.20149808747411987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050717811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021563708,0.00028009264,0.97014,0.0013774913,0.00026767777,0.00023651615,0.0000018105786,0.0002235761,0.025316458],"genre_scores_gemma":[0.7831634,0.000033600172,0.21418971,0.0006717411,0.000045870715,0.000044589964,0.000017421955,0.00001063085,0.0018230017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990593,0.00007732486,0.00016693765,0.00025147863,0.00027267958,0.00017224562],"domain_scores_gemma":[0.9988497,0.00022035353,0.00007535344,0.00035866402,0.00038540983,0.00011052896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042695398,0.0001052928,0.00010464041,0.00022492738,0.00020875735,0.00021064375,0.00054929755,0.00004232788,0.000015140574],"category_scores_gemma":[0.00020526155,0.000084722415,0.000030471125,0.0010594273,0.00002351855,0.0005011908,0.0001669711,0.000091099355,0.00002045207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012185011,0.0005315721,0.013207489,0.00001733325,0.00020785976,0.0000060793277,0.0102723185,0.0058616726,0.00024371305,0.52962375,0.09249536,0.34741098],"study_design_scores_gemma":[0.0065827533,0.0017768443,0.033568174,0.00011599058,0.000059742935,0.00009317127,0.0011098727,0.56260955,0.0031130512,0.0020780298,0.38732627,0.0015665306],"about_ca_topic_score_codex":0.0000020430264,"about_ca_topic_score_gemma":0.000022327435,"teacher_disagreement_score":0.78100705,"about_ca_system_score_codex":0.000050235616,"about_ca_system_score_gemma":0.00012563482,"threshold_uncertainty_score":0.34548798},"labels":[],"label_agreement":null},{"id":"W2050871633","doi":"10.1109/wcnc.2010.5506565","title":"Performance of a Cooperative Network Using Rate Adaptation and Cooperative Combining","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Quadrature amplitude modulation; Maximal-ratio combining; Spectral efficiency; Signal-to-noise ratio (imaging); Computer science; Probability density function; QAM; Bit error rate; Algorithm; Mathematics; Statistics; Topology (electrical circuits); Telecommunications; Decoding methods; Fading; Combinatorics","score_opus":0.05440620136305164,"score_gpt":0.28021584747991757,"score_spread":0.22580964611686594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050871633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78778374,0.00012202489,0.20801803,0.00019202968,0.0002115625,0.0001792954,4.7055562e-7,0.000058719867,0.0034341414],"genre_scores_gemma":[0.9397318,0.00023210363,0.05962966,0.00022435829,0.00003689452,0.0000075767653,0.0000020516027,0.0000064234832,0.0001291789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990451,0.0001767782,0.00026183185,0.00023183668,0.000101903635,0.00018255797],"domain_scores_gemma":[0.99884516,0.00021235844,0.00011590643,0.0003725473,0.00038829134,0.00006575235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005646307,0.00012965087,0.00019011043,0.00005573611,0.00037736446,0.000106870706,0.00037132044,0.000047899543,0.00003859081],"category_scores_gemma":[0.00006226211,0.00011253422,0.000020164322,0.00051791914,0.00013168248,0.0006525354,0.00031379607,0.00019141493,0.0000039855668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055189947,0.00011473227,0.007380295,0.000024770932,0.00007825683,0.000002330652,0.010254535,0.07572371,0.15037516,0.6835272,0.00032431263,0.07213953],"study_design_scores_gemma":[0.00032932157,0.00011334676,0.0026014869,0.000038192375,0.000004339231,0.000007783501,0.000088685345,0.99156815,0.0046372428,0.000059564514,0.00040620306,0.00014570782],"about_ca_topic_score_codex":0.000009018986,"about_ca_topic_score_gemma":0.00010301491,"teacher_disagreement_score":0.91584444,"about_ca_system_score_codex":0.000011080316,"about_ca_system_score_gemma":0.000102567785,"threshold_uncertainty_score":0.45890123},"labels":[],"label_agreement":null},{"id":"W2051151132","doi":"10.1109/twc.2015.2403371","title":"Joint Spectrum Sharing and Power Allocation for OFDM-Based Two-Way Relaying","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Relay; Computer science; Transmitter power output; Mathematical optimization; Transceiver; Power (physics); Iterative method; Orthogonal frequency-division multiplexing; Constraint (computer-aided design); Optimization problem; Wireless; Algorithm; Mathematics; Computer network; Telecommunications; Channel (broadcasting); Transmitter","score_opus":0.09544280986530218,"score_gpt":0.308653503294535,"score_spread":0.21321069342923282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051151132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007967253,0.00037979474,0.97753066,0.011881459,0.00024443262,0.000510394,0.00000764253,0.00030865407,0.0011696834],"genre_scores_gemma":[0.95465946,0.00041741744,0.0438343,0.00053284667,0.000014600776,0.0003308044,0.000011294525,0.00002565228,0.00017362741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852204,0.00020308858,0.00040498862,0.00039740352,0.00020429146,0.0002681962],"domain_scores_gemma":[0.9961545,0.00034182216,0.00014085864,0.0028893775,0.0002791889,0.00019423904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006975832,0.00020330361,0.00021805533,0.0002608481,0.0009859334,0.0002539695,0.0016883124,0.000073088646,0.00000849631],"category_scores_gemma":[0.000022565871,0.00021935097,0.00009841902,0.0005695297,0.00014716388,0.0005079928,0.000050699007,0.00038943658,0.000022427477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013224395,0.0021498483,0.00031467868,0.00006730927,0.00027028855,0.000002281874,0.010438601,0.08989849,0.012743753,0.6123287,0.0011804749,0.27047333],"study_design_scores_gemma":[0.0014311299,0.00015482162,0.00013549539,0.00011349908,0.000024998006,0.00000834728,0.00016308542,0.98530954,0.007256111,0.0018470054,0.0032002062,0.00035575658],"about_ca_topic_score_codex":0.000028747836,"about_ca_topic_score_gemma":0.00031224164,"teacher_disagreement_score":0.9466922,"about_ca_system_score_codex":0.00018162976,"about_ca_system_score_gemma":0.00014245625,"threshold_uncertainty_score":0.8944873},"labels":[],"label_agreement":null},{"id":"W2051336893","doi":"10.1109/icc.2010.5501926","title":"Relay Selection and Max-Min Resource Allocation for Multi-Source OFDM-Based Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Orthogonal frequency-division multiplexing; Subcarrier; Computer science; Selection (genetic algorithm); Multiplexing; Resource allocation; Block (permutation group theory); Relay channel; Channel (broadcasting); Synchronization (alternating current); Computer network; Power (physics); Mathematical optimization; Telecommunications; Mathematics","score_opus":0.035124671701208095,"score_gpt":0.2841571001624159,"score_spread":0.24903242846120782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051336893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010898541,0.00006805784,0.98582166,0.002138788,0.00012659005,0.0003149203,2.3131156e-7,0.00023073332,0.00040048093],"genre_scores_gemma":[0.76896334,0.000036687914,0.22781886,0.0010652819,0.00008306181,0.00006169602,0.00001020569,0.000012314473,0.001948554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.0000954617,0.00019001387,0.00031337203,0.00009533423,0.00019540897],"domain_scores_gemma":[0.99896955,0.00024218996,0.000077664,0.00046039693,0.0001643186,0.000085901615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057601597,0.00011793688,0.00010723877,0.00007838818,0.000376286,0.00017703621,0.0004362937,0.00009686994,0.000019629684],"category_scores_gemma":[0.00009842377,0.00011024384,0.000037568123,0.00033091247,0.000037827493,0.00020939346,0.000135157,0.00024846694,0.0000043665136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054988417,0.0002423706,0.0023171213,0.000022030754,0.000034422683,4.202853e-7,0.0009929178,0.018821452,0.02713612,0.21839891,0.011089845,0.7208894],"study_design_scores_gemma":[0.0004974385,0.000046942747,0.0011719889,0.000009116345,0.000004183379,0.0000035746164,0.000010598416,0.9298594,0.0017949278,0.000018123754,0.06644699,0.0001367341],"about_ca_topic_score_codex":0.000007960559,"about_ca_topic_score_gemma":0.0005006629,"teacher_disagreement_score":0.9110379,"about_ca_system_score_codex":0.000021135487,"about_ca_system_score_gemma":0.000036452937,"threshold_uncertainty_score":0.44956133},"labels":[],"label_agreement":null},{"id":"W2051422158","doi":"10.1109/icc.2014.6884085","title":"Performance analysis of decode-and-forward dual-hop opportunistic relaying with power control","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Relay; Computer science; Fading; Power control; Multipath propagation; Transmission (telecommunications); Path loss; Hop (telecommunications); Computer network; Electronic engineering; Power (physics); Channel (broadcasting); Telecommunications; Wireless; Engineering","score_opus":0.020314403492963404,"score_gpt":0.24682023750762042,"score_spread":0.22650583401465701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051422158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14348772,0.000054900665,0.83886224,0.00050180475,0.000024761146,0.00006897376,6.563609e-7,0.000057501657,0.01694145],"genre_scores_gemma":[0.9890627,0.00015828472,0.009962834,0.0005003735,0.0000046470345,0.000003905371,0.0000019445174,0.0000040730065,0.00030121882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992004,0.00009360338,0.00021628058,0.00019990334,0.00015141445,0.00013838007],"domain_scores_gemma":[0.99882185,0.00022387372,0.000104882274,0.0006200097,0.00014991444,0.00007943742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005046085,0.00009343072,0.00024752074,0.00017742679,0.00013705333,0.00005344125,0.00034079628,0.000024177827,0.000063557614],"category_scores_gemma":[0.00004048002,0.00006823924,0.000043941698,0.00071061973,0.000059722643,0.00021740426,0.000152734,0.00007863209,0.0000048393817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007941342,0.00015739535,0.15759106,0.00003405492,0.0016810076,0.00000614942,0.003165597,0.010852843,0.0014951684,0.588873,0.00052363425,0.23554061],"study_design_scores_gemma":[0.0003289644,0.000110611676,0.030107066,0.000015140024,0.00010452371,0.0000037007876,0.000021656875,0.96811813,0.000044626133,0.000021601996,0.0010095526,0.00011440026],"about_ca_topic_score_codex":0.0000031529676,"about_ca_topic_score_gemma":0.000029071982,"teacher_disagreement_score":0.9572653,"about_ca_system_score_codex":0.000011471249,"about_ca_system_score_gemma":0.00002726832,"threshold_uncertainty_score":0.27827156},"labels":[],"label_agreement":null},{"id":"W2051499402","doi":"10.1109/wimob.2010.5644871","title":"Joint routing and relay selection in DAF multi-hop cooperative ad hoc networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Cooperative diversity; Relay; Wireless ad hoc network; Hop (telecommunications); Destination-Sequenced Distance Vector routing; Transmitter power output; Fading; Wireless; Routing protocol; Dynamic Source Routing; Distributed computing; Routing (electronic design automation); Power (physics); Telecommunications","score_opus":0.03633110867844159,"score_gpt":0.27860447237024566,"score_spread":0.24227336369180408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051499402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16653149,0.00059890794,0.8293115,0.0012820505,0.00026101316,0.00023952179,1.3686302e-7,0.00018128306,0.0015940875],"genre_scores_gemma":[0.94175494,0.0008710001,0.056289017,0.00042886354,0.000035121036,0.000016033227,0.0000010270043,0.0000067217,0.00059725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990166,0.00015054156,0.00023158407,0.00030712446,0.000079397236,0.00021474298],"domain_scores_gemma":[0.9993557,0.00011159891,0.000056722205,0.00027535495,0.00012859666,0.00007207914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000551315,0.00011992457,0.00013783154,0.00008641601,0.0002652629,0.00020151831,0.0003108034,0.00007794769,0.000038798156],"category_scores_gemma":[0.000108444634,0.00010535871,0.000020505924,0.00054750073,0.00004558145,0.00042477762,0.00037595717,0.0005648277,0.000009850375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020656717,0.00029712863,0.017166052,0.0000071102772,0.00003402338,0.000007934108,0.008903344,0.010887153,0.05919643,0.19128047,0.0013911985,0.7108085],"study_design_scores_gemma":[0.0004114836,0.00003674743,0.02126013,0.00001896534,0.0000011169383,0.000011378213,0.00005128414,0.9756171,0.0007178283,0.000015453053,0.0017080307,0.00015049349],"about_ca_topic_score_codex":0.000009494995,"about_ca_topic_score_gemma":0.0028796252,"teacher_disagreement_score":0.96472996,"about_ca_system_score_codex":0.000030211118,"about_ca_system_score_gemma":0.000037983482,"threshold_uncertainty_score":0.42964038},"labels":[],"label_agreement":null},{"id":"W2051500588","doi":"10.1504/ijaacs.2014.058015","title":"Performance of power allocation schemes in an amplify-and-forward single-relay system with diversity at destination","year":2013,"lang":"en","type":"article","venue":"International Journal of Autonomous and Adaptive Communications Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Wireless; Transmitter power output; Maximal-ratio combining; Outage probability; Power (physics); Channel (broadcasting); Diversity gain; Signal-to-noise ratio (imaging); Relay channel; Computer network; Fading; Telecommunications; Transmitter","score_opus":0.04082058897663592,"score_gpt":0.25382438909310323,"score_spread":0.2130038001164673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051500588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.933919,0.0014017102,0.06277119,0.0007046209,0.0001323198,0.00025568437,0.000003019174,0.000022545277,0.00078988547],"genre_scores_gemma":[0.98581606,0.0005081759,0.013580177,0.000022086424,0.000014760317,0.000013601708,0.000004785472,0.0000057111706,0.000034664463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987433,0.00023845464,0.0005139898,0.00013328152,0.00027547506,0.000095532145],"domain_scores_gemma":[0.99727774,0.00019016683,0.0006308641,0.00047965665,0.0013481878,0.00007339096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005219042,0.00011064171,0.00021000081,0.00026594434,0.00023016275,0.00013623237,0.0012921386,0.00004562893,0.0000029493413],"category_scores_gemma":[0.00002667978,0.00009322941,0.00002516904,0.00017343408,0.00014227534,0.0012184378,0.0009582919,0.00017107849,0.0000020701984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033906792,0.0014822495,0.29763988,0.00015458216,0.000686335,0.000013333131,0.022484861,0.019366316,0.019176153,0.48283735,0.000130479,0.15568939],"study_design_scores_gemma":[0.0013350021,0.00095187715,0.13197896,0.0010625024,0.00002157409,0.00034082492,0.0017783117,0.8608935,0.00042085152,0.000043189957,0.0008836631,0.0002897763],"about_ca_topic_score_codex":0.000092802424,"about_ca_topic_score_gemma":0.0000701128,"teacher_disagreement_score":0.84152716,"about_ca_system_score_codex":0.00029819933,"about_ca_system_score_gemma":0.00006689613,"threshold_uncertainty_score":0.3801785},"labels":[],"label_agreement":null},{"id":"W2051720081","doi":"10.1109/spawc.2014.6941689","title":"Joint pairing and power allocation optimization in multichannel MABC-based two-way relaying","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Computer science; Maximization; Mathematical optimization; Joint (building); Optimization problem; Pairing; Power (physics); Node (physics); Convex optimization; Iterative method; Power optimization; Regular polygon; Mathematics; Engineering; Power consumption","score_opus":0.03290788286379243,"score_gpt":0.25483886948212997,"score_spread":0.22193098661833754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051720081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013674762,0.000078951845,0.98081917,0.0021045357,0.00007176307,0.00011795651,4.0810335e-8,0.00010856702,0.0030242498],"genre_scores_gemma":[0.8483192,0.000038541515,0.15087405,0.00068602787,0.000009742564,0.00001144228,0.0000018916976,0.0000052003766,0.00005392911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999181,0.00016784715,0.00019745591,0.00022375847,0.0000951684,0.00013480533],"domain_scores_gemma":[0.9993358,0.00011784809,0.000052002306,0.000369015,0.00007882357,0.0000464925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006237638,0.00008444959,0.00009403738,0.00012761254,0.00012319183,0.00011442419,0.00022634608,0.000029098208,0.00002055159],"category_scores_gemma":[0.00011047013,0.00008031866,0.000016032063,0.0002780332,0.000018866069,0.00031541244,0.00017084891,0.000097309836,0.000007623741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005142092,0.000071228846,0.0024858683,0.0000103785715,0.000004597059,8.340006e-7,0.0015300781,0.8492838,0.0026900098,0.07906659,0.00008952909,0.06476195],"study_design_scores_gemma":[0.0004943111,0.000021555623,0.0033580323,0.000042189735,8.425333e-7,8.5392946e-7,0.00002369979,0.9948843,0.0008016819,0.000100012636,0.00016494031,0.00010755214],"about_ca_topic_score_codex":0.0000118782655,"about_ca_topic_score_gemma":0.000059396913,"teacher_disagreement_score":0.83464444,"about_ca_system_score_codex":0.00003962244,"about_ca_system_score_gemma":0.00001552355,"threshold_uncertainty_score":0.32753003},"labels":[],"label_agreement":null},{"id":"W2051762234","doi":"10.1109/twc.2012.092112.112072","title":"Achievable Rate Region under Joint Distributed Beamforming and Power Allocation for Two-Way Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Relay; Transmitter power output; Maximization; Computer science; Transceiver; Mathematical optimization; Power (physics); Topology (electrical circuits); Mathematics; Telecommunications; Wireless; Channel (broadcasting); Transmitter","score_opus":0.05857159905102613,"score_gpt":0.28918466720537755,"score_spread":0.23061306815435142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051762234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057985736,0.000951719,0.98601353,0.0057364246,0.00035527413,0.00060533057,0.000010841806,0.00026354328,0.00026474896],"genre_scores_gemma":[0.9754193,0.0027414323,0.020544289,0.00057831424,0.00003217303,0.00040465177,0.000049053408,0.000029597033,0.00020119885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982268,0.0004258368,0.00045679763,0.00031127402,0.00013709621,0.0004422027],"domain_scores_gemma":[0.9961505,0.00070590724,0.00019385846,0.0025016712,0.00024898426,0.0001991056],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007826054,0.00024494616,0.00024748986,0.0001761273,0.0017535461,0.000191994,0.0011723944,0.000118082025,0.000007767775],"category_scores_gemma":[0.000015024666,0.00025132255,0.000118683885,0.0006617757,0.00017569536,0.0010584675,0.000054856704,0.00050193706,0.000011940666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010623408,0.002154848,0.00013270676,0.000042244443,0.00036282843,5.564766e-7,0.005572446,0.22888014,0.009467944,0.5252626,0.00158867,0.22642878],"study_design_scores_gemma":[0.001232096,0.00012403008,0.0009137309,0.00014901384,0.000065542896,0.000029473853,0.00023429471,0.9835913,0.003975411,0.00042883138,0.008684788,0.00057148933],"about_ca_topic_score_codex":0.000017644468,"about_ca_topic_score_gemma":0.00011360238,"teacher_disagreement_score":0.9696207,"about_ca_system_score_codex":0.0001684088,"about_ca_system_score_gemma":0.000052503146,"threshold_uncertainty_score":0.9999939},"labels":[],"label_agreement":null},{"id":"W2052030009","doi":"10.1109/glocom.2013.6831749","title":"Dual-hop Vs multihop AF relaying systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Fading; Relay; Hop (telecommunications); Probability density function; Independent and identically distributed random variables; Outage probability; Probability of error; Mathematics; Computer science; Wireless; Topology (electrical circuits); Signal-to-noise ratio (imaging); Communications system; Algorithm; Statistics; Telecommunications; Random variable; Decoding methods; Combinatorics; Physics","score_opus":0.04081922923356764,"score_gpt":0.26650562702984826,"score_spread":0.2256863977962806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052030009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030324817,0.0016210761,0.84693414,0.007165976,0.0010738932,0.0006371498,2.8912103e-7,0.0009014955,0.11134114],"genre_scores_gemma":[0.9762809,0.00023707881,0.015474467,0.0007136989,0.000059442988,0.00005749448,9.795497e-7,0.0000067403294,0.0071691996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990982,0.00012986528,0.00020499414,0.00022040223,0.00014380316,0.0002027564],"domain_scores_gemma":[0.998737,0.00014344967,0.000050998937,0.0008178762,0.00016188704,0.0000888066],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023638757,0.000096906544,0.00011544814,0.00006102452,0.00022442632,0.00041922805,0.0006870214,0.000037651887,0.00016760669],"category_scores_gemma":[0.000041057894,0.0000790206,0.00003444085,0.0003128661,0.00002168921,0.0006197042,0.00051559974,0.00012813674,0.001241226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024754524,0.00010641793,0.0018003522,0.000022994276,0.000040405586,0.000007562678,0.002830443,0.0010663165,0.007925593,0.73118824,0.096292704,0.15871651],"study_design_scores_gemma":[0.00028759713,0.000032524676,0.0023378478,0.000044501274,0.0000017147034,0.00001584229,0.00014232795,0.938486,0.00032783166,0.00017262946,0.0579045,0.00024672397],"about_ca_topic_score_codex":0.00006364024,"about_ca_topic_score_gemma":0.000011158811,"teacher_disagreement_score":0.94595605,"about_ca_system_score_codex":0.000033088847,"about_ca_system_score_gemma":0.000022084952,"threshold_uncertainty_score":0.9995364},"labels":[],"label_agreement":null},{"id":"W2052035831","doi":"10.1109/wcnc.2013.6555085","title":"Layered sources in non-orthogonal amplify-forward relay networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Relay; Multiplexing; Topology (electrical circuits); Distortion (music); Computer science; Upper and lower bounds; Expression (computer science); Broadcasting (networking); Encoding (memory); Power (physics); Mathematics; Telecommunications; Algorithm; Computer network; Physics; Mathematical analysis; Combinatorics; Bandwidth (computing)","score_opus":0.018674761478626088,"score_gpt":0.24785542083597406,"score_spread":0.22918065935734797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052035831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0900949,0.00028513893,0.8850385,0.002563832,0.00017706442,0.0002690467,1.5848586e-7,0.00015992316,0.021411428],"genre_scores_gemma":[0.9830932,0.00027275516,0.013705517,0.0013149986,0.000054960496,0.00005138937,0.000003073492,0.0000066303255,0.0014974943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989658,0.00010561898,0.0002519838,0.00025915084,0.00013368795,0.00028378118],"domain_scores_gemma":[0.99899656,0.00014921297,0.000052096948,0.00062891305,0.0000780471,0.00009519604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000285575,0.00011872571,0.00014329665,0.000091809394,0.00012976014,0.00023872104,0.00099397,0.00006773022,0.0003899055],"category_scores_gemma":[0.000020646952,0.00009997739,0.000042248117,0.0004972965,0.000033753455,0.00048173944,0.0005229416,0.0002624343,0.00027776134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008906523,0.0002464452,0.07263471,0.000009299879,0.000044969514,0.000010511292,0.0027493702,0.043760117,0.00085909135,0.2906805,0.04189824,0.54709786],"study_design_scores_gemma":[0.00028003138,0.000025344312,0.08123362,0.00001974566,7.496678e-7,0.0000037831658,0.000036160814,0.910391,0.00005231726,0.0004436039,0.007321842,0.00019183692],"about_ca_topic_score_codex":0.00004378071,"about_ca_topic_score_gemma":0.00021397913,"teacher_disagreement_score":0.8929983,"about_ca_system_score_codex":0.000027637157,"about_ca_system_score_gemma":0.00002516553,"threshold_uncertainty_score":0.4269192},"labels":[],"label_agreement":null},{"id":"W2052120198","doi":"10.1109/vtcfall.2012.6399326","title":"Performance Analysis of Decode and Forward Incremental Relaying in the Presence of Multiple Sources of Interference","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Interference (communication); Rayleigh fading; Relay; Monte Carlo method; Computer science; Channel (broadcasting); Outage probability; Probability of error; Algorithm; Fading; Topology (electrical circuits); Statistics; Mathematics; Telecommunications; Physics; Combinatorics","score_opus":0.04929752230049657,"score_gpt":0.287472797761807,"score_spread":0.23817527546131045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052120198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656537,0.00038373348,0.032996133,0.000048451104,0.000011482434,0.000060416467,5.678374e-7,0.000004019733,0.0008415057],"genre_scores_gemma":[0.99415624,0.00036661094,0.005436037,0.000024236808,0.0000021851638,0.000003818698,5.1530964e-7,9.772494e-7,0.000009380548],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936426,0.000113669405,0.0002428731,0.00007604936,0.00011340032,0.000089743255],"domain_scores_gemma":[0.9990906,0.00038105436,0.000119922755,0.00033989776,0.00005173966,0.000016800597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067294965,0.000046816403,0.00014346521,0.00014229711,0.000034789344,0.000008966642,0.00060882524,0.000013817209,0.00000955393],"category_scores_gemma":[0.00006561072,0.000031529675,0.000030453832,0.0007252288,0.00007247789,0.0003136456,0.00036964752,0.000055908215,1.8875981e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005047734,0.00004519217,0.9732654,0.000011127713,0.000033826458,2.0485759e-8,0.008729956,0.00031345407,0.0026739498,0.002522482,0.000005745955,0.012393791],"study_design_scores_gemma":[0.00010364039,0.000033561562,0.47151762,0.000033466153,0.000018562054,5.7333665e-7,0.00059049873,0.5151038,0.012536232,0.0000061173214,0.000016026164,0.000039867762],"about_ca_topic_score_codex":0.00005003346,"about_ca_topic_score_gemma":0.00020191995,"teacher_disagreement_score":0.51479036,"about_ca_system_score_codex":0.000006016644,"about_ca_system_score_gemma":0.000007934483,"threshold_uncertainty_score":0.12857428},"labels":[],"label_agreement":null},{"id":"W2052282037","doi":"10.1109/ccece.2008.4564529","title":"BER analysis for noncoherent FSK in two-hop relay networks","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Frequency-shift keying; Relay; Bit error rate; Rayleigh fading; Computer science; Expression (computer science); Synchronization (alternating current); Keying; Electronic engineering; Algorithm; Mathematics; Telecommunications; Fading; Channel (broadcasting); Engineering; Decoding methods; Physics; Demodulation","score_opus":0.03105300886403509,"score_gpt":0.23958498347065396,"score_spread":0.20853197460661888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052282037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05044752,0.00029748146,0.94618183,0.0012707177,0.00015234601,0.00044788665,0.0000026692815,0.00015944343,0.0010401288],"genre_scores_gemma":[0.9890202,0.0005711387,0.009544465,0.0005067861,0.00011347291,0.00012393974,0.0000085025895,0.000016625068,0.00009485071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979088,0.000021454885,0.00039332616,0.00069724716,0.00019166837,0.0007875524],"domain_scores_gemma":[0.9985856,0.00013481319,0.000082913466,0.0002808995,0.00036562164,0.0005501661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024062475,0.00034087128,0.0004788474,0.0008555151,0.00027505666,0.00035053972,0.00089707656,0.000114248454,0.000020216985],"category_scores_gemma":[0.00004135023,0.00034465114,0.00010742773,0.0018765461,0.000050708604,0.0003425952,0.00014954788,0.00052043266,0.0000046583746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033131448,0.0001346573,0.026714934,0.00003619495,0.00030164263,0.00004598989,0.002387048,0.041353043,0.00027102552,0.7766011,0.001010266,0.151111],"study_design_scores_gemma":[0.0004771358,0.00014927026,0.021695133,0.00006013532,0.000019436748,0.000018762126,0.000005935286,0.9755629,0.000030109373,0.00018722218,0.0013732186,0.00042079543],"about_ca_topic_score_codex":0.00061578566,"about_ca_topic_score_gemma":0.0041841036,"teacher_disagreement_score":0.9385727,"about_ca_system_score_codex":0.00021892531,"about_ca_system_score_gemma":0.0003254131,"threshold_uncertainty_score":0.9999006},"labels":[],"label_agreement":null},{"id":"W2052422678","doi":"10.1109/icuwb.2015.7324490","title":"Opportunistic Scheduling in Downlink Multiple-Antenna AF Interfered Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Institut National de la Recherche Scientifique","funders":"","keywords":"Rayleigh fading; Telecommunications link; Computer science; Scheduling (production processes); Relay; Distributed antenna system; Fading; Wireless; Moment-generating function; Antenna (radio); Electronic engineering; Topology (electrical circuits); Computer network; Channel (broadcasting); Mathematical optimization; Probability density function; Telecommunications; Mathematics; Engineering; Electrical engineering; Power (physics); Physics","score_opus":0.11878698771929636,"score_gpt":0.3032102009018592,"score_spread":0.18442321318256283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052422678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005964326,0.00040478955,0.9848601,0.0017820263,0.00035715027,0.00014226369,2.7943545e-7,0.00019450557,0.006294555],"genre_scores_gemma":[0.963521,0.00023440998,0.034939114,0.0008063009,0.00005634276,0.000014760332,0.0000067155206,0.000007616665,0.0004137104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987803,0.00017372008,0.0003266864,0.00029474328,0.00014149531,0.00028306598],"domain_scores_gemma":[0.9986311,0.00019117774,0.000064006774,0.0007447793,0.00016842657,0.00020047497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068493927,0.00013579385,0.00017879582,0.0001275796,0.00007375575,0.00017199502,0.0011357456,0.00006008182,0.000027280681],"category_scores_gemma":[0.00027002825,0.00012089363,0.000038704868,0.00053644297,0.000039635528,0.0003548618,0.00075117167,0.0002817369,0.000054806595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009933188,0.00051731645,0.03202565,0.0000153451,0.00006132799,0.00013137137,0.005102612,0.032594174,0.0017247121,0.5074201,0.0040280605,0.41627997],"study_design_scores_gemma":[0.00059396017,0.000035190867,0.0008681034,0.000046266985,0.0000012852821,0.000007170529,0.0000975459,0.9960667,0.000022641592,0.0003284704,0.0017673612,0.00016529072],"about_ca_topic_score_codex":0.000016916803,"about_ca_topic_score_gemma":0.000296651,"teacher_disagreement_score":0.96347255,"about_ca_system_score_codex":0.00008102779,"about_ca_system_score_gemma":0.00010019085,"threshold_uncertainty_score":0.49298993},"labels":[],"label_agreement":null},{"id":"W2052425808","doi":"10.1109/wcnc.2010.5506307","title":"Performance Evaluation of Relay Deployment Strategies in Multi-Cell Single Frequency Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Cumulative distribution function; Computer science; Orthogonal frequency-division multiplexing; Transmission (telecommunications); Signal-to-noise ratio (imaging); Interference (communication); Duplex (building); Electronic engineering; Software deployment; Monte Carlo method; Signal-to-interference-plus-noise ratio; Network performance; Computer network; Telecommunications; Probability density function; Engineering; Mathematics; Statistics","score_opus":0.0780178357646246,"score_gpt":0.30977911662222507,"score_spread":0.23176128085760048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052425808","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78665626,0.00033221635,0.19657353,0.0001332784,0.0002460976,0.00022248109,8.368695e-8,0.00005788555,0.015778176],"genre_scores_gemma":[0.9576072,0.00016748841,0.042076383,0.00004267145,0.000012409518,0.00002093882,0.0000014252435,0.0000042275165,0.00006724419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990608,0.00013549218,0.00026179393,0.00017312216,0.00022657518,0.00014220447],"domain_scores_gemma":[0.99903,0.000056948702,0.00008654958,0.00055137265,0.00024347143,0.000031652846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010537397,0.00008155024,0.00009675135,0.00007721455,0.000063680134,0.00006202704,0.00057727634,0.000049750968,0.00006686465],"category_scores_gemma":[0.000025901518,0.00007265675,0.000022010328,0.0003532292,0.000034771885,0.00053279556,0.0001530094,0.00021492285,0.000007332385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007919362,0.001355192,0.041823447,0.000021178203,0.0000147603605,0.0000012261676,0.0033487433,0.15390442,0.161274,0.0770614,0.00021856689,0.5609692],"study_design_scores_gemma":[0.00045791606,0.00004268556,0.021134274,0.000016192087,0.000002482727,7.3161823e-7,0.000040536404,0.97390795,0.0041945586,0.00006226771,0.000051787723,0.00008859824],"about_ca_topic_score_codex":0.000017404062,"about_ca_topic_score_gemma":0.001023218,"teacher_disagreement_score":0.82000357,"about_ca_system_score_codex":0.000038366932,"about_ca_system_score_gemma":0.00011086928,"threshold_uncertainty_score":0.29628566},"labels":[],"label_agreement":null},{"id":"W2052543119","doi":"10.1109/tcomm.2013.122013.130239","title":"Joint Optimization of Source Precoding and Relay Beamforming in Wireless MIMO Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"MIMO; Beamforming; Precoding; Relay; Optimization problem; Computer science; Mathematical optimization; Telecommunications link; Convex optimization; Linear programming; Algorithm; Mathematics; Computer network; Power (physics); Telecommunications; Regular polygon","score_opus":0.034887186930708775,"score_gpt":0.2568818715504245,"score_spread":0.22199468461971575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052543119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004154762,0.00028573527,0.9923989,0.00139808,0.00011828862,0.0002371705,0.000001294861,0.00011376132,0.0012919889],"genre_scores_gemma":[0.89724874,0.004477174,0.09793336,0.00012568432,0.000008926642,0.00006506138,0.000004142865,0.000015456055,0.000121473095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984089,0.0004749113,0.00051902205,0.0002590762,0.00013666341,0.00020142099],"domain_scores_gemma":[0.99698913,0.00064255844,0.00018662584,0.0019790654,0.00012576002,0.000076851196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007299985,0.00015450566,0.00023651634,0.00029787686,0.000541378,0.00007843475,0.0011478299,0.00009830757,0.000010242686],"category_scores_gemma":[0.000024131552,0.00016768072,0.000066307584,0.0007892154,0.00014648981,0.00043855247,0.000053672356,0.0005101822,0.0000030496806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048703787,0.00015100263,0.00006606063,0.000007918421,0.000014215065,6.4924706e-8,0.0011015364,0.8797811,0.00036596047,0.007094982,0.000014848969,0.11139741],"study_design_scores_gemma":[0.0003568932,0.000054978573,0.00018010924,0.00017517727,0.000010439203,0.000005405417,0.000066867855,0.9973657,0.0008719482,0.000053833683,0.00069505913,0.00016355558],"about_ca_topic_score_codex":0.000031682335,"about_ca_topic_score_gemma":0.00028945933,"teacher_disagreement_score":0.89446557,"about_ca_system_score_codex":0.00007829381,"about_ca_system_score_gemma":0.000038878887,"threshold_uncertainty_score":0.6837821},"labels":[],"label_agreement":null},{"id":"W2052620199","doi":"10.1109/tsp.2014.2339793","title":"Optimal Spectrum Leasing and Resource Sharing in Two-Way Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transceiver; Relay; Computer network; Computer science; Constraint (computer-aided design); Spectral efficiency; Shared resource; Topology (electrical circuits); Resource (disambiguation); Power (physics); Mathematical optimization; Telecommunications; Mathematics; Wireless; Engineering; Electrical engineering; Channel (broadcasting)","score_opus":0.026154113380342358,"score_gpt":0.2723800059648103,"score_spread":0.24622589258446798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052620199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023752643,0.00073956884,0.9729741,0.0007184434,0.00008178997,0.00008952212,1.7319694e-7,0.00018975016,0.001453996],"genre_scores_gemma":[0.9903688,0.000075284144,0.009052466,0.00027007147,0.00006793176,0.000012231839,3.54071e-7,0.000019405727,0.00013349493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986784,0.00012230403,0.00027073373,0.00046730443,0.00016007392,0.00030120768],"domain_scores_gemma":[0.99936765,0.00013937261,0.000058440743,0.00031536233,0.000029617819,0.000089538844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060661725,0.00017056754,0.00016754291,0.00023186002,0.00046388028,0.00051227544,0.00045619308,0.000051268144,0.000011608998],"category_scores_gemma":[0.0000030350625,0.00017029517,0.000042621483,0.0006721189,0.000064094005,0.0005405916,0.000016867822,0.000605974,0.000009961219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016680731,0.00003575998,0.000033712964,0.0000146599805,0.0000058155906,0.0000036663785,0.0008099373,0.5525444,0.00044116259,0.0010219795,0.0000071525624,0.44506505],"study_design_scores_gemma":[0.0003139838,0.00005170595,0.000093946226,0.00034578855,0.000007037209,0.000025124617,0.000027570706,0.99679834,0.0013790713,0.00022426304,0.00053302944,0.00020017124],"about_ca_topic_score_codex":0.000008458653,"about_ca_topic_score_gemma":0.00007390555,"teacher_disagreement_score":0.9666161,"about_ca_system_score_codex":0.00006825205,"about_ca_system_score_gemma":0.000026220283,"threshold_uncertainty_score":0.6944435},"labels":[],"label_agreement":null},{"id":"W2052739893","doi":"10.1049/iet-com.2013.1075","title":"Optimal multi‐input–multi‐output relay transform matrix with a bounded condition number","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bounded function; Relay; Matrix (chemical analysis); Computer science; Mathematics; Condition number; Mathematical optimization; Applied mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Power (physics)","score_opus":0.04558445347972081,"score_gpt":0.329468600376631,"score_spread":0.2838841468969102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052739893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006007003,0.00038654817,0.97193056,0.010481835,0.00008616734,0.0004511038,0.000008996038,0.00046751407,0.010180286],"genre_scores_gemma":[0.6229451,0.00064086844,0.3746352,0.0003978728,0.000018519268,0.00012822983,0.0000633268,0.000018406796,0.0011525374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819076,0.0005072167,0.00039731225,0.00034313026,0.00023729986,0.00032426216],"domain_scores_gemma":[0.9950159,0.00039386333,0.00016223305,0.0039472273,0.00032944608,0.0001513317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056815136,0.00023118286,0.000243767,0.00009806959,0.0011012389,0.00033141184,0.0033169694,0.00009955105,0.00005347055],"category_scores_gemma":[0.00006229606,0.00021214376,0.00009731615,0.0006500699,0.0002978606,0.00071861455,0.00062745664,0.0005015186,0.00031124093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005573223,0.0020147886,0.0030692625,0.000043701428,0.00027158542,0.0000040245445,0.015394198,0.004375546,0.0015269107,0.85458153,0.006011701,0.11265103],"study_design_scores_gemma":[0.002370716,0.00011967693,0.005310854,0.00012003049,0.000037041787,0.000059033217,0.00015416033,0.7478805,0.0003153881,0.00039276888,0.24265185,0.00058794225],"about_ca_topic_score_codex":0.000028274055,"about_ca_topic_score_gemma":0.00045743742,"teacher_disagreement_score":0.85418874,"about_ca_system_score_codex":0.00009931556,"about_ca_system_score_gemma":0.00010951887,"threshold_uncertainty_score":0.86509717},"labels":[],"label_agreement":null},{"id":"W2052789738","doi":"10.1109/wcnc.2010.5506640","title":"Adaptive Relaying in Noncoherent Wireless Relay Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Computer science; Relay channel; Channel (broadcasting); Wireless; Keying; Computer network; Power (physics); Telecommunications","score_opus":0.02685756130095603,"score_gpt":0.2649170037360468,"score_spread":0.23805944243509078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052789738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06589491,0.00014360479,0.8925197,0.0012437265,0.00065679644,0.00019512234,9.167534e-8,0.00019570439,0.039150342],"genre_scores_gemma":[0.9740626,0.00016928268,0.024726285,0.00042409045,0.000055441815,0.000023282577,7.537707e-7,0.0000066451585,0.0005315727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907845,0.000101281235,0.00021406428,0.00026180682,0.00011527083,0.00022914486],"domain_scores_gemma":[0.9989372,0.00016418738,0.000052138246,0.0007043057,0.00006828227,0.00007389683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004128598,0.0001057935,0.00012261746,0.00007934913,0.0001314466,0.000097716795,0.00094524265,0.00007488613,0.00007944549],"category_scores_gemma":[0.000021141617,0.000093386465,0.000035166493,0.00052534876,0.000036494712,0.00032914255,0.0004890047,0.0006218481,0.000041164996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062553327,0.00008210343,0.00395815,0.0000010690392,0.000007200151,0.000009660416,0.000791061,0.0023404735,0.0013057204,0.6473233,0.001134956,0.34304005],"study_design_scores_gemma":[0.00026500507,0.000026569072,0.0064140675,0.00002205529,8.0596016e-7,0.000005473801,0.000031968317,0.989683,0.00020518106,0.00023557887,0.002944735,0.00016557981],"about_ca_topic_score_codex":0.000017433213,"about_ca_topic_score_gemma":0.0012401377,"teacher_disagreement_score":0.98734254,"about_ca_system_score_codex":0.00003215891,"about_ca_system_score_gemma":0.000039839917,"threshold_uncertainty_score":0.38081896},"labels":[],"label_agreement":null},{"id":"W2052973753","doi":"10.1109/twc.2014.2324583","title":"Achieving Optimal Throughput in Cooperative Wireless Multihop Networks With Rate Adaptation and Continuous Power Control","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Throughput; Power control; Scheduling (production processes); Computer network; Maximum throughput scheduling; Distributed computing; Wireless network; Network topology; Wireless mesh network; Topology control; Transmitter power output; Wireless; Power (physics); Mathematical optimization; Channel (broadcasting); Dynamic priority scheduling; Telecommunications; Mathematics; Key distribution in wireless sensor networks","score_opus":0.024439248853541505,"score_gpt":0.2571231924396868,"score_spread":0.23268394358614528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052973753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056972384,0.00029138388,0.9387015,0.0026574591,0.00011387373,0.00057721185,0.000006603266,0.00020445195,0.00047514073],"genre_scores_gemma":[0.9818591,0.0019453663,0.015157173,0.00069909776,0.000013572978,0.00020481544,0.000008239383,0.000032676708,0.000079986086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971242,0.0013200886,0.00049751345,0.00049574045,0.00019028285,0.00037218296],"domain_scores_gemma":[0.9957995,0.0014471224,0.00019105915,0.0021065318,0.0003195346,0.00013625412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007364276,0.00032380797,0.0004266138,0.00023334962,0.0010089208,0.0002973449,0.0014661942,0.00012609753,0.000010691792],"category_scores_gemma":[0.000016800213,0.0003032576,0.00006486932,0.000865706,0.00035502575,0.0007823693,0.00003995182,0.0008390662,0.000011118828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015549532,0.0007873468,0.00033321988,0.000010865934,0.00013718159,0.0000033414171,0.007309348,0.7207426,0.0015542312,0.034723666,0.000033258,0.2342095],"study_design_scores_gemma":[0.0020119352,0.00025480852,0.0014678804,0.00017683169,0.00002183061,0.000011876873,0.00042317965,0.9945188,0.00026767177,0.00001411714,0.00045563997,0.00037539267],"about_ca_topic_score_codex":0.00005417003,"about_ca_topic_score_gemma":0.0013595005,"teacher_disagreement_score":0.9248867,"about_ca_system_score_codex":0.00010095605,"about_ca_system_score_gemma":0.00008652398,"threshold_uncertainty_score":0.99994195},"labels":[],"label_agreement":null},{"id":"W2052985375","doi":"10.1109/iccw.2014.6881247","title":"Packet acquisition for spatially coupling information transmission","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Preamble; Decoding methods; Computer science; Network packet; Transmission (telecommunications); Interference (communication); Real-time computing; Computer network; Single antenna interference cancellation; Packet analyzer; Data transmission; Channel (broadcasting); Algorithm; Telecommunications","score_opus":0.021300871062734466,"score_gpt":0.26195235640019277,"score_spread":0.2406514853374583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052985375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011638338,0.000023250412,0.99201155,0.0021524802,0.00008632766,0.00016147108,3.395727e-7,0.00014392869,0.0042568133],"genre_scores_gemma":[0.8714808,0.000077531105,0.1270262,0.0012444591,0.00004097176,0.000022460174,0.000023862596,0.000002616803,0.000081088394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954605,0.000021922588,0.0001586991,0.00008280817,0.00009059028,0.000099948666],"domain_scores_gemma":[0.99940455,0.00010336102,0.00004683161,0.00026217155,0.00014108053,0.000042014195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037402488,0.00005734001,0.00006225533,0.000049450133,0.00019054695,0.00014525343,0.0003297368,0.000028802246,0.00003060394],"category_scores_gemma":[0.000023476518,0.00004919421,0.0000318163,0.00012275169,0.000007850818,0.0008782803,0.00005247921,0.000038801103,0.000027823768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059544072,0.000011328876,0.000023087987,0.000009380939,0.0000025520192,1.2589023e-8,0.0004294581,0.0015212075,0.0014707077,0.27686167,0.0013357762,0.71832883],"study_design_scores_gemma":[0.0002708723,0.000048063976,0.0003057594,0.000014506958,0.0000012250905,4.751298e-7,0.0000043795326,0.8973961,0.0023927842,0.0014266797,0.09806626,0.000072888855],"about_ca_topic_score_codex":0.0000011227554,"about_ca_topic_score_gemma":0.0000028561903,"teacher_disagreement_score":0.8958749,"about_ca_system_score_codex":0.000015250874,"about_ca_system_score_gemma":0.000017821543,"threshold_uncertainty_score":0.20060816},"labels":[],"label_agreement":null},{"id":"W2053109164","doi":"10.1155/2010/721492","title":"Threshold-Based Relay Selection for Detect-and-Forward Relaying in Cooperative Wireless Networks","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Science Foundation","keywords":"Relay; Computer science; Demodulation; Cooperative diversity; Wireless network; Hop (telecommunications); Wireless; Selection (genetic algorithm); Computer network; Diversity combining; Telecommunications; Fading; Channel (broadcasting); Artificial intelligence","score_opus":0.03772448133198153,"score_gpt":0.29652371719057674,"score_spread":0.2587992358585952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053109164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2686976,0.0057690036,0.7172717,0.0057155103,0.0008659301,0.00075610087,0.0000015502403,0.0001757289,0.0007469157],"genre_scores_gemma":[0.9656285,0.013921193,0.019292183,0.0007590498,0.00023757065,0.00009367651,0.0000065443046,0.000033115823,0.000028136512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784344,0.00047461168,0.00063748757,0.00039561847,0.00019275631,0.00045608086],"domain_scores_gemma":[0.9967082,0.0013957506,0.0003548853,0.0010360978,0.0003025323,0.0002025493],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018604931,0.00028998294,0.00036567514,0.00030932552,0.0020477162,0.00065476814,0.0013807525,0.00017832953,0.0000043231066],"category_scores_gemma":[0.00004954048,0.00027259026,0.000089960595,0.0008572531,0.00019530386,0.0004993152,0.00047639202,0.0020042392,0.000001303017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111946465,0.00015875541,0.013165055,0.000014794402,0.00006483054,0.000004921177,0.0009816154,0.020663906,0.0029228553,0.075084135,0.00025713164,0.88657004],"study_design_scores_gemma":[0.0010509684,0.00019395501,0.001593287,0.00029467867,0.000012660784,0.00007544763,0.00003777847,0.98284006,0.00014639559,0.00033802298,0.0130869225,0.00032979934],"about_ca_topic_score_codex":0.000004574323,"about_ca_topic_score_gemma":0.00054893864,"teacher_disagreement_score":0.9621762,"about_ca_system_score_codex":0.00008340654,"about_ca_system_score_gemma":0.00010899793,"threshold_uncertainty_score":0.99997264},"labels":[],"label_agreement":null},{"id":"W2053406016","doi":"10.1049/iet-com.2011.0006","title":"Ergodic and outage capacities of relaying channels in spectrum‐sharing constrained systems","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transmitter; Relay; Fading; Rayleigh fading; Computer science; Nakagami distribution; Transmitter power output; Ergodic theory; Node (physics); Topology (electrical circuits); Transmission (telecommunications); Interference (communication); Channel (broadcasting); Computer network; Relay channel; Telecommunications; Power (physics); Mathematics; Physics","score_opus":0.05805624676233438,"score_gpt":0.273703508275998,"score_spread":0.2156472615136636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053406016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7585052,0.027677638,0.12836044,0.024279973,0.00063858734,0.0022408168,0.000015287695,0.0005526813,0.05772938],"genre_scores_gemma":[0.99146205,0.0023345887,0.005829545,0.000075788776,0.000009877558,0.00010037722,0.0000049054183,0.0000068429813,0.00017599398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897337,0.00020568399,0.00037820407,0.00017257588,0.00009751726,0.00017264359],"domain_scores_gemma":[0.997401,0.0003494412,0.00012844156,0.0019679484,0.00009691382,0.000056234898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003972076,0.00010294324,0.00019650448,0.00017874324,0.00023387722,0.00017746944,0.001787848,0.00004507733,0.0000148509935],"category_scores_gemma":[0.00006800184,0.00010621302,0.000028260552,0.00041263094,0.0003047654,0.00048169805,0.0011792538,0.00024684408,0.000013787741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011798531,0.00009315666,0.005629046,0.00004057706,0.000027716405,7.704449e-7,0.0135817835,0.00062149006,0.0025848567,0.9705833,0.000196363,0.0066397632],"study_design_scores_gemma":[0.00081362884,0.000067396715,0.010878207,0.0006119304,0.000009447085,0.000037269027,0.004087846,0.97143877,0.00041533652,0.008151315,0.0030280724,0.0004607787],"about_ca_topic_score_codex":0.00028840257,"about_ca_topic_score_gemma":0.00014543263,"teacher_disagreement_score":0.97081727,"about_ca_system_score_codex":0.000039710347,"about_ca_system_score_gemma":0.000036053545,"threshold_uncertainty_score":0.43312413},"labels":[],"label_agreement":null},{"id":"W2053747890","doi":"10.1109/spawc.2014.6941671","title":"An efficient greedy-based autonomous resource block assignment scheme for 5G cellular networks with self-organizing relaying terminals","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Huawei Technologies","keywords":"Computer science; Greedy algorithm; Base station; Computer network; Block (permutation group theory); Set (abstract data type); Channel (broadcasting); Distributed computing; Cellular network; Wireless; Resource (disambiguation); Resource management (computing); Algorithm; Mathematics; Telecommunications","score_opus":0.016575927260560515,"score_gpt":0.23777122865522096,"score_spread":0.22119530139466045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053747890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026706396,0.00012742156,0.96908885,0.00090800226,0.000073865114,0.0004674361,2.6597473e-7,0.00056849944,0.002059235],"genre_scores_gemma":[0.79322845,0.0000038099615,0.205429,0.001041048,0.00009345177,0.00004992999,0.00000608887,0.000025556395,0.00012268401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980998,0.0002586724,0.00033610247,0.000580153,0.00026539783,0.0004598539],"domain_scores_gemma":[0.9977707,0.0003191659,0.00016949061,0.001363744,0.00017473949,0.00020212929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011281125,0.00024749394,0.00024237792,0.00010622641,0.0006752681,0.000357041,0.0012457209,0.00008098095,0.000012974411],"category_scores_gemma":[0.000027657472,0.00020532616,0.000062800944,0.00044907455,0.00004281789,0.00015593045,0.00015502801,0.00021306411,0.00000912403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045218414,0.0005853685,0.0012110363,0.000042169315,0.000061398045,0.000007711007,0.0014323547,0.92260903,0.0111229615,0.029559018,0.0009611915,0.032362517],"study_design_scores_gemma":[0.00069616386,0.00035574596,0.00013174165,0.000065487686,0.000012387041,0.000005492255,0.00003293286,0.97549385,0.008425312,0.000009526066,0.014445478,0.0003259048],"about_ca_topic_score_codex":0.000003079326,"about_ca_topic_score_gemma":0.000006879673,"teacher_disagreement_score":0.76652205,"about_ca_system_score_codex":0.0001287256,"about_ca_system_score_gemma":0.00008974968,"threshold_uncertainty_score":0.8372958},"labels":[],"label_agreement":null},{"id":"W2053756329","doi":"10.1016/j.disc.2008.08.013","title":"More on almost self-complementary graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Complement (music); Constructive proof; Automorphism; Discrete mathematics; Graph; Matching (statistics); Order (exchange); Existential quantification","score_opus":0.051814792430309294,"score_gpt":0.295176398150736,"score_spread":0.2433616057204267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053756329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2911917,0.00071336236,0.5700902,0.014823585,0.00071399275,0.0014015083,0.000025009507,0.0021055902,0.11893507],"genre_scores_gemma":[0.8093565,0.00056377455,0.18736857,0.0022345395,0.000042100353,0.000030015424,0.000017998049,0.000020116495,0.00036638725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903494,0.00005044567,0.00024244738,0.00020552202,0.00026268643,0.00020398157],"domain_scores_gemma":[0.9986893,0.00013564767,0.00008253885,0.00095897075,0.000056659883,0.00007691212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015051043,0.00014617939,0.00015897094,0.00007517247,0.00036125153,0.000053380256,0.0009741925,0.000025308645,0.000061055005],"category_scores_gemma":[0.00002112918,0.00012260122,0.00007395273,0.00033556676,0.0000559004,0.0002346365,0.00032963915,0.00013231712,0.0001202525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021274382,0.0002669796,0.00037221907,0.000027521291,0.000052846688,0.00002478661,0.013791461,0.000047282483,0.00016177766,0.97147524,0.009810354,0.003967388],"study_design_scores_gemma":[0.0027397033,0.0006952452,0.009507855,0.00048895745,0.00006173289,0.00039618768,0.001857816,0.78660315,0.0057622087,0.06979001,0.11978046,0.0023166928],"about_ca_topic_score_codex":0.0000015890067,"about_ca_topic_score_gemma":0.0000024537112,"teacher_disagreement_score":0.90168524,"about_ca_system_score_codex":0.000031648924,"about_ca_system_score_gemma":0.000025798692,"threshold_uncertainty_score":0.49995327},"labels":[],"label_agreement":null},{"id":"W2053761735","doi":"10.1109/bsc.2010.5472983","title":"High-rate BICM-ID with superposition modulation over amplify-and-forward relay channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; EXIT chart; Computer science; Relay; Algorithm; Precoding; Coding gain; Bit error rate; Quadrature amplitude modulation; Coding (social sciences); Superposition principle; Phase-shift keying; Modulation (music); Channel (broadcasting); Electronic engineering; Theoretical computer science; Topology (electrical circuits); Telecommunications; Mathematics; Physics; Concatenated error correction code; Statistics; Block code; Engineering","score_opus":0.015641645679780766,"score_gpt":0.24212101631966518,"score_spread":0.2264793706398844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053761735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5269364,0.000023535691,0.4693131,0.0019636573,0.00028165733,0.00016346801,8.616402e-7,0.00017914975,0.0011381793],"genre_scores_gemma":[0.97217447,0.00008802603,0.026296657,0.0006496292,0.00007566006,0.00001868787,0.000015124919,0.000008030262,0.00067373045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992366,0.00007429878,0.00014014888,0.00026605383,0.00012728821,0.00015561705],"domain_scores_gemma":[0.99915946,0.00007467827,0.00004719646,0.00053905084,0.000098963945,0.00008063779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028199938,0.00011436756,0.00010634995,0.0000794103,0.00024314616,0.00024015858,0.00032464243,0.000062542545,0.00010772437],"category_scores_gemma":[0.000012836041,0.00008693929,0.000015930595,0.0002685078,0.000044405824,0.00067930506,0.00019077769,0.00022302064,0.000034470275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020641388,0.000059831502,0.0012499182,0.000005210461,0.000023122895,0.0000023121995,0.0007257423,0.0014810917,0.05059307,0.9001747,0.0009513815,0.044713017],"study_design_scores_gemma":[0.0011540991,0.00024327397,0.065246195,0.000035905716,0.0000117226655,0.000029449538,0.000017277009,0.908238,0.008366066,0.0030328932,0.013089456,0.00053564156],"about_ca_topic_score_codex":0.00002875071,"about_ca_topic_score_gemma":0.00014009495,"teacher_disagreement_score":0.90675694,"about_ca_system_score_codex":0.00001419687,"about_ca_system_score_gemma":0.000021945752,"threshold_uncertainty_score":0.35452816},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06604303079732751,"score_gpt":0.31791114413875976,"score_spread":0.2518681133414322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053784592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062274486,0.000256365,0.98632723,0.003653165,0.0008433251,0.0007428856,0.000017797236,0.0005257765,0.0014059998],"genre_scores_gemma":[0.9632247,0.0025027222,0.032445017,0.00062341976,0.00005520017,0.00035643173,0.000015835949,0.000042286647,0.00073435466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977675,0.0002617498,0.0006527675,0.00048221857,0.0002795186,0.00055622746],"domain_scores_gemma":[0.99360514,0.0016774975,0.00020657043,0.003836704,0.00045862835,0.00021546516],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001253219,0.00030420188,0.00033572278,0.0003925537,0.0020477423,0.0002625905,0.003907862,0.00016338269,0.000019334015],"category_scores_gemma":[0.00001422062,0.00032793198,0.00022578624,0.0012064339,0.00022560428,0.0005925199,0.00005161652,0.00064444455,0.00006159544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006476779,0.0009494008,0.000014502994,0.000033295208,0.00013876235,0.0000026950438,0.003023458,0.00434692,0.014487834,0.27421498,0.0006771216,0.7020463],"study_design_scores_gemma":[0.0024118356,0.00032046039,0.00015950303,0.00036355585,0.00006940304,0.000041199335,0.00051975634,0.8280191,0.12592994,0.0010083902,0.039811876,0.0013449835],"about_ca_topic_score_codex":0.000012427625,"about_ca_topic_score_gemma":0.00032686666,"teacher_disagreement_score":0.9569973,"about_ca_system_score_codex":0.0001983948,"about_ca_system_score_gemma":0.00011978578,"threshold_uncertainty_score":0.99991727},"labels":[],"label_agreement":null},{"id":"W2053823116","doi":"10.1109/wcl.2012.051712.120156","title":"Prediction-Based Energy-Aware Relay Cooperation for Lifetime Maximization","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Relay; Maximization; Power (physics); Channel (broadcasting); Channel state information; Energy (signal processing); Computational complexity theory; Mathematical optimization; Computer network; Algorithm; Wireless; Telecommunications; Mathematics","score_opus":0.04824519487529482,"score_gpt":0.2687440016354856,"score_spread":0.2204988067601908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053823116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002675589,0.00060217554,0.97618335,0.01890861,0.0005287555,0.000389808,0.000021932277,0.00040825197,0.00028150613],"genre_scores_gemma":[0.9191566,0.00057156745,0.07342876,0.0056075742,0.00017247122,0.0005918482,0.00033141335,0.000031091193,0.00010864878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820226,0.00045838492,0.00046410662,0.00028219653,0.00021309666,0.0003799756],"domain_scores_gemma":[0.99576145,0.00056607515,0.00020391989,0.002976908,0.0003413571,0.00015027284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005566018,0.00021679887,0.00019844243,0.00020952254,0.0010695204,0.00020954569,0.0022910354,0.000099752266,0.000013770602],"category_scores_gemma":[0.00003874141,0.00023351311,0.00010855675,0.0007173308,0.00013702273,0.0010401886,0.00026809523,0.0002164845,0.000028316223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073024166,0.0019667658,0.008452742,0.00008592993,0.00028033543,8.7341635e-7,0.0044602333,0.046800647,0.07613458,0.43373224,0.123033874,0.30497876],"study_design_scores_gemma":[0.0005800869,0.000029485145,0.00049261935,0.000051502717,0.000019500496,0.0000034001366,0.000015127272,0.92506784,0.003656281,0.000025498584,0.06977024,0.00028840688],"about_ca_topic_score_codex":0.000010698526,"about_ca_topic_score_gemma":0.00003103885,"teacher_disagreement_score":0.916481,"about_ca_system_score_codex":0.00017040058,"about_ca_system_score_gemma":0.00009450356,"threshold_uncertainty_score":0.9522388},"labels":[],"label_agreement":null},{"id":"W2053984701","doi":"10.1109/icosp.2012.6491859","title":"Power and resource allocation for orthogonal RDF and NDF relay systems with QoS and peak-power constraints","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; Computer science; Rician fading; Quality of service; Mathematical optimization; Power (physics); Relay channel; Flexibility (engineering); Resource allocation; Fading; Channel (broadcasting); Computer network; Mathematics","score_opus":0.021802421308153914,"score_gpt":0.251233780785433,"score_spread":0.2294313594772791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053984701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15081492,0.0043702354,0.82604814,0.0031450887,0.00017448414,0.00066885765,0.000003257941,0.000113313836,0.014661701],"genre_scores_gemma":[0.9928693,0.00010436186,0.00593304,0.00037804813,0.000027385393,0.000034781642,0.0000022472532,0.000006257074,0.000644576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932665,0.00007648907,0.00013168214,0.00019872737,0.00009517884,0.00017127254],"domain_scores_gemma":[0.9993056,0.00016026359,0.000052698,0.00026306577,0.000095534626,0.00012280783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004434518,0.00009926613,0.000109884735,0.000043345546,0.00020085227,0.00016708221,0.0001364848,0.00003869086,0.000016731063],"category_scores_gemma":[0.000028275936,0.00007460772,0.000009055223,0.000096799085,0.00014219634,0.00036002448,0.00016312543,0.00007135892,0.0000017504294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004188064,0.00007332372,0.012246216,0.00003720554,0.000056870373,9.573542e-7,0.0048302896,0.000023470448,0.0008409832,0.9513199,0.0054592732,0.025069674],"study_design_scores_gemma":[0.005167438,0.0010688531,0.15642886,0.00042954055,0.000057963036,0.00088851765,0.0027748542,0.14322454,0.00039615092,0.0002527242,0.687701,0.0016095522],"about_ca_topic_score_codex":0.0000014107286,"about_ca_topic_score_gemma":0.0000064121873,"teacher_disagreement_score":0.95106715,"about_ca_system_score_codex":0.000010507404,"about_ca_system_score_gemma":0.000020306006,"threshold_uncertainty_score":0.30424145},"labels":[],"label_agreement":null},{"id":"W2054340180","doi":"10.1109/tpds.2011.72","title":"On the Market Power of Network Coding in P2P Content Distribution Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Stochastic game; Linear network coding; Market power; Coding (social sciences); Maximization; Microeconomics; Mathematical optimization; Economics; Computer security","score_opus":0.07201355426891218,"score_gpt":0.2416660465813466,"score_spread":0.16965249231243443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054340180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009582393,0.0006245308,0.98712623,0.00018670651,0.00072930416,0.0005070484,0.00011852082,0.00006094007,0.001064352],"genre_scores_gemma":[0.9992196,0.00036925758,0.00006756661,0.000042781292,0.000013740573,0.0001307008,0.000013443913,0.000006677288,0.0001362284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825287,0.00049164717,0.00049504684,0.00027792293,0.00021375727,0.00026877332],"domain_scores_gemma":[0.9985986,0.0004058017,0.00017144872,0.00061414216,0.00012671048,0.00008333169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007398574,0.00018164146,0.00028765405,0.00005797299,0.00029231745,0.000115170486,0.00047169338,0.00008591382,0.000023582323],"category_scores_gemma":[0.00001531458,0.00013075628,0.00007282638,0.00049263367,0.000079193574,0.00015473517,0.000009335688,0.00025492464,0.000008171499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004778038,0.0009578384,0.00084575237,0.00011148062,0.00023465158,0.000020368858,0.0022422022,0.3562212,0.0003061747,0.6245451,0.011975134,0.002062295],"study_design_scores_gemma":[0.002121296,0.0006460434,0.010545039,0.0013458757,0.00003845157,0.000053937405,0.0015467529,0.97888255,0.00021548715,0.0004859602,0.0034213464,0.00069725205],"about_ca_topic_score_codex":0.000108963206,"about_ca_topic_score_gemma":0.000028569077,"teacher_disagreement_score":0.9896372,"about_ca_system_score_codex":0.00008024031,"about_ca_system_score_gemma":0.000029521523,"threshold_uncertainty_score":0.5332086},"labels":[],"label_agreement":null},{"id":"W2054365803","doi":"10.1109/pimrc.2011.6139798","title":"Power allocation for two-way amplify-forward relaying with receive channel knowledge","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Channel state information; Decoding methods; Channel (broadcasting); Relay; Signal-to-noise ratio (imaging); Coding (social sciences); Power (physics); Transmitter power output; Upper and lower bounds; Constraint (computer-aided design); Linear network coding; Relay channel; Mathematical optimization; Computer network; Wireless; Topology (electrical circuits); Telecommunications; Mathematics; Engineering; Electrical engineering; Transmitter; Statistics; Physics","score_opus":0.07092018512624919,"score_gpt":0.2924218722238608,"score_spread":0.2215016870976116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054365803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001082575,0.00020498678,0.87589556,0.00045493152,0.00016985489,0.00031498095,4.864947e-7,0.00018302107,0.12169362],"genre_scores_gemma":[0.9210677,0.00007298697,0.07549413,0.00042152585,0.000034259392,0.00011284313,0.000004825795,0.000012762781,0.0027789492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915713,0.00007047787,0.00017439827,0.00029398696,0.000084694024,0.00021931091],"domain_scores_gemma":[0.99875546,0.00011896557,0.00007294434,0.0006509801,0.00032174494,0.000079895435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003670518,0.00012578117,0.00012251045,0.00008178553,0.00026656035,0.00007353056,0.00072477903,0.000039955197,0.00009423556],"category_scores_gemma":[0.000032917065,0.000097555785,0.000037413036,0.00033474003,0.00003582247,0.00043053474,0.00020855176,0.000110041015,0.00010198415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061430444,0.00022835736,0.00019200417,0.000013886516,0.00006905947,0.0000011784123,0.020729207,0.00007697904,0.00082030357,0.9025442,0.0074559725,0.067807436],"study_design_scores_gemma":[0.008101402,0.0028889426,0.010300793,0.0005530357,0.00007471291,0.000079807454,0.0025804169,0.6456179,0.04091594,0.01943869,0.2662096,0.0032387963],"about_ca_topic_score_codex":0.0000065377203,"about_ca_topic_score_gemma":0.00010398178,"teacher_disagreement_score":0.9199851,"about_ca_system_score_codex":0.000042575433,"about_ca_system_score_gemma":0.000053266103,"threshold_uncertainty_score":0.39782095},"labels":[],"label_agreement":null},{"id":"W2054430006","doi":"10.1109/icassp.2013.6638612","title":"Two-way relay beamforming design: Proportional fair and max-min rate fair approaches using POTDC","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Relay; Beamforming; Convexity; Mathematical optimization; Optimization problem; Convex optimization; Polynomial; Function (biology); Mathematics; Computer science; Regular polygon; Telecommunications","score_opus":0.1422106187888721,"score_gpt":0.27696131853074824,"score_spread":0.13475069974187615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054430006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04852926,0.00029605997,0.94540143,0.001528522,0.00007908222,0.00042218278,2.2900059e-7,0.00016040237,0.0035828182],"genre_scores_gemma":[0.6371377,0.00004883223,0.3616203,0.00028330294,0.00003599367,0.000034354613,0.0000020747043,0.000008271341,0.00082918984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986847,0.00020482752,0.00029430015,0.00036814524,0.00017059768,0.00027741768],"domain_scores_gemma":[0.9990409,0.000112615075,0.00010608912,0.00049774005,0.00012434329,0.00011830222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006694589,0.00016872278,0.00015998054,0.000099373436,0.00043237864,0.0003652715,0.00055470405,0.000047518355,0.00010715211],"category_scores_gemma":[0.00003856107,0.00013695973,0.00003845289,0.0003355636,0.0000886888,0.0011804544,0.0005888193,0.0001724899,0.000045970723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017382064,0.0002550102,0.0030301185,0.00004356231,0.000106193496,0.000010745279,0.003811476,0.020514702,0.042823415,0.4898016,0.0025204439,0.43706536],"study_design_scores_gemma":[0.00029794648,0.000036099806,0.0016949187,0.000029194769,0.0000046558075,0.000037302667,0.00013121229,0.99198043,0.0029591366,0.0017705633,0.0007974501,0.0002610822],"about_ca_topic_score_codex":0.000026910402,"about_ca_topic_score_gemma":0.000012868408,"teacher_disagreement_score":0.9714657,"about_ca_system_score_codex":0.000052389554,"about_ca_system_score_gemma":0.00007906117,"threshold_uncertainty_score":0.5585056},"labels":[],"label_agreement":null},{"id":"W2054458816","doi":"10.1109/pimrc.2011.6140097","title":"Investigations on the effects of co-channel interference on dual-hop transmission in Nakagami-m fading","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Cumulative distribution function; Hop (telecommunications); Interference (communication); Probability density function; Co-channel interference; Upper and lower bounds; Signal-to-interference-plus-noise ratio; Topology (electrical circuits); Fading distribution; Channel (broadcasting); Bounded function; Outage probability; Transmission (telecommunications); Mathematics; Signal-to-noise ratio (imaging); Probability of error; Computer science; Algorithm; Telecommunications; Statistics; Mathematical analysis; Physics; Combinatorics; Rayleigh fading","score_opus":0.08430703772019062,"score_gpt":0.28365084007772096,"score_spread":0.19934380235753035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054458816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31470242,0.00026099486,0.566228,0.0042374623,0.00033016904,0.0008279864,7.378108e-7,0.00019023534,0.11322201],"genre_scores_gemma":[0.99705887,0.00018951361,0.0017037131,0.00081164646,0.00000596676,0.000024124498,5.714014e-7,0.0000040604573,0.00020156002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916285,0.00024222014,0.00018770502,0.00017267861,0.00011491604,0.00011964423],"domain_scores_gemma":[0.99866927,0.00067364785,0.00005345413,0.0005134771,0.000041785235,0.000048387243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027979832,0.00009340784,0.0001024883,0.00011845726,0.000112181326,0.00002619683,0.00064637745,0.000031138665,0.000040243438],"category_scores_gemma":[0.00012593418,0.000060429647,0.00003245205,0.00038425528,0.00006149757,0.00013183166,0.00009939577,0.00018472801,0.000024167059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020194468,0.00028659197,0.00026789005,0.000036937206,0.000014320034,0.000004784974,0.029674582,0.00015894677,0.01754621,0.90092796,0.0012962598,0.049765322],"study_design_scores_gemma":[0.0011307864,0.0013544387,0.015751591,0.002783726,0.000008612955,0.000004411608,0.0003716846,0.28965408,0.6666586,0.020591551,0.0011483859,0.000542183],"about_ca_topic_score_codex":0.0000108388085,"about_ca_topic_score_gemma":0.000019174338,"teacher_disagreement_score":0.8803364,"about_ca_system_score_codex":0.000022081185,"about_ca_system_score_gemma":0.000026748714,"threshold_uncertainty_score":0.24642494},"labels":[],"label_agreement":null},{"id":"W2054518948","doi":"10.1109/wcnc.2013.6554786","title":"Channel allocation and time scheduling in multi-channel wireless networks using network coding","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Linear network coding; Computer network; Maximum throughput scheduling; Relay; Wireless network; Scheduling (production processes); Node (physics); Channel (broadcasting); Throughput; Network topology; Wireless; Distributed computing; Quality of service; Dynamic priority scheduling; Network packet; Round-robin scheduling; Mathematical optimization; Engineering; Telecommunications; Mathematics","score_opus":0.05684921789111879,"score_gpt":0.27700898401433593,"score_spread":0.22015976612321714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054518948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040626135,0.0008598601,0.9569627,0.000673684,0.00015674747,0.0003309746,7.1738334e-8,0.00013723016,0.00025258627],"genre_scores_gemma":[0.9585921,0.00062810455,0.039930563,0.0005503253,0.000093193994,0.000030116404,0.0000030912188,0.000013913989,0.00015860068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986255,0.00017242625,0.00031973046,0.0003665745,0.00011228424,0.00040349134],"domain_scores_gemma":[0.9990693,0.0001521819,0.00009728356,0.0004339999,0.00013753606,0.00010973726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053820317,0.00017536899,0.00020946993,0.000109782944,0.00031053208,0.00032030168,0.0005222152,0.00008897683,0.000024770732],"category_scores_gemma":[0.00002459542,0.00017293768,0.000028893102,0.0006572053,0.00004497565,0.0008360183,0.00058348046,0.00023538583,0.000029842191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030429778,0.000066422486,0.0005483539,0.000009176253,0.000016906492,0.0000019972472,0.0009604395,0.9620589,0.0013086891,0.01255284,0.00020058049,0.02227265],"study_design_scores_gemma":[0.00033521632,0.000012053591,0.0017527353,0.00012066167,0.0000021341734,0.000005912546,0.000045278273,0.99712247,0.00006545608,0.00030086236,0.000020510877,0.00021670012],"about_ca_topic_score_codex":0.00006581387,"about_ca_topic_score_gemma":0.00006693872,"teacher_disagreement_score":0.91796595,"about_ca_system_score_codex":0.0000624126,"about_ca_system_score_gemma":0.000028287806,"threshold_uncertainty_score":0.7052194},"labels":[],"label_agreement":null},{"id":"W2054841841","doi":"10.1109/pacrim.2009.5291370","title":"Performance analysis of a multi-relay two-way cooperative communication system over Rayleigh fading channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rayleigh fading; Relay; Computer science; Fading; Channel (broadcasting); Power (physics); Communications system; Expression (computer science); Electronic engineering; Telecommunications; Engineering; Physics","score_opus":0.039172558101561235,"score_gpt":0.2955728585770135,"score_spread":0.25640030047545226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054841841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31086892,0.0009343313,0.6749255,0.0005335723,0.00012492022,0.00037857398,0.0000024578692,0.00030989727,0.011921834],"genre_scores_gemma":[0.98050565,0.00047377584,0.018267807,0.00026634033,0.000013368136,0.000015805288,0.0000132159275,0.000005335083,0.0004387076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984356,0.00033826195,0.00047628288,0.0003000374,0.00022799127,0.00022182768],"domain_scores_gemma":[0.9977191,0.00016977145,0.00022217321,0.0014287131,0.0003836469,0.00007659541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006510777,0.00017639327,0.0003998585,0.00039595456,0.00037118598,0.00012783727,0.0014230505,0.00005188045,0.000046151927],"category_scores_gemma":[0.000028043722,0.00015125342,0.00013220092,0.0025383711,0.000054625012,0.0006636314,0.00031828045,0.00018034058,0.000016489616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003658357,0.00056216924,0.0063600736,0.00003835933,0.001179916,0.0000029255689,0.017603492,0.43519387,0.012983141,0.4237143,0.0005193661,0.101805784],"study_design_scores_gemma":[0.00048663205,0.00006362392,0.014101804,0.000081922844,0.00006985016,0.000001633054,0.00010077884,0.98192173,0.0028054994,0.000003197898,0.00018160489,0.00018169574],"about_ca_topic_score_codex":0.000019868643,"about_ca_topic_score_gemma":0.00005704913,"teacher_disagreement_score":0.6696367,"about_ca_system_score_codex":0.000112969545,"about_ca_system_score_gemma":0.000034586792,"threshold_uncertainty_score":0.6167935},"labels":[],"label_agreement":null},{"id":"W2054925885","doi":"10.1109/vtcspring.2014.7022870","title":"Cross Entropy Optimization for Constrained Green Cooperative Cognitive Radio Network","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Cognitive radio; Optimization problem; Mathematical optimization; Cross-entropy method; Computer science; Convex optimization; Entropy (arrow of time); Upper and lower bounds; Regular polygon; Power (physics); Wireless; Quadratic assignment problem; Mathematics; Telecommunications","score_opus":0.02891953810639229,"score_gpt":0.2915013648957295,"score_spread":0.26258182678933717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054925885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052215846,0.00011395542,0.99010015,0.0011337069,0.00020400574,0.0004952455,0.000003691278,0.00019718934,0.007229901],"genre_scores_gemma":[0.79456496,0.00011605526,0.20061575,0.0021762059,0.0002962927,0.000114924114,0.00005490799,0.000014275933,0.0020466442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987828,0.00022863339,0.0002505371,0.00033213236,0.000115697025,0.00029020116],"domain_scores_gemma":[0.99815416,0.00070579705,0.000092680566,0.00035713316,0.00059489004,0.00009533336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050206657,0.0001514703,0.00018916743,0.000040347164,0.00050612324,0.00029805014,0.00057249103,0.000055342694,0.00019745257],"category_scores_gemma":[0.00020586808,0.00013489692,0.00006265307,0.00036087623,0.00012576944,0.0004094501,0.00020061902,0.00009832635,0.000020343638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046009223,0.00006138699,0.00053411385,0.000006752455,0.000062774154,5.765231e-7,0.00073826633,0.119295076,0.000080786434,0.7424191,0.002111156,0.134644],"study_design_scores_gemma":[0.0012299698,0.00014455513,0.00025140948,0.000026706115,0.0000066187877,0.0000035701055,0.000016856395,0.99125904,0.00043377466,0.0005687479,0.0058571203,0.00020165394],"about_ca_topic_score_codex":0.0000035201201,"about_ca_topic_score_gemma":0.000020903093,"teacher_disagreement_score":0.8719639,"about_ca_system_score_codex":0.000029795097,"about_ca_system_score_gemma":0.00006263229,"threshold_uncertainty_score":0.5500937},"labels":[],"label_agreement":null},{"id":"W2055010438","doi":"10.1109/spawc.2014.6941626","title":"Optimal resource sharing and network beamforming for bidirectional relay networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Transceiver; Computer science; Computer network; Beamforming; Shared resource; Spectral efficiency; Resource (disambiguation); Scheme (mathematics); Resource allocation; Throughput; Distributed computing; Topology (electrical circuits); Telecommunications; Engineering; Wireless; Mathematics; Electrical engineering; Power (physics); Physics","score_opus":0.026255341394819023,"score_gpt":0.2604228306315753,"score_spread":0.23416748923675626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055010438","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027283283,0.0003626344,0.9885088,0.0007708092,0.00016044485,0.00013254718,9.67337e-8,0.0001824111,0.0071539315],"genre_scores_gemma":[0.4158846,0.00028791034,0.5780083,0.001651548,0.0008121539,0.00006919675,0.000008429118,0.000020649246,0.0032571836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912065,0.000049586244,0.00017819836,0.00030489662,0.00008357094,0.00026311906],"domain_scores_gemma":[0.99907434,0.00032081496,0.00005405596,0.00040865593,0.00005986128,0.00008225289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008080231,0.00010263533,0.00012335673,0.000040364146,0.00055122277,0.00019983458,0.0005143047,0.0000486713,0.000011008302],"category_scores_gemma":[0.000053185664,0.00009480149,0.000040488565,0.00024255925,0.000030365865,0.00025208606,0.000555822,0.00013025192,0.0000025273523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011559993,0.000014586096,0.0015074532,0.0000048793863,0.000019321085,1.740007e-7,0.00019009203,0.29323,0.000027169523,0.5519736,0.008627838,0.14439338],"study_design_scores_gemma":[0.00017689113,0.000036613485,0.0003024875,0.000020021535,0.0000024076387,0.00000680358,0.0000055162395,0.8495494,0.000016111917,0.00037716515,0.14939311,0.00011347024],"about_ca_topic_score_codex":0.000001547774,"about_ca_topic_score_gemma":0.000012896388,"teacher_disagreement_score":0.5563194,"about_ca_system_score_codex":0.000019717723,"about_ca_system_score_gemma":0.000009806117,"threshold_uncertainty_score":0.42396155},"labels":[],"label_agreement":null},{"id":"W2055253680","doi":"10.1109/icc.2012.6364175","title":"Link-by-link feedback mechanism for intra-session random linear network coding in wireless sensor networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Network packet; Linear network coding; Decoding methods; Sink (geography); Wireless sensor network; Node (physics); Session (web analytics); Coding (social sciences); Algorithm","score_opus":0.03439614885350733,"score_gpt":0.2818147859416129,"score_spread":0.24741863708810558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055253680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033384564,0.0006885533,0.9895094,0.0034210654,0.0012276083,0.0006481483,0.0000012084995,0.00022171787,0.000943827],"genre_scores_gemma":[0.91727364,0.002306229,0.07598633,0.0020958986,0.0015595747,0.000105456995,0.000025066081,0.000031065945,0.0006167041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773616,0.00033474964,0.0005335136,0.00038850823,0.00019320262,0.0008138414],"domain_scores_gemma":[0.99788153,0.00083780737,0.00015731475,0.0007215422,0.00018504017,0.00021676249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014595229,0.0002655658,0.00039094448,0.00008250411,0.0004034214,0.00016147472,0.00093900965,0.00019758468,0.000036349782],"category_scores_gemma":[0.000082369865,0.00023184295,0.00011122819,0.0006829724,0.000037188525,0.00060408417,0.0005005151,0.00041568815,0.000026444055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014170488,0.0001525805,0.001217582,0.000026369915,0.000042778975,0.0000018194695,0.0008625994,0.0054340493,0.0030700266,0.73653704,0.012359278,0.24015419],"study_design_scores_gemma":[0.00222106,0.000045016135,0.00014458346,0.00013890033,0.000007485804,0.0000047031763,0.000028561655,0.9869697,0.001996654,0.00079708843,0.0072790105,0.00036720204],"about_ca_topic_score_codex":0.00000643282,"about_ca_topic_score_gemma":0.000032867236,"teacher_disagreement_score":0.9815357,"about_ca_system_score_codex":0.00008275527,"about_ca_system_score_gemma":0.000037048863,"threshold_uncertainty_score":0.9454281},"labels":[],"label_agreement":null},{"id":"W2055270878","doi":"10.48550/arxiv.0908.3234","title":"Overlapped Chunked Network Coding","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Linear network coding; Decoding methods; Computer science; Encoding (memory); Coding (social sciences); Computational complexity theory; Context (archaeology); Resilience (materials science); Theoretical computer science; Algorithm; Mathematics; Computer network; Artificial intelligence","score_opus":0.08308879224724217,"score_gpt":0.3011594798972222,"score_spread":0.21807068764998003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055270878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2547625,0.0058892383,0.699308,0.0063217925,0.0033570384,0.00086832885,0.0000035852752,0.0014409827,0.028048554],"genre_scores_gemma":[0.9689474,0.0028542047,0.024554592,0.0020775667,0.0007793441,0.00004137403,0.00003175449,0.000025581641,0.0006881918],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99750185,0.00032016382,0.0005326855,0.00080435484,0.00029060102,0.0005503377],"domain_scores_gemma":[0.9966499,0.00016061275,0.00032321623,0.0025178778,0.00018445608,0.00016392968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007135922,0.00039169687,0.00046822548,0.00010110681,0.0005119319,0.00033399975,0.0031554915,0.00026299054,0.000066534696],"category_scores_gemma":[0.00008282859,0.00040460486,0.00020699082,0.00053441356,0.00005532992,0.00025541315,0.003947719,0.0011223543,0.00024754298],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005679223,0.0005662213,0.17209041,0.00019439564,0.0005209646,0.00010522789,0.0061004483,0.02013695,0.0044711563,0.27019837,0.071693875,0.45386517],"study_design_scores_gemma":[0.0012894949,0.00014601945,0.58355165,0.0016690297,0.000073614254,0.000019683932,0.000034979297,0.26265496,0.00085360586,0.014957555,0.13201444,0.0027349335],"about_ca_topic_score_codex":0.000004414496,"about_ca_topic_score_gemma":0.000030263458,"teacher_disagreement_score":0.7141849,"about_ca_system_score_codex":0.00013653794,"about_ca_system_score_gemma":0.00020596547,"threshold_uncertainty_score":0.99984056},"labels":[],"label_agreement":null},{"id":"W2055274454","doi":"10.1109/twc.2012.070212.111859","title":"Cross-Layer Optimization Using Advanced Physical Layer Techniques in Wireless Mesh Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Telecommunications link; Physical layer; Linear network coding; Cross-layer optimization; Scheduling (production processes); Computer network; Single antenna interference cancellation; Wireless network; Wireless; Distributed computing; Mathematical optimization; Channel (broadcasting); Telecommunications; Mathematics; Network packet","score_opus":0.05946926621722743,"score_gpt":0.3419424684212662,"score_spread":0.28247320220403876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055274454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04364114,0.0002085509,0.9536579,0.0005382899,0.00027636965,0.00047250648,0.0000057660504,0.00042312182,0.00077632186],"genre_scores_gemma":[0.93944716,0.0025157407,0.057290457,0.00026984,0.000056260495,0.0002770751,0.000011846941,0.000040892024,0.000090697235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977281,0.0005739848,0.00052251114,0.00037084994,0.0002670309,0.00053749833],"domain_scores_gemma":[0.9958713,0.0004519772,0.00018758637,0.003063512,0.0002528248,0.00017276488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004925604,0.00031050268,0.0003414335,0.0003317736,0.0009624262,0.00021606225,0.0023688327,0.00016210056,0.000029940025],"category_scores_gemma":[0.000007913912,0.00033527895,0.00014933682,0.001551061,0.00022620076,0.0017419046,0.00008304408,0.00086987886,0.000016989596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003947375,0.0026311032,0.00087690237,0.00001538557,0.00006973131,0.0000011270597,0.0028048782,0.537413,0.008958384,0.041595504,0.000033328346,0.40556118],"study_design_scores_gemma":[0.00038190416,0.0000343609,0.00034419555,0.00011262169,0.000015217954,0.000007838896,0.00004281101,0.9871551,0.011156401,0.000029736964,0.00034389528,0.0003759214],"about_ca_topic_score_codex":0.000028694267,"about_ca_topic_score_gemma":0.000101815174,"teacher_disagreement_score":0.8963675,"about_ca_system_score_codex":0.00029116397,"about_ca_system_score_gemma":0.0000822212,"threshold_uncertainty_score":0.99990994},"labels":[],"label_agreement":null},{"id":"W2055465175","doi":"10.1109/wcl.2012.072012.120473","title":"Performance Analysis of Pairwise Amplify-and-Forward Multi-Way Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Moment-generating function; Pairwise error probability; Cumulative distribution function; Relay; Probability density function; Computer science; Pairwise comparison; Expression (computer science); Multiplexing; Signal-to-noise ratio (imaging); Topology (electrical circuits); Context (archaeology); Closed-form expression; Interference (communication); Random variable; Algorithm; Mathematics; Telecommunications; Fading; Statistics; Power (physics); Decoding methods; Artificial intelligence; Channel (broadcasting); Physics","score_opus":0.0512651973555051,"score_gpt":0.28661516263349224,"score_spread":0.23534996527798713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055465175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46691784,0.0019397591,0.5275312,0.0028479346,0.00016778398,0.00018770254,0.0000039971546,0.00014033279,0.000263427],"genre_scores_gemma":[0.9598008,0.0063561047,0.03252336,0.0011487284,0.000027659538,0.00006284948,0.000029281342,0.000014129583,0.000037088983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982191,0.00048741497,0.00049551675,0.00023810151,0.00019154433,0.0003683228],"domain_scores_gemma":[0.99526453,0.00047699135,0.00027515346,0.0036993574,0.00013096034,0.0001529836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008457085,0.0001955671,0.00037287807,0.00038745903,0.00050332665,0.00007581122,0.0026960135,0.00008270975,0.0000087123135],"category_scores_gemma":[0.000022157335,0.00019412067,0.0001382524,0.0018756015,0.000313864,0.0007109624,0.00093263935,0.00041153515,0.000011259711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028078946,0.001333496,0.37943986,0.00006623119,0.0027068665,0.0000011082763,0.015353053,0.08655497,0.024475247,0.04820722,0.0032223202,0.43861154],"study_design_scores_gemma":[0.00022732453,0.000011807919,0.08635599,0.00003327384,0.00014887305,0.0000023860616,0.000034976874,0.9101032,0.00027351035,8.396744e-7,0.0025757034,0.00023208687],"about_ca_topic_score_codex":0.000025579151,"about_ca_topic_score_gemma":0.00006509718,"teacher_disagreement_score":0.82354826,"about_ca_system_score_codex":0.00006408273,"about_ca_system_score_gemma":0.000018575955,"threshold_uncertainty_score":0.7916011},"labels":[],"label_agreement":null},{"id":"W2056014047","doi":"10.1109/glocom.2014.7037600","title":"A Bayesian game analysis of cooperative MAC with incentive for wireless networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Bayesian game; Nash equilibrium; Constraint (computer-aided design); Complete information; Mathematical optimization; Game theory; Incentive; Wireless; Channel (broadcasting); Repeated game; Wireless network; Stochastic game; Scheme (mathematics); Set (abstract data type); Incentive compatibility; Computer network; Mathematical economics; Microeconomics; Telecommunications; Mathematics; Economics","score_opus":0.016357415449313985,"score_gpt":0.2612034919621141,"score_spread":0.24484607651280013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056014047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045383153,0.00004820937,0.99202615,0.00037649157,0.000031404412,0.00022156951,0.0000019401634,0.000055051685,0.002700892],"genre_scores_gemma":[0.97806287,0.00007225238,0.021091053,0.00042527405,0.000018545852,0.000041409676,0.000014815812,0.0000059844633,0.00026776723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990412,0.00016404498,0.00021734672,0.00027340816,0.00012271905,0.00018126183],"domain_scores_gemma":[0.99842876,0.00035003904,0.00011909754,0.00060701696,0.00043023922,0.00006486973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003100844,0.00011961527,0.00031503395,0.00016223162,0.00011761152,0.00007611006,0.00066453376,0.000035004625,0.000034429602],"category_scores_gemma":[0.000021984,0.000088274785,0.00008728713,0.0016606232,0.00007726776,0.00019872705,0.00017910825,0.0000793097,9.769894e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057004007,0.00012414706,0.0033628095,0.0000072456214,0.0009493413,3.9375357e-7,0.0017207308,0.04919308,0.00020445144,0.8423369,0.00045207946,0.1015918],"study_design_scores_gemma":[0.00035882433,0.00014920426,0.001874861,0.000017160723,0.00008758768,2.6374585e-7,0.000034559176,0.99574167,0.0005136114,0.00007774061,0.0010120246,0.00013249466],"about_ca_topic_score_codex":0.000009682802,"about_ca_topic_score_gemma":0.00051088835,"teacher_disagreement_score":0.9735246,"about_ca_system_score_codex":0.000023468008,"about_ca_system_score_gemma":0.00003372756,"threshold_uncertainty_score":0.35997412},"labels":[],"label_agreement":null},{"id":"W2056314367","doi":"10.1145/1582379.1582646","title":"Multiple-antenna multiple-relay system with precoding for multiuser transmission","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Precoding; Computer science; Base station; MIMO; Relay; Computer network; Upper and lower bounds; Spectral efficiency; Transmission (telecommunications); Dirty paper coding; Linear network coding; Spatial multiplexing; Multiplexing; Transmitter power output; Electronic engineering; Topology (electrical circuits); Telecommunications; Power (physics); Channel (broadcasting); Mathematics; Engineering; Electrical engineering; Transmitter; Network packet","score_opus":0.035196982351384284,"score_gpt":0.26267392186916894,"score_spread":0.22747693951778464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056314367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038710916,0.00028442897,0.99120086,0.0016125416,0.00010124987,0.00073434366,0.0000013177191,0.00058081123,0.0016133231],"genre_scores_gemma":[0.7844979,0.00006677169,0.21444964,0.00032345537,0.000035975623,0.00004638905,0.0000044527883,0.000010436449,0.00056498003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986388,0.000095480085,0.000307852,0.00043301843,0.00018598625,0.0003388464],"domain_scores_gemma":[0.9983988,0.00043523576,0.000090169924,0.000712525,0.00021824308,0.00014504688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033588964,0.00020825866,0.00022824347,0.0001006864,0.00042273916,0.0001734312,0.0009113235,0.00006679891,0.000008162435],"category_scores_gemma":[0.000048291426,0.00014770233,0.00009256588,0.00033999459,0.000022431952,0.000495741,0.000070174225,0.00014247397,0.000012924143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031560645,0.00040440887,0.0029556612,0.00010489609,0.00008174549,0.000010980465,0.004039448,0.0039123516,0.0497005,0.097644635,0.0015010535,0.8393287],"study_design_scores_gemma":[0.0017918326,0.00021000713,0.0019347011,0.0002160512,0.000006759909,0.000013930724,0.00007871814,0.98401695,0.0032781442,0.000011378066,0.008172607,0.00026891998],"about_ca_topic_score_codex":0.0000054146617,"about_ca_topic_score_gemma":0.000047987978,"teacher_disagreement_score":0.9801046,"about_ca_system_score_codex":0.00006893335,"about_ca_system_score_gemma":0.00004039573,"threshold_uncertainty_score":0.6023126},"labels":[],"label_agreement":null},{"id":"W2056352381","doi":"10.1109/infcom.2013.6566813","title":"Beneficial cooperation ratio in multi-hop wireless ad hoc networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hop (telecommunications); Computer network; Wireless ad hoc network; Wireless network; Scheduling (production processes); Reuse; Distributed computing; Wireless; Interference (communication); Channel (broadcasting); Mathematical optimization; Telecommunications; Engineering; Mathematics","score_opus":0.041194083823109316,"score_gpt":0.2762463118172146,"score_spread":0.23505222799410527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056352381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05491315,0.0008161677,0.9403836,0.0018806793,0.00023158459,0.00036203561,1.4556613e-7,0.00015239768,0.0012602236],"genre_scores_gemma":[0.98081446,0.0015390782,0.01563361,0.0010749749,0.00004297055,0.00008163062,0.000007841521,0.000007782979,0.0007976813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998938,0.00015219265,0.00028899446,0.00027369475,0.00011156024,0.00023550898],"domain_scores_gemma":[0.9990646,0.000085297936,0.000050131155,0.0005325852,0.00019912112,0.00006825627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022384802,0.0001268793,0.00014131184,0.000089435984,0.00018356631,0.0003468146,0.0007035449,0.000069312366,0.00021296272],"category_scores_gemma":[0.000023810047,0.000114691225,0.000030040412,0.0005758,0.000026203403,0.00082772586,0.00029692007,0.00019183253,0.00016014985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004218907,0.00017437915,0.00088333647,0.0000028470413,0.000007818873,0.0000018585497,0.0011357691,0.011540297,0.0029336968,0.101834364,0.0026364394,0.878845],"study_design_scores_gemma":[0.00040058425,0.00002607165,0.0074481876,0.000014327855,6.9356406e-7,0.0000012304681,0.000026417818,0.9898537,0.00026404156,0.00003622951,0.0017672837,0.00016123605],"about_ca_topic_score_codex":0.000023558781,"about_ca_topic_score_gemma":0.0013776808,"teacher_disagreement_score":0.9783134,"about_ca_system_score_codex":0.000053081356,"about_ca_system_score_gemma":0.00004543671,"threshold_uncertainty_score":0.46769726},"labels":[],"label_agreement":null},{"id":"W2056426543","doi":"10.1109/lsp.2013.2295919","title":"Optimal Non-regenerative Linear MIMO Relay for Orthogonal Space Time Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"MIMO; Relay; Computer science; Block code; Node (physics); Algorithm; Transmission (telecommunications); Constraint (computer-aided design); Decoding methods; Mathematical optimization; Power (physics); Mathematics; Telecommunications; Beamforming; Engineering","score_opus":0.023744280591426612,"score_gpt":0.26893856541071093,"score_spread":0.24519428481928432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056426543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046428554,0.00013570789,0.94309455,0.009568772,0.00012724593,0.00020370877,0.0000025558716,0.00014208768,0.00029678797],"genre_scores_gemma":[0.8141506,0.000007400551,0.18056567,0.004313326,0.0004369998,0.000051014995,0.000009759319,0.000023582514,0.00044170336],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851763,0.00015237057,0.00026636297,0.0004585014,0.0002430638,0.00036206387],"domain_scores_gemma":[0.9989065,0.00022369236,0.00016301076,0.0003670243,0.00023013818,0.000109662375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004834239,0.00022411527,0.00024116399,0.000097562326,0.00057633844,0.00029198942,0.0008802178,0.00006298912,0.000014818638],"category_scores_gemma":[0.000035691563,0.00020704052,0.000093259834,0.0003329038,0.00012295044,0.000499385,0.00012183223,0.0002329155,0.00006311093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055092372,0.00009160884,0.000046318793,0.000057630383,0.000050961953,0.000004662617,0.0022194702,0.10973497,0.7543721,0.0023317484,0.021180533,0.10985486],"study_design_scores_gemma":[0.00042480568,0.00009394643,0.0000542713,0.0000976403,0.000009563775,0.0000066386197,0.000006143832,0.95955634,0.030755712,0.00003813933,0.008658775,0.0002980199],"about_ca_topic_score_codex":0.0000011270469,"about_ca_topic_score_gemma":0.0000021484364,"teacher_disagreement_score":0.8498214,"about_ca_system_score_codex":0.000045317367,"about_ca_system_score_gemma":0.00009896835,"threshold_uncertainty_score":0.84428674},"labels":[],"label_agreement":null},{"id":"W2056471420","doi":"10.1109/icc.2012.6364426","title":"Power bargaining in multi-source relay networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Bargaining problem; Computer science; Negotiation; Power (physics); Computer network; Relay channel; Transmitter power output; Transmission (telecommunications); Wireless; Scheme (mathematics); Wireless network; Game theory; Telecommunications; Microeconomics; Economics; Mathematics","score_opus":0.05589485373866623,"score_gpt":0.29830559773612775,"score_spread":0.24241074399746151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056471420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042073075,0.0011228517,0.9648847,0.00033204255,0.00017179374,0.00006761107,2.1584206e-8,0.00013609372,0.0290776],"genre_scores_gemma":[0.94966567,0.0001347142,0.047712203,0.0011110018,0.00002862278,0.0000072045355,5.6150276e-7,0.000006142489,0.0013339027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999158,0.00014087195,0.00016631983,0.00014188682,0.00008048274,0.00031243273],"domain_scores_gemma":[0.99920446,0.00012456447,0.000032769276,0.0005143038,0.000030989388,0.00009292786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005855199,0.000084075604,0.00009155978,0.00006863012,0.00009909588,0.000064501844,0.00061197404,0.000044146615,0.00011721497],"category_scores_gemma":[0.000044381664,0.0000745919,0.000027119477,0.00043920564,0.000017451017,0.00049839803,0.00047165772,0.00020629732,0.00007633301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006533611,0.00043268746,0.15838587,0.0000020712705,0.000021484011,0.000004134793,0.012972371,0.016292246,0.00040704658,0.6014506,0.005572459,0.20445247],"study_design_scores_gemma":[0.00033617186,0.000013191639,0.039707735,0.000019874355,6.0627934e-7,0.000005079779,0.00007650848,0.92689776,0.0000630091,0.000016061449,0.03267719,0.00018679886],"about_ca_topic_score_codex":0.0000036232054,"about_ca_topic_score_gemma":0.000020124466,"teacher_disagreement_score":0.94545835,"about_ca_system_score_codex":0.00003462954,"about_ca_system_score_gemma":0.000011289225,"threshold_uncertainty_score":0.30417696},"labels":[],"label_agreement":null},{"id":"W2056522052","doi":"10.1109/tvt.2013.2256806","title":"On the Performance and Power Optimization of Multihop Multibranch Relaying Networks With Cochannel Interferers","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Rayleigh fading; Cumulative distribution function; Probability density function; Upper and lower bounds; Interference (communication); Computer science; Signal-to-interference-plus-noise ratio; Signal-to-noise ratio (imaging); Mathematical optimization; Transmitter power output; Fading; Monte Carlo method; Optimization problem; Power (physics); Topology (electrical circuits); Mathematics; Algorithm; Telecommunications; Statistics; Transmitter; Physics","score_opus":0.010598778742230214,"score_gpt":0.20757854039241358,"score_spread":0.19697976165018335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056522052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23254496,0.00007162923,0.76487136,0.002004716,0.00006748918,0.00025391686,2.8868357e-7,0.00011648403,0.00006913072],"genre_scores_gemma":[0.98965776,0.00044068697,0.009530262,0.00023064502,0.0000025271656,0.00009782882,3.6712134e-7,0.00001060035,0.000029302979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999268,0.00006838299,0.00017108298,0.00023000203,0.000100955665,0.00016159742],"domain_scores_gemma":[0.99899596,0.00014059084,0.00007810622,0.00061505585,0.0001418153,0.000028460669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116534444,0.00013028235,0.00013458254,0.0002037668,0.00028955878,0.00004024461,0.00047518814,0.00011713488,0.000030422125],"category_scores_gemma":[0.000007149943,0.000088699584,0.000027965958,0.0006024812,0.00015968554,0.0002073748,0.0000114967415,0.00040731745,0.0000075643156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012619429,0.000067649606,0.000026964677,0.0000037974949,0.00003251403,5.430016e-7,0.0002516458,0.9662749,0.000840565,0.0030232505,0.000023583547,0.029441942],"study_design_scores_gemma":[0.00032309486,0.0003007759,0.00007238437,0.000101835256,0.000005723639,0.000011592025,0.0000845328,0.98945093,0.009478774,0.000030877658,0.000031268544,0.00010821272],"about_ca_topic_score_codex":0.0000035004116,"about_ca_topic_score_gemma":0.0000066607536,"teacher_disagreement_score":0.7571128,"about_ca_system_score_codex":0.000023652101,"about_ca_system_score_gemma":0.000012448575,"threshold_uncertainty_score":0.3617064},"labels":[],"label_agreement":null},{"id":"W2056720576","doi":"10.1049/iet-com.2013.0596","title":"Performance analysis of two‐way opportunistic decode‐and‐forward based systems in Nakagami‐ <i>m</i> fading environments","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Nakagami distribution; Computer science; Telecommunications; Decoding methods","score_opus":0.04907193897756067,"score_gpt":0.28851536492289076,"score_spread":0.23944342594533008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056720576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15323924,0.0017433208,0.83298856,0.0016044178,0.00012276744,0.00042905376,0.000016311964,0.000109562156,0.009746768],"genre_scores_gemma":[0.9849368,0.0021143884,0.0125826495,0.00019453086,0.000005158961,0.000059121998,0.00004556219,0.000007733714,0.000054086664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984101,0.0005193823,0.00047903383,0.00022977793,0.00017862642,0.00018307476],"domain_scores_gemma":[0.9960088,0.000653129,0.00021481246,0.0029819408,0.000054582873,0.00008670121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009684045,0.00012936718,0.00031567336,0.00040485928,0.00026478703,0.00007431814,0.0021199726,0.0000409814,0.000007828123],"category_scores_gemma":[0.00006990012,0.000134975,0.000067752546,0.0012036713,0.00015036142,0.00025536495,0.00081725104,0.0001927838,0.000007874308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016202821,0.0009365081,0.2723432,0.000109048764,0.0007061161,0.000001432142,0.0044379374,0.142722,0.009580176,0.32470366,0.00020463769,0.2442391],"study_design_scores_gemma":[0.0002926591,0.000024150038,0.029735574,0.000059132206,0.00006722911,7.5035433e-7,0.000023676745,0.9642388,0.000058163707,0.00005101891,0.005314882,0.00013395725],"about_ca_topic_score_codex":0.00004280481,"about_ca_topic_score_gemma":0.00020354004,"teacher_disagreement_score":0.8316975,"about_ca_system_score_codex":0.00006474218,"about_ca_system_score_gemma":0.00003565826,"threshold_uncertainty_score":0.550412},"labels":[],"label_agreement":null},{"id":"W2056749982","doi":"10.1109/rws.2014.6830080","title":"Energy efficiency of cooperative cognitive radio network with outage constraints","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Fractional programming; Interference (communication); Cognitive radio; Computer science; Mathematical optimization; Constraint (computer-aided design); Nonlinear programming; Power (physics); Efficient energy use; Convex optimization; Energy (signal processing); Computer network; Nonlinear system; Regular polygon; Telecommunications; Engineering; Wireless; Mathematics; Electrical engineering","score_opus":0.01924191250423134,"score_gpt":0.24635018953056056,"score_spread":0.2271082770263292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056749982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002462983,0.00014094537,0.9156976,0.00021094552,0.00006828059,0.00009318698,9.625194e-7,0.0000817608,0.08124337],"genre_scores_gemma":[0.98839885,0.00007552454,0.010366624,0.00070702843,0.000042212545,0.000018981964,0.0000035385106,0.0000066751586,0.00038055948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998791,0.0002879802,0.00022707412,0.00027739274,0.00017983142,0.0002367461],"domain_scores_gemma":[0.99855345,0.0004653368,0.00010888702,0.00043041285,0.00035778066,0.00008415748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035304236,0.0001426089,0.00022807375,0.000052407882,0.00018028615,0.000063486565,0.0006262034,0.000035576795,0.00013909371],"category_scores_gemma":[0.00005318638,0.000105236184,0.000035547877,0.00059238565,0.0003327525,0.00019341995,0.00022223135,0.00010314492,0.00001169065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012484457,0.00006611102,0.0004373628,0.0000024754952,0.000030501216,0.000001594035,0.00047241675,0.00077437394,0.00015466117,0.90584767,0.00039483042,0.091805495],"study_design_scores_gemma":[0.0040629203,0.0018495327,0.0031755453,0.00050205976,0.0000400798,0.00006450414,0.00039314083,0.95310575,0.018700842,0.002212274,0.01473426,0.0011591099],"about_ca_topic_score_codex":0.0000053675653,"about_ca_topic_score_gemma":0.00005581572,"teacher_disagreement_score":0.98593587,"about_ca_system_score_codex":0.000014232676,"about_ca_system_score_gemma":0.00008535537,"threshold_uncertainty_score":0.4291407},"labels":[],"label_agreement":null},{"id":"W2056765610","doi":"10.1007/s11277-012-0590-x","title":"Performances of Amplify-and-Forward Cooperative Relay Networks with Different Topologies","year":2012,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Relay; Path loss; Fading; Network topology; Transmitter; Ergodic theory; Cooperative diversity; MIMO; Transmission (telecommunications); Wireless; Computer network; Topology (electrical circuits); Wireless network; Power (physics); Channel (broadcasting); Telecommunications; Electrical engineering; Mathematics","score_opus":0.04679523415343934,"score_gpt":0.29010377341765503,"score_spread":0.2433085392642157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056765610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67960024,0.021160383,0.28426653,0.006827272,0.00018079233,0.0005234478,0.0000122926995,0.000272223,0.007156818],"genre_scores_gemma":[0.98110414,0.010211894,0.008243683,0.00019165616,0.000030215853,0.00007298624,0.000019417559,0.000009588292,0.0001164044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988174,0.00030047813,0.00025760886,0.0001696344,0.0001750056,0.00027986048],"domain_scores_gemma":[0.99778825,0.00049780915,0.00015291663,0.0012610859,0.00018778566,0.000112178575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031306958,0.00017556873,0.00025691773,0.000078764126,0.0006487046,0.00007500611,0.001485256,0.00006536365,0.000018564657],"category_scores_gemma":[0.000022415315,0.00012925152,0.000042493048,0.00035231738,0.00055037485,0.00057407777,0.0011202923,0.00039054512,0.000003753648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004960108,0.0005820506,0.075871676,0.00003508021,0.00021659033,4.1214417e-7,0.024894577,0.00056092005,0.00056044623,0.8072475,0.0005290323,0.08945209],"study_design_scores_gemma":[0.0012361343,0.0005230033,0.1385432,0.00032320048,0.00007624711,0.0000644227,0.004782917,0.8364378,0.0010817349,0.00011724506,0.015843743,0.00097032636],"about_ca_topic_score_codex":0.000013522894,"about_ca_topic_score_gemma":0.00010762318,"teacher_disagreement_score":0.8358769,"about_ca_system_score_codex":0.00003998603,"about_ca_system_score_gemma":0.000041797,"threshold_uncertainty_score":0.5270724},"labels":[],"label_agreement":null},{"id":"W2056880433","doi":"10.1145/1925101.1925102","title":"Optimal layered multicast","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multicast; Computer science; Linear network coding; Computer network; Throughput; Distributed computing; Node (physics); Source-specific multicast; Application layer; Coding (social sciences); Xcast; Reliable multicast; Mathematics","score_opus":0.07960425991603445,"score_gpt":0.30624533254473474,"score_spread":0.22664107262870029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056880433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010766907,0.00047085292,0.9929043,0.0017135643,0.000064964675,0.0005689419,0.000009916614,0.0004785611,0.002712191],"genre_scores_gemma":[0.5390942,0.0013137771,0.45909166,0.00020953448,0.000018198696,0.0001879546,0.000009392348,0.000013300855,0.00006194638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984312,0.00020546722,0.00043557383,0.00046877266,0.00015987357,0.00029909346],"domain_scores_gemma":[0.99402344,0.00074828917,0.00014048272,0.0046668346,0.00021586745,0.00020508592],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00031963288,0.00023471346,0.00021079723,0.00022336253,0.0015187435,0.0001343232,0.0035326101,0.00009131734,0.000047049336],"category_scores_gemma":[0.000034064065,0.0002447334,0.000090470785,0.0007758597,0.00030749573,0.00029507768,0.00038707667,0.0004972706,0.0001223309],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004802058,0.00062999554,0.00008919266,0.0000060411403,0.00005008957,4.6574914e-7,0.0031064695,0.00026942845,0.00046468712,0.029212844,0.00003991232,0.9661261],"study_design_scores_gemma":[0.0011660581,0.00016794242,0.0040202946,0.00008179526,0.000051218278,0.00004359256,0.00052468345,0.9448793,0.0016723876,0.0018165316,0.044791844,0.00078434875],"about_ca_topic_score_codex":0.000023856783,"about_ca_topic_score_gemma":0.00003080317,"teacher_disagreement_score":0.96534175,"about_ca_system_score_codex":0.000043532247,"about_ca_system_score_gemma":0.000055313416,"threshold_uncertainty_score":0.99978113},"labels":[],"label_agreement":null},{"id":"W2057026167","doi":"10.1109/twc.2013.071113.121109","title":"Multi-Carrier Asynchronous Bi-Directional Relay Networks: Joint Subcarrier Power Allocation and Network Beamforming","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Subcarrier; Relay; Computer science; Beamforming; Transceiver; Orthogonal frequency-division multiplexing; Asynchronous communication; Multiplexing; Multipath propagation; Electronic engineering; Computer network; Channel (broadcasting); Power (physics); Telecommunications; Wireless; Engineering","score_opus":0.0316909107759032,"score_gpt":0.2607169732368856,"score_spread":0.2290260624609824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057026167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00673654,0.001321942,0.98563516,0.003904917,0.00057787844,0.00069991924,0.0000074019526,0.00045707563,0.0006591643],"genre_scores_gemma":[0.898539,0.0046455446,0.09495265,0.0007534776,0.000048075293,0.00060555985,0.000016443157,0.00003971453,0.00039950787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975223,0.00050764886,0.00065019587,0.00053435145,0.00028384535,0.0005016502],"domain_scores_gemma":[0.9955706,0.0004913364,0.00022072095,0.0029980692,0.0004487513,0.00027054714],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005301487,0.00034956093,0.00033858154,0.00024372964,0.002235912,0.00041969155,0.0016557167,0.00019030794,0.00013777794],"category_scores_gemma":[0.000016156508,0.00036276024,0.00015221062,0.0010757277,0.00032831376,0.001174885,0.0000936779,0.0008817151,0.000088078436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003155712,0.0017147498,0.0005675701,0.000029813584,0.00058996875,0.0000026112698,0.005375386,0.38426295,0.008656408,0.04582693,0.0034793015,0.54946274],"study_design_scores_gemma":[0.00066121866,0.00009640179,0.0031804547,0.00012682997,0.000030475563,0.000034190754,0.00013188228,0.9892897,0.00069459516,0.00018321747,0.0050297347,0.0005412954],"about_ca_topic_score_codex":0.00007772486,"about_ca_topic_score_gemma":0.00034557795,"teacher_disagreement_score":0.8918025,"about_ca_system_score_codex":0.00020486565,"about_ca_system_score_gemma":0.00012999786,"threshold_uncertainty_score":0.99988246},"labels":[],"label_agreement":null},{"id":"W2057051378","doi":"10.1109/vtcfall.2012.6399295","title":"Power Allocation in Cooperative Space-Time Coded Wireless Relay Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Relay; Computer science; Computer network; Rayleigh fading; Transmitter power output; Topology (electrical circuits); Linear network coding; Power control; Wireless; Network topology; Relay channel; Wireless network; Cooperative diversity; Space–time code; Channel (broadcasting); Fading; Power (physics); Telecommunications; Engineering; Electrical engineering","score_opus":0.020633386828663083,"score_gpt":0.262971564063802,"score_spread":0.24233817723513892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057051378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04270909,0.0008264349,0.91317874,0.0033809075,0.0003444242,0.00033484926,2.9304323e-7,0.00023195194,0.0389933],"genre_scores_gemma":[0.99085796,0.00028149382,0.0053423904,0.0008241232,0.00004938199,0.000028189748,0.0000058848223,0.000009536295,0.0026010359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987247,0.00030527296,0.00024428673,0.00022443033,0.00014416678,0.00035713668],"domain_scores_gemma":[0.9988742,0.00017454279,0.00006229947,0.0006341634,0.00013734457,0.00011746615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064587797,0.00014318603,0.00016893685,0.00009463524,0.00014506733,0.000109794164,0.00064985285,0.00007631958,0.0002719832],"category_scores_gemma":[0.00003728291,0.00012667016,0.00003230256,0.0007693105,0.0000423506,0.00089688273,0.0003505602,0.00023258934,0.00025318243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001809072,0.0003960694,0.0059713623,0.0000027600365,0.00003066953,0.0000025277743,0.0055915075,0.010106271,0.004299806,0.93981427,0.01309049,0.020676188],"study_design_scores_gemma":[0.00048456097,0.000045670364,0.00973435,0.000037020654,0.0000020818227,0.0000059774666,0.00006861317,0.9795627,0.0013929497,0.000037584636,0.00830433,0.00032418614],"about_ca_topic_score_codex":0.0000062466024,"about_ca_topic_score_gemma":0.000042513126,"teacher_disagreement_score":0.9694564,"about_ca_system_score_codex":0.00009136386,"about_ca_system_score_gemma":0.000040837553,"threshold_uncertainty_score":0.51654595},"labels":[],"label_agreement":null},{"id":"W2057153424","doi":"10.1109/netcod.2013.6570822","title":"On multiplicative matrix channels over finite chain rings","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiplicative function; Linear network coding; Coding (social sciences); Matrix (chemical analysis); Mathematics; Transmitter; Lattice (music); Topology (electrical circuits); Finite field; Channel capacity; Discrete mathematics; Channel (broadcasting); Generator matrix; Computer science; Algorithm; Combinatorics; Telecommunications; Decoding methods; Physics; Mathematical analysis; Computer network","score_opus":0.027417103758861434,"score_gpt":0.2853105657450337,"score_spread":0.2578934619861723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057153424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03211416,0.00017002579,0.91788715,0.009113862,0.00025850147,0.00059348345,7.2111646e-7,0.00047099276,0.039391078],"genre_scores_gemma":[0.977942,0.000096616306,0.010389891,0.002513168,0.000038704304,0.000094975294,0.0000013680457,0.000007031652,0.008916227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991847,0.00007647585,0.00014563162,0.00026507574,0.00013115222,0.00019692488],"domain_scores_gemma":[0.9986455,0.00035763113,0.000053161326,0.0007561322,0.00010409309,0.00008352562],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014266318,0.0001144667,0.00010295752,0.00008077638,0.0001583363,0.00019181226,0.00088440947,0.000034280845,0.0005961339],"category_scores_gemma":[0.0000686852,0.00009239867,0.000040951578,0.00032298418,0.000028302202,0.0003637,0.0004479656,0.00013622465,0.001528837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026490131,0.000097275784,0.00017702227,0.0000030191609,0.000015490421,8.825181e-7,0.0017898218,0.0007775666,0.0015561854,0.9042458,0.018348271,0.072986],"study_design_scores_gemma":[0.00040818492,0.000079347396,0.0048887706,0.000029122762,9.883643e-7,0.0000011311594,0.000022958191,0.9693462,0.0023121985,0.00637994,0.01626533,0.00026577414],"about_ca_topic_score_codex":0.0000190543,"about_ca_topic_score_gemma":0.000004945188,"teacher_disagreement_score":0.9685687,"about_ca_system_score_codex":0.000030671363,"about_ca_system_score_gemma":0.000012643161,"threshold_uncertainty_score":0.99924856},"labels":[],"label_agreement":null},{"id":"W2057198623","doi":"10.1109/greencom.2012.6519617","title":"Energy efficiency in reliable cooperative communications with retransmissions","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Efficient energy use; Computer science; Energy consumption; Energy (signal processing); Power (physics); Communications system; Metric (unit); Cooperative diversity; Computer network; Telecommunications; Wireless; Engineering; Electrical engineering; Wireless network; Mathematics","score_opus":0.04072783905765114,"score_gpt":0.2839661465188428,"score_spread":0.24323830746119163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057198623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001021914,0.002227421,0.8654185,0.004809539,0.000055799046,0.00011040097,3.581772e-7,0.00013883573,0.12621726],"genre_scores_gemma":[0.9364205,0.0013894009,0.059874766,0.00071268674,0.000011667804,0.00003915014,0.000003797276,0.000006191699,0.001541817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990577,0.00017284129,0.00018959898,0.00016072049,0.00013019596,0.000288906],"domain_scores_gemma":[0.9981145,0.00015612712,0.000036332523,0.0014575524,0.00011240763,0.00012307838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003310837,0.00010585123,0.000118723045,0.000109307286,0.00030668604,0.00006610967,0.0014025996,0.00003679803,0.000078352874],"category_scores_gemma":[0.000013714595,0.00007802249,0.000019578782,0.0011782005,0.000085715146,0.0006445101,0.000407767,0.00018094575,0.000024997233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031552586,0.00028227747,0.0029837494,0.0000012381296,0.0000053666936,5.0795643e-7,0.0018249587,0.00011963376,0.00042481977,0.97400105,0.001185155,0.019168101],"study_design_scores_gemma":[0.0013468424,0.00023553101,0.007846258,0.0001945485,0.00000870562,0.000033038687,0.00042166753,0.6101455,0.0048074415,0.00076192355,0.37337613,0.0008224172],"about_ca_topic_score_codex":0.00003651537,"about_ca_topic_score_gemma":0.00033184912,"teacher_disagreement_score":0.9732391,"about_ca_system_score_codex":0.000049089358,"about_ca_system_score_gemma":0.00010308116,"threshold_uncertainty_score":0.3181665},"labels":[],"label_agreement":null},{"id":"W2057236017","doi":"10.1109/bsc.2010.5472917","title":"Bounds on timing jitter estimation in cooperative networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Jitter; Estimator; Computer science; Benchmark (surveying); Intersymbol interference; Static timing analysis; Cramér–Rao bound; Algorithm; Estimation theory; Real-time computing; Telecommunications; Mathematics; Statistics","score_opus":0.03233443089669678,"score_gpt":0.29716233885958016,"score_spread":0.26482790796288336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057236017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035336073,0.000018701932,0.93505484,0.0029896297,0.00036326874,0.00013720825,8.793074e-8,0.00011913756,0.025981026],"genre_scores_gemma":[0.97770226,0.000026885287,0.01966374,0.0019972334,0.000036576286,0.000018298779,0.0000030214972,0.0000049658447,0.0005470434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992843,0.00007782829,0.0001614263,0.0002117872,0.00009917813,0.00016546059],"domain_scores_gemma":[0.99919146,0.0001543886,0.00003333477,0.00050992187,0.00006582064,0.000045073397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030386477,0.00009482974,0.00009145655,0.00009426553,0.00015622258,0.00021492623,0.00053070986,0.00005251185,0.00012280958],"category_scores_gemma":[0.000054702126,0.00008123062,0.000020148442,0.0004058383,0.00003196557,0.00037669393,0.00017982908,0.00038173998,0.00008058727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066675684,0.00010320844,0.0009137573,0.0000013909042,0.0000062615727,0.0000045188203,0.0009281933,0.0500447,0.0012896179,0.73869014,0.0031438286,0.20486775],"study_design_scores_gemma":[0.00018647226,0.000030605785,0.003825774,0.000014137046,4.8516216e-7,0.000002362767,0.000006734585,0.99300146,0.00045301628,0.0002339842,0.0021332575,0.000111721805],"about_ca_topic_score_codex":0.0000044218223,"about_ca_topic_score_gemma":0.0002752224,"teacher_disagreement_score":0.94295675,"about_ca_system_score_codex":0.00002508601,"about_ca_system_score_gemma":0.00002787591,"threshold_uncertainty_score":0.33124885},"labels":[],"label_agreement":null},{"id":"W2057464015","doi":"10.1109/icassp.2010.5496019","title":"Optimal spectrum sharing and power allocation for OFDM-based two-way relaying","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Linear network coding; Orthogonal frequency-division multiplexing; Computer science; Power (physics); Constraint (computer-aided design); Coding (social sciences); Mathematical optimization; Decoding methods; Computer network; Optimization problem; Mathematics; Telecommunications; Algorithm; Channel (broadcasting)","score_opus":0.028870056569567044,"score_gpt":0.2866799533776942,"score_spread":0.25780989680812716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057464015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13667168,0.0000542531,0.85406214,0.0042568785,0.00019694334,0.00017918923,2.3282765e-7,0.00013413648,0.004444556],"genre_scores_gemma":[0.8532121,0.000010334108,0.14597486,0.00045203988,0.000030933872,0.000020228395,0.0000020805346,0.000005886133,0.00029149826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935746,0.000017186605,0.00013430988,0.0002575942,0.00007551483,0.00015795429],"domain_scores_gemma":[0.9992009,0.00010789449,0.000041921878,0.00052050274,0.00006840508,0.000060395596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003777703,0.0000820215,0.00007729067,0.00006143748,0.00024969943,0.00021327772,0.0005078811,0.00003108943,0.00005362082],"category_scores_gemma":[0.000048324015,0.00007554829,0.000027897453,0.00014953969,0.000028194843,0.0002982468,0.0002386485,0.0001460802,0.000008054659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011216702,0.000050902116,0.002589044,0.0000071824898,0.000011186511,6.6951736e-7,0.0005437148,0.0012153407,0.030214006,0.93940175,0.00048704966,0.02546797],"study_design_scores_gemma":[0.0004968347,0.00004475473,0.0016804889,0.00001073973,0.0000023186524,0.000003532878,0.000013977537,0.9847448,0.007338775,0.0007032936,0.0048129736,0.00014753807],"about_ca_topic_score_codex":0.0000041709895,"about_ca_topic_score_gemma":0.000087715125,"teacher_disagreement_score":0.98352945,"about_ca_system_score_codex":0.000013098399,"about_ca_system_score_gemma":0.00002692887,"threshold_uncertainty_score":0.30807698},"labels":[],"label_agreement":null},{"id":"W2057849483","doi":"10.1109/rws.2010.5434265","title":"Joint transmit and receive antenna selection using a probabilistic distribution learning algorithm in MIMO systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Estimation of distribution algorithm; Computational complexity theory; Probabilistic logic; Computer science; Algorithm; MIMO; Population; Antenna (radio); Selection (genetic algorithm); Mathematical optimization; Computation; Evolutionary computation; Probabilistic analysis of algorithms; Probability distribution; Mathematics; Artificial intelligence; Statistics; Telecommunications; Channel (broadcasting)","score_opus":0.031434718301441116,"score_gpt":0.259750864815881,"score_spread":0.22831614651443988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057849483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08991722,0.00015408563,0.90907526,0.0002236193,0.00016111933,0.00021595246,7.219803e-7,0.00009783787,0.00015418351],"genre_scores_gemma":[0.9791867,0.00012176484,0.020534875,0.000017424212,0.00003095004,0.000014011038,0.000005488216,0.000004384863,0.00008440977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913335,0.00017413474,0.00020486738,0.0002359023,0.000091714064,0.00016004921],"domain_scores_gemma":[0.99954313,0.00006194275,0.000054571607,0.00016485759,0.00012532629,0.000050165527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004964326,0.00008881561,0.00012131138,0.00006692574,0.0002042899,0.0001868343,0.00015860026,0.000052918866,0.0000075941157],"category_scores_gemma":[0.00007465954,0.00008111816,0.000018235072,0.00046802236,0.000035814213,0.00030287667,0.0000740522,0.0003654931,0.0000022054312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012501234,0.0002257094,0.008126814,0.00009348345,0.000032881497,0.0000100175375,0.0038197443,0.0052255075,0.17394343,0.12928292,0.00011061986,0.67911637],"study_design_scores_gemma":[0.0001764261,0.000033334654,0.0033907993,0.000047313402,0.0000023505916,0.000038918843,0.000037380512,0.99477106,0.00020673337,0.00013672015,0.001051387,0.00010758255],"about_ca_topic_score_codex":0.00009090793,"about_ca_topic_score_gemma":0.0002739993,"teacher_disagreement_score":0.9895455,"about_ca_system_score_codex":0.000060071114,"about_ca_system_score_gemma":0.000040118135,"threshold_uncertainty_score":0.33079025},"labels":[],"label_agreement":null},{"id":"W2057978321","doi":"10.1109/cnsr.2010.57","title":"Network Coding in Two-Relay OFDMA Networks Using Re-initialized Transmission Scheme","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Linear network coding; Computer science; Relay; Initialization; Computer network; Spectral efficiency; Broadcasting (networking); Coding (social sciences); Transmission (telecommunications); Scheme (mathematics); Algorithm; Telecommunications; Mathematics; Network packet","score_opus":0.05680221224789524,"score_gpt":0.3337565388141783,"score_spread":0.2769543265662831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057978321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03196676,0.0006201188,0.9581058,0.0014254799,0.00075492443,0.00023875687,1.6190864e-7,0.00023722695,0.006650779],"genre_scores_gemma":[0.8054888,0.0004793934,0.19261333,0.0009985213,0.00025627797,0.00001477472,0.0000025301106,0.000015628577,0.00013070775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982275,0.0002512287,0.0004408143,0.0004024536,0.00019602131,0.000482024],"domain_scores_gemma":[0.9986352,0.00024542204,0.00010391544,0.0007649356,0.000103272294,0.00014729283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095746666,0.00020151991,0.00026158147,0.00011631142,0.00037803574,0.00023009934,0.001114073,0.00010358089,0.00036705862],"category_scores_gemma":[0.000032431763,0.00018477919,0.0000751725,0.0010681775,0.00005727603,0.00051303185,0.00039395597,0.000737641,0.000010010964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006908331,0.00024368674,0.00847526,0.000017075157,0.000040989133,0.00003898861,0.0016456496,0.1594956,0.06794586,0.4589735,0.0025871533,0.30046713],"study_design_scores_gemma":[0.00082910754,0.000011740628,0.0006387177,0.00011837395,0.000003563189,0.000007036267,0.000010377975,0.9909253,0.00038364407,0.00044165467,0.006371275,0.00025919665],"about_ca_topic_score_codex":0.000042548276,"about_ca_topic_score_gemma":0.0004518164,"teacher_disagreement_score":0.8314297,"about_ca_system_score_codex":0.000037184418,"about_ca_system_score_gemma":0.00007817885,"threshold_uncertainty_score":0.7535077},"labels":[],"label_agreement":null},{"id":"W2057989819","doi":"10.1109/spcom.2010.5560467","title":"Cooperative BICM-OFDM: Sub-carrier and power allocation","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise error probability; Orthogonal frequency-division multiplexing; Computer science; Disjoint sets; Cooperative diversity; Multiplexing; Transmit diversity; Diversity scheme; Wireless; Transmitter power output; Minification; Mathematical optimization; Algorithm; Computer network; Wireless network; Mathematics; Channel (broadcasting); Telecommunications; Fading; Discrete mathematics","score_opus":0.019330078512188178,"score_gpt":0.2647007059522286,"score_spread":0.24537062744004043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057989819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44758904,0.00042046735,0.48480594,0.011026069,0.0007415536,0.00035151572,0.0000014144729,0.00036264,0.054701343],"genre_scores_gemma":[0.98880327,0.00017831754,0.008929445,0.0011214404,0.000025455833,0.000012473622,0.000001944506,0.0000047830226,0.0009228863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936354,0.00006198184,0.00012295475,0.00022513092,0.00009836081,0.00012800086],"domain_scores_gemma":[0.99907744,0.00008018863,0.000029848457,0.0005292019,0.00019616564,0.00008714423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023646526,0.00009100065,0.00008211077,0.000052169165,0.00021671124,0.00020263152,0.00042855315,0.000045107285,0.00015313648],"category_scores_gemma":[0.000060893544,0.000075050826,0.00001664617,0.0002668691,0.00006991057,0.00043986915,0.00029446004,0.00019703103,0.000044359433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023834643,0.000035644094,0.0006918655,0.0000012553988,0.000011366608,0.0000010748995,0.0014395933,0.000006211333,0.1127663,0.8184208,0.003627104,0.062996365],"study_design_scores_gemma":[0.0021111825,0.0003864454,0.065955475,0.000047307636,0.000016350145,0.0000974868,0.00032426658,0.29428586,0.18859294,0.004352653,0.4421837,0.0016463182],"about_ca_topic_score_codex":0.00000325968,"about_ca_topic_score_gemma":0.00015897963,"teacher_disagreement_score":0.8140682,"about_ca_system_score_codex":0.000007982805,"about_ca_system_score_gemma":0.000045410707,"threshold_uncertainty_score":0.3060484},"labels":[],"label_agreement":null},{"id":"W2058249343","doi":"10.1109/glocom.2012.6503366","title":"Opportunistic network and erasure coding for asynchronous two-way relay networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Erasure; Relay; Computer network; Asynchronous communication; Linear network coding; Erasure code; Coding (social sciences); Distributed computing; Decoding methods; Telecommunications; Power (physics); Sociology; Network packet","score_opus":0.05412027862464628,"score_gpt":0.2918108702636802,"score_spread":0.23769059163903392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058249343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006032951,0.0026808449,0.9852238,0.0007813448,0.0005977145,0.000294199,7.059334e-7,0.00019226497,0.009625789],"genre_scores_gemma":[0.91714513,0.0009571662,0.079490066,0.0011851299,0.0005710089,0.00004899494,0.000008700627,0.00001474488,0.00057906896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871486,0.0001248068,0.00025020275,0.00025843404,0.00010701797,0.0005446761],"domain_scores_gemma":[0.9984997,0.00047932682,0.00008844083,0.00059092883,0.00010073417,0.00024089952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010032852,0.00016601046,0.00019751766,0.000038475227,0.0005521921,0.00018886077,0.0005247753,0.00006366709,0.000040532865],"category_scores_gemma":[0.000055942382,0.00014818278,0.00005149665,0.00026720358,0.000051876323,0.00047867384,0.0004237346,0.00017516018,0.000009050233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005034897,0.000030088728,0.0026419007,0.000006167462,0.000022325328,6.936044e-7,0.00023332186,0.0018659926,0.00004494325,0.86528754,0.0077061793,0.12215582],"study_design_scores_gemma":[0.00059609325,0.00007221888,0.0030405025,0.000049496506,0.000017799235,0.00003081774,0.000018217477,0.9510118,0.000018602348,0.00090000534,0.04387473,0.00036973],"about_ca_topic_score_codex":0.0000025464415,"about_ca_topic_score_gemma":0.000022836184,"teacher_disagreement_score":0.9491458,"about_ca_system_score_codex":0.0000411582,"about_ca_system_score_gemma":0.000031905198,"threshold_uncertainty_score":0.6042718},"labels":[],"label_agreement":null},{"id":"W2058294127","doi":"10.1109/netcod.2012.6261884","title":"Coding delay analysis of Chunked codes over line networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Linear network coding; Probabilistic logic; Coding (social sciences); Computer science; Probabilistic analysis of algorithms; Bernoulli's principle; Mathematics; Algorithm; Computer network; Statistics","score_opus":0.045756526029508277,"score_gpt":0.3069131437553017,"score_spread":0.26115661772579346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058294127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024079794,0.0007888547,0.9672937,0.00017161148,0.000109694345,0.000051312825,5.683562e-7,0.0000766794,0.0074277963],"genre_scores_gemma":[0.9866773,0.0005882826,0.011873747,0.00040029603,0.00005024894,0.0000037850825,0.000006727841,0.0000035445867,0.00039606888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991802,0.00010697776,0.00024050366,0.00012855124,0.00012962261,0.00021412705],"domain_scores_gemma":[0.9988726,0.00021372324,0.000093013194,0.0006344058,0.00010156123,0.00008473855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004998352,0.00008550233,0.00021922802,0.00017937548,0.00009870549,0.00004399963,0.00061001565,0.000037777245,0.00024392271],"category_scores_gemma":[0.000028739641,0.000071391274,0.00010607444,0.00169378,0.000031506213,0.0003559528,0.00036699447,0.00009179811,0.000005809301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009074194,0.00025151568,0.06806467,0.0000055779324,0.0010495832,7.5914824e-7,0.0017097043,0.025176086,0.002271918,0.81818825,0.0026322587,0.08064059],"study_design_scores_gemma":[0.000101546255,0.00001153014,0.027436994,0.0000065652803,0.00007472874,5.436022e-7,0.000009506084,0.9699658,0.00052386674,0.0000148920935,0.0017539465,0.000100077166],"about_ca_topic_score_codex":0.000008024466,"about_ca_topic_score_gemma":0.000061831015,"teacher_disagreement_score":0.9625975,"about_ca_system_score_codex":0.00002069294,"about_ca_system_score_gemma":0.000010826888,"threshold_uncertainty_score":0.29112518},"labels":[],"label_agreement":null},{"id":"W2058388278","doi":"10.1109/comst.2014.2386799","title":"Cooperative Routing in Wireless Networks: A Comprehensive Survey","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Multipath routing; Computer network; Policy-based routing; Link-state routing protocol; Dynamic Source Routing; Static routing; Routing protocol; Distributed computing; Cooperative diversity; Routing (electronic design automation); Fading; Channel (broadcasting)","score_opus":0.09459744008214348,"score_gpt":0.32852723293983965,"score_spread":0.23392979285769616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058388278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04623764,0.00089264,0.9446519,0.0011538067,0.0024439974,0.00080790574,0.00001675492,0.0003962988,0.003399068],"genre_scores_gemma":[0.9923777,0.0022382655,0.0043465737,0.00040586985,0.00022203318,0.00013697812,0.00011255441,0.00003107318,0.00012895463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.975481,0.02205058,0.0010219902,0.0005853497,0.00031312852,0.0005479599],"domain_scores_gemma":[0.9849847,0.008228535,0.00037687185,0.005163984,0.0010888013,0.00015713669],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.011394844,0.0003540871,0.00067899434,0.00024385631,0.0008051701,0.00044342858,0.005480629,0.00016707381,0.000014545395],"category_scores_gemma":[0.0010812861,0.00037020014,0.000096970965,0.002150643,0.00032862814,0.0007023519,0.0016278732,0.0006803725,0.00007840312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054533135,0.0015759155,0.096234106,0.000029751101,0.00028252718,0.0000066027533,0.008094578,0.019972079,0.0077755144,0.61540806,0.0073505295,0.24321577],"study_design_scores_gemma":[0.0016036438,0.0001096166,0.23773472,0.00020032584,0.000010770464,0.000006906227,0.0000875446,0.74277645,0.0004319123,0.00046729462,0.015596512,0.00097431947],"about_ca_topic_score_codex":0.0006522683,"about_ca_topic_score_gemma":0.0077378773,"teacher_disagreement_score":0.94614005,"about_ca_system_score_codex":0.00019775795,"about_ca_system_score_gemma":0.00019534101,"threshold_uncertainty_score":0.9999002},"labels":[],"label_agreement":null},{"id":"W2058833752","doi":"10.1109/bsc.2008.4563218","title":"Multilevel coding strategy for two-hop single-user networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Hop (telecommunications); Fading; Linear network coding; Relay channel; Coding (social sciences); Computer network; Channel code; Decoding methods; Channel (broadcasting); Topology (electrical circuits); Algorithm; Mathematics; Network packet","score_opus":0.13948506193363389,"score_gpt":0.3176002544744966,"score_spread":0.1781151925408627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058833752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021199305,0.00021745832,0.9870907,0.00049973093,0.00022275263,0.00024531074,6.0303097e-7,0.00025875116,0.009344776],"genre_scores_gemma":[0.93544745,0.00019934519,0.059682675,0.0008570426,0.00012618734,0.00003598738,0.000004747012,0.000011590513,0.0036349571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897414,0.00006728427,0.00023682832,0.0002979031,0.00011550885,0.00030835602],"domain_scores_gemma":[0.99874127,0.00029613965,0.00006450821,0.0006139749,0.00018952462,0.00009458332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002097206,0.00014023806,0.00015252849,0.000058795722,0.0004895135,0.00012512277,0.0008745522,0.000046258498,0.00005812223],"category_scores_gemma":[0.000038526367,0.00012605509,0.000073391464,0.0002568727,0.00005105651,0.0003962454,0.0002860075,0.00012907342,0.00002052659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017499817,0.00022341973,0.00042243337,0.00000711301,0.000039350503,0.00000876552,0.00087458006,0.025714628,0.0041172733,0.6304738,0.026161417,0.31193972],"study_design_scores_gemma":[0.00067361334,0.00006630328,0.00047706757,0.000015062635,0.0000022175827,0.000017390337,0.000015370908,0.9828115,0.0012971432,0.00018050661,0.01422766,0.00021616163],"about_ca_topic_score_codex":0.000004183417,"about_ca_topic_score_gemma":0.000040885978,"teacher_disagreement_score":0.9570969,"about_ca_system_score_codex":0.000041343203,"about_ca_system_score_gemma":0.000046475012,"threshold_uncertainty_score":0.5140378},"labels":[],"label_agreement":null},{"id":"W2058891692","doi":"10.1109/itwksps.2010.5503160","title":"Optimality of subspace coding for linear operator channels over finite fields","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear map; Subspace topology; Linear network coding; Upper and lower bounds; Mathematics; Coding (social sciences); Algorithm; Finite field; Computer science; Topology (electrical circuits); Discrete mathematics; Combinatorics; Mathematical analysis; Statistics; Pure mathematics","score_opus":0.05048610128521687,"score_gpt":0.322071999761385,"score_spread":0.27158589847616815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058891692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051780526,0.000043034088,0.94316566,0.0019141062,0.00047369336,0.00020092377,0.0000024247136,0.00007217441,0.002347454],"genre_scores_gemma":[0.89928603,0.0000598801,0.09917487,0.0005349339,0.00008162652,0.000018398214,0.0000020805476,0.0000046629634,0.0008375088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935395,0.00003666041,0.00018341841,0.0001854844,0.00009143775,0.00014903571],"domain_scores_gemma":[0.9987121,0.00033935404,0.00005734746,0.00062276487,0.00020887869,0.000059529553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041624418,0.00008388905,0.00013508668,0.00004318476,0.0001307756,0.00006736205,0.0007255386,0.000063314554,0.0001382274],"category_scores_gemma":[0.00017153253,0.00007248751,0.000060894818,0.00020704241,0.000034689518,0.0002482107,0.00030061524,0.00016048689,0.0000061394207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020340583,0.00014398296,0.0010862924,0.000038732433,0.000033892487,8.3378967e-7,0.0019470033,0.0016055569,0.038397968,0.93129843,0.0052767363,0.020150255],"study_design_scores_gemma":[0.00041665655,0.000069236536,0.00045294748,0.000016062639,0.0000029526689,0.000001057528,0.00001471015,0.93112075,0.046744063,0.00031651897,0.02068013,0.00016488391],"about_ca_topic_score_codex":0.0000067291066,"about_ca_topic_score_gemma":0.000061249746,"teacher_disagreement_score":0.9309819,"about_ca_system_score_codex":0.0000056583362,"about_ca_system_score_gemma":0.000043028052,"threshold_uncertainty_score":0.2955955},"labels":[],"label_agreement":null},{"id":"W2058940366","doi":"10.4108/chinacom.2010.98","title":"Opportunistic relaying in two-way networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Scheme (mathematics); Computer network; Selection (genetic algorithm); Artificial intelligence; Power (physics)","score_opus":0.04196245197014219,"score_gpt":0.3064531750655192,"score_spread":0.264490723095377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058940366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01088992,0.00005941005,0.89761925,0.0015275092,0.0005355754,0.00009593972,7.770224e-8,0.00017392062,0.0890984],"genre_scores_gemma":[0.9767058,0.00010198769,0.021596447,0.0007809108,0.00005113663,0.000009116133,0.0000014896228,0.000004584767,0.0007485611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929756,0.00006530942,0.00017548977,0.00019191015,0.00008089148,0.00018881922],"domain_scores_gemma":[0.99900746,0.00014601155,0.00003440237,0.00069157104,0.00004408541,0.000076491786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046318985,0.000075845994,0.000087504755,0.00007276977,0.000114902614,0.000116233736,0.00084152434,0.000028674878,0.00014415858],"category_scores_gemma":[0.00005597166,0.00006864283,0.000023052171,0.00039388242,0.000028933842,0.00024291598,0.00038660117,0.00039176492,0.000037247366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.133938e-7,0.000022266213,0.002242641,5.580355e-7,0.0000015909973,0.0000074309514,0.00012137509,0.00030458186,0.001211175,0.8457603,0.0005465739,0.1497808],"study_design_scores_gemma":[0.0002457428,0.000008596503,0.0047754943,0.000010544998,7.216262e-7,0.000009833099,0.000009402049,0.9850549,0.000063438216,0.0010779959,0.008600239,0.00014310906],"about_ca_topic_score_codex":0.000010783422,"about_ca_topic_score_gemma":0.00071894645,"teacher_disagreement_score":0.9847503,"about_ca_system_score_codex":0.000013239205,"about_ca_system_score_gemma":0.000031736887,"threshold_uncertainty_score":0.27991733},"labels":[],"label_agreement":null},{"id":"W2059088170","doi":"10.1109/glocom.2012.6503851","title":"On cooperative wireless relaying: A joint routing and scheduling flow-based framework","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Wireless network; Distributed computing; Maximum throughput scheduling; Wireless; Throughput; Key (lock); Routing (electronic design automation); Wireless mesh network; Mathematical optimization; Dynamic priority scheduling; Round-robin scheduling; Mathematics; Telecommunications; Quality of service","score_opus":0.05318458060587731,"score_gpt":0.28937779869603586,"score_spread":0.23619321809015856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059088170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076461755,0.00038856055,0.9168697,0.0018960041,0.0001956228,0.00013110285,3.279287e-7,0.00018721102,0.00386973],"genre_scores_gemma":[0.8250415,0.000052902087,0.1724117,0.0023424642,0.000060852304,0.000012444342,8.509097e-7,0.000008544349,0.00006875982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885553,0.00019678457,0.0002112646,0.00025468573,0.000163162,0.00031854247],"domain_scores_gemma":[0.998607,0.00052068895,0.00006383181,0.0005493647,0.00010262492,0.00015652693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097286,0.00015332509,0.00016557,0.00007651176,0.0004692766,0.0002113561,0.00035835968,0.00007121168,0.00005775766],"category_scores_gemma":[0.00026357677,0.00012825466,0.00003636041,0.00037756152,0.00004708206,0.0003940604,0.00031621847,0.0003684247,0.000047231813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005659176,0.000077844634,0.0008162535,0.000004424316,0.000012087353,9.707438e-7,0.0022167368,0.002458913,0.0007007165,0.9414758,0.00009880168,0.052131783],"study_design_scores_gemma":[0.00026672962,0.000059285987,0.0011138334,0.00018146109,0.0000032608118,0.000003216496,0.000100401114,0.9940337,0.0031845039,0.00049439026,0.0003205449,0.00023865969],"about_ca_topic_score_codex":0.0000016769378,"about_ca_topic_score_gemma":0.00000262812,"teacher_disagreement_score":0.9915748,"about_ca_system_score_codex":0.000048182723,"about_ca_system_score_gemma":0.00004455428,"threshold_uncertainty_score":0.5230073},"labels":[],"label_agreement":null},{"id":"W2059201582","doi":"10.1109/ncc.2012.6176885","title":"Beamforming and combining based on estimated channels in cooperative relay networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Beamforming; Relay; Rayleigh fading; MIMO; Computer science; Relay channel; Channel (broadcasting); Signal-to-noise ratio (imaging); Fading; Electronic engineering; Algorithm; Telecommunications; Engineering; Physics","score_opus":0.05117857403270791,"score_gpt":0.2956632521405146,"score_spread":0.24448467810780666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059201582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039036743,0.00051658397,0.9497011,0.0010728191,0.00030430846,0.00023330416,2.2425142e-7,0.00017548502,0.008959489],"genre_scores_gemma":[0.9831402,0.00010265653,0.015232552,0.0013556376,0.00002777813,0.000020086005,0.0000039432707,0.000006850121,0.000110349174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990977,0.00014824304,0.00017930575,0.00018080582,0.00009533719,0.00029862623],"domain_scores_gemma":[0.99915594,0.00031667782,0.000040767663,0.00033575567,0.000047580936,0.00010328011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005824227,0.00012235572,0.00014076415,0.00011547271,0.0001977634,0.00011570098,0.0003063315,0.000048363392,0.000026459575],"category_scores_gemma":[0.00005970522,0.000104975465,0.00001545709,0.0005012146,0.000034048975,0.000512207,0.00022255913,0.00022061431,0.000013287467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003137961,0.00037389048,0.025505653,0.000008705098,0.000017070726,0.00000586454,0.0046788245,0.5591769,0.00029859718,0.30866876,0.0010276062,0.10020676],"study_design_scores_gemma":[0.00040482965,0.00005720166,0.003492969,0.00008219324,0.0000010135379,0.0000024792178,0.000030217978,0.99512297,0.00017626547,0.000012972569,0.00047628823,0.00014058905],"about_ca_topic_score_codex":0.0000048938055,"about_ca_topic_score_gemma":0.000012121012,"teacher_disagreement_score":0.9441034,"about_ca_system_score_codex":0.00003920309,"about_ca_system_score_gemma":0.00001960462,"threshold_uncertainty_score":0.42807752},"labels":[],"label_agreement":null},{"id":"W2059437848","doi":"10.1109/lcomm.2013.060513.130403","title":"An Accurate Approximation of the Exponential Integral Function Using a Sum of Exponentials","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hybrid automatic repeat request; Exponential function; Computer science; Interference (communication); Automatic repeat request; Function (biology); Signal-to-noise ratio (imaging); Algorithm; Applied mathematics; Expression (computer science); Moment-generating function; Mathematics; Mathematical optimization; Channel (broadcasting); Probability density function; Telecommunications link; Statistics; Telecommunications; Mathematical analysis","score_opus":0.0771026503211399,"score_gpt":0.30266393527125296,"score_spread":0.22556128495011307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059437848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4613435,0.00014006712,0.53552556,0.0023002722,0.0002344007,0.00031986262,0.0000016644988,0.000040952833,0.000093730676],"genre_scores_gemma":[0.9704813,0.000088025015,0.028906716,0.00042227548,0.000022709179,0.000053682426,0.000009194623,0.000008700329,0.000007396549],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822557,0.00076418155,0.00049572985,0.00016570573,0.00020551903,0.00014329476],"domain_scores_gemma":[0.9955405,0.00013961337,0.00043290824,0.0035510163,0.0002965672,0.00003936893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000385325,0.00011741394,0.00016866802,0.00013230319,0.00032449956,0.00009921388,0.0033237855,0.000043552896,0.000023422313],"category_scores_gemma":[0.000036420377,0.000095753545,0.00010259996,0.00062873604,0.0002557507,0.0010684035,0.0005449676,0.0001939433,0.0000070992496],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035850355,0.00012886223,0.00034980354,0.000008229881,0.000028724266,1.8905043e-8,0.0011723256,0.0011963813,0.97497666,0.011478896,0.00037126167,0.010285259],"study_design_scores_gemma":[0.00057069835,0.000066417975,0.017525427,0.00016891873,0.000058023517,0.0000058174787,0.00030849286,0.8752272,0.104095116,0.0010230402,0.0006278653,0.00032295706],"about_ca_topic_score_codex":0.00012445403,"about_ca_topic_score_gemma":0.000036574704,"teacher_disagreement_score":0.8740308,"about_ca_system_score_codex":0.000039703093,"about_ca_system_score_gemma":0.000047205765,"threshold_uncertainty_score":0.6176476},"labels":[],"label_agreement":null},{"id":"W2059708732","doi":"10.1145/1582379.1582483","title":"Distributed routing schemes for multi-hop fixed relay networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Relay; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Static routing; Distributed computing; Spectral efficiency; Routing (electronic design automation); Link-state routing protocol; Routing protocol; Hop (telecommunications)","score_opus":0.06512916462940962,"score_gpt":0.3173402338221548,"score_spread":0.25221106919274516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059708732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035391276,0.00030285158,0.995068,0.0029285748,0.00012034538,0.00020927175,0.0000010685654,0.00031790478,0.0006980671],"genre_scores_gemma":[0.7295309,0.00010795827,0.26856592,0.001134026,0.000054945074,0.000013742825,0.000019972907,0.000004247566,0.00056830025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991041,0.0000722896,0.00021881654,0.00025342184,0.000079461446,0.0002719552],"domain_scores_gemma":[0.99895126,0.00018123005,0.00006646034,0.0005729139,0.00015439132,0.00007374094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039766656,0.00011448403,0.00013087553,0.00003227877,0.00034077387,0.00017469999,0.00079876947,0.000053648724,0.000014363385],"category_scores_gemma":[0.000162078,0.000100299505,0.00006961606,0.0003745401,0.000016614458,0.00027456737,0.00018474499,0.00013205927,0.000008315059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008568782,0.00011704796,0.00035715828,0.0000018878702,0.000016976726,0.0000011925011,0.0002471304,0.0018472847,0.0006080503,0.5133702,0.0077988906,0.4756256],"study_design_scores_gemma":[0.00043627896,0.000038478724,0.0012388772,0.000016971031,0.0000022921242,0.0000014646392,0.000011409444,0.97523046,0.00044491354,0.0000971384,0.022335038,0.00014665777],"about_ca_topic_score_codex":8.246477e-7,"about_ca_topic_score_gemma":0.000008917164,"teacher_disagreement_score":0.9733832,"about_ca_system_score_codex":0.00003452848,"about_ca_system_score_gemma":0.000023037486,"threshold_uncertainty_score":0.4090095},"labels":[],"label_agreement":null},{"id":"W2060023469","doi":"10.1109/siu.2010.5648808","title":"Time synchronization in amplify-and-forward cooperative communication systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Synchronization (alternating current); Computer science; Diversity gain; Bit error rate; Communications system; Power (physics); Cooperative diversity; Wireless; Time synchronization; Electronic engineering; Real-time computing; Computer network; Telecommunications; Channel (broadcasting); Fading; Wireless network; Engineering","score_opus":0.015665376160722798,"score_gpt":0.25813474429332806,"score_spread":0.24246936813260525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060023469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13415149,0.002106335,0.79785013,0.006434794,0.00049905205,0.001194297,0.0000028212182,0.00063631305,0.057124782],"genre_scores_gemma":[0.99065787,0.0005217557,0.0076677576,0.00020924625,0.00001714529,0.00003360252,0.000013610146,0.00000597751,0.00087305286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991384,0.00021162156,0.0002202021,0.00019744375,0.00010041445,0.00013188059],"domain_scores_gemma":[0.9987884,0.00018435155,0.000056619414,0.0007673404,0.00014787608,0.00005542517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050496135,0.00009509137,0.00012823833,0.00010173437,0.00018893083,0.00024638878,0.00067677104,0.00006726637,0.000063228115],"category_scores_gemma":[0.00007693238,0.000085456355,0.000011390525,0.00043390706,0.000079110425,0.0005279233,0.00039657607,0.00028917432,0.00009964989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026971554,0.000064973334,0.00093462114,0.0000055959626,0.00000930713,8.1055737e-7,0.001813721,0.0011424028,0.0041521112,0.9570017,0.0013057512,0.033566345],"study_design_scores_gemma":[0.0002781502,0.000021098613,0.0017989599,0.000026546173,0.0000014357424,0.000009468797,0.000054309377,0.98744947,0.0001494002,0.00019334184,0.0098642735,0.0001535724],"about_ca_topic_score_codex":0.000026367385,"about_ca_topic_score_gemma":0.0002682429,"teacher_disagreement_score":0.986307,"about_ca_system_score_codex":0.000030230096,"about_ca_system_score_gemma":0.000045011482,"threshold_uncertainty_score":0.34848088},"labels":[],"label_agreement":null},{"id":"W2060275840","doi":"10.1109/twc.2012.032812.111931","title":"Cross Layer AMC Scheduling for a Cooperative Wireless Communication System over Nakagami-m Fading Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Nakagami distribution; Fading; Link adaptation; Computer network; Scheduling (production processes); Wireless network; Network packet; Wireless; Channel (broadcasting); Telecommunications; Mathematics; Mathematical optimization","score_opus":0.0697117113903807,"score_gpt":0.32982140953779215,"score_spread":0.26010969814741147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060275840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04266438,0.0013452584,0.95071185,0.0013893577,0.0008162232,0.0011772382,0.000054535943,0.0007291592,0.0011120172],"genre_scores_gemma":[0.96404535,0.0018405867,0.031534538,0.0004000185,0.00008720094,0.0015017503,0.000046538302,0.0000698686,0.00047417113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966169,0.00091302284,0.00084006327,0.00050702336,0.00037177157,0.0007512437],"domain_scores_gemma":[0.99170876,0.0015713065,0.000355353,0.005302454,0.00075335795,0.00030879016],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012860941,0.00045596747,0.00050048216,0.00037081316,0.0037010624,0.00061670097,0.0044180844,0.00023672351,0.00003134811],"category_scores_gemma":[0.00002542636,0.00048376556,0.00029160958,0.0012551108,0.0003494283,0.002004334,0.00013528718,0.0008826354,0.00009626038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015143258,0.0031276355,0.0004894592,0.00025342984,0.0007241747,0.0000011805649,0.02547073,0.08149294,0.018665638,0.6952383,0.000510575,0.17387454],"study_design_scores_gemma":[0.0016823265,0.00010747629,0.00031797087,0.000571362,0.00007528019,0.00002594914,0.0007612822,0.9679505,0.020705309,0.00008174593,0.006807119,0.00091366615],"about_ca_topic_score_codex":0.000037710837,"about_ca_topic_score_gemma":0.00011279884,"teacher_disagreement_score":0.92138094,"about_ca_system_score_codex":0.00049871526,"about_ca_system_score_gemma":0.00015053258,"threshold_uncertainty_score":0.9997614},"labels":[],"label_agreement":null},{"id":"W2060299871","doi":"10.1109/vetecs.2010.5493690","title":"Performance Analysis of Adaptive L-QAM for Opportunistic Decode-and-Forward Relaying","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quadrature amplitude modulation; Rayleigh fading; QAM; Spectral efficiency; Computer science; Electronic engineering; Modulation (music); Probability of error; Constant (computer programming); Topology (electrical circuits); Mathematics; Fading; Telecommunications; Algorithm; Bit error rate; Decoding methods; Physics; Engineering; Channel (broadcasting); Combinatorics","score_opus":0.054125518835455355,"score_gpt":0.2939012886763954,"score_spread":0.23977576984094007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060299871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15082833,0.00003446639,0.8427198,0.00039672095,0.000095525706,0.00013385393,0.0000026711361,0.000052602627,0.0057360283],"genre_scores_gemma":[0.9094794,0.00019378815,0.08978579,0.00012904148,0.000009203699,0.000016732834,0.0000039395077,0.0000031308773,0.00037898132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999382,0.0000233938,0.00020301224,0.00018368567,0.00008669459,0.00012116657],"domain_scores_gemma":[0.9989157,0.00025531524,0.000088211586,0.0004976143,0.00017810416,0.00006506486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039611745,0.00007399276,0.000180222,0.00017546557,0.0001608658,0.00003676579,0.00047823947,0.000033347616,0.000036608093],"category_scores_gemma":[0.00006428842,0.00006328987,0.00007079754,0.0005754369,0.000051330877,0.0002156229,0.0002260167,0.00010224428,0.0000018048539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012502648,0.00003777324,0.00816872,0.000009729487,0.00027087197,2.8540478e-7,0.0007150288,0.00024402539,0.0034243106,0.72383785,0.00023501302,0.2630439],"study_design_scores_gemma":[0.000117425814,0.000052092986,0.013961494,0.000005373265,0.00007573406,9.3242716e-7,0.000016230928,0.98356575,0.0004552914,0.000106400264,0.0015542723,0.00008900407],"about_ca_topic_score_codex":0.000003196023,"about_ca_topic_score_gemma":0.000095674724,"teacher_disagreement_score":0.9833217,"about_ca_system_score_codex":0.0000074100976,"about_ca_system_score_gemma":0.000039120114,"threshold_uncertainty_score":0.25808856},"labels":[],"label_agreement":null},{"id":"W2060418639","doi":"10.1016/j.adhoc.2011.06.012","title":"Bounds and parameter optimization of medium access control coding for wireless ad hoc and sensor networks","year":2011,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Network topology; Wireless ad hoc network; Computer network; Coding (social sciences); Scheduling (production processes); Wireless network; Wireless sensor network; Robustness (evolution); Wireless; Topology (electrical circuits); Mathematical optimization; Mathematics; Network packet; Telecommunications","score_opus":0.04556133526905069,"score_gpt":0.27617296447104744,"score_spread":0.23061162920199674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060418639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008863059,0.01043751,0.9793036,0.00033361185,0.00034267572,0.0004929217,0.0000026041448,0.00007899633,0.00014499908],"genre_scores_gemma":[0.93734354,0.023752343,0.03807359,0.00058618735,0.00009021764,0.00007055774,0.000011295508,0.000022017255,0.00005024749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985477,0.00017435105,0.000391592,0.00040646497,0.000124747,0.00035519752],"domain_scores_gemma":[0.9981312,0.00069916376,0.00025284893,0.0005383929,0.0002395893,0.0001387745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005254692,0.00021337044,0.00036225276,0.00008153333,0.00030172593,0.00024554261,0.0006560235,0.0001504623,0.000013624118],"category_scores_gemma":[0.000049339233,0.00020102561,0.00005781454,0.0003189648,0.0001780738,0.0005981431,0.00041580314,0.00021444437,2.9280665e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056303636,0.00019566905,0.0068402356,0.00009276417,0.0003206623,0.000008061167,0.00370446,0.15858705,0.00009792864,0.016933542,0.002213437,0.81044316],"study_design_scores_gemma":[0.001146912,0.00015557346,0.0023616818,0.000092585025,0.00003421872,0.000007759767,0.000027398637,0.9948253,0.00004084797,0.00015601638,0.0009180103,0.0002336653],"about_ca_topic_score_codex":0.0000017638906,"about_ca_topic_score_gemma":0.000035886056,"teacher_disagreement_score":0.94123006,"about_ca_system_score_codex":0.000021168018,"about_ca_system_score_gemma":0.000030082421,"threshold_uncertainty_score":0.8197587},"labels":[],"label_agreement":null},{"id":"W2060709278","doi":"10.1109/glocom.2011.6133704","title":"YMMV: Multiple Session Multicast with MIMO","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer science; Computer network; MIMO; Spatial multiplexing; Multiplexing; Session (web analytics); Protocol Independent Multicast; Distributed computing; Channel (broadcasting); Telecommunications","score_opus":0.0833060008081073,"score_gpt":0.2682793413243405,"score_spread":0.1849733405162332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060709278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029674944,0.000080702055,0.92041934,0.00034336981,0.00007045648,0.0001336235,1.8758641e-7,0.00028699002,0.048990373],"genre_scores_gemma":[0.842266,0.00003862289,0.15676762,0.00031353938,0.000009802523,0.000008153524,3.4039158e-7,0.0000040019,0.0005918708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944085,0.00005560413,0.0000979214,0.0001787423,0.00009264945,0.00013425868],"domain_scores_gemma":[0.9992792,0.000057680667,0.000030279843,0.00047861555,0.00008556344,0.00006867122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102737,0.00007640486,0.00007206696,0.0000368766,0.00012006832,0.000045723315,0.0006144655,0.00002048599,0.00017458845],"category_scores_gemma":[0.000017990771,0.000050821527,0.000017688542,0.00022321651,0.000031921925,0.00029694467,0.00028652576,0.00007904714,0.00011297999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006578463,0.0007225755,0.07614323,0.00001297884,0.000045961,0.000034160403,0.013255626,0.00003795178,0.009794297,0.28996134,0.0048729177,0.6050532],"study_design_scores_gemma":[0.0021755458,0.00037688788,0.089009166,0.00012976366,0.000008768247,0.000044719298,0.00031905083,0.8214451,0.055618066,0.00043543172,0.02964685,0.0007906703],"about_ca_topic_score_codex":0.000015744416,"about_ca_topic_score_gemma":0.00015100118,"teacher_disagreement_score":0.82140714,"about_ca_system_score_codex":0.00001060759,"about_ca_system_score_gemma":0.00002118323,"threshold_uncertainty_score":0.20724417},"labels":[],"label_agreement":null},{"id":"W2060919708","doi":"10.1007/s12083-011-0105-7","title":"I-Swifter: Improving chunked network coding for peer-to-peer content distribution","year":2011,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear network coding; Computer science; Coding (social sciences); Scheduling (production processes); Distributed computing; Download; Computer network; Peer-to-peer; Encoder; Content distribution; Mathematical optimization; Operating system; Mathematics","score_opus":0.09307694516990196,"score_gpt":0.2922369882356663,"score_spread":0.19916004306576435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060919708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002596204,0.0003326067,0.96930367,0.02251187,0.0006989892,0.0023116337,0.00006392186,0.00046201353,0.0017191147],"genre_scores_gemma":[0.8979087,0.00007536817,0.08868195,0.0030054848,0.0016693879,0.0027933323,0.00029532224,0.000059481772,0.0055109737],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99631345,0.00012346162,0.0007083067,0.0010793906,0.0007759241,0.0009994878],"domain_scores_gemma":[0.99512464,0.00037750628,0.00022460367,0.0014192311,0.0021706426,0.0006833948],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002279232,0.0004336775,0.00045553932,0.00015665506,0.001572615,0.0006116676,0.0015734369,0.00014710566,0.000015248404],"category_scores_gemma":[0.00030503547,0.00044946803,0.00015097602,0.0015086336,0.000069063746,0.00028689302,0.0010715378,0.0003700621,0.000087015105],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008958555,0.00023164267,0.0024277307,0.00004104538,0.00011065717,0.000002120277,0.0048131966,0.0025997825,0.0015406867,0.17841619,0.115733266,0.6939941],"study_design_scores_gemma":[0.00056078134,0.00018024686,0.0062684976,0.00013935463,0.000051831972,0.000011445045,0.00013397877,0.054819677,0.0004816932,0.0014285584,0.93515766,0.0007662561],"about_ca_topic_score_codex":0.000054303233,"about_ca_topic_score_gemma":0.00011161765,"teacher_disagreement_score":0.8953125,"about_ca_system_score_codex":0.00017202053,"about_ca_system_score_gemma":0.00007876856,"threshold_uncertainty_score":0.99979573},"labels":[],"label_agreement":null},{"id":"W2061008968","doi":"10.1109/tsp.2015.2423265","title":"Sum-Rate Optimal Network Beamforming and Subcarrier Power Allocation for Multi-Carrier Asynchronous Two-Way Relay Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Beamforming; Subcarrier; Computer science; Transceiver; Relay channel; Multiplexing; Asynchronous communication; Orthogonal frequency-division multiplexing; Electronic engineering; Transmission (telecommunications); Channel (broadcasting); Computer network; Power (physics); Telecommunications; Engineering; Wireless","score_opus":0.0539689869439438,"score_gpt":0.29974707521170074,"score_spread":0.24577808826775693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061008968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062048985,0.0013402076,0.9909558,0.00030481533,0.0004008486,0.000431341,0.000003281486,0.00021739773,0.00014140023],"genre_scores_gemma":[0.90034074,0.00008463766,0.09865711,0.00044989487,0.00012759835,0.00012024932,0.000004696955,0.00003439012,0.0001807139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815094,0.00017925084,0.0004159007,0.0005360399,0.00022058727,0.0004972843],"domain_scores_gemma":[0.9985171,0.00018660173,0.00017065836,0.00040133414,0.00044722023,0.0002771042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010901396,0.00028667002,0.0002642308,0.00012491753,0.001042472,0.0004591969,0.00048638048,0.00012785505,0.000011313627],"category_scores_gemma":[0.000012203181,0.00028207916,0.000087434186,0.0006002323,0.00011028261,0.0011477768,0.000015781605,0.00041894004,0.0000049010555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007470984,0.00007519898,0.00002362596,0.000011824736,0.000032314176,0.0000017419163,0.0015299143,0.7817483,0.0003758883,0.00040459033,0.0001009139,0.215621],"study_design_scores_gemma":[0.0012514541,0.00019737067,0.00003941457,0.0001254805,0.000029417457,0.000018502025,0.000112702524,0.9948679,0.0014926577,0.00007236699,0.0014382675,0.00035446967],"about_ca_topic_score_codex":0.0000057495113,"about_ca_topic_score_gemma":0.000048258866,"teacher_disagreement_score":0.89413583,"about_ca_system_score_codex":0.00013959878,"about_ca_system_score_gemma":0.00021989873,"threshold_uncertainty_score":0.99996316},"labels":[],"label_agreement":null},{"id":"W2061128065","doi":"10.1109/icc.2010.5501754","title":"Cross-Layer Design for TCP Throughput Optimization in Cooperative Relaying Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Throughput; Retransmission; Computer network; Relay; Transmission Control Protocol; Network packet; Physical layer; Link layer; Wireless; Telecommunications","score_opus":0.07137667514387112,"score_gpt":0.334072403035061,"score_spread":0.2626957278911899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061128065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011831442,0.00008993404,0.9937486,0.0007991358,0.00041964243,0.0005105105,3.0045723e-7,0.00013694278,0.0031117972],"genre_scores_gemma":[0.56720126,0.00015526135,0.43110046,0.0006896167,0.0000646451,0.000098843055,0.000004819267,0.000010538794,0.00067458523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887604,0.00013411908,0.0002887491,0.00034054014,0.00009650623,0.00026406356],"domain_scores_gemma":[0.99851954,0.0004776147,0.00006952206,0.00058256916,0.00029195522,0.000058774458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078483624,0.0001365266,0.00014915114,0.00007893423,0.00033719547,0.00038583842,0.0007787586,0.00010466101,0.00012937521],"category_scores_gemma":[0.00017905152,0.00012186279,0.000040110957,0.0005532587,0.000054557622,0.00080250663,0.0002553047,0.00031255302,0.000009083973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010617354,0.000037042537,0.00044537243,0.0000012886891,0.000005171198,6.738168e-7,0.0003646799,0.87722284,0.0005385123,0.110143006,0.00071909704,0.010511681],"study_design_scores_gemma":[0.0005252192,0.000042012052,0.00039930874,0.00001095741,0.000001275246,0.0000026228167,0.000010681356,0.99605536,0.0009254716,0.00017723908,0.0016811793,0.00016866083],"about_ca_topic_score_codex":0.000004559631,"about_ca_topic_score_gemma":0.00009159238,"teacher_disagreement_score":0.5660181,"about_ca_system_score_codex":0.000032722543,"about_ca_system_score_gemma":0.000071520735,"threshold_uncertainty_score":0.496942},"labels":[],"label_agreement":null},{"id":"W2061131139","doi":"10.1109/twc.2011.092011.110558","title":"Theoretical Bounds for Minimum Interference in Full Multi-Interface Multi-Channel Wireless Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Channel (broadcasting); Interference (communication); Computer science; Wireless; Wireless network; Polynomial; Algorithm; Function (biology); Upper and lower bounds; Interference alignment; Discrete mathematics; Combinatorics; Topology (electrical circuits); Mathematics; Telecommunications; MIMO; Mathematical analysis","score_opus":0.09028385438033766,"score_gpt":0.31475421879028254,"score_spread":0.2244703644099449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061131139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030105617,0.00044850845,0.99357647,0.0009991636,0.00048232466,0.0007753404,0.00001971358,0.00029192856,0.00039596943],"genre_scores_gemma":[0.9413759,0.0022124127,0.055152707,0.00026120353,0.00001363603,0.00076958945,0.00000848273,0.000040830466,0.0001652249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974425,0.0005695404,0.00071742386,0.0005815406,0.00015002096,0.00053901743],"domain_scores_gemma":[0.9949417,0.00081794866,0.00017254325,0.0035619233,0.0003184415,0.00018744347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059587695,0.00036358324,0.00039636157,0.00033529932,0.00080569123,0.00017080417,0.004579684,0.00020749899,0.000059457892],"category_scores_gemma":[0.000018479455,0.0003786075,0.0002039029,0.00085091527,0.00063283934,0.00050669466,0.00011266274,0.0009183149,0.000035980836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006545886,0.013513171,0.00009695565,0.00008690954,0.00038556237,0.00000783917,0.03824949,0.028762873,0.0067627802,0.5651683,0.00030375764,0.34600776],"study_design_scores_gemma":[0.001345318,0.00019652722,0.00011802197,0.00019559037,0.0000188903,0.0000089171435,0.0002836668,0.993174,0.0035604453,0.0005503872,0.00012389093,0.00042432122],"about_ca_topic_score_codex":0.00003694488,"about_ca_topic_score_gemma":0.002082968,"teacher_disagreement_score":0.96441114,"about_ca_system_score_codex":0.00016700165,"about_ca_system_score_gemma":0.00010666495,"threshold_uncertainty_score":0.9998666},"labels":[],"label_agreement":null},{"id":"W2061308128","doi":"10.1049/iet-com:20070490","title":"On the performance of time division multiple access-based multihop fixed cellular networks with respect to available frequency carriers","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Memorial University of Newfoundland","funders":"","keywords":"Time division multiple access; Computer network; Computer science; Cellular network; Base station; Throughput; Code division multiple access; Telecommunications; Wireless","score_opus":0.059758235845881476,"score_gpt":0.27547779234028463,"score_spread":0.21571955649440316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061308128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7326048,0.0011724528,0.24739611,0.008356298,0.000091850656,0.001363934,0.0000133909125,0.000315204,0.008685972],"genre_scores_gemma":[0.97506326,0.0007919225,0.02285363,0.0007643873,0.000010154328,0.00012580305,0.000021780204,0.000016486874,0.0003525551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841464,0.00045647626,0.0003215055,0.0002747714,0.000281814,0.00025077787],"domain_scores_gemma":[0.99296755,0.0013150716,0.00017365994,0.0050966726,0.00034111444,0.00010596193],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00049683114,0.000176581,0.00019821925,0.00012746488,0.0013015621,0.00009428171,0.0053407033,0.000051535368,0.0001033763],"category_scores_gemma":[0.0001779539,0.00012797065,0.00006272425,0.0012260415,0.00026689458,0.0003293678,0.0010942675,0.0003735187,0.0001231876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002803787,0.0020473255,0.2522856,0.000042122065,0.00031998134,0.000009200016,0.008739233,0.5856688,0.037651762,0.04135468,0.056121845,0.015479099],"study_design_scores_gemma":[0.00041978573,0.00023682379,0.009105777,0.00013015329,0.0000066695725,0.000001900233,0.000009726704,0.9815249,0.0046734316,0.000022895038,0.0036435418,0.00022441745],"about_ca_topic_score_codex":0.00006949158,"about_ca_topic_score_gemma":0.00010176559,"teacher_disagreement_score":0.39585608,"about_ca_system_score_codex":0.00007353119,"about_ca_system_score_gemma":0.0001593599,"threshold_uncertainty_score":0.9999986},"labels":[],"label_agreement":null},{"id":"W2061546110","doi":"10.1109/infcom.2010.5461941","title":"Incorporating Random Linear Network Coding for Peer-to-Peer Network Diagnosis","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Peer-to-peer; Computer network; Multicast; Scalability; Distributed computing; Redundancy (engineering); Dissemination; Network packet","score_opus":0.04104180829461391,"score_gpt":0.30458187367415174,"score_spread":0.26354006537953784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061546110","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028825733,0.00010724378,0.9697625,0.018351909,0.0018158403,0.0007661365,0.0000018487933,0.00036967557,0.005942266],"genre_scores_gemma":[0.47082373,0.000051789553,0.5209603,0.0036187826,0.0017686181,0.00036076305,0.000014726758,0.000023748007,0.0023775909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799097,0.00013443604,0.0004510647,0.0004729391,0.0003860359,0.000564559],"domain_scores_gemma":[0.99620944,0.0015014539,0.00015151095,0.0010170626,0.0008786804,0.00024186171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027400267,0.0002274224,0.00031514603,0.00006723007,0.00092357106,0.0004070732,0.001537212,0.000106453364,0.00009421168],"category_scores_gemma":[0.00095740164,0.0002046502,0.00013100496,0.0009582701,0.000044375483,0.00038181947,0.0008447793,0.00041931565,0.00007283263],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046504618,0.000068328576,0.007166209,0.000010077783,0.000046178204,0.0000025073416,0.0006093864,0.027441446,0.0005441805,0.5162618,0.3193511,0.12845229],"study_design_scores_gemma":[0.0011798501,0.000087067616,0.00058846973,0.000056095232,0.0000104494075,0.0000042713095,0.000014579137,0.5745649,0.0006118239,0.0034648501,0.41899505,0.00042262315],"about_ca_topic_score_codex":0.000007270374,"about_ca_topic_score_gemma":0.00041687328,"teacher_disagreement_score":0.54712343,"about_ca_system_score_codex":0.0000260938,"about_ca_system_score_gemma":0.00007801557,"threshold_uncertainty_score":0.8345393},"labels":[],"label_agreement":null},{"id":"W2062139809","doi":"10.1109/vtcfall.2012.6399017","title":"SVD-Based Channel Estimation for MIMO Relay Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Singular value decomposition; MIMO; Channel (broadcasting); Relay; Singular value; Computer science; Matrix (chemical analysis); Algorithm; Transmitter; Mathematics; Control theory (sociology); Eigenvalues and eigenvectors; Telecommunications; Artificial intelligence; Physics","score_opus":0.05306906228526653,"score_gpt":0.2978112054026764,"score_spread":0.24474214311740988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062139809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026983305,0.00042205927,0.9940555,0.002191023,0.0003519313,0.00020949716,2.5700473e-7,0.00017793603,0.0023219748],"genre_scores_gemma":[0.830101,0.000032809337,0.16794907,0.0013296586,0.000100110236,0.00006343278,0.000009106267,0.0000058476257,0.00040894776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936044,0.000058305908,0.00013819225,0.00012633442,0.00007614513,0.00024055692],"domain_scores_gemma":[0.9991008,0.00021642674,0.000048754904,0.00046510188,0.000085366795,0.000083561936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044021013,0.000080889506,0.00008014893,0.000046231562,0.00020713305,0.000075266806,0.00045296902,0.00004090026,0.000024190105],"category_scores_gemma":[0.000049766255,0.000070757655,0.000045228553,0.00023625339,0.000015179307,0.000430241,0.00010780391,0.000069858725,0.000027958455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012552338,0.00019016507,0.00039972574,0.000012537669,0.000017365617,1.702392e-7,0.0006574516,0.11468578,0.00012376125,0.57812953,0.031303603,0.27446738],"study_design_scores_gemma":[0.0002154786,0.000023506553,0.00053144153,0.000010570252,0.0000023531868,7.389267e-7,0.0000036586473,0.98932344,0.00038481853,0.00018177768,0.009219983,0.00010222716],"about_ca_topic_score_codex":0.0000011600846,"about_ca_topic_score_gemma":0.000004910845,"teacher_disagreement_score":0.87463766,"about_ca_system_score_codex":0.000027672651,"about_ca_system_score_gemma":0.000020062442,"threshold_uncertainty_score":0.28854135},"labels":[],"label_agreement":null},{"id":"W2062185918","doi":"10.1109/tit.2014.2308998","title":"A Geometric Perspective to Multiple-Unicast Network Coding","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Unicast; Conjecture; Linear network coding; Computer science; Mathematical proof; Coding (social sciences); Theoretical computer science; Graph theory; Graph; Mathematics; Discrete mathematics; Combinatorics; Multicast; Distributed computing; Computer network","score_opus":0.019479413173209274,"score_gpt":0.25567090724635516,"score_spread":0.23619149407314588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062185918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003642219,0.000023428991,0.98271483,0.00092562346,0.0005621659,0.00027069362,0.0000034009659,0.00029699187,0.014838646],"genre_scores_gemma":[0.9826821,0.00008498721,0.013944558,0.0029533803,0.00005316646,0.000071869545,0.0000017180895,0.0000074397058,0.00020078867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986966,0.00028996516,0.0003327184,0.00017467466,0.00023619487,0.00026980898],"domain_scores_gemma":[0.99789715,0.00080001075,0.00010407673,0.00074339955,0.00030967203,0.0001456872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010318207,0.00015489508,0.00015249714,0.00053656165,0.0006302056,0.00024135526,0.00078722154,0.00005839544,0.000079678146],"category_scores_gemma":[0.000119430246,0.00015198527,0.000088716326,0.001803016,0.00003807167,0.0014159757,0.000014568373,0.0002777264,0.00070634414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004196344,0.000046799087,0.00000400449,0.0000048350366,0.000027697575,1.3441955e-7,0.0039587677,0.12654409,0.000038005302,0.46284798,0.0007658149,0.4057199],"study_design_scores_gemma":[0.0020326325,0.00059410254,0.000869122,0.00018589225,0.000031241674,0.000026830436,0.0014258038,0.8904658,0.0047967527,0.012565778,0.085944556,0.0010614949],"about_ca_topic_score_codex":0.0000041721787,"about_ca_topic_score_gemma":0.000013260401,"teacher_disagreement_score":0.98231786,"about_ca_system_score_codex":0.00018710471,"about_ca_system_score_gemma":0.00003897803,"threshold_uncertainty_score":0.9078861},"labels":[],"label_agreement":null},{"id":"W2062238743","doi":"10.1109/pimrc.2011.6139808","title":"Performance analysis of variable-rate adaptive modulation for AF opportunistic relaying under outdated CSI","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quadrature amplitude modulation; Channel state information; Rayleigh fading; Computer science; Link adaptation; QAM; Spectral efficiency; Modulation (music); Electronic engineering; Fading; Bit error rate; Variable (mathematics); Control theory (sociology); Channel (broadcasting); Telecommunications; Mathematics; Wireless; Engineering; Physics; Acoustics; Artificial intelligence","score_opus":0.170747509729174,"score_gpt":0.28780901241639245,"score_spread":0.11706150268721846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062238743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018978588,0.000014769607,0.96969664,0.00005700123,0.00006224304,0.00014923069,0.0000030708193,0.00006775248,0.010970701],"genre_scores_gemma":[0.89704835,0.00006337319,0.102224834,0.00012980663,0.000006013305,0.000017671706,0.000022011442,0.0000046670866,0.0004832684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991793,0.00008991525,0.00028162912,0.00021681779,0.000090687456,0.00014166912],"domain_scores_gemma":[0.99873286,0.00014481337,0.00015528686,0.0005645762,0.00035358287,0.00004889796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005307602,0.000092146074,0.00019048847,0.0002200118,0.00015538686,0.000026242153,0.00048865017,0.00003861996,0.00008470731],"category_scores_gemma":[0.000033526525,0.00008268924,0.00006225127,0.0009868193,0.00002568748,0.0003952289,0.00016162022,0.000059254977,0.000003502165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038868387,0.00008563171,0.0025281606,0.000009339425,0.000512964,2.490669e-7,0.0015498236,0.03248189,0.0019291736,0.93921804,0.00007581669,0.021570018],"study_design_scores_gemma":[0.00015556552,0.00006259487,0.027128985,0.000011838151,0.000100291865,2.1109251e-7,0.000040374474,0.971138,0.00023710458,0.00096171384,0.000058368238,0.00010496862],"about_ca_topic_score_codex":0.000022646673,"about_ca_topic_score_gemma":0.000034827466,"teacher_disagreement_score":0.9386561,"about_ca_system_score_codex":0.000032387612,"about_ca_system_score_gemma":0.000055365956,"threshold_uncertainty_score":0.33719695},"labels":[],"label_agreement":null},{"id":"W2062314301","doi":"10.1109/lcn.2011.6115511","title":"G-local resource management: Achieving global optimization via local inference without message passing","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Overhead (engineering); Resource management (computing); Resource allocation; Wireless; Competition (biology); Resource (disambiguation); Channel state information; Resource consumption; Interference (communication); Optimization problem; Channel (broadcasting); Wireless network; Computer network; Telecommunications; Algorithm","score_opus":0.03919476348380012,"score_gpt":0.2725476717795677,"score_spread":0.23335290829576755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062314301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020256997,0.00010307154,0.83789617,0.00021468445,0.00006283099,0.000115009796,2.0426701e-7,0.00027634975,0.16112909],"genre_scores_gemma":[0.77567637,0.00008116989,0.22344878,0.0004956511,0.000011261741,0.000009192012,0.0000027498666,0.0000061889154,0.00026861465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868757,0.00019574483,0.00025928105,0.00036128715,0.00022126679,0.00027483446],"domain_scores_gemma":[0.99890876,0.000038208982,0.0000857001,0.00078153884,0.00007864166,0.000107156506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031558773,0.00016232386,0.0001419638,0.000061880375,0.00033809527,0.0001791728,0.0011679151,0.00005451864,0.00015315163],"category_scores_gemma":[0.000011399024,0.0001494248,0.00004252746,0.00061930483,0.00011816379,0.00060988456,0.0010620411,0.00013831869,0.000034484478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011058385,0.00007209402,0.002612836,0.000009847275,0.00002569356,0.000009052821,0.00063693675,0.020423135,0.000009289805,0.2487651,0.0001626934,0.72726226],"study_design_scores_gemma":[0.00027596412,0.000031999214,0.005500936,0.000061917555,0.000008803337,0.000008193594,0.00012796838,0.99066395,0.00010873087,0.0004989975,0.0024765353,0.00023598963],"about_ca_topic_score_codex":0.000015649446,"about_ca_topic_score_gemma":0.00003692792,"teacher_disagreement_score":0.97024083,"about_ca_system_score_codex":0.00010463875,"about_ca_system_score_gemma":0.00002392002,"threshold_uncertainty_score":0.6093366},"labels":[],"label_agreement":null},{"id":"W2062638024","doi":"10.1155/2015/841937","title":"Performance Analysis of SNR-Based HDAF M2M Cooperative Networks","year":2015,"lang":"en","type":"article","venue":"Journal of Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Fading; Nakagami distribution; Outage probability; Computer science; Power (physics); Upper and lower bounds; Electronic engineering; Topology (electrical circuits); Algorithm; Mathematics; Statistics; Telecommunications; Physics; Engineering; Channel (broadcasting); Combinatorics; Mathematical analysis","score_opus":0.02033821866887778,"score_gpt":0.22996551048588038,"score_spread":0.2096272918170026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062638024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099963434,0.0012470738,0.8984681,0.000124411,0.00011552942,0.000028686347,1.19092476e-7,0.00001661418,0.00003605965],"genre_scores_gemma":[0.9719255,0.00026678148,0.027592435,0.000112384456,0.00009184138,8.615749e-7,6.0996234e-7,0.000003953526,0.0000056257895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991305,0.00005723827,0.00036620907,0.00010529027,0.00018862216,0.00015216497],"domain_scores_gemma":[0.9989708,0.00016241193,0.00015454416,0.0001772671,0.00038705373,0.00014794274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038218047,0.00010546745,0.0003359773,0.0003654639,0.000038372542,0.00006116393,0.00043443165,0.000036970334,0.0000017561572],"category_scores_gemma":[0.000027981716,0.000084535925,0.00009288211,0.0016342391,0.000015699274,0.00023307321,0.00010637624,0.00024060323,2.7322452e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001174574,0.000042075,0.0015509188,0.0000034557459,0.00018691517,0.0000042561364,0.00011605723,0.95539963,0.00009132834,0.0020396905,0.00015079703,0.040403154],"study_design_scores_gemma":[0.00033092554,0.00036896364,0.007829827,0.000028180182,0.000056187444,0.0000137963325,9.876643e-7,0.99049467,0.00023039045,0.0000035864698,0.00054835627,0.000094154355],"about_ca_topic_score_codex":5.3926635e-7,"about_ca_topic_score_gemma":4.5856385e-7,"teacher_disagreement_score":0.8719621,"about_ca_system_score_codex":0.000037473503,"about_ca_system_score_gemma":0.0000645969,"threshold_uncertainty_score":0.3447275},"labels":[],"label_agreement":null},{"id":"W2062642781","doi":"10.1109/twc.2011.092911.101200","title":"Selective Subcarrier Pairing and Power Allocation for DF OFDM Relay Systems with Perfect and Partial CSI","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Subcarrier; Computer science; Channel state information; Pairing; Orthogonal frequency-division multiplexing; Multiplexing; Relay channel; Power (physics); Wireless; Computer network; Topology (electrical circuits); Mathematical optimization; Channel (broadcasting); Telecommunications; Mathematics; Engineering; Electrical engineering","score_opus":0.04922469583540679,"score_gpt":0.2633641391231565,"score_spread":0.2141394432877497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062642781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032072533,0.00064408727,0.9648074,0.00067349616,0.000118258075,0.0006990997,0.000009390111,0.00018791234,0.0007878399],"genre_scores_gemma":[0.98222214,0.0015063528,0.0154090095,0.00009471751,0.000009040611,0.0005947184,0.000004090156,0.000022919849,0.00013703504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986909,0.0003191397,0.0002799678,0.00035407493,0.0001314193,0.00022448153],"domain_scores_gemma":[0.99751097,0.00038426236,0.000116917996,0.0015631182,0.0003050156,0.00011973345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037866918,0.00019497736,0.00020951846,0.00015526346,0.0011583823,0.00015508823,0.00077803596,0.0000832891,0.0000046163477],"category_scores_gemma":[0.000008535955,0.00018149485,0.0000462116,0.00042288742,0.00023178183,0.0005223009,0.000027680251,0.0003294313,0.0000036994065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007047923,0.0026869734,0.0025968761,0.00024508155,0.0013073223,0.0000039669353,0.08887718,0.0076825675,0.0124092335,0.6205495,0.0005099657,0.26242656],"study_design_scores_gemma":[0.0026326831,0.0013636019,0.005090968,0.00045958947,0.00017024024,0.00009122287,0.001348802,0.9656494,0.016975973,0.00022547106,0.0048334445,0.0011586002],"about_ca_topic_score_codex":0.000050582945,"about_ca_topic_score_gemma":0.00024354311,"teacher_disagreement_score":0.95796686,"about_ca_system_score_codex":0.000065700486,"about_ca_system_score_gemma":0.000080187885,"threshold_uncertainty_score":0.89094573},"labels":[],"label_agreement":null},{"id":"W2062753093","doi":"10.1016/j.sigpro.2013.05.015","title":"Two-way cooperative communications with statistical channel knowledge","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Relay; Transceiver; Beamforming; Computer science; Channel (broadcasting); Relay channel; Channel state information; Computer network; Transmitter power output; Probabilistic logic; Bandwidth (computing); Power (physics); Mathematical optimization; Electronic engineering; Engineering; Telecommunications; Wireless; Mathematics; Transmitter; Artificial intelligence","score_opus":0.05118604664809637,"score_gpt":0.31473776397565323,"score_spread":0.2635517173275569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062753093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005869875,0.0021022335,0.9660829,0.0018976827,0.000024632538,0.00027732918,0.0000015354691,0.00019220209,0.028834555],"genre_scores_gemma":[0.9291008,0.000077109995,0.06988742,0.00040199686,0.000041089104,0.0001179378,0.0000107671085,0.000013487982,0.0003494061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987864,0.00024493164,0.00023068723,0.00029597656,0.00016130468,0.00028068564],"domain_scores_gemma":[0.99814975,0.0002478846,0.0000868907,0.0007501163,0.0006292426,0.00013609361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023229602,0.0001677425,0.00017242267,0.00007947944,0.0007986654,0.00055785663,0.0014403067,0.000032734464,0.000116304895],"category_scores_gemma":[0.000018825283,0.00013113127,0.000019513103,0.00063736626,0.00024794828,0.000969965,0.00062502554,0.00030495084,0.00023411294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072898506,0.00027169287,0.00009969974,0.000028941666,0.00002995336,0.0000028691045,0.006023095,0.00026569783,0.0020850608,0.15215665,0.001850552,0.83717847],"study_design_scores_gemma":[0.00053879776,0.0001248946,0.00053958053,0.00016874853,0.000008272548,0.000018897377,0.00030127668,0.99181175,0.00068131124,0.0023841849,0.0030798456,0.00034242825],"about_ca_topic_score_codex":0.000011914853,"about_ca_topic_score_gemma":0.00005947928,"teacher_disagreement_score":0.99154603,"about_ca_system_score_codex":0.000051247815,"about_ca_system_score_gemma":0.00021112559,"threshold_uncertainty_score":0.61427695},"labels":[],"label_agreement":null},{"id":"W2062783684","doi":"10.1109/ciss.2008.4558514","title":"Grassmannian beamforming for MIMO amplify-and-forward relaying","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Beamforming; MIMO; Rayleigh fading; Channel state information; Grassmannian; Computer science; WSDMA; Relay; Vector quantization; Precoding; Quantization (signal processing); Algorithm; Fading; Mathematics; Telecommunications; Decoding methods; Control theory (sociology); Wireless; Artificial intelligence; Physics; Combinatorics","score_opus":0.06525861974061804,"score_gpt":0.2863205372745195,"score_spread":0.22106191753390148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062783684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010925565,0.00031580933,0.97875756,0.0018120548,0.00010254447,0.00017632119,4.1952427e-7,0.00017702798,0.0077327257],"genre_scores_gemma":[0.72341204,0.0007813572,0.27269244,0.0011446334,0.00004627984,0.000040251525,0.0000028303398,0.00000810529,0.0018720345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993171,0.000027119944,0.0001615347,0.0002120866,0.00008655952,0.00019556015],"domain_scores_gemma":[0.9992341,0.0001657052,0.000040784573,0.00041083316,0.00007030495,0.000078292804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022274686,0.00008929971,0.00011041823,0.000064761414,0.0006173892,0.00006792989,0.00048901,0.00003540873,0.000008781541],"category_scores_gemma":[0.0000459748,0.000078565696,0.000040670908,0.00018588398,0.000039814717,0.00036919117,0.00029705884,0.000093995885,0.000009791012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009365558,0.000056879082,0.0030370946,0.000019155943,0.000036758756,0.0000050058725,0.0043439865,0.00013873812,0.0019536922,0.6936934,0.012431233,0.2842747],"study_design_scores_gemma":[0.0011389625,0.00016747386,0.0040376293,0.00004993027,0.000008819927,0.00014391195,0.00014379816,0.38635096,0.0015949748,0.0037785792,0.6019549,0.0006300861],"about_ca_topic_score_codex":0.0000041684434,"about_ca_topic_score_gemma":0.000015177482,"teacher_disagreement_score":0.7124865,"about_ca_system_score_codex":0.000019796309,"about_ca_system_score_gemma":0.000028521421,"threshold_uncertainty_score":0.47485211},"labels":[],"label_agreement":null},{"id":"W2063253842","doi":"10.1109/twc.2011.120511.102047","title":"Joint Relay and Antenna Selection for Dual-Hop Amplify-and-Forward MIMO Relay Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Relay channel; Channel state information; MIMO; Hop (telecommunications); Diversity gain; Selection (genetic algorithm); Topology (electrical circuits); Telecommunications; Channel (broadcasting); Computer network; Wireless; Control theory (sociology); Mathematics; Power (physics); Physics","score_opus":0.0734287215689562,"score_gpt":0.2795164586693682,"score_spread":0.206087737100412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063253842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004935748,0.001032625,0.99027735,0.0020159488,0.00023624826,0.00058903365,0.000011106905,0.00032932035,0.0005726476],"genre_scores_gemma":[0.92083544,0.01428767,0.06366726,0.0004085021,0.000021740909,0.0004082237,0.000008931864,0.000030950967,0.0003312602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824536,0.00035740974,0.00048005607,0.0004481194,0.00013752325,0.000331528],"domain_scores_gemma":[0.9969145,0.00052301533,0.00016933012,0.0019481124,0.00026548584,0.00017956398],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00055813615,0.00025746253,0.00028929894,0.00024804892,0.0017025499,0.00016042156,0.00094915763,0.00017003597,0.000017895503],"category_scores_gemma":[0.000014938968,0.0002645534,0.00010879086,0.00063296634,0.00027307126,0.0005279591,0.00006201786,0.00067485095,0.000011016618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019691387,0.0019144479,0.000395149,0.0000802678,0.0005565588,0.0000020979562,0.015379505,0.0062474757,0.008355233,0.2697791,0.0012432117,0.69585],"study_design_scores_gemma":[0.00085402996,0.00027118713,0.0010051748,0.00012547936,0.00006910997,0.00005715784,0.00017338655,0.98950744,0.0013837258,0.0005136771,0.005562249,0.00047738338],"about_ca_topic_score_codex":0.00005353825,"about_ca_topic_score_gemma":0.000576014,"teacher_disagreement_score":0.98326,"about_ca_system_score_codex":0.00007568487,"about_ca_system_score_gemma":0.00005906467,"threshold_uncertainty_score":0.9999807},"labels":[],"label_agreement":null},{"id":"W2063293063","doi":"10.1109/infcom.2010.5462025","title":"Diversity-Rate Trade-off in Erasure Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erasure; Erasure code; Computer science; Linear network coding; Multicast; Computer network; Online codes; Node (physics); Distributed computing; Algorithm; Decoding methods; Block code; Network packet; Linear code","score_opus":0.026700405014200332,"score_gpt":0.24835708662330286,"score_spread":0.2216566816091025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063293063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29359314,0.0004997783,0.6423317,0.015888099,0.001508204,0.00031523572,3.3859843e-7,0.00048646546,0.045377053],"genre_scores_gemma":[0.9944714,0.00027371672,0.0035975326,0.0012186106,0.00004312021,0.0000017248597,6.997922e-7,0.0000027920664,0.00039043752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993591,0.00009769993,0.00011066892,0.00018322098,0.00007887185,0.00017044366],"domain_scores_gemma":[0.99926794,0.00010022317,0.000024437815,0.0005224142,0.000024400435,0.00006059482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042785428,0.00007490624,0.0000845868,0.000060723258,0.0003910214,0.00007054683,0.001039167,0.000054337215,0.00009573824],"category_scores_gemma":[0.00002091933,0.000067693174,0.000028356024,0.0004320306,0.000027949012,0.00030362976,0.0014729903,0.000389036,0.000018499808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059416234,0.00013368718,0.04150893,0.0000022175955,0.000012301299,0.00001726374,0.0038850042,0.0013190557,0.0016827945,0.5548932,0.006731359,0.38980824],"study_design_scores_gemma":[0.0004460469,0.00002341891,0.16336285,0.000010185173,0.000001585118,0.0000050099966,0.000023250348,0.8041152,0.00018496228,0.0008062991,0.030773653,0.00024756245],"about_ca_topic_score_codex":0.000007808091,"about_ca_topic_score_gemma":0.0011997687,"teacher_disagreement_score":0.8027961,"about_ca_system_score_codex":0.000011559335,"about_ca_system_score_gemma":0.00001778234,"threshold_uncertainty_score":0.300746},"labels":[],"label_agreement":null},{"id":"W2063508431","doi":"10.1109/glocomw.2013.6825025","title":"Large file distribution using efficient generation-based network coding","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Computer science; Network packet; Decoding methods; Computer network; Scheduling (production processes); Coding (social sciences); Distributed computing; Algorithm; Mathematical optimization; Mathematics","score_opus":0.04593721650630937,"score_gpt":0.27057813617214493,"score_spread":0.22464091966583555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063508431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010964616,0.000109070745,0.9866979,0.00062487955,0.00022271948,0.00020008345,0.000010789153,0.00016485102,0.0010050732],"genre_scores_gemma":[0.95996904,0.000010825734,0.03862176,0.0008535527,0.00015864073,0.000035940786,0.00018253486,0.0000055349597,0.00016216692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900264,0.00012538723,0.00019862021,0.00022692422,0.00015104983,0.00029535673],"domain_scores_gemma":[0.99901927,0.00012820898,0.00006507661,0.00051535043,0.00019392413,0.00007816522],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025952706,0.00010334776,0.000096696764,0.000027514594,0.00058402825,0.00031434168,0.00045042206,0.00003707856,0.0021846895],"category_scores_gemma":[0.000046738303,0.00009307765,0.000045221648,0.00048747883,0.000018169228,0.00020783111,0.00022800596,0.00009443713,0.00015862704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013635097,0.00018221114,0.0005319301,0.000006327618,0.000016925533,0.0000014475992,0.0002404439,0.3854188,0.0054642167,0.31246713,0.27860147,0.017067743],"study_design_scores_gemma":[0.0001496442,0.00000951599,0.00073073414,0.00001631371,0.0000015939809,8.8676654e-7,0.000006644066,0.9891182,0.00060274784,0.00004907056,0.009188372,0.00012624849],"about_ca_topic_score_codex":0.000010956036,"about_ca_topic_score_gemma":0.000017489274,"teacher_disagreement_score":0.9490044,"about_ca_system_score_codex":0.00008726716,"about_ca_system_score_gemma":0.0000616562,"threshold_uncertainty_score":0.99872744},"labels":[],"label_agreement":null},{"id":"W2063601473","doi":"10.1109/tcomm.2013.031213.120686","title":"Outage Analysis of Opportunistic Scheduling in Dual-Hop Multiuser Relay Networks in the Presence of Interference","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Outage probability; Scheduling (production processes); Computer science; Hop (telecommunications); Interference (communication); Upper and lower bounds; Co-channel interference; Topology (electrical circuits); Single antenna interference cancellation; Channel state information; Channel (broadcasting); Relay channel; Closed-form expression; Computer network; Control theory (sociology); Fading; Mathematics; Telecommunications; Mathematical optimization; Wireless","score_opus":0.08063186284505632,"score_gpt":0.3159307185270514,"score_spread":0.2352988556819951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063601473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04091654,0.00027713706,0.9557308,0.0019325106,0.00006485038,0.0003730712,0.0000066772973,0.000029009063,0.00066939386],"genre_scores_gemma":[0.9848911,0.0022373751,0.012508717,0.00012272649,0.0000022179308,0.00017616767,0.000006164248,0.0000059650515,0.00004953834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979709,0.0008070831,0.0006625254,0.00020922956,0.0001745854,0.00017568893],"domain_scores_gemma":[0.9944672,0.0018752506,0.00020329357,0.0032048007,0.00020739844,0.000042073563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075736124,0.00012717031,0.00028404142,0.00060374604,0.00017309785,0.00005850775,0.0024601542,0.000066093264,0.000047925198],"category_scores_gemma":[0.00005134362,0.00010863806,0.000121277415,0.0032559377,0.00021443065,0.00036941993,0.000054770622,0.000577797,0.0000060822367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010778623,0.0012581052,0.002082569,0.000012921969,0.00020847606,0.0000014407361,0.01231249,0.92353183,0.0016282761,0.019583784,0.000027419168,0.039341923],"study_design_scores_gemma":[0.00017876677,0.000033156637,0.009249214,0.000097332646,0.000045764413,0.0000010733138,0.0004807838,0.98953104,0.00015452491,0.00008733724,0.000039636907,0.000101362646],"about_ca_topic_score_codex":0.00030037976,"about_ca_topic_score_gemma":0.003144907,"teacher_disagreement_score":0.9439746,"about_ca_system_score_codex":0.00004379865,"about_ca_system_score_gemma":0.00005883886,"threshold_uncertainty_score":0.45716196},"labels":[],"label_agreement":null},{"id":"W2063636694","doi":"10.1109/vtcfall.2012.6399222","title":"On the Capacity Gap of Gaussian Multi-Way Relay Channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Gaussian; Upper and lower bounds; Spectral efficiency; Topology (electrical circuits); Lattice (music); Computer network; Channel capacity; Relay channel; Electronic engineering; Algorithm; Telecommunications; Mathematics; Channel (broadcasting); Physics; Engineering; Power (physics); Combinatorics","score_opus":0.1504742696009714,"score_gpt":0.301833525124176,"score_spread":0.1513592555232046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063636694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086734,0.00040070552,0.83164734,0.010372623,0.00070485944,0.00028327186,8.163662e-7,0.00014332806,0.06971308],"genre_scores_gemma":[0.9891324,0.00006672357,0.008721084,0.000882962,0.000033244396,0.00000849109,2.5042826e-7,0.0000030689853,0.0011517738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933106,0.00017537318,0.00012304922,0.000094535535,0.00011299325,0.00016297816],"domain_scores_gemma":[0.9988938,0.00022547213,0.000051715466,0.0007230825,0.000049722225,0.00005619094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053583155,0.00006812038,0.00007672241,0.000031668198,0.00014889392,0.000030622235,0.0007325955,0.00002478715,0.00016910779],"category_scores_gemma":[0.00007219745,0.000039360268,0.000037684586,0.00022699511,0.000047285044,0.0001925077,0.00022920768,0.00012386753,0.00009144568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.103874e-7,0.000084460655,0.00025879566,0.0000012848088,0.000006100284,5.8284606e-8,0.0020178778,0.000046822668,0.0007216576,0.9888432,0.0024592583,0.0055595567],"study_design_scores_gemma":[0.0015363103,0.0003462901,0.046890482,0.00024506287,0.000016642973,0.000020393112,0.00041027757,0.7291318,0.12900017,0.0050300504,0.08623745,0.001135046],"about_ca_topic_score_codex":0.00000762487,"about_ca_topic_score_gemma":0.000012661721,"teacher_disagreement_score":0.98381317,"about_ca_system_score_codex":0.000015176623,"about_ca_system_score_gemma":0.000008329135,"threshold_uncertainty_score":0.18516117},"labels":[],"label_agreement":null},{"id":"W2064211981","doi":"10.1109/tsp.2014.2358953","title":"Joint Distributed Beamforming and Power Allocation in Underlay Cognitive Two-Way Relay Links Using Second-Order Channel Statistics","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Underlay; Relay; Beamforming; Computer science; Channel state information; Benchmark (surveying); Relay channel; Signal-to-noise ratio (imaging); Channel (broadcasting); Joint (building); Mathematical optimization; Cognitive radio; Computational complexity theory; Interference (communication); Algorithm; Power (physics); Telecommunications; Wireless; Mathematics; Engineering","score_opus":0.04308438526047193,"score_gpt":0.28855136396597764,"score_spread":0.2454669787055057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064211981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024605876,0.0001335773,0.97451663,0.00021090548,0.00009870173,0.00018297946,0.000013790944,0.00008329549,0.00015421904],"genre_scores_gemma":[0.97152275,0.000029270825,0.027981685,0.00036212898,0.00002123376,0.000015894928,0.000008103205,0.00001723215,0.000041697404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858737,0.00018477089,0.00037782046,0.0003780487,0.00020026398,0.0002717429],"domain_scores_gemma":[0.9990147,0.00024481764,0.00014691983,0.0001946307,0.00030538437,0.000093542105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049373455,0.00019481865,0.00021226438,0.00022496996,0.0005650975,0.00024756504,0.00020510716,0.000107583124,0.000029920924],"category_scores_gemma":[0.000018813666,0.00020076145,0.000028308821,0.0006690754,0.000085933134,0.0006830791,0.000010585228,0.0006012395,0.0000049344026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006667083,0.0004153178,0.000033914534,0.00011746133,0.000057729052,0.0000074919963,0.009878724,0.22283296,0.015035137,0.0019468602,0.000019713945,0.749588],"study_design_scores_gemma":[0.0007416305,0.000089431815,0.00019910836,0.0003696323,0.000015295705,0.000017174993,0.00022787023,0.99097663,0.00653566,0.0005100033,0.000051256127,0.00026629824],"about_ca_topic_score_codex":0.000009784086,"about_ca_topic_score_gemma":0.0001317446,"teacher_disagreement_score":0.9469169,"about_ca_system_score_codex":0.00011013345,"about_ca_system_score_gemma":0.00011356566,"threshold_uncertainty_score":0.8186814},"labels":[],"label_agreement":null},{"id":"W2064545165","doi":"10.1007/s11277-011-0249-z","title":"Performance Analysis of Smart Relaying with Equal Gain Combining","year":2011,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Saskatchewan","funders":"","keywords":"Nakagami distribution; Computer science; Fading; Relay; Phase-shift keying; Diversity gain; Keying; Maximal-ratio combining; Focus (optics); Telecommunications; Modulation (music); Diversity combining; Antenna diversity; Cooperative diversity; Outage probability; Diversity (politics); Algorithm; Electronic engineering; Bit error rate; Wireless; Decoding methods; Power (physics); Physics","score_opus":0.10425859768902519,"score_gpt":0.2889260999706001,"score_spread":0.1846675022815749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064545165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7483244,0.00095042284,0.20546588,0.0008578908,0.000054122866,0.00024759656,0.000008761296,0.00024605493,0.043844867],"genre_scores_gemma":[0.96980417,0.0009082171,0.028989272,0.00013893005,0.000003997601,0.000038538896,0.000020882952,0.000010134513,0.00008585152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986821,0.00028844242,0.00034246536,0.0002320631,0.0002433181,0.00021163093],"domain_scores_gemma":[0.99684906,0.00028856567,0.00022696181,0.0022601667,0.00029516686,0.00008006026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052197406,0.0001446558,0.00029416333,0.00034085015,0.0005795705,0.000043976634,0.002755334,0.000046065634,0.000049001683],"category_scores_gemma":[0.000018261595,0.00013332527,0.00010720641,0.0022168278,0.00027809554,0.00042044255,0.0009111741,0.00031166754,0.0000103449065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009380144,0.00091843976,0.1896202,0.000038459075,0.0020361005,0.0000031198017,0.08309686,0.00047531954,0.0021051532,0.61443156,0.00011689155,0.107064106],"study_design_scores_gemma":[0.00030923198,0.00015373007,0.048000336,0.00008835493,0.00018345732,0.000004980593,0.000647123,0.9494932,0.00042500035,0.000044520606,0.00039217982,0.00025786954],"about_ca_topic_score_codex":0.00004785912,"about_ca_topic_score_gemma":0.0003078286,"teacher_disagreement_score":0.9490179,"about_ca_system_score_codex":0.000045565634,"about_ca_system_score_gemma":0.000097192176,"threshold_uncertainty_score":0.54368466},"labels":[],"label_agreement":null},{"id":"W2064685781","doi":"10.1109/twc.2013.072613.121577","title":"Sum Rate Analysis of Two-Way MIMO AF Relay Networks with Zero-Forcing","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; MIMO; Mathematics; Transmission (telecommunications); Relay; Antenna (radio); Monte Carlo method; Fading; Signal-to-noise ratio (imaging); Spatial correlation; Spatial multiplexing; Topology (electrical circuits); Algorithm; Telecommunications; Control theory (sociology); Computer science; Combinatorics; Statistics; Physics; Decoding methods; Beamforming","score_opus":0.03316117290485934,"score_gpt":0.27377203124910743,"score_spread":0.24061085834424809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064685781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027060715,0.00030521108,0.9686542,0.0019489308,0.00010711472,0.000399793,0.000008165459,0.00022135528,0.0012944746],"genre_scores_gemma":[0.9698032,0.0023048378,0.026889632,0.00030952564,0.00000777718,0.00027562343,0.000018824312,0.000024812474,0.0003657588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977523,0.0006715801,0.00060071325,0.00038858713,0.0002443295,0.0003424887],"domain_scores_gemma":[0.9931889,0.0009600091,0.0002915975,0.0048800474,0.0005248673,0.00015458491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046538672,0.00026619973,0.00046287532,0.00062399235,0.00094626576,0.00019920962,0.0030499767,0.00009183154,0.00010147422],"category_scores_gemma":[0.0000059424383,0.00024209934,0.00023798789,0.0039599882,0.00029591203,0.00071766466,0.000054299326,0.00064240093,0.00004010441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016542568,0.00061730953,0.0004945179,0.000008616993,0.0012458513,7.726454e-7,0.0015349399,0.872831,0.0028826592,0.024415605,0.00021562145,0.095736586],"study_design_scores_gemma":[0.0004962738,0.000079656464,0.0024257305,0.00008468126,0.00028787946,0.0000027257333,0.00006995919,0.99419314,0.001690412,0.000073850824,0.00028741328,0.00030831012],"about_ca_topic_score_codex":0.00030421244,"about_ca_topic_score_gemma":0.0022873438,"teacher_disagreement_score":0.94274247,"about_ca_system_score_codex":0.00009398549,"about_ca_system_score_gemma":0.00007828972,"threshold_uncertainty_score":0.9872525},"labels":[],"label_agreement":null},{"id":"W2064994685","doi":"10.1109/wmnc.2013.6549035","title":"The modified GTCF method and its application to multi-branch multihop relaying systems with full selection diversity","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Moment-generating function; Probability density function; Cumulative distribution function; Selection (genetic algorithm); Fading; Computer science; Function (biology); Algorithm; Signal-to-noise ratio (imaging); Mathematics; Diversity combining; Channel (broadcasting); Mathematical optimization; Applied mathematics; Telecommunications; Statistics","score_opus":0.04571260823957378,"score_gpt":0.2842151355457876,"score_spread":0.2385025273062138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064994685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028261613,0.00020132419,0.96911216,0.0011031878,0.000060870556,0.00074141653,1.5265536e-7,0.00013429401,0.00038497968],"genre_scores_gemma":[0.9646214,0.00010466617,0.034303732,0.00016892122,0.000018004932,0.00013924258,4.4450996e-7,0.000004560582,0.0006389798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991145,0.00019844672,0.00012774608,0.00026633232,0.00013600172,0.00015697416],"domain_scores_gemma":[0.9990061,0.00020987693,0.00005987205,0.00035338307,0.00028511856,0.000085633044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043656307,0.000094017705,0.000090399764,0.00004513052,0.0011734922,0.0002573231,0.0005035646,0.000033304204,0.0000018134065],"category_scores_gemma":[0.000023852124,0.00006119454,0.000013263361,0.0004511193,0.000012856412,0.00039184646,0.0004901068,0.0001132706,0.0000380011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000580928,0.00014512146,0.0025257114,0.000039001003,0.00010860863,4.488672e-7,0.008998758,0.066616856,0.0864719,0.18638684,0.0013954022,0.6472533],"study_design_scores_gemma":[0.00023266723,0.000035868514,0.0028367029,0.00001026717,0.000003039055,0.000005601944,0.00006663558,0.9952874,0.0008502672,0.000027734159,0.00053850544,0.00010526502],"about_ca_topic_score_codex":0.00014881763,"about_ca_topic_score_gemma":0.00019108814,"teacher_disagreement_score":0.9363598,"about_ca_system_score_codex":0.00004504743,"about_ca_system_score_gemma":0.000012933784,"threshold_uncertainty_score":0.90256715},"labels":[],"label_agreement":null},{"id":"W2065435360","doi":"10.1109/tit.2014.2353514","title":"The Streaming-DMT of Fading Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fading; Computer science; Decoding methods; Interleaving; Encoder; Algorithm; Coherence time; Channel (broadcasting); Multiplexing; Transmission (telecommunications); Coherence (philosophical gambling strategy); Coding (social sciences); Theoretical computer science; Computer network; Mathematics; Telecommunications","score_opus":0.015299571683865755,"score_gpt":0.23978530056035957,"score_spread":0.22448572887649382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065435360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000980864,0.0000215097,0.9900956,0.00037986986,0.00050883734,0.00010131956,0.000001356616,0.00008592175,0.007824702],"genre_scores_gemma":[0.99827605,0.00015432022,0.0010075022,0.0003011225,0.000013885411,0.000023579385,8.4408725e-7,0.0000028404738,0.00021987461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919593,0.00018757662,0.00028122764,0.0000621445,0.00015329893,0.000119847355],"domain_scores_gemma":[0.9986014,0.00058609573,0.00012739337,0.0005196694,0.00013023819,0.00003522416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008639951,0.00007804164,0.000078008,0.00011366786,0.0005235228,0.000121015255,0.0006050146,0.00003113729,0.000020699836],"category_scores_gemma":[0.000024110093,0.0000578858,0.00005720266,0.00029152512,0.000063820145,0.000920589,0.000005040827,0.00013852191,0.000070559196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008746255,0.000013299047,4.4445025e-7,0.0000042002443,0.000011228221,1.1769907e-8,0.00226581,0.016044328,0.00008123373,0.3195241,0.0000775984,0.661969],"study_design_scores_gemma":[0.00087457825,0.00025862074,0.00012156997,0.00011985364,0.000016105236,0.00000869912,0.0007629302,0.8517243,0.061968572,0.02241027,0.061358426,0.00037606314],"about_ca_topic_score_codex":9.716313e-7,"about_ca_topic_score_gemma":0.0000024432081,"teacher_disagreement_score":0.99729514,"about_ca_system_score_codex":0.000024305107,"about_ca_system_score_gemma":0.00002247179,"threshold_uncertainty_score":0.40265667},"labels":[],"label_agreement":null},{"id":"W2065713652","doi":"10.1002/wcm.1002","title":"Performance of MIMO cross‐layer MAC protocol based on antenna selection in <i>ad hoc</i> networks","year":2010,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; MIMO; Wireless ad hoc network; Throughput; Physical layer; Node (physics); Media access control; Space-division multiple access; Distributed computing; Wireless; Telecommunications; Telecommunications link; Channel (broadcasting)","score_opus":0.023949843397848114,"score_gpt":0.3103236074222633,"score_spread":0.28637376402441517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065713652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8902279,0.00035891653,0.09510341,0.0003924316,0.00013813617,0.01219252,0.0000015945191,0.0002071125,0.0013779675],"genre_scores_gemma":[0.9757458,0.0004588969,0.019353377,0.00016612794,0.0000208496,0.004217286,0.000005074551,0.000013973894,0.000018625293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856496,0.000239836,0.00048675333,0.00030819155,0.00014190895,0.00025834236],"domain_scores_gemma":[0.99757844,0.0003930374,0.00024250844,0.0014820457,0.00023576122,0.00006819252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007858304,0.00017420581,0.00022978502,0.00018344831,0.0005645971,0.0001416561,0.001569877,0.00009821277,0.00000573322],"category_scores_gemma":[0.000020826083,0.00017227486,0.000048209207,0.00080419827,0.00020094005,0.00023975289,0.00086030865,0.0007179107,0.0000023263462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005564767,0.0006362966,0.05273996,0.000070058384,0.000012017085,5.66979e-7,0.0008915553,0.02677677,0.017717117,0.00656402,0.0000325411,0.8945035],"study_design_scores_gemma":[0.00065803126,0.00017043077,0.016973717,0.0001783926,0.0000018207172,0.000004254671,0.000012868318,0.97578776,0.0005507849,0.000009036725,0.005477395,0.00017553431],"about_ca_topic_score_codex":0.0000069249727,"about_ca_topic_score_gemma":0.000111857444,"teacher_disagreement_score":0.94901097,"about_ca_system_score_codex":0.000031097465,"about_ca_system_score_gemma":0.00007889088,"threshold_uncertainty_score":0.7025165},"labels":[],"label_agreement":null},{"id":"W2065883175","doi":"10.1049/iet-com.2012.0782","title":"Design of distributed collaborative space‐time block codes for two‐way relaying networks","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Block code; Block (permutation group theory); Computer network; Space–time block code; Distributed computing; Theoretical computer science; Telecommunications; Decoding methods; Mathematics; Combinatorics","score_opus":0.04559935547268625,"score_gpt":0.2990391749312891,"score_spread":0.2534398194586029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065883175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054318836,0.0022211103,0.98715574,0.0074359393,0.00006325283,0.0012269733,0.000026107671,0.00017847036,0.0011491973],"genre_scores_gemma":[0.7396846,0.0012084636,0.25811863,0.0001483041,0.000020060268,0.00052502594,0.0000889322,0.00001526164,0.00019071379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981954,0.00069170265,0.0004631749,0.00024714135,0.00012190334,0.000280675],"domain_scores_gemma":[0.99301606,0.0022450078,0.00030470995,0.0031890376,0.0011454197,0.000099750745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060764625,0.00017996297,0.00029574236,0.00009348317,0.00073149893,0.00019775286,0.0032609142,0.00007455577,0.000029391309],"category_scores_gemma":[0.00022519677,0.00017858545,0.00007575343,0.0011132729,0.0002285548,0.00049631885,0.0011209318,0.0002465862,0.000043063766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053282918,0.0011384044,0.00048133897,0.00003358081,0.00052541966,5.7743046e-7,0.007743649,0.27199703,0.043642644,0.5165644,0.09982591,0.057993747],"study_design_scores_gemma":[0.0005222765,0.00007972619,0.00025296977,0.000060939463,0.000017069242,0.0000022023976,0.000098964774,0.98847973,0.0008433264,0.001460994,0.007964262,0.00021754274],"about_ca_topic_score_codex":0.000017509836,"about_ca_topic_score_gemma":0.000020830646,"teacher_disagreement_score":0.7391414,"about_ca_system_score_codex":0.000069132,"about_ca_system_score_gemma":0.0001222394,"threshold_uncertainty_score":0.7282503},"labels":[],"label_agreement":null},{"id":"W2065913119","doi":"10.1109/tcomm.2012.040212.100193","title":"Power Allocation Strategies across N Orthogonal Channels at Both Source and Relay","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Computer science; Power (physics); Wireless; Computer network; Telecommunications","score_opus":0.05007567618113382,"score_gpt":0.3140893679192075,"score_spread":0.26401369173807365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065913119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026808139,0.0017174443,0.9636165,0.003970053,0.00035985388,0.00024362338,0.000009602985,0.00028414585,0.0029906256],"genre_scores_gemma":[0.9862274,0.0028016581,0.009018119,0.00042176023,0.000023684759,0.00013134409,0.000008661243,0.000018849589,0.0013485091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985424,0.0003373842,0.00030434714,0.00024695735,0.0001988725,0.0003700019],"domain_scores_gemma":[0.99678105,0.00040177765,0.00010723647,0.002403012,0.00012585049,0.00018109499],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005160398,0.00019230109,0.000157727,0.00010356372,0.0018487355,0.00026020824,0.0013920218,0.00009424484,0.00006822489],"category_scores_gemma":[0.000008285629,0.00019678863,0.00007680775,0.0004924772,0.00023767084,0.0012034344,0.000088847795,0.00041429675,0.000109923305],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101489204,0.0040349984,0.0011352808,0.000052184256,0.0005194615,0.0000015058804,0.113684505,0.03944115,0.020131193,0.4172323,0.0034924296,0.4001735],"study_design_scores_gemma":[0.0035076523,0.0006395514,0.02214865,0.00037893857,0.00013069021,0.0003492379,0.0067609157,0.4131653,0.014673138,0.0019127524,0.5331149,0.00321824],"about_ca_topic_score_codex":0.000009475801,"about_ca_topic_score_gemma":0.00017214147,"teacher_disagreement_score":0.95941925,"about_ca_system_score_codex":0.00011151225,"about_ca_system_score_gemma":0.000057703666,"threshold_uncertainty_score":0.99945074},"labels":[],"label_agreement":null},{"id":"W2066182641","doi":"10.1109/twc.2014.2335732","title":"Throughput Analysis of Cooperative Communication in Wireless &lt;italic&gt;Ad Hoc&lt;/italic&gt; Networks With Frequency Reuse","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Relay; Wireless ad hoc network; Throughput; Wireless network; Cooperative diversity; Wireless; Transmission (telecommunications); Channel (broadcasting); Telecommunications; Fading","score_opus":0.027524776346220144,"score_gpt":0.27245356222984873,"score_spread":0.2449287858836286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066182641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08113351,0.001753228,0.90964186,0.003582533,0.00012282509,0.0007389497,0.000045953962,0.00031095132,0.0026701675],"genre_scores_gemma":[0.953217,0.016243638,0.029339695,0.00039574862,0.000011769872,0.0004563506,0.00013055466,0.000054775403,0.00015042063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946769,0.0021641857,0.0012742664,0.0007663562,0.00055604614,0.0005622722],"domain_scores_gemma":[0.9848626,0.0017454748,0.0006076807,0.011666647,0.00091062527,0.00020696787],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011858561,0.0005500721,0.0010055285,0.0010761941,0.0012934019,0.00027127715,0.0075989063,0.0002694574,0.000043838023],"category_scores_gemma":[0.000038409344,0.0005376571,0.00031678504,0.0069156815,0.0008318442,0.001166178,0.00021073889,0.0011220772,0.000021578398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020228082,0.005110628,0.0012784638,0.00006192837,0.002978841,0.0000050287895,0.018172007,0.36801794,0.0126716485,0.42213064,0.00045437974,0.16891618],"study_design_scores_gemma":[0.0013802112,0.00034329042,0.0034658168,0.00037946567,0.00039620302,0.000007887663,0.00021668882,0.9896265,0.001387792,0.0002766922,0.0017130864,0.0008063612],"about_ca_topic_score_codex":0.00011752514,"about_ca_topic_score_gemma":0.014951943,"teacher_disagreement_score":0.8803022,"about_ca_system_score_codex":0.00032173828,"about_ca_system_score_gemma":0.00021124672,"threshold_uncertainty_score":0.9997075},"labels":[],"label_agreement":null},{"id":"W2066493245","doi":"10.1109/tpds.2013.260","title":"Expansion Properties of Topology for Networking of Information in Cloud","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Network topology; Distributed computing; Linear network coding; Computer network; Internet topology; The Internet; Information-centric networking; Network architecture; Reliability (semiconductor); World Wide Web","score_opus":0.03776056023272789,"score_gpt":0.24637992672485787,"score_spread":0.20861936649212998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066493245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048971906,0.0005222058,0.9495134,0.00017523498,0.0003227504,0.0004315202,0.000010582024,0.000020250127,0.000032146996],"genre_scores_gemma":[0.9988562,0.0003426573,0.0005965715,0.000020809692,0.000011291987,0.0001518338,0.0000061436826,0.0000019907084,0.00001249322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927187,0.000082215374,0.00037670202,0.00008678871,0.000072342555,0.000110052424],"domain_scores_gemma":[0.9994266,0.00007396024,0.00011951796,0.00020708225,0.00014385661,0.00002897216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015930885,0.0000725219,0.00017755922,0.00009118116,0.000077015065,0.000034196968,0.00017723469,0.00005342848,0.0000019640595],"category_scores_gemma":[0.0000046099126,0.00006025932,0.000032961663,0.00020476646,0.00004155572,0.0003655232,0.0000038872645,0.00006487504,0.0000016177769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013248278,0.0002728777,0.0002047161,0.00040427904,0.000058430032,2.1264682e-7,0.004846917,0.90473247,0.008702304,0.012517997,0.00071886485,0.06740847],"study_design_scores_gemma":[0.0008651027,0.00016080991,0.00032812328,0.00024845387,0.0000055250284,0.0000042940874,0.0006151539,0.9949071,0.0017326087,0.00015602451,0.00085192744,0.00012492275],"about_ca_topic_score_codex":0.000118977165,"about_ca_topic_score_gemma":0.000027529897,"teacher_disagreement_score":0.9498843,"about_ca_system_score_codex":0.000019475892,"about_ca_system_score_gemma":0.000023719831,"threshold_uncertainty_score":0.24573037},"labels":[],"label_agreement":null},{"id":"W2066535278","doi":"10.1109/icc.2012.6363867","title":"Relay selection with time-division broadcast in bidirectional cooperative networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Bottleneck; Selection (genetic algorithm); Division (mathematics); Network topology; Algorithm; Topology (electrical circuits); Computer network; Artificial intelligence; Mathematics; Combinatorics; Physics; Arithmetic; Embedded system","score_opus":0.019416084308860354,"score_gpt":0.25555796719194857,"score_spread":0.2361418828830882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066535278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031227887,0.00046194837,0.95452565,0.0004977602,0.0001662868,0.0001874326,1.6290689e-7,0.00020950197,0.012723345],"genre_scores_gemma":[0.9838374,0.00014623252,0.013279948,0.000292154,0.00008914358,0.000022142664,0.00000430414,0.000007740001,0.0023209017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990252,0.00021180233,0.00015722202,0.00019854438,0.0001469486,0.00026025146],"domain_scores_gemma":[0.9993906,0.00011899199,0.000043435914,0.00023880627,0.00012562337,0.00008251974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004147033,0.00011459907,0.000112366375,0.000114404866,0.00020592382,0.00008909939,0.00027711285,0.00004900112,0.00021761288],"category_scores_gemma":[0.000018693023,0.0000881137,0.000019637597,0.0010673515,0.00002827867,0.0008485019,0.00015684449,0.00022476616,0.000112032074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009934617,0.0010813274,0.17640841,0.000006152113,0.000087121865,0.000004168433,0.003511443,0.24085362,0.003705707,0.17330143,0.018857125,0.38208416],"study_design_scores_gemma":[0.00037044793,0.00010119927,0.040592823,0.000032195647,0.0000017589382,0.000022523209,0.000013937142,0.94867224,0.00057865406,0.000006716599,0.009407019,0.00020051794],"about_ca_topic_score_codex":0.000009830696,"about_ca_topic_score_gemma":0.00007480581,"teacher_disagreement_score":0.95260954,"about_ca_system_score_codex":0.00009026088,"about_ca_system_score_gemma":0.000038944872,"threshold_uncertainty_score":0.35931724},"labels":[],"label_agreement":null},{"id":"W2066560648","doi":"10.1109/icc.2010.5502099","title":"Exact Closed-Form Error Probability Expression for Cooperative Diversity Networks with Channel Estimation Errors in Time Selective Rayleigh Fading Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rayleigh fading; Fading; Channel (broadcasting); Computer science; Bit error rate; Maximal-ratio combining; Expression (computer science); Closed-form expression; Algorithm; Channel state information; Diversity combining; Phase-shift keying; Modulation (music); Electronic engineering; Topology (electrical circuits); Telecommunications; Mathematics; Wireless; Engineering; Physics","score_opus":0.032138842892662396,"score_gpt":0.269460849997927,"score_spread":0.23732200710526463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066560648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26440886,0.000016812655,0.7324933,0.00050721545,0.00018836871,0.0013942458,0.0000022079516,0.00019673402,0.0007922636],"genre_scores_gemma":[0.9586629,0.000010889997,0.04061957,0.0001596487,0.000053917804,0.00017523093,0.00002134771,0.000013353331,0.0002831184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982614,0.00017537497,0.00029265045,0.0005966527,0.00025195943,0.00042195342],"domain_scores_gemma":[0.99833626,0.00034999376,0.00015619786,0.0006148841,0.0004139326,0.00012875312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009506341,0.00026475647,0.00030243705,0.00015283543,0.0008900091,0.0001773924,0.0010339567,0.00014335208,0.00004290961],"category_scores_gemma":[0.0001400894,0.00020850933,0.000060331626,0.00078859105,0.000100633675,0.0012546523,0.00093197,0.00048882107,0.000008106126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013861693,0.0021800064,0.013772538,0.00012555788,0.00019160949,0.000014165933,0.06355945,0.7878309,0.017984666,0.04095458,0.0044666417,0.06753375],"study_design_scores_gemma":[0.0010331972,0.00023126164,0.00414968,0.00007605172,0.000005870925,0.000004210168,0.000050037575,0.986459,0.0063551315,0.0012301677,0.000072574156,0.0003328222],"about_ca_topic_score_codex":0.000021927932,"about_ca_topic_score_gemma":0.0004759655,"teacher_disagreement_score":0.69425404,"about_ca_system_score_codex":0.00014444493,"about_ca_system_score_gemma":0.00008916654,"threshold_uncertainty_score":0.85027635},"labels":[],"label_agreement":null},{"id":"W2066613498","doi":"10.1002/1097-0037(200103)37:2<94::aid-net4>3.0.co;2-6","title":"Improved upper and lower bounds fork-broadcasting","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Brandon University","funders":"","keywords":"Upper and lower bounds; Vertex (graph theory); Broadcasting (networking); Graph; Combinatorics; Computer science; Mathematics; Computer network","score_opus":0.022723227146079272,"score_gpt":0.25938346006956736,"score_spread":0.2366602329234881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066613498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016535709,0.0029959115,0.9647681,0.0012310218,0.00053432037,0.00013505512,1.2534662e-7,0.00021114846,0.013588596],"genre_scores_gemma":[0.9865625,0.0018778491,0.009187267,0.0011524854,0.0002404689,0.000012780988,0.0000016952299,0.000010192685,0.00095475226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991191,0.00006305234,0.00016801369,0.0002685098,0.000084220155,0.00029711603],"domain_scores_gemma":[0.9991216,0.00011842331,0.00005405483,0.00053690845,0.00007233773,0.00009665941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026849995,0.00012054322,0.00011973154,0.000041887168,0.0003328621,0.00028589048,0.0005060719,0.000066757464,0.000040369025],"category_scores_gemma":[0.000027722517,0.00011176793,0.00003718732,0.00036276813,0.00004704927,0.000329833,0.0006974339,0.00022772368,0.000007623331],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009331713,0.000030762632,0.0028331345,0.0000017887943,0.000012959137,0.0000071836075,0.00027345357,0.0004943299,0.00015474328,0.01779786,0.0023522833,0.9760322],"study_design_scores_gemma":[0.00025709314,0.00004761769,0.0020914534,0.000027903976,0.0000028833886,0.000029954319,0.000008290016,0.94189215,0.000009258606,0.0003245335,0.05514552,0.00016331913],"about_ca_topic_score_codex":0.0000033102783,"about_ca_topic_score_gemma":0.00002355208,"teacher_disagreement_score":0.9758689,"about_ca_system_score_codex":0.000023165669,"about_ca_system_score_gemma":0.000017756074,"threshold_uncertainty_score":0.4557764},"labels":[],"label_agreement":null},{"id":"W2066699411","doi":"10.1109/tvt.2013.2288038","title":"The Bottleneck Effect of Rician Fading in Dissimilar Dual-Hop AF Relaying Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Fading; Nakagami distribution; Cumulative distribution function; Probability density function; Fading distribution; Mathematics; Statistics; Algorithm; Computer science; Rayleigh fading","score_opus":0.011615642914112344,"score_gpt":0.24426304518550995,"score_spread":0.2326474022713976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066699411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30439827,0.0018841573,0.68832374,0.0035249763,0.000514663,0.0006718901,9.739952e-7,0.00031123855,0.00037012735],"genre_scores_gemma":[0.9982718,0.00079042296,0.00052410277,0.00003515142,0.0000072835987,0.00026351088,2.3500243e-7,0.00001202209,0.0000954373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986079,0.00030708176,0.00035521484,0.00027583854,0.00016277988,0.0002912264],"domain_scores_gemma":[0.99835205,0.00040990257,0.00010674521,0.001008316,0.00008556077,0.00003744058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004990978,0.00015938778,0.0002500729,0.0003858662,0.0004135336,0.000081077196,0.00086732727,0.0001766311,0.000006085289],"category_scores_gemma":[0.000028276003,0.00011665746,0.0000817808,0.0012587687,0.00013802259,0.00020473446,0.000017812044,0.0005307767,0.00003805637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003139837,0.00029023955,0.0009418322,0.00009483356,0.00020743239,0.00003834634,0.00093799,0.10652845,0.08580679,0.046211135,0.00034908578,0.75856245],"study_design_scores_gemma":[0.0015219732,0.00078604714,0.00073286565,0.0005663764,0.00003769778,0.00009178999,0.0004256741,0.84484804,0.1430556,0.00080471195,0.006526666,0.00060258136],"about_ca_topic_score_codex":0.000024986653,"about_ca_topic_score_gemma":0.000047394915,"teacher_disagreement_score":0.7579599,"about_ca_system_score_codex":0.000085832835,"about_ca_system_score_gemma":0.000022730632,"threshold_uncertainty_score":0.4757153},"labels":[],"label_agreement":null},{"id":"W2067125863","doi":"10.1109/tcomm.2014.2336245","title":"Source–Channel Communication Over Phase-Incoherent Multiuser Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Channel (broadcasting); Computer science; Context (archaeology); Interference (communication); Relay; Coding (social sciences); Cognitive radio; Asynchronous communication; Topology (electrical circuits); Algorithm; Theoretical computer science; Wireless; Mathematics; Telecommunications; Physics; Statistics; Combinatorics","score_opus":0.05591394083249561,"score_gpt":0.31878063408418217,"score_spread":0.26286669325168655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067125863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012332859,0.0004574526,0.9854069,0.006986345,0.000421958,0.000472372,0.000008721495,0.00063183426,0.004381172],"genre_scores_gemma":[0.9768043,0.0026433412,0.017532013,0.0011594631,0.00003777004,0.00038074367,0.000023975566,0.00003918036,0.0013791799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723965,0.0010602938,0.0005648111,0.00043146504,0.00032938365,0.00037437488],"domain_scores_gemma":[0.9909695,0.00092266,0.00021136059,0.007408602,0.00028575643,0.00020213338],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00073004526,0.00031137228,0.00029928674,0.00031697404,0.0018521742,0.00031381677,0.005004467,0.00013697427,0.000117250725],"category_scores_gemma":[0.000028833898,0.00032662842,0.0002035608,0.0008883078,0.00023848437,0.0006863057,0.00010780411,0.0007926578,0.00029182006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050827406,0.0049542477,0.000016991637,0.000025194071,0.0002547084,4.1456073e-7,0.0077530025,0.04526935,0.002895921,0.065646656,0.0053494573,0.86778325],"study_design_scores_gemma":[0.0018075473,0.00017913627,0.0000593091,0.00011365821,0.000030179499,0.000007039478,0.00007712858,0.87774885,0.0032347161,0.0012988233,0.11496839,0.00047525045],"about_ca_topic_score_codex":0.000041272902,"about_ca_topic_score_gemma":0.00024490248,"teacher_disagreement_score":0.97557104,"about_ca_system_score_codex":0.00014455387,"about_ca_system_score_gemma":0.00006250066,"threshold_uncertainty_score":0.9999186},"labels":[],"label_agreement":null},{"id":"W2067232511","doi":"10.1109/tit.2014.2346079","title":"Communication Over Finite-Chain-Ring Matrix Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Finite field; Coding (social sciences); Channel code; Channel capacity; Channel (broadcasting); Finite set; Variable-length code; Transfer matrix","score_opus":0.017279621352189405,"score_gpt":0.2591361980510234,"score_spread":0.24185657669883398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067232511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096991303,0.00004652541,0.98789495,0.0006364955,0.00047390015,0.0001837884,0.0000029741527,0.0003338622,0.009457594],"genre_scores_gemma":[0.99240506,0.00026564018,0.00524953,0.0014217126,0.000023369177,0.000064644635,0.000007476659,0.000007887213,0.0005546931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987142,0.0003771549,0.0003804887,0.00012224296,0.00021792737,0.00018800075],"domain_scores_gemma":[0.99787134,0.00067131897,0.00015268585,0.0010809203,0.00014662757,0.00007709389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010545277,0.00014769164,0.00012844731,0.00029967216,0.00061933225,0.00028291708,0.00089298515,0.000074262076,0.00016043837],"category_scores_gemma":[0.00003610122,0.00014722484,0.00008176115,0.00044882623,0.00005560711,0.00215627,0.000014328206,0.00030320755,0.0004735067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022388958,0.00005846426,0.0000018698072,0.000013417088,0.000021889939,6.7040496e-8,0.0042590764,0.09166354,0.00007646378,0.54464036,0.00026599248,0.35897642],"study_design_scores_gemma":[0.0007952836,0.0000871697,0.000084853105,0.00008736648,0.000010231796,0.0000052471205,0.00015106663,0.94498247,0.00468945,0.011358785,0.03740275,0.0003453108],"about_ca_topic_score_codex":0.0000030466606,"about_ca_topic_score_gemma":0.0000041426383,"teacher_disagreement_score":0.9914351,"about_ca_system_score_codex":0.00006812939,"about_ca_system_score_gemma":0.000028222717,"threshold_uncertainty_score":0.60861284},"labels":[],"label_agreement":null},{"id":"W2067448427","doi":"10.1109/glocom.2012.6503910","title":"Joint transceiver design for MIMO relay systems employing SC-FDE","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; SC-FDE; MIMO; Precoding; Equalization (audio); Computer science; Bit error rate; Minimum mean square error; Control theory (sociology); Multiplexing; Joint (building); Transceiver; Electronic engineering; Algorithm; Power (physics); Mathematics; Telecommunications; Decoding methods; Engineering; Beamforming; Wireless","score_opus":0.17930098833973937,"score_gpt":0.3053360400283898,"score_spread":0.12603505168865045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067448427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008462695,0.0018941702,0.99169225,0.00079564896,0.00047539736,0.00043185105,4.299477e-7,0.00019760276,0.0036663697],"genre_scores_gemma":[0.8708193,0.00014381592,0.126865,0.00033981507,0.0001065736,0.00009013726,0.0000010842805,0.000010268944,0.0016240126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900115,0.00018166541,0.00021632892,0.00017256105,0.00011790743,0.0003104215],"domain_scores_gemma":[0.99895924,0.0002429483,0.000048826685,0.0005323507,0.000103365055,0.000113242204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008572985,0.00010732837,0.00013968081,0.00006197756,0.00026679164,0.00013699032,0.0005595627,0.00004199461,0.00002417583],"category_scores_gemma":[0.000036255497,0.00008904832,0.00006838,0.00020065832,0.000018272021,0.0005596976,0.00008297427,0.00008687872,0.00006395276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017771497,0.0002133424,0.0006809357,0.000049298797,0.00008138039,0.0000010518318,0.007590612,0.0050523034,0.015523235,0.8770984,0.03877278,0.054918915],"study_design_scores_gemma":[0.0012847667,0.0001877072,0.0024486224,0.00018209383,0.000026918768,0.00003285413,0.00016228345,0.7763542,0.01386594,0.00033640067,0.2043159,0.0008023123],"about_ca_topic_score_codex":0.0000035453352,"about_ca_topic_score_gemma":0.000002560561,"teacher_disagreement_score":0.876762,"about_ca_system_score_codex":0.000043604956,"about_ca_system_score_gemma":0.00002899935,"threshold_uncertainty_score":0.3631285},"labels":[],"label_agreement":null},{"id":"W2067596173","doi":"10.1109/twc.2014.011514.130806","title":"Joint Optimization of Clustering and Cooperative Beamforming in Green Cognitive Wireless Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Underlay; Beamforming; Cognitive radio; Mathematical optimization; Cluster analysis; Base station; Convergence (economics); Wireless; Iterative method; Interference (communication); Quality of service; Efficient energy use; Algorithm; Computer network; Channel (broadcasting); Signal-to-noise ratio (imaging); Telecommunications; Mathematics; Artificial intelligence; Engineering","score_opus":0.038631584013712736,"score_gpt":0.27137691921590673,"score_spread":0.23274533520219398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067596173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009096836,0.00018721903,0.98858225,0.0008903197,0.00008904583,0.0003608653,0.0000055519877,0.00009464857,0.00069325854],"genre_scores_gemma":[0.9774822,0.0034067442,0.01869415,0.00020483077,0.000010335189,0.0001253391,0.000009875638,0.000018853605,0.00004768371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820733,0.00056368596,0.00053662993,0.00030775607,0.0001571463,0.00022747944],"domain_scores_gemma":[0.9974449,0.0007150764,0.00018926164,0.0012845972,0.00027836466,0.00008779395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051164126,0.00020196325,0.00032385666,0.00031622456,0.0005432695,0.000084415435,0.0009909219,0.00009925212,0.000009144577],"category_scores_gemma":[0.00001520881,0.00021709022,0.00006157351,0.00088571286,0.00025523233,0.0005342696,0.00007475706,0.0003973916,0.0000025453728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002064018,0.0003197555,0.00006618288,0.000020521804,0.000042976848,3.6409978e-7,0.0030167347,0.6858097,0.00068781327,0.009773509,0.0000034156535,0.30023837],"study_design_scores_gemma":[0.00065423304,0.00009384057,0.00024936977,0.00032927725,0.000013771642,0.000005756317,0.00018976953,0.9967901,0.0013824188,0.00003865322,0.00003853098,0.00021429316],"about_ca_topic_score_codex":0.00008490219,"about_ca_topic_score_gemma":0.0018883501,"teacher_disagreement_score":0.9698881,"about_ca_system_score_codex":0.00006909237,"about_ca_system_score_gemma":0.000049944763,"threshold_uncertainty_score":0.8852682},"labels":[],"label_agreement":null},{"id":"W2067706152","doi":"10.1109/tvt.2014.2378813","title":"Jamming in Dual-Hop Amplify-and-Forward Relaying","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Jamming; Nakagami distribution; Relay; Rayleigh fading; Fading; Hop (telecommunications); Computer science; Power (physics); Interference (communication); Outage probability; Transmitter power output; Electronic engineering; Transmission (telecommunications); Computer network; Telecommunications; Engineering; Transmitter; Physics; Channel (broadcasting)","score_opus":0.016196505112608985,"score_gpt":0.24906063901957487,"score_spread":0.2328641339069659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067706152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090176575,0.00017006276,0.9045337,0.004106967,0.0001584652,0.00012346839,3.723792e-7,0.00037305377,0.0003573763],"genre_scores_gemma":[0.9870331,0.0004674381,0.011989643,0.00035686768,0.000009228932,0.000056958517,3.9837403e-7,0.000010888146,0.00007544058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891555,0.00012458446,0.00023611984,0.00035713398,0.00011169135,0.00025490043],"domain_scores_gemma":[0.99898463,0.00012918723,0.000049784812,0.0007422986,0.000046439724,0.00004764757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003664987,0.00013904912,0.00018746621,0.000560362,0.0002720519,0.00005177164,0.00039913892,0.00019932644,0.000008957513],"category_scores_gemma":[0.000021570515,0.00014203996,0.000041740146,0.0009072394,0.00009803914,0.0001783924,0.000017702068,0.0006161587,0.000042760745],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068222575,0.00011904488,0.00013472798,0.000010167657,0.000026334134,0.000018277207,0.00053817907,0.006728501,0.011005668,0.07913658,0.000035389497,0.90224034],"study_design_scores_gemma":[0.0026365165,0.0006606084,0.00076608354,0.00031963416,0.000034364843,0.00035835564,0.00035650007,0.8508558,0.072334014,0.010352438,0.060161065,0.0011645793],"about_ca_topic_score_codex":0.000006049705,"about_ca_topic_score_gemma":0.00008052913,"teacher_disagreement_score":0.9010757,"about_ca_system_score_codex":0.000054983553,"about_ca_system_score_gemma":0.000018709388,"threshold_uncertainty_score":0.5792222},"labels":[],"label_agreement":null},{"id":"W2067752506","doi":"10.1109/tvt.2011.2170446","title":"An Auction-Based Pareto-Optimal Strategy for Dynamic and Fair Allotment of Resources in Wireless Mobile Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Quality of service; Computer network; Roaming; Reservation; Flexibility (engineering); Wireless; Handover; Pareto principle; Mobile computing; Wireless network; Distributed computing; Telecommunications; Engineering","score_opus":0.02259312717664481,"score_gpt":0.2653109166736859,"score_spread":0.2427177894970411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067752506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3407152,0.00015381444,0.6585747,0.0000930476,0.00004956075,0.00028192377,0.0000024694912,0.000122062214,0.000007192763],"genre_scores_gemma":[0.9893564,0.0002282433,0.010010816,0.000037190544,0.0000031424931,0.00034409322,0.0000021229368,0.000010901945,0.000007080823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990577,0.00008461798,0.00025644383,0.00032489852,0.00007509278,0.00020126393],"domain_scores_gemma":[0.9991361,0.000060196253,0.00007894091,0.0005966461,0.00008608271,0.000042018797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018413895,0.0001343304,0.00019477672,0.0003551151,0.00014668131,0.00001914252,0.00051474845,0.00018138108,0.000007554737],"category_scores_gemma":[0.0000014895837,0.00013538696,0.000048765112,0.00050780043,0.00016354135,0.00013564773,0.0000053759272,0.000246347,6.522126e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000798743,0.00073565077,0.00021507542,0.000019159053,0.000047799454,0.0000053656345,0.00057347305,0.6924388,0.00500104,0.0046177795,0.0000032049663,0.2962628],"study_design_scores_gemma":[0.00056027685,0.00085167825,0.00039492577,0.000033343265,0.000010324487,0.0000053452013,0.00018250817,0.98205864,0.015455019,0.00021186787,0.00009115219,0.0001449325],"about_ca_topic_score_codex":0.000016060023,"about_ca_topic_score_gemma":0.00033052432,"teacher_disagreement_score":0.6486412,"about_ca_system_score_codex":0.000047375444,"about_ca_system_score_gemma":0.000034212684,"threshold_uncertainty_score":0.552092},"labels":[],"label_agreement":null},{"id":"W2068119503","doi":"10.1145/2386958.2386962","title":"A content centric approach to dissemination of information in vehicular networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Linear network coding; Vehicular ad hoc network; Leverage (statistics); Dissemination; Computer network; Information Dissemination; Key (lock); Information-centric networking; Reliability (semiconductor); Wireless ad hoc network; Distributed computing; Computer security; World Wide Web; Telecommunications; Wireless; Artificial intelligence","score_opus":0.03804638935371996,"score_gpt":0.26412938694849436,"score_spread":0.2260829975947744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068119503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017643096,0.00019099661,0.974244,0.00022548316,0.0000676469,0.00018953044,1.1525412e-7,0.000025416646,0.007413731],"genre_scores_gemma":[0.9823104,0.000072647024,0.017318841,0.00021560214,0.000011466428,0.000019461453,0.000005160951,0.0000012257302,0.000045174627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994415,0.00005980237,0.0002024973,0.000052814295,0.00010608766,0.00013727887],"domain_scores_gemma":[0.99949616,0.000056473855,0.000050706087,0.00025322184,0.00008764959,0.000055804183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040277274,0.000048264767,0.00007487161,0.00013552196,0.000028396935,0.000032113167,0.00031784,0.00002406119,0.0000049898563],"category_scores_gemma":[0.00006619722,0.000041254676,0.000018126615,0.00067540095,0.000006307158,0.00086567184,0.00017929307,0.00005657712,0.000008312238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073503593,0.00031508043,0.015124535,0.000014496857,0.000008101415,6.393136e-8,0.0079262825,0.014436428,0.0003611372,0.6367708,0.0016941772,0.32334155],"study_design_scores_gemma":[0.00012414562,0.00001437751,0.08224631,0.000028205117,0.0000010864825,0.0000011944759,0.00013457939,0.91498697,0.00042660438,0.000011186255,0.0019391223,0.00008623663],"about_ca_topic_score_codex":0.000004767917,"about_ca_topic_score_gemma":0.000002073081,"teacher_disagreement_score":0.9646673,"about_ca_system_score_codex":0.000038340702,"about_ca_system_score_gemma":0.000007168858,"threshold_uncertainty_score":0.1682317},"labels":[],"label_agreement":null},{"id":"W2068344357","doi":"10.1109/tit.2012.2201342","title":"Multilayer Coding Over Multihop Single-User Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Linear network coding; Fading; Relay channel; Hop (telecommunications); Channel state information; Additive white Gaussian noise; Maximization; Computer network; Gaussian; Coding (social sciences); Topology (electrical circuits); Algorithm; Channel (broadcasting); Wireless; Telecommunications; Mathematics; Mathematical optimization; Network packet; Statistics","score_opus":0.026116800115298093,"score_gpt":0.25757107170549315,"score_spread":0.23145427159019505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068344357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017631882,0.00007973928,0.9922024,0.00014654928,0.0012867932,0.00020615107,0.0000030914168,0.00032296544,0.0039891494],"genre_scores_gemma":[0.991976,0.00015614854,0.0054968554,0.0018417006,0.00006482397,0.000049235263,0.00000401012,0.000009690265,0.00040149683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875844,0.00020621828,0.00037160885,0.000111415735,0.00021367757,0.0003386657],"domain_scores_gemma":[0.99865043,0.00033483625,0.0001303506,0.0006222551,0.00012061413,0.00014148344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006911677,0.00017302265,0.00012879368,0.00022541003,0.00040052045,0.00019956731,0.00052114733,0.000095919175,0.00026171902],"category_scores_gemma":[0.000015371506,0.00016316504,0.00009872525,0.0004410897,0.000049284372,0.004311069,0.000010334292,0.00032625435,0.0003574439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063206804,0.00032118947,0.000039317474,0.000013583512,0.00006539148,2.6798313e-7,0.0096392175,0.060329583,0.0006207211,0.15230644,0.0011568516,0.7754442],"study_design_scores_gemma":[0.001657328,0.00010867021,0.0010402834,0.00011015697,0.000030647487,0.00002128027,0.00037113382,0.8785008,0.021352025,0.0003096375,0.09569195,0.0008060598],"about_ca_topic_score_codex":0.0000014021781,"about_ca_topic_score_gemma":0.0000026430914,"teacher_disagreement_score":0.99021286,"about_ca_system_score_codex":0.00011133481,"about_ca_system_score_gemma":0.000019713103,"threshold_uncertainty_score":0.6653677},"labels":[],"label_agreement":null},{"id":"W2068360111","doi":"10.48550/arxiv.1303.2735","title":"Efficient Codes for Limited View Adversarial Channels","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Code word; Decoding methods; Computer science; List decoding; Code (set theory); Adversary; Adversary model; Construct (python library); Adversarial system; Theoretical computer science; Error detection and correction; Algorithm; Concatenated error correction code; Block code; Computer network; Computer security; Artificial intelligence","score_opus":0.1232927831643639,"score_gpt":0.22351860553127062,"score_spread":0.10022582236690672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068360111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054609507,0.00042546628,0.94044644,0.00045146648,0.00144908,0.0009889056,0.000013835827,0.00030379175,0.0013115141],"genre_scores_gemma":[0.99372315,0.0007586686,0.0037388029,0.00024570597,0.00015674795,0.000011757816,0.000033074117,0.000017552173,0.0013145107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998213,0.00022433627,0.0002311935,0.00089165533,0.00007848529,0.0003613478],"domain_scores_gemma":[0.9973199,0.00028104227,0.00023768461,0.0015652092,0.0004327236,0.0001634778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033366567,0.0003077324,0.00037465623,0.00021176397,0.00033247136,0.0002296786,0.0025385104,0.00022355268,0.000054616434],"category_scores_gemma":[0.000069458474,0.0003396021,0.00025380764,0.0005284827,0.00009223656,0.00013577405,0.0029657676,0.00040558117,0.00011513182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024322686,0.00013014107,0.000034705194,0.00006758209,0.000101015816,0.000010443078,0.0004604,0.5610306,0.000054451793,0.43026245,0.0015986258,0.0062252725],"study_design_scores_gemma":[0.0005939862,0.000046667617,0.00006417104,0.00013604382,0.000037625916,9.929707e-7,0.000022442617,0.9816093,0.000079817066,0.005888579,0.011128531,0.00039184082],"about_ca_topic_score_codex":0.000020105312,"about_ca_topic_score_gemma":0.000014944274,"teacher_disagreement_score":0.9391137,"about_ca_system_score_codex":0.00018212153,"about_ca_system_score_gemma":0.00016510382,"threshold_uncertainty_score":0.9999056},"labels":[],"label_agreement":null},{"id":"W2068562910","doi":"10.1002/ett.1533","title":"Optimal distributed interference avoidance: potential game and learning","year":2012,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Potential game; Computer science; Nash equilibrium; Interference (communication); Distributed algorithm; Graph; Mathematical optimization; Channel (broadcasting); Game theory; Selection (genetic algorithm); Wireless network; Wireless; Distributed computing; Theoretical computer science; Artificial intelligence; Mathematics; Computer network; Telecommunications","score_opus":0.02426587431752859,"score_gpt":0.27591212451085667,"score_spread":0.2516462501933281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068562910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023056116,0.0026451424,0.9662561,0.0054135816,0.00009501328,0.00014487402,0.000003263465,0.0020539511,0.00033194938],"genre_scores_gemma":[0.89871025,0.0076963487,0.09331603,0.000040487175,0.0000065106765,0.00010167178,0.000008548764,0.00001116033,0.00010896647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987755,0.00022303445,0.00027250487,0.00024203524,0.00012135388,0.00036559824],"domain_scores_gemma":[0.9981086,0.00018463157,0.0001027163,0.0014466344,0.00010013918,0.00005728262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037754804,0.00018614306,0.00016723572,0.00028976964,0.0011274297,0.00013870664,0.0016365708,0.000109399065,0.000028011344],"category_scores_gemma":[0.000103269966,0.00018861178,0.00005860983,0.00084604503,0.00023240078,0.0007076481,0.00022377889,0.0010853169,0.000033175547],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010302935,0.00038528204,0.00032717592,0.000010705425,0.000059707218,5.8791824e-7,0.0023991875,0.0181253,0.002397149,0.033992995,0.00014992607,0.9421417],"study_design_scores_gemma":[0.001562041,0.0005773728,0.00926213,0.00037540213,0.00011276281,0.00017788413,0.009910016,0.8309727,0.022321193,0.0021495696,0.12042868,0.00215027],"about_ca_topic_score_codex":0.000005053664,"about_ca_topic_score_gemma":0.000007063194,"teacher_disagreement_score":0.9399914,"about_ca_system_score_codex":0.00007227561,"about_ca_system_score_gemma":0.00002310493,"threshold_uncertainty_score":0.86713916},"labels":[],"label_agreement":null},{"id":"W2068667489","doi":"10.1109/wcnc.2014.6952203","title":"Delay constrained buffer-aided relaying with outdated CSI","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Channel state information; Computer science; Relay; Transmission (telecommunications); Network packet; Channel (broadcasting); Selection (genetic algorithm); Node (physics); Schedule; Transmission delay; Bit error rate; Computer network; Diversity gain; Control theory (sociology); Real-time computing; Fading; Telecommunications; Wireless; Engineering; Power (physics); Control (management)","score_opus":0.024988511836670124,"score_gpt":0.24800240473326166,"score_spread":0.22301389289659154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068667489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015078037,0.000044585166,0.9176804,0.0022287557,0.00007086994,0.000102407284,1.6289309e-7,0.00035574532,0.06443903],"genre_scores_gemma":[0.9258338,0.000030393383,0.07195328,0.0011980514,0.00002234313,0.00000830124,0.0000029638793,0.0000064406145,0.00094441633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990916,0.0001640071,0.00016598198,0.00024364513,0.00013895144,0.00019577116],"domain_scores_gemma":[0.9987893,0.00018877377,0.000054327687,0.0007367772,0.00014369751,0.00008712888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036845906,0.000112531765,0.00012983882,0.000057389774,0.0002183549,0.00016116301,0.0007445484,0.000033291006,0.00008218069],"category_scores_gemma":[0.00006221508,0.0000823447,0.000024944788,0.000368556,0.00006638775,0.0002904886,0.00023782768,0.00013819647,0.00007780611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011475039,0.000053854186,0.001290599,0.0000045068546,0.000034914894,0.0000069156413,0.0007967372,0.00032074476,0.0029239384,0.84117633,0.0024681133,0.15091185],"study_design_scores_gemma":[0.0018271455,0.0003068359,0.0026869175,0.00008817603,0.000011537326,0.000106081956,0.00007424521,0.9353682,0.0038505343,0.0012290354,0.05381939,0.00063192943],"about_ca_topic_score_codex":0.000005245143,"about_ca_topic_score_gemma":0.000043733293,"teacher_disagreement_score":0.93504745,"about_ca_system_score_codex":0.000019338395,"about_ca_system_score_gemma":0.000040774015,"threshold_uncertainty_score":0.33579195},"labels":[],"label_agreement":null},{"id":"W2068802185","doi":"10.1109/glocomw.2011.6162518","title":"Exact analytical solution for end-to-end SNR of multihop AF relaying systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ergodic theory; Nakagami distribution; Fading; Outage probability; Signal-to-noise ratio (imaging); Computer science; Topology (electrical circuits); Algorithm; Probability density function; Spread spectrum; Mathematics; Telecommunications; Statistics; Channel (broadcasting); Decoding methods; Combinatorics; Mathematical analysis","score_opus":0.1350399830578023,"score_gpt":0.31636587361220453,"score_spread":0.18132589055440224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068802185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004907886,0.00015906969,0.9818524,0.00029663803,0.00020631128,0.0002744817,0.000001144135,0.000078130804,0.012223938],"genre_scores_gemma":[0.9292682,0.000036292615,0.069979325,0.000096566524,0.000027567343,0.000027038146,0.0000015208324,0.000005129821,0.0005583809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991037,0.00008891302,0.00027577503,0.00021485475,0.00013061102,0.00018613826],"domain_scores_gemma":[0.99887276,0.00019372947,0.000070330905,0.00058338017,0.0001918572,0.00008793344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052814453,0.000084422216,0.00015530571,0.000105248444,0.00012672677,0.000043924083,0.00061958015,0.00004029769,0.000056130586],"category_scores_gemma":[0.00009648148,0.000072578136,0.00006177871,0.00030871644,0.00002477056,0.00022780342,0.000282509,0.00007030206,0.000024262727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033284006,0.00016796519,0.0011324728,0.000039753177,0.000056329016,0.0000013302308,0.0034785115,0.00029978683,0.0055164807,0.860641,0.0029752217,0.12565784],"study_design_scores_gemma":[0.00025489222,0.00010480258,0.0018129542,0.00004527981,0.0000073701744,0.0000029466446,0.00006374925,0.9910508,0.0015139215,0.00010263109,0.0049122055,0.00012845498],"about_ca_topic_score_codex":0.000046933874,"about_ca_topic_score_gemma":0.000039771792,"teacher_disagreement_score":0.990751,"about_ca_system_score_codex":0.000038894785,"about_ca_system_score_gemma":0.000034724868,"threshold_uncertainty_score":0.29596505},"labels":[],"label_agreement":null},{"id":"W2069085483","doi":"10.1002/ett.1384","title":"Improved OFDMA uplink transmission<i>via</i>cooperative relaying in the presence of frequency offsets—Part I: Ergodic information rate analysis","year":2009,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Alberta","funders":"","keywords":"Ergodic theory; Telecommunications link; Relay; Node (physics); Computer science; Transmission (telecommunications); Orthogonal frequency-division multiple access; Frequency offset; Offset (computer science); Computer network; Transmitter power output; Power (physics); Topology (electrical circuits); Orthogonal frequency-division multiplexing; Telecommunications; Mathematics; Transmitter; Physics; Acoustics","score_opus":0.021076179402429264,"score_gpt":0.2562649022384948,"score_spread":0.23518872283606554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069085483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020221632,0.0005451165,0.9788236,0.010413818,0.000049916147,0.00046170913,0.0000087241615,0.00012550651,0.0075494363],"genre_scores_gemma":[0.9709331,0.0044573327,0.02322456,0.0011764878,0.0000087808,0.000061167026,0.00004181488,0.000008787753,0.00008798495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962856,0.0021184664,0.0008686644,0.00026369697,0.00021331168,0.00025023537],"domain_scores_gemma":[0.9964465,0.0005996235,0.0002822791,0.002301427,0.0002927574,0.00007741647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015479987,0.00021675396,0.00026954222,0.00060100487,0.0008298702,0.00017944939,0.002890432,0.000052813797,0.00007777367],"category_scores_gemma":[0.00006253,0.00017684654,0.00021053731,0.0037945348,0.00010523344,0.0012361225,0.00003180156,0.00074786565,0.000030451803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003364607,0.0011654769,0.00011449885,0.000013709668,0.00025613056,0.0000020457833,0.020594304,0.035952333,0.006130145,0.017817358,0.0002767562,0.9176436],"study_design_scores_gemma":[0.0016753038,0.0005888167,0.045152567,0.00027354326,0.0003309225,0.000012912781,0.0007134219,0.93336487,0.0033364277,0.00076765014,0.012900848,0.00088274607],"about_ca_topic_score_codex":0.000038338727,"about_ca_topic_score_gemma":0.0001010429,"teacher_disagreement_score":0.96891093,"about_ca_system_score_codex":0.00005912864,"about_ca_system_score_gemma":0.00008654663,"threshold_uncertainty_score":0.7211593},"labels":[],"label_agreement":null},{"id":"W2069278863","doi":"10.1109/lwc.2014.2316378","title":"A Practical Differential Receiver for Amplify-and-Forward Relaying","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Detector; Computer science; Algorithm; Channel (broadcasting); Keying; Telecommunications","score_opus":0.06727772671051806,"score_gpt":0.32526192886380795,"score_spread":0.2579842021532899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069278863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028172413,0.000081038845,0.91226,0.058265544,0.00021892306,0.0003053276,0.0000025716274,0.00018846062,0.00050574064],"genre_scores_gemma":[0.8716831,0.0007613518,0.12367086,0.003525505,0.00007065012,0.00019055969,0.000017825827,0.000018159477,0.00006199459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984046,0.0005082867,0.00032145643,0.00032773305,0.0001582529,0.0002796193],"domain_scores_gemma":[0.99542606,0.0015168857,0.00015222425,0.0026684348,0.00012287174,0.00011352811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005127621,0.00017099825,0.00022045772,0.00011437901,0.00085513736,0.00027830273,0.0019478783,0.000074457035,0.0000048708102],"category_scores_gemma":[0.00013889973,0.00017154156,0.00007822448,0.00025731107,0.00022157874,0.0004620556,0.00074365805,0.00039099887,0.000019285146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002464411,0.0002187146,0.0005197941,0.000031379583,0.000102986836,6.753775e-7,0.001899784,0.00005737692,0.054528,0.7178916,0.024943281,0.19978176],"study_design_scores_gemma":[0.0013160908,0.00008114588,0.0014788136,0.00010600789,0.00004608349,0.00002932487,0.000056599572,0.8166365,0.0015606025,0.00096238154,0.17709045,0.0006360136],"about_ca_topic_score_codex":0.0000067904325,"about_ca_topic_score_gemma":0.000023165429,"teacher_disagreement_score":0.8435107,"about_ca_system_score_codex":0.000053463056,"about_ca_system_score_gemma":0.000032383123,"threshold_uncertainty_score":0.69952613},"labels":[],"label_agreement":null},{"id":"W2069451012","doi":"10.1145/2507924.2517478","title":"How much can we gain by exploiting buffers in wireless relay networks?","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Computer network; Relay channel; Fading; Node (physics); Wireless network; Transmission (telecommunications); Throughput; Wireless; Schedule; Telecommunications; Channel (broadcasting); Engineering; Power (physics)","score_opus":0.028569456608045492,"score_gpt":0.2376480535085955,"score_spread":0.20907859690055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069451012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08752471,0.00094990863,0.8414967,0.063489996,0.00022804104,0.00039509093,3.7719158e-7,0.00031221798,0.0056029665],"genre_scores_gemma":[0.9894635,0.00144883,0.0049089435,0.0014627477,0.000038073296,0.00007235381,0.0000039632187,0.000010576523,0.0025909985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987755,0.00021349012,0.00020036643,0.00030707542,0.00014282444,0.00036076468],"domain_scores_gemma":[0.99891585,0.00019729634,0.00006391345,0.00063066743,0.00008218557,0.00011005884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002700609,0.0001421716,0.0001566983,0.00007749616,0.0001614248,0.00054492545,0.0010248611,0.000057460944,0.000056777935],"category_scores_gemma":[0.000030176729,0.00012778817,0.00003492182,0.000586913,0.000036334175,0.0006880885,0.000438467,0.00026363303,0.000022185626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020262205,0.00010165442,0.003152805,0.000008990309,0.000017581482,0.0000060909824,0.002267217,0.0007162301,0.005157676,0.13956901,0.09018836,0.75881237],"study_design_scores_gemma":[0.0003104425,0.000024665089,0.0003301031,0.00007012686,8.9888124e-7,0.0000028117533,0.0006212823,0.9918881,0.0012510944,0.00041995084,0.004796694,0.00028385274],"about_ca_topic_score_codex":0.00008827233,"about_ca_topic_score_gemma":0.00035355287,"teacher_disagreement_score":0.99117184,"about_ca_system_score_codex":0.000077925164,"about_ca_system_score_gemma":0.000026620877,"threshold_uncertainty_score":0.5254728},"labels":[],"label_agreement":null},{"id":"W2069466651","doi":"10.1109/icassp.2010.5496303","title":"A semi-closed form solution to the SNR balancing problem of two-way relay network beamforming","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Relay; Computer science; Closed-form expression; Context (archaeology); Simple (philosophy); Bisection; Computational complexity theory; Mathematical optimization; Transceiver; Power (physics); Bisection method; Transmitter power output; Algorithm; Mathematics; Telecommunications; Channel (broadcasting); Wireless","score_opus":0.019034657318686095,"score_gpt":0.2630708581450873,"score_spread":0.2440362008264012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069466651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028614487,0.00009434411,0.9464228,0.005069403,0.00038270513,0.000428574,3.93512e-7,0.00014415175,0.018843113],"genre_scores_gemma":[0.81028444,0.000030838393,0.18813723,0.00079797814,0.0001494391,0.000028987346,0.0000015006348,0.0000067687192,0.0005628286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888957,0.000069364396,0.00030826332,0.00022038509,0.00019971104,0.00031270206],"domain_scores_gemma":[0.9985655,0.00017661188,0.00011425468,0.00089782855,0.0001647633,0.00008102142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551352,0.00011516704,0.00014095621,0.000050092498,0.00043124755,0.00009605516,0.0011891167,0.00004367474,0.00003956869],"category_scores_gemma":[0.000042255666,0.000078266814,0.000059194965,0.00069484126,0.00003197309,0.00033888317,0.00073180394,0.0003089497,0.000032112777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011242089,0.00006794663,0.0015378651,0.000014519698,0.00003221717,8.547516e-7,0.0057917065,0.013999728,0.048914377,0.5647695,0.014427594,0.35043243],"study_design_scores_gemma":[0.0005418779,0.000112660615,0.0022114704,0.00012769754,0.000009783054,0.000020024854,0.000055829816,0.8806837,0.0072151273,0.0032003557,0.10547147,0.0003500105],"about_ca_topic_score_codex":0.00003385489,"about_ca_topic_score_gemma":0.0017053311,"teacher_disagreement_score":0.86668396,"about_ca_system_score_codex":0.000031008964,"about_ca_system_score_gemma":0.0000574442,"threshold_uncertainty_score":0.33168513},"labels":[],"label_agreement":null},{"id":"W2069794613","doi":"10.1109/lcomm.2012.011312.112462","title":"Decode-Compress-and-Forward with Selective-Cooperation for Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Block Error Rate; Decoding methods; Transmission (telecommunications); Relay channel; Coding (social sciences); Algorithm; Computer network; Real-time computing; Telecommunications link; Telecommunications; Mathematics; Statistics","score_opus":0.03800262803668755,"score_gpt":0.2854847177944032,"score_spread":0.24748208975771566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069794613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117579475,0.0023279677,0.97183514,0.012500825,0.00017775537,0.0005380886,0.000002102931,0.00019853479,0.00066163176],"genre_scores_gemma":[0.8482415,0.0011281809,0.14693594,0.003160574,0.00009056488,0.00033729017,0.00002364763,0.000020069267,0.000062204315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986776,0.0003084074,0.0002709685,0.00024870466,0.00011830183,0.00037599666],"domain_scores_gemma":[0.9967244,0.00059427915,0.00012837147,0.0022166735,0.00020157549,0.00013466648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005574031,0.00018661671,0.00018766391,0.0001102482,0.00093130884,0.00020422722,0.0017157139,0.00006052606,0.0000033438278],"category_scores_gemma":[0.000038782408,0.00016889245,0.000050811595,0.00048369673,0.00016737264,0.0010065201,0.0003933919,0.00030489973,0.0000103238835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015770987,0.0010955838,0.026718311,0.000059164016,0.0006695019,0.0000012558263,0.015681066,0.043682076,0.030513648,0.515594,0.081075594,0.28475207],"study_design_scores_gemma":[0.001538568,0.00014875525,0.009745448,0.000107705055,0.00006903905,0.00005156086,0.000055991866,0.85316634,0.0020559265,0.0001007136,0.13209563,0.00086431304],"about_ca_topic_score_codex":0.0000062690888,"about_ca_topic_score_gemma":0.00006491165,"teacher_disagreement_score":0.8364836,"about_ca_system_score_codex":0.00007990307,"about_ca_system_score_gemma":0.000032400152,"threshold_uncertainty_score":0.71629685},"labels":[],"label_agreement":null},{"id":"W2069917158","doi":"10.1109/ccece.2012.6334919","title":"Multiuser XOR-and-forward relaying using Alamouti STBC","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Space–time block code; Fading; Computer science; Bit error rate; Block code; Algorithm; Phase-shift keying; Channel (broadcasting); Outage probability; Decoding methods; Coding (social sciences); Electronic engineering; Mathematics; Telecommunications; Statistics; Engineering","score_opus":0.08160121684247244,"score_gpt":0.31416953874332954,"score_spread":0.23256832190085708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069917158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13853507,0.0017851245,0.84561545,0.00090380636,0.00031573718,0.00012131875,1.6544539e-7,0.00022171887,0.012501633],"genre_scores_gemma":[0.8930048,0.0001871639,0.105626345,0.00062371197,0.000057036334,0.0000029152686,3.584707e-7,0.0000057444636,0.00049196027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992671,0.00008677865,0.00014160525,0.00014634938,0.00010659884,0.00025157514],"domain_scores_gemma":[0.99924034,0.00008820356,0.00003876226,0.00046711485,0.00004926019,0.00011633815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037860172,0.000089641086,0.000094271134,0.000054580454,0.00025616417,0.00010517143,0.0003929092,0.00003429028,0.000055777735],"category_scores_gemma":[0.000034521963,0.0000759819,0.000028576145,0.00021628539,0.000027912549,0.00077319966,0.00060919754,0.000116412506,0.000044031734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004990965,0.00013868917,0.07907311,0.000013216449,0.00005214623,0.0000019611887,0.007738727,0.00022420054,0.012877604,0.60444576,0.0023166346,0.293113],"study_design_scores_gemma":[0.00070707256,0.000030552183,0.031082338,0.00006022178,0.000016226777,0.000047565394,0.00024089853,0.88618964,0.004611456,0.0003522633,0.07601736,0.00064443145],"about_ca_topic_score_codex":0.00000864522,"about_ca_topic_score_gemma":0.000006464023,"teacher_disagreement_score":0.8859654,"about_ca_system_score_codex":0.00003103518,"about_ca_system_score_gemma":0.000015457716,"threshold_uncertainty_score":0.3098452},"labels":[],"label_agreement":null},{"id":"W2070005935","doi":"10.1155/2011/184685","title":"Virtual Cooperation for Throughput Maximization in Distributed Large-Scale Wireless Networks","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Johns Hopkins University","keywords":"Throughput; Computer science; Bandwidth (computing); Maximum throughput scheduling; Wireless network; Code rate; Fading; Computer network; Wireless; Maximization; Power (physics); Mathematical optimization; Algorithm; Mathematics; Quality of service; Telecommunications; Channel (broadcasting); Decoding methods","score_opus":0.017113999900364437,"score_gpt":0.30002420439909433,"score_spread":0.2829102044987299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070005935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02353315,0.0012516212,0.9736852,0.0006312782,0.0004458691,0.00021763009,0.0000022979664,0.00004739876,0.0001855225],"genre_scores_gemma":[0.9815795,0.001104517,0.016559478,0.00041992767,0.0002547089,0.000025985426,0.00001937401,0.00001592578,0.00002061746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835396,0.00017534923,0.0005479151,0.0003177007,0.00023216434,0.00037288634],"domain_scores_gemma":[0.99889535,0.00022831875,0.00028182103,0.00021338246,0.00029480847,0.000086330336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010459826,0.00018369322,0.00022998173,0.00018470293,0.0004936023,0.00045807209,0.00070557784,0.00009099414,0.000016369766],"category_scores_gemma":[0.000100047386,0.0001672919,0.000046929195,0.0009097539,0.00005069462,0.002303153,0.00010170185,0.0009111848,0.0000021321566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100863515,0.00024256224,0.002223429,0.000012650632,0.0000028893828,0.000010307708,0.0008474924,0.28544396,0.0016168138,0.01277525,0.00006824968,0.6966555],"study_design_scores_gemma":[0.0012128592,0.00014161637,0.0009076232,0.00024241641,0.000002014192,0.000030381256,0.00009087716,0.9897411,0.00055897754,0.0010161173,0.005832454,0.00022358837],"about_ca_topic_score_codex":2.0979013e-7,"about_ca_topic_score_gemma":0.00015152161,"teacher_disagreement_score":0.9580463,"about_ca_system_score_codex":0.00009882034,"about_ca_system_score_gemma":0.00011480676,"threshold_uncertainty_score":0.6821966},"labels":[],"label_agreement":null},{"id":"W2070061073","doi":"10.1109/ictel.2010.5478643","title":"Performance analysis of cooperative diversity networks with imperfect channel estimation over Rician fading channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rician fading; Relay; Fading; Computer science; Channel (broadcasting); Maximal-ratio combining; Imperfect; Signal-to-noise ratio (imaging); Outage probability; Bit error rate; Diversity combining; Algorithm; Electronic engineering; Telecommunications; Engineering; Power (physics); Physics","score_opus":0.019620555046896308,"score_gpt":0.25055281831317444,"score_spread":0.23093226326627814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070061073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45539188,0.000022679493,0.54241765,0.000089522255,0.000113713264,0.000106839536,6.762253e-7,0.000061478124,0.0017955515],"genre_scores_gemma":[0.99458706,0.00010758111,0.004951969,0.0001614962,0.00002662807,0.00000794689,0.000009876139,0.00000497272,0.00014244835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904156,0.000074731644,0.00019206142,0.00027718555,0.00020543307,0.00020901806],"domain_scores_gemma":[0.99879587,0.00012222196,0.00013479569,0.00059940486,0.0002724864,0.00007524766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003880306,0.00014692712,0.0002661297,0.00029385908,0.00056499377,0.000088402805,0.0007478057,0.000058902402,0.00008428008],"category_scores_gemma":[0.000022151704,0.00011472,0.00007095782,0.002297613,0.00007887795,0.00070847536,0.0007042601,0.00024638308,0.0000030633362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022642382,0.00008764912,0.026075667,0.000006818576,0.00047160313,0.0000013594903,0.004159657,0.9253348,0.00060122594,0.012930928,0.00012362262,0.030183991],"study_design_scores_gemma":[0.00020069093,0.000088451925,0.044349983,0.0000135536375,0.00007709318,0.0000012513132,0.000020223815,0.9542939,0.0007625847,0.0000066020234,0.000030818013,0.00015483762],"about_ca_topic_score_codex":0.000033362096,"about_ca_topic_score_gemma":0.0003369175,"teacher_disagreement_score":0.53919524,"about_ca_system_score_codex":0.000026665797,"about_ca_system_score_gemma":0.000029468594,"threshold_uncertainty_score":0.46781456},"labels":[],"label_agreement":null},{"id":"W2070061930","doi":"10.1109/tcomm.2012.061112.11-551","title":"Exact Analysis of Dual-Hop AF Maximum End-to-End SNR Relay Selection","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Nakagami distribution; Rayleigh fading; Rician fading; Channel state information; Computer science; Diversity gain; Selection (genetic algorithm); Fading; Hop (telecommunications); Signal-to-noise ratio (imaging); Topology (electrical circuits); Probability density function; Maximal-ratio combining; Cumulative distribution function; Mathematics; Channel (broadcasting); Telecommunications; Wireless; Statistics; Physics","score_opus":0.05600481566002874,"score_gpt":0.3132762628461942,"score_spread":0.25727144718616546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070061930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077730953,0.0004611564,0.9830225,0.0037571518,0.00028536594,0.0002921248,0.000027424603,0.00023338411,0.004147767],"genre_scores_gemma":[0.9565371,0.0015586041,0.040844996,0.00033964516,0.00002103743,0.00013884128,0.000017371915,0.000017747296,0.0005246241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785805,0.00063111034,0.0005450792,0.000288279,0.00032112177,0.0003563598],"domain_scores_gemma":[0.99494743,0.00072586327,0.00018518382,0.0035970807,0.00031708108,0.00022733235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007619682,0.00021186522,0.00033906993,0.0010344605,0.0008701241,0.0000872514,0.0018474612,0.00009963215,0.00035325493],"category_scores_gemma":[0.000024080584,0.00022498361,0.00027960568,0.0051988605,0.00012582185,0.0006885039,0.00005620532,0.00050745317,0.0001325966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008871251,0.006438154,0.002154099,0.000033105043,0.004579202,9.54962e-7,0.024127265,0.18719247,0.043785304,0.08671618,0.0031101054,0.6417745],"study_design_scores_gemma":[0.0013852898,0.00053834356,0.032197706,0.00017661513,0.0022332957,0.000038489143,0.0006566245,0.7885626,0.048096087,0.0003769187,0.12395058,0.0017874767],"about_ca_topic_score_codex":0.00007000975,"about_ca_topic_score_gemma":0.0008366988,"teacher_disagreement_score":0.948764,"about_ca_system_score_codex":0.00017318841,"about_ca_system_score_gemma":0.00008402941,"threshold_uncertainty_score":0.9174565},"labels":[],"label_agreement":null},{"id":"W2070087242","doi":"10.1109/mascot.2009.5366718","title":"Optimal multicast in multi-channel multi-radio wireless networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multicast; Computer science; Computer network; Unicast; Channel (broadcasting); Wireless network; Channel allocation schemes; Distributed computing; Wireless; Telecommunications","score_opus":0.06448979883776898,"score_gpt":0.30501730784632486,"score_spread":0.24052750900855588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070087242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010212568,0.00040236206,0.98689824,0.0013733598,0.00016151795,0.00021572827,2.593762e-7,0.00023095963,0.00050500646],"genre_scores_gemma":[0.872,0.00041681263,0.12624645,0.00077809644,0.000033329263,0.000012026849,0.0000024571755,0.0000073763513,0.00050347595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985756,0.00015108618,0.0003231989,0.00040682754,0.00013325238,0.00041003473],"domain_scores_gemma":[0.9988344,0.000095481715,0.000058074118,0.00078448275,0.00009317861,0.0001344286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003407401,0.000190155,0.000218031,0.00013362755,0.00016189153,0.00016500457,0.0012039094,0.000086169995,0.00002036225],"category_scores_gemma":[0.00003122323,0.00017604374,0.00006239436,0.0006312125,0.00004124433,0.00043060977,0.00030350641,0.00032433806,0.000039224433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003974599,0.0024868778,0.0016119593,0.0000074952427,0.00003543048,0.00010897415,0.005962779,0.42516702,0.0014896587,0.06949356,0.0017134501,0.49188304],"study_design_scores_gemma":[0.001096419,0.000043589585,0.017444573,0.0000293211,0.0000012041254,0.0000076182087,0.000036474226,0.980683,0.00014096065,0.000010103607,0.00027500014,0.00023172297],"about_ca_topic_score_codex":0.000011884914,"about_ca_topic_score_gemma":0.00018085662,"teacher_disagreement_score":0.86178744,"about_ca_system_score_codex":0.00006620514,"about_ca_system_score_gemma":0.000030224954,"threshold_uncertainty_score":0.71788555},"labels":[],"label_agreement":null},{"id":"W2070101982","doi":"10.1109/asms-spsc.2010.5586858","title":"Joint control of delay and packet drop rate in satellite systems using network coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Retransmission; Computer science; Network packet; Linear network coding; Transmission delay; Packet loss; Real-time computing; Fading; Channel (broadcasting)","score_opus":0.04021317054006991,"score_gpt":0.26612541350849744,"score_spread":0.22591224296842755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070101982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31927902,0.0017585936,0.67608523,0.0003059287,0.00045812887,0.00027030887,5.592257e-7,0.000054137818,0.0017881033],"genre_scores_gemma":[0.9918891,0.0005684952,0.007284722,0.00015437262,0.000048303238,0.000004313443,4.4231876e-7,0.000005151243,0.000045106637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989816,0.00022781755,0.000327178,0.00018516403,0.00008135582,0.00019686659],"domain_scores_gemma":[0.9990912,0.00020885795,0.00011175057,0.0004292988,0.00009832351,0.000060550497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001126373,0.000095075884,0.0002201027,0.0000719387,0.000097854434,0.00012348928,0.00030722906,0.000046985697,0.0000085920465],"category_scores_gemma":[0.00003972966,0.00008168091,0.000023647592,0.00033415153,0.000053494172,0.0002216299,0.00020238901,0.0001962848,0.0000021778726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001675913,0.00005947813,0.034354784,0.000045561144,0.000039394166,0.000012898729,0.0012086929,0.009965503,0.18044041,0.73753625,0.00013783766,0.03618241],"study_design_scores_gemma":[0.0004321709,0.000017245671,0.0068758964,0.0000808349,0.0000029350374,0.000011461015,0.000021197318,0.99058366,0.00048287868,0.00021741749,0.00115746,0.00011686977],"about_ca_topic_score_codex":0.00003487558,"about_ca_topic_score_gemma":0.00021961721,"teacher_disagreement_score":0.9806181,"about_ca_system_score_codex":0.000014868661,"about_ca_system_score_gemma":0.000033143548,"threshold_uncertainty_score":0.3330851},"labels":[],"label_agreement":null},{"id":"W2070506636","doi":"10.1109/glocom.2012.6504022","title":"Power allocation/beamforming for DF MIMO two-way relaying: Relay and network optimization","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Beamforming; Maximization; Computer science; MIMO; Mathematical optimization; Broadcasting (networking); Optimization problem; Power (physics); Channel (broadcasting); Telecommunications; Computer network; Mathematics; Algorithm","score_opus":0.03091883577233309,"score_gpt":0.2816716899010147,"score_spread":0.25075285412868165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070506636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001051038,0.0012894328,0.983987,0.0015883337,0.0003616186,0.00027884037,2.426158e-7,0.00015103449,0.011292494],"genre_scores_gemma":[0.48728102,0.00031204062,0.51041013,0.00087461923,0.00012567281,0.000042960124,0.0000064324395,0.000010406951,0.0009367425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905074,0.0000749768,0.00023316391,0.0002081315,0.00010676469,0.00032621395],"domain_scores_gemma":[0.99891204,0.0002550032,0.00008744646,0.00048311937,0.0001420782,0.000120311575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073855446,0.00012002433,0.00012148037,0.000053571835,0.00046362597,0.00014449374,0.00038520107,0.00004887794,0.000053153286],"category_scores_gemma":[0.000079775804,0.000108566055,0.000036470297,0.0003293857,0.000028861969,0.0010049102,0.00029118315,0.000096392956,0.000011373239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010444399,0.00007394964,0.0023057233,0.000008822016,0.000032941694,1.5084004e-7,0.0024464577,0.1384782,0.00026610968,0.81616133,0.0089560775,0.031259783],"study_design_scores_gemma":[0.00048600644,0.000046268382,0.00053480687,0.0000312552,0.000007511598,0.000010376953,0.00006349077,0.9406068,0.00022807858,0.00032309382,0.057399012,0.0002633177],"about_ca_topic_score_codex":0.0000014865616,"about_ca_topic_score_gemma":0.00000493353,"teacher_disagreement_score":0.8158383,"about_ca_system_score_codex":0.000036723362,"about_ca_system_score_gemma":0.00002287514,"threshold_uncertainty_score":0.44271952},"labels":[],"label_agreement":null},{"id":"W2070524293","doi":"10.1109/iwqos.2013.6550260","title":"A cloud-assisted energy-efficient video streaming system for smartphones","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Linear network coding; Cloud computing; Cellular network; Energy consumption; Wireless; Video streaming; Real-time computing; Telecommunications; Network packet; Operating system","score_opus":0.029499531398997848,"score_gpt":0.24816494494091543,"score_spread":0.21866541354191757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070524293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0088231955,0.00028903098,0.9816681,0.001080216,0.00050094846,0.00025993687,6.87571e-7,0.0003884762,0.0069893934],"genre_scores_gemma":[0.97233766,0.00002123115,0.025493717,0.00030369012,0.00007695193,0.00022595831,0.0000025904997,0.000008058411,0.0015301488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903893,0.0000858073,0.00024191565,0.0002701644,0.00012771274,0.00023547003],"domain_scores_gemma":[0.9986673,0.000232199,0.000072698494,0.00069271255,0.00024595534,0.000089143636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019144609,0.00011953523,0.00014403393,0.000072860465,0.0002995738,0.0002750758,0.00077025173,0.00003668558,0.00003713647],"category_scores_gemma":[0.00002508338,0.00009647263,0.00007139071,0.00033124906,0.000020530602,0.00017031407,0.00032195006,0.000046730067,0.00006286427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036612348,0.00008237982,0.000047702466,0.000023699542,0.00002427993,7.304122e-7,0.00040856336,0.0004700251,0.0042401385,0.65192086,0.009564153,0.3332138],"study_design_scores_gemma":[0.00037460576,0.000052857733,0.00077568874,0.000062443,0.000004028989,0.000008866572,0.0001838237,0.97541004,0.0046365503,0.00012141352,0.01816702,0.00020262695],"about_ca_topic_score_codex":0.000049849707,"about_ca_topic_score_gemma":0.000058874346,"teacher_disagreement_score":0.97494006,"about_ca_system_score_codex":0.000075354605,"about_ca_system_score_gemma":0.00003715225,"threshold_uncertainty_score":0.39340395},"labels":[],"label_agreement":null},{"id":"W2070950990","doi":"10.1109/pimrc.2011.6139841","title":"Outage performance in cooperative CDMA systems over nakagami-m fading channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Nakagami distribution; Fading; Cumulative distribution function; Code division multiple access; Computer science; Random variable; Expression (computer science); Signal-to-noise ratio (imaging); Outage probability; Maximal-ratio combining; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics; Electronic engineering; Probability density function; Statistics; Channel (broadcasting); Engineering; Combinatorics","score_opus":0.07516726638402382,"score_gpt":0.2674371038395634,"score_spread":0.19226983745553955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070950990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45386043,0.0011140853,0.3492919,0.00024839258,0.0015524164,0.00073532684,0.0000011782671,0.0004482797,0.192748],"genre_scores_gemma":[0.99534696,0.0003502454,0.0015192273,0.00027335985,0.000037381513,0.000042427906,0.0000011173291,0.000008112339,0.0024211835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885404,0.00015373285,0.00027595524,0.00029394325,0.0001443203,0.0002780017],"domain_scores_gemma":[0.99911094,0.000059370654,0.000060903738,0.0005954617,0.00010180321,0.000071511546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041543716,0.0001464049,0.00018266229,0.00014922913,0.00016189447,0.00014912561,0.00093864143,0.000048939415,0.00012197319],"category_scores_gemma":[0.000021550888,0.00012484376,0.0000292325,0.0005848777,0.00003631251,0.0008645332,0.00042199358,0.00018656426,0.000120232304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003121053,0.00036894984,0.039046217,0.00006343217,0.0000605635,0.000044365228,0.0477029,0.007962214,0.0016437159,0.86338836,0.0015642372,0.0381238],"study_design_scores_gemma":[0.00055284845,0.000111134235,0.023809977,0.00014309326,0.0000018306225,0.000011013218,0.00021516306,0.96667635,0.0019431878,0.000047570207,0.0061042816,0.0003835736],"about_ca_topic_score_codex":0.000030258265,"about_ca_topic_score_gemma":0.000045438526,"teacher_disagreement_score":0.9587141,"about_ca_system_score_codex":0.000067544686,"about_ca_system_score_gemma":0.000039417413,"threshold_uncertainty_score":0.5090981},"labels":[],"label_agreement":null},{"id":"W2070953010","doi":"10.1109/cnsr.2010.63","title":"Optimal Symbol Power Distribution for Wireless Network Cocast","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Fading; Quality of service; Computer network; Wireless; Wireless network; Transmitter power output; Energy consumption; Aggregate (composite); Power (physics); Scheme (mathematics); Power consumption; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Mathematics; Electrical engineering; Engineering; Transmitter","score_opus":0.01940556346512533,"score_gpt":0.2719939089782012,"score_spread":0.25258834551307585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070953010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0355934,0.000040960913,0.9591352,0.00160046,0.0006184182,0.00020084469,0.000003309925,0.00016163863,0.0026457803],"genre_scores_gemma":[0.9594657,0.000025090643,0.039498113,0.00033924397,0.00012748048,0.000039094324,0.000024129828,0.0000052944315,0.00047587836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993045,0.000031360236,0.0001435764,0.00020112337,0.00008722755,0.0002322153],"domain_scores_gemma":[0.9990101,0.0001435383,0.00004211275,0.00056441885,0.00016640652,0.00007345584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003048183,0.000088495646,0.00009637515,0.000013163472,0.0003026722,0.00016154992,0.00071929547,0.00005086899,0.00008177497],"category_scores_gemma":[0.000030512256,0.000077692974,0.00005087897,0.00022951543,0.00003783434,0.00023213745,0.00026569897,0.00016218406,0.000030406814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064279757,0.000040689036,0.00024184257,0.0000017363913,0.000008628477,4.543039e-7,0.00012446087,0.00029824604,0.0017190301,0.9273216,0.027849741,0.042387113],"study_design_scores_gemma":[0.0005310059,0.000101671336,0.0033276293,0.000015344844,0.0000044758426,0.000012062817,0.00002400581,0.75709146,0.0019686662,0.0007756858,0.23582318,0.00032479316],"about_ca_topic_score_codex":9.319439e-7,"about_ca_topic_score_gemma":0.000030942734,"teacher_disagreement_score":0.9265459,"about_ca_system_score_codex":0.00001395454,"about_ca_system_score_gemma":0.000035817215,"threshold_uncertainty_score":0.31682274},"labels":[],"label_agreement":null},{"id":"W2071548417","doi":"10.1109/vtcfall.2012.6399207","title":"User Pairing for Capacity Maximization in Cooperative Wireless Network Coding","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear network coding; Pairing; Computer science; Computer network; Network packet; Relay; Wireless network; Heuristic; Maximization; Wireless; Distributed computing; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.06665707131539007,"score_gpt":0.282138795885726,"score_spread":0.21548172457033593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071548417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02851848,0.00017396426,0.9678864,0.0005268461,0.00028756913,0.00031775585,4.5880003e-7,0.00011371091,0.0021747984],"genre_scores_gemma":[0.9478885,0.0001311344,0.050936177,0.00058397144,0.00013681874,0.00006933879,0.0000041367693,0.000008118266,0.00024178503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989866,0.00015614589,0.0002186445,0.00018107946,0.000090086294,0.00036746767],"domain_scores_gemma":[0.99915415,0.0002493676,0.00005525573,0.00034232682,0.00012456065,0.000074350944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007370918,0.0001107072,0.00014366061,0.000058108893,0.00024778742,0.000107749576,0.00043524167,0.000046057437,0.00002618438],"category_scores_gemma":[0.0000566942,0.00010259521,0.00003299724,0.00052130385,0.000023904982,0.00089139276,0.00022733114,0.00011666709,0.000011037295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067194946,0.00007427851,0.026123164,0.000008817062,0.000010730931,1.8934274e-7,0.0020520892,0.008797718,0.0005829813,0.93803066,0.002289436,0.022023235],"study_design_scores_gemma":[0.00073282747,0.000036530502,0.01646549,0.000084003674,0.0000037504853,0.0000033118092,0.00009078034,0.9641809,0.003047448,0.00048330094,0.014497304,0.00037435885],"about_ca_topic_score_codex":0.0000051286584,"about_ca_topic_score_gemma":0.00012079861,"teacher_disagreement_score":0.9553832,"about_ca_system_score_codex":0.00007952647,"about_ca_system_score_gemma":0.000023091925,"threshold_uncertainty_score":0.4183711},"labels":[],"label_agreement":null},{"id":"W2071641871","doi":"10.1109/glocom.2011.6134261","title":"Node Switching Rates of Opportunistic Relaying in Rician and Nakagami-m Fading","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Fading; Relay; Computer science; Nakagami distribution; Node (physics); Channel (broadcasting); Electronic engineering; Computer network; Engineering; Power (physics); Physics","score_opus":0.12467317966269288,"score_gpt":0.30088523919291704,"score_spread":0.17621205953022417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071641871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2503578,0.00059076067,0.6835328,0.00034206986,0.000099821715,0.00012339462,2.1898808e-7,0.00008342017,0.06486972],"genre_scores_gemma":[0.96629566,0.00026950747,0.033117004,0.00023880904,0.000004335625,0.0000027886958,3.015848e-7,0.0000036234835,0.00006794921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993792,0.000071225455,0.00021140996,0.00015313309,0.00006244717,0.0001225498],"domain_scores_gemma":[0.9994442,0.000109820394,0.000063938205,0.0003011465,0.000037339745,0.000043554923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003633932,0.000067924106,0.000115437775,0.000118180826,0.00008232056,0.00003208949,0.00038713458,0.00002263313,0.000021420272],"category_scores_gemma":[0.000053823635,0.00006165853,0.0000148464915,0.00027539133,0.000021382155,0.00027031952,0.00032635257,0.00010300362,0.0000032965418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006850641,0.00008725157,0.06120577,0.00002717066,0.0000151043005,0.000017641649,0.015356377,0.000030537107,0.011361565,0.7433316,0.00007960861,0.1684805],"study_design_scores_gemma":[0.0007664144,0.00008905728,0.18005116,0.0003689662,0.000007987886,0.000022394668,0.0008639219,0.8025975,0.005750322,0.008331171,0.0006324244,0.000518669],"about_ca_topic_score_codex":0.000041938223,"about_ca_topic_score_gemma":0.0000701751,"teacher_disagreement_score":0.80256695,"about_ca_system_score_codex":0.000013953624,"about_ca_system_score_gemma":0.000023068373,"threshold_uncertainty_score":0.2514362},"labels":[],"label_agreement":null},{"id":"W2071711122","doi":"10.1109/iccchina.2012.6356960","title":"Outage analysis and relay allocation for multi-stream OFDMA decode-and-forward Rayleigh fading networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subcarrier; Relay; Computer science; Rayleigh fading; Frequency-division multiple access; Orthogonal frequency-division multiplexing; Orthogonal frequency-division multiple access; Fading; Mathematical optimization; Computer network; Algorithm; Decoding methods; Mathematics; Channel (broadcasting)","score_opus":0.05811662233933315,"score_gpt":0.31681993443874984,"score_spread":0.25870331209941666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071711122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02553987,0.001783268,0.971427,0.0006083013,0.00009555064,0.00019814374,0.0000010067603,0.00009663784,0.00025017842],"genre_scores_gemma":[0.86558723,0.0017055542,0.1316646,0.0003262375,0.00005018951,0.000050727813,0.000009740912,0.0000066929347,0.00059900444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990862,0.00008668386,0.00022257393,0.00025540584,0.00008052971,0.00026861945],"domain_scores_gemma":[0.9990109,0.0002451072,0.000083988685,0.00041686365,0.000097992546,0.00014515525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005891351,0.00012858599,0.000195727,0.00015245262,0.00030658106,0.00016247295,0.00031576495,0.000063669555,0.00001785176],"category_scores_gemma":[0.00005027321,0.00011083134,0.00007105453,0.0005551288,0.00003399917,0.00057708943,0.00030541007,0.00009384347,0.0000024806307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015668711,0.00019014813,0.27198973,0.000021007958,0.00066833897,4.165422e-7,0.0040197195,0.0049656844,0.0006986781,0.15000814,0.0007575912,0.5666649],"study_design_scores_gemma":[0.00029808373,0.000015922345,0.031677414,0.000008839154,0.00009023155,0.0000014798702,0.000039891092,0.96545076,0.00027229745,0.000021954498,0.0019660126,0.0001571337],"about_ca_topic_score_codex":0.000010731408,"about_ca_topic_score_gemma":0.00016291854,"teacher_disagreement_score":0.96048504,"about_ca_system_score_codex":0.000025610809,"about_ca_system_score_gemma":0.000009458082,"threshold_uncertainty_score":0.45195708},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035809271223522204,"score_gpt":0.274050797603345,"score_spread":0.2382415263798228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071879168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8047955,0.00419912,0.18978398,0.000056564662,0.00023165306,0.00017382906,5.420763e-7,0.000041230553,0.0007175612],"genre_scores_gemma":[0.99269557,0.003785077,0.0031987526,0.00006495268,0.00011583231,0.0000063097054,6.490358e-7,0.00001290187,0.00011996604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981532,0.00026712232,0.00046081367,0.00030333176,0.0005125377,0.00030297867],"domain_scores_gemma":[0.9985326,0.00022033915,0.00050338963,0.00016440438,0.00047811787,0.000101149846],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005417189,0.00021935045,0.00031720573,0.0002820829,0.0014668291,0.00012875788,0.0006811697,0.000054386455,0.000009741032],"category_scores_gemma":[0.000048289003,0.00017299718,0.000043720243,0.0010681397,0.00013891209,0.0028996873,0.0002135378,0.00070013147,0.0000037741308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021871505,0.00017848496,0.09147698,0.000053104046,0.00001720895,0.00004186856,0.003775932,0.8760978,0.0010666796,0.00019078297,0.000018286088,0.026864136],"study_design_scores_gemma":[0.0014535185,0.0010857128,0.0049881483,0.001785523,0.0000086380305,0.0005273249,0.00019654365,0.9858896,0.0030331677,0.0000066217035,0.00067180913,0.00035336413],"about_ca_topic_score_codex":0.0000026998237,"about_ca_topic_score_gemma":0.000008301859,"teacher_disagreement_score":0.18790004,"about_ca_system_score_codex":0.00020409252,"about_ca_system_score_gemma":0.00014232313,"threshold_uncertainty_score":0.9998331},"labels":[],"label_agreement":null},{"id":"W2071971234","doi":"10.1109/vetecf.2010.5594502","title":"On the Performance of Imperfect Channel Estimation for Vehicular Ad-Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Rayleigh fading; Channel (broadcasting); Bit error rate; Wireless ad hoc network; Transmit diversity; Antenna diversity; Imperfect; Transmission (telecommunications); Vehicular ad hoc network; Fading; Orthogonal frequency-division multiplexing; Space–time block code; Computer network; Telecommunications; Wireless","score_opus":0.02195748200837962,"score_gpt":0.2603753848397753,"score_spread":0.23841790283139566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071971234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32506987,0.00014878559,0.6715503,0.0018980586,0.0002664097,0.0002969063,2.6530773e-7,0.000059188813,0.00071024144],"genre_scores_gemma":[0.9901228,0.00027245368,0.008919645,0.00048365883,0.000026211063,0.000050729945,0.0000019505344,0.0000044953226,0.00011806218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.00003935512,0.00013144064,0.00012528981,0.00008954442,0.00011970903],"domain_scores_gemma":[0.9987969,0.0003881678,0.00006167867,0.00061437313,0.00011393388,0.000024978946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050954527,0.00007202352,0.000078229576,0.000030011668,0.00021914198,0.000047551577,0.0006761981,0.0000365457,0.00002421665],"category_scores_gemma":[0.00006796041,0.00004501786,0.00004483522,0.00019292923,0.000034761473,0.00015110736,0.00012574668,0.00015945228,0.0000074953923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002325663,0.00007086631,0.000044142893,0.000012679598,0.000018826508,1.0770812e-7,0.0005333589,0.042821273,0.0042115273,0.6025103,0.0030109996,0.3467427],"study_design_scores_gemma":[0.00012201694,0.00012520989,0.00040120623,0.000014855031,0.0000017172819,9.5284327e-7,0.0000032867415,0.9935538,0.0041445484,0.00035230658,0.0012187135,0.00006138193],"about_ca_topic_score_codex":3.0109948e-7,"about_ca_topic_score_gemma":0.000009654543,"teacher_disagreement_score":0.9507325,"about_ca_system_score_codex":0.0000067975425,"about_ca_system_score_gemma":0.000018899114,"threshold_uncertainty_score":0.1835775},"labels":[],"label_agreement":null},{"id":"W2072119323","doi":"10.1109/glocom.2011.6134112","title":"Toward a Network Coding Constellation for Two-Way Relay Node Channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Linear network coding; Phase-shift keying; Demodulation; Quadrature amplitude modulation; Relay; Transmitter; Computer science; Constellation diagram; Topology (electrical circuits); Mathematics; QAM; Disjoint sets; Decoding methods; Telecommunications; Bit error rate; Computer network; Discrete mathematics; Physics; Combinatorics","score_opus":0.1387175613243127,"score_gpt":0.2963972212858134,"score_spread":0.1576796599615007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072119323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054626697,0.00021731753,0.92530775,0.0006406541,0.00056617346,0.00029323503,3.8547577e-7,0.00021960256,0.07220863],"genre_scores_gemma":[0.8325851,0.00012283934,0.16569197,0.00090629346,0.00014882324,0.000020384721,0.000003090671,0.000008219831,0.00051328324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990493,0.000086505315,0.00023350652,0.00026355518,0.00009513685,0.00027197375],"domain_scores_gemma":[0.9989855,0.00019530789,0.00008444665,0.00051649107,0.0001427162,0.000075502365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997164,0.00011529438,0.0001403849,0.000051443927,0.00027172695,0.00010571756,0.00065688527,0.00004179916,0.00013381123],"category_scores_gemma":[0.000027671258,0.000104622144,0.00006504016,0.00031928113,0.000034567285,0.00031711746,0.00028317812,0.00009167394,0.00004134811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016083366,0.00003767153,0.00042812462,0.000008493724,0.000026507834,0.0000014336014,0.0030221841,0.0038083673,0.00029872335,0.9223268,0.00851192,0.061513662],"study_design_scores_gemma":[0.0007578274,0.00008043569,0.00021414626,0.000059022128,0.000008128799,0.000010670018,0.000042025855,0.9695071,0.0029854323,0.0045530633,0.021463657,0.0003185055],"about_ca_topic_score_codex":0.000006241621,"about_ca_topic_score_gemma":0.000011509302,"teacher_disagreement_score":0.9656987,"about_ca_system_score_codex":0.000029379973,"about_ca_system_score_gemma":0.000030739237,"threshold_uncertainty_score":0.42663673},"labels":[],"label_agreement":null},{"id":"W2072676840","doi":"10.1109/tmc.2012.62","title":"Resource Allocation with Flexible Channel Cooperation in Cognitive Radio Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cognitive radio; Resource allocation; Benchmark (surveying); Channel allocation schemes; Channel (broadcasting); Relay; Computer network; Heuristic; Resource management (computing); Optimization problem; Distributed computing; Mathematical optimization; Telecommunications; Algorithm; Wireless; Artificial intelligence","score_opus":0.03409540344574342,"score_gpt":0.2798092778000625,"score_spread":0.24571387435431907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072676840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027211003,0.00042584672,0.9703936,0.00018013456,0.00028522738,0.0005001595,7.932974e-7,0.0002443952,0.0007588246],"genre_scores_gemma":[0.9959715,0.00013496121,0.0032004658,0.00030308028,0.000107743996,0.000103129736,0.0000071521904,0.000019303608,0.00015265415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984835,0.00028008842,0.00030266758,0.0003338516,0.0001837183,0.000416176],"domain_scores_gemma":[0.9989061,0.00034729452,0.00009732373,0.00041651327,0.000116110044,0.000116691735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059491955,0.00019797105,0.00018877827,0.0002228389,0.00048498964,0.00013031044,0.00038155145,0.000078063684,0.000018799361],"category_scores_gemma":[0.000005629412,0.00019115636,0.000044664674,0.0011059169,0.000051995194,0.0006161293,0.000010434299,0.0004399121,0.000020471862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031111307,0.00028551754,0.000100556514,0.0000048192924,0.00001997425,0.0000010953579,0.002621807,0.8474497,0.00012819708,0.0009894405,0.000052788608,0.14831495],"study_design_scores_gemma":[0.00079187413,0.00019203272,0.0006231126,0.00022420204,0.000010709702,0.000022349637,0.0002101624,0.99224436,0.004740575,0.0000058856426,0.0006355571,0.00029917748],"about_ca_topic_score_codex":0.000007797296,"about_ca_topic_score_gemma":0.000030916228,"teacher_disagreement_score":0.9687605,"about_ca_system_score_codex":0.00012989804,"about_ca_system_score_gemma":0.000046661542,"threshold_uncertainty_score":0.779513},"labels":[],"label_agreement":null},{"id":"W2072693007","doi":"10.1109/glocomw.2011.6162334","title":"LTE relay backhaul design for sparsely-populated environments","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Control channel; Backhaul (telecommunications); Computer network; Telecommunications link; Network packet; Computer science; Relay; Node (physics); Channel (broadcasting); Engineering; Base station","score_opus":0.2772607715284814,"score_gpt":0.2787594828060571,"score_spread":0.001498711277575726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072693007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009963654,0.00012326166,0.9904353,0.00022311271,0.0001252135,0.00027520076,2.9205287e-7,0.00010150327,0.007719752],"genre_scores_gemma":[0.5099093,0.00024602746,0.48431322,0.00054177025,0.00001558344,0.000044090284,0.0000026879165,0.000009078889,0.0049182675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999237,0.000098693825,0.00016814993,0.00022774795,0.00008330277,0.00018511672],"domain_scores_gemma":[0.9991404,0.00007255894,0.000049422877,0.0006475263,0.000022371763,0.00006772421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002947752,0.0000946478,0.000092349044,0.000041569423,0.0001576633,0.00004002664,0.00081615255,0.00003870036,0.0002109287],"category_scores_gemma":[0.000021239497,0.000082368046,0.000040438947,0.00015004257,0.000023422332,0.00026012378,0.0002412581,0.00006486471,0.00018375277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008962611,0.00064823683,0.0015615191,0.000010126236,0.00014781502,0.000010073662,0.005862166,0.0012213559,0.013350179,0.6493904,0.04246449,0.28524402],"study_design_scores_gemma":[0.0016522215,0.00045331893,0.011561198,0.000038643568,0.000020449654,0.000012506576,0.00003925274,0.7563522,0.038032398,0.007907123,0.18311761,0.00081311166],"about_ca_topic_score_codex":0.000002975688,"about_ca_topic_score_gemma":0.0000045297834,"teacher_disagreement_score":0.7551308,"about_ca_system_score_codex":0.000025606385,"about_ca_system_score_gemma":0.000014290416,"threshold_uncertainty_score":0.33588713},"labels":[],"label_agreement":null},{"id":"W2072987868","doi":"10.1109/lwc.2014.2362744","title":"Ergodic Capacity of Two-Hop Multiple Antenna AF Systems With Co-Channel Interference","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Ergodic theory; Relay; Topology (electrical circuits); Interference (communication); Channel (broadcasting); Computer science; Mathematics; Algorithm; Discrete mathematics; Telecommunications; Combinatorics; Mathematical analysis; Physics","score_opus":0.10311037602521435,"score_gpt":0.29398180028908644,"score_spread":0.1908714242638721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072987868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2441861,0.00063468295,0.7496492,0.0039484366,0.00025874915,0.00036752873,0.00001224041,0.00020602254,0.0007370441],"genre_scores_gemma":[0.98801994,0.00036548026,0.010822897,0.000583357,0.000029737026,0.00010914585,0.000016751856,0.000019628771,0.00003307396],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781847,0.0007285662,0.00049711723,0.00032810494,0.00032636596,0.00030138323],"domain_scores_gemma":[0.9942399,0.00045302912,0.00033724026,0.0042774,0.0005117693,0.00018065293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063969905,0.00023616382,0.00036088692,0.00020898583,0.00031902798,0.00016813575,0.004637221,0.000053544656,0.0000015463035],"category_scores_gemma":[0.000049951967,0.00021270248,0.000064684624,0.00074063125,0.000551234,0.0005592683,0.00064584275,0.00042819246,0.000030468362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003439441,0.003052414,0.034500316,0.0003492563,0.0010334048,0.000038442704,0.07478067,0.06797028,0.5808958,0.18658239,0.025512427,0.024940679],"study_design_scores_gemma":[0.0018739413,0.00014549616,0.00063723343,0.0004929485,0.000021615519,0.000055796638,0.0005854218,0.9896655,0.0041672816,0.000060918977,0.0017236883,0.00057015294],"about_ca_topic_score_codex":0.00025184412,"about_ca_topic_score_gemma":0.0003901562,"teacher_disagreement_score":0.92169523,"about_ca_system_score_codex":0.00013894492,"about_ca_system_score_gemma":0.000121842226,"threshold_uncertainty_score":0.86737555},"labels":[],"label_agreement":null},{"id":"W2072997002","doi":"10.1109/tcomm.2013.052013.120900","title":"Ergodic Capacity Analysis for Interference-Limited AF Multi-Hop Relaying Channels in Nakagami-m Fading","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Nakagami distribution; Ergodic theory; Topology (electrical circuits); Computer science; Interference (communication); Moment-generating function; Channel capacity; Co-channel interference; Mathematics; Telecommunications; Channel (broadcasting); Random variable; Statistics; Combinatorics; Mathematical analysis","score_opus":0.13684191084836556,"score_gpt":0.31659228402133416,"score_spread":0.1797503731729686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072997002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011908467,0.00019135104,0.98256284,0.0036576611,0.00023569675,0.0007410689,0.000015170676,0.0002371973,0.00045053603],"genre_scores_gemma":[0.924752,0.0010697587,0.07241576,0.00032076082,0.000009534324,0.0010752792,0.0000156507,0.000016881262,0.00032439636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998028,0.00046511737,0.0005743107,0.00041897676,0.00015095471,0.00036264877],"domain_scores_gemma":[0.9952267,0.001017061,0.00014958669,0.0031173758,0.00035889805,0.00013038918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047125926,0.00023350242,0.00033839044,0.0009660623,0.0009567926,0.0002958688,0.0028559722,0.000117307194,0.00006900735],"category_scores_gemma":[0.00004585392,0.00024805425,0.0002616386,0.0028478934,0.00014139508,0.00080369134,0.000051750496,0.00063311023,0.00007634697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006744221,0.006150984,0.0026406278,0.00008248032,0.0025496124,0.0000018137813,0.047672644,0.3454095,0.024526363,0.04328506,0.0011274087,0.52648604],"study_design_scores_gemma":[0.00066540216,0.000057852598,0.0015460082,0.000083210834,0.00007087066,0.0000016603366,0.00024604882,0.9939936,0.0020658877,0.0002974993,0.00064712256,0.00032485274],"about_ca_topic_score_codex":0.00021246367,"about_ca_topic_score_gemma":0.0022142646,"teacher_disagreement_score":0.9128435,"about_ca_system_score_codex":0.00021958166,"about_ca_system_score_gemma":0.000059115573,"threshold_uncertainty_score":0.9999972},"labels":[],"label_agreement":null},{"id":"W2073041342","doi":"10.1109/twc.2012.092112.120405","title":"Linear Receiver for the Uplink in Distributed Antenna Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Telecommunications link; Computer science; Signal-to-interference-plus-noise ratio; Robustness (evolution); Interference (communication); Control theory (sociology); Algorithm; Telecommunications; Channel (broadcasting); Physics","score_opus":0.07501034169952846,"score_gpt":0.31123226998036313,"score_spread":0.23622192828083466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073041342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087056577,0.001993845,0.98926955,0.006279627,0.00056771946,0.0006825878,0.000034194618,0.00015252517,0.00014935201],"genre_scores_gemma":[0.9865342,0.0055193687,0.0067226253,0.00022048659,0.000035884208,0.00075151847,0.000017110568,0.000015903288,0.00018295132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986491,0.00032601386,0.0003732155,0.00018466622,0.00013459146,0.00033240335],"domain_scores_gemma":[0.9949756,0.0016231003,0.000102093494,0.0030191639,0.0001909842,0.00008905281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006877645,0.00015743375,0.00018044718,0.00013431223,0.0010374899,0.000108138105,0.0026736653,0.00007926607,0.000007575659],"category_scores_gemma":[0.000016607575,0.0001282343,0.00009757805,0.0008912856,0.00013726305,0.00047013772,0.000032178217,0.00047481756,0.00003827379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011660276,0.004819237,0.0010383697,0.00008268451,0.0004420171,9.853131e-7,0.012040784,0.06860926,0.005049276,0.40014943,0.0030190938,0.50463223],"study_design_scores_gemma":[0.00045967786,0.000030479703,0.00082060596,0.000076307755,0.000019028634,0.0000057433153,0.00017038762,0.97687465,0.0003942028,0.000045426543,0.020894853,0.00020865796],"about_ca_topic_score_codex":0.000035690904,"about_ca_topic_score_gemma":0.00016161699,"teacher_disagreement_score":0.9856636,"about_ca_system_score_codex":0.00012510404,"about_ca_system_score_gemma":0.000055384775,"threshold_uncertainty_score":0.79796374},"labels":[],"label_agreement":null},{"id":"W2073289239","doi":"10.1109/vetecf.2010.5594311","title":"Amplify-and-Forward Multi-Antenna Beamforming with Joint Source-Relay Power Constraint","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Beamforming; Relay; Computer science; Maximization; Mathematical optimization; Antenna (radio); Convex optimization; Optimization problem; Power (physics); Mathematics; Regular polygon; Telecommunications; Physics","score_opus":0.028303892034292406,"score_gpt":0.2536846996012053,"score_spread":0.22538080756691292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073289239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05125281,0.00005888495,0.9410179,0.0013474534,0.00016446644,0.00015946424,5.617906e-7,0.00020947405,0.0057889787],"genre_scores_gemma":[0.8079034,0.000043572993,0.19024019,0.000808683,0.000016456037,0.000010791948,0.0000010879879,0.000008689562,0.0009671139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904513,0.000040818453,0.00021196438,0.00029653852,0.00014799391,0.0002575383],"domain_scores_gemma":[0.99887997,0.00008708317,0.0000716005,0.00068053446,0.00012520715,0.0001556115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036619572,0.00015355909,0.00016421605,0.00007876943,0.0002919377,0.00021652058,0.00052235345,0.00006038669,0.00023407827],"category_scores_gemma":[0.000045948884,0.00010795818,0.000037329377,0.00019082459,0.0001816766,0.00030055124,0.0004669563,0.00042936357,0.000041332634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018389099,0.00027336137,0.0053761755,0.000014393512,0.00011755064,0.00001735919,0.008877931,0.00013463946,0.08245978,0.5340615,0.00071348,0.36793545],"study_design_scores_gemma":[0.0024967054,0.0003360026,0.009451263,0.00012002837,0.000019503208,0.00039098566,0.0010429152,0.84968007,0.0040077264,0.0002316084,0.1310342,0.0011889734],"about_ca_topic_score_codex":0.000012149406,"about_ca_topic_score_gemma":0.00017374502,"teacher_disagreement_score":0.8495454,"about_ca_system_score_codex":0.000012535685,"about_ca_system_score_gemma":0.000053191576,"threshold_uncertainty_score":0.44024068},"labels":[],"label_agreement":null},{"id":"W2073417688","doi":"10.1109/isit.2014.6875244","title":"Subspace synchronization: A network-coding approach to object reconciliation","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Linear subspace; Synchronization (alternating current); Subspace topology; Coding (social sciences); Theoretical computer science; Time complexity; Computational complexity theory; Algorithm; Discrete mathematics; Mathematics; Computer network; Artificial intelligence","score_opus":0.033212734975210316,"score_gpt":0.25393955677939367,"score_spread":0.22072682180418335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073417688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029786042,0.00008530714,0.879214,0.001765056,0.0001901979,0.00017270309,6.735104e-8,0.00026491995,0.1180099],"genre_scores_gemma":[0.81857795,0.000075325544,0.17771651,0.0020203649,0.00020257373,0.000029682777,0.0000045408115,0.000007823035,0.0013652513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885476,0.0002114101,0.00019221591,0.00032861173,0.00016705932,0.0002459442],"domain_scores_gemma":[0.99879545,0.00012914218,0.000057483103,0.0007449248,0.00016593054,0.0001070569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075915904,0.0001137066,0.00013166716,0.00006739403,0.00030399265,0.00023794979,0.0007748823,0.000040735988,0.0000312883],"category_scores_gemma":[0.00013063519,0.00010708289,0.000034676727,0.0009554153,0.000012546866,0.00035457182,0.00033959706,0.000099534795,0.0001178928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021641551,0.000031113457,0.0005680121,0.000006087388,0.000008955654,1.1121009e-7,0.0010051155,0.021985397,0.000101483594,0.7871826,0.0152430935,0.17386585],"study_design_scores_gemma":[0.00015710815,0.000036557823,0.0011568542,0.000019612286,0.0000020740388,0.0000035932146,0.000015569278,0.9597034,0.0001324628,0.0004924187,0.03809241,0.00018796051],"about_ca_topic_score_codex":0.0000035489836,"about_ca_topic_score_gemma":0.000037397196,"teacher_disagreement_score":0.937718,"about_ca_system_score_codex":0.000078858444,"about_ca_system_score_gemma":0.00004032599,"threshold_uncertainty_score":0.43667135},"labels":[],"label_agreement":null},{"id":"W2073533609","doi":"10.1109/vtcfall.2012.6399068","title":"Design of Hierarchical Modulation for Wireless Relay Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Computer science; Transmission (telecommunications); Bit error rate; Quadrature amplitude modulation; Modulation (music); Wireless; QAM; Constellation; Wireless network; Electronic engineering; Phase-shift keying; Computer network; Telecommunications; Channel (broadcasting); Engineering","score_opus":0.07129207759950958,"score_gpt":0.296631829792044,"score_spread":0.22533975219253444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073533609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012330038,0.00016937594,0.99716747,0.00034575086,0.00013789194,0.00020437356,1.230907e-7,0.000054737233,0.00068725395],"genre_scores_gemma":[0.81969523,0.00010538529,0.17985421,0.00011868093,0.000052864092,0.000016716172,0.0000020549537,0.0000035657256,0.00015125476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.00012576187,0.00016824901,0.00009275885,0.00007411526,0.00016126015],"domain_scores_gemma":[0.9990999,0.00036514553,0.000050554692,0.00034843307,0.00008220957,0.00005371987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055158656,0.000054094584,0.00009018076,0.000036043006,0.000097314805,0.000020545396,0.00037879107,0.00003748009,0.000012600653],"category_scores_gemma":[0.0000237873,0.00004737191,0.000029595489,0.00019388706,0.000022372553,0.00029036062,0.00012977548,0.00006456132,0.0000025321617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001558872,0.000063335116,0.0004551611,0.000003161235,0.000009853461,2.757625e-8,0.0004690972,0.0386796,0.0011307289,0.7182545,0.0008862016,0.24003273],"study_design_scores_gemma":[0.00015371214,0.000028453698,0.0014286865,0.000007220374,0.0000015215232,7.930795e-7,0.0000025662875,0.9966066,0.00051564927,0.00036552147,0.00082686875,0.00006242928],"about_ca_topic_score_codex":4.7854576e-7,"about_ca_topic_score_gemma":6.584943e-7,"teacher_disagreement_score":0.957927,"about_ca_system_score_codex":0.000015295616,"about_ca_system_score_gemma":0.000014941958,"threshold_uncertainty_score":0.19317704},"labels":[],"label_agreement":null},{"id":"W2073637991","doi":"10.1109/twc.2012.020812.111246","title":"Relay Precoding for Non-Regenerative MIMO Relay Systems with Partial CSI in the Presence of Interferers","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Precoding; MIMO; Relay channel; Computer science; Channel state information; Covariance; Transmitter power output; Channel (broadcasting); Topology (electrical circuits); Control theory (sociology); Computer network; Telecommunications; Mathematics; Wireless; Power (physics); Statistics; Physics","score_opus":0.06563706181708814,"score_gpt":0.304412195280602,"score_spread":0.23877513346351384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073637991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023578083,0.0005219564,0.97191,0.0020052686,0.00029234047,0.0009907805,0.000015056929,0.00005667393,0.00062986824],"genre_scores_gemma":[0.98293436,0.00083469984,0.014860687,0.000089646244,0.000024396268,0.0011090674,0.000005836612,0.00001593881,0.0001253575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805856,0.000734805,0.00046036305,0.00022459272,0.00021425949,0.00030742024],"domain_scores_gemma":[0.9952325,0.001669152,0.00020172444,0.0026104688,0.00021398989,0.00007216669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007941068,0.00018353439,0.0002496966,0.00017882447,0.0006442562,0.00010621507,0.0026729393,0.00007503534,0.0000036749843],"category_scores_gemma":[0.00001729671,0.00013789648,0.00008887582,0.0008039436,0.00021934969,0.0006638541,0.000030340108,0.00047418827,0.000005726798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042502576,0.0063436925,0.0019065166,0.00024207447,0.00064632774,0.0000016188759,0.16729578,0.33271587,0.019149007,0.34868926,0.0018752255,0.12070958],"study_design_scores_gemma":[0.0011948774,0.0003691065,0.00055961683,0.00061520387,0.00005873871,0.000020486912,0.002348216,0.9714435,0.018455056,0.000025572015,0.004455784,0.00045383966],"about_ca_topic_score_codex":0.000042361175,"about_ca_topic_score_gemma":0.00040541554,"teacher_disagreement_score":0.9593563,"about_ca_system_score_codex":0.00008591673,"about_ca_system_score_gemma":0.000086856846,"threshold_uncertainty_score":0.56232554},"labels":[],"label_agreement":null},{"id":"W2073678698","doi":"10.1109/twc.2014.2362135","title":"Robust Resource Optimization for Cooperative Cognitive Radio Networks with Imperfect CSI","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Goodput; Cognitive radio; Computer science; Resource allocation; Relay; Probabilistic logic; Mathematical optimization; Optimization problem; Channel (broadcasting); Channel state information; Interference (communication); Selection (genetic algorithm); Resource management (computing); Convex optimization; Computer network; Throughput; Power (physics); Telecommunications; Algorithm; Wireless; Regular polygon; Mathematics; Artificial intelligence","score_opus":0.03900808095099768,"score_gpt":0.26374473865351816,"score_spread":0.2247366577025205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073678698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044705963,0.00022157923,0.9936392,0.002491775,0.00011691194,0.0009413263,0.000018558609,0.00037819066,0.0017454202],"genre_scores_gemma":[0.9067178,0.0012693824,0.09001871,0.00071692205,0.000040495004,0.00082542567,0.00006554357,0.00004524279,0.00030052368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977508,0.000786417,0.00039678448,0.0004947168,0.0002096589,0.00036158547],"domain_scores_gemma":[0.9944819,0.002092497,0.0001836051,0.0024510534,0.0006349545,0.0001559767],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005502359,0.000309265,0.00032553004,0.0002154967,0.0020308357,0.00029521002,0.0020219139,0.00012569186,0.000029064067],"category_scores_gemma":[0.000029274008,0.00028856721,0.00012598463,0.0010582473,0.00030430424,0.0005403458,0.000032712574,0.00057040656,0.00001176921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006329939,0.0002923971,0.0000060438124,0.0000062209815,0.000089832065,1.851025e-7,0.00072114274,0.9009705,0.000050914576,0.012545853,0.00024991485,0.0850037],"study_design_scores_gemma":[0.0012741275,0.00039246064,0.0000257977,0.00016522958,0.000054519536,0.000010560446,0.00012257212,0.99355584,0.0009066359,0.000018027054,0.0030993498,0.00037485902],"about_ca_topic_score_codex":0.000007841277,"about_ca_topic_score_gemma":0.00021517016,"teacher_disagreement_score":0.9062707,"about_ca_system_score_codex":0.000115748604,"about_ca_system_score_gemma":0.00010784993,"threshold_uncertainty_score":0.99995667},"labels":[],"label_agreement":null},{"id":"W2073880248","doi":"10.1109/wcl.2012.100912.120637","title":"Improved Throughput Physical-Layer Network Coding in Multi-Way Relay Channels with Binary Signaling","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Linear network coding; Computer science; Binary number; Computer network; Throughput; Node (physics); Coding (social sciences); Relay channel; Channel (broadcasting); Physical layer; Routing (electronic design automation); Algorithm; Topology (electrical circuits); Wireless; Mathematics; Telecommunications; Arithmetic; Network packet; Engineering","score_opus":0.07665106158219796,"score_gpt":0.3053915965003876,"score_spread":0.22874053491818963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073880248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46478036,0.0011815382,0.5239935,0.008530866,0.00041273312,0.0005437859,0.0000017187037,0.00031044663,0.00024506607],"genre_scores_gemma":[0.9311832,0.0006175865,0.065504394,0.0021884686,0.0001883288,0.00022278736,0.0000140272205,0.000039697115,0.000041481693],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974064,0.00074578787,0.0004485988,0.00039936282,0.00023214484,0.000767676],"domain_scores_gemma":[0.9953591,0.0006393741,0.00025437004,0.003466894,0.0001196513,0.00016055841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008056838,0.0003267002,0.00038056177,0.00018088253,0.0007942027,0.00020862347,0.0034024243,0.000079861224,0.000004650907],"category_scores_gemma":[0.00001975719,0.00030414804,0.00009821966,0.0014519364,0.00024908924,0.0013056151,0.0010253565,0.00079343584,0.000035541038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000733786,0.0024087252,0.020749023,0.0000730298,0.0003247827,0.000016020978,0.04147074,0.13201188,0.6915166,0.06458351,0.0034007984,0.043371513],"study_design_scores_gemma":[0.0010873487,0.000053878615,0.0030453436,0.0003443298,0.000020331436,0.000013569204,0.00013900577,0.98633343,0.0060159587,0.00002256495,0.0022226188,0.00070163194],"about_ca_topic_score_codex":0.000039788654,"about_ca_topic_score_gemma":0.00008348015,"teacher_disagreement_score":0.85432154,"about_ca_system_score_codex":0.00018613879,"about_ca_system_score_gemma":0.00004814326,"threshold_uncertainty_score":0.99994105},"labels":[],"label_agreement":null},{"id":"W2073907179","doi":"10.1109/cwit.2013.6621607","title":"Differential dual-hop relaying over time-varying Rayleigh-fading channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rayleigh fading; Fading; Hop (telecommunications); Fading distribution; Dual (grammatical number); Computer science; Computer network; Channel (broadcasting); Topology (electrical circuits); Telecommunications; Electrical engineering; Engineering","score_opus":0.029095641838655588,"score_gpt":0.2585195663618252,"score_spread":0.22942392452316962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073907179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2619676,0.0002470266,0.68862885,0.0028070277,0.00097134133,0.00047607828,3.6382323e-7,0.0008019134,0.04409978],"genre_scores_gemma":[0.9843634,0.00011270161,0.009224242,0.00072603364,0.00016278104,0.000037807535,0.000003423738,0.00001465913,0.0053550014],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865013,0.0001358391,0.0002730273,0.0003576214,0.00022203269,0.00036134722],"domain_scores_gemma":[0.998744,0.00018402193,0.000078512785,0.00075630384,0.00010955964,0.00012760838],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015792315,0.00017675057,0.00018706046,0.00012563645,0.00043513806,0.00058219203,0.0008118776,0.00006132201,0.003549088],"category_scores_gemma":[0.00003782356,0.0001532548,0.0000787878,0.00040318223,0.000031509164,0.0010568178,0.0009954602,0.00021694458,0.0012644148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011868584,0.00033520118,0.0017087995,0.00003485322,0.0002012234,0.00001624819,0.008154269,0.0018300579,0.41257292,0.19255142,0.07333925,0.3092439],"study_design_scores_gemma":[0.0005864093,0.00003843216,0.0013515069,0.00007227715,0.0000060262637,0.000009859228,0.000015404326,0.9817098,0.011549789,0.00095926656,0.003231473,0.0004697762],"about_ca_topic_score_codex":0.00001614985,"about_ca_topic_score_gemma":0.0000015549334,"teacher_disagreement_score":0.97987974,"about_ca_system_score_codex":0.000049808776,"about_ca_system_score_gemma":0.00002288486,"threshold_uncertainty_score":0.9995132},"labels":[],"label_agreement":null},{"id":"W2073996443","doi":"10.1007/s11277-013-1416-1","title":"Optimal Timing at the Relay in OFDM Based Two Way Relay Systems","year":2013,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Relay; Orthogonal frequency-division multiplexing; Fast Fourier transform; Interference (communication); Relay channel; Cyclic prefix; Noise (video); Power (physics); Telecommunications; Real-time computing; Electronic engineering; Algorithm; Channel (broadcasting)","score_opus":0.06674639525651543,"score_gpt":0.30227212056377345,"score_spread":0.23552572530725802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073996443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7259399,0.016987542,0.1178139,0.105990365,0.0005998118,0.002549644,0.0000201116,0.00070075004,0.029397964],"genre_scores_gemma":[0.9856319,0.00068082416,0.010910243,0.00073636585,0.000029831872,0.00048160486,0.000032447482,0.000019955867,0.0014768154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754536,0.000989292,0.00045142,0.00033730574,0.00031516887,0.00036143902],"domain_scores_gemma":[0.9949203,0.0011242452,0.00017463752,0.003423083,0.0002491489,0.00010855985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086418586,0.00020607687,0.00022661082,0.00014066782,0.001289481,0.000361605,0.0043078596,0.00007357694,0.000122316],"category_scores_gemma":[0.0000618496,0.0001652037,0.0001005602,0.0008296094,0.00029681166,0.0004961414,0.0019788498,0.0006631171,0.00037902602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051686307,0.0016308151,0.01780826,0.00010048156,0.00024793114,0.000016505468,0.046922304,0.14826196,0.01647171,0.55833334,0.03684871,0.17330629],"study_design_scores_gemma":[0.00042027823,0.000017980965,0.0046282,0.00010827955,0.0000055691407,0.000012704795,0.00034832407,0.978562,0.000070609545,0.000016786164,0.015586219,0.00022307814],"about_ca_topic_score_codex":0.0004230947,"about_ca_topic_score_gemma":0.00080017647,"teacher_disagreement_score":0.83030003,"about_ca_system_score_codex":0.00029643468,"about_ca_system_score_gemma":0.00012172326,"threshold_uncertainty_score":0.9917775},"labels":[],"label_agreement":null},{"id":"W2074004700","doi":"10.1109/acssc.2008.5074365","title":"Threshold based distributed detection that achieves full diversity in wireless sensor networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Medical Research Council; National Science Foundation","keywords":"Computer science; Relay; Decoding methods; Demodulation; Cooperative diversity; Computer network; Wireless sensor network; Encoding (memory); Time diversity; Diversity gain; Wireless; Linear network coding; Multiplexing; Diversity combining; Wireless network; Fading; Telecommunications; Channel (broadcasting); Network packet; Power (physics)","score_opus":0.06199323949706517,"score_gpt":0.24679971357444697,"score_spread":0.1848064740773818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074004700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28956598,0.00004299399,0.7091036,0.00045397028,0.000099893776,0.00009401102,7.8501836e-7,0.00014973564,0.00048904296],"genre_scores_gemma":[0.99741244,0.00022299086,0.0018828263,0.00035253484,0.00002233759,0.000005858016,0.000008411243,0.0000040179207,0.00008857593],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990956,0.00013211586,0.00013402087,0.0002585327,0.0001609555,0.0002187664],"domain_scores_gemma":[0.9991897,0.00010983654,0.000049336286,0.0005219606,0.000060744016,0.00006842404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002005268,0.00011618521,0.00013097336,0.00008074318,0.000588502,0.0000524527,0.000677456,0.000063426625,0.000026334497],"category_scores_gemma":[0.000010354533,0.00010786694,0.00004942271,0.00059497886,0.000056580568,0.0003205034,0.00075847877,0.00022374149,0.000013380079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033607718,0.0011345744,0.7139543,0.000025163405,0.00008217105,0.00024111963,0.0026054361,0.09462891,0.007586758,0.031155571,0.0043147006,0.14393519],"study_design_scores_gemma":[0.0003927952,0.000031321804,0.086663,0.00001088666,0.000001433134,0.00000812765,0.000015283664,0.91115373,0.0013010195,0.000022048791,0.00025103177,0.00014931399],"about_ca_topic_score_codex":0.000025622277,"about_ca_topic_score_gemma":0.00063355727,"teacher_disagreement_score":0.81652486,"about_ca_system_score_codex":0.00007590162,"about_ca_system_score_gemma":0.000022437802,"threshold_uncertainty_score":0.4526341},"labels":[],"label_agreement":null},{"id":"W2074141110","doi":"10.1109/tvt.2012.2183400","title":"Throughput and Energy Optimization in Wireless Networks: Joint MAC Scheduling and Network Coding","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Linear network coding; Computer science; Wireless network; Maximum throughput scheduling; Scheduling (production processes); Computer network; Multicast; Wireless; Distributed computing; Wireless WAN; Radio resource management; Dynamic priority scheduling; Wi-Fi array; Mathematical optimization; Round-robin scheduling; Quality of service; Telecommunications; Mathematics","score_opus":0.019727256650377566,"score_gpt":0.23902423697962685,"score_spread":0.2192969803292493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074141110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017112175,0.002730443,0.97820634,0.0012771172,0.00027090384,0.00009083109,3.106196e-7,0.00023820362,0.000073654344],"genre_scores_gemma":[0.9481929,0.00795433,0.043449037,0.0002816584,0.00003936907,0.00005028646,0.0000010395424,0.0000137566285,0.00001761017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988483,0.00012309568,0.00025405615,0.00030417662,0.00008911781,0.0003812112],"domain_scores_gemma":[0.9993023,0.00007586919,0.000070574315,0.00043117107,0.000048151906,0.00007188801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031123252,0.00016631607,0.00022390444,0.00028656653,0.00033978824,0.000065464395,0.00026353716,0.00021404724,0.0000062434665],"category_scores_gemma":[0.0000052987334,0.00017295661,0.00003003249,0.00096163864,0.000121997065,0.00037878138,0.00002763875,0.00038893826,0.0000013705986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055570044,0.00008148727,0.00035470483,0.0000061076867,0.00002580792,0.0000035894059,0.00015527781,0.7446933,0.0005462171,0.07186035,0.000010975166,0.18225664],"study_design_scores_gemma":[0.00032355796,0.00004202957,0.00012453443,0.00008941681,0.000008973689,0.00004544502,0.000038878505,0.9967233,0.0017726878,0.0002566897,0.000381579,0.00019289838],"about_ca_topic_score_codex":0.0000071635313,"about_ca_topic_score_gemma":0.000047349866,"teacher_disagreement_score":0.93475735,"about_ca_system_score_codex":0.000056358855,"about_ca_system_score_gemma":0.000015589878,"threshold_uncertainty_score":0.7052966},"labels":[],"label_agreement":null},{"id":"W2074311317","doi":"10.1109/iccnc.2013.6504072","title":"Dual-hop AF systems with maximum end-to-end SNR relay selection over nakagami-m and rician fading links","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Relay; Nakagami distribution; Fading; Cumulative distribution function; Probability density function; Computer science; Maximal-ratio combining; Signal-to-noise ratio (imaging); Selection (genetic algorithm); Relay channel; Mathematics; Topology (electrical circuits); Algorithm; Telecommunications; Statistics; Channel (broadcasting); Physics","score_opus":0.05106065220654933,"score_gpt":0.2888453482463421,"score_spread":0.2377846960397928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074311317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22546792,0.0061320188,0.62234914,0.048058562,0.0029699667,0.002634466,0.000015423699,0.001344433,0.09102804],"genre_scores_gemma":[0.98029256,0.0029972026,0.014659331,0.0008831209,0.0002653,0.00009419889,0.000032707798,0.000027362603,0.0007482186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975805,0.00043757836,0.00053089927,0.00061879493,0.00041922176,0.00041298982],"domain_scores_gemma":[0.9969368,0.0005043551,0.00035755392,0.0013105378,0.0006637881,0.00022697377],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00063486444,0.0003410933,0.00031471997,0.0003494694,0.001085765,0.0014689567,0.0017774488,0.00016254256,0.00007252452],"category_scores_gemma":[0.000036555946,0.00031836206,0.000047978298,0.0006157491,0.00019044834,0.00051412755,0.0015966889,0.00090800953,0.0000686564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034426776,0.0002652532,0.008078121,0.000025227775,0.00028594167,0.000004004126,0.004251829,0.011431129,0.0006094084,0.55928427,0.007993759,0.40773666],"study_design_scores_gemma":[0.00043699355,0.00016484864,0.007753059,0.00053523335,0.000013288733,0.00005934439,0.00018513713,0.9448683,0.0000105356385,0.00071448873,0.04484065,0.00041808526],"about_ca_topic_score_codex":0.00035217276,"about_ca_topic_score_gemma":0.00027676727,"teacher_disagreement_score":0.9334372,"about_ca_system_score_codex":0.00013757624,"about_ca_system_score_gemma":0.000088984816,"threshold_uncertainty_score":0.99992687},"labels":[],"label_agreement":null},{"id":"W2074921011","doi":"10.1109/wcnc.2013.6555137","title":"Distributed subcarrier pairing and relay selection for OFDM based cooperative relay networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Relay; Overhead (engineering); Subcarrier; Scalability; Selection algorithm; Throughput; Selection (genetic algorithm); Pairing; Orthogonal frequency-division multiplexing; Distributed computing; Reduction (mathematics); Computer network; Power (physics); Telecommunications; Mathematics; Wireless","score_opus":0.020746169304155414,"score_gpt":0.24779465401418146,"score_spread":0.22704848471002606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074921011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013110974,0.00018490475,0.9828697,0.0025678556,0.00010860334,0.00051625917,0.0000014641912,0.00021358086,0.0004266584],"genre_scores_gemma":[0.95978135,0.00008566433,0.038338967,0.0008827817,0.00004864236,0.00018926339,0.000023717257,0.000010359845,0.0006392782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989702,0.00015062968,0.00021803875,0.0003201642,0.00008954027,0.00025141862],"domain_scores_gemma":[0.9987401,0.00035251552,0.00006246745,0.00034496796,0.00039092446,0.00010904297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003195707,0.00014198976,0.00014812443,0.000053688414,0.0004699016,0.0003129623,0.00033159112,0.000072908995,0.00008042345],"category_scores_gemma":[0.0001003832,0.00012052055,0.00004105449,0.00047674237,0.000045278364,0.00054502126,0.00016648558,0.00016968894,0.0000102153435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082926024,0.00030206592,0.028425653,0.00004945971,0.00020470344,0.0000019056583,0.0015766397,0.19485392,0.007984193,0.38785243,0.12887068,0.24979542],"study_design_scores_gemma":[0.00044503622,0.000092311864,0.0035697515,0.00001812697,0.000004255121,0.0000023855869,0.000018318768,0.98815674,0.0009266163,0.00005809587,0.0065360116,0.00017232922],"about_ca_topic_score_codex":0.0000151595095,"about_ca_topic_score_gemma":0.00007263502,"teacher_disagreement_score":0.94667035,"about_ca_system_score_codex":0.00005376911,"about_ca_system_score_gemma":0.000045307515,"threshold_uncertainty_score":0.49146855},"labels":[],"label_agreement":null},{"id":"W2075147842","doi":"10.1109/tsp.2011.2162956","title":"Optimal Power Allocation for Secure Multicarrier Relay Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Subcarrier; Computer science; Maximization; Transmission (telecommunications); Transmitter power output; Power (physics); Signal-to-noise ratio (imaging); Mathematical optimization; Communications system; Secure transmission; Orthogonal frequency-division multiplexing; Computer network; Mathematics; Telecommunications; Transmitter","score_opus":0.05766540760355063,"score_gpt":0.28078414581734484,"score_spread":0.22311873821379422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075147842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020167842,0.00032377336,0.9958624,0.00015057466,0.00027284393,0.00032552695,0.000002997116,0.00020023427,0.00084482005],"genre_scores_gemma":[0.9463045,0.000026051539,0.053043064,0.0001437791,0.00002624681,0.00014051356,0.0000010685753,0.000016782771,0.00029801912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989448,0.00008038748,0.00026111555,0.0003169263,0.00017413926,0.00022259439],"domain_scores_gemma":[0.99908894,0.000086574066,0.000092642265,0.00033751375,0.00030349835,0.00009081822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028329334,0.000149758,0.00013681676,0.000117748605,0.0005633547,0.00017795058,0.0005015889,0.00008121649,0.000039594466],"category_scores_gemma":[0.0000038100447,0.0001411391,0.00007401773,0.0003379047,0.000046536596,0.0006442652,0.0000037079976,0.00021575885,0.00001998771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003113933,0.0011062657,0.0000158163,0.00021163997,0.00019254754,0.000008372074,0.038045328,0.23123911,0.021721572,0.016140822,0.0006222847,0.69038486],"study_design_scores_gemma":[0.00045953772,0.00018173567,0.000021277834,0.00014511518,0.000021025053,0.000012679961,0.00024307107,0.9776961,0.019001007,0.000052657502,0.0018988354,0.0002669525],"about_ca_topic_score_codex":0.0000025337959,"about_ca_topic_score_gemma":0.0000033001488,"teacher_disagreement_score":0.9442877,"about_ca_system_score_codex":0.000057139976,"about_ca_system_score_gemma":0.00009658977,"threshold_uncertainty_score":0.5755486},"labels":[],"label_agreement":null},{"id":"W2075177459","doi":"10.1109/wcl.2013.061213.130313","title":"Outage Probability of Decode-and-Forward Relaying with Optimum Combining in the Presence of Co-Channel Interference and Nakagami Fading","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Fading; Co-channel interference; Interference (communication); Maximal-ratio combining; Diversity gain; Relay; Node (physics); Topology (electrical circuits); Outage probability; Computer science; Channel (broadcasting); Diversity combining; Signal-to-noise ratio (imaging); Telecommunications; Computer network; Mathematics; Physics; Power (physics); Combinatorics; Acoustics","score_opus":0.04865655103986991,"score_gpt":0.2802560984705362,"score_spread":0.23159954743066627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075177459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84609056,0.00036996338,0.1458937,0.0067772013,0.000021615226,0.00048859505,0.000001657374,0.000029270623,0.00032745005],"genre_scores_gemma":[0.9811883,0.0006375765,0.017590245,0.0004450089,0.0000026995974,0.00012323316,0.0000022883669,0.0000071503955,0.0000035009516],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983916,0.0005946836,0.00042952335,0.00023731588,0.00016517704,0.00018168699],"domain_scores_gemma":[0.9963167,0.0012267391,0.00024905748,0.0020246864,0.00014039277,0.000042435375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079955894,0.00013951016,0.00024793617,0.00012820493,0.00024641314,0.000110490575,0.0024135897,0.000037499958,0.000001508224],"category_scores_gemma":[0.000060355647,0.00010717634,0.000027162594,0.00045407063,0.00062919327,0.0005640244,0.0006777542,0.0003610685,0.0000010335841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010980978,0.0014944962,0.1724882,0.0007343367,0.0003322338,0.000007093396,0.27994663,0.019721542,0.16644876,0.19229166,0.0009876336,0.1654376],"study_design_scores_gemma":[0.0011806116,0.00020652436,0.048246685,0.0012041163,0.00002259032,0.000034415923,0.002939423,0.9412243,0.0029971756,0.0013136183,0.000105553634,0.00052502356],"about_ca_topic_score_codex":0.00011171036,"about_ca_topic_score_gemma":0.00012240726,"teacher_disagreement_score":0.9215027,"about_ca_system_score_codex":0.00002707223,"about_ca_system_score_gemma":0.000030598778,"threshold_uncertainty_score":0.44850907},"labels":[],"label_agreement":null},{"id":"W2075382195","doi":"10.1109/pimrc.2012.6362798","title":"Optimal resource allocation in distributed broadband wireless communication systems","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Network packet; Quality of service; Telecommunications link; Wireless; Distributed antenna system; Base station; Transmitter power output; Communications system; Resource allocation; Broadband; Wireless network; Distributed computing; Telecommunications","score_opus":0.045582996360185715,"score_gpt":0.2841100870820005,"score_spread":0.23852709072181477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075382195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03385271,0.009327101,0.94539005,0.0024446822,0.00038987075,0.00089335046,0.00001160069,0.0004093905,0.007281265],"genre_scores_gemma":[0.9876927,0.0019589043,0.009099843,0.00010260547,0.000064253996,0.00018973272,0.0005031774,0.000016509754,0.00037228593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746895,0.0008718904,0.0006002038,0.00045190376,0.00027776777,0.00032928513],"domain_scores_gemma":[0.9962338,0.00022678383,0.0003079656,0.0029013942,0.00021718978,0.00011286497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011682238,0.00027129625,0.00035729606,0.00018681212,0.00019160027,0.0005195585,0.0030400376,0.00027263508,0.00001553507],"category_scores_gemma":[0.000040289317,0.00027355624,0.00006809058,0.00050591154,0.000064177926,0.00037817453,0.0040051406,0.0008587397,0.000033360066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034125715,0.00074595894,0.004176084,0.00022832258,0.0001234157,0.000004111165,0.007912509,0.24949676,0.00044545156,0.6495703,0.011959188,0.075303786],"study_design_scores_gemma":[0.00035660967,0.000010418129,0.005462403,0.00045718806,0.000009436247,0.000006274586,0.00013393979,0.96893454,0.00012954953,0.000118926524,0.023906995,0.00047372538],"about_ca_topic_score_codex":0.00011614163,"about_ca_topic_score_gemma":0.00009690406,"teacher_disagreement_score":0.95383996,"about_ca_system_score_codex":0.00030138768,"about_ca_system_score_gemma":0.00011984529,"threshold_uncertainty_score":0.9999717},"labels":[],"label_agreement":null},{"id":"W2075517750","doi":"10.1109/ita.2010.5454073","title":"Universal relaying for the interference channel","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Relay channel; Computer science; Interference (communication); Channel (broadcasting); Quantization (signal processing); Decoding methods; Code word; Gaussian; Computer network; Algorithm","score_opus":0.05235168561177095,"score_gpt":0.28289544049601856,"score_spread":0.2305437548842476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075517750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089549465,0.000048434136,0.9817869,0.006969493,0.0004284209,0.000104390296,1.5900247e-7,0.00008011061,0.009686602],"genre_scores_gemma":[0.9826607,0.00006897929,0.015293669,0.00057234295,0.000042037635,0.000012696247,2.9050105e-7,0.0000022267773,0.0013470744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969065,0.00001563058,0.00005882052,0.000103766804,0.000038600152,0.00009250263],"domain_scores_gemma":[0.9990985,0.0003082431,0.000020076155,0.00047483534,0.000074426156,0.000023944647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020620512,0.000042193005,0.000035456233,0.000019557674,0.00026921977,0.00009551566,0.0010863346,0.000017693295,0.00003176684],"category_scores_gemma":[0.0000478876,0.000026617152,0.000025100115,0.00012580368,0.00003036789,0.0001763967,0.00031911614,0.00013964172,0.000014983536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015724065,0.000006979551,0.000018730916,6.0192554e-7,0.0000044244307,1.1404586e-7,0.0005837194,0.000019429313,0.001974122,0.9051536,0.002198717,0.09003799],"study_design_scores_gemma":[0.00019624578,0.00003112938,0.0004313783,0.0000063682733,0.0000023184632,0.0000039963284,0.00011247966,0.907326,0.0016236937,0.0021460152,0.08801433,0.00010606544],"about_ca_topic_score_codex":0.0000028686209,"about_ca_topic_score_gemma":0.000102631886,"teacher_disagreement_score":0.9817652,"about_ca_system_score_codex":0.0000055286696,"about_ca_system_score_gemma":0.000021290562,"threshold_uncertainty_score":0.20706479},"labels":[],"label_agreement":null},{"id":"W2075698132","doi":"10.1109/twc.2013.052813.120596","title":"On Transmission of Multiresolution Gaussian Sources over Noisy Relay Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Gaussian; Relay; Decoding methods; Algorithm; Linear network coding; Coding (social sciences); Node (physics); Mathematical optimization; Topology (electrical circuits); Power (physics); Mathematics; Statistics; Computer network; Physics","score_opus":0.028691613523181583,"score_gpt":0.2720230164558587,"score_spread":0.2433314029326771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075698132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014902741,0.00045424636,0.97909963,0.0030821075,0.00017625118,0.0004920111,0.000005114201,0.00024964265,0.0015382742],"genre_scores_gemma":[0.98138577,0.0037631816,0.013870719,0.0003638592,0.000013458229,0.0002207657,0.000009146379,0.00002525803,0.00034785632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979588,0.0005345873,0.0005536512,0.0003501286,0.0003011553,0.00030172252],"domain_scores_gemma":[0.99531853,0.0007633633,0.00020803497,0.0033327225,0.00021504976,0.00016232302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026633136,0.0002507497,0.00027541257,0.0002917319,0.0009672061,0.00012198068,0.002524933,0.00015647007,0.0001656343],"category_scores_gemma":[0.000007037086,0.00023628205,0.00019024737,0.00089848693,0.00024058191,0.0005449339,0.00003103071,0.0006998168,0.000084477506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034469376,0.0016314859,0.00003989162,0.00001888924,0.00010301785,5.416608e-7,0.0023470086,0.18234625,0.0073719504,0.056598045,0.0010350003,0.74847347],"study_design_scores_gemma":[0.0005842823,0.00015295185,0.0012792691,0.00022221988,0.000017825409,0.0000029586408,0.000045270175,0.9906044,0.004365526,0.000264619,0.0021717136,0.0002889618],"about_ca_topic_score_codex":0.000103505496,"about_ca_topic_score_gemma":0.00010642073,"teacher_disagreement_score":0.966483,"about_ca_system_score_codex":0.00009740382,"about_ca_system_score_gemma":0.000060735783,"threshold_uncertainty_score":0.96353024},"labels":[],"label_agreement":null},{"id":"W2075829594","doi":"10.1109/tmc.2013.56","title":"Uplink Scheduling in Wireless Networks with Successive Interference Cancellation","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Telecommunications link; Scheduling (production processes); Single antenna interference cancellation; Computational complexity theory; Wireless; Distributed computing; Computer network; Job shop scheduling; Fair-share scheduling; Wireless network; Mathematical optimization; Algorithm; Quality of service; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.01743833570027899,"score_gpt":0.25568265323445905,"score_spread":0.23824431753418004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075829594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19303563,0.00008947726,0.80578727,0.00014395072,0.00025483742,0.00036891195,1.7832602e-7,0.000144086,0.00017563973],"genre_scores_gemma":[0.98518676,0.00013108463,0.014320143,0.00016049446,0.000037697468,0.000102389065,0.0000011475039,0.000014649239,0.000045610668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865776,0.00014010475,0.00033120342,0.00041256333,0.00013884415,0.00031952467],"domain_scores_gemma":[0.99878454,0.00032649326,0.00010608908,0.0005137093,0.00018627346,0.000082899205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019698743,0.00019050496,0.00019981868,0.00018196338,0.00034123994,0.00025031634,0.0006690494,0.0000684309,0.000039739713],"category_scores_gemma":[0.000002695276,0.00017596224,0.00004281933,0.0008533358,0.00005280002,0.000491363,0.000015119932,0.00053776935,0.000029108432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004172713,0.00004604317,0.0001393011,0.0000039462448,0.000007037668,0.0000013663557,0.00043441696,0.74227035,0.00027963961,0.0002401693,0.00000394402,0.25656962],"study_design_scores_gemma":[0.00034360753,0.00010164746,0.00042183194,0.00026938674,0.0000028272573,0.000005777379,0.00007726939,0.9967272,0.0018099993,0.00001843208,0.000009569947,0.00021243573],"about_ca_topic_score_codex":0.00008361191,"about_ca_topic_score_gemma":0.00027433378,"teacher_disagreement_score":0.79215115,"about_ca_system_score_codex":0.000131701,"about_ca_system_score_gemma":0.000062261926,"threshold_uncertainty_score":0.7175532},"labels":[],"label_agreement":null},{"id":"W2075844578","doi":"10.1109/isit.2007.4557290","title":"Capacity of a Class of Modulo-Sum Relay Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Modulo; Relay channel; Channel capacity; Class (philosophy); Channel (broadcasting); Conjecture; Noise (video); Topology (electrical circuits); Mathematics; Computer science; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Combinatorics; Telecommunications; Mathematical analysis; Physics; Artificial intelligence","score_opus":0.06115591436290355,"score_gpt":0.283983613975954,"score_spread":0.22282769961305046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075844578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14457883,0.000115344614,0.8297789,0.0005675176,0.00014156608,0.00007065908,3.6431595e-7,0.000042099942,0.024704732],"genre_scores_gemma":[0.97030455,0.00006577566,0.028999116,0.00013248654,0.000014423455,0.0000010825189,2.966898e-7,0.000002241744,0.00048003026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993533,0.000047759193,0.0002360684,0.000113748705,0.00013022711,0.00011893486],"domain_scores_gemma":[0.99902177,0.000116782096,0.00008882236,0.0005593641,0.00017188305,0.00004140679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006064652,0.00005464498,0.00011920322,0.00007179668,0.00003972453,0.000009606405,0.0006271751,0.000031798376,0.000030918145],"category_scores_gemma":[0.00003882422,0.00004692852,0.000041836116,0.0003833739,0.00005552132,0.00013830262,0.00024545196,0.000077596094,0.000005635036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007698402,0.0001342328,0.0010842022,0.000015286716,0.000020100093,8.699703e-7,0.0022669814,0.00044587962,0.03713636,0.8935967,0.0009191342,0.064372554],"study_design_scores_gemma":[0.000847371,0.00025950096,0.018688615,0.000113274924,0.000007084802,0.000009734276,0.00012614409,0.4347868,0.52168727,0.0033821715,0.01970252,0.00038952267],"about_ca_topic_score_codex":0.000012493073,"about_ca_topic_score_gemma":0.00004997434,"teacher_disagreement_score":0.8902145,"about_ca_system_score_codex":0.00001433229,"about_ca_system_score_gemma":0.000018238052,"threshold_uncertainty_score":0.19136894},"labels":[],"label_agreement":null},{"id":"W2076175929","doi":"10.1109/wcnc.2010.5506120","title":"Adaptive Multiple Relay Selection Scheme for Cooperative Wireless Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Moment-generating function; Relay; Independent and identically distributed random variables; Rayleigh fading; Fading; Probability density function; Cumulative distribution function; Maximal-ratio combining; Upper and lower bounds; Topology (electrical circuits); Computer science; Wireless; Signal-to-noise ratio (imaging); Algorithm; Wireless network; Ergodic theory; Random variable; Mathematics; Cooperative diversity; Statistics; Telecommunications; Combinatorics; Decoding methods","score_opus":0.03168248471921244,"score_gpt":0.2728310737852176,"score_spread":0.24114858906600514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076175929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01429892,0.000041827858,0.98186815,0.00069238356,0.000438682,0.0004213752,8.358725e-7,0.0002599163,0.0019779403],"genre_scores_gemma":[0.8360112,0.000052720272,0.16209197,0.00043712856,0.00013712596,0.00012113342,0.000005543129,0.000010286631,0.0011328956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903727,0.0000789715,0.00019391571,0.00033704186,0.000099763296,0.0002530203],"domain_scores_gemma":[0.9985374,0.0003884916,0.000068709756,0.0004410769,0.00047522204,0.00008906906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033490759,0.00014194837,0.00014353143,0.000057002897,0.00049393583,0.0001582689,0.0006631753,0.00009730468,0.00005040196],"category_scores_gemma":[0.000095498646,0.00012473702,0.000058989066,0.0004707747,0.00005260505,0.00046368942,0.00022411636,0.00038052024,0.00001952779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042956668,0.00013069058,0.0011325543,0.0000026800415,0.000047560512,5.268834e-7,0.00062786916,0.0040760865,0.026287831,0.8553713,0.008235055,0.10404488],"study_design_scores_gemma":[0.00045712825,0.00009469176,0.00043806215,0.0000070914202,0.0000021822352,0.0000041572484,0.000023515899,0.98475903,0.004358966,0.00007222935,0.00960207,0.00018088016],"about_ca_topic_score_codex":0.0000068019012,"about_ca_topic_score_gemma":0.0007750226,"teacher_disagreement_score":0.9806829,"about_ca_system_score_codex":0.000029547058,"about_ca_system_score_gemma":0.00006859729,"threshold_uncertainty_score":0.5086628},"labels":[],"label_agreement":null},{"id":"W2076331901","doi":"10.1109/icc.2014.6884206","title":"Robust cooperative beamforming for SC-FDMA based multi-relay networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Beamforming; Computer science; Frequency-division multiple access; Mathematical optimization; Optimization problem; Convex optimization; Convexity; Power (physics); Channel (broadcasting); Orthogonal frequency-division multiplexing; Algorithm; Mathematics; Telecommunications; Regular polygon","score_opus":0.07238349763227475,"score_gpt":0.2810873120466967,"score_spread":0.20870381441442193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076331901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023234458,0.00010849311,0.99484944,0.0013686335,0.000275853,0.0003807327,6.887898e-7,0.00024590787,0.0025379194],"genre_scores_gemma":[0.4195644,0.000041951636,0.57571775,0.0030472737,0.00010853946,0.00010045715,0.000012213438,0.000015026863,0.0013923763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987422,0.00016356127,0.0002692639,0.0003691909,0.000119861805,0.0003358711],"domain_scores_gemma":[0.998162,0.00056738936,0.00008034931,0.00076291384,0.0003099787,0.00011740903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071563077,0.00017785601,0.00019890525,0.000077157776,0.00055957586,0.00024025273,0.0010261693,0.00007234752,0.000047900132],"category_scores_gemma":[0.0001633352,0.00014996283,0.00008615613,0.0003935274,0.000051051844,0.00039691693,0.00027977698,0.0001706355,0.000023243158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012715331,0.00012881742,0.00020927763,0.000007220717,0.000024285273,4.0753574e-7,0.00036444832,0.6130855,0.00032326547,0.24354464,0.004873305,0.1374261],"study_design_scores_gemma":[0.00085127197,0.00009064246,0.000140136,0.00002957501,0.000003874543,0.0000010619892,0.000011413711,0.9724478,0.00062377163,0.00002396956,0.025555316,0.00022116667],"about_ca_topic_score_codex":0.0000037413897,"about_ca_topic_score_gemma":0.000116532,"teacher_disagreement_score":0.41933206,"about_ca_system_score_codex":0.000045327975,"about_ca_system_score_gemma":0.00005749949,"threshold_uncertainty_score":0.61153066},"labels":[],"label_agreement":null},{"id":"W2076449723","doi":"10.1109/jsac.2012.120912","title":"ML-Based Channel Estimations for Non-Regenerative Relay Networks with Multiple Transmit and Receive Antennas","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":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Channel (broadcasting); Singular value decomposition; Transmitter; Computer science; Algorithm; Relay channel; Estimation theory; Statistics; Mathematics; Telecommunications; Power (physics); Physics","score_opus":0.05117325933936758,"score_gpt":0.3013062263809591,"score_spread":0.25013296704159155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076449723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011804701,0.0017228477,0.97834605,0.006930585,0.00017023235,0.0006161736,0.0000080877035,0.00008133123,0.0003199919],"genre_scores_gemma":[0.87151587,0.0017709348,0.12578756,0.0005467463,0.000086384636,0.00020589004,0.00002609105,0.00002194873,0.00003859182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821633,0.00052986905,0.00043891964,0.00021701666,0.00017670273,0.000421187],"domain_scores_gemma":[0.99580383,0.0017769895,0.0002593523,0.0012260062,0.00070930907,0.00022451513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063806254,0.0002272943,0.00026590299,0.00031049323,0.001192133,0.00020936053,0.001357408,0.000095458665,0.0000036092144],"category_scores_gemma":[0.00020667286,0.00019323053,0.00005879423,0.0012426005,0.00014221626,0.00065853435,0.000090950336,0.00083680195,0.000002882333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009077641,0.007862847,0.04367961,0.000073854186,0.00092589884,0.0000143059615,0.038207076,0.67775625,0.00802153,0.0645218,0.012514187,0.1455149],"study_design_scores_gemma":[0.001555622,0.00026779977,0.012434118,0.0002872136,0.000022023829,0.000053705106,0.00006581005,0.9824524,0.00056730694,0.00011066648,0.0018991061,0.0002842267],"about_ca_topic_score_codex":0.0000051731727,"about_ca_topic_score_gemma":0.00039155578,"teacher_disagreement_score":0.85971117,"about_ca_system_score_codex":0.00014885973,"about_ca_system_score_gemma":0.00018445207,"threshold_uncertainty_score":0.91690433},"labels":[],"label_agreement":null},{"id":"W2076569610","doi":"10.1109/vetecf.2009.5378812","title":"Cross-Layer Scheduling for OFDMA Amplify-and-Forward Relay Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Goodput; Computer science; Subcarrier; Orthogonal frequency-division multiple access; Orthogonal frequency-division multiplexing; Relay; Scheduling (production processes); Frequency-division multiple access; Telecommunications link; Computer network; Physical layer; Channel state information; Fading; Channel (broadcasting); Power (physics); Throughput; Wireless; Mathematical optimization; Telecommunications","score_opus":0.049260229089264966,"score_gpt":0.3330502730241037,"score_spread":0.28379004393483875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076569610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010548678,0.001175895,0.9810637,0.0040816,0.00015662164,0.00019572598,4.0802405e-7,0.00020099028,0.0025763656],"genre_scores_gemma":[0.87105614,0.0010340817,0.12293591,0.0033461142,0.00011516411,0.000023973364,0.0000027537865,0.0000063100533,0.0014795356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991027,0.000040735013,0.0002145306,0.0002918545,0.00009084464,0.00025934895],"domain_scores_gemma":[0.9990157,0.00018123198,0.000055921504,0.0005132114,0.0001369672,0.00009697647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039953788,0.00011890259,0.00014035468,0.000048509566,0.00037510233,0.00038206257,0.0006424113,0.00007328581,0.000035802506],"category_scores_gemma":[0.000050819745,0.00010215565,0.00005384962,0.00024014259,0.000031657488,0.00038767548,0.00021273938,0.00016280968,0.000008510457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011814898,0.000039781724,0.0010157806,0.0000032825153,0.0000151832855,6.356958e-7,0.0002618178,0.010731927,0.00054170797,0.539068,0.0013635816,0.44694647],"study_design_scores_gemma":[0.0004146746,0.00007062415,0.0046547246,0.000021300946,0.0000037947532,0.0000036713643,0.00000604194,0.9701689,0.00033903515,0.0012271646,0.022901095,0.00018898844],"about_ca_topic_score_codex":0.0000013798552,"about_ca_topic_score_gemma":0.0000060330326,"teacher_disagreement_score":0.95943695,"about_ca_system_score_codex":0.000018743847,"about_ca_system_score_gemma":0.000022020658,"threshold_uncertainty_score":0.41657868},"labels":[],"label_agreement":null},{"id":"W2076576264","doi":"10.1109/vtcfall.2013.6692264","title":"Layered Source-Channel Coding over Two-Way Relay Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Coding (social sciences); Linear network coding; Relay channel; Channel code; Computer network; Channel (broadcasting); Decoding methods; Algorithm; Mathematics","score_opus":0.030987291461752713,"score_gpt":0.26961745448879537,"score_spread":0.23863016302704265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076576264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060438463,0.00029682953,0.96619296,0.0018124403,0.0003137021,0.00021309762,1.0632384e-7,0.0003829118,0.024744099],"genre_scores_gemma":[0.98297966,0.00030511233,0.008238918,0.002257325,0.00013080447,0.000038525275,0.0000021676096,0.000013503702,0.0060339826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987451,0.00014694271,0.00025469167,0.00032602833,0.00017025172,0.00035700173],"domain_scores_gemma":[0.99851847,0.00019809383,0.00007657506,0.00092479686,0.0001377174,0.00014434592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029514148,0.00015989074,0.00016042872,0.00007627875,0.00033410688,0.00040698898,0.0011115719,0.00005921998,0.0007356599],"category_scores_gemma":[0.000033461693,0.00013652083,0.000070773975,0.0004524408,0.000038617563,0.0006578364,0.00079561764,0.000251499,0.00041176096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006677455,0.0001582526,0.0014785491,0.000007889089,0.000085312626,0.000005658401,0.0025335061,0.068824686,0.0024181867,0.46709794,0.1546783,0.30270505],"study_design_scores_gemma":[0.00033824836,0.000020159208,0.0016302831,0.000020906202,0.0000017351712,0.0000051956063,0.000023496914,0.98753685,0.00016008594,0.00040785686,0.009641865,0.00021333972],"about_ca_topic_score_codex":0.00005950351,"about_ca_topic_score_gemma":0.000048191552,"teacher_disagreement_score":0.9769358,"about_ca_system_score_codex":0.000042136082,"about_ca_system_score_gemma":0.000018314433,"threshold_uncertainty_score":0.805496},"labels":[],"label_agreement":null},{"id":"W2076627813","doi":"10.1109/twc.2013.050313.121183","title":"Power Allocation in Multi-User Wireless Relay Networks through Bargaining","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Bargaining problem; Computer network; Relay channel; Wireless; Power (physics); Channel state information; Wireless network; Transmitter power output; Transmission (telecommunications); Negotiation; Mathematical optimization; Channel (broadcasting); Telecommunications; Microeconomics; Economics; Mathematics; Transmitter","score_opus":0.05268835609657771,"score_gpt":0.298017191183748,"score_spread":0.24532883508717027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076627813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077235056,0.0005057845,0.98325837,0.0044425884,0.00029187417,0.0007129341,0.000002942476,0.0003974997,0.002664531],"genre_scores_gemma":[0.94909954,0.004744217,0.04358743,0.0010703786,0.000011569477,0.0007640736,0.000012423572,0.00004102713,0.0006693294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728537,0.0007247765,0.0007155047,0.0005197144,0.00026891992,0.00048570134],"domain_scores_gemma":[0.99443823,0.00066178717,0.0001905884,0.004226081,0.00034465335,0.00013868652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043265085,0.00032754513,0.00032984914,0.0002878758,0.000978853,0.00031598262,0.0035322395,0.0002026846,0.00013373104],"category_scores_gemma":[0.000012170839,0.00034936907,0.00013925867,0.0016107339,0.00022171478,0.0016197519,0.00008045557,0.0011266257,0.00026714514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003183752,0.0045616245,0.00081012177,0.000022585178,0.00025558387,0.0000058078763,0.018037703,0.247248,0.008089452,0.3529769,0.001850875,0.36610952],"study_design_scores_gemma":[0.0009743999,0.000066438835,0.0020309538,0.00019029432,0.000010595832,0.000008381479,0.00033907866,0.99116814,0.0013209764,0.00025044812,0.0030979675,0.0005423013],"about_ca_topic_score_codex":0.00016122432,"about_ca_topic_score_gemma":0.0008129769,"teacher_disagreement_score":0.94137603,"about_ca_system_score_codex":0.00023238995,"about_ca_system_score_gemma":0.00010891999,"threshold_uncertainty_score":0.9998958},"labels":[],"label_agreement":null},{"id":"W2076691101","doi":"10.1109/icassp.2013.6638451","title":"Decentralized beamforming for multi-carrier asynchronous bi-directional relaying networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Beamforming; Transceiver; Subcarrier; Asynchronous communication; Computer science; Multiplexing; Orthogonal frequency-division multiplexing; Signal-to-noise ratio (imaging); Electronic engineering; Computer network; Power (physics); Channel (broadcasting); Telecommunications; Engineering; Wireless","score_opus":0.051191392964878665,"score_gpt":0.29558966068072345,"score_spread":0.24439826771584477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076691101","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015798374,0.0005143452,0.9945048,0.0007789591,0.00044581955,0.00049120723,5.519737e-7,0.0002935397,0.0013909399],"genre_scores_gemma":[0.32344428,0.0004795533,0.67329913,0.001152708,0.00010212818,0.00027055969,0.000009185037,0.000015767635,0.001226694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890816,0.00006527941,0.00026222036,0.00029064846,0.00011488398,0.00035879237],"domain_scores_gemma":[0.99889475,0.00021520413,0.000073271585,0.00046337585,0.00022766224,0.000125748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026633096,0.00013834628,0.00014680663,0.000068554225,0.00052177336,0.00027560414,0.00065568293,0.000064402804,0.00024641174],"category_scores_gemma":[0.00006974161,0.00012233692,0.00009251138,0.00030507217,0.000032258267,0.00069181377,0.00026718105,0.00013931711,0.0000386506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012592917,0.00018270918,0.0021309676,0.0000123700365,0.00010517964,9.432201e-7,0.00094422733,0.0121566,0.0020756728,0.17979395,0.015386442,0.78719836],"study_design_scores_gemma":[0.000632628,0.000023796521,0.00095277134,0.000016435357,0.0000033090994,0.000006155738,0.000023280005,0.9772601,0.00036221967,0.00020041563,0.020335492,0.00018336755],"about_ca_topic_score_codex":0.000019704461,"about_ca_topic_score_gemma":0.000038604256,"teacher_disagreement_score":0.9651035,"about_ca_system_score_codex":0.00008027355,"about_ca_system_score_gemma":0.0000511535,"threshold_uncertainty_score":0.4988755},"labels":[],"label_agreement":null},{"id":"W2076838219","doi":"10.1109/isit.2005.1523645","title":"Improved bounds on the size of sparse parity check matrices","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Combinatorics; Discrete mathematics; Mathematics; Mathematical analysis","score_opus":0.0426649201189785,"score_gpt":0.2793508502754104,"score_spread":0.2366859301564319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076838219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.372424,0.0021838618,0.19538632,0.121830605,0.00046121672,0.0008282073,0.0000023421262,0.000546279,0.30633718],"genre_scores_gemma":[0.9853577,0.00033000723,0.011067056,0.001680831,0.000038831222,0.0000065159943,1.7063783e-7,0.0000023336383,0.0015165469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994332,0.000081520026,0.00014866161,0.00012364217,0.00010524099,0.00010772809],"domain_scores_gemma":[0.9987566,0.00037225144,0.000063517735,0.0007107717,0.00006836703,0.000028514429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036497667,0.0000642198,0.00007923914,0.000018732948,0.00013657044,0.00008313395,0.00095953705,0.000021007963,0.00019303427],"category_scores_gemma":[0.00007960874,0.000039000613,0.000038546175,0.000266805,0.000040362156,0.00015536087,0.00028167054,0.00010262098,0.000036410383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001002831,0.00020066067,0.00031730442,0.0000045034385,0.00002132464,2.6773154e-7,0.000993663,0.00008272067,0.006466318,0.7621054,0.013020398,0.21677738],"study_design_scores_gemma":[0.0006722751,0.00020625727,0.015051368,0.000039890525,0.000008690276,0.0000037294046,0.00010364253,0.7029582,0.0516646,0.0018246492,0.22708872,0.0003779211],"about_ca_topic_score_codex":0.0000075103576,"about_ca_topic_score_gemma":0.0000777138,"teacher_disagreement_score":0.7602808,"about_ca_system_score_codex":0.000017712578,"about_ca_system_score_gemma":0.000029420258,"threshold_uncertainty_score":0.211359},"labels":[],"label_agreement":null},{"id":"W2076897967","doi":"10.1109/wcnc.2013.6555181","title":"Power allocation in decode and forward relaying for green cooperative cognitive radio systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Mathematical optimization; Cognitive radio; Telecommunications link; Fractional programming; Convergence (economics); Iterative method; Constraint (computer-aided design); Power (physics); Relay; Nonlinear programming; Wireless; Telecommunications; Nonlinear system; Algorithm; Mathematics","score_opus":0.030848786563050488,"score_gpt":0.27813170696801076,"score_spread":0.24728292040496028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076897967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059516132,0.0010322477,0.93021756,0.0021313084,0.00011893146,0.0012629624,0.0000013825402,0.000083149025,0.0056362976],"genre_scores_gemma":[0.9923073,0.0001825193,0.005677681,0.0003745209,0.000015167189,0.00034341236,0.0000049076984,0.0000069770003,0.001087532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914074,0.00012553947,0.00022203432,0.00025765234,0.00008029902,0.00017375387],"domain_scores_gemma":[0.99892026,0.00040544468,0.00005372531,0.00022584353,0.00033158847,0.00006316427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031487588,0.000104647064,0.00014658815,0.00009378736,0.00015855256,0.0002103103,0.00028155223,0.00004410976,0.000020697886],"category_scores_gemma":[0.00009567821,0.00009040467,0.000019889374,0.0002539984,0.000033756554,0.00073178124,0.000164705,0.00008936815,0.000023637112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004052659,0.00020221155,0.009659497,0.00006748477,0.00012684417,0.0000030496974,0.019723762,0.00075356726,0.0038418707,0.7777928,0.0059543885,0.18183401],"study_design_scores_gemma":[0.0013972021,0.00017304627,0.010980235,0.00016129644,0.000005046005,0.000011330812,0.0011731486,0.9821385,0.0005568298,0.0007026085,0.0023628792,0.00033788863],"about_ca_topic_score_codex":0.000086919215,"about_ca_topic_score_gemma":0.00014157807,"teacher_disagreement_score":0.98138493,"about_ca_system_score_codex":0.000045305416,"about_ca_system_score_gemma":0.000037057085,"threshold_uncertainty_score":0.36865956},"labels":[],"label_agreement":null},{"id":"W2076989091","doi":"10.1049/iet-com.2013.0287","title":"Dual‐hop amplify‐and‐forward cooperative relaying in the presence of Tx and Rx in‐phase and quadrature‐phase imbalance","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Quadrature (astronomy); Hop (telecommunications); Control theory (sociology); Outage probability; Channel state information; Compensation (psychology); Benchmark (surveying); Transmission (telecommunications); Fading; Channel (broadcasting); Telecommunications; Wireless; Electronic engineering; Physics; Engineering","score_opus":0.04402422241974788,"score_gpt":0.3435526511375032,"score_spread":0.2995284287177553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076989091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83578515,0.0248243,0.08590142,0.043862615,0.000117357245,0.0015540079,0.00003454832,0.00012149055,0.007799106],"genre_scores_gemma":[0.98354554,0.008754854,0.007080101,0.0004996249,0.000008284576,0.00007087269,0.000010887376,0.000005433402,0.000024428718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981585,0.000974071,0.0003494186,0.0002347778,0.00012058246,0.00016263271],"domain_scores_gemma":[0.9961651,0.0017026553,0.00012507316,0.0018421236,0.00010999322,0.000055047385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012182902,0.00012689436,0.00021578411,0.00011342405,0.00034832727,0.00015291708,0.0012781167,0.00005816269,0.0000021041856],"category_scores_gemma":[0.0003955692,0.00010315223,0.00001631684,0.0006199615,0.00037271946,0.00039578087,0.001085955,0.00046305513,0.0000011970217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038845697,0.00082382944,0.0061385683,0.000038803068,0.000025649038,0.0000031336904,0.053767957,0.00013430967,0.005705933,0.8373413,0.0007310232,0.09525062],"study_design_scores_gemma":[0.008036425,0.0007013683,0.040677954,0.0006923684,0.000030134534,0.00010629593,0.0036964905,0.87831783,0.0005273061,0.0081534395,0.058241826,0.0008185627],"about_ca_topic_score_codex":0.000042828156,"about_ca_topic_score_gemma":0.0007012037,"teacher_disagreement_score":0.87818354,"about_ca_system_score_codex":0.000015389365,"about_ca_system_score_gemma":0.000038331676,"threshold_uncertainty_score":0.4206426},"labels":[],"label_agreement":null},{"id":"W2077207590","doi":"10.1109/qbsc.2014.6841179","title":"Half-duplex relaying for the multiuser channel","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Duplex (building); Channel (broadcasting); Computer science; Gaussian; Relay channel; Coding (social sciences); Topology (electrical circuits); Scheme (mathematics); Algorithm; Computer network; Telecommunications; Mathematics; Physics; Statistics; Combinatorics; Mathematical analysis","score_opus":0.06577321422273655,"score_gpt":0.29201610462801925,"score_spread":0.2262428904052827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077207590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025955655,0.00020665719,0.98250073,0.012302975,0.00020537226,0.00016702396,1.0595996e-7,0.000105169835,0.004252405],"genre_scores_gemma":[0.957929,0.00013394692,0.0362136,0.0029969593,0.00009141959,0.00006123706,8.6575733e-7,0.000005635468,0.002567301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994908,0.000056888315,0.00010038383,0.00014394327,0.000069935064,0.00013804351],"domain_scores_gemma":[0.9985676,0.0006274022,0.000029999252,0.00066171295,0.00008257866,0.000030712734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048397438,0.000061092476,0.000059966394,0.000021761516,0.00041275672,0.000119992175,0.0009485575,0.000019435103,0.000017853064],"category_scores_gemma":[0.00011108769,0.00003750005,0.0000420592,0.00014457077,0.000020657244,0.0001556981,0.000284502,0.000068856236,0.000036286416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002373564,0.000019586118,0.000040273513,0.0000029108035,0.000012236008,6.386068e-8,0.0009298144,0.0013933899,0.00036470089,0.7040284,0.010819594,0.28238663],"study_design_scores_gemma":[0.00015044546,0.000013917422,0.00030937794,0.000004362755,0.0000013436841,7.3333075e-7,0.000016579035,0.817001,0.00027098903,0.0004333303,0.18174009,0.000057845074],"about_ca_topic_score_codex":0.000005282742,"about_ca_topic_score_gemma":0.000043667456,"teacher_disagreement_score":0.9576695,"about_ca_system_score_codex":0.000009552825,"about_ca_system_score_gemma":0.000009539128,"threshold_uncertainty_score":0.31746328},"labels":[],"label_agreement":null},{"id":"W2077242091","doi":"10.1007/s11432-011-4297-5","title":"Asymptotic SEP of MIMO beamforming in two-hop AF relaying systems","year":2011,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Beamforming; MIMO; Hop (telecommunications); Relay; Fading; Computer science; Diversity gain; Expression (computer science); Algorithm; Channel (broadcasting); Mathematics; Telecommunications; Control theory (sociology); Topology (electrical circuits); Combinatorics; Physics","score_opus":0.0553514123528561,"score_gpt":0.3052478189689734,"score_spread":0.2498964066161173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077242091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55415446,0.00026480004,0.30484724,0.00027724195,0.001179745,0.000480945,0.0000013249004,0.00015397683,0.13864025],"genre_scores_gemma":[0.9802342,0.00006681919,0.019552093,0.000104719475,0.000009100401,0.000013128384,4.838888e-7,0.0000016093314,0.000017845747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773276,0.00007937122,0.00068138144,0.00025904624,0.00083334924,0.00041411282],"domain_scores_gemma":[0.99860483,0.000078966215,0.00039451852,0.00055967225,0.0002582939,0.00010374374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048021055,0.00012916526,0.00017997218,0.0009563307,0.00074693,0.00044986157,0.0031499462,0.000024575558,0.000015317117],"category_scores_gemma":[0.0003237403,0.000105124906,0.00003764654,0.0051651704,0.00092034077,0.011732113,0.00063520926,0.00015385906,0.000037914684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059755866,0.00007696493,0.022538373,0.000048743143,0.00000420613,0.0000011257187,0.078505486,0.018172206,0.0023983575,0.78396875,0.00004964606,0.09423017],"study_design_scores_gemma":[0.00037974506,0.00012270096,0.040475596,0.00021676117,0.000001938535,0.000024087065,0.0029204274,0.9492756,0.0041081742,0.0016983493,0.00046127746,0.00031534315],"about_ca_topic_score_codex":0.00017387891,"about_ca_topic_score_gemma":0.00003292539,"teacher_disagreement_score":0.9311034,"about_ca_system_score_codex":0.00009642954,"about_ca_system_score_gemma":0.00043499802,"threshold_uncertainty_score":0.8505498},"labels":[],"label_agreement":null},{"id":"W2077308247","doi":"10.1109/drcn.2009.5340013","title":"On robust network planning","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Criticality; Robustness (evolution); Computer science; Mathematical optimization; Graph theory; Betweenness centrality; Monotone polygon; Complex network; Mathematics; Combinatorics","score_opus":0.06388232980670919,"score_gpt":0.2928610685829877,"score_spread":0.22897873877627853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077308247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009733205,0.00024624218,0.81822515,0.0033687523,0.00010962616,0.000042048654,1.8764238e-8,0.00021804843,0.17681679],"genre_scores_gemma":[0.9426645,0.000048713402,0.04783121,0.008222388,0.000082404404,0.0000015341117,6.737606e-7,0.0000019598835,0.0011466295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995059,0.00004290615,0.0000838755,0.00013617334,0.00008246112,0.00014869464],"domain_scores_gemma":[0.999389,0.00007948916,0.000020447113,0.00044278902,0.000025519352,0.000042754175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014537417,0.000058999227,0.000058890007,0.00002583372,0.00017058267,0.000097088545,0.000575174,0.000018029363,0.000047121335],"category_scores_gemma":[0.000014270252,0.00004917491,0.000020889991,0.00027197442,0.000006156631,0.00013477451,0.00008184082,0.00009639264,0.00007436952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013899227,0.000014893926,0.000042466654,1.1925012e-7,0.0000014587746,0.0000019747333,0.0000951985,0.04391251,0.000019107683,0.8369507,0.034804292,0.084155895],"study_design_scores_gemma":[0.00037521397,0.0003048966,0.014378653,0.000084207844,0.0000016168494,0.000007866451,0.000009453726,0.89788425,0.0001959886,0.03121478,0.05519088,0.00035217722],"about_ca_topic_score_codex":1.7412424e-7,"about_ca_topic_score_gemma":8.9024985e-7,"teacher_disagreement_score":0.94169116,"about_ca_system_score_codex":0.000013105971,"about_ca_system_score_gemma":0.0000103546345,"threshold_uncertainty_score":0.20052947},"labels":[],"label_agreement":null},{"id":"W2077316617","doi":"10.1109/spawc.2010.5670990","title":"Analysis of packet combining for single carrier multi-relay broadband system","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer science; Hybrid automatic repeat request; Network packet; Computer network; MIMO; Transmission (telecommunications); Automatic repeat request; Broadband; Diversity gain; Outage probability; Channel (broadcasting); Electronic engineering; Fading; Telecommunications; Engineering; Power (physics)","score_opus":0.07084588557237202,"score_gpt":0.3106882994470041,"score_spread":0.23984241387463207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077316617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0128459055,0.0004935658,0.98280394,0.00021421339,0.0007131772,0.00045880483,0.00003509142,0.00018667606,0.0022486337],"genre_scores_gemma":[0.89952654,0.000048644106,0.09973926,0.00006212226,0.000028844448,0.00007157368,0.000064254105,0.000012599172,0.00044618107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834883,0.00016381287,0.0005493834,0.0005243538,0.00019774135,0.0002158876],"domain_scores_gemma":[0.9966541,0.00035052866,0.0004049215,0.0019373934,0.0005573198,0.00009573378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068263564,0.00022949354,0.0006781335,0.00039248797,0.00017275997,0.00021239296,0.0017858174,0.00025547872,0.000024184512],"category_scores_gemma":[0.00008513822,0.00020772006,0.00039103132,0.00068309676,0.00006120606,0.00010146847,0.0018453286,0.00044348187,0.000002002419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008830891,0.0017981591,0.015560171,0.0019023999,0.015996346,0.000012090441,0.026720285,0.09330877,0.051165465,0.6001838,0.0058136624,0.18745054],"study_design_scores_gemma":[0.0003581038,0.0000299019,0.00048266503,0.00011047254,0.00032572445,9.909962e-7,0.000080086815,0.9940861,0.0024839009,0.000025876257,0.0017464131,0.00026978552],"about_ca_topic_score_codex":0.000038847797,"about_ca_topic_score_gemma":0.00045732764,"teacher_disagreement_score":0.9007773,"about_ca_system_score_codex":0.00007572655,"about_ca_system_score_gemma":0.0001084921,"threshold_uncertainty_score":0.8470578},"labels":[],"label_agreement":null},{"id":"W2077419187","doi":"10.1109/tmm.2007.907460","title":"Network Coding in Live Peer-to-Peer Streaming","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Computer network; Multicast; Testbed; Peer-to-peer; Wireless network; Multiple description coding; Distributed computing; Coding (social sciences); Erasure code; Decoding methods; Wireless; Network packet; Algorithm","score_opus":0.039406431935872,"score_gpt":0.29919708225165503,"score_spread":0.259790650315783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077419187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009958086,0.00005417752,0.9851095,0.0020565419,0.0010117033,0.00026251134,0.0000024857418,0.00017676112,0.0013682259],"genre_scores_gemma":[0.9222912,0.000061054736,0.07557285,0.0007658158,0.00010916951,0.000026134594,0.0000019518097,0.000014587211,0.0011571988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983129,0.00010165283,0.000336312,0.00036276257,0.00041842018,0.00046795988],"domain_scores_gemma":[0.9982634,0.00066985935,0.000051675834,0.00058906665,0.0002328606,0.00019312471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011259771,0.00017630271,0.00017932692,0.00028428866,0.0002862014,0.00009939686,0.0007024303,0.00008517398,0.000078128],"category_scores_gemma":[0.000043805907,0.00018576799,0.0000643086,0.0010430912,0.000034804332,0.000280579,0.000011118451,0.0004738078,0.0002730929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040519648,0.00024677932,0.00030516903,0.0000047462236,0.000022957489,0.000029418887,0.009689976,0.073201984,0.0019050023,0.0007447003,0.0016306546,0.9121781],"study_design_scores_gemma":[0.002241772,0.0003062254,0.016979959,0.00041437903,0.000021378712,0.00002069149,0.00070974906,0.9415026,0.016455581,0.00023212783,0.01995342,0.0011621657],"about_ca_topic_score_codex":0.000033862783,"about_ca_topic_score_gemma":0.0012120634,"teacher_disagreement_score":0.91233313,"about_ca_system_score_codex":0.00015568241,"about_ca_system_score_gemma":0.00004515067,"threshold_uncertainty_score":0.75753987},"labels":[],"label_agreement":null},{"id":"W2077559285","doi":"10.1109/icuwb.2015.7324464","title":"Improving the Bandwidth Efficiency of Multi-Terminal Satellite Communications","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Decodes; Relay; Computer network; Telecommunications link; Linear network coding; Decoding methods; Channel (broadcasting); Relay channel; Network packet; Terminal (telecommunication); Multicast; Telecommunications","score_opus":0.11122054671814968,"score_gpt":0.3227520118509753,"score_spread":0.2115314651328256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077559285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003806279,0.006759388,0.97197026,0.0031344835,0.00014419665,0.00023000964,6.03357e-7,0.00012151422,0.013833265],"genre_scores_gemma":[0.92407966,0.0007659632,0.074369326,0.00028304625,0.000010756754,0.000010500679,0.0000012478268,0.0000034704785,0.000476055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991709,0.00020960341,0.00022041879,0.00012763894,0.00014460227,0.00012684122],"domain_scores_gemma":[0.99745196,0.00019774592,0.00009647516,0.0019537683,0.0002370736,0.0000629629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072066666,0.000072091636,0.00009106484,0.000042848576,0.00020228865,0.000078522564,0.002784528,0.000020789132,0.000006185071],"category_scores_gemma":[0.000102025195,0.000046576522,0.000038117298,0.0004020536,0.00014801974,0.00020606916,0.0012233277,0.0001245349,0.000022764008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003583351,0.00022577417,0.0012938975,0.000006101963,0.000011510861,8.3613264e-7,0.0061135436,0.000053498214,0.0029837266,0.19683635,0.00029831423,0.79217285],"study_design_scores_gemma":[0.00056470995,0.000083362975,0.0023017363,0.000023459339,0.0000069291164,0.000016240727,0.00034123508,0.95800894,0.0029262968,0.00023293159,0.03531106,0.00018311842],"about_ca_topic_score_codex":0.000024570081,"about_ca_topic_score_gemma":0.00008153121,"teacher_disagreement_score":0.9579554,"about_ca_system_score_codex":0.000022346867,"about_ca_system_score_gemma":0.00009530432,"threshold_uncertainty_score":0.51743925},"labels":[],"label_agreement":null},{"id":"W2077647439","doi":"10.1109/icc.2013.6654748","title":"NBP: An efficient network-coding based backpressure algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Linear network coding; Computer science; Network packet; Queue; Algorithm; Coding (social sciences); Scheduling (production processes); Computer network; Mathematical optimization; Mathematics","score_opus":0.02744633871262434,"score_gpt":0.2597783190792147,"score_spread":0.2323319803665904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077647439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013799841,0.00024354472,0.9850091,0.0014900457,0.0002701231,0.0002472891,3.0783005e-7,0.0003473681,0.011012242],"genre_scores_gemma":[0.6054753,0.000039292816,0.3913552,0.0022178448,0.00014634652,0.000046665442,0.0000053973977,0.000010631215,0.0007033485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869025,0.00020451349,0.00020920024,0.00033854134,0.0002111035,0.00034640223],"domain_scores_gemma":[0.9983804,0.0001348251,0.00005456509,0.0010657833,0.00019542825,0.00016898652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038042734,0.00014290134,0.00013981176,0.000055841945,0.00033801727,0.00040824065,0.0012536687,0.000048424125,0.0007769258],"category_scores_gemma":[0.000014412081,0.000120824174,0.00005109928,0.0004543144,0.000034189197,0.00041047324,0.00039137335,0.00015749273,0.0003037234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001380003,0.00017118097,0.00019035292,0.0000047239187,0.000016690363,0.0000028868908,0.00042666303,0.07035388,0.00048956467,0.095126465,0.017962208,0.815254],"study_design_scores_gemma":[0.00021711264,0.00003569765,0.0012129978,0.000016665083,0.0000020035443,0.0000016497435,0.0000138167115,0.9873044,0.0002777884,0.00020942322,0.010529907,0.00017851984],"about_ca_topic_score_codex":0.000016501675,"about_ca_topic_score_gemma":0.000015951027,"teacher_disagreement_score":0.9169505,"about_ca_system_score_codex":0.00002816831,"about_ca_system_score_gemma":0.000044294426,"threshold_uncertainty_score":0.8506793},"labels":[],"label_agreement":null},{"id":"W2077668993","doi":"10.1109/cwit.2013.6621605","title":"Power allocation schemes for relay-based heterogeneous networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Femto-; Femtocell; Telecommunications link; Computer science; Macro; Computer network; Relay; Base station; Transmission (telecommunications); Interference (communication); Transmitter power output; Power (physics); Channel (broadcasting); Telecommunications; Transmitter","score_opus":0.025126710951705877,"score_gpt":0.26301202908432947,"score_spread":0.2378853181326236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077668993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025147572,0.00026138438,0.9916974,0.003514342,0.00014176981,0.0003586445,1.2471457e-7,0.00019059976,0.0013210027],"genre_scores_gemma":[0.9105683,0.000040799725,0.086018644,0.002587474,0.000026245567,0.00016379739,0.0000056934064,0.0000071842687,0.0005818843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932903,0.00004723984,0.00015836633,0.0002049441,0.000079462596,0.00018097015],"domain_scores_gemma":[0.99891233,0.0001380239,0.00004619763,0.00061349035,0.00022689576,0.000063042564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014330665,0.000089685054,0.00008164659,0.00004134948,0.00016955804,0.00018638131,0.00062105706,0.000044016244,0.00019928442],"category_scores_gemma":[0.000028392888,0.00007763784,0.0000541729,0.00018762391,0.000020393978,0.000266057,0.00012392938,0.000064293345,0.000077853656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016449541,0.00030134027,0.0006198197,0.000015879134,0.00007549118,0.0000011348496,0.00041268405,0.07238744,0.0040550446,0.48905736,0.06452586,0.3685315],"study_design_scores_gemma":[0.00020946248,0.000048104503,0.00015771166,0.0000075002026,0.0000010735397,0.0000010481659,0.0000029064827,0.9631319,0.0017964964,0.00022495218,0.034303762,0.00011508236],"about_ca_topic_score_codex":0.0000023398263,"about_ca_topic_score_gemma":0.000006405103,"teacher_disagreement_score":0.9080535,"about_ca_system_score_codex":0.0000248334,"about_ca_system_score_gemma":0.000030268366,"threshold_uncertainty_score":0.3165979},"labels":[],"label_agreement":null},{"id":"W2078124232","doi":"10.1109/atc.2010.5672703","title":"Jointly optimal precoder and power allocation for an amplify-and-forward half-duplex relay system","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Node (physics); Power (physics); Diversity gain; Coding (social sciences); Coding gain; Linear network coding; Mathematical optimization; Decoding methods; Mathematics; Computer network; Fading; Algorithm; Statistics; Engineering; Physics","score_opus":0.03267695840468888,"score_gpt":0.28414441324616013,"score_spread":0.25146745484147126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078124232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09723609,0.00014353341,0.896882,0.0019667265,0.00027271328,0.00042542198,0.0000012932015,0.0002430845,0.0028291538],"genre_scores_gemma":[0.80063695,0.000041999952,0.19838372,0.00022956348,0.000033172295,0.00004582193,0.0000057048715,0.000007836967,0.00061522046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991956,0.000060111244,0.00018749114,0.00030844746,0.0000881312,0.00016024132],"domain_scores_gemma":[0.99897945,0.000116710544,0.000057280784,0.0005727067,0.00015454848,0.00011931319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004488748,0.0001086813,0.00012320682,0.000055508302,0.00026740436,0.00028829323,0.00038291246,0.0000720105,0.000015801219],"category_scores_gemma":[0.00003167755,0.000091962545,0.000022423794,0.00009808945,0.000044325447,0.00055215624,0.00023486276,0.0001497827,0.000007790946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015661893,0.000053719956,0.00027933056,0.000028513326,0.000023129513,3.306432e-7,0.0017864367,0.00017711832,0.009205297,0.9166746,0.002925345,0.06883051],"study_design_scores_gemma":[0.0003941443,0.00015098685,0.0015008477,0.000017621613,0.000006225622,0.00002993007,0.00012777133,0.9554944,0.00084176636,0.0000690806,0.041166022,0.00020119296],"about_ca_topic_score_codex":0.0000096862805,"about_ca_topic_score_gemma":0.0001549452,"teacher_disagreement_score":0.9553173,"about_ca_system_score_codex":0.000014190752,"about_ca_system_score_gemma":0.000030122832,"threshold_uncertainty_score":0.3750124},"labels":[],"label_agreement":null},{"id":"W2078628964","doi":"10.1109/glocomw.2012.6477553","title":"Noncoherent relay selection for bidirectional cooperative networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Frequency-shift keying; Channel state information; Relay channel; Transmission (telecommunications); Signal-to-noise ratio (imaging); Detector; Channel (broadcasting); Energy (signal processing); Bit error rate; Cooperative diversity; Keying; Algorithm; Telecommunications; Wireless; Mathematics; Fading; Statistics; Demodulation; Artificial intelligence; Power (physics)","score_opus":0.045645356299652856,"score_gpt":0.3011940086663342,"score_spread":0.25554865236668134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078628964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013113071,0.0004260285,0.9905376,0.000661507,0.0006449721,0.0002468668,3.2884785e-7,0.00018894428,0.0059824423],"genre_scores_gemma":[0.944596,0.0001950413,0.050342597,0.0006829328,0.0004177863,0.00015142518,0.000006999388,0.000008088259,0.0035991431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992694,0.000096679694,0.00014577902,0.00015669611,0.00008822758,0.00024316777],"domain_scores_gemma":[0.9992751,0.00017971479,0.000042768923,0.00020904603,0.00020497643,0.00008841206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036341755,0.00009272525,0.000089812434,0.000047698028,0.0003558408,0.0000833292,0.00028249837,0.000044905337,0.00011716928],"category_scores_gemma":[0.000034427954,0.0000787884,0.000048006514,0.00038558236,0.000017415892,0.00053197553,0.000118486096,0.0001107399,0.00003107756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016386717,0.00022241668,0.0052084196,0.0000031065306,0.000051610376,4.679316e-8,0.00055779744,0.01318601,0.0008749535,0.82320434,0.047693193,0.1089817],"study_design_scores_gemma":[0.00027235007,0.00007026208,0.002279578,0.000007201048,0.0000037194413,0.0000075609655,0.000012420031,0.87855756,0.0014541477,0.000040020244,0.117135465,0.00015969935],"about_ca_topic_score_codex":0.000002820352,"about_ca_topic_score_gemma":0.00003998243,"teacher_disagreement_score":0.9432847,"about_ca_system_score_codex":0.00007449401,"about_ca_system_score_gemma":0.00003420819,"threshold_uncertainty_score":0.32128975},"labels":[],"label_agreement":null},{"id":"W2078724035","doi":"10.1109/infcom.2013.6567095","title":"Streaming codes for channels with burst and isolated erasures","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Erasure; Upper and lower bounds; Channel (broadcasting); Algorithm; Block code; Code (set theory); Tornado code; Column (typography); Luby transform code; Concatenated error correction code; Online codes; Linear code; Decoding methods; Mathematics; Telecommunications; Set (abstract data type)","score_opus":0.02935351133523197,"score_gpt":0.25916161304456886,"score_spread":0.22980810170933688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078724035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048681155,0.00032416542,0.94652486,0.0024139837,0.000036737038,0.00028736473,3.446122e-7,0.000118271986,0.0016130924],"genre_scores_gemma":[0.96578085,0.000103328784,0.032974012,0.00032764443,0.000016272666,0.00004861749,0.000001342442,0.0000038347744,0.0007440775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960244,0.000022210159,0.00007147819,0.00014075702,0.00004685852,0.0001162552],"domain_scores_gemma":[0.9994604,0.00011391748,0.000023125242,0.00023028399,0.00012798347,0.000044316555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007545056,0.00006475614,0.00007351281,0.00003072993,0.00016552719,0.00024013394,0.00024692403,0.00001661949,0.000022751487],"category_scores_gemma":[0.000010774151,0.00004498341,0.000009359793,0.00011792859,0.000025638115,0.00031642575,0.000106596366,0.000037179514,0.000005760958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001928737,0.00010377336,0.0032171174,0.000028923105,0.00009652217,0.0000012026862,0.0033596517,0.00036575107,0.008599936,0.2842425,0.008633318,0.691332],"study_design_scores_gemma":[0.00054012093,0.00024486784,0.0036392228,0.0000465162,0.000003844169,0.0000085769025,0.00011813188,0.98694026,0.0016942506,0.0011735334,0.005363267,0.00022739646],"about_ca_topic_score_codex":0.00001661314,"about_ca_topic_score_gemma":0.00004566119,"teacher_disagreement_score":0.98657453,"about_ca_system_score_codex":0.000005860675,"about_ca_system_score_gemma":0.00001142738,"threshold_uncertainty_score":0.23156172},"labels":[],"label_agreement":null},{"id":"W2078843310","doi":"10.1109/glocom.2014.7036839","title":"Learning-based relay selection for cooperative networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Rayleigh fading; Channel state information; Cooperative diversity; Transmission (telecommunications); Fading; Bandwidth (computing); Spectral efficiency; Selection (genetic algorithm); Relay channel; Multipath propagation; Signal-to-noise ratio (imaging); Diversity gain; Computer network; Channel (broadcasting); Algorithm; Telecommunications; Wireless; Artificial intelligence","score_opus":0.02083408152765558,"score_gpt":0.2666376333168208,"score_spread":0.2458035517891652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078843310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061991013,0.00003458968,0.9938641,0.001408242,0.00012799137,0.00018074007,5.261274e-8,0.00028390356,0.0034804784],"genre_scores_gemma":[0.95861125,0.000028138724,0.03770369,0.0013299371,0.000086757194,0.00006138713,0.0000058984033,0.000007733764,0.0021651806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991656,0.00023023944,0.0001354071,0.0002237522,0.00007241065,0.00017256859],"domain_scores_gemma":[0.9989915,0.00039682866,0.000049679777,0.00025691884,0.00025276837,0.0000522917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048500896,0.00009097915,0.00010137461,0.00004776712,0.00042914518,0.00013990054,0.0003997366,0.000045696368,0.0000361595],"category_scores_gemma":[0.00015583717,0.000079209545,0.00004390876,0.00035851292,0.000021434516,0.00017646333,0.00007784246,0.00016285412,0.000018080407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000879233,0.000030595966,0.00043823052,0.0000021467254,0.000008167601,3.2213634e-8,0.00010907732,0.6859213,0.00018865135,0.23773764,0.0042285277,0.071326844],"study_design_scores_gemma":[0.00032772703,0.00023156917,0.00017144758,0.000007261792,0.000001810177,6.23851e-7,0.000004110726,0.9341304,0.0006437013,0.00004828733,0.06432462,0.00010845399],"about_ca_topic_score_codex":0.0000017959964,"about_ca_topic_score_gemma":0.00005023027,"teacher_disagreement_score":0.95799136,"about_ca_system_score_codex":0.000030358611,"about_ca_system_score_gemma":0.000035141285,"threshold_uncertainty_score":0.3300681},"labels":[],"label_agreement":null},{"id":"W2078943717","doi":"10.1016/j.comcom.2012.08.002","title":"An efficient cooperative ARQ protocol for wireless relay networks","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Retransmission; Computer science; Selective Repeat ARQ; Computer network; Automatic repeat request; Relay; Sliding window protocol; Go-Back-N ARQ; Hybrid automatic repeat request; Network packet; Node (physics); Transmission (telecommunications); Real-time computing; Telecommunications; Telecommunications link; Window (computing); Engineering","score_opus":0.08831808563240486,"score_gpt":0.36968799335247754,"score_spread":0.2813699077200727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078943717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021097281,0.00017684366,0.95873326,0.0014159019,0.00024469843,0.03784613,0.0000031113152,0.00039605395,0.00097302184],"genre_scores_gemma":[0.42888296,0.000040673694,0.39805338,0.0011586449,0.00036503642,0.17133097,0.00005540429,0.000034713965,0.0000782255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977296,0.0007289875,0.00047977373,0.0003580802,0.0001721043,0.00053144],"domain_scores_gemma":[0.99340266,0.00061271875,0.0001956259,0.0050010397,0.00050134194,0.00028659482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009001587,0.00025956862,0.0002627652,0.00012093029,0.001299576,0.00035599186,0.005018051,0.0001012116,0.000014775213],"category_scores_gemma":[0.000023262255,0.00024483138,0.000110677516,0.0006660755,0.00018068947,0.0007445862,0.0017951411,0.00038207366,0.00003596054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002261987,0.0020599163,0.00071732746,0.000020121523,0.00006817118,3.1126882e-7,0.004714401,0.05452276,0.00023924602,0.7459953,0.008856289,0.18278353],"study_design_scores_gemma":[0.0006649908,0.00012167393,0.0011036913,0.00005020683,0.000006097616,0.0000070906517,0.000020042971,0.9094042,0.000103759565,0.00005655222,0.088163525,0.00029813367],"about_ca_topic_score_codex":0.0000024290919,"about_ca_topic_score_gemma":0.000014336851,"teacher_disagreement_score":0.85488147,"about_ca_system_score_codex":0.00010366328,"about_ca_system_score_gemma":0.0000910339,"threshold_uncertainty_score":0.999542},"labels":[],"label_agreement":null},{"id":"W2079280792","doi":"10.1109/icc.2010.5501938","title":"Joint Optimization for Source and Relay Precoding under Multiuser MIMO Downlink Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Precoding; Telecommunications link; Relay; Computer science; Zero-forcing precoding; MIMO; Joint (building); Maximization; Quadratic programming; Channel (broadcasting); Optimization problem; Mathematical optimization; Algorithm; Mathematics; Computer network; Engineering","score_opus":0.04683557434022274,"score_gpt":0.2747737475533456,"score_spread":0.22793817321312287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079280792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008872025,0.00007166866,0.98579895,0.0036258888,0.0003425352,0.00026504483,3.464837e-7,0.00015191667,0.00087164267],"genre_scores_gemma":[0.5761775,0.00014761974,0.4212451,0.0007472925,0.00007989423,0.000035635065,0.000003832215,0.00000899514,0.0015541683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993252,0.000038265705,0.00016471317,0.0002463501,0.00006925654,0.00015617533],"domain_scores_gemma":[0.9991796,0.0001494689,0.000055547607,0.00041488453,0.00012889522,0.00007159908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033886355,0.00009399896,0.000097742624,0.00006520171,0.00028165002,0.00022507024,0.00032349053,0.00006124689,0.00006535747],"category_scores_gemma":[0.00007466876,0.000080892314,0.000031858217,0.00014329856,0.000030501655,0.00034868077,0.00028099705,0.00014716481,0.0000060842112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016584552,0.00016593725,0.00036989484,0.00003653869,0.000056575558,4.908673e-7,0.004876958,0.29363376,0.026682626,0.32681945,0.004741899,0.3425993],"study_design_scores_gemma":[0.0003235404,0.000022047956,0.00014333689,0.000010807882,0.0000025146205,0.0000036599438,0.00002271312,0.98878926,0.0024465558,0.00023700786,0.007872554,0.00012598043],"about_ca_topic_score_codex":0.0000026170874,"about_ca_topic_score_gemma":0.000033095883,"teacher_disagreement_score":0.6951555,"about_ca_system_score_codex":0.000010696896,"about_ca_system_score_gemma":0.000018653413,"threshold_uncertainty_score":0.32986927},"labels":[],"label_agreement":null},{"id":"W2079287883","doi":"10.1155/2008/476125","title":"Power and Resource Allocation for Orthogonal Multiple Access Relay Systems","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":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Canada Research Chairs; Government of Ontario","keywords":"Quasiconvex function; Resource allocation; Computer science; Relay; Channel (broadcasting); Mathematical optimization; Power (physics); Joint (building); Signal-to-noise ratio (imaging); Convex optimization; Computer network; Regular polygon; Telecommunications; Mathematics; Convex combination; Engineering","score_opus":0.04928030065112178,"score_gpt":0.32747803208547355,"score_spread":0.2781977314343518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079287883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05522216,0.023608208,0.918311,0.0009895955,0.00020541143,0.00025640446,8.425575e-7,0.00005748927,0.0013488923],"genre_scores_gemma":[0.99073446,0.0022524158,0.0063944547,0.00038137104,0.000114543924,0.000021098182,0.0000012903967,0.0000130671015,0.00008731463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985791,0.00018475602,0.0004218874,0.00028147272,0.00028671202,0.0002460796],"domain_scores_gemma":[0.9988369,0.00035062103,0.00030258799,0.00017636546,0.0002283102,0.00010525536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068871654,0.00015088743,0.00019046545,0.00019155114,0.00073494803,0.00040626316,0.00072019873,0.0000437224,0.0000040853574],"category_scores_gemma":[0.00014201947,0.00012957168,0.000038646314,0.0003677673,0.000076089775,0.0022615138,0.00013543628,0.00038405182,0.0000017496537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036051715,0.0003051026,0.014525505,0.00013597948,0.000021461736,0.00009357707,0.0040088594,0.119211175,0.0018758253,0.015159768,0.00062492816,0.8436773],"study_design_scores_gemma":[0.0023574398,0.00043877738,0.008926701,0.0012877906,0.000005395352,0.0010773293,0.00021046441,0.8450736,0.0005121668,0.0011233477,0.13838342,0.00060357054],"about_ca_topic_score_codex":2.0802587e-7,"about_ca_topic_score_gemma":0.0000021907483,"teacher_disagreement_score":0.9355123,"about_ca_system_score_codex":0.0000756417,"about_ca_system_score_gemma":0.00010063232,"threshold_uncertainty_score":0.56527007},"labels":[],"label_agreement":null},{"id":"W2079444856","doi":"10.1109/itw.2009.5351472","title":"DMT analysis of asynchronous OFDM amplify-and-forward cooperative networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Asynchronous communication; Orthogonal frequency-division multiplexing; Multiplexing; Relay; Synchronization (alternating current); Computer science; Computer network; Channel (broadcasting); Protocol (science); Topology (electrical circuits); Telecommunications; Engineering; Physics; Electrical engineering","score_opus":0.020681177678066237,"score_gpt":0.2778015046039547,"score_spread":0.2571203269258885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079444856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006480664,0.00072888704,0.9794323,0.0010451562,0.0000388261,0.000103659775,8.826285e-7,0.00008705883,0.0120825935],"genre_scores_gemma":[0.98689157,0.0010506171,0.0105966395,0.0012103663,0.000018272694,0.000003666635,0.000007991377,0.0000027432593,0.00021811899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990085,0.00012943234,0.0002819737,0.0002664517,0.00013182712,0.0001818494],"domain_scores_gemma":[0.9988273,0.00015229962,0.000090040136,0.000660091,0.00018312126,0.00008714016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028649013,0.00012433856,0.00032053617,0.00020468455,0.00015132829,0.000100063786,0.0006194275,0.00005321124,0.000118039075],"category_scores_gemma":[0.000028088127,0.000103480685,0.000083169194,0.0016747233,0.00005780821,0.00024956366,0.00021421435,0.00013686244,0.0000048785755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000089817795,0.00011610037,0.0013257426,0.0000016167488,0.0004415921,0.0000019976628,0.0009710699,0.030211955,0.00038970602,0.6804573,0.0012510547,0.2848229],"study_design_scores_gemma":[0.00019435417,0.00013222199,0.022287201,0.0000080853615,0.00008322407,0.0000016221957,0.000033467095,0.9757753,0.00023305646,0.00018812895,0.0009006955,0.00016261748],"about_ca_topic_score_codex":0.000007879291,"about_ca_topic_score_gemma":0.000073436466,"teacher_disagreement_score":0.98041093,"about_ca_system_score_codex":0.000019605752,"about_ca_system_score_gemma":0.000031542848,"threshold_uncertainty_score":0.421982},"labels":[],"label_agreement":null},{"id":"W2079523679","doi":"10.1109/wcnc.2014.6952082","title":"Performance of two-way multi-relay inter-vehicular cooperative networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Rayleigh fading; Channel (broadcasting); Wireless; Cooperative diversity; Computer network; Fading; Upper and lower bounds; Throughput; Phase-shift keying; Wireless network; Communications system; Channel state information; Telecommunications; Bit error rate; Mathematics","score_opus":0.027788531403334916,"score_gpt":0.2719159192003071,"score_spread":0.24412738779697218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079523679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06351698,0.00014223128,0.9297302,0.0002922403,0.00018807114,0.00012350114,1.3670169e-7,0.00010400127,0.0059026745],"genre_scores_gemma":[0.96234727,0.00027877447,0.035907365,0.00053946214,0.00004221254,0.000013369895,0.0000023215325,0.0000075663474,0.000861682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988461,0.00025279613,0.00030040013,0.0002614549,0.00012819243,0.0002110325],"domain_scores_gemma":[0.99864286,0.00014908396,0.00009821553,0.0008290166,0.00020542528,0.000075402575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005344776,0.00014415786,0.00020755519,0.00006630685,0.00017296204,0.00006833648,0.0010887035,0.00004481731,0.00005756803],"category_scores_gemma":[0.000044473618,0.00011534295,0.000058362766,0.00042028565,0.00008598637,0.00036399614,0.0005489374,0.00020554791,0.000042538464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021289745,0.00035993164,0.011718762,0.000020496062,0.00009848565,0.0000017225138,0.0019963337,0.20097741,0.0046877773,0.30782178,0.0021923094,0.4701037],"study_design_scores_gemma":[0.00051642966,0.00012140233,0.0016091745,0.0000469945,0.0000029539974,0.0000028510287,0.0000089403375,0.9920885,0.0027477276,0.0000067174137,0.0026957386,0.00015259183],"about_ca_topic_score_codex":0.0000059641675,"about_ca_topic_score_gemma":0.00004974609,"teacher_disagreement_score":0.89883024,"about_ca_system_score_codex":0.000023239207,"about_ca_system_score_gemma":0.00002238362,"threshold_uncertainty_score":0.47035488},"labels":[],"label_agreement":null},{"id":"W2079605769","doi":"10.1145/1730836.1730849","title":"Video streaming over cooperative wireless networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Testbed; Energy consumption; Computer network; Mobile device; Broadcasting (networking); Channel (broadcasting); Real-time computing; Wireless; TRACE (psycholinguistics); Telecommunications; Engineering","score_opus":0.017716143550102863,"score_gpt":0.2683074933048756,"score_spread":0.2505913497547727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079605769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078462124,0.00008190385,0.8926322,0.000949294,0.00061848696,0.00013914573,3.3095412e-7,0.0002945944,0.026821952],"genre_scores_gemma":[0.98800606,0.00014318826,0.009341396,0.0010812099,0.00012033039,0.000014409807,0.0000025423797,0.000007779413,0.0012830766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991128,0.00007900873,0.0001740171,0.00027793227,0.00012758156,0.00022868652],"domain_scores_gemma":[0.99871325,0.00017899368,0.00004441856,0.00081682985,0.00014661503,0.00009991273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024244306,0.00012786395,0.00012535746,0.000049826835,0.0002981372,0.00027442822,0.0009982283,0.00006451134,0.000341765],"category_scores_gemma":[0.000032119002,0.00010710736,0.000040237668,0.00041961853,0.000058571222,0.0005021049,0.0005159148,0.00040237332,0.00004643189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020773382,0.000048287402,0.0012736208,9.923224e-7,0.000014128175,0.0000032114012,0.00043481594,0.0002969399,0.007992011,0.7728587,0.003980892,0.21309437],"study_design_scores_gemma":[0.00028059224,0.00002743201,0.005447517,0.000011949063,0.0000021196286,0.0000069742623,0.00002058931,0.9741792,0.0019279731,0.00017117312,0.01768113,0.00024335706],"about_ca_topic_score_codex":0.0000096329995,"about_ca_topic_score_gemma":0.00044055708,"teacher_disagreement_score":0.97388226,"about_ca_system_score_codex":0.000014950095,"about_ca_system_score_gemma":0.000044451084,"threshold_uncertainty_score":0.43677112},"labels":[],"label_agreement":null},{"id":"W2079806412","doi":"10.1109/icassp.2013.6638603","title":"SNR-per-unit-power optimization in relay networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Alberta","funders":"","keywords":"Relay; Maximization; Transmitter power output; Computer science; Signal-to-noise ratio (imaging); Power (physics); Transmitter; Relay channel; Spectral efficiency; Measure (data warehouse); Electronic engineering; Control theory (sociology); Topology (electrical circuits); Mathematics; Mathematical optimization; Computer network; Telecommunications; Beamforming; Electrical engineering; Engineering; Physics","score_opus":0.024440952587332875,"score_gpt":0.2544895549093134,"score_spread":0.23004860232198054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079806412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025070603,0.00019799812,0.9576483,0.002342614,0.00014904028,0.00017030974,2.8548204e-8,0.00013039992,0.036854263],"genre_scores_gemma":[0.8976616,0.00043882488,0.09887606,0.0014384777,0.00001934923,0.00003694335,0.000002749352,0.00000641952,0.0015195517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992154,0.0001239099,0.00019235548,0.00019084121,0.000090944355,0.00018653335],"domain_scores_gemma":[0.9991219,0.00008503299,0.000036618414,0.00058495795,0.00011308565,0.000058419308],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019752338,0.00008627611,0.00008961708,0.00008872216,0.000098660516,0.00018873173,0.0006945638,0.000050635164,0.0011365628],"category_scores_gemma":[0.0000240975,0.00007538609,0.000022983171,0.0005231487,0.000021069342,0.0006625998,0.00032157777,0.00016242154,0.00018747608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015475647,0.00008601301,0.002863653,0.0000012583664,0.0000066047373,0.0000014297418,0.0007551512,0.784156,0.00008429125,0.14589782,0.009412491,0.056733716],"study_design_scores_gemma":[0.00015510825,0.000016345393,0.0042241164,0.000010476209,3.72509e-7,0.0000015449723,0.000019495745,0.99262893,0.00001739345,0.00009580196,0.0027218184,0.00010857685],"about_ca_topic_score_codex":0.000017468297,"about_ca_topic_score_gemma":0.000045145727,"teacher_disagreement_score":0.89515454,"about_ca_system_score_codex":0.000026424701,"about_ca_system_score_gemma":0.00001932521,"threshold_uncertainty_score":0.99977654},"labels":[],"label_agreement":null},{"id":"W2079882399","doi":"10.1109/tcomm.2012.010313.100669","title":"Relay Selection Schemes and Performance Analysis Approximations for Two-Way Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Selection (genetic algorithm); Computer science; Relay channel; Maximization; Block Error Rate; Cumulative distribution function; Signal-to-noise ratio (imaging); Overhead (engineering); Mathematical optimization; Computer network; Topology (electrical circuits); Mathematics; Telecommunications; Probability density function; Engineering; Statistics; Telecommunications link; Electrical engineering; Power (physics); Artificial intelligence","score_opus":0.036510521352791724,"score_gpt":0.28294165729959186,"score_spread":0.24643113594680013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079882399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005221313,0.0003367296,0.98972434,0.0029814898,0.00008997142,0.0006373026,0.0000052731343,0.00026147006,0.0007420885],"genre_scores_gemma":[0.8811407,0.0020085073,0.114872634,0.00024123891,0.00001532816,0.0010577418,0.000014609023,0.00001282273,0.0006364139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987668,0.000203489,0.00035253752,0.000311511,0.0001238273,0.00024184944],"domain_scores_gemma":[0.9969629,0.0005706403,0.00011898592,0.0018676714,0.00037162157,0.00010819597],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00031496852,0.0001743211,0.00020738017,0.0003930636,0.0017479575,0.00028992692,0.0012203918,0.000074052456,0.000054910677],"category_scores_gemma":[0.000011372595,0.00017796933,0.00013850085,0.0019010702,0.00013148347,0.00085873686,0.000028405086,0.0003724292,0.000028446024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014492711,0.00064318907,0.0005396167,0.000022592585,0.00081266905,4.4520416e-8,0.0012007087,0.32832408,0.00095117977,0.049011294,0.00070852914,0.6177716],"study_design_scores_gemma":[0.00031185322,0.00006968379,0.0012639299,0.000015717296,0.00010283922,0.0000030504816,0.000028608234,0.99441403,0.0005798057,0.0001330116,0.0028810434,0.00019640542],"about_ca_topic_score_codex":0.000023014956,"about_ca_topic_score_gemma":0.00023906925,"teacher_disagreement_score":0.8759194,"about_ca_system_score_codex":0.0000718893,"about_ca_system_score_gemma":0.00003840964,"threshold_uncertainty_score":0.99955165},"labels":[],"label_agreement":null},{"id":"W2079926867","doi":"10.1016/j.adhoc.2007.01.005","title":"Mobile ad hoc relaying for upward vertical handoff in hybrid WLAN/cellular systems","year":2007,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer network; Handover; Computer science; Wireless; Wireless ad hoc network; Guard (computer science); Mobile ad hoc network; Hybrid system; Wireless network; Telecommunications","score_opus":0.02639871520276623,"score_gpt":0.2741966811841737,"score_spread":0.24779796598140744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079926867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03636011,0.07224837,0.88887346,0.00013407058,0.0009919041,0.0007200386,9.684965e-7,0.0001732777,0.0004978297],"genre_scores_gemma":[0.9870306,0.0060640075,0.005794831,0.0003119739,0.00020929813,0.0001676169,0.000018839039,0.000026498497,0.0003763239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789524,0.00017149931,0.0005505862,0.00048222774,0.00022250996,0.00067793747],"domain_scores_gemma":[0.998055,0.00062107574,0.00008304871,0.00092576275,0.00013628049,0.00017887782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015201082,0.00022095123,0.00033496052,0.00012641361,0.00029383248,0.00022332602,0.000960649,0.00012042489,0.000006853592],"category_scores_gemma":[0.0000618854,0.00021796087,0.00011210389,0.0005373816,0.00006031649,0.0002994847,0.00040865687,0.0004226595,0.000017578783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043533024,0.00044934344,0.0020874506,0.00010225386,0.00013568359,0.00022138584,0.0033456408,0.050477907,0.002511327,0.0434597,0.014352391,0.8824216],"study_design_scores_gemma":[0.0010576308,0.0002150412,0.00022220126,0.00019031206,0.000009353662,0.000017079085,0.000070011854,0.8823897,0.0002742784,0.00010416468,0.11512763,0.00032256558],"about_ca_topic_score_codex":0.0000015151961,"about_ca_topic_score_gemma":0.00005275019,"teacher_disagreement_score":0.9506705,"about_ca_system_score_codex":0.00015572444,"about_ca_system_score_gemma":0.000051899126,"threshold_uncertainty_score":0.8888187},"labels":[],"label_agreement":null},{"id":"W2080009684","doi":"10.1109/twc.2013.011513.120088","title":"On the Effect of Outdated Channel Estimation in Variable Gain Relaying: Error Performance and PAPR","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Nakagami distribution; Rayleigh fading; Cumulative distribution function; Channel state information; Fading; Computer science; Relay channel; Transmitter power output; Channel (broadcasting); Additive white Gaussian noise; Statistics; Mathematics; Control theory (sociology); Transmitter; Telecommunications; Probability density function; Power (physics); Wireless; Physics","score_opus":0.0320068927208161,"score_gpt":0.26847491970737686,"score_spread":0.23646802698656075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080009684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24136226,0.000115404284,0.751009,0.0048988224,0.0001005038,0.0008256636,0.0000050109484,0.00011225502,0.0015710809],"genre_scores_gemma":[0.9952313,0.0006781388,0.0033502118,0.00017679227,0.0000020835396,0.00045088935,0.000004738565,0.000011173046,0.00009467608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998516,0.00063807965,0.00033116867,0.0001986175,0.00015084354,0.00016528025],"domain_scores_gemma":[0.99603707,0.0016453828,0.00011955905,0.0020512184,0.00009794225,0.000048839465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006083553,0.00015422884,0.0001909596,0.0001909889,0.000588846,0.000084868334,0.0013909744,0.00006690159,0.000023151157],"category_scores_gemma":[0.000026925081,0.00011857645,0.000039254715,0.0008308348,0.00015643678,0.00042928182,0.000034344357,0.00047837663,0.000035741366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010113618,0.001177178,0.00041460316,0.00013725611,0.00016981027,5.8306836e-7,0.006504624,0.3717003,0.008957137,0.16032173,0.00092672236,0.44958892],"study_design_scores_gemma":[0.00038398834,0.00019755059,0.00070070976,0.00018356356,0.000008205487,0.0000021474762,0.000035116293,0.99272335,0.005280383,0.00031045603,0.00004954624,0.00012501341],"about_ca_topic_score_codex":0.000052979114,"about_ca_topic_score_gemma":0.0000482569,"teacher_disagreement_score":0.75386906,"about_ca_system_score_codex":0.00005674545,"about_ca_system_score_gemma":0.000032323587,"threshold_uncertainty_score":0.4835407},"labels":[],"label_agreement":null},{"id":"W2080110511","doi":"10.1016/j.dam.2011.06.024","title":"Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Strong perfect graph theorem; Chordal graph; Indifference graph; Corollary; Cograph; Complement (music); Pathwidth; Discrete mathematics; Clique-sum; 1-planar graph; Graph; Line graph","score_opus":0.04422250929995786,"score_gpt":0.2523215182814113,"score_spread":0.20809900898145345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080110511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13785529,0.00035498678,0.74369293,0.00055833935,0.0002592353,0.0011978179,0.0000427223,0.000504518,0.11553418],"genre_scores_gemma":[0.84199727,0.00015950568,0.15746145,0.0001768605,0.000018131066,0.0000712207,0.000026857391,0.000019780662,0.00006895829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877876,0.00003780398,0.000273921,0.0003254668,0.0003169791,0.00026708428],"domain_scores_gemma":[0.998519,0.00014180226,0.00015364152,0.0009825624,0.00008282697,0.0001201406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002820111,0.00022407848,0.0002370261,0.00010716524,0.00034932053,0.000114592745,0.00092369306,0.00004507789,0.00019655896],"category_scores_gemma":[0.00001619238,0.00017351151,0.000055432043,0.0003249517,0.00017846035,0.00026202077,0.00055887515,0.00024310335,0.000029039209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019006584,0.00010006963,0.0004306226,0.000023927894,0.00007020419,0.0000017397615,0.0018984138,0.0000050412154,0.000159974,0.99331397,0.0016818505,0.0022951823],"study_design_scores_gemma":[0.011831732,0.0016986453,0.022375403,0.0008395866,0.00048780954,0.00017259465,0.008341454,0.10858427,0.0055429325,0.7988985,0.03734502,0.0038820496],"about_ca_topic_score_codex":0.000005816217,"about_ca_topic_score_gemma":0.00004113915,"teacher_disagreement_score":0.7041419,"about_ca_system_score_codex":0.000025685777,"about_ca_system_score_gemma":0.000034789984,"threshold_uncertainty_score":0.7075594},"labels":[],"label_agreement":null},{"id":"W2080262227","doi":"10.1007/s11767-005-0200-0","title":"Relay assisted transmission with Bit-Interleaved Coded Modulation","year":2006,"lang":"en","type":"article","venue":"Journal of Electronics (China)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer science; Transmission (telecommunications); Spectral efficiency; Bit error rate; Link adaptation; Node (physics); Modulation (music); Electronic engineering; Computer network; Channel (broadcasting); Telecommunications; Fading; Power (physics); Physics","score_opus":0.01185069061669808,"score_gpt":0.24127389927504933,"score_spread":0.22942320865835125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080262227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18182674,0.0018573474,0.81146866,0.003563446,0.000073158015,0.00007821484,1.6868995e-7,0.00003699802,0.001095272],"genre_scores_gemma":[0.96456367,0.00053919444,0.034374297,0.00006378838,0.00007321073,0.0000013211185,0.0000025317863,0.000011572828,0.00037039755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987116,0.0001886333,0.0003796859,0.00014837176,0.00033075726,0.00024095911],"domain_scores_gemma":[0.9989069,0.000049986324,0.00038810333,0.0003379277,0.00024562658,0.00007147318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005032211,0.00013389565,0.00021215444,0.0001612263,0.00018960639,0.0001377121,0.0006622033,0.000055026703,0.00001374574],"category_scores_gemma":[0.000013432727,0.000099393066,0.00009609271,0.0004919809,0.00002349993,0.0004946948,0.00004349278,0.0004687385,0.0000024108213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052466465,0.00083546434,0.0011930037,0.000028880435,0.00019945185,0.0000743791,0.0014255692,0.058724087,0.15287392,0.14772488,0.0066454313,0.62975025],"study_design_scores_gemma":[0.0027736602,0.0017070292,0.053889465,0.00031362736,0.000044829165,0.0005717488,0.000009963254,0.88071984,0.010952871,0.00697823,0.041604407,0.00043434274],"about_ca_topic_score_codex":0.000003608535,"about_ca_topic_score_gemma":0.000055111163,"teacher_disagreement_score":0.82199574,"about_ca_system_score_codex":0.00017469132,"about_ca_system_score_gemma":0.00020027423,"threshold_uncertainty_score":0.40531316},"labels":[],"label_agreement":null},{"id":"W2080390426","doi":"10.1109/icce.2012.6161833","title":"Destination cooperation in interference channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; MIMO; Diversity gain; Cooperative MIMO; Computer network; Exploit; Coding (social sciences); Cooperative diversity; Channel (broadcasting); Antenna diversity; Interference (communication); Baseline (sea); Node (physics); Single antenna interference cancellation; Electronic engineering; Wireless; Telecommunications; Multi-user MIMO; Fading; Engineering; Computer security; Mathematics","score_opus":0.068810932191383,"score_gpt":0.30334144954450487,"score_spread":0.23453051735312186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080390426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035121247,0.00021111456,0.9507181,0.0009567254,0.0002536685,0.0000848534,3.4615788e-8,0.000082212726,0.012572031],"genre_scores_gemma":[0.9886421,0.000077642624,0.010536491,0.00032812144,0.00003451336,0.000015189644,0.0000014760448,0.0000018738174,0.00036257415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995244,0.000086462125,0.00011346829,0.00008713979,0.000053208827,0.00013531109],"domain_scores_gemma":[0.99960446,0.000049181803,0.000020680527,0.00022688232,0.000060364542,0.00003840259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003331436,0.000048670365,0.000047959216,0.00007566952,0.000053837204,0.0000740345,0.00032656034,0.000018779418,0.000051986743],"category_scores_gemma":[0.000055323886,0.000043668246,0.000008506141,0.0003619212,0.000009346454,0.00089661713,0.0001587928,0.000067760135,0.00007846191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011862228,0.00008501103,0.0059605045,0.0000017629964,0.0000013193736,2.2629621e-7,0.0022351225,0.00018284479,0.0023697293,0.81816196,0.00047297814,0.17052737],"study_design_scores_gemma":[0.0005422276,0.00007328519,0.047165565,0.000070401795,0.0000013762732,0.000010873385,0.00006723848,0.92601115,0.015410337,0.0010883526,0.009164062,0.00039515496],"about_ca_topic_score_codex":0.000003378277,"about_ca_topic_score_gemma":0.000029764105,"teacher_disagreement_score":0.9535209,"about_ca_system_score_codex":0.00003634367,"about_ca_system_score_gemma":0.00001347408,"threshold_uncertainty_score":0.17807393},"labels":[],"label_agreement":null},{"id":"W2080607882","doi":"10.1109/icassp.2013.6638581","title":"Linear transceiver design for relay-assisted broadcast systems with diagonal scaling","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Computer science; Telecommunications link; Diagonal; Decoding methods; Diagonal matrix; Base station; Minimum mean square error; Transceiver; Scaling; Matrix (chemical analysis); Control theory (sociology); Algorithm; Power (physics); Topology (electrical circuits); Electronic engineering; Mathematics; Wireless; Telecommunications; Engineering; Statistics","score_opus":0.07415823101457308,"score_gpt":0.2686862405574227,"score_spread":0.1945280095428496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080607882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017854,0.00041834707,0.9947085,0.0009230272,0.000105868334,0.00066679623,6.481084e-7,0.00017140442,0.0012200178],"genre_scores_gemma":[0.735172,0.00009016248,0.26197806,0.00028471492,0.000059685597,0.00023666288,0.000003441951,0.000012453437,0.002162818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906725,0.00012574745,0.00019677558,0.00024974108,0.00014450731,0.00021598442],"domain_scores_gemma":[0.99881244,0.000312407,0.000051766714,0.00045333427,0.00027821146,0.00009185579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026368964,0.00012039984,0.00014323622,0.000054229542,0.0002452072,0.00024801842,0.0006173886,0.000041784384,0.000045803474],"category_scores_gemma":[0.000015550006,0.000086427666,0.000044323802,0.0002704898,0.000046443198,0.00042807858,0.000052037853,0.00009589321,0.00006450585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010902922,0.00046365068,0.0005363702,0.000111296875,0.00027074054,0.000008081771,0.0042262105,0.07400881,0.010846823,0.27754042,0.029317351,0.60256124],"study_design_scores_gemma":[0.00062251964,0.00011798003,0.00062816846,0.00006436086,0.0000064552114,0.000015306365,0.000043030326,0.9879464,0.00059358904,0.000046515826,0.009716975,0.0001987372],"about_ca_topic_score_codex":0.000012823212,"about_ca_topic_score_gemma":0.0000044493004,"teacher_disagreement_score":0.91393757,"about_ca_system_score_codex":0.000029406325,"about_ca_system_score_gemma":0.000053280404,"threshold_uncertainty_score":0.3524418},"labels":[],"label_agreement":null},{"id":"W2080646859","doi":"10.1109/twc.2012.083112.110923","title":"Cooperative Joint Precoding in a Downlink Cellular System with Shared Relay: Design and Performance Evaluation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Precoding; Telecommunications link; Relay; Base station; Computer science; Transmission (telecommunications); Zero-forcing precoding; Interference (communication); Ergodic theory; Computer network; Cellular network; Telecommunications; Mathematics; MIMO; Channel (broadcasting)","score_opus":0.08979495187421804,"score_gpt":0.2819393227164786,"score_spread":0.19214437084226055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080646859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06539833,0.00092632684,0.931096,0.0007368689,0.00011530165,0.0009748247,0.00000379722,0.00017823615,0.0005703166],"genre_scores_gemma":[0.95296097,0.0016567947,0.04448076,0.00007080111,0.000012083267,0.000747151,0.000008290499,0.000019237481,0.000043888165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750966,0.0011548363,0.0004156207,0.00030103812,0.00029653596,0.0003223188],"domain_scores_gemma":[0.9971168,0.00040249486,0.00014220778,0.0019117787,0.00029342138,0.0001333057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015109973,0.00022377553,0.0002503525,0.00029670636,0.0009293704,0.00016433155,0.0009777192,0.00008703456,0.00001467533],"category_scores_gemma":[0.000008553347,0.00020615302,0.000038484803,0.00092565943,0.00013317505,0.0012308607,0.000036198802,0.0005479215,0.000027687625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017679288,0.0019406576,0.0011504813,0.00013145678,0.00024858775,0.0000024068875,0.03378829,0.29548672,0.011689951,0.036570363,0.0000984682,0.6187158],"study_design_scores_gemma":[0.0007388541,0.0001308763,0.0015259213,0.00039432241,0.00002745577,0.000018357005,0.00028343033,0.9899654,0.0065328777,0.0000036666436,0.000105863706,0.0002729938],"about_ca_topic_score_codex":0.000015938018,"about_ca_topic_score_gemma":0.000094655465,"teacher_disagreement_score":0.8875627,"about_ca_system_score_codex":0.00035106862,"about_ca_system_score_gemma":0.00014371096,"threshold_uncertainty_score":0.84066767},"labels":[],"label_agreement":null},{"id":"W2080932185","doi":"10.1109/tcomm.2011.122111.110057","title":"Node Switching Rates of Opportunistic Relaying and Switch-and-Examine Relaying in Rician and Nakagami-m Fading","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Fading; Relay; Computer science; Nakagami distribution; Independent and identically distributed random variables; Rayleigh fading; Fading distribution; Channel (broadcasting); Electronic engineering; Computer network; Topology (electrical circuits); Mathematics; Engineering; Electrical engineering; Statistics; Physics; Power (physics)","score_opus":0.128837156170677,"score_gpt":0.3070029729815844,"score_spread":0.1781658168109074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080932185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08392206,0.0020105334,0.90885246,0.0013382842,0.00008635674,0.0002759558,0.0000046308287,0.00010317479,0.0034065417],"genre_scores_gemma":[0.9560262,0.00923113,0.034475368,0.00016701243,0.0000032264436,0.00004047413,0.0000014974546,0.000013652859,0.00004146434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987363,0.00026682974,0.0004346411,0.00027528938,0.000101988524,0.00018494537],"domain_scores_gemma":[0.99769413,0.0006912623,0.00014237582,0.001292394,0.000079603844,0.00010022749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055038306,0.00016116683,0.0002325582,0.00034435675,0.0006625844,0.00007064462,0.00076684443,0.00006805414,0.000006801443],"category_scores_gemma":[0.000032703043,0.00017128674,0.00003175402,0.0005225888,0.0001660383,0.00046111617,0.000078831414,0.00047805518,0.0000020138912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057319852,0.0010189003,0.009075074,0.0001284918,0.0001887911,0.000011150439,0.05546296,0.00056305475,0.029958947,0.13568,0.000026250458,0.76782906],"study_design_scores_gemma":[0.0023501741,0.0003274163,0.06566385,0.0014224299,0.00013326661,0.00013664768,0.0029794665,0.91299444,0.0067105037,0.005312797,0.0007739408,0.0011950718],"about_ca_topic_score_codex":0.00012161737,"about_ca_topic_score_gemma":0.0004161122,"teacher_disagreement_score":0.91243136,"about_ca_system_score_codex":0.00003853813,"about_ca_system_score_gemma":0.000041293824,"threshold_uncertainty_score":0.69848704},"labels":[],"label_agreement":null},{"id":"W2081071791","doi":"10.1109/icices.2014.7033907","title":"Effective cooperative diversity technique for high throughput in MIMO adhoc networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Computer network; Computer science; Cooperative diversity; Throughput; Wireless ad hoc network; Wireless network; Wireless; Node (physics); MIMO; Decodes; Transmission (telecommunications); Diversity gain; Antenna diversity; Distributed computing; Telecommunications; Engineering; Decoding methods; Channel (broadcasting)","score_opus":0.021007242454128158,"score_gpt":0.26580095931995756,"score_spread":0.2447937168658294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081071791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018747402,0.00007199421,0.99187917,0.0008512086,0.00015410708,0.001065496,7.4534495e-7,0.00013531993,0.003967194],"genre_scores_gemma":[0.9622592,0.00009777848,0.036100954,0.00097040425,0.00005861696,0.00028399721,0.000004619169,0.000006718264,0.00021773319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987755,0.00034422253,0.00017140184,0.00036333155,0.00009631261,0.0002492601],"domain_scores_gemma":[0.9984443,0.0006956995,0.00005496281,0.0005601759,0.00018943769,0.00005538876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007592117,0.00014635568,0.0002138052,0.00007936705,0.0004315935,0.00007958954,0.0009465646,0.00008229945,0.000019063284],"category_scores_gemma":[0.00011043992,0.00012883224,0.000049260303,0.00049544865,0.000056154902,0.00037154253,0.0013726022,0.00019936809,0.000007817057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026042468,0.00010722499,0.0015935868,0.000007275701,0.000019915227,0.0000010650818,0.0009489731,0.0025547417,0.00044451843,0.9076451,0.003017598,0.08363396],"study_design_scores_gemma":[0.0022210544,0.0006897283,0.016722111,0.00011533556,0.000009691485,0.0000044944145,0.000047921116,0.9471976,0.013157905,0.011313743,0.007817772,0.0007026027],"about_ca_topic_score_codex":0.000042746506,"about_ca_topic_score_gemma":0.0003359736,"teacher_disagreement_score":0.9603844,"about_ca_system_score_codex":0.00009041054,"about_ca_system_score_gemma":0.000021252361,"threshold_uncertainty_score":0.5253626},"labels":[],"label_agreement":null},{"id":"W2081161271","doi":"10.1109/vetecf.2011.6093260","title":"Source and Relay Power Selection Using Biogeography-Based Optimization for Cognitive Radio Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Integer programming; Mathematical optimization; Computer science; Optimization problem; Selection (genetic algorithm); Cognitive radio; Linear programming; Interference (communication); Binary number; Integer (computer science); Evolutionary algorithm; Power (physics); Algorithm; Mathematics; Artificial intelligence; Telecommunications; Wireless","score_opus":0.05594113745744886,"score_gpt":0.26213559549759435,"score_spread":0.2061944580401455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081161271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009932087,0.00034250016,0.9884397,0.000038852733,0.00010524899,0.00031703635,8.1408007e-7,0.00013146253,0.0006923213],"genre_scores_gemma":[0.8233658,0.00003725584,0.17638074,0.000120049204,0.00001199919,0.000022243757,0.0000033528381,0.000006677483,0.000051893767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993889,0.000095008334,0.00013250277,0.00020059194,0.00006311419,0.00011991547],"domain_scores_gemma":[0.9993954,0.00010023342,0.00006876392,0.00014600233,0.00024348573,0.000046136916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022991057,0.00008233041,0.000086043096,0.00013499853,0.00026895423,0.00011060951,0.000152862,0.000040812425,0.000017730832],"category_scores_gemma":[0.000026546348,0.00007589133,0.000031284282,0.00040002697,0.00003316413,0.0002589381,0.000052377338,0.000048065347,9.538998e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047796607,0.0010651016,0.0743095,0.00020346562,0.0005726991,0.0000028678105,0.017744359,0.51100045,0.006266042,0.28285933,0.001782803,0.10371542],"study_design_scores_gemma":[0.00036245296,0.0000840155,0.00034121197,0.000037786318,0.000008819067,0.0000048507804,0.00006268059,0.99794924,0.0007111609,0.000012995469,0.0003136294,0.00011117295],"about_ca_topic_score_codex":0.00001965851,"about_ca_topic_score_gemma":0.000004955389,"teacher_disagreement_score":0.8134337,"about_ca_system_score_codex":0.000017429478,"about_ca_system_score_gemma":0.000029129806,"threshold_uncertainty_score":0.30947587},"labels":[],"label_agreement":null},{"id":"W2081466378","doi":"10.1109/tvt.2012.2224679","title":"Regenerative Cooperative Diversity Networks With Co-channel Interference: Performance Analysis and Optimal Energy Allocation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Outage probability; Co-channel interference; Computer science; Interference (communication); Performance metric; Monte Carlo method; Fading; Channel (broadcasting); Expression (computer science); Electronic engineering; Mathematical optimization; Topology (electrical circuits); Computer network; Mathematics; Engineering; Electrical engineering; Statistics","score_opus":0.0175557311361746,"score_gpt":0.2351047222473686,"score_spread":0.21754899111119402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081466378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13813993,0.00032732554,0.8606001,0.00049114856,0.000074785115,0.00010201268,0.0000019362476,0.00018213372,0.00008061227],"genre_scores_gemma":[0.9940006,0.001179241,0.0044260174,0.00017622566,0.000015782742,0.0000643799,0.000006119112,0.000007913376,0.00012371334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989112,0.00013649992,0.00016901344,0.0003471716,0.00013916712,0.0002969435],"domain_scores_gemma":[0.99899805,0.000052447333,0.00008182268,0.0005643643,0.0002118049,0.00009153881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017953829,0.00020008192,0.00024356574,0.00053182413,0.0009037898,0.00005530151,0.000503539,0.00016639857,0.000015076888],"category_scores_gemma":[0.000002577364,0.0001729698,0.00005164624,0.0018025007,0.00023380395,0.0005169352,0.00003827947,0.00036543363,0.000004264286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009779608,0.00044747072,0.0019749077,0.0000070948013,0.0013189926,0.000005784428,0.0028806312,0.8723366,0.0012852224,0.017033951,0.000066570734,0.10254493],"study_design_scores_gemma":[0.0004106374,0.00041348752,0.0009038186,0.000026330918,0.00015470201,0.000029084453,0.00016958604,0.9339794,0.06341678,0.000011541454,0.00016209396,0.00032256442],"about_ca_topic_score_codex":0.000011773003,"about_ca_topic_score_gemma":0.00011748691,"teacher_disagreement_score":0.8561741,"about_ca_system_score_codex":0.00007902321,"about_ca_system_score_gemma":0.000026181193,"threshold_uncertainty_score":0.70535034},"labels":[],"label_agreement":null},{"id":"W2081574256","doi":"10.1109/jsac.2012.121026","title":"Jointly Optimal Channel and Power Assignment for Dual-Hop Multi-Channel Multi-User Relaying","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":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"","keywords":"Computer science; Relay; Channel (broadcasting); Mathematical optimization; Optimization problem; Computational complexity theory; Transmission (telecommunications); Integer programming; Hop (telecommunications); Channel allocation schemes; Dual (grammatical number); Computer network; Power (physics); Wireless; Algorithm; Telecommunications; Mathematics","score_opus":0.100493455129988,"score_gpt":0.3370818190684847,"score_spread":0.23658836393849672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081574256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021154415,0.00486836,0.9651942,0.0068785255,0.0006767648,0.00073130033,0.0000096819485,0.00015263053,0.0003340687],"genre_scores_gemma":[0.8930058,0.0032608178,0.10253154,0.00066757627,0.00008139289,0.00013367718,0.000008101181,0.000029290766,0.00028180733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764246,0.0006869902,0.0006158476,0.0002582711,0.00024011974,0.0005562957],"domain_scores_gemma":[0.9964908,0.0008623728,0.00032121563,0.0015105774,0.00051963766,0.0002954408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398819,0.0002586181,0.00029313465,0.00037034514,0.0011535126,0.00028149542,0.0015664039,0.00012160622,0.00000856838],"category_scores_gemma":[0.00037297865,0.0002440177,0.000090739115,0.00076072966,0.00009858231,0.0008487707,0.0005756162,0.0010085558,0.000015242922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010728429,0.045424614,0.026321989,0.0002004001,0.002786506,0.00007694747,0.23276806,0.11680139,0.06943163,0.30892003,0.059446856,0.13674875],"study_design_scores_gemma":[0.0062488453,0.0005287212,0.03278438,0.00068597397,0.000051987703,0.00047486965,0.0010104537,0.917558,0.0019174925,0.00030774777,0.037193853,0.0012376644],"about_ca_topic_score_codex":0.0000039341626,"about_ca_topic_score_gemma":0.000048949994,"teacher_disagreement_score":0.8718514,"about_ca_system_score_codex":0.0002601881,"about_ca_system_score_gemma":0.00011842019,"threshold_uncertainty_score":0.99507535},"labels":[],"label_agreement":null},{"id":"W2081612410","doi":"10.1109/wimob.2010.5644859","title":"Power allocation for non-regenerative relaying in cognitive radio systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cognitive radio; Computer science; Interference (communication); Constraint (computer-aided design); Signal-to-noise ratio (imaging); Computational complexity theory; Power (physics); Mathematical optimization; Computer network; Telecommunications; Algorithm; Wireless; Engineering; Mathematics; Channel (broadcasting)","score_opus":0.039205057425713744,"score_gpt":0.3039540949155698,"score_spread":0.26474903748985606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081612410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058412705,0.00014813348,0.92727685,0.0009479032,0.0006463214,0.0006240916,0.000001041916,0.000073884046,0.011869058],"genre_scores_gemma":[0.9846311,0.000034071014,0.013929357,0.00022683362,0.00004745458,0.000177537,0.0000063234725,0.000006338877,0.00094093406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923366,0.00006613006,0.00020215691,0.00024551767,0.00009019682,0.00016236008],"domain_scores_gemma":[0.99897397,0.0003167701,0.0000606103,0.00034009822,0.0002610714,0.000047513648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039631577,0.00009399924,0.000118815,0.00009908196,0.00015719616,0.00015440656,0.0004415544,0.00005547957,0.000019102854],"category_scores_gemma":[0.000124717,0.000084309846,0.000030374715,0.0003089466,0.000027838909,0.00039423726,0.00011999691,0.00018612064,0.00001649029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018522725,0.00013733745,0.0011604289,0.000010884644,0.00003029729,0.0000021550973,0.006904268,0.00035007938,0.061113257,0.9009846,0.0029032833,0.026384924],"study_design_scores_gemma":[0.0013307667,0.000108318265,0.004266091,0.00010012871,0.0000037812633,0.000009799564,0.0004903379,0.97592545,0.011305788,0.0003365731,0.0057587107,0.00036426503],"about_ca_topic_score_codex":0.00000909708,"about_ca_topic_score_gemma":0.00017110183,"teacher_disagreement_score":0.9755754,"about_ca_system_score_codex":0.000029457626,"about_ca_system_score_gemma":0.00006469931,"threshold_uncertainty_score":0.34380558},"labels":[],"label_agreement":null},{"id":"W2081761679","doi":"10.1587/transcom.e95.b.3047","title":"Cooperation-Aware Topology Control for Wireless Ad Hoc Networks with Opportunistic Interference Cancellation","year":2012,"lang":"en","type":"article","venue":"IEICE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Single antenna interference cancellation; Wireless network; Interference (communication); Mobile ad hoc network; Topology control; Network topology; Wireless; Distributed computing; Channel (broadcasting); Topology (electrical circuits); Telecommunications; Key distribution in wireless sensor networks; Network packet","score_opus":0.06007559752134188,"score_gpt":0.3054935366031841,"score_spread":0.24541793908184223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081761679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002604989,0.0014524488,0.988676,0.007505495,0.0002911489,0.00071682263,0.000034321525,0.00022595598,0.0008372669],"genre_scores_gemma":[0.97230583,0.004127091,0.021283114,0.001015118,0.000042569653,0.00072062685,0.00007203212,0.000023256567,0.00041037085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984458,0.00036812783,0.00038406998,0.00028284147,0.00012920034,0.00038994453],"domain_scores_gemma":[0.9956942,0.0011038656,0.00016732508,0.0023760588,0.00047322232,0.00018529489],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00039705198,0.00022606476,0.00024671183,0.00014514386,0.0013380855,0.00014526585,0.0016781732,0.00010557028,0.000064825275],"category_scores_gemma":[0.00001742094,0.00021350147,0.000077415185,0.00055233017,0.00021005908,0.00065403694,0.00004038562,0.00042095524,0.000021422433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023608503,0.0014402857,0.00028442938,0.000031310054,0.00030091594,7.0973005e-7,0.0039252103,0.032836054,0.00061257364,0.28884828,0.0010428564,0.6704413],"study_design_scores_gemma":[0.0014310887,0.0003782001,0.00039637927,0.00010412204,0.00008636822,0.000022890097,0.00023905987,0.9535785,0.00016521044,0.000107115164,0.043006945,0.00048412985],"about_ca_topic_score_codex":0.0000090748445,"about_ca_topic_score_gemma":0.00097289425,"teacher_disagreement_score":0.9720453,"about_ca_system_score_codex":0.00014641446,"about_ca_system_score_gemma":0.0001634625,"threshold_uncertainty_score":0.99996203},"labels":[],"label_agreement":null},{"id":"W2082018198","doi":"10.1049/iet-com.2013.1145","title":"Spectrum‐sharing broadcast channels using fountain codes: energy, delay and throughput","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Fountain code; Throughput; Fountain; Computer science; Computer network; Telecommunications; Decoding methods; Wireless; Low-density parity-check code; Error floor","score_opus":0.07419073768560554,"score_gpt":0.31534483794888885,"score_spread":0.24115410026328332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082018198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048688413,0.0030532894,0.97633785,0.0048619653,0.0001512769,0.00012907549,0.0000021840506,0.00023796693,0.010357557],"genre_scores_gemma":[0.9273436,0.0036624188,0.0677961,0.0008616585,0.000067312205,0.00002732627,0.000012868145,0.000016478767,0.00021220406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985869,0.00035032938,0.0003062668,0.0003363674,0.00014281187,0.0002773377],"domain_scores_gemma":[0.99562585,0.00036871523,0.00013130545,0.0036504704,0.00011231999,0.00011133699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057701307,0.00017325535,0.00020406714,0.00011891088,0.0010484305,0.00041277095,0.0031349943,0.00006222514,0.0000141449145],"category_scores_gemma":[0.00006412975,0.00018242384,0.000052586198,0.00052626734,0.00019164309,0.00053637003,0.0032502871,0.00025050147,0.000014900898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021221445,0.000072476425,0.00049617066,0.0000049818736,0.000028853796,5.013848e-7,0.0015928907,0.0007052404,0.00060123776,0.94851655,0.0002585663,0.047720414],"study_design_scores_gemma":[0.00024049544,0.000030061323,0.0002728568,0.00006452484,0.000009814305,0.00003446023,0.00004955151,0.8836791,0.00020131539,0.008767349,0.10640837,0.00024210605],"about_ca_topic_score_codex":0.00018807936,"about_ca_topic_score_gemma":0.00056904403,"teacher_disagreement_score":0.9397492,"about_ca_system_score_codex":0.00007451445,"about_ca_system_score_gemma":0.000043150725,"threshold_uncertainty_score":0.80637854},"labels":[],"label_agreement":null},{"id":"W2082046404","doi":"10.1109/icc.2012.6364099","title":"Exact analytical solution for AF relaying systems with full selection diversity","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Fading; Independent and identically distributed random variables; Relay; Cumulative distribution function; Probability density function; Computer science; Signal-to-noise ratio (imaging); Diversity combining; Selection (genetic algorithm); Maximal-ratio combining; Path (computing); Topology (electrical circuits); Algorithm; Mathematics; Random variable; Statistics; Telecommunications; Computer network; Decoding methods; Physics; Combinatorics","score_opus":0.07043719531524506,"score_gpt":0.28265583993159993,"score_spread":0.21221864461635487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082046404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011420034,0.00015482298,0.9848215,0.0003577179,0.00014922442,0.0001691607,2.0346644e-7,0.000131321,0.002795988],"genre_scores_gemma":[0.98126835,0.000024332163,0.018070126,0.00006970925,0.000076516,0.000011141196,0.0000016324465,0.0000029921646,0.00047523397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938977,0.00007155111,0.00008952392,0.0001297073,0.00011499967,0.00020445134],"domain_scores_gemma":[0.99945474,0.00009222133,0.00004044239,0.00021491511,0.00012232157,0.000075353746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041025906,0.00006481911,0.00007949277,0.000050450883,0.0005731779,0.000079455465,0.0002590637,0.00003088618,0.00000936833],"category_scores_gemma":[0.000019036013,0.000051171523,0.000026562491,0.00027643924,0.000015908565,0.0006257978,0.00029142638,0.000073010226,0.00001338957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010993009,0.00028447286,0.072554186,0.000046440553,0.00012518807,5.4916296e-7,0.0026895425,0.0016753929,0.0015950912,0.8609367,0.011871095,0.04811143],"study_design_scores_gemma":[0.00023930089,0.00009560023,0.004674104,0.000014996708,0.000010970824,0.000012599739,0.00003968784,0.9902482,0.000083326304,0.000017366287,0.0044477778,0.00011604701],"about_ca_topic_score_codex":0.000013688345,"about_ca_topic_score_gemma":0.00002780281,"teacher_disagreement_score":0.98857284,"about_ca_system_score_codex":0.00009072956,"about_ca_system_score_gemma":0.000017270377,"threshold_uncertainty_score":0.44084787},"labels":[],"label_agreement":null},{"id":"W2082367810","doi":"10.1007/s11277-010-9972-0","title":"Cooperative Subcarrier Allocation for an OFDM Relaying System with Grouped Users","year":2010,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Iran University of Science and Technology","keywords":"Subcarrier; Computer science; Throughput; Telecommunications link; Orthogonal frequency-division multiplexing; Base station; Channel (broadcasting); Computer network; Wireless; Mathematical optimization; Algorithm; Telecommunications; Mathematics","score_opus":0.055355544923359035,"score_gpt":0.30214396274747196,"score_spread":0.24678841782411293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082367810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24715726,0.000346187,0.73873216,0.006433258,0.00029154055,0.0013338855,0.000030085086,0.0007293828,0.004946259],"genre_scores_gemma":[0.9424058,0.000118032156,0.056250006,0.00031143826,0.00006099773,0.0005237716,0.00013722733,0.000030127512,0.00016255875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998344,0.00034583994,0.00033041352,0.00042527157,0.00025323418,0.0003012564],"domain_scores_gemma":[0.9954688,0.00044941527,0.00018061913,0.0028538713,0.0008627309,0.00018459678],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00068986847,0.00022989632,0.0002396047,0.00012870666,0.0017635536,0.00035998248,0.0030611171,0.00010936853,0.000007907278],"category_scores_gemma":[0.00005306637,0.00020975163,0.00007293928,0.00063092995,0.0002839184,0.0010766994,0.00046846143,0.00059134496,0.0000143821935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033483935,0.00017160535,0.00065896916,0.000022054663,0.000060730832,5.396698e-7,0.008107288,0.00007811392,0.019799525,0.95381814,0.0002277643,0.01702181],"study_design_scores_gemma":[0.0010171693,0.00026413065,0.0020654642,0.00010363202,0.000030773997,0.0000440603,0.0027576468,0.98147273,0.000795843,0.00007876912,0.0108341705,0.0005356195],"about_ca_topic_score_codex":0.00004857647,"about_ca_topic_score_gemma":0.0024412575,"teacher_disagreement_score":0.9813946,"about_ca_system_score_codex":0.00010539911,"about_ca_system_score_gemma":0.00025056445,"threshold_uncertainty_score":0.99953604},"labels":[],"label_agreement":null},{"id":"W2082648454","doi":"10.1109/wcnc.2010.5506286","title":"Distortion Exponents for Multi-Relay Cooperative Networks with Limited Feedback","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Distortion (music); Exponent; Relay channel; Gaussian; Control theory (sociology); Topology (electrical circuits); Transmission (telecommunications); Signal-to-noise ratio (imaging); Decoding methods; Channel state information; Bandwidth (computing); Algorithm; Mathematics; Wireless; Telecommunications; Artificial intelligence; Physics","score_opus":0.0472836734942756,"score_gpt":0.2858506932108265,"score_spread":0.23856701971655092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082648454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016892795,0.000065470296,0.9804255,0.0006652117,0.00036257936,0.00043285207,9.1039163e-7,0.00019039042,0.0009643154],"genre_scores_gemma":[0.8295579,0.00006168936,0.16789381,0.00051153515,0.00006576465,0.000111660636,0.000018300769,0.00001176729,0.0017676045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999104,0.00006136895,0.00018556166,0.00031132967,0.0001102404,0.00022748562],"domain_scores_gemma":[0.99872476,0.00012281876,0.000075748605,0.0006402131,0.00033430153,0.00010214224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021327958,0.00014586716,0.00013502588,0.000050885214,0.00036183806,0.00017321859,0.0006600469,0.000067509165,0.0000415383],"category_scores_gemma":[0.000048356746,0.00010783117,0.000040744464,0.0003459447,0.000063571264,0.0004139191,0.0001772656,0.00024716137,0.000018859962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033545855,0.0016426845,0.009335068,0.000024040557,0.00027664012,0.000008419141,0.0048764497,0.036029264,0.02524976,0.49351293,0.021878218,0.4068311],"study_design_scores_gemma":[0.0010875813,0.00012859803,0.0053139487,0.000016023552,0.0000051589004,0.000004472415,0.000021859036,0.98312426,0.0012282202,0.000010879005,0.008834326,0.00022466786],"about_ca_topic_score_codex":0.0000049690925,"about_ca_topic_score_gemma":0.0007015169,"teacher_disagreement_score":0.947095,"about_ca_system_score_codex":0.000025581752,"about_ca_system_score_gemma":0.000038467268,"threshold_uncertainty_score":0.43972275},"labels":[],"label_agreement":null},{"id":"W2082688210","doi":"10.1109/icc.2011.5962599","title":"Capacity Bounds and Lattice Coding for the Star Relay Network","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Linear network coding; Upper and lower bounds; Computer science; Lattice (music); Coding (social sciences); Wireless; Relay channel; Topology (electrical circuits); Computer network; Wireless network; Mathematics; Telecommunications; Combinatorics; Physics; Network packet; Statistics","score_opus":0.12825961829238652,"score_gpt":0.27373006615590767,"score_spread":0.14547044786352115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082688210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056636417,0.000912623,0.97892886,0.001896132,0.0002383252,0.00021733239,4.131897e-7,0.00010539184,0.012037253],"genre_scores_gemma":[0.8306984,0.0007126925,0.16642183,0.0013866108,0.00007281976,0.000026681004,3.411992e-7,0.0000049145597,0.0006757365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994406,0.00006597325,0.00011125857,0.0001510879,0.000061013518,0.00017002938],"domain_scores_gemma":[0.998894,0.00047081793,0.00003750661,0.0004792537,0.00007566926,0.00004278255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061223184,0.000068205234,0.00007112334,0.00001313592,0.00059632957,0.000120140394,0.00057960197,0.000023763043,0.000031600623],"category_scores_gemma":[0.000042582487,0.000044789726,0.000025205349,0.00016686655,0.000065810076,0.00022054704,0.0002973313,0.00009601989,0.0000052670966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043053915,0.000010270393,0.0005832121,0.0000023130556,0.000015816864,1.7580734e-7,0.0019631176,0.000016786813,0.00003071,0.96908975,0.0038537667,0.024429804],"study_design_scores_gemma":[0.00048470378,0.00011850084,0.01962664,0.000032746386,0.000020985362,0.000011244055,0.00011714184,0.79310197,0.00035985583,0.014110357,0.1717085,0.00030735988],"about_ca_topic_score_codex":0.000013329841,"about_ca_topic_score_gemma":0.00012435879,"teacher_disagreement_score":0.95497936,"about_ca_system_score_codex":0.000011748759,"about_ca_system_score_gemma":0.000015243312,"threshold_uncertainty_score":0.4586545},"labels":[],"label_agreement":null},{"id":"W2083185260","doi":"10.1109/glocom.2006.806","title":"WLC33-2: On Relaying in Cooperative Static Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Signal-to-noise ratio (imaging); Channel (broadcasting); Maximal-ratio combining; Outage probability; Power (physics); Electronic engineering; Computer network; Topology (electrical circuits); Telecommunications; Engineering; Fading; Electrical engineering; Physics","score_opus":0.027398959412582292,"score_gpt":0.2714228325759955,"score_spread":0.24402387316341317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083185260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38234803,0.0016986768,0.46431503,0.017584143,0.0015185772,0.0009769885,0.000006445543,0.00063800055,0.13091412],"genre_scores_gemma":[0.9951265,0.00007957516,0.0029447307,0.001049909,0.000049283753,0.000023349492,0.000005324189,0.00000627143,0.00071507227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989827,0.00017046134,0.00022383865,0.00025572535,0.00013699378,0.00023028272],"domain_scores_gemma":[0.9992169,0.00015006182,0.000050549534,0.00048440474,0.000060419545,0.000037628044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024907026,0.00011677022,0.00013795834,0.00011075885,0.00015151643,0.00014757211,0.0006015228,0.000033144588,0.00003916787],"category_scores_gemma":[0.000036084257,0.000109930996,0.000028258844,0.00057024346,0.00002569304,0.00025350027,0.00020275434,0.00018017089,0.00016695725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144135465,0.00032445448,0.002442281,0.00000839818,0.000011385071,0.000046139998,0.0017210434,0.03695279,0.00064657046,0.87836945,0.01748329,0.0619798],"study_design_scores_gemma":[0.0029317355,0.00044534204,0.039764054,0.00042251823,0.000005941762,0.000021447662,0.00020404611,0.8385954,0.003795455,0.01684601,0.095758855,0.0012091834],"about_ca_topic_score_codex":0.00004626668,"about_ca_topic_score_gemma":0.00020570021,"teacher_disagreement_score":0.86152345,"about_ca_system_score_codex":0.000100621284,"about_ca_system_score_gemma":0.00004073722,"threshold_uncertainty_score":0.44828558},"labels":[],"label_agreement":null},{"id":"W2083493426","doi":"10.1109/bsc.2010.5472977","title":"Design and performance analysis of distributed relay selection techniques in wireless networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Institut National de la Recherche Scientifique","funders":"","keywords":"Relay; Computer science; Relay channel; Node (physics); Fading; Computer network; Selection (genetic algorithm); Wireless; Transmission (telecommunications); Efficient energy use; Channel (broadcasting); Outage probability; Wireless network; Wireless sensor network; Energy (signal processing); Power (physics); Topology (electrical circuits); Telecommunications; Engineering; Mathematics; Electrical engineering; Statistics","score_opus":0.01878735804433734,"score_gpt":0.25842066125731494,"score_spread":0.2396333032129776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083493426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27133137,0.000015440863,0.7283388,0.00007536549,0.000014800886,0.00006373066,8.7353044e-8,0.000052031897,0.00010836894],"genre_scores_gemma":[0.9486396,0.00044167173,0.050846245,0.000031265612,0.0000049255477,0.000010789273,0.0000031361699,0.0000018056752,0.000020597345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994714,0.00008150579,0.00016095325,0.00013664666,0.000057938338,0.00009154249],"domain_scores_gemma":[0.999485,0.00010160564,0.000054110627,0.00025185253,0.0000831124,0.00002431484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046379573,0.000056728855,0.00012687672,0.00018803893,0.00006434347,0.000035302128,0.00027660432,0.00004820421,0.000010873397],"category_scores_gemma":[0.000010604221,0.00004985618,0.000018142127,0.0018411388,0.00003181528,0.000207659,0.00011851395,0.00017793341,2.1585956e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030608437,0.0001444314,0.22741218,0.000008480129,0.00015277354,7.5096324e-7,0.00054884126,0.036417294,0.028725335,0.058677014,0.00023323703,0.64764905],"study_design_scores_gemma":[0.000044573302,0.00002760151,0.061785642,0.000005778946,0.000010265407,8.732226e-7,0.0000016581123,0.9302143,0.007788648,0.000008630732,0.00005568005,0.000056358374],"about_ca_topic_score_codex":0.000008569979,"about_ca_topic_score_gemma":0.00020052078,"teacher_disagreement_score":0.893797,"about_ca_system_score_codex":0.000011565543,"about_ca_system_score_gemma":0.000014656361,"threshold_uncertainty_score":0.2033076},"labels":[],"label_agreement":null},{"id":"W2083650357","doi":"10.1109/wcnc.2013.6555162","title":"Performance of distributed turbo-coded cooperative networks with multiple dual-hop relays over Nakagami-m fading channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Pairwise error probability; Fading; Nakagami distribution; Computer science; Turbo code; Algorithm; Bit error rate; Turbo; Hop (telecommunications); Topology (electrical circuits); Electronic engineering; Computer network; Mathematics; Decoding methods; Engineering","score_opus":0.018779300488297727,"score_gpt":0.2319622037256982,"score_spread":0.21318290323740047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083650357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5222131,0.00018554092,0.47415456,0.0004640592,0.00017674862,0.0006703362,0.0000031274694,0.00019831576,0.0019341841],"genre_scores_gemma":[0.99172425,0.00030897392,0.00687627,0.000285114,0.000050695056,0.00011681056,0.000026318641,0.000015659449,0.0005958796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846584,0.0001481398,0.0003778041,0.00038333327,0.00024053903,0.00038432688],"domain_scores_gemma":[0.99806696,0.00027528874,0.0001706207,0.0008471639,0.00051082054,0.00012914017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024375407,0.00024293081,0.00030687408,0.00008655701,0.00031697916,0.00018518149,0.0007707367,0.00007953251,0.00019411673],"category_scores_gemma":[0.000048958027,0.00017971496,0.000052374984,0.0009283502,0.00011791056,0.0010673897,0.00051724294,0.0002796642,0.000039052746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017301833,0.0005726987,0.046508472,0.00006994646,0.00036107618,0.00001292437,0.0068785227,0.8401798,0.011051449,0.028063614,0.015219619,0.050908837],"study_design_scores_gemma":[0.00078606117,0.00019409228,0.010378201,0.00009577177,0.00000532045,0.0000074982613,0.00005327239,0.9833104,0.0043338086,0.0000093755825,0.0005495862,0.00027660385],"about_ca_topic_score_codex":0.000029657904,"about_ca_topic_score_gemma":0.00004010056,"teacher_disagreement_score":0.46951115,"about_ca_system_score_codex":0.000059198042,"about_ca_system_score_gemma":0.00005260515,"threshold_uncertainty_score":0.73285633},"labels":[],"label_agreement":null},{"id":"W2083650523","doi":"10.1109/ciss.2013.6552262","title":"A partial decode-forward scheme for a network with N relays","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Linear network coding; Decoding methods; Upper and lower bounds; Computer science; Topology (electrical circuits); Block (permutation group theory); Markov chain; Gaussian; Relay channel; Computer network; Encoding (memory); Scheme (mathematics); Markov process; Network topology; Power (physics); Mathematics; Algorithm; Network packet; Combinatorics","score_opus":0.029409934013046493,"score_gpt":0.2608344890259209,"score_spread":0.2314245550128744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083650523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029939746,0.00015656702,0.98453826,0.0037159403,0.00008185771,0.0005637393,1.6590268e-7,0.00018286235,0.0077666175],"genre_scores_gemma":[0.41780594,0.00007062519,0.5777092,0.0017694314,0.00013663936,0.0005816943,0.0000025461566,0.000010131139,0.001913796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921507,0.000039593524,0.00014978698,0.00022295814,0.00009512994,0.00027746172],"domain_scores_gemma":[0.99896336,0.00013261959,0.000046186462,0.0006019354,0.00016376039,0.000092140464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018753966,0.000097142896,0.00011203082,0.000023191164,0.00022964904,0.00020193258,0.00065188523,0.00003085234,0.00014392592],"category_scores_gemma":[0.00002072,0.000069944595,0.00004014061,0.00029152463,0.00002726155,0.00041290707,0.00023162509,0.0000807309,0.0001308336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000176735,0.000058970614,0.002065442,0.0000066725916,0.000047697784,8.1686585e-7,0.00038965093,0.0010684574,0.00026695582,0.75371903,0.113960005,0.12839861],"study_design_scores_gemma":[0.00056464976,0.00015963314,0.00083957595,0.00002503397,0.0000035254145,0.000005575551,0.0000132047235,0.8447514,0.0003146832,0.0023296112,0.15077417,0.00021893517],"about_ca_topic_score_codex":0.0000052750192,"about_ca_topic_score_gemma":0.000051347248,"teacher_disagreement_score":0.84368294,"about_ca_system_score_codex":0.000017239618,"about_ca_system_score_gemma":0.000045414516,"threshold_uncertainty_score":0.28522578},"labels":[],"label_agreement":null},{"id":"W2083774384","doi":"10.1109/glocom.2011.6133660","title":"Adaptive Modulation for Multiuser Amplify-and-Forward Relay Networks with Feedback Delays","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Upper and lower bounds; Fading; Nakagami distribution; Cumulative distribution function; Moment-generating function; Relay; Control theory (sociology); Probability density function; Quadrature amplitude modulation; Link adaptation; Computer science; Mathematics; Modulation (music); Bit error rate; Topology (electrical circuits); Algorithm; Statistics; Decoding methods; Physics; Mathematical analysis","score_opus":0.06771083576099664,"score_gpt":0.25201942521249787,"score_spread":0.18430858945150125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083774384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033178735,0.00011366521,0.9912913,0.00018846232,0.00006435354,0.00034146736,6.266525e-7,0.00013407794,0.0045481944],"genre_scores_gemma":[0.70735663,0.000109696986,0.29173926,0.00030868073,0.000023913197,0.000047653026,0.0000045407896,0.000008528517,0.00040109863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992211,0.0000556877,0.00015904625,0.00028231498,0.00008459523,0.00019726295],"domain_scores_gemma":[0.9990717,0.00012605429,0.0000695344,0.00047218005,0.0001783531,0.00008213518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019064262,0.00012462177,0.00012357038,0.000047729194,0.00022605929,0.00006728535,0.00039380844,0.000059143495,0.00003513699],"category_scores_gemma":[0.000012289391,0.000094104915,0.000028467573,0.00020861144,0.000046154582,0.0004290491,0.00020124252,0.000115206865,0.000015106699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022051956,0.00013298346,0.0033284372,0.0000073322044,0.00011222012,0.0000018416022,0.0050655175,0.02054283,0.00008001673,0.6812455,0.0030872184,0.28617558],"study_design_scores_gemma":[0.0005217501,0.00017766596,0.0063293283,0.000016495667,0.00000659246,0.0000042711076,0.000048093905,0.9902633,0.00009100632,0.0004814999,0.0018872869,0.00017270005],"about_ca_topic_score_codex":0.00001424728,"about_ca_topic_score_gemma":0.00013370343,"teacher_disagreement_score":0.9697205,"about_ca_system_score_codex":0.000022486112,"about_ca_system_score_gemma":0.000019283918,"threshold_uncertainty_score":0.3837487},"labels":[],"label_agreement":null},{"id":"W2083786914","doi":"10.1109/netcod.2008.4476191","title":"Joint Network Coding and Subcarrier Assignment in OFDIMA-Based WVireless Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Subcarrier; Computer science; Telecommunications link; Computer network; Linear network coding; Orthogonal frequency-division multiplexing; Orthogonal frequency-division multiple access; Spectral efficiency; Wireless network; Frequency-division multiple access; Wireless; Channel (broadcasting); Telecommunications; Network packet","score_opus":0.05058455333114939,"score_gpt":0.24683921989195437,"score_spread":0.19625466656080498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083786914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016404118,0.0008440953,0.9768398,0.001370977,0.00016898348,0.00018225737,1.3375066e-7,0.000121535224,0.00406813],"genre_scores_gemma":[0.9825749,0.0010790409,0.014455963,0.0015475414,0.00006443402,0.000024419285,0.0000019353718,0.000008534088,0.00024327285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865705,0.00020473282,0.00029826188,0.00032442284,0.00016844641,0.0003471118],"domain_scores_gemma":[0.99906266,0.00016242072,0.00006667424,0.000543144,0.0000519001,0.0001132234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137054,0.00014917442,0.00021147197,0.00007746606,0.0003217269,0.00008997738,0.0004465328,0.0000589723,0.000039175764],"category_scores_gemma":[0.000018764717,0.00013641737,0.000037758906,0.00056139956,0.000080989346,0.00022602775,0.00038079763,0.00023229964,0.000005717481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039016628,0.00028424137,0.104887255,0.000020175294,0.000044219425,0.00013759724,0.0017317137,0.24231069,0.0006841056,0.50735337,0.018741582,0.12376604],"study_design_scores_gemma":[0.0005395107,0.000037037036,0.027253605,0.000053177366,0.0000014684741,0.00001130603,0.000010932637,0.969064,0.00016024473,0.00016207085,0.0024890143,0.00021761288],"about_ca_topic_score_codex":0.0000110170995,"about_ca_topic_score_gemma":0.000084648156,"teacher_disagreement_score":0.9661707,"about_ca_system_score_codex":0.00007206059,"about_ca_system_score_gemma":0.0000619045,"threshold_uncertainty_score":0.5562939},"labels":[],"label_agreement":null},{"id":"W2083960084","doi":"10.1109/wcsp.2010.5633639","title":"Non-regenerative MIMO relaying strategies &amp;#x2014; from single to multiple cooperative relays","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; MIMO; Computer science; Bit error rate; Signal-to-noise ratio (imaging); Channel (broadcasting); Ergodic theory; Relay channel; Algorithm; Maximal-ratio combining; Electronic engineering; Decoding methods; Control theory (sociology); Telecommunications; Mathematics; Engineering; Fading; Power (physics); Artificial intelligence","score_opus":0.04914830929887065,"score_gpt":0.2874819199111721,"score_spread":0.23833361061230146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083960084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22754832,0.000101909056,0.74760544,0.0023772684,0.0006847309,0.00044679956,0.0000062962563,0.00027303043,0.020956215],"genre_scores_gemma":[0.7446648,0.000028246497,0.2525404,0.0010398892,0.00014731505,0.00007688934,0.000019592524,0.000016373862,0.0014665233],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982269,0.00014479055,0.00036652348,0.00064384483,0.00024561994,0.00037236823],"domain_scores_gemma":[0.99738085,0.00046664188,0.000092773604,0.001391301,0.0004273924,0.00024101886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024704056,0.00028425088,0.0002767102,0.00012649238,0.0006123613,0.00080083526,0.0014560864,0.00012011598,0.00031584865],"category_scores_gemma":[0.00021428954,0.00024693014,0.00007391967,0.0006562381,0.0000876443,0.0010837723,0.0008200648,0.0005490754,0.00064019],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012783705,0.00013778685,0.00046570692,0.0000015918647,0.00003721113,0.0000025014317,0.007793518,0.001371812,0.889953,0.07941227,0.007218565,0.013593235],"study_design_scores_gemma":[0.0026631223,0.0006184701,0.008730987,0.00018970725,0.000031285515,0.000022080794,0.0026230214,0.2607269,0.3094664,0.003008495,0.40909073,0.0028288085],"about_ca_topic_score_codex":0.00014702097,"about_ca_topic_score_gemma":0.009043317,"teacher_disagreement_score":0.5804866,"about_ca_system_score_codex":0.00005301368,"about_ca_system_score_gemma":0.00017432022,"threshold_uncertainty_score":0.9999983},"labels":[],"label_agreement":null},{"id":"W2083986470","doi":"10.1109/twc.2012.032712.111437","title":"Cooperative Beamforming for Single-Carrier Frequency-Domain Equalization Systems with Multiple Relays","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Beamforming; Robustness (evolution); Computer science; Frequency domain; Convex optimization; Equalization (audio); Mathematical optimization; Channel state information; Minimum mean square error; Wireless; Control theory (sociology); Channel (broadcasting); Power (physics); Mathematics; Telecommunications; Regular polygon","score_opus":0.06789264777136858,"score_gpt":0.2866597786971274,"score_spread":0.2187671309257588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083986470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027249923,0.00071595545,0.9915948,0.0010702484,0.00040974157,0.0013605134,0.000056179793,0.000337262,0.0017303145],"genre_scores_gemma":[0.89457804,0.00046950267,0.10295523,0.0001939019,0.000041568597,0.0015323883,0.000044702458,0.000040633768,0.00014404106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979372,0.00050143007,0.0005042546,0.00032521578,0.0002650582,0.0004668443],"domain_scores_gemma":[0.9952212,0.0011187822,0.00022018739,0.002731184,0.0005066486,0.00020199099],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005782115,0.0002878977,0.0002941915,0.00023152848,0.0018624469,0.00024392111,0.0017917122,0.0001233298,0.000010119537],"category_scores_gemma":[0.000023108014,0.00026711522,0.000104477156,0.0009511181,0.0002020032,0.0013738988,0.000029053404,0.00039774354,0.000021501988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011285519,0.0031961708,0.0006132235,0.000097529046,0.0004880912,0.000001057181,0.025597258,0.055433705,0.05626011,0.8097253,0.00035447552,0.048120268],"study_design_scores_gemma":[0.004387231,0.0010204383,0.00016207255,0.0008348476,0.0001756383,0.000120414275,0.0032323936,0.9252193,0.029608212,0.0005937412,0.032501157,0.0021445844],"about_ca_topic_score_codex":0.00002580555,"about_ca_topic_score_gemma":0.0002801784,"teacher_disagreement_score":0.89185303,"about_ca_system_score_codex":0.00026767253,"about_ca_system_score_gemma":0.00011892029,"threshold_uncertainty_score":0.9999781},"labels":[],"label_agreement":null},{"id":"W2084183558","doi":"10.1109/ciss.2010.5464924","title":"Comprehensive node selection and power allocation in multi-source cooperative mesh networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Resource allocation; Mathematical optimization; Node (physics); Upper and lower bounds; Transmission (telecommunications); Power (physics); Computer network; Mathematics; Telecommunications; Engineering","score_opus":0.030976575172163047,"score_gpt":0.2842867174157925,"score_spread":0.2533101422436294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084183558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09394555,0.000109963315,0.9032961,0.0010520491,0.00017386736,0.0002091289,1.1663601e-7,0.00012337696,0.0010898333],"genre_scores_gemma":[0.9693873,0.00022001943,0.029006764,0.0009539559,0.000018973946,0.000019093268,0.000002558743,0.0000068291215,0.00038449952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912155,0.00014473643,0.00018479259,0.00028968108,0.0000849956,0.00017422158],"domain_scores_gemma":[0.99918216,0.00014073984,0.00004732282,0.0003168174,0.00024694757,0.00006598388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018936397,0.00012150478,0.00012529561,0.00009334566,0.00019257695,0.00015850183,0.00033160063,0.0000772177,0.000045022916],"category_scores_gemma":[0.000037929498,0.000111951646,0.000017179715,0.00050517626,0.000048960508,0.00039291967,0.000249055,0.00038733467,0.000011489267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053412852,0.0007211442,0.025367992,0.000016075473,0.00008280457,0.0000060074703,0.013920605,0.03374816,0.14388713,0.5328987,0.0039578103,0.2453401],"study_design_scores_gemma":[0.00044257028,0.000029045348,0.023079358,0.0000092902255,0.0000011413556,0.000009793473,0.000060299764,0.970008,0.0007500565,0.00001845824,0.0054406365,0.00015134535],"about_ca_topic_score_codex":0.000027564813,"about_ca_topic_score_gemma":0.0014930002,"teacher_disagreement_score":0.93625987,"about_ca_system_score_codex":0.000023636085,"about_ca_system_score_gemma":0.000030525312,"threshold_uncertainty_score":0.45652556},"labels":[],"label_agreement":null},{"id":"W2084388335","doi":"10.1109/milcom.2006.302140","title":"Joint Optimization of Relay-Precoders and Decoders with Partial Channel Side Information in Cooperative Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Decoding methods; Joint (building); Channel (broadcasting); Channel state information; Relay channel; Terminal (telecommunication); Selection (genetic algorithm); Computer network; Algorithm; Telecommunications; Wireless; Artificial intelligence; Engineering","score_opus":0.01643086403895501,"score_gpt":0.2204247553558829,"score_spread":0.2039938913169279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084388335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006844682,0.00009648427,0.98907423,0.00063007674,0.00003473769,0.00019463018,3.3772506e-7,0.00004357396,0.0030812402],"genre_scores_gemma":[0.96371424,0.0002851716,0.035700332,0.00021950805,0.000010419401,0.00001801776,0.000013578628,0.0000035531164,0.000035188015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992419,0.000088826826,0.000307186,0.00012661975,0.00009965554,0.00013584358],"domain_scores_gemma":[0.99942696,0.000056574747,0.00011365986,0.00022778311,0.00014396179,0.00003108436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022322117,0.00009520177,0.00013349247,0.000119772034,0.000086006556,0.00008842057,0.00017388773,0.00004181748,0.000009086968],"category_scores_gemma":[0.000019867119,0.000078676036,0.0000132556115,0.00042150824,0.000056276946,0.0011154249,0.00012414146,0.00009660234,0.0000010786054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010916372,0.00001726319,0.00028805961,0.0000025709253,0.0000037750413,2.7451634e-7,0.0004364718,0.98248917,0.000008396243,0.012743374,0.00011237269,0.003887327],"study_design_scores_gemma":[0.0005335475,0.00006247912,0.0011279183,0.000033277604,0.000001937004,0.0000028782276,0.0001050654,0.99754363,0.00036309694,0.00003927839,0.00008170529,0.00010516585],"about_ca_topic_score_codex":0.00006630707,"about_ca_topic_score_gemma":0.00047295398,"teacher_disagreement_score":0.95686954,"about_ca_system_score_codex":0.0000282408,"about_ca_system_score_gemma":0.00003837041,"threshold_uncertainty_score":0.32083157},"labels":[],"label_agreement":null},{"id":"W2085328157","doi":"10.1109/icc.2012.6364405","title":"Toward neighborhood prediction using Physical-Layer Network Coding","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Linear network coding; Wireless ad hoc network; Coding (social sciences); Node (physics); Computer network; Physical layer; Engineering; Telecommunications; Wireless","score_opus":0.11409212990239485,"score_gpt":0.31171179829551043,"score_spread":0.19761966839311557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085328157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018109217,0.0004370334,0.96348727,0.00039483997,0.00065729156,0.000113616814,3.7829201e-7,0.00029961692,0.01650071],"genre_scores_gemma":[0.9806606,0.000107811866,0.017728519,0.0004888923,0.0008671688,0.000006947068,0.0000016567182,0.000008413169,0.00012999574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900836,0.000116062256,0.00015695131,0.00017675546,0.00016382536,0.00037801897],"domain_scores_gemma":[0.999152,0.000090239424,0.00005805218,0.00050242344,0.00007081975,0.00012646515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003009793,0.00011718166,0.00012665831,0.000038293027,0.00028536504,0.00012105994,0.0005076011,0.000034422672,0.000048727677],"category_scores_gemma":[0.000019188332,0.000102975755,0.000057687117,0.0004961446,0.00002090494,0.0009973119,0.00043904423,0.00014578996,0.00005657596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042801535,0.00017487007,0.019583147,0.000008399091,0.000047862206,8.264846e-7,0.005494435,0.0026160926,0.006590989,0.88568914,0.004880476,0.07490949],"study_design_scores_gemma":[0.00016301873,0.0000196455,0.0052067908,0.000024084022,0.000008387617,0.000009223202,0.000023833998,0.98731047,0.00100065,0.0008682921,0.0051987525,0.00016683804],"about_ca_topic_score_codex":0.0000020767532,"about_ca_topic_score_gemma":8.445804e-7,"teacher_disagreement_score":0.98469436,"about_ca_system_score_codex":0.00006025712,"about_ca_system_score_gemma":0.000024362957,"threshold_uncertainty_score":0.41992295},"labels":[],"label_agreement":null},{"id":"W2085570215","doi":"10.1109/syscon.2013.6549987","title":"A content centric approach to energy efficient data dissemination","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Linear network coding; Distributed computing; Network topology; Multicast; Computer network; Dissemination; Energy consumption; Efficient energy use; Information-centric networking; Topology (electrical circuits); Telecommunications","score_opus":0.09975837208200626,"score_gpt":0.28775780053399014,"score_spread":0.18799942845198386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085570215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015812293,0.00017520868,0.9665228,0.0022794846,0.00008292353,0.00017034264,6.8848965e-7,0.000101723184,0.029085567],"genre_scores_gemma":[0.9528967,0.00006287686,0.043377895,0.0008914335,0.000021860302,0.000046632773,0.00002643838,0.0000036658973,0.0026724623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915826,0.00006819249,0.000143599,0.00031000254,0.00016077272,0.00015917812],"domain_scores_gemma":[0.99823433,0.00007194763,0.00002944733,0.0014124463,0.00014495017,0.00010690483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017737772,0.00007400503,0.000075015276,0.00008098712,0.00011010444,0.0002219407,0.001896402,0.000017226263,0.000051953364],"category_scores_gemma":[0.00004507093,0.00005794943,0.000014604765,0.0005380198,0.000010425258,0.00025979665,0.001531231,0.00004212123,0.00011679634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6526703e-7,0.00022650737,0.0000462985,0.0000019977958,0.0000074051877,1.9595879e-7,0.0004552149,0.000520227,0.0015066172,0.384961,0.048691273,0.5635825],"study_design_scores_gemma":[0.00006899963,0.000010704999,0.0016109756,0.0000069390494,9.846354e-7,0.0000017877738,0.000042411422,0.9807372,0.00038725353,0.000029335522,0.0170077,0.00009569039],"about_ca_topic_score_codex":0.000033148866,"about_ca_topic_score_gemma":0.0000064763553,"teacher_disagreement_score":0.980217,"about_ca_system_score_codex":0.000032178235,"about_ca_system_score_gemma":0.000015427362,"threshold_uncertainty_score":0.35240182},"labels":[],"label_agreement":null},{"id":"W2085593504","doi":"10.1109/icc.2012.6363836","title":"Cascaded doubly-selective channel estimation in multi-relay AF OFDM transmissions","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Channel (broadcasting); Orthogonal frequency-division multiplexing; Computer science; Overhead (engineering); Relay channel; Reduction (mathematics); Basis (linear algebra); Electronic engineering; Algorithm; Telecommunications; Engineering; Mathematics; Power (physics); Physics","score_opus":0.07943056875114403,"score_gpt":0.3265905056594029,"score_spread":0.24715993690825888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085593504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044033616,0.00054668594,0.9887277,0.0017518811,0.00014547659,0.00021491334,3.1682325e-7,0.00013812998,0.0040715635],"genre_scores_gemma":[0.9372746,0.00013854343,0.06162261,0.000303026,0.000016262382,0.000037646376,0.0000027444364,0.000005888948,0.0005986824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906904,0.00015239355,0.00020049795,0.00017793065,0.00011727021,0.000282869],"domain_scores_gemma":[0.99929684,0.00010991519,0.000041057338,0.00036454733,0.00006586558,0.000121781755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036493258,0.000109545974,0.000117836054,0.00013651972,0.00016683372,0.000048633996,0.0004791625,0.000059038946,0.000045190667],"category_scores_gemma":[0.000046229845,0.00009338686,0.00003781568,0.0006722974,0.0000221288,0.0007647414,0.00012590505,0.00019985567,0.00006591209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005211238,0.0026220568,0.005745918,0.000028490003,0.00009166174,0.000007132067,0.09981763,0.037678152,0.011938718,0.2369534,0.006967909,0.59809685],"study_design_scores_gemma":[0.0006928435,0.00002108129,0.017478187,0.000030814976,0.0000026119608,0.0000063349485,0.000049692917,0.97482777,0.0054238075,0.0001197801,0.0011623304,0.00018473553],"about_ca_topic_score_codex":0.000025393012,"about_ca_topic_score_gemma":0.00013157348,"teacher_disagreement_score":0.93714964,"about_ca_system_score_codex":0.00007370096,"about_ca_system_score_gemma":0.00003880755,"threshold_uncertainty_score":0.38082057},"labels":[],"label_agreement":null},{"id":"W2085601259","doi":"10.1109/glocom.2005.1577919","title":"Distributed space-time block coding","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Node (physics); Block code; Wireless sensor network; Code (set theory); Wireless ad hoc network; Coding (social sciences); Block (permutation group theory); Matrix (chemical analysis); Space–time block code; Decoding methods; Set (abstract data type); Algorithm; Theoretical computer science; Wireless; Mathematics; Computer network; Combinatorics; Telecommunications; Engineering","score_opus":0.03307642726339382,"score_gpt":0.2837614291637141,"score_spread":0.2506850019003203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085601259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022757718,0.003993403,0.6858679,0.10988605,0.0013155552,0.0019750127,0.00060769054,0.0034883092,0.17010833],"genre_scores_gemma":[0.92181724,0.0037655346,0.07087109,0.0013587063,0.00016578066,0.000108779655,0.0002175599,0.000024516256,0.0016707565],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960621,0.0006705973,0.00095668173,0.0007705141,0.00048548437,0.0010545941],"domain_scores_gemma":[0.9935419,0.00030851157,0.0004135645,0.004578029,0.00067922816,0.000478792],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00072362873,0.00055665575,0.0005985375,0.00019248718,0.0013386098,0.00084267143,0.006574405,0.00021437339,0.00040611648],"category_scores_gemma":[0.00015337487,0.00059687847,0.00024314862,0.0016642328,0.00029468563,0.0011393175,0.0016577325,0.0006792227,0.0019609507],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027611068,0.0012184877,0.0006863253,0.000018396193,0.00028084771,0.000011093915,0.0005773333,0.004522668,0.0022623213,0.36735755,0.37727025,0.24576713],"study_design_scores_gemma":[0.0010756007,0.000078559664,0.002561494,0.00011550856,0.00004242775,0.00013614995,0.00004757963,0.3478416,0.00075318135,0.001359477,0.64500755,0.000980886],"about_ca_topic_score_codex":0.000054646927,"about_ca_topic_score_gemma":0.0007793266,"teacher_disagreement_score":0.89905953,"about_ca_system_score_codex":0.00075275265,"about_ca_system_score_gemma":0.0005472113,"threshold_uncertainty_score":0.9999615},"labels":[],"label_agreement":null},{"id":"W2085720813","doi":"10.1109/lcomm.2012.030512.120075","title":"Selection Combining of Signals with Different Modulation Levels in Nakagami-m Fading","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Nakagami distribution; Fading; Relay; Modulation (music); Rayleigh fading; Maximal-ratio combining; Selection (genetic algorithm); Expression (computer science); Computer science; Channel (broadcasting); Closed-form expression; Algorithm; Telecommunications; Signal-to-noise ratio (imaging); Topology (electrical circuits); Mathematics; Physics; Artificial intelligence; Combinatorics; Acoustics; Power (physics)","score_opus":0.08409197153466429,"score_gpt":0.30190056198818777,"score_spread":0.21780859045352347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085720813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5968983,0.00025148946,0.3985528,0.003526943,0.00008100987,0.00020239047,8.5574885e-7,0.00007554726,0.00041064547],"genre_scores_gemma":[0.98021495,0.00012564212,0.01911511,0.0004410697,0.000019316702,0.000051716877,0.0000064336978,0.0000111304325,0.000014652468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986074,0.00045619239,0.00035618935,0.00015205867,0.00018059355,0.00024755427],"domain_scores_gemma":[0.99798614,0.00029374642,0.00020064999,0.001362252,0.00009861609,0.000058613958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046931396,0.00013480514,0.00019235912,0.0002637062,0.00023223444,0.00005380032,0.0013406657,0.000038259663,0.000007432023],"category_scores_gemma":[0.000024702438,0.00012610873,0.00003887,0.0008143035,0.00009258409,0.0007580313,0.00028343225,0.0002629968,0.00000480131],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020305086,0.0009450644,0.17569911,0.00003904831,0.00011598958,5.6638464e-7,0.016247272,0.022885099,0.6571777,0.06632425,0.00064239645,0.059903204],"study_design_scores_gemma":[0.001279385,0.000095251526,0.43857628,0.00039657208,0.00002109565,0.000016858234,0.00016444876,0.5261781,0.031283338,0.00023232606,0.001150462,0.0006058293],"about_ca_topic_score_codex":0.0000139240365,"about_ca_topic_score_gemma":0.000077947814,"teacher_disagreement_score":0.62589437,"about_ca_system_score_codex":0.00012688844,"about_ca_system_score_gemma":0.000021640051,"threshold_uncertainty_score":0.5142565},"labels":[],"label_agreement":null},{"id":"W2086093826","doi":"10.1109/icuwb.2015.7324460","title":"Impact of Imperfect Channel Estimation Error and Jamming on the Performance of Decode-and-Forward Relaying","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jamming; Computer science; Bit error rate; Relay; Throughput; Channel (broadcasting); Fading; Transmission (telecommunications); Imperfect; Algorithm; Electronic engineering; Power (physics); Computer network; Telecommunications; Wireless; Engineering","score_opus":0.06565797721563568,"score_gpt":0.31659333538204004,"score_spread":0.25093535816640433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086093826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9624794,0.0001811202,0.035918005,0.0003743285,0.000024706536,0.00009112665,2.4484515e-7,0.00001761009,0.0009134489],"genre_scores_gemma":[0.99534875,0.00020577479,0.004357481,0.000046576617,0.0000052237515,0.000003983271,3.7593293e-7,0.000002797636,0.000029024935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994931,0.00006933256,0.00014908581,0.000100959536,0.00010346923,0.00008400288],"domain_scores_gemma":[0.99927735,0.00019222645,0.00008653092,0.0003033099,0.00009702622,0.000043524407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060718815,0.00006715678,0.00010437818,0.000054253993,0.00009218269,0.000026859587,0.00024333538,0.000019627114,0.0000034661846],"category_scores_gemma":[0.000104512925,0.00004004664,0.00002465486,0.00017917513,0.00004492829,0.00024416085,0.00020365888,0.0000724391,0.0000015411795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001494764,0.00017474857,0.05675997,0.00009265915,0.00015328314,8.523014e-7,0.03399861,0.048541997,0.0069030216,0.08630664,0.0013692884,0.7655495],"study_design_scores_gemma":[0.00016998737,0.00032706605,0.015348475,0.000050599585,0.0000027365293,0.0000041285007,0.000063592386,0.98186666,0.0020060267,0.00009848274,0.000008919412,0.000053303957],"about_ca_topic_score_codex":0.000013694817,"about_ca_topic_score_gemma":0.000004653656,"teacher_disagreement_score":0.9333247,"about_ca_system_score_codex":0.000021046408,"about_ca_system_score_gemma":0.000036947076,"threshold_uncertainty_score":0.16330546},"labels":[],"label_agreement":null},{"id":"W2086206715","doi":"10.1109/iwcmc.2012.6314184","title":"Data survivability for WSNs via Decentralized Erasure Codes","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Survivability; Erasure code; Computer science; Erasure; Scalability; Distributed computing; Redundancy (engineering); Data redundancy; Wireless sensor network; Coding (social sciences); Computer network; Flexibility (engineering); Decoding methods; Algorithm; Database","score_opus":0.18242244795517115,"score_gpt":0.3674600316901371,"score_spread":0.18503758373496593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086206715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022177268,0.0008568887,0.9926893,0.0018115712,0.00033095042,0.00024078747,0.000014315769,0.00015081631,0.0016876608],"genre_scores_gemma":[0.8901994,0.00023822741,0.10869347,0.000504398,0.00005802028,0.000017167766,0.000054307147,0.000004845377,0.0002301653],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990587,0.00016073568,0.00016575407,0.00022653898,0.00010691097,0.00028132202],"domain_scores_gemma":[0.99746317,0.00036129955,0.000037827474,0.0019265898,0.00009969134,0.00011140702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011676019,0.000085140615,0.0001207813,0.000019652325,0.00018564222,0.00008889662,0.0018754457,0.00003075328,0.00010717718],"category_scores_gemma":[0.00015458072,0.000069816175,0.00003116653,0.00019316914,0.000030253977,0.0008222571,0.00089675986,0.00006478751,0.0000257823],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000242274,0.00052784703,0.03810943,0.00002728012,0.00007015666,1.6847359e-7,0.001182565,0.000019337156,0.0035556345,0.4365679,0.052337486,0.46757796],"study_design_scores_gemma":[0.00067735993,0.000028134387,0.020199347,0.000009719385,0.000010432868,0.000003721086,0.000021275806,0.2888347,0.0020977573,0.0014227455,0.6863646,0.0003302009],"about_ca_topic_score_codex":0.000007618468,"about_ca_topic_score_gemma":0.00021467368,"teacher_disagreement_score":0.88798165,"about_ca_system_score_codex":0.000023093133,"about_ca_system_score_gemma":0.000030793697,"threshold_uncertainty_score":0.34850758},"labels":[],"label_agreement":null},{"id":"W2086285386","doi":"10.1109/tsp.2014.2305643","title":"Scalable and Efficient Power Control Algorithms for Wireless Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Power control; Computer science; Algorithm; Initialization; Computational complexity theory; Wireless network; Mathematical optimization; Power optimization; Scalability; Wireless; Power (physics); Mathematics; Telecommunications","score_opus":0.021943501066473612,"score_gpt":0.26339682382218876,"score_spread":0.24145332275571516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086285386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013558506,0.00030680737,0.99709994,0.00048972893,0.00015491892,0.00023430471,0.0000014570708,0.0001366712,0.0002203234],"genre_scores_gemma":[0.98922807,0.00003109335,0.009949833,0.0006077458,0.000040257946,0.000044418623,4.2091762e-7,0.000013319232,0.00008484706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899143,0.00009084027,0.00020154697,0.00031875633,0.00014348034,0.00025392993],"domain_scores_gemma":[0.9991481,0.00027798067,0.00006835377,0.00023955855,0.00016744673,0.000098580436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043625463,0.00014311011,0.00016555033,0.00008554199,0.00073101505,0.00027637443,0.00032651974,0.00006072911,0.000010400428],"category_scores_gemma":[0.0000027963322,0.00013154083,0.000053591633,0.00028798298,0.00006598149,0.00021602839,0.0000037873083,0.000194483,0.0000036601161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022781212,0.00008702473,0.000002461231,0.000012420037,0.000011604182,2.4381836e-7,0.00032354044,0.15693666,0.0008256414,0.0007149116,0.000032031156,0.84103066],"study_design_scores_gemma":[0.0007624839,0.00011698915,0.000020947371,0.000077052886,0.0000109577095,0.0000052257346,0.000015830574,0.996175,0.0018003603,0.00008629081,0.0007646798,0.00016416525],"about_ca_topic_score_codex":8.6407914e-7,"about_ca_topic_score_gemma":0.0000026677712,"teacher_disagreement_score":0.98787224,"about_ca_system_score_codex":0.000029671648,"about_ca_system_score_gemma":0.00003754394,"threshold_uncertainty_score":0.5622451},"labels":[],"label_agreement":null},{"id":"W2086732540","doi":"10.1109/tit.2014.2326976","title":"Capacity Analysis of Linear Operator Channels Over Finite Fields","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Subspace topology; Coding (social sciences); Computer science; Rank (graph theory); Operator (biology); Algorithm; Combinatorics; Discrete mathematics; Mathematics; Artificial intelligence; Statistics; Biology","score_opus":0.023061415155887242,"score_gpt":0.2535271905335389,"score_spread":0.23046577537765164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086732540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010830069,0.000006294273,0.9864387,0.00018000719,0.00030818925,0.000085072854,0.000010518815,0.00007931454,0.002061818],"genre_scores_gemma":[0.9960755,0.00005829239,0.0025762026,0.0011389494,0.000013162907,0.00001815945,0.0000050337026,0.0000025917743,0.0001120813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909186,0.00020394541,0.00033593323,0.00009138982,0.00016819556,0.000108679225],"domain_scores_gemma":[0.9987024,0.00036829172,0.00011537338,0.00058444234,0.00017691776,0.000052560234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006197936,0.000096092335,0.00016941238,0.00045688046,0.00022317945,0.00006622988,0.00044954292,0.00006448539,0.00022761234],"category_scores_gemma":[0.000028583761,0.000088195906,0.00013295656,0.0010535117,0.000043082204,0.0010557257,0.000005212864,0.00017098789,0.00005622712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028084569,0.00008626755,0.000012502008,0.000014968635,0.0003168122,5.124159e-8,0.00762374,0.66178715,0.00012724953,0.15940972,0.000107177075,0.17048626],"study_design_scores_gemma":[0.00023846854,0.000062570776,0.00018015777,0.000013889364,0.0000573002,3.384406e-7,0.000034333592,0.98724234,0.008551396,0.00056669477,0.0029295858,0.00012294813],"about_ca_topic_score_codex":0.0000049523915,"about_ca_topic_score_gemma":0.000011290117,"teacher_disagreement_score":0.98524547,"about_ca_system_score_codex":0.000023305316,"about_ca_system_score_gemma":0.000021888576,"threshold_uncertainty_score":0.35965246},"labels":[],"label_agreement":null},{"id":"W2086867550","doi":"10.1109/cwit.2013.6621606","title":"Two-way lossy communication of correlated Gaussian sources with amplify-and-forward relaying","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Lossy compression; Transmission (telecommunications); Gaussian; Relay; Distortion (music); Tuple; Channel (broadcasting); Encoder; Communications system; Algorithm; Mathematics; Telecommunications; Discrete mathematics; Bandwidth (computing); Artificial intelligence","score_opus":0.019218653624723255,"score_gpt":0.24701263834408732,"score_spread":0.22779398471936407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086867550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38908723,0.0026157217,0.5186614,0.00735877,0.0000773305,0.0007125652,7.669484e-7,0.00044492018,0.08104129],"genre_scores_gemma":[0.95555425,0.0005317257,0.04281449,0.00027936004,0.000005462931,0.000020326474,0.000004028491,0.000007336535,0.00078301487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911374,0.00016577699,0.00024649705,0.00018360068,0.00013903418,0.000151376],"domain_scores_gemma":[0.998447,0.00020316773,0.00014047105,0.0009589719,0.00017334218,0.000077042845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025300172,0.00011072104,0.0001574729,0.00008020741,0.0002465222,0.00015336223,0.0008073059,0.000041782016,0.00011101479],"category_scores_gemma":[0.000021384536,0.00008125463,0.000021709688,0.0003765947,0.00013028305,0.00052899483,0.00048277839,0.00020117026,0.000043541182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018000052,0.00015006095,0.02422966,0.00002655331,0.0001138135,0.0000011586059,0.008943088,0.00084188784,0.003235194,0.74070114,0.0021803575,0.21955906],"study_design_scores_gemma":[0.0040243976,0.00058728195,0.10217109,0.00073249487,0.00005636632,0.000106255735,0.0025102731,0.8625143,0.0067054606,0.0069392417,0.012249341,0.0014034627],"about_ca_topic_score_codex":0.00014634784,"about_ca_topic_score_gemma":0.00010635015,"teacher_disagreement_score":0.86167246,"about_ca_system_score_codex":0.000016675738,"about_ca_system_score_gemma":0.000023456108,"threshold_uncertainty_score":0.33134678},"labels":[],"label_agreement":null},{"id":"W2087447400","doi":"10.1109/jsac.2013.130801","title":"Guest Editorial: Theories and Methods for Advanced Wireless Relays — Issue II","year":2013,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Wireless; Telecommunications; Focus (optics); Wireless network; The Internet; Relay; Computer security; Multimedia; World Wide Web","score_opus":0.02470772696548005,"score_gpt":0.37398796460564204,"score_spread":0.349280237640162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087447400","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025954354,0.0053081247,0.070357494,0.0033978005,0.91881114,0.0010290928,0.000023111277,0.00017556605,0.00087173184],"genre_scores_gemma":[0.0004889717,0.062440284,0.14402387,0.00016207501,0.79096717,0.0007701739,0.00013803404,0.000082487444,0.0009269281],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99501055,0.002368211,0.0010600428,0.00053323345,0.00051786297,0.00051010074],"domain_scores_gemma":[0.9806684,0.011657466,0.00088117004,0.0033676939,0.0031868548,0.00023839847],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002652801,0.0004990297,0.0007794063,0.00050685013,0.0020367336,0.0007620203,0.005969713,0.0007294197,0.00001263826],"category_scores_gemma":[0.0039349063,0.00046812661,0.00013407772,0.001216993,0.00025076198,0.00079784665,0.0012430175,0.003879947,0.00001073184],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035072797,0.00019501966,0.0000024876397,0.000015886812,0.0000705194,5.305481e-7,0.0009593449,0.000028357246,0.00039422925,0.010708973,0.9330377,0.054551896],"study_design_scores_gemma":[0.001000259,0.00033654904,0.000008805791,0.0005529091,0.00003083644,0.000011426732,0.000035853485,0.0050453427,0.00019014289,0.0045272526,0.98777276,0.0004878846],"about_ca_topic_score_codex":0.000009899357,"about_ca_topic_score_gemma":0.00012761215,"teacher_disagreement_score":0.12784395,"about_ca_system_score_codex":0.00038721485,"about_ca_system_score_gemma":0.00081754004,"threshold_uncertainty_score":0.999777},"labels":[],"label_agreement":null},{"id":"W2087916991","doi":"10.1049/iet-com.2013.0480","title":"Goodput improvement for multipath transport control protocol in cooperative relay‐based wireless networks","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Goodput; Computer network; Computer science; Relay; Wireless; Multipath propagation; Protocol (science); Wireless network; Telecommunications; Throughput; Channel (broadcasting)","score_opus":0.035705890866737686,"score_gpt":0.3142749174386619,"score_spread":0.2785690265719242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087916991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049844896,0.00005609874,0.96131384,0.0049865595,0.00006502634,0.03148838,0.000009881286,0.00017243632,0.0014093304],"genre_scores_gemma":[0.84959483,0.000046936217,0.031174242,0.0012972632,0.000030564726,0.11771706,0.0000439499,0.000019821144,0.00007533285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797684,0.00053848233,0.0006081597,0.00037911427,0.00013888798,0.00035853984],"domain_scores_gemma":[0.9950605,0.00096906663,0.00020081109,0.0032887126,0.00037108472,0.00010981543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011354435,0.00022728529,0.00031648582,0.00012348082,0.00057284767,0.00010947836,0.0031673897,0.0001014298,0.000009154238],"category_scores_gemma":[0.00008563097,0.00022111577,0.00011166342,0.00058549904,0.00014352088,0.0003134996,0.00029224303,0.00041474792,0.000007312846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023482212,0.0027548482,0.007436493,0.000086110784,0.000120286815,0.000001243531,0.0030500225,0.14532052,0.0038416428,0.5115511,0.0016993976,0.3239035],"study_design_scores_gemma":[0.0035738605,0.00021746951,0.0020423534,0.00008292914,0.000007460465,5.066308e-7,0.000021761341,0.9477685,0.000227921,0.00014124466,0.045659445,0.00025651365],"about_ca_topic_score_codex":0.000026039455,"about_ca_topic_score_gemma":0.0010315363,"teacher_disagreement_score":0.9301396,"about_ca_system_score_codex":0.00011493624,"about_ca_system_score_gemma":0.00015381935,"threshold_uncertainty_score":0.9016839},"labels":[],"label_agreement":null},{"id":"W2088029791","doi":"10.1109/wcnc.2013.6555102","title":"Cognitive relaying and power allocation under channel state uncertainties","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Transceiver; Relay; Cognitive radio; Computer science; Channel state information; Transmitter power output; Node (physics); Convex optimization; Channel (broadcasting); Optimization problem; Minification; Mathematical optimization; Computer network; Topology (electrical circuits); Power (physics); Algorithm; Telecommunications; Wireless; Transmitter; Regular polygon; Mathematics; Engineering; Electrical engineering","score_opus":0.03976476749225508,"score_gpt":0.27298019822005265,"score_spread":0.23321543072779757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088029791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09080543,0.00054547173,0.8901081,0.005642501,0.00008990457,0.00021630288,2.1477544e-7,0.00014286237,0.012449214],"genre_scores_gemma":[0.99370825,0.00045831513,0.0023254775,0.0016653796,0.000006154358,0.000025956337,0.0000014516481,0.000003928537,0.001805067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945515,0.00006650975,0.00010569232,0.00016651467,0.000080825295,0.00012529727],"domain_scores_gemma":[0.9993886,0.0001255662,0.000033549568,0.0001992378,0.0002031452,0.00004994896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012750711,0.00007247643,0.00006431269,0.000049948485,0.00017213264,0.00021519279,0.00020977568,0.000018477978,0.000083375664],"category_scores_gemma":[0.000025169647,0.00006083872,0.000012340127,0.00016652864,0.0000452524,0.00059941935,0.0002572882,0.000075453994,0.00008708414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000923109,0.000121811936,0.0012028916,0.000014569517,0.00010772636,0.0000017349857,0.021844257,0.0006839364,0.0032259088,0.5786194,0.007240761,0.38692775],"study_design_scores_gemma":[0.0014777842,0.00025971545,0.097819656,0.00021078414,0.000011962297,0.000021739437,0.0058771605,0.8247869,0.0039936327,0.06165275,0.0028314267,0.0010564749],"about_ca_topic_score_codex":0.000028591301,"about_ca_topic_score_gemma":0.000024181816,"teacher_disagreement_score":0.90290284,"about_ca_system_score_codex":0.000015983735,"about_ca_system_score_gemma":0.000018870744,"threshold_uncertainty_score":0.2480931},"labels":[],"label_agreement":null},{"id":"W2088168088","doi":"10.1109/tpds.2012.106","title":"A Secure Payment Scheme with Low Communication and Processing Overhead for Multihop Wireless Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cheating; Computer science; Computer network; Computer security; Overhead (engineering); Payment; Network packet; Cryptography; Node (physics)","score_opus":0.02406952966581572,"score_gpt":0.26031407644526167,"score_spread":0.23624454677944595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088168088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010654125,0.004025153,0.9841984,0.00028907313,0.00011109025,0.00055687217,0.000025774663,0.00010186239,0.000037664362],"genre_scores_gemma":[0.9933805,0.0008748869,0.005326057,0.000058670517,0.000030235931,0.00023649364,0.000031597567,0.000010893955,0.00005068519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990022,0.00010680562,0.00024873792,0.00022512283,0.0001247949,0.00029231893],"domain_scores_gemma":[0.99900776,0.00016574071,0.000117180905,0.0004175116,0.00012844366,0.00016339014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003656977,0.00017368543,0.00020253743,0.000045789497,0.0006512127,0.00022008685,0.00023735792,0.00008158639,0.000001037356],"category_scores_gemma":[0.000002160906,0.00014106212,0.00003053957,0.00022789884,0.00006865916,0.00046471076,0.000008637445,0.00018263969,8.229545e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012085872,0.0030104013,0.004522586,0.0012441344,0.0006465503,0.0000049836644,0.014145326,0.4890595,0.0017584976,0.04400319,0.0020961105,0.43830013],"study_design_scores_gemma":[0.0012268329,0.00009824087,0.00073004776,0.0003102796,0.000020675014,0.00002830736,0.0003564857,0.9952837,0.00007100474,0.000011144649,0.0016038988,0.00025935957],"about_ca_topic_score_codex":0.000013534609,"about_ca_topic_score_gemma":0.00004889901,"teacher_disagreement_score":0.98272634,"about_ca_system_score_codex":0.000051427396,"about_ca_system_score_gemma":0.000025784759,"threshold_uncertainty_score":0.57523465},"labels":[],"label_agreement":null},{"id":"W2088327387","doi":"10.1109/tvt.2014.2331756","title":"Low-Complexity Full-Rate Transmission Scheme With Full Diversity for Two-Path Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"King Abdullah University of Science and Technology","keywords":"Relay; Decoding methods; Diversity gain; Transmission (telecommunications); Path (computing); Computer science; Block (permutation group theory); Full Rate; Cooperative diversity; Algorithm; Topology (electrical circuits); Mathematics; Telecommunications; Computer network; Fading","score_opus":0.02326955982056844,"score_gpt":0.24603806669610906,"score_spread":0.22276850687554062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088327387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034217566,0.000097741795,0.96094453,0.0032874208,0.0001909329,0.0004448632,0.0000030160813,0.0007108073,0.000103144266],"genre_scores_gemma":[0.9144482,0.00015195843,0.084850185,0.00033364925,0.000024910658,0.00009147782,0.000003970982,0.000019476272,0.00007618591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983737,0.00018282965,0.0002545623,0.0005905561,0.0001774651,0.00042092905],"domain_scores_gemma":[0.99827516,0.00014505336,0.000106474115,0.001138806,0.00022078516,0.00011370314],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00046231123,0.00026338128,0.00029812183,0.0002882341,0.0013107107,0.00006237585,0.0012488464,0.00024442124,0.000022698685],"category_scores_gemma":[0.000007713574,0.00023348583,0.00013365828,0.0009380014,0.00025332082,0.00024264301,0.000032794393,0.00063993107,0.000019095036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005727529,0.0010301373,0.0000661589,0.000068977286,0.00022322916,0.000019306797,0.00053948374,0.25548568,0.041341674,0.10707595,0.0003022573,0.5932744],"study_design_scores_gemma":[0.0017338553,0.00082398386,0.00003925823,0.00010445895,0.00003456408,0.000035126563,0.000018845116,0.9733446,0.018023897,0.0011946309,0.004253976,0.00039275983],"about_ca_topic_score_codex":0.000004787649,"about_ca_topic_score_gemma":0.00010345186,"teacher_disagreement_score":0.8802306,"about_ca_system_score_codex":0.000082629485,"about_ca_system_score_gemma":0.000039689432,"threshold_uncertainty_score":0.99998945},"labels":[],"label_agreement":null},{"id":"W2088397325","doi":"10.1109/jsac.2012.120214","title":"Joint Zero-Forcing Based Precoder Design for QoS-Aware Power Allocation in MIMO Cooperative Cellular Network","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":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Base station; Transmitter power output; MIMO; Computer network; Quality of service; Relay; RSS; Enhanced Data Rates for GSM Evolution; Cellular network; Transmission (telecommunications); Interference (communication); Real-time computing; Power (physics); Channel (broadcasting); Telecommunications; Transmitter","score_opus":0.09895340924816749,"score_gpt":0.3111637100563262,"score_spread":0.21221030080815872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088397325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058834963,0.0019102792,0.98612535,0.0038859635,0.0005499501,0.00092192437,0.0000029830555,0.00009267289,0.00062738935],"genre_scores_gemma":[0.90034705,0.00081767834,0.097433634,0.0008961367,0.00013582902,0.00024661544,0.000026097021,0.000030435085,0.00006653737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959503,0.0019779697,0.0008619068,0.0002782075,0.00027447427,0.0006571852],"domain_scores_gemma":[0.995093,0.0016867188,0.00037952274,0.0017676931,0.0008687223,0.0002043556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025844648,0.00028173532,0.00036045507,0.00044033673,0.00086776883,0.000272215,0.0021670547,0.0001431722,0.000031990636],"category_scores_gemma":[0.0004206912,0.00027602914,0.000099663965,0.001998152,0.00007482023,0.0008958755,0.00022217336,0.001092199,0.000017982824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032234998,0.0042066653,0.009700006,0.000035927707,0.0002303284,0.000008028484,0.013699958,0.8308387,0.019846702,0.060197916,0.036769684,0.024143783],"study_design_scores_gemma":[0.0020740503,0.0003300326,0.008839409,0.00073788,0.000020793505,0.000029806251,0.0001184688,0.9687954,0.0063935784,0.0010003306,0.010993573,0.00066665414],"about_ca_topic_score_codex":0.000006173274,"about_ca_topic_score_gemma":0.00014506503,"teacher_disagreement_score":0.89446354,"about_ca_system_score_codex":0.0005354859,"about_ca_system_score_gemma":0.0004251982,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W2088655945","doi":"10.1109/icdcs.2014.69","title":"Achieving Absolutely Optimal Block Pipelining in Organized Network Coded Gossip","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Linear network coding; Random permutation; Gossip; Computer science; Permutation (music); Network topology; Random graph; Block (permutation group theory); Limit (mathematics); Topology (electrical circuits); Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; Computer network; Graph","score_opus":0.026272709345679927,"score_gpt":0.2622243757566287,"score_spread":0.23595166641094878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088655945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06648798,0.00033783275,0.9050192,0.0022019758,0.0003053072,0.00015792498,1.0036811e-7,0.00037161683,0.025118051],"genre_scores_gemma":[0.8617518,0.00011688432,0.13617675,0.0011544216,0.0001422333,0.000007712376,0.000001351877,0.000011622777,0.0006372277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844426,0.00030236115,0.0003589434,0.00034268203,0.00016036618,0.00039137804],"domain_scores_gemma":[0.998584,0.0003745379,0.00008599553,0.0007698849,0.000090649395,0.00009493153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010898333,0.0001521807,0.00023044938,0.000079769845,0.0002552565,0.00023319267,0.0012366885,0.00006005477,0.00007556177],"category_scores_gemma":[0.00016794517,0.00014158583,0.000043762302,0.00086476683,0.00003156097,0.00031397643,0.00079364795,0.00027956744,0.00010750557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054312488,0.00027936292,0.01650486,0.000022123048,0.0000567866,0.000016546113,0.006149886,0.1049128,0.008690156,0.49339896,0.020235786,0.34967843],"study_design_scores_gemma":[0.0008627773,0.000050577346,0.009894535,0.00007364702,0.0000028163959,0.000009217375,0.000025032392,0.9701615,0.00028896923,0.00020539961,0.018109674,0.00031587013],"about_ca_topic_score_codex":0.000007609362,"about_ca_topic_score_gemma":0.00011213193,"teacher_disagreement_score":0.8652487,"about_ca_system_score_codex":0.00004182363,"about_ca_system_score_gemma":0.000047894948,"threshold_uncertainty_score":0.5773703},"labels":[],"label_agreement":null},{"id":"W2088708077","doi":"10.1109/icc.2010.5501893","title":"Performance of Cooperative Diversity Systems in Non-Gaussian Environments","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rayleigh fading; Relay; Gaussian; Computer science; Diversity combining; Gaussian noise; Additive white Gaussian noise; Bit error rate; Interference (communication); Fading; Diversity gain; Algorithm; Cooperative diversity; Noise (video); Selection (genetic algorithm); Signal-to-noise ratio (imaging); Antenna diversity; Topology (electrical circuits); Wireless; Telecommunications; Mathematics; White noise; Decoding methods; Channel (broadcasting); Artificial intelligence; Physics","score_opus":0.021186720411358665,"score_gpt":0.23538944908536646,"score_spread":0.2142027286740078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088708077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96848506,0.00003042781,0.018762065,0.00014012108,0.00021214329,0.00014476459,4.372968e-7,0.000016134974,0.012208852],"genre_scores_gemma":[0.99786407,0.00014331409,0.0013399887,0.00004780916,0.0000088277375,0.0000050004505,7.5041226e-7,0.0000018030477,0.0005884329],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994506,0.000045157063,0.00014162436,0.00013977144,0.00011655887,0.000106253996],"domain_scores_gemma":[0.99942154,0.000032841042,0.000045964745,0.00043946563,0.000022084414,0.0000380802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022668432,0.00006432454,0.000104450985,0.00005987793,0.00014022652,0.000024263416,0.0007401238,0.00003202917,0.000034273806],"category_scores_gemma":[0.000007832715,0.000055143853,0.000014761396,0.00021398746,0.00004965765,0.0003250865,0.0009164601,0.00015987156,0.000022678352],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028567405,0.0006274947,0.64324987,0.00004785342,0.000046585345,0.000008190232,0.012173555,0.005949339,0.10778577,0.15413603,0.0008839195,0.07506282],"study_design_scores_gemma":[0.00042203628,0.00007445201,0.2917323,0.000028744924,0.0000013264445,0.0000024128,0.00006262784,0.70112246,0.0046875128,0.000007059422,0.0017075785,0.00015150677],"about_ca_topic_score_codex":0.000033843447,"about_ca_topic_score_gemma":0.000102685044,"teacher_disagreement_score":0.6951731,"about_ca_system_score_codex":0.00001790279,"about_ca_system_score_gemma":0.000015166211,"threshold_uncertainty_score":0.22487012},"labels":[],"label_agreement":null},{"id":"W2088715268","doi":"10.1049/iet-com.2011.0247","title":"Max–min fairness aware joint power, subcarrier allocation and relay assignment in multicast cognitive radio","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multicast; Subcarrier; Cognitive radio; Computer science; Relay; Computational complexity theory; Mathematical optimization; Computer network; Joint (building); Power (physics); Orthogonal frequency-division multiplexing; Algorithm; Wireless; Telecommunications; Mathematics; Engineering","score_opus":0.06951371755344149,"score_gpt":0.3130153817572423,"score_spread":0.24350166420380082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088715268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10321607,0.016501546,0.8386556,0.027224869,0.0005038573,0.001670836,0.000025468764,0.00041581065,0.01178597],"genre_scores_gemma":[0.98630035,0.002302754,0.010625728,0.00037281605,0.000017984661,0.00018627661,0.00003782117,0.000014110177,0.00014215172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99822533,0.0006489892,0.0003831922,0.00024365245,0.00018432015,0.0003144983],"domain_scores_gemma":[0.9970734,0.0004890341,0.00013007801,0.0019524102,0.00019123219,0.000163821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008490639,0.00016914445,0.0001970916,0.00016128726,0.00042104724,0.00013327353,0.0012134326,0.00007926296,0.00002917417],"category_scores_gemma":[0.00016860684,0.00017407954,0.000042985113,0.00055890926,0.00019292954,0.0007705888,0.0013609359,0.0003863132,0.00004718332],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003671809,0.002781414,0.072335705,0.000045669593,0.00019018857,0.0000052879664,0.08003176,0.00024464965,0.005867352,0.5917467,0.0025517235,0.24416286],"study_design_scores_gemma":[0.0042923125,0.00023572291,0.6623574,0.00084351975,0.000079792124,0.000105477855,0.007087353,0.25854316,0.0028528234,0.0012644682,0.060442608,0.0018953959],"about_ca_topic_score_codex":0.000025302523,"about_ca_topic_score_gemma":0.00015387447,"teacher_disagreement_score":0.8830843,"about_ca_system_score_codex":0.0001442334,"about_ca_system_score_gemma":0.00006496407,"threshold_uncertainty_score":0.70987576},"labels":[],"label_agreement":null},{"id":"W2088781688","doi":"10.1109/ita.2011.5743558","title":"Can half-duplex be simply derived from full-duplex communications?","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Duplex (building); Channel (broadcasting); Joint (building); Gaussian; Algorithm; List decoding; Computer network; Telecommunications; Block code; Engineering; Physics; Concatenated error correction code","score_opus":0.14526981255972984,"score_gpt":0.2981319925716897,"score_spread":0.15286218001195986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088781688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12895344,0.0018700615,0.7438556,0.060471117,0.00046147188,0.00071186066,0.000019657171,0.0015378735,0.06211891],"genre_scores_gemma":[0.8180113,0.0010751087,0.17624888,0.004180153,0.00002651537,0.00003552059,0.000036714588,0.000011736604,0.0003740816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856406,0.00028890785,0.0003338208,0.00035239218,0.00017869972,0.00028210878],"domain_scores_gemma":[0.9957144,0.00024720372,0.00011202882,0.0035543344,0.00021043538,0.00016155714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023340095,0.0001840287,0.00019597265,0.000083174345,0.00047533025,0.00016598578,0.0041628843,0.00006540673,0.0008021795],"category_scores_gemma":[0.000057770856,0.00017108834,0.000075170756,0.00044362547,0.00014807352,0.00039330698,0.0020168205,0.00023996731,0.00013843377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026177613,0.0005237099,0.0023385605,0.0000054392963,0.00016260684,0.000008522129,0.023196805,0.0000634331,0.026477994,0.6670072,0.015349427,0.26484013],"study_design_scores_gemma":[0.0014125259,0.00020662599,0.03855348,0.000059609833,0.00003186866,0.000017196753,0.0008296782,0.7892385,0.012754803,0.0036247459,0.15203984,0.0012311109],"about_ca_topic_score_codex":0.0010275806,"about_ca_topic_score_gemma":0.006390372,"teacher_disagreement_score":0.7891751,"about_ca_system_score_codex":0.000055890694,"about_ca_system_score_gemma":0.000089704605,"threshold_uncertainty_score":0.87833035},"labels":[],"label_agreement":null},{"id":"W2088880144","doi":"10.1109/infcom.2010.5461995","title":"Throughput Analysis of Multiple Access Relay Channel under Collision Model","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Throughput; Computer network; Telecommunications link; Channel (broadcasting); Collision; Wireless; Wireless network; Physical layer; Interference (communication); Relay channel; Power (physics); Distributed computing; Telecommunications","score_opus":0.08623559414940585,"score_gpt":0.3433288704468094,"score_spread":0.25709327629740353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088880144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08971708,0.000037001566,0.90431166,0.00096783706,0.00010165921,0.000076401164,0.0000013576675,0.00006902051,0.004717978],"genre_scores_gemma":[0.96428883,0.00014726944,0.034508675,0.00047507783,0.00000980242,0.000006921246,0.0000047090766,0.0000038252006,0.00055491336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923015,0.00004362063,0.00020989764,0.00022700468,0.00016608577,0.00012325926],"domain_scores_gemma":[0.9985127,0.00016597995,0.00008454933,0.000975832,0.00020828402,0.000052658015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025327585,0.00008235329,0.00017897954,0.00020031512,0.00013650686,0.00010270104,0.0014010462,0.000053195978,0.00004929969],"category_scores_gemma":[0.00004396044,0.000066879096,0.000094607065,0.0015988605,0.0000398624,0.00052781776,0.0007921583,0.00015202528,0.000006051706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005159255,0.00013777468,0.0015114407,0.0000026840914,0.00018518353,3.1377962e-7,0.00086989504,0.7453126,0.008400113,0.23748082,0.0011632496,0.004930788],"study_design_scores_gemma":[0.00013454916,0.0000072312305,0.0038065885,0.0000029826729,0.000026937889,2.2583423e-7,0.000011507589,0.99163103,0.003376619,0.0007156435,0.00020016843,0.00008653262],"about_ca_topic_score_codex":0.000023596343,"about_ca_topic_score_gemma":0.0010438346,"teacher_disagreement_score":0.87457174,"about_ca_system_score_codex":0.000011625812,"about_ca_system_score_gemma":0.000041200456,"threshold_uncertainty_score":0.27272505},"labels":[],"label_agreement":null},{"id":"W2088895311","doi":"10.1007/s00446-008-0075-z","title":"Broadcasting in UDG radio networks with unknown topology","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Computer network; Topology (electrical circuits); Telecommunications; Radio broadcasting; Engineering; Electrical engineering","score_opus":0.02864918246934317,"score_gpt":0.25244163591408386,"score_spread":0.2237924534447407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088895311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09347284,0.0006521397,0.90385336,0.00048316258,0.00014076217,0.000115428134,8.6828004e-7,0.00023042648,0.0010509954],"genre_scores_gemma":[0.98338705,0.00011486193,0.016121738,0.00022335959,0.00008697098,0.0000046796627,0.000030639396,0.000009749263,0.000020970896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843836,0.00021889943,0.000333761,0.00038851693,0.00014406886,0.00047638587],"domain_scores_gemma":[0.9987656,0.0002952102,0.0001295828,0.0005982444,0.0001206742,0.00009068753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031789203,0.00017741807,0.00025130823,0.00009921859,0.00047523875,0.00007812575,0.00096695306,0.000067868605,0.000009496292],"category_scores_gemma":[0.00005673952,0.00016607241,0.000040019368,0.0012599826,0.00010431455,0.00018768289,0.00038924234,0.000405152,0.000006910729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003470641,0.00027193755,0.1201956,0.000013836923,0.00006143095,0.00047860763,0.0028832878,0.5427346,0.00018437851,0.08936605,0.0022277595,0.24154778],"study_design_scores_gemma":[0.0005954254,0.000058799484,0.02861268,0.00007069502,0.0000020157077,0.00020128468,0.000028107603,0.9661343,0.00006341604,0.000039186536,0.0039541945,0.00023987897],"about_ca_topic_score_codex":0.000014670983,"about_ca_topic_score_gemma":0.000031524967,"teacher_disagreement_score":0.8899142,"about_ca_system_score_codex":0.00010187216,"about_ca_system_score_gemma":0.000077869365,"threshold_uncertainty_score":0.6772236},"labels":[],"label_agreement":null},{"id":"W2088906245","doi":"10.1109/icumt.2014.7002076","title":"SFR-based vs. FFR-based inter-cell interference coordination for inband relay LTE-A networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia e Innovación; Gwich'in Renewable Resources Board","keywords":"Backhaul (telecommunications); Relay; Computer network; LTE Advanced; Computer science; Interference (communication); Macro; Telecommunications link; Base station; Channel (broadcasting)","score_opus":0.026946053296488706,"score_gpt":0.26346682621045286,"score_spread":0.23652077291396417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088906245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017023402,0.000067195135,0.98887825,0.00412373,0.0003766397,0.00033745522,8.2476544e-7,0.00024034284,0.0042732107],"genre_scores_gemma":[0.94719744,0.000014257032,0.048467956,0.003080845,0.000067825895,0.00008900138,0.000021560922,0.000014414602,0.0010467208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857056,0.00024274351,0.00033965122,0.00042074022,0.00013127143,0.00029504436],"domain_scores_gemma":[0.99766624,0.00081661507,0.00014680825,0.0009210389,0.00034095946,0.000108361884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077386637,0.000196118,0.0002127075,0.00013949188,0.00026077658,0.00029508013,0.0012869734,0.00008897091,0.00006924618],"category_scores_gemma":[0.00014402393,0.00017465229,0.00009893044,0.00041823043,0.000058329562,0.0002954071,0.000239549,0.00020992127,0.000025005107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027791114,0.00093514606,0.0048154714,0.00012063652,0.00004195993,0.0000016899119,0.00062415225,0.07575692,0.003637484,0.29518595,0.078159064,0.5404436],"study_design_scores_gemma":[0.0010730887,0.00032645275,0.00022477529,0.0000661303,0.0000051656243,3.7520752e-7,0.0000048986185,0.9673659,0.003896008,0.00018482348,0.026620345,0.00023203203],"about_ca_topic_score_codex":0.0000071572767,"about_ca_topic_score_gemma":0.0001029138,"teacher_disagreement_score":0.94549507,"about_ca_system_score_codex":0.00007050615,"about_ca_system_score_gemma":0.000072768205,"threshold_uncertainty_score":0.7122114},"labels":[],"label_agreement":null},{"id":"W2089121566","doi":"10.1109/allerton.2011.6120198","title":"Compress-forward without Wyner-Ziv binning for the one-way and two-way relay channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Relay; Computer science; Channel (broadcasting); Algorithm; Relay channel; Coding (social sciences); Data compression; Gaussian; Telecommunications; Mathematics; Statistics","score_opus":0.1254362806861696,"score_gpt":0.30351847477097454,"score_spread":0.17808219408480494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089121566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083880555,0.0012177438,0.97099805,0.002171627,0.0003399861,0.00045491406,8.965529e-7,0.00019544912,0.016233271],"genre_scores_gemma":[0.9411419,0.00040948973,0.054986093,0.0010483186,0.00008038535,0.000077965764,0.0000012014904,0.000011767143,0.0022429011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990208,0.000096744036,0.00020689219,0.0002959841,0.00012638188,0.0002531875],"domain_scores_gemma":[0.9985553,0.00033013843,0.000079576064,0.00081476755,0.00013703111,0.0000831707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057479175,0.00013872341,0.00016457563,0.000056604742,0.00055753154,0.0001962767,0.0010687534,0.00003667195,0.000052558644],"category_scores_gemma":[0.000039831873,0.00009240676,0.000051108615,0.00022495037,0.00009513687,0.0003444759,0.00067039597,0.00015584203,0.000018191411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043849792,0.00013198883,0.0023401212,0.000020122878,0.00014094787,0.0000014995962,0.014930206,0.00049349875,0.002302556,0.7350094,0.0058659413,0.23871991],"study_design_scores_gemma":[0.0013443927,0.00018099003,0.0050522625,0.000089366724,0.000028405828,0.000012885402,0.00018667767,0.9256539,0.0071139205,0.0027476752,0.057122122,0.00046745504],"about_ca_topic_score_codex":0.000026709313,"about_ca_topic_score_gemma":0.000056634664,"teacher_disagreement_score":0.9327538,"about_ca_system_score_codex":0.00001378952,"about_ca_system_score_gemma":0.000021898091,"threshold_uncertainty_score":0.42881384},"labels":[],"label_agreement":null},{"id":"W2089131760","doi":"10.1109/vtcfall.2012.6399124","title":"Exact Analytical Solution for Dual-Hop and Opportunistic Dual-Hop AF Relaying Systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Nakagami distribution; Hop (telecommunications); Cumulative distribution function; Rician fading; Rayleigh fading; Probability density function; Outage probability; Computer science; Topology (electrical circuits); Fading; Mathematics; Telecommunications; Control theory (sociology); Statistics; Power (physics); Physics; Decoding methods","score_opus":0.11439668509009844,"score_gpt":0.3242135762576164,"score_spread":0.20981689116751795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089131760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055316202,0.0015577545,0.9817211,0.0017465702,0.0005370152,0.00035061417,0.0000023221846,0.00019116783,0.008361805],"genre_scores_gemma":[0.98727274,0.0003663805,0.00986147,0.00027193676,0.00017728507,0.000041527237,0.000009004502,0.000010408346,0.001989253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987534,0.00015346149,0.00029547676,0.00025386046,0.00016457688,0.0003792219],"domain_scores_gemma":[0.99857634,0.0004226742,0.00008290501,0.0005543538,0.00012991829,0.00023380134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010578738,0.00013862396,0.00019207211,0.00009229405,0.00039065507,0.00023531663,0.0002420754,0.00006684176,0.000024143525],"category_scores_gemma":[0.00015367805,0.00012045365,0.00004886638,0.00024305355,0.00005439068,0.00061536464,0.0003938628,0.00012337128,0.00002582611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009111024,0.00008642432,0.0011066679,0.00003996996,0.00003792527,0.000002570133,0.00077028066,0.000033392484,0.0011239322,0.9536277,0.009801597,0.033360403],"study_design_scores_gemma":[0.00034554885,0.000061981795,0.0011906681,0.00004742137,0.00002038767,0.00005373527,0.0001136438,0.96301,0.0000356211,0.00014233234,0.03473672,0.0002419001],"about_ca_topic_score_codex":0.000007689356,"about_ca_topic_score_gemma":0.0000062245717,"teacher_disagreement_score":0.98174113,"about_ca_system_score_codex":0.00006387307,"about_ca_system_score_gemma":0.000044879027,"threshold_uncertainty_score":0.49119577},"labels":[],"label_agreement":null},{"id":"W2089381818","doi":"10.1109/icassp.2014.6854767","title":"Optimal power allocation and network beamforming for OFDM-based relay networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Linear network coding; Computer science; Beamforming; Orthogonal frequency-division multiplexing; Power (physics); Mathematical optimization; Transceiver; Optimization problem; Coding (social sciences); Computer network; Algorithm; Mathematics; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.017688384836849928,"score_gpt":0.25537120589907275,"score_spread":0.23768282106222283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089381818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018065014,0.00023274282,0.99308234,0.002005026,0.00018920202,0.00022244288,1.15814274e-7,0.00014400287,0.002317641],"genre_scores_gemma":[0.64757717,0.00005722583,0.35035834,0.001633672,0.00009301035,0.000035326753,0.000005593347,0.000007799514,0.00023189085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912256,0.000083107116,0.0001957871,0.00025754087,0.000087286026,0.00025370283],"domain_scores_gemma":[0.9988348,0.00039248422,0.00006971954,0.00050293177,0.00011959815,0.00008046231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007404774,0.000113012335,0.00012965994,0.000037895003,0.00034970941,0.00015970416,0.00044949548,0.00005727358,0.00001371301],"category_scores_gemma":[0.00005633691,0.000101519014,0.00004024661,0.0002317405,0.000034603032,0.00026672424,0.00018804401,0.000100573074,0.0000036738197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136546405,0.00002677193,0.00029995004,0.0000051737643,0.000012583921,1.13108705e-7,0.00016115524,0.4314241,0.000076869655,0.4649206,0.005430237,0.09762876],"study_design_scores_gemma":[0.00033066058,0.000092730894,0.00037838335,0.00002116033,0.000003366059,0.0000013217951,0.000004975171,0.9564727,0.000072559895,0.00019178384,0.04229226,0.00013811547],"about_ca_topic_score_codex":0.0000012228318,"about_ca_topic_score_gemma":0.000014174643,"teacher_disagreement_score":0.64577067,"about_ca_system_score_codex":0.000019992582,"about_ca_system_score_gemma":0.000024952018,"threshold_uncertainty_score":0.4139825},"labels":[],"label_agreement":null},{"id":"W2089527465","doi":"10.1145/1459359.1459481","title":"Toward the optimal multirate multicast for lossy packet network","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multicast; Source-specific multicast; Pragmatic General Multicast; Computer science; Computer network; Xcast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; IP multicast; Linear network coding; Distributed computing; Reliable multicast; Multicast address; Network packet","score_opus":0.12864628644050694,"score_gpt":0.30391638740498655,"score_spread":0.17527010096447962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089527465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005068561,0.00042651512,0.98325527,0.007888592,0.00024578633,0.00035236508,9.92913e-7,0.00016776098,0.002594138],"genre_scores_gemma":[0.8243097,0.0004335502,0.17199679,0.0017679766,0.00018024951,0.0000619648,0.000002557578,0.000007751842,0.0012394498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990853,0.00010060354,0.00018249538,0.0002253343,0.00011484695,0.0002914298],"domain_scores_gemma":[0.9986292,0.0003877727,0.00004836655,0.0007171595,0.00015127579,0.00006619576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032289606,0.00011352353,0.000115998075,0.000018515346,0.00060894375,0.00010165643,0.0011560089,0.000032769956,0.000039011084],"category_scores_gemma":[0.00005832744,0.00007258756,0.00007763896,0.00028788426,0.000099016426,0.0002089673,0.00042535295,0.00012024776,0.000061756626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067088484,0.00026794063,0.0016121716,0.000012979647,0.00012683922,0.000022427546,0.015020628,0.0290655,0.00053911185,0.49179524,0.19870235,0.2627677],"study_design_scores_gemma":[0.00046900864,0.000057816796,0.0015472496,0.00000902412,0.0000030794688,0.000026653031,0.00004665341,0.9085417,0.00034525362,0.00022673723,0.088553436,0.00017343822],"about_ca_topic_score_codex":0.0000026136506,"about_ca_topic_score_gemma":0.000013743015,"teacher_disagreement_score":0.87947613,"about_ca_system_score_codex":0.000018164355,"about_ca_system_score_gemma":0.000043648313,"threshold_uncertainty_score":0.46835646},"labels":[],"label_agreement":null},{"id":"W2089579029","doi":"10.1109/tnet.2014.2332423","title":"Does Network Coding Combined With Interference Cancellation Bring Any Gain to a Wireless Network?","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scheduling (production processes); Single antenna interference cancellation; Wireless network; Computer network; Linear network coding; Wireless; Network performance; Signal-to-interference-plus-noise ratio; Distributed computing; Telecommunications; Mathematical optimization; Channel (broadcasting)","score_opus":0.02806034948562919,"score_gpt":0.2545347139560839,"score_spread":0.22647436447045471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089579029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053792647,0.00008799425,0.9879572,0.0017776906,0.002540227,0.00050755136,0.0000010640699,0.0004917144,0.0012572878],"genre_scores_gemma":[0.96713275,0.00032394065,0.029585129,0.0014245409,0.0010222987,0.00009335534,0.0000036623671,0.000047982176,0.00036633897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996906,0.00047211206,0.0005316267,0.0008026989,0.00037447351,0.00091310125],"domain_scores_gemma":[0.9969193,0.00077583716,0.00021887012,0.0016096691,0.00019376764,0.00028255465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009587126,0.00041861736,0.0004513197,0.00016524324,0.0011724734,0.00048940384,0.0016400829,0.00011578816,0.000028601313],"category_scores_gemma":[0.000014133992,0.00032593793,0.00010760318,0.001754427,0.0000715976,0.00042001944,0.00008393115,0.0006336049,0.00003407075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011308957,0.000046105226,0.00050657947,0.0000123486125,0.000052507054,0.0000030538122,0.0006368543,0.7422884,0.0001901344,0.0032069997,0.0005023192,0.2524416],"study_design_scores_gemma":[0.0008276577,0.0005055592,0.0006132364,0.0014803144,0.000032940603,0.000010313376,0.000033684264,0.9810725,0.00079535047,0.0011355128,0.012733313,0.00075962354],"about_ca_topic_score_codex":0.000027029351,"about_ca_topic_score_gemma":0.0016274919,"teacher_disagreement_score":0.9617535,"about_ca_system_score_codex":0.00020883007,"about_ca_system_score_gemma":0.00007436501,"threshold_uncertainty_score":0.9999193},"labels":[],"label_agreement":null},{"id":"W2089601163","doi":"10.1109/bsc.2010.5472940","title":"LDPC coded two-way MIMO relay networks with physical layer network coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Relay; Low-density parity-check code; Computer science; Relay channel; Linear network coding; Decoding methods; MIMO; Transmission (telecommunications); Coding (social sciences); Wireless network; Wireless; Physical layer; Throughput; Algorithm; Electronic engineering; Computer network; Channel (broadcasting); Telecommunications; Mathematics; Engineering","score_opus":0.02428152809617593,"score_gpt":0.27428642368033485,"score_spread":0.2500048955841589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089601163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04393068,0.0001137055,0.91719985,0.0017777372,0.0006454148,0.0002507944,3.078386e-7,0.0005199073,0.03556163],"genre_scores_gemma":[0.9368733,0.00007408305,0.059808113,0.0012852508,0.0006693538,0.000027715181,0.000004131217,0.000021205613,0.001236806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835056,0.00015791522,0.00023302932,0.00047455906,0.0002591481,0.00052479585],"domain_scores_gemma":[0.9978153,0.0003710289,0.00010510132,0.0013290258,0.00018525805,0.00019424575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047092198,0.0002428306,0.0002672122,0.00004754027,0.00052157487,0.00033635748,0.0013862773,0.00007417726,0.000108568835],"category_scores_gemma":[0.000025896272,0.00018187649,0.00007751564,0.0008145587,0.00011586954,0.00046090444,0.00061736634,0.0008080925,0.00008284434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029414932,0.00013611549,0.0031089103,0.0000035855762,0.00006163381,0.0000158491,0.0006849279,0.05623126,0.0038970204,0.8698085,0.01602597,0.04999684],"study_design_scores_gemma":[0.0006421506,0.0000760327,0.001752144,0.000033851757,0.000009576417,0.000023173223,0.00001018254,0.9791921,0.0006554068,0.00038410616,0.01685395,0.00036732206],"about_ca_topic_score_codex":0.000008196942,"about_ca_topic_score_gemma":0.000462836,"teacher_disagreement_score":0.9229608,"about_ca_system_score_codex":0.000022624374,"about_ca_system_score_gemma":0.00005200573,"threshold_uncertainty_score":0.7416708},"labels":[],"label_agreement":null},{"id":"W2089609964","doi":"10.1109/twc.2012.030812.110493","title":"Distributed Scheduling in Multihop Wireless Networks with Maxmin Fairness Provisioning","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Maximum throughput scheduling; Fairness measure; Multipath routing; Provisioning; Scheduling (production processes); Distributed computing; Max-min fairness; Proportionally fair; Network packet; Fair queuing; Wireless network; Wireless; Dynamic Source Routing; Routing protocol; Dynamic priority scheduling; Throughput; Round-robin scheduling; Resource allocation; Quality of service; Mathematical optimization; Telecommunications","score_opus":0.037199789316201215,"score_gpt":0.28285412616018984,"score_spread":0.24565433684398863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089609964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04750121,0.0005762273,0.9489982,0.0015742917,0.00021736835,0.0004905765,0.000009904231,0.0003386249,0.00029357919],"genre_scores_gemma":[0.9631715,0.0015030297,0.03460433,0.0001836784,0.00002699462,0.00038519423,0.00002951114,0.000036321722,0.00005948372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975603,0.0005813617,0.00054109836,0.00038993513,0.00029714257,0.00063014944],"domain_scores_gemma":[0.9953814,0.00068959873,0.0001844,0.0032956433,0.00022017494,0.00022879773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006346815,0.00032341725,0.00033925983,0.0003219958,0.0011125465,0.00021561315,0.0027299079,0.00014650376,0.000016601478],"category_scores_gemma":[0.000009757707,0.0003075644,0.00009550233,0.0019689961,0.00022448026,0.0011872905,0.00007457818,0.001090044,0.000031508585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082753504,0.0030921586,0.0036332412,0.0000318372,0.00013446767,0.0000048514075,0.005256663,0.44101134,0.0013986565,0.044955593,0.000051812658,0.5003466],"study_design_scores_gemma":[0.00090500363,0.00006001552,0.0023969098,0.00032464287,0.00001907427,0.000018032428,0.00030846763,0.99314976,0.0015568223,0.000022831062,0.00075451133,0.0004839488],"about_ca_topic_score_codex":0.00004817813,"about_ca_topic_score_gemma":0.00068343425,"teacher_disagreement_score":0.9156702,"about_ca_system_score_codex":0.00023916627,"about_ca_system_score_gemma":0.00011061733,"threshold_uncertainty_score":0.99993765},"labels":[],"label_agreement":null},{"id":"W2089671551","doi":"10.1109/glocom.2014.7037213","title":"HePNC: Design of physical layer network coding with heterogeneous modulations","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Computer science; Phase-shift keying; Linear network coding; Physical layer; Computer network; Spectral efficiency; Efficient energy use; Throughput; Bit error rate; Node (physics); Channel (broadcasting); Wireless; Telecommunications; Engineering; Network packet","score_opus":0.05168648801618593,"score_gpt":0.27113429226211183,"score_spread":0.21944780424592591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089671551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066422597,0.00003585355,0.98977184,0.00024352776,0.000030724466,0.000105980405,8.110769e-8,0.00009213783,0.0030775836],"genre_scores_gemma":[0.9038462,0.000017494183,0.095758714,0.00019336025,0.000060850525,0.000008851258,6.831233e-7,0.0000055847563,0.000108280576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924403,0.00017674675,0.00012520423,0.00016888884,0.00013013475,0.00015501912],"domain_scores_gemma":[0.9989405,0.00028171635,0.000059167978,0.0005645089,0.000105097075,0.00004899631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020745194,0.000086368505,0.00013660267,0.000030308083,0.00015121346,0.000049712657,0.00049194635,0.00001770355,0.000013439811],"category_scores_gemma":[0.000015365844,0.00006526377,0.000031743206,0.0003309374,0.000036979316,0.00014966617,0.00017273553,0.00006785414,0.0000120067425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053102017,0.000041465857,0.00041012897,0.0000024773392,0.000018583109,4.300568e-7,0.0003168039,0.64938694,0.001969278,0.32410076,0.000321771,0.023426041],"study_design_scores_gemma":[0.00014347103,0.00011305577,0.00044579594,0.000019258203,0.000003481086,0.0000037027903,0.0000016426305,0.9946958,0.0027439592,0.0010808889,0.00065365195,0.000095297946],"about_ca_topic_score_codex":0.0000017133666,"about_ca_topic_score_gemma":0.000008925041,"teacher_disagreement_score":0.8972039,"about_ca_system_score_codex":0.000011215309,"about_ca_system_score_gemma":0.000019726009,"threshold_uncertainty_score":0.26613793},"labels":[],"label_agreement":null},{"id":"W2089955911","doi":"10.1049/iet-com.2013.0119","title":"Decode and forward relaying for energy‐efficient multiuser cooperative cognitive radio network with outage constraints","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Mathematical optimization; Fractional programming; Telecommunications link; Convergence (economics); Interference (communication); Iterative method; Convex optimization; Constraint (computer-aided design); Power (physics); Telecommunications; Wireless; Nonlinear programming; Algorithm; Regular polygon; Mathematics; Nonlinear system; Channel (broadcasting)","score_opus":0.033484063423222195,"score_gpt":0.28444135291543954,"score_spread":0.25095728949221735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089955911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031696982,0.001327563,0.98616946,0.0026601942,0.000072294206,0.0004906535,0.000014983363,0.00016448855,0.0059306948],"genre_scores_gemma":[0.86988586,0.0007593666,0.12796748,0.0008757971,0.000037410882,0.00029524363,0.000044887947,0.00001957044,0.00011440054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833065,0.0004912562,0.00032020974,0.0003785935,0.0001408162,0.00033845982],"domain_scores_gemma":[0.995258,0.002203085,0.00016769014,0.0017207013,0.00050187594,0.00014866542],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006724555,0.00021620732,0.0002686305,0.00007782044,0.0013283858,0.00024605286,0.0014333931,0.00006924449,0.000008382897],"category_scores_gemma":[0.0002358621,0.00019201175,0.000056555953,0.00043677608,0.00054558186,0.000244886,0.0008678083,0.00024869404,0.0000067051915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038716036,0.00019727458,0.0009072882,0.000010106206,0.00014464783,6.819398e-7,0.0037246696,0.0061021885,0.00015510507,0.8463002,0.0010839289,0.14133523],"study_design_scores_gemma":[0.001673158,0.0001927388,0.0010945178,0.00021149236,0.000042226937,0.000020074913,0.00031878444,0.9580772,0.00017445497,0.00084545044,0.03693189,0.00041801803],"about_ca_topic_score_codex":0.000007965408,"about_ca_topic_score_gemma":0.00030540687,"teacher_disagreement_score":0.951975,"about_ca_system_score_codex":0.000045710058,"about_ca_system_score_gemma":0.00009165671,"threshold_uncertainty_score":0.99997175},"labels":[],"label_agreement":null},{"id":"W2090131660","doi":"10.1109/softcom.2014.7039128","title":"Throughput gain by hybrid TDM/FDM &amp;amp; spatial reuse of resources among nodes and links for inband relaying","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia e Innovación; Gwich'in Renewable Resources Board","keywords":"Backhaul (telecommunications); Computer network; Computer science; Relay; Reuse; Throughput; Telecommunications link; Base station; Engineering; Telecommunications; Wireless","score_opus":0.03369361952818975,"score_gpt":0.2755852823164513,"score_spread":0.24189166278826155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090131660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27962562,0.00044461832,0.7161339,0.0011655368,0.000059144466,0.00015291364,0.0000024186663,0.00006791705,0.0023479608],"genre_scores_gemma":[0.9225305,0.0003592835,0.07522856,0.00044566105,0.000058445356,0.000017649201,0.000009226281,0.000010682221,0.0013400121],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998885,0.0001679677,0.0003014578,0.00030931417,0.00014206111,0.00019421574],"domain_scores_gemma":[0.9980104,0.0006097975,0.0001409569,0.0010308017,0.00013484027,0.00007320175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071015285,0.00013193597,0.0002121261,0.00005922498,0.0002687185,0.00015751769,0.0009039707,0.00006876584,0.000022884913],"category_scores_gemma":[0.00042465862,0.00011363852,0.00004809089,0.00014231258,0.0001281281,0.00028620512,0.0007220772,0.00018540538,0.0000067774563],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014665173,0.0004096468,0.05807006,0.00022333783,0.0001809931,0.0000011746067,0.01953699,0.00094084314,0.042689897,0.069411054,0.25406912,0.5543202],"study_design_scores_gemma":[0.0022192039,0.00021172393,0.005954908,0.00027153952,0.000027483786,0.000009329666,0.00008402414,0.3928578,0.01785756,0.0053020804,0.57437766,0.00082668586],"about_ca_topic_score_codex":0.000090521105,"about_ca_topic_score_gemma":0.00027496173,"teacher_disagreement_score":0.6429049,"about_ca_system_score_codex":0.0000140076245,"about_ca_system_score_gemma":0.000014444563,"threshold_uncertainty_score":0.46340442},"labels":[],"label_agreement":null},{"id":"W2090451557","doi":"10.1109/pacrim.2013.6625491","title":"Performance of physical-layer network coded multi-way relay channels with binary signaling","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Computer science; Throughput; Binary number; Physical layer; Channel (broadcasting); Computer network; Energy consumption; Algorithm; Power (physics); Wireless; Telecommunications; Mathematics; Arithmetic; Electrical engineering; Engineering","score_opus":0.04242304483300537,"score_gpt":0.2614623564904199,"score_spread":0.2190393116574145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090451557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8380731,0.0001466886,0.15879211,0.00039667,0.00008359189,0.00027312853,1.4047241e-7,0.00013544447,0.0020991613],"genre_scores_gemma":[0.9518563,0.00008363566,0.046733692,0.00024842017,0.00007123318,0.000025274076,0.0000013334866,0.000009674116,0.0009704033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990413,0.00009348453,0.00019631996,0.00023987715,0.00017095245,0.00025802347],"domain_scores_gemma":[0.998797,0.00013249382,0.000104851424,0.00065539294,0.00023622652,0.000074061434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018439289,0.00013978609,0.00019749439,0.00004669758,0.00019338248,0.00007302519,0.00077221496,0.00003020488,0.00007698663],"category_scores_gemma":[0.000007287196,0.000098512246,0.00004308773,0.000568327,0.00006205936,0.0005752282,0.00034464538,0.0001520687,0.000089626024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043130407,0.00057080435,0.011243387,0.000064888765,0.0001384995,0.0000039861584,0.006066468,0.7721011,0.10400203,0.031100046,0.0047629876,0.069902636],"study_design_scores_gemma":[0.00031407966,0.00021906542,0.0025185037,0.000089122695,0.000003311601,0.0000018512392,0.000015668082,0.9840136,0.012372962,0.000020355292,0.000269839,0.00016164013],"about_ca_topic_score_codex":0.000009694653,"about_ca_topic_score_gemma":0.0000034266652,"teacher_disagreement_score":0.21191247,"about_ca_system_score_codex":0.000015945685,"about_ca_system_score_gemma":0.0000277404,"threshold_uncertainty_score":0.40172127},"labels":[],"label_agreement":null},{"id":"W2090536934","doi":"10.1109/spawc.2013.6612071","title":"Low-complexity SNR-based channel pairing in multichannel MABC-based two-way relaying","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Pairing; Relay; Computer science; Maximization; Metric (unit); Channel (broadcasting); Greedy algorithm; Scheme (mathematics); Power (physics); Algorithm; Topology (electrical circuits); Theoretical computer science; Mathematical optimization; Mathematics; Combinatorics; Computer network; Physics; Engineering","score_opus":0.07393996484687977,"score_gpt":0.28427080124246196,"score_spread":0.2103308363955822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090536934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095302515,0.00013197515,0.8920707,0.0064723836,0.00026372928,0.0005911146,6.976978e-7,0.00049404387,0.004672803],"genre_scores_gemma":[0.9493421,0.000013141384,0.047534473,0.0027610434,0.00003950529,0.000117295094,0.000005477334,0.000016184797,0.00017080751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980758,0.00029177943,0.00040895797,0.00048344544,0.00024612632,0.00049388554],"domain_scores_gemma":[0.9981339,0.00034272962,0.00009838886,0.0010825066,0.00018870512,0.00015378903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005835092,0.00023185587,0.00024230509,0.0002629923,0.00028705623,0.0002625897,0.0012906139,0.000063313564,0.0002580062],"category_scores_gemma":[0.00009815519,0.00021631109,0.00008466878,0.0007926039,0.000079422796,0.0005751394,0.0004128933,0.00028654627,0.00025197913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008791491,0.0032852108,0.023959922,0.00035198728,0.000092903116,0.00010203212,0.0074541946,0.37216428,0.03319988,0.19872409,0.009069223,0.35150835],"study_design_scores_gemma":[0.0011617397,0.000031605814,0.006871827,0.0001150123,0.0000015961842,9.438296e-7,0.000044930533,0.98553836,0.0049783704,0.00082435797,0.00013175193,0.00029952376],"about_ca_topic_score_codex":0.00017234808,"about_ca_topic_score_gemma":0.0005634203,"teacher_disagreement_score":0.85403955,"about_ca_system_score_codex":0.00012988271,"about_ca_system_score_gemma":0.000081593345,"threshold_uncertainty_score":0.88209105},"labels":[],"label_agreement":null},{"id":"W2090546645","doi":"10.1109/tpds.2015.2417163","title":"Achieving Optimal Block Pipelining in Organized Network Coded Gossip","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Linear network coding; Gossip; Network topology; Block (permutation group theory); Permutation (music); Random permutation; Overhead (engineering); Theoretical computer science; Algorithm; Topology (electrical circuits); Combinatorics; Mathematics; Computer network","score_opus":0.048527948835656455,"score_gpt":0.26994644799408163,"score_spread":0.22141849915842518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090546645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021837514,0.0010654645,0.9753134,0.00043573885,0.0005887921,0.00026366714,0.000014394475,0.00018678088,0.000294242],"genre_scores_gemma":[0.995785,0.0002555324,0.0035558783,0.00008306699,0.000060558854,0.000054940592,0.000011394898,0.0000114992645,0.00018212524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982946,0.00034395364,0.00044275436,0.00035918647,0.00021519959,0.00034429823],"domain_scores_gemma":[0.99886596,0.00017715683,0.00010214078,0.0004931437,0.0001372932,0.00022428558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006286671,0.00020069562,0.00031790324,0.00009357465,0.0003134283,0.00028020854,0.00046575797,0.0001018746,0.0000044682847],"category_scores_gemma":[0.000017398206,0.00018886547,0.000048022022,0.0007941142,0.000043984543,0.00029626125,0.000014197887,0.0003321989,0.000027093369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048141632,0.00009207352,0.00020643846,0.000008646971,0.000022926508,0.000009741452,0.000722754,0.99475485,0.00012616385,0.0010831123,0.00096986897,0.001955287],"study_design_scores_gemma":[0.0022680652,0.00012467563,0.0004813415,0.00017599048,0.000013206253,0.000060587954,0.00038651054,0.9925384,0.000036590856,0.00003131382,0.0035237975,0.00035951566],"about_ca_topic_score_codex":0.000037425536,"about_ca_topic_score_gemma":0.00006315841,"teacher_disagreement_score":0.97394747,"about_ca_system_score_codex":0.00009939304,"about_ca_system_score_gemma":0.00009622614,"threshold_uncertainty_score":0.77017105},"labels":[],"label_agreement":null},{"id":"W2090690820","doi":"10.1109/glocom.2014.7037056","title":"Achievable rates for the fading three-hop half-duplex relay network using buffer-aided relaying","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Relay; Computer science; Additive white Gaussian noise; Computer network; Buffer (optical fiber); Hop (telecommunications); Electronic engineering; Real-time computing; Decoding methods; Algorithm; Telecommunications; Engineering","score_opus":0.08150937003146136,"score_gpt":0.32220685862314086,"score_spread":0.2406974885916795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090690820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008572077,0.001318535,0.9835396,0.0029833722,0.00054645515,0.00043551062,2.2117926e-7,0.0002554011,0.002348853],"genre_scores_gemma":[0.7823683,0.00021546357,0.21486124,0.0013845896,0.00037470527,0.000051762887,0.000002623079,0.000024984483,0.0007163154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830294,0.00023673958,0.00035505884,0.00040192937,0.00019034956,0.00051297544],"domain_scores_gemma":[0.9962205,0.002144938,0.00014898325,0.0012241955,0.00017692141,0.00008442597],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017245506,0.00020854174,0.00023362169,0.000055446966,0.0018289603,0.0005099033,0.0016334493,0.00007331552,0.000036404843],"category_scores_gemma":[0.00022158082,0.00014537058,0.0001227344,0.000624015,0.00006910931,0.0005156592,0.0007224931,0.00026670314,0.00002534313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020254016,0.000033988803,0.0017662188,0.000014408406,0.00007943128,7.09061e-7,0.0005853615,0.27407637,0.0023668094,0.6127739,0.007555602,0.10072693],"study_design_scores_gemma":[0.00031322252,0.00004138011,0.0003117982,0.000049369657,0.000012562274,0.0000071018994,0.00002697194,0.96178883,0.00030438587,0.0016316306,0.035297412,0.00021534518],"about_ca_topic_score_codex":0.00003345124,"about_ca_topic_score_gemma":0.0002526763,"teacher_disagreement_score":0.77379626,"about_ca_system_score_codex":0.00006421165,"about_ca_system_score_gemma":0.000043270866,"threshold_uncertainty_score":0.99947053},"labels":[],"label_agreement":null},{"id":"W2090732764","doi":"10.1049/iet-com.2012.0629","title":"Optimal diversity multiplexing tradeoff for opportunistic relaying coded cooperation protocols with quantised channel state information feedback","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Channel state information; Multiplexing; Computer network; Channel (broadcasting); Diversity (politics); State (computer science); Telecommunications; Wireless; Algorithm; Political science","score_opus":0.10915180154350315,"score_gpt":0.31326375187923905,"score_spread":0.2041119503357359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090732764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013510427,0.000019640334,0.98788357,0.0032929075,0.000046733123,0.0055194693,0.000030342091,0.00028549353,0.001570785],"genre_scores_gemma":[0.8259095,0.00010859456,0.16994804,0.0005055309,0.000016797247,0.0031164668,0.0002840866,0.000013212615,0.000097760814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984732,0.00034954812,0.00044675975,0.00022890508,0.00021984844,0.00028172386],"domain_scores_gemma":[0.99620134,0.00052508566,0.00031334918,0.002226605,0.0006075953,0.00012601672],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00085629715,0.0001934325,0.00022418969,0.00013948555,0.0023660397,0.0004306391,0.0024382279,0.00006126742,0.0000057503526],"category_scores_gemma":[0.00022032055,0.00018741867,0.00006131746,0.00047616227,0.0001435885,0.0017019125,0.0013337409,0.0002652411,0.000021266305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032203356,0.00076221686,0.0010717086,0.0001904255,0.00020378412,8.970145e-7,0.03407344,0.04650372,0.0022305653,0.7827265,0.0039006432,0.12801404],"study_design_scores_gemma":[0.0015701681,0.00020620004,0.000797408,0.00012188453,0.000011939892,0.0000047663493,0.00012768937,0.9753521,0.00019686119,0.0003993763,0.020916179,0.0002953908],"about_ca_topic_score_codex":0.00001767914,"about_ca_topic_score_gemma":0.00011855766,"teacher_disagreement_score":0.92884845,"about_ca_system_score_codex":0.00008927048,"about_ca_system_score_gemma":0.00012317726,"threshold_uncertainty_score":0.9989327},"labels":[],"label_agreement":null},{"id":"W2090816039","doi":"10.1109/twc.2013.092013.121275","title":"Cooperative Beamforming for Cognitive Radio Systems with Asynchronous Interference to Primary User","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Beamforming; Computer science; Relay; WSDMA; Asynchronous communication; Cognitive radio; Single antenna interference cancellation; Interference (communication); Electronic engineering; Computer network; Telecommunications; Power (physics); Wireless; Precoding; Engineering; Decoding methods; MIMO; Channel (broadcasting)","score_opus":0.03736493990471681,"score_gpt":0.274454828046818,"score_spread":0.23708988814210116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090816039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055059176,0.00022375483,0.9879585,0.0024604097,0.00019495274,0.0022143067,0.00003511908,0.00027360066,0.0011334331],"genre_scores_gemma":[0.9421146,0.0005659771,0.05208564,0.00072673225,0.000018982419,0.0038170535,0.000020805595,0.00003228943,0.00061792665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982979,0.000294502,0.0004167578,0.00043286165,0.00019908318,0.00035885116],"domain_scores_gemma":[0.9953966,0.0011384962,0.00012959888,0.0021989709,0.0009305585,0.00020575742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019589618,0.00028341953,0.00033036197,0.00025241214,0.0012873185,0.00046570512,0.0023788905,0.000078968376,0.000023565795],"category_scores_gemma":[0.000012832297,0.0002540946,0.00008325716,0.00082966895,0.00018672668,0.0009446627,0.000052032694,0.0004360289,0.00014264412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023238697,0.002680038,0.00007630367,0.00014287936,0.0008637162,0.000002367501,0.019592442,0.07428403,0.01399401,0.08808141,0.0021250644,0.79792535],"study_design_scores_gemma":[0.0034192617,0.0021870525,0.000739492,0.0019551064,0.00014025279,0.00007795718,0.0024227332,0.9639294,0.014298939,0.0001216864,0.008786997,0.0019210957],"about_ca_topic_score_codex":0.00006301052,"about_ca_topic_score_gemma":0.00026062448,"teacher_disagreement_score":0.9366087,"about_ca_system_score_codex":0.00023809302,"about_ca_system_score_gemma":0.00021133121,"threshold_uncertainty_score":0.9999911},"labels":[],"label_agreement":null},{"id":"W2090884038","doi":"10.1109/glocom.2010.5683620","title":"A Useful Integral for Wireless Communication Theory and Its Application in Amplify-And-Forward Multihop Relaying","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Nakagami distribution; Wireless; Hypergeometric function; Bessel function; Computer science; Fading; Random variable; Dual (grammatical number); Outage probability; Mathematics; Applied mathematics; Topology (electrical circuits); Telecommunications; Decoding methods; Statistics; Mathematical analysis","score_opus":0.027223000466904162,"score_gpt":0.29739236614266595,"score_spread":0.2701693656757618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090884038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42032823,0.00043886472,0.57614255,0.001619217,0.000045358716,0.0005396964,9.662195e-7,0.00010033729,0.00078478904],"genre_scores_gemma":[0.9755818,0.0006432382,0.023096664,0.00034317424,0.000011948017,0.00018728912,0.0000074146537,0.0000073043516,0.00012114589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999196,0.00015934954,0.00020417267,0.00024065595,0.00006201802,0.00013783661],"domain_scores_gemma":[0.9984349,0.00073197647,0.00006847315,0.000608238,0.00010101121,0.000055429027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011995785,0.000097525124,0.000120013916,0.00009169451,0.00022310327,0.0001109876,0.0005956475,0.00007510997,0.0000037349837],"category_scores_gemma":[0.00013918441,0.000087085005,0.000018403936,0.0002012789,0.000053964955,0.00038804614,0.00042963427,0.0003012365,0.0000037768766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010410136,0.000021416667,0.0012926778,0.0000059361405,0.0000031174363,3.999699e-8,0.0010739304,0.000003000576,0.00697255,0.81756234,0.00002076918,0.17303377],"study_design_scores_gemma":[0.0012191632,0.000043566575,0.014508197,0.000054763634,0.0000066784787,0.000010805529,0.00031830996,0.94773287,0.0030141554,0.022564704,0.010180011,0.00034677904],"about_ca_topic_score_codex":0.000012477248,"about_ca_topic_score_gemma":0.0006446747,"teacher_disagreement_score":0.9477299,"about_ca_system_score_codex":0.000016421673,"about_ca_system_score_gemma":0.000019512996,"threshold_uncertainty_score":0.35512236},"labels":[],"label_agreement":null},{"id":"W2090966880","doi":"10.1109/lcomm.2015.2477816","title":"On Network Coding for Funnel Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear network coding; Multicast; Funnel; Computer science; Computer network; Coding (social sciences); Unicast; Theoretical computer science; Distributed computing; Mathematics","score_opus":0.1172964217603071,"score_gpt":0.3171593812931596,"score_spread":0.19986295953285252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090966880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064455066,0.0009415963,0.96117723,0.032466598,0.0007744603,0.00041207453,0.0000018252348,0.00029445626,0.0032871906],"genre_scores_gemma":[0.85447097,0.00069662475,0.12638353,0.017685546,0.00027161598,0.0002898902,0.000032198506,0.000027082157,0.0001425431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984441,0.0003579234,0.00033117898,0.00029784453,0.00017711149,0.0003918509],"domain_scores_gemma":[0.99445486,0.0010929989,0.00014856468,0.003912829,0.00021713786,0.00017361961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094510644,0.00018376212,0.00019820863,0.000098848,0.0007151464,0.00024199889,0.0041976706,0.000061793726,0.000003147874],"category_scores_gemma":[0.00012923357,0.00018953906,0.000101491256,0.000639872,0.00012391339,0.0003364463,0.0006551888,0.0003374496,0.000050204424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018135834,0.0000979998,0.00009825997,0.0000032241824,0.00004285474,8.142786e-7,0.000585469,0.10129251,0.0003982036,0.5372364,0.33848956,0.021736586],"study_design_scores_gemma":[0.00079408544,0.00008380131,0.00014142852,0.000073988136,0.000011304928,0.0000054399525,0.000025302938,0.85303265,0.00006174474,0.0025657804,0.14284751,0.00035699722],"about_ca_topic_score_codex":0.000003508078,"about_ca_topic_score_gemma":0.000030878164,"teacher_disagreement_score":0.8538264,"about_ca_system_score_codex":0.00013744802,"about_ca_system_score_gemma":0.000072795665,"threshold_uncertainty_score":0.78003865},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.050875701247026145,"score_gpt":0.2918621337912376,"score_spread":0.24098643254421145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091131578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035952157,0.00037360977,0.98877764,0.0044561336,0.0002867354,0.0007807652,0.00001171707,0.0004393711,0.0012788402],"genre_scores_gemma":[0.90910685,0.0015043464,0.08707649,0.00048159822,0.00003604626,0.001041835,0.000012186682,0.00003428711,0.00070633396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983277,0.00037651852,0.00034354237,0.00029833295,0.0002175455,0.0004363801],"domain_scores_gemma":[0.99595153,0.000798727,0.00014336908,0.0026193745,0.0002975649,0.00018943676],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005714526,0.00023923985,0.00022356353,0.0002357403,0.0016497677,0.0001356067,0.0019441632,0.00011402677,0.000028062284],"category_scores_gemma":[0.000010677421,0.00022649334,0.00012753508,0.0010365914,0.00015985471,0.0011148268,0.000024211811,0.000556088,0.00006791381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015855575,0.0029129244,0.000610156,0.00004796004,0.00042012255,3.7017494e-7,0.0060774237,0.021223627,0.0076012486,0.35380402,0.002657138,0.60448647],"study_design_scores_gemma":[0.0025688189,0.00070556486,0.0011911253,0.00028374617,0.00018841824,0.000098134085,0.00037880466,0.8133221,0.030427601,0.0002898009,0.14909092,0.0014549725],"about_ca_topic_score_codex":0.000016878344,"about_ca_topic_score_gemma":0.0002580181,"teacher_disagreement_score":0.9055117,"about_ca_system_score_codex":0.00019696204,"about_ca_system_score_gemma":0.00010407071,"threshold_uncertainty_score":0.99964994},"labels":[],"label_agreement":null},{"id":"W2091361788","doi":"10.1109/iswcs.2007.4392374","title":"A Bandwidth-efficient Coded User-Cooperation Scheme for Flat Block Fading Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fading; Computer science; Decoding methods; Decodes; Bandwidth (computing); Algorithm; Encoding (memory); Block (permutation group theory); Theoretical computer science; Computer network; Mathematics; Artificial intelligence","score_opus":0.0445013389020922,"score_gpt":0.3004860670925405,"score_spread":0.2559847281904483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091361788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041556828,0.00017573123,0.95211595,0.0012406585,0.00040805963,0.00046301173,6.053428e-7,0.00024202425,0.0037971518],"genre_scores_gemma":[0.9010216,0.00004006914,0.09614295,0.00078041834,0.000120614575,0.00003412519,0.0000056815566,0.000010323243,0.0018442081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987835,0.000043056378,0.00030992302,0.0003374844,0.00016897637,0.00035703092],"domain_scores_gemma":[0.9986981,0.00023905998,0.000067168265,0.00057884445,0.00030589668,0.00011089459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009854395,0.0001457735,0.00015019298,0.00012956146,0.00045414062,0.00024587673,0.000701274,0.00006083977,0.00003445376],"category_scores_gemma":[0.00008955059,0.00013072863,0.00006929309,0.0005166707,0.000024953108,0.00023749238,0.00027022357,0.000107648564,0.000038598857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046806494,0.00019826672,0.00023974721,0.000022110797,0.00004938106,0.00000396744,0.0039310157,0.014866417,0.09841424,0.81657153,0.0056479177,0.06000857],"study_design_scores_gemma":[0.00063984824,0.00006753487,0.000112929985,0.000026245567,0.0000030759313,0.0000065317536,0.000030188616,0.91718864,0.053296037,0.00010567757,0.028288722,0.0002345388],"about_ca_topic_score_codex":0.000002837917,"about_ca_topic_score_gemma":0.00004451408,"teacher_disagreement_score":0.90232223,"about_ca_system_score_codex":0.00007342552,"about_ca_system_score_gemma":0.00004543431,"threshold_uncertainty_score":0.5330959},"labels":[],"label_agreement":null},{"id":"W2091382910","doi":"10.1109/tvt.2012.2226483","title":"An Opportunistic Protocol Employing Independent Codebooks for Bidirectional Cooperative Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Outage probability; Computer science; Linear network coding; Relay; Computer network; Protocol (science); Signal-to-noise ratio (imaging); Selection (genetic algorithm); Coding (social sciences); Mutual information; Channel code; Channel (broadcasting); Topology (electrical circuits); Algorithm; Decoding methods; Mathematics; Fading; Telecommunications; Power (physics); Statistics; Network packet","score_opus":0.05015116228709587,"score_gpt":0.3230667444334736,"score_spread":0.27291558214637773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091382910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009863182,0.000026806021,0.98507315,0.000533515,0.00038322693,0.0121605685,0.0000073834926,0.0006820495,0.00014699754],"genre_scores_gemma":[0.92941326,0.000020267637,0.011582286,0.00033583748,0.000067160865,0.058382485,0.000006081117,0.000025396572,0.00016725202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985347,0.00015754644,0.00030618868,0.00038416023,0.00017479021,0.00044264997],"domain_scores_gemma":[0.9985434,0.00011355776,0.00009680404,0.0008339017,0.00026106767,0.0001512804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004090344,0.00021966617,0.00021818356,0.00035673383,0.0007818358,0.00008829738,0.00079021504,0.00025864792,0.000038067206],"category_scores_gemma":[0.000011591901,0.00021257992,0.00009114996,0.0005581227,0.0001236837,0.0004215009,0.000011282254,0.0005049317,0.000017731134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017026447,0.0025827526,0.00030585026,0.000037835718,0.00032861962,0.000012587178,0.000748266,0.117834345,0.030058632,0.2193541,0.00042319097,0.62814355],"study_design_scores_gemma":[0.0016821749,0.0008949444,0.00010492266,0.000071043534,0.000037787082,0.00012066419,0.00009340558,0.9099651,0.04605219,0.0006062189,0.039693076,0.00067844416],"about_ca_topic_score_codex":0.0000020669943,"about_ca_topic_score_gemma":0.000028836124,"teacher_disagreement_score":0.97349083,"about_ca_system_score_codex":0.00012196231,"about_ca_system_score_gemma":0.000094780655,"threshold_uncertainty_score":0.86687577},"labels":[],"label_agreement":null},{"id":"W2091385880","doi":"10.1109/iwcmc.2012.6314170","title":"Buffer-aided relaying with mixed rate transmission","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Throughput; Computer network; Channel state information; Relay channel; Transmission (telecommunications); Fading; Node (physics); Channel (broadcasting); Wireless; Telecommunications; Engineering; Power (physics)","score_opus":0.04098159486946639,"score_gpt":0.2641049592872534,"score_spread":0.22312336441778702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091385880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023726886,0.000602408,0.95449626,0.0019879376,0.00009983154,0.000090096204,4.465967e-8,0.00020013546,0.018796414],"genre_scores_gemma":[0.92780954,0.00021368348,0.07022151,0.00045968118,0.000028423106,0.000008012464,9.3347734e-7,0.000005558046,0.001252664],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992715,0.00016603872,0.00011235123,0.00013209975,0.00009984328,0.00021813645],"domain_scores_gemma":[0.9992412,0.000104393606,0.000030192685,0.00045324245,0.000051052983,0.00011993695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042388806,0.00008635696,0.00008529426,0.00004050039,0.0002026509,0.00007297519,0.0004599451,0.00002494795,0.00008796314],"category_scores_gemma":[0.000010020509,0.000058323112,0.000023403698,0.00030456745,0.00001960802,0.00061383215,0.000114267605,0.00010796723,0.00006256418],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002597427,0.00017771542,0.0039460235,0.00001142769,0.000031394156,0.000003603224,0.004459421,0.00011546284,0.019287324,0.31404984,0.0052513815,0.6526404],"study_design_scores_gemma":[0.0033653192,0.00040154674,0.090904586,0.00033246537,0.0000341133,0.00009127195,0.00031412966,0.29127508,0.114838466,0.0011160653,0.49561408,0.0017128614],"about_ca_topic_score_codex":0.0000020598798,"about_ca_topic_score_gemma":0.0000038445924,"teacher_disagreement_score":0.90408266,"about_ca_system_score_codex":0.000018098164,"about_ca_system_score_gemma":0.00002036164,"threshold_uncertainty_score":0.23783475},"labels":[],"label_agreement":null},{"id":"W2091545275","doi":"10.1109/vetecs.2010.5493866","title":"Nomadic Relay-Directed Joint Power and Subchannel Allocation in OFDMA-Based Cellular Fixed Relay Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer network; Computer science; Throughput; Channel allocation schemes; Wireless network; Power control; Wireless; Cellular network; Power (physics); Telecommunications","score_opus":0.01874497609652333,"score_gpt":0.22798606850031777,"score_spread":0.20924109240379443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091545275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40588203,0.0007378961,0.5835684,0.005895008,0.00064312544,0.0003726861,4.3782998e-7,0.00045193933,0.0024484687],"genre_scores_gemma":[0.9804445,0.00018125158,0.018040435,0.00076027436,0.000032867272,0.0000370841,0.000008357504,0.000011921748,0.00048334402],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998728,0.00018339939,0.00031313623,0.00037880056,0.00014086842,0.00025581793],"domain_scores_gemma":[0.99872327,0.00015499332,0.00008945853,0.0007784574,0.00013988253,0.00011395395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006268938,0.00015736042,0.00017473185,0.00017237982,0.00016755964,0.00013912702,0.000524697,0.00012894532,0.00012411654],"category_scores_gemma":[0.000079187164,0.00014578545,0.000040315463,0.0006684641,0.00006163095,0.00027321305,0.00024995214,0.00048014848,0.000015515327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011656452,0.0013765641,0.031422082,0.00005334508,0.00010318276,0.00007560115,0.0066397605,0.03736481,0.4055103,0.35645604,0.015213429,0.14566831],"study_design_scores_gemma":[0.00052601116,0.000036657217,0.017302092,0.00003351048,0.0000028239383,0.000002611951,0.000011160553,0.97587544,0.0043179127,0.000072959054,0.0016065146,0.00021231936],"about_ca_topic_score_codex":0.000031775195,"about_ca_topic_score_gemma":0.00054872263,"teacher_disagreement_score":0.9385106,"about_ca_system_score_codex":0.000030030398,"about_ca_system_score_gemma":0.00006103905,"threshold_uncertainty_score":0.59449583},"labels":[],"label_agreement":null},{"id":"W2091604413","doi":"10.1109/lcomm.2012.032612.112567","title":"Outage Capacity Analysis for OFDM Decode-and-Forward Systems in Frequency Selective Rayleigh Fading Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Rayleigh fading; Independent and identically distributed random variables; Fading; Relay; Computer science; Cumulative distribution function; Probability density function; Multiplexing; Gaussian; Telecommunications; Topology (electrical circuits); Random variable; Mathematics; Statistics; Decoding methods; Channel (broadcasting); Physics","score_opus":0.08384391929300251,"score_gpt":0.3051105766789817,"score_spread":0.22126665738597923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091604413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15453759,0.0028646109,0.83442223,0.0063261567,0.00038320766,0.0007012253,0.000012808652,0.00014459634,0.000607564],"genre_scores_gemma":[0.9526993,0.0006179372,0.045248464,0.00092481135,0.00005737327,0.0003994121,0.000018605002,0.000013554811,0.00002052223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980574,0.0005972198,0.0004555503,0.00029476674,0.00014917659,0.00044587822],"domain_scores_gemma":[0.99640673,0.00081694976,0.00019716573,0.0022877264,0.0001590417,0.00013236755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012114028,0.0001974319,0.00036021974,0.0005530476,0.0005646027,0.00020703887,0.0021388112,0.000074142576,0.000002424222],"category_scores_gemma":[0.00010375252,0.00020713666,0.00013340975,0.0017172478,0.00013513041,0.0008870033,0.00042757016,0.0003332077,0.000009252134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025890778,0.0010302282,0.297579,0.00014101806,0.0023765888,0.0000021421429,0.074123845,0.024626622,0.06139061,0.517772,0.00413919,0.016792845],"study_design_scores_gemma":[0.0019139209,0.0000918012,0.072228275,0.00022247953,0.00042650424,0.0000258046,0.0005984417,0.9051331,0.002269179,0.0014799976,0.013851297,0.0017591676],"about_ca_topic_score_codex":0.0001646493,"about_ca_topic_score_gemma":0.00032703736,"teacher_disagreement_score":0.8805065,"about_ca_system_score_codex":0.00023905253,"about_ca_system_score_gemma":0.000027857786,"threshold_uncertainty_score":0.84467876},"labels":[],"label_agreement":null},{"id":"W2091738552","doi":"10.1109/vtcfall.2014.6966000","title":"Hybrid-Optimization-Based Power Allocation for Cognitive Relay Transmission","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rayleigh fading; Relay; Computer science; Fading; Interference (communication); Transmission (telecommunications); Cognitive radio; Power (physics); Mathematical optimization; Telecommunications; Channel (broadcasting); Wireless; Mathematics","score_opus":0.02159641763817679,"score_gpt":0.268157598780582,"score_spread":0.2465611811424052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091738552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017763302,0.00005648601,0.98784035,0.0035122195,0.00007439295,0.00026295378,6.297444e-7,0.00016126824,0.007914058],"genre_scores_gemma":[0.78504854,0.00002859103,0.21253166,0.0018992679,0.000015080529,0.00004537516,0.000024637635,0.000006791063,0.00040005916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928635,0.00010935383,0.00015647372,0.00021995472,0.0001040957,0.0001237655],"domain_scores_gemma":[0.99883515,0.00045618013,0.000049476053,0.0002999098,0.00029738288,0.00006190127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033266286,0.000085315995,0.00008315122,0.000061090366,0.0002226991,0.00008641589,0.000362978,0.000026304575,0.00010245673],"category_scores_gemma":[0.00011093982,0.00007489331,0.000046966798,0.00015830742,0.000020427207,0.00021701476,0.0000344813,0.00005444918,0.000015481863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005100086,0.00024593188,0.000081954684,0.000018231334,0.000024512337,3.196696e-7,0.0007846577,0.30509293,0.00092366955,0.21021917,0.0054548085,0.47710282],"study_design_scores_gemma":[0.0005656627,0.000082955194,0.00005753178,0.000030217932,0.000003651071,4.8381713e-7,0.000005763413,0.98077047,0.0035145662,0.00022705391,0.014626783,0.000114876595],"about_ca_topic_score_codex":8.4493826e-7,"about_ca_topic_score_gemma":0.0000016071525,"teacher_disagreement_score":0.7848709,"about_ca_system_score_codex":0.000018407589,"about_ca_system_score_gemma":0.000049510847,"threshold_uncertainty_score":0.30540603},"labels":[],"label_agreement":null},{"id":"W2092232164","doi":"10.1145/1582379.1582431","title":"A simple decorrelate-and-forward relaying scheme for multiuser wireless CDMA networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Computer science; Precoding; Wireless; Simple (philosophy); Signal-to-noise ratio (imaging); Code division multiple access; Wireless network; Computer network; Power (physics); Telecommunications; MIMO; Physics; Channel (broadcasting)","score_opus":0.02850344773468201,"score_gpt":0.2885257635013209,"score_spread":0.2600223157666389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092232164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02178282,0.00042871365,0.97358453,0.0017155646,0.00011425619,0.00026850638,2.8702618e-7,0.00024162693,0.0018637185],"genre_scores_gemma":[0.9215592,0.0005232436,0.07506625,0.0022823315,0.000053093063,0.000024142904,0.0000043079503,0.0000080673535,0.0004793448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990055,0.000049518916,0.0002368595,0.0003152075,0.000092593364,0.00030031783],"domain_scores_gemma":[0.9989199,0.00023390814,0.000063678475,0.00055941497,0.00011061898,0.00011247369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032621686,0.0001403709,0.0001680925,0.000058182075,0.000373573,0.00018934,0.00062309514,0.000076912365,0.000017090084],"category_scores_gemma":[0.0000440131,0.00012425164,0.00006508954,0.00028212607,0.000023517923,0.00039545988,0.00025053654,0.00017105471,0.000009669501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017082251,0.000062347666,0.0019355338,0.0000043009186,0.00002233144,0.0000018621922,0.000502567,0.0010694793,0.00053035334,0.37497908,0.006066549,0.6148085],"study_design_scores_gemma":[0.00050203153,0.000065577486,0.002340333,0.000018374398,0.0000035546557,0.00000421141,0.000017671742,0.98319024,0.00013352268,0.0011116212,0.012421505,0.00019136738],"about_ca_topic_score_codex":0.0000029917817,"about_ca_topic_score_gemma":0.00002630805,"teacher_disagreement_score":0.98212075,"about_ca_system_score_codex":0.00002777745,"about_ca_system_score_gemma":0.00002210422,"threshold_uncertainty_score":0.50668347},"labels":[],"label_agreement":null},{"id":"W2092337681","doi":"10.1109/pacrim.2013.6625490","title":"Optimal precoding for multi-way relay channels with QAM constellations","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Precoding; QAM; Quadrature amplitude modulation; Relay; Zero-forcing precoding; Computer science; Constellation; Channel (broadcasting); Linear network coding; Electronic engineering; Topology (electrical circuits); Telecommunications; Computer network; MIMO; Engineering; Power (physics); Electrical engineering; Bit error rate; Physics","score_opus":0.08550664724704649,"score_gpt":0.2994479133383447,"score_spread":0.2139412660912982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092337681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007816612,0.00009339929,0.98203975,0.0020953263,0.00011910061,0.0005834145,5.319348e-7,0.00018116654,0.007070681],"genre_scores_gemma":[0.55949914,0.00003533925,0.437474,0.00023101192,0.000024083716,0.000103455415,0.0000021640253,0.0000055640344,0.0026252521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930835,0.000042753913,0.000154448,0.00022359246,0.00007584218,0.00019498597],"domain_scores_gemma":[0.999009,0.00018605455,0.000052143314,0.00045001094,0.00022738376,0.00007536908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014652169,0.000095477444,0.00010234002,0.00005941211,0.0003110278,0.00025680958,0.0004955848,0.000030977986,0.00016116038],"category_scores_gemma":[0.000026931355,0.00007439145,0.00003367365,0.00022510985,0.00004007894,0.0005314097,0.00017408069,0.000077933226,0.000081867154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015097832,0.00032327816,0.0019411083,0.000028401779,0.00013543422,0.0000013818735,0.0058051436,0.057161033,0.0033824956,0.64008003,0.023658449,0.26746812],"study_design_scores_gemma":[0.00044322424,0.00006592193,0.00039846983,0.000021635009,0.000002649456,0.0000054023103,0.00005061131,0.98987615,0.0013131315,0.000040561386,0.0076325764,0.00014964075],"about_ca_topic_score_codex":0.0000057099305,"about_ca_topic_score_gemma":0.00001825308,"teacher_disagreement_score":0.9327151,"about_ca_system_score_codex":0.0000210447,"about_ca_system_score_gemma":0.00003285027,"threshold_uncertainty_score":0.30335954},"labels":[],"label_agreement":null},{"id":"W2093201673","doi":"10.1109/lcomm.2015.2418780","title":"Fundamental Relations Between Reactive and Proactive Relay-Selection Strategies","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Selection (genetic algorithm); Relay channel; Computer science; Equivalence (formal languages); Additive white Gaussian noise; Channel (broadcasting); Computer network; Telecommunications; Mathematics; Artificial intelligence; Power (physics)","score_opus":0.10626306626282875,"score_gpt":0.3214321035000524,"score_spread":0.21516903723722366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093201673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30621126,0.0012266366,0.6263363,0.05129615,0.0002451793,0.00077048637,0.00000916075,0.0005877311,0.013317123],"genre_scores_gemma":[0.9491296,0.00017337405,0.04991523,0.00051062956,0.000045870558,0.000090776,0.000021203918,0.000011622233,0.00010172343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99856853,0.00051883917,0.00026394514,0.00027405075,0.00018343733,0.00019119788],"domain_scores_gemma":[0.997735,0.0003527744,0.00014661276,0.0014399334,0.0001915269,0.00013412989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004554783,0.00014995459,0.00015113331,0.0001692629,0.00063798757,0.0003269982,0.0013201307,0.00005826113,0.0000032062792],"category_scores_gemma":[0.000056654837,0.0001588175,0.00003819885,0.0006216126,0.00025037816,0.0015493949,0.00054262334,0.00044472233,0.000047162343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063911364,0.0008345437,0.09604605,0.000021295595,0.0009437394,0.0000057618995,0.068421826,0.0039661694,0.06005836,0.576827,0.049920794,0.14289056],"study_design_scores_gemma":[0.006697313,0.0010195753,0.3871589,0.00040001262,0.0003651757,0.00022423868,0.012919157,0.3197652,0.009660207,0.017215416,0.24047634,0.004098444],"about_ca_topic_score_codex":0.000042530406,"about_ca_topic_score_gemma":0.000093972914,"teacher_disagreement_score":0.64291835,"about_ca_system_score_codex":0.00024998793,"about_ca_system_score_gemma":0.00014614215,"threshold_uncertainty_score":0.647639},"labels":[],"label_agreement":null},{"id":"W2093444982","doi":"10.1049/iet-com.2012.0234","title":"Bit‐error‐rate performance improvement of mobile dual‐hop relaying systems using directional antennas","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Plan for Science, Technology and Innovation; Natural Sciences and Engineering Research Council of Canada; King Saud University","keywords":"Beamwidth; Bit error rate; Computer science; Orthogonal frequency-division multiplexing; Relay; Electronic engineering; Doppler effect; Antenna (radio); Telecommunications; Physics; Engineering; Decoding methods","score_opus":0.07334655323374006,"score_gpt":0.3047961387594709,"score_spread":0.23144958552573086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093444982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85139436,0.007168946,0.12687698,0.0023091713,0.0008202115,0.0017031597,0.000012513833,0.00042815975,0.009286483],"genre_scores_gemma":[0.9773356,0.0026642592,0.019176317,0.00012398452,0.000026958456,0.00030825607,0.000013151454,0.00001331624,0.00033816727],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849474,0.0002878231,0.00055491674,0.00022910455,0.00019785645,0.00023557326],"domain_scores_gemma":[0.99578637,0.0002925639,0.00030384245,0.0029496474,0.0005871678,0.00008039782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006236581,0.00015260882,0.0002185494,0.00015557543,0.000739982,0.00017675945,0.0019702946,0.000054725293,0.000035109617],"category_scores_gemma":[0.000042381685,0.00014933037,0.00007057256,0.00074231706,0.00015468634,0.0008178355,0.0015105663,0.00027579264,0.000057800353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001274014,0.0013870611,0.008560384,0.00020378528,0.000372741,9.943316e-7,0.009736456,0.033221997,0.68177515,0.09019832,0.0036435686,0.17088678],"study_design_scores_gemma":[0.00025498736,0.00009222585,0.0038384805,0.0001826433,0.000011963488,0.000010874347,0.00037858717,0.98391104,0.0023283556,0.00010490603,0.008639708,0.00024624178],"about_ca_topic_score_codex":0.00017914968,"about_ca_topic_score_gemma":0.00002479866,"teacher_disagreement_score":0.950689,"about_ca_system_score_codex":0.00011106026,"about_ca_system_score_gemma":0.00010918286,"threshold_uncertainty_score":0.60895157},"labels":[],"label_agreement":null},{"id":"W2093603506","doi":"10.1109/icosp.2012.6491858","title":"Power optimization for an amplify-and-forward half-duplex two-way relay system","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; Transmission (telecommunications); Constellation diagram; Computer science; Quadrature amplitude modulation; SIGNAL (programming language); QAM; Power (physics); Constellation; Constraint (computer-aided design); Signal-to-noise ratio (imaging); Channel (broadcasting); Transmission system; Transmitter power output; Wireless; Communications system; Electronic engineering; Bit error rate; Mathematics; Telecommunications; Engineering; Physics","score_opus":0.04738023365711798,"score_gpt":0.3014167295785458,"score_spread":0.25403649592142785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093603506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025263976,0.00037258418,0.9878168,0.00063091697,0.00028739797,0.00028272558,8.7591985e-7,0.00027793943,0.0078043584],"genre_scores_gemma":[0.76668596,0.000049095324,0.23239255,0.0003235964,0.000063174324,0.000040530747,0.000009026387,0.00000909855,0.0004269696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912244,0.000117505355,0.00019516375,0.00020926075,0.000106419306,0.0002492225],"domain_scores_gemma":[0.9989263,0.00011220555,0.00006439569,0.0006120991,0.00012885455,0.00015615512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000597707,0.000110175526,0.00012654426,0.00006201235,0.00028650634,0.00017682064,0.0004647524,0.000046537345,0.00004817671],"category_scores_gemma":[0.000026648604,0.00009283201,0.000032434484,0.00018842085,0.000021989401,0.00095333153,0.00022896558,0.00007455592,0.000019883148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000706967,0.000060012695,0.00036992994,0.000013653402,0.000015666015,1.2195005e-7,0.0012881584,0.008348502,0.0002057582,0.9708289,0.0020999617,0.016762275],"study_design_scores_gemma":[0.00035264433,0.00006410678,0.0002217147,0.000016962518,0.0000047175345,0.000010325157,0.00010387466,0.9723204,0.00018094227,0.000017464992,0.026540164,0.00016673066],"about_ca_topic_score_codex":0.000006431408,"about_ca_topic_score_gemma":0.000011023476,"teacher_disagreement_score":0.9708114,"about_ca_system_score_codex":0.00004619425,"about_ca_system_score_gemma":0.000016484024,"threshold_uncertainty_score":0.37855795},"labels":[],"label_agreement":null},{"id":"W2093779419","doi":"10.1109/vtcfall.2012.6399219","title":"Robust Power Allocation for Selective Relaying Based DF Cellular Wireless System","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Probabilistic logic; Quality of service; Mathematical optimization; Transmitter power output; Constraint (computer-aided design); Cellular network; Channel (broadcasting); Power (physics); Wireless; Power optimization; Optimization problem; Wireless network; Minification; Computer network; Energy consumption; Channel allocation schemes; Power consumption; Algorithm; Engineering; Telecommunications; Mathematics","score_opus":0.05192709713376141,"score_gpt":0.25408822415117654,"score_spread":0.20216112701741512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093779419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037362345,0.00029156305,0.98667914,0.0007045655,0.00030094094,0.00033295114,4.2290267e-7,0.0002579195,0.007696284],"genre_scores_gemma":[0.931421,0.000006884496,0.06781113,0.00030015392,0.000054806173,0.0000821104,0.0000055298538,0.000009753017,0.00030865424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990865,0.00013415488,0.00018111242,0.00020373365,0.00012846908,0.00026604146],"domain_scores_gemma":[0.99885166,0.0002015604,0.00007506315,0.0005333144,0.00025149406,0.00008690303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006345896,0.00010665761,0.000115649294,0.00006937155,0.00031091846,0.00009357205,0.0005143907,0.00004991464,0.00001117751],"category_scores_gemma":[0.000027336988,0.000096897726,0.000052933294,0.000359335,0.000014621993,0.00049687753,0.000114941584,0.00009006929,0.000033813954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013917813,0.00015598694,0.0011733506,0.00004828814,0.000035837453,4.1721606e-7,0.0019294984,0.0013375423,0.015068243,0.95780975,0.0071936813,0.015233495],"study_design_scores_gemma":[0.00038586484,0.00004462863,0.00046849658,0.00005360406,0.0000074954273,0.000002317701,0.00017961083,0.9589461,0.032861337,0.000020188638,0.006798821,0.00023150821],"about_ca_topic_score_codex":0.0000031258917,"about_ca_topic_score_gemma":0.000004895745,"teacher_disagreement_score":0.95778954,"about_ca_system_score_codex":0.00014555328,"about_ca_system_score_gemma":0.0000534763,"threshold_uncertainty_score":0.39513746},"labels":[],"label_agreement":null},{"id":"W2094014173","doi":"10.1109/icspcs.2011.6140858","title":"EDA-based joint power, subcarrier allocation and relay assignment scheme for multiuser relaying in OFDMA-based cognitive radio systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subcarrier; Cognitive radio; Computer science; Relay; Orthogonal frequency-division multiple access; Mathematical optimization; Computational complexity theory; Orthogonal frequency-division multiplexing; Interference (communication); Probabilistic logic; Frequency-division multiple access; Algorithm; Channel (broadcasting); Power (physics); Wireless; Computer network; Mathematics; Telecommunications","score_opus":0.09082552294398048,"score_gpt":0.27763163799304535,"score_spread":0.18680611504906486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094014173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05093347,0.0008819175,0.94495773,0.0007297391,0.00021252756,0.0009761998,0.0000027313124,0.000122169,0.001183535],"genre_scores_gemma":[0.95732003,0.000056153873,0.041535553,0.00053933804,0.00001262208,0.0003676309,0.000008047226,0.000014275502,0.00014632213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985707,0.0002300248,0.0003764084,0.0004010289,0.00017291344,0.00024894482],"domain_scores_gemma":[0.99875695,0.00030964508,0.00013635668,0.00043513242,0.0002593693,0.000102580656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008529817,0.00016971974,0.00020965672,0.000175645,0.00018191959,0.0001096597,0.00032918598,0.00008102857,0.00002815062],"category_scores_gemma":[0.00012940967,0.00015418453,0.00004931556,0.0003036607,0.00005340934,0.00030812563,0.00011374337,0.00015437012,0.0000059808635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012682384,0.0039749607,0.16320372,0.000725351,0.0005445117,0.00005891603,0.03571622,0.012857755,0.07295719,0.56921166,0.0054555126,0.13402595],"study_design_scores_gemma":[0.0024595924,0.00016924329,0.009843452,0.00033239572,0.000009752261,0.000001431271,0.0002737026,0.97413933,0.0116880145,0.00003274622,0.00073353096,0.0003167892],"about_ca_topic_score_codex":0.00004201357,"about_ca_topic_score_gemma":0.000046050412,"teacher_disagreement_score":0.9612816,"about_ca_system_score_codex":0.000111446716,"about_ca_system_score_gemma":0.00012511134,"threshold_uncertainty_score":0.6287463},"labels":[],"label_agreement":null},{"id":"W2094167931","doi":"10.1109/netcod.2012.6261876","title":"Hybrid noncoherent network coding","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Subspace topology; Linear network coding; Concatenated error correction code; Decoding methods; Upper and lower bounds; Computer science; Algorithm; Coding (social sciences); Theoretical computer science; Mathematics; Block code; Discrete mathematics; Artificial intelligence; Computer network","score_opus":0.05049959274554945,"score_gpt":0.2861862604668605,"score_spread":0.23568666772131108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094167931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025054854,0.0011707997,0.90927243,0.0008429146,0.00061578304,0.00008168896,8.6374335e-8,0.00022485052,0.08528595],"genre_scores_gemma":[0.961834,0.00026476014,0.03542584,0.0011268177,0.00029999347,0.000009882524,0.0000010635174,0.0000042776223,0.0010333499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992681,0.00008067896,0.00012550256,0.00011089982,0.000103795915,0.0003110211],"domain_scores_gemma":[0.9992147,0.00008419355,0.000033646807,0.0005144321,0.000039515515,0.00011348112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003719538,0.00007498576,0.00008037291,0.00002211571,0.00019649205,0.00008669061,0.00062812143,0.000013036959,0.00020560082],"category_scores_gemma":[0.000013387648,0.000063540065,0.00003403679,0.00018321186,0.00001424037,0.00045901845,0.0004704343,0.0000927427,0.00026180476],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3515423e-7,0.00003987607,0.0033798274,0.0000014011225,0.000008454238,5.3483427e-7,0.00022595539,0.00010174303,0.00015252833,0.8170058,0.042089935,0.13699321],"study_design_scores_gemma":[0.0004392763,0.00004753397,0.0153124835,0.000049672894,0.000006470839,0.00003975595,0.000021030923,0.1678561,0.0034924916,0.0020892757,0.810073,0.00057288917],"about_ca_topic_score_codex":0.0000011369888,"about_ca_topic_score_gemma":0.00000298026,"teacher_disagreement_score":0.95932853,"about_ca_system_score_codex":0.000028936052,"about_ca_system_score_gemma":0.000013850645,"threshold_uncertainty_score":0.33650577},"labels":[],"label_agreement":null},{"id":"W2095010751","doi":"10.1109/jsac.2012.121011","title":"Distributed Opportunistic Channel Access in Wireless Relay Networks","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":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Relay; Optimal stopping; Computer network; Channel (broadcasting); Throughput; Wireless network; Wireless; Transmission (telecommunications); Stopping time; Channel state information; Mathematical optimization; Telecommunications; Mathematics; Statistics; Power (physics)","score_opus":0.1038579147569856,"score_gpt":0.3465843828383741,"score_spread":0.24272646808138854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095010751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0741175,0.0042983517,0.89577436,0.017028837,0.0017007338,0.00082838023,0.00001959385,0.0003603643,0.005871858],"genre_scores_gemma":[0.9878463,0.009703743,0.0015471142,0.00060235703,0.0001248285,0.00006229963,0.000052837415,0.000019542797,0.000040932904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968963,0.0012706523,0.0007387409,0.00021267809,0.00026924367,0.00061236613],"domain_scores_gemma":[0.99590355,0.0009384746,0.0003394068,0.0021449581,0.00037758236,0.0002960024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001347213,0.00022773106,0.00030923326,0.0004905822,0.00059056876,0.00037322356,0.0051915804,0.00013057681,0.000018230092],"category_scores_gemma":[0.00027225935,0.00022374505,0.00006584343,0.0031246454,0.000097755525,0.0011990494,0.0007825055,0.0018036703,0.000016300157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025096038,0.011831757,0.18920988,0.00004044069,0.0003522586,0.00013486024,0.009265142,0.100800134,0.0014416106,0.4511584,0.029134294,0.20638025],"study_design_scores_gemma":[0.0012662396,0.00009231744,0.14258032,0.00055214524,0.000014105909,0.00021920443,0.00006783774,0.84554917,0.000095496,0.0008013393,0.0081355935,0.00062623026],"about_ca_topic_score_codex":0.000012553917,"about_ca_topic_score_gemma":0.00031497,"teacher_disagreement_score":0.91372883,"about_ca_system_score_codex":0.00043435828,"about_ca_system_score_gemma":0.00021547964,"threshold_uncertainty_score":0.9647334},"labels":[],"label_agreement":null},{"id":"W2095463130","doi":"10.1155/2010/956721","title":"Impact of Antenna Correlation on a New Dual-Hop MIMO AF Relaying Model","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Cumulative distribution function; Moment-generating function; Computer science; Hop (telecommunications); MIMO; Monte Carlo method; Topology (electrical circuits); Diversity gain; Antenna (radio); Telecommunications; Statistics; Probability density function; Algorithm; Mathematics; Channel (broadcasting); Physics; Combinatorics","score_opus":0.06377764670323158,"score_gpt":0.3235417220514075,"score_spread":0.2597640753481759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095463130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5443246,0.0038076953,0.44033146,0.004322565,0.0008285484,0.00034164242,0.0000028935065,0.00015441662,0.0058862003],"genre_scores_gemma":[0.9709442,0.01370355,0.014808543,0.00022710799,0.00018369773,0.000004867979,0.0000049343275,0.000022156504,0.000100893034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982592,0.00034188997,0.0005852445,0.00024465355,0.0002732459,0.00029575086],"domain_scores_gemma":[0.99640256,0.0007140991,0.0005470205,0.0018567338,0.00024090067,0.00023866602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009192694,0.00023158113,0.0002972641,0.00027068058,0.0010633041,0.00030686092,0.0015279703,0.00010770713,0.000009696719],"category_scores_gemma":[0.00005226195,0.00019775308,0.0001698591,0.0006200076,0.00012164677,0.00047245983,0.000598476,0.0015502992,0.0000068419467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000950801,0.00040305022,0.011695473,0.0000059582158,0.00014141633,0.000006900441,0.003254054,0.017865734,0.013529055,0.115929164,0.0012876574,0.83578646],"study_design_scores_gemma":[0.0005684344,0.00023726079,0.0063837958,0.00031819078,0.000012704729,0.00010236139,0.00001926689,0.9892192,0.000028372511,0.001316494,0.0015679889,0.00022592841],"about_ca_topic_score_codex":0.000008824745,"about_ca_topic_score_gemma":0.00004915475,"teacher_disagreement_score":0.9713535,"about_ca_system_score_codex":0.00006739924,"about_ca_system_score_gemma":0.00018938887,"threshold_uncertainty_score":0.8178183},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03450173950108613,"score_gpt":0.25701388413484977,"score_spread":0.22251214463376365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095699525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13232464,0.00010793429,0.86605334,0.00096502615,0.00004836166,0.00015369485,0.000004664744,0.000069516056,0.00027283927],"genre_scores_gemma":[0.98959315,0.0029751654,0.006986451,0.0002148975,0.0000034362338,0.000044006785,0.0000029206217,0.000007918123,0.00017208041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878365,0.00040308485,0.00023729641,0.00022595013,0.00020372702,0.0001463048],"domain_scores_gemma":[0.9972368,0.00038493983,0.00014223717,0.001767084,0.0004065087,0.00006243023],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00018384932,0.00013498552,0.00021284397,0.00021411429,0.00412206,0.000029967481,0.0015472322,0.00006649474,0.000018753035],"category_scores_gemma":[0.000006545133,0.00010575399,0.00011054583,0.0036677239,0.0004149906,0.00027803448,0.0001450396,0.00043125887,0.0000017725887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032817763,0.0004106915,0.007574828,0.0000033222436,0.0010998306,4.7095995e-7,0.005767684,0.95306635,0.00020198259,0.020206956,0.000078607234,0.011556441],"study_design_scores_gemma":[0.00028578736,0.00006878916,0.017179005,0.00002615337,0.00025063532,0.000010984901,0.00006239648,0.9810417,0.0007633076,0.00000791072,0.00014670414,0.00015661796],"about_ca_topic_score_codex":0.000074231786,"about_ca_topic_score_gemma":0.0026675179,"teacher_disagreement_score":0.85906684,"about_ca_system_score_codex":0.000055215973,"about_ca_system_score_gemma":0.00008178234,"threshold_uncertainty_score":0.99717444},"labels":[],"label_agreement":null},{"id":"W2095756085","doi":"10.1109/iscc.2003.1214162","title":"DCMC - delay-constrained multipoint communication with multiple sources","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Constraint (computer-aided design); Multicast; Computer network; Metric (unit); Distributed computing; The Internet; Performance metric; Transmission delay; Propagation delay; Transmission (telecommunications); Communication in small groups; Domain (mathematical analysis); Telecommunications; Mathematics","score_opus":0.025684409916403538,"score_gpt":0.24798270124013494,"score_spread":0.2222982913237314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095756085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0405473,0.0005768621,0.9446607,0.004687982,0.00002963639,0.00025027854,5.4826245e-7,0.00039774456,0.008848901],"genre_scores_gemma":[0.7666689,0.00021878014,0.23237789,0.00055386923,0.000009096098,0.000024401194,0.0000046173936,0.000005981879,0.00013646625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916077,0.00009445032,0.00018988008,0.00022122108,0.00014905729,0.00018460567],"domain_scores_gemma":[0.9984211,0.00014771748,0.000073726645,0.0011330089,0.00014252453,0.00008193064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002230582,0.00012462688,0.00011715988,0.00006648883,0.0003581188,0.0001705888,0.0011630364,0.000034756387,0.000032304015],"category_scores_gemma":[0.000032623328,0.000095537885,0.00003491969,0.00035301183,0.00011835138,0.00043945754,0.00037722613,0.00015909238,0.000058220696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003272945,0.00040628528,0.0038882224,0.000009416734,0.000075408585,0.000010293658,0.008092945,0.0094506545,0.0028159323,0.69903237,0.00030901862,0.27587673],"study_design_scores_gemma":[0.015752234,0.00084942795,0.02226868,0.0005752852,0.00003734474,0.00035912773,0.0018075582,0.8429271,0.045271046,0.010904554,0.056792386,0.0024552422],"about_ca_topic_score_codex":0.00006315178,"about_ca_topic_score_gemma":0.0008907127,"teacher_disagreement_score":0.8334765,"about_ca_system_score_codex":0.000052753432,"about_ca_system_score_gemma":0.000077497236,"threshold_uncertainty_score":0.3895922},"labels":[],"label_agreement":null},{"id":"W2096024116","doi":"10.1109/infcomw.2013.6562864","title":"Robust QoS-guaranteed network engineering in interference-aware wireless networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Toronto","funders":"","keywords":"Computer science; Robustness (evolution); Wireless network; Signal-to-interference-plus-noise ratio; Quality of service; Computer network; Wireless; Distributed computing; Upper and lower bounds; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.033421813314516415,"score_gpt":0.22462329493702923,"score_spread":0.19120148162251283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096024116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017141562,0.00028057134,0.978123,0.0006238005,0.0004373055,0.0002528969,6.952561e-8,0.00028969062,0.0028510743],"genre_scores_gemma":[0.9905375,0.00030383017,0.007996425,0.0006168828,0.00016361942,0.00006792402,0.0000022336544,0.000012189402,0.00029936017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987093,0.00009244876,0.00032787537,0.00031520866,0.000108862776,0.00044630005],"domain_scores_gemma":[0.9989,0.00016693451,0.000052269945,0.00069249974,0.00009559973,0.00009268959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025628382,0.00018102009,0.00021314963,0.00009728259,0.00009884805,0.00028981516,0.0013065592,0.000075423224,0.00021083633],"category_scores_gemma":[0.000015358382,0.00016420509,0.00004793158,0.00087800017,0.000022956006,0.0005080556,0.0006498056,0.00035042394,0.000087975255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005554014,0.000090400295,0.010765255,0.000013510509,0.000029552673,0.000009359883,0.0008291669,0.6562178,0.00013955848,0.1588402,0.018696796,0.15436283],"study_design_scores_gemma":[0.0002511136,0.000025505162,0.00649237,0.00010969035,8.703512e-7,0.000004318137,0.00001941434,0.9921588,0.00002586772,0.000077571094,0.0006216052,0.00021292017],"about_ca_topic_score_codex":0.00004592594,"about_ca_topic_score_gemma":0.0001971831,"teacher_disagreement_score":0.97339594,"about_ca_system_score_codex":0.000056628545,"about_ca_system_score_gemma":0.000025309982,"threshold_uncertainty_score":0.66960895},"labels":[],"label_agreement":null},{"id":"W2096160777","doi":"10.1109/glocom.2010.5683259","title":"Cross-Layer Protocol Design for Distributed Wireless Networks with Novel Relay Selection","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Relay; Protocol (science); Wireless Transport Layer Security; Selection (genetic algorithm); Protocol design; Wireless; Layer (electronics); Wireless network; Wireless Application Protocol; Distributed computing; Communications protocol; Wi-Fi array; Telecommunications","score_opus":0.05310810658509932,"score_gpt":0.3267649859856839,"score_spread":0.2736568794005846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096160777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010277049,0.0000013378649,0.9750487,0.00033595535,0.000095232506,0.022953454,0.0000014424426,0.00026204126,0.00027413366],"genre_scores_gemma":[0.52194583,0.0000020387195,0.4031962,0.00030049353,0.00013952285,0.073384896,0.000011406764,0.000020706624,0.0009989224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990506,0.000048267128,0.00019691775,0.00031729214,0.00012181687,0.0002650824],"domain_scores_gemma":[0.998678,0.00020479366,0.00009299741,0.00051870453,0.0004225644,0.00008288991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047175586,0.00014091407,0.00012040253,0.00003834001,0.00045350424,0.00039001333,0.00070538145,0.00008883624,0.000043910102],"category_scores_gemma":[0.000034033645,0.00010459683,0.000035373436,0.00052544696,0.000055629735,0.00042648523,0.00014319643,0.00029484325,0.000003795905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073361007,0.0010153454,0.0094350185,0.000044183536,0.00013288244,0.0000021551855,0.00046294017,0.2874115,0.07958801,0.44842833,0.014120394,0.1586256],"study_design_scores_gemma":[0.0011071938,0.00016066505,0.0018260222,0.00001193737,0.000002466738,0.000011896377,0.0000015030981,0.96742415,0.0069356817,0.00003346466,0.022300078,0.00018493454],"about_ca_topic_score_codex":0.0000035078374,"about_ca_topic_score_gemma":0.00012071827,"teacher_disagreement_score":0.68001264,"about_ca_system_score_codex":0.000028933104,"about_ca_system_score_gemma":0.00009446603,"threshold_uncertainty_score":0.42653352},"labels":[],"label_agreement":null},{"id":"W2096199330","doi":"10.1109/iwqos.2007.376546","title":"On the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Coding (social sciences); Resilience (materials science); Theoretical computer science; Computational complexity theory; Distributed computing; Computer network; Algorithm; Mathematics","score_opus":0.10365162549871887,"score_gpt":0.370040041402382,"score_spread":0.26638841590366313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096199330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34592688,0.00030989715,0.59594375,0.03897059,0.000996911,0.00042608657,0.0000059180584,0.00007871554,0.017341284],"genre_scores_gemma":[0.99308753,0.00015326106,0.0025283538,0.0040646833,0.000063760446,0.0000065085364,0.000008175885,0.000007490879,0.00008022861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976003,0.00039178366,0.0008260747,0.00031599673,0.0005880022,0.00027783716],"domain_scores_gemma":[0.9946564,0.003772742,0.00042698297,0.0008004118,0.00029039037,0.00005311339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003632999,0.00015929011,0.00026164934,0.00014394056,0.00013207356,0.000049608214,0.0024080034,0.000083494444,0.000076958575],"category_scores_gemma":[0.00028328164,0.00013248403,0.00009109212,0.0011679602,0.00012010364,0.00018387866,0.00037332077,0.00045250118,0.000008609903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015049227,0.0001915705,0.0010056945,0.000010636121,0.000028400853,0.0000014386602,0.0009538455,0.06356886,0.00025154056,0.91696596,0.00028824862,0.01658329],"study_design_scores_gemma":[0.00072449225,0.00007038198,0.21532416,0.0009515884,0.0000035482415,0.000002368406,0.00041060167,0.74885136,0.00033095002,0.032362316,0.000653159,0.00031505644],"about_ca_topic_score_codex":0.000068120244,"about_ca_topic_score_gemma":0.0025790255,"teacher_disagreement_score":0.8846037,"about_ca_system_score_codex":0.00012065581,"about_ca_system_score_gemma":0.00003626461,"threshold_uncertainty_score":0.54025424},"labels":[],"label_agreement":null},{"id":"W2096209374","doi":"10.1109/twc.2008.080071","title":"Using the Bhattacharyya parameter for design and analysis of cooperative wireless systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Relay; Bhattacharyya distance; Computer science; Selection (genetic algorithm); Upper and lower bounds; Wireless; Demodulation; Mathematical optimization; Code word; Telecommunications; Mathematics; Decoding methods; Artificial intelligence","score_opus":0.12348971983507488,"score_gpt":0.34313372289158783,"score_spread":0.21964400305651294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096209374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007198663,0.000719396,0.9892869,0.0017931733,0.00008523771,0.0007672197,0.000026135674,0.00007237807,0.00005089708],"genre_scores_gemma":[0.94274133,0.0019405342,0.054836705,0.0002524208,0.0000057232915,0.0001598347,0.00000684405,0.000009397882,0.00004722788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981802,0.000749248,0.0004412221,0.00027132037,0.00016392396,0.00019409966],"domain_scores_gemma":[0.99478036,0.002125394,0.0001938655,0.0024517332,0.00038096262,0.00006769742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005861396,0.00018138965,0.00036807277,0.00032686515,0.0011298833,0.00018615105,0.0017732233,0.00007142259,0.0000030497863],"category_scores_gemma":[0.00001095374,0.00014592947,0.0001570777,0.0016816807,0.00022995136,0.0003181008,0.000019169023,0.00026769916,8.798316e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006689652,0.0009173349,0.000032988934,0.000019276262,0.0016375441,4.2491976e-7,0.006437058,0.60431784,0.016408283,0.16816881,0.00010397216,0.20188959],"study_design_scores_gemma":[0.00024822447,0.00010919458,0.00012321779,0.00004509858,0.00029900574,0.000003059969,0.0001327128,0.9960275,0.0025903177,0.00009121276,0.00016948077,0.00016092825],"about_ca_topic_score_codex":0.000018258159,"about_ca_topic_score_gemma":0.00004067538,"teacher_disagreement_score":0.93554264,"about_ca_system_score_codex":0.00005904476,"about_ca_system_score_gemma":0.00007744771,"threshold_uncertainty_score":0.86902636},"labels":[],"label_agreement":null},{"id":"W2096416985","doi":"10.1109/twc.2010.01.081573","title":"Analysis and code design of variable time-fraction collaborative communications","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fraction (chemistry); Computer science; Relay; Variable (mathematics); Upper and lower bounds; Protocol (science); Wireless; Computer network; Telecommunications; Mathematics","score_opus":0.03523142782643082,"score_gpt":0.2914946070884525,"score_spread":0.2562631792620217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096416985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016006186,0.00024188733,0.99343735,0.0023765704,0.000097059754,0.0004414461,0.000077333745,0.00019747164,0.0015302562],"genre_scores_gemma":[0.74941194,0.0042770496,0.24577111,0.00012657388,0.0000056220824,0.00017677677,0.000019413957,0.000014724691,0.00019678273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781936,0.0008462939,0.0005468668,0.0003433363,0.00023142871,0.00021273133],"domain_scores_gemma":[0.99063057,0.0018201143,0.0003064488,0.0064207395,0.0006879128,0.00013423599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075411383,0.00021916971,0.00039565717,0.0005886643,0.0012562672,0.00015189944,0.003473594,0.00014501526,0.00007550232],"category_scores_gemma":[0.00003171022,0.00023609122,0.00010854086,0.0037030918,0.00058542565,0.00063504034,0.00009948547,0.0008398849,0.000031764528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000949334,0.0040783677,0.0005499572,0.000034633675,0.0027304417,9.155889e-7,0.00556958,0.029405471,0.33193314,0.26383364,0.0005246398,0.36124426],"study_design_scores_gemma":[0.00044107783,0.00009508858,0.0005692124,0.000034266883,0.0002976153,0.0000059574963,0.0000914168,0.982418,0.01067943,0.000622134,0.0044119656,0.00033381718],"about_ca_topic_score_codex":0.000045189954,"about_ca_topic_score_gemma":0.00078892166,"teacher_disagreement_score":0.9530125,"about_ca_system_score_codex":0.00005412515,"about_ca_system_score_gemma":0.00020624895,"threshold_uncertainty_score":0.9662318},"labels":[],"label_agreement":null},{"id":"W2096510011","doi":"10.1109/glocom.2008.ecp.102","title":"Maximum-Lifetime Coding Subgraph for Multicast Traffic in Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear network coding; Multicast; Computer science; Computer network; Network packet; Steiner tree problem; Wireless network; Wireless sensor network; Distributed computing; Coding (social sciences); Wireless; Mathematical optimization; Mathematics","score_opus":0.04532337336681537,"score_gpt":0.27394006255649705,"score_spread":0.2286166891896817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096510011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15076344,0.00013706234,0.84629047,0.0010351558,0.00017369387,0.0003798579,8.872166e-7,0.00022023653,0.0009992339],"genre_scores_gemma":[0.9628348,0.0008003895,0.03540456,0.00047805873,0.000055235618,0.000046649628,0.000005280016,0.0000120218265,0.00036303638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877775,0.00011242536,0.00030272605,0.00033881702,0.00010448106,0.00036381982],"domain_scores_gemma":[0.9987829,0.0004000082,0.000056329165,0.000558262,0.00010727969,0.0000952631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003194561,0.00015250307,0.00021133604,0.00014416201,0.00030254814,0.000072221235,0.0007601402,0.00006810406,0.00002355348],"category_scores_gemma":[0.000031865802,0.0001438822,0.00008409889,0.0006551231,0.00007207358,0.00024451004,0.000186254,0.00017871383,0.000015656855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014271762,0.0010417972,0.015491411,0.0000507924,0.00009751255,0.00012452152,0.0075560613,0.08029516,0.0030336014,0.31723332,0.01092686,0.56400627],"study_design_scores_gemma":[0.0007409651,0.00003698354,0.003729287,0.000027032196,0.0000016369498,0.000024090354,0.000029958175,0.9936998,0.00017482173,0.000035212182,0.0012876217,0.00021261742],"about_ca_topic_score_codex":0.0000057684006,"about_ca_topic_score_gemma":0.00022148699,"teacher_disagreement_score":0.9134046,"about_ca_system_score_codex":0.000031458836,"about_ca_system_score_gemma":0.000036473975,"threshold_uncertainty_score":0.58673453},"labels":[],"label_agreement":null},{"id":"W2096717373","doi":"10.1109/glocom.2003.1258280","title":"Diversity- and AMC (Adaptive Modulation and Coding)-Aware Routing in TDMA Multihop Networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Time division multiple access; Computer science; Computer network; Link adaptation; Coding (social sciences); Modulation (music); Telecommunications; Fading; Physics; Mathematics","score_opus":0.04440308613938356,"score_gpt":0.25223775440738677,"score_spread":0.2078346682680032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096717373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22856364,0.0000960516,0.7702782,0.00049450103,0.00003909158,0.000103150625,1.2162202e-7,0.00005882957,0.00036637895],"genre_scores_gemma":[0.99073356,0.0004706473,0.008482689,0.0002528777,0.000016708565,0.0000022764762,8.839176e-7,0.0000030192332,0.0000373492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993611,0.000060838283,0.000121452096,0.00023190932,0.00007928186,0.00014541444],"domain_scores_gemma":[0.99957234,0.00008834756,0.00004090831,0.00019396999,0.000050315568,0.000054129927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021972215,0.00008654547,0.00009927875,0.00006994415,0.0008362918,0.00006590346,0.00021751948,0.000040753304,0.0000025668446],"category_scores_gemma":[0.0000172777,0.00008455,0.000012090764,0.00026530994,0.000040496223,0.00044299144,0.002324684,0.00013264111,9.0664975e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017768936,0.000073680465,0.1172055,0.0000069155963,0.000018818353,0.000012701162,0.021464132,0.029739028,0.00014796358,0.66004425,0.000025994203,0.17124325],"study_design_scores_gemma":[0.00053283543,0.000022593526,0.11502315,0.000038952563,0.0000012565608,0.000003222321,0.00011990282,0.88351256,0.00002226696,0.0006089065,0.000010499418,0.00010388187],"about_ca_topic_score_codex":0.00010456179,"about_ca_topic_score_gemma":0.00046533145,"teacher_disagreement_score":0.8537735,"about_ca_system_score_codex":0.00005497921,"about_ca_system_score_gemma":0.000010151846,"threshold_uncertainty_score":0.6432165},"labels":[],"label_agreement":null},{"id":"W2096870785","doi":"10.1109/glocom.2007.239","title":"Performance of Cooperative Ad-Hoc Networks with Position Estimation Errors","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Node (physics); Throughput; Computer science; Wireless ad hoc network; Computer network; Position (finance); Focus (optics); Interference (communication); Real-time computing; Wireless; Telecommunications; Engineering","score_opus":0.019049065580605318,"score_gpt":0.2660816071729821,"score_spread":0.2470325415923768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096870785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17200968,0.0002731586,0.82206225,0.00025234875,0.00004658652,0.00012187837,1.1640784e-7,0.00007752503,0.0051564337],"genre_scores_gemma":[0.90930676,0.00037163967,0.0898997,0.00020839252,0.000010014348,0.000004451257,0.000005408539,0.0000044882922,0.00018913446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929315,0.00004556476,0.00020621905,0.00015549659,0.00014629184,0.00015326188],"domain_scores_gemma":[0.99915457,0.00008233222,0.00009108905,0.00036995517,0.0002539097,0.00004814956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039343728,0.00009168479,0.00010576797,0.00007428705,0.00015933409,0.000036250578,0.000361455,0.00003347596,0.000025864436],"category_scores_gemma":[0.000008659193,0.00007045984,0.00001773452,0.00057492347,0.0000558131,0.00051719864,0.000102291735,0.00010582524,0.000007987312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015112576,0.00014858792,0.002444104,0.000015184892,0.000037588023,0.0000035769958,0.0021083034,0.16732626,0.0017324367,0.05634901,0.00042545496,0.7692584],"study_design_scores_gemma":[0.00024675397,0.00032362275,0.011645755,0.000052733372,0.0000031539282,0.00000923227,0.000032813914,0.9832881,0.0039791754,0.000009389606,0.00029636163,0.000112875896],"about_ca_topic_score_codex":8.559578e-7,"about_ca_topic_score_gemma":0.000050840055,"teacher_disagreement_score":0.8159619,"about_ca_system_score_codex":0.000036899073,"about_ca_system_score_gemma":0.000033995177,"threshold_uncertainty_score":0.2873269},"labels":[],"label_agreement":null},{"id":"W2096953766","doi":"10.1109/isit.2011.6033704","title":"Streaming data over fading wireless channels: The diversity-multiplexing tradeoff","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fading; Multiplexing; Decoding methods; Transmitter; Converse; Algorithm; Computer network; Block (permutation group theory); Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.22579937729813016,"score_gpt":0.29512645017883754,"score_spread":0.06932707288070739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096953766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05369663,0.0002935245,0.9151494,0.0014015078,0.0005868469,0.00024899017,0.0000043124423,0.0003764587,0.028242351],"genre_scores_gemma":[0.99189067,0.00018981347,0.00695904,0.0004859881,0.00005593729,0.0000027900949,0.0000054651364,0.0000055725973,0.0004047279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902666,0.00012596443,0.00012504638,0.00032721003,0.00017101417,0.00022408481],"domain_scores_gemma":[0.99796396,0.0001689798,0.000059651557,0.0017100353,0.00004041289,0.000056971716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046646813,0.0001104993,0.000099112396,0.000049622322,0.001001458,0.00015760896,0.0044217324,0.000042162657,0.00012745657],"category_scores_gemma":[0.000028105444,0.000077853016,0.000031061783,0.00033126445,0.000054241496,0.0009923718,0.0072822897,0.00024749347,0.000023049479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084960475,0.0001804866,0.009142075,0.000009671063,0.00009477788,0.000013832048,0.04302757,0.000083653205,0.00062758854,0.38290417,0.0065472997,0.5573604],"study_design_scores_gemma":[0.00029495856,0.000019259722,0.008917766,0.00003996371,0.000007796827,0.000006347647,0.0006276387,0.9807558,0.00072372815,0.00042195182,0.007923817,0.00026098968],"about_ca_topic_score_codex":0.00008419418,"about_ca_topic_score_gemma":0.00012924182,"teacher_disagreement_score":0.9806721,"about_ca_system_score_codex":0.000023516905,"about_ca_system_score_gemma":0.00001914681,"threshold_uncertainty_score":0.90768534},"labels":[],"label_agreement":null},{"id":"W2097037377","doi":"10.1109/twc.2009.090037","title":"On error analysis and distributed phase steering for wireless network coding over fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Fading; Relay; Computer network; Nakagami distribution; Bit error rate; Block Error Rate; Decoding methods; Cyclic prefix; Wireless; Algorithm; Channel (broadcasting); Orthogonal frequency-division multiplexing; Telecommunications link; Telecommunications","score_opus":0.05046761357788314,"score_gpt":0.324175909675807,"score_spread":0.27370829609792385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097037377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02921064,0.00018604145,0.9666382,0.0027368658,0.00020360545,0.00051439827,0.000065121596,0.00030895564,0.00013614353],"genre_scores_gemma":[0.9881171,0.0013900171,0.009548753,0.0005614382,0.0000340717,0.0001975291,0.000057212525,0.00001942385,0.000074465024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812365,0.00026676993,0.0004841659,0.0004788396,0.00021692336,0.00042966937],"domain_scores_gemma":[0.9958495,0.0011076111,0.00018684131,0.0024940686,0.00018308948,0.00017888343],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004516901,0.0002959074,0.00042705494,0.0004059166,0.0019631886,0.0003337332,0.0017439935,0.00010923264,0.000013747788],"category_scores_gemma":[0.000012469643,0.0003178469,0.00023828006,0.0021209042,0.00011254184,0.0004534602,0.00003212568,0.0004767052,0.0000048502166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013263797,0.0016864018,0.000036452035,0.000022163173,0.0008309584,0.0000021486683,0.0023681521,0.314692,0.004586511,0.18803227,0.00048067313,0.48712963],"study_design_scores_gemma":[0.001195748,0.00023993585,0.00028862373,0.00012505155,0.00017068215,0.0000027247584,0.000041837873,0.9944304,0.0016110941,0.00068517774,0.00082790107,0.00038077994],"about_ca_topic_score_codex":0.000008839394,"about_ca_topic_score_gemma":0.00013571157,"teacher_disagreement_score":0.9589065,"about_ca_system_score_codex":0.0001420679,"about_ca_system_score_gemma":0.00004360678,"threshold_uncertainty_score":0.99992734},"labels":[],"label_agreement":null},{"id":"W2097082228","doi":"10.1109/cwit.2007.375689","title":"Cooperative Diversity over Log-Normal Fading Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise error probability; Fading; Computer science; MIMO; Relay; Cooperative diversity; Channel (broadcasting); Time division multiple access; Bit error rate; Algorithm; Wireless; Computer network; Power (physics); Telecommunications","score_opus":0.04921166586252723,"score_gpt":0.2855038481269566,"score_spread":0.23629218226442938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097082228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044687953,0.00011610841,0.90081495,0.00050886575,0.00033912214,0.00009844449,3.0337608e-7,0.00018104065,0.05325324],"genre_scores_gemma":[0.991311,0.00007939941,0.00477075,0.0013957225,0.00006891127,0.0000013199308,0.0000013490107,0.0000033552512,0.0023681542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913657,0.000060237453,0.0001440399,0.0002212738,0.00016879628,0.00026906971],"domain_scores_gemma":[0.99918103,0.00013331325,0.000039042377,0.00041223614,0.00013187969,0.000102489794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058828224,0.0001024745,0.000103135564,0.00008702059,0.0006973048,0.00011515054,0.00090487715,0.000039732156,0.00025659346],"category_scores_gemma":[0.000028798942,0.00009174938,0.00004097123,0.00045619885,0.000043546515,0.00062830595,0.0020717417,0.0001475836,0.00007178844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020380912,0.000140122,0.011602154,0.000004700305,0.00005430992,0.00003694931,0.011128199,0.0009369278,0.0019311537,0.85220885,0.010905292,0.11103096],"study_design_scores_gemma":[0.0044242707,0.00063414784,0.15753971,0.00013636165,0.000028904775,0.000082582854,0.0010302243,0.5875776,0.06494925,0.0032862579,0.17745952,0.0028511693],"about_ca_topic_score_codex":0.000014522913,"about_ca_topic_score_gemma":0.00008607805,"teacher_disagreement_score":0.9466231,"about_ca_system_score_codex":0.000056783567,"about_ca_system_score_gemma":0.000021175727,"threshold_uncertainty_score":0.5363175},"labels":[],"label_agreement":null},{"id":"W2097126656","doi":"10.1109/wcnc.2008.69","title":"Optimization of a Modified Orthogonal Amplify-and-Forward Pairwise User Cooperation Scheme","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Resource allocation; Pairwise comparison; Computer science; Mathematical optimization; Scheme (mathematics); Channel (broadcasting); Transmission (telecommunications); Power (physics); Resource management (computing); Simple (philosophy); Mathematics; Distributed computing; Telecommunications; Computer network; Artificial intelligence","score_opus":0.04959018652625485,"score_gpt":0.2622414325315761,"score_spread":0.21265124600532126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097126656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03536111,0.0001521019,0.9607352,0.00054251513,0.00004029365,0.00012505711,6.9831987e-7,0.000092037626,0.0029509964],"genre_scores_gemma":[0.8392294,0.0009169761,0.15891731,0.00031450967,0.000015152183,0.000011447025,0.000010408927,0.0000047605135,0.0005800387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924713,0.000085305284,0.00023020692,0.00018872588,0.0001406937,0.00010792059],"domain_scores_gemma":[0.99920326,0.00006450013,0.0000662731,0.0003808803,0.0002266858,0.000058414138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018312239,0.00008774072,0.0001244229,0.00007232203,0.0001990102,0.00003907018,0.00030494147,0.000044614375,0.00006963404],"category_scores_gemma":[0.00004581035,0.00007753564,0.000026675558,0.00033130712,0.00006275666,0.00043176662,0.00021626618,0.000082434904,0.000006444333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022458169,0.00015407741,0.0031145054,0.000012160062,0.00003292043,0.0000025657741,0.0013472058,0.10536584,0.0030204034,0.8711842,0.002104892,0.013638784],"study_design_scores_gemma":[0.00036496975,0.0000392008,0.0014999905,0.000009749016,0.0000019755578,0.000011972592,0.000007019085,0.9957265,0.0008590495,0.000050602615,0.0013145246,0.00011442626],"about_ca_topic_score_codex":0.0000038602498,"about_ca_topic_score_gemma":0.000009461561,"teacher_disagreement_score":0.89036065,"about_ca_system_score_codex":0.000013973401,"about_ca_system_score_gemma":0.000064018335,"threshold_uncertainty_score":0.31618118},"labels":[],"label_agreement":null},{"id":"W2097133655","doi":"10.1109/allerton.2010.5707090","title":"Codebook information does not reduce output entropy when rate is above capacity","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Codebook; Channel capacity; Relay; Entropy (arrow of time); Conditional entropy; Entropy rate; Code word; Computer science; Information theory; Relay channel; Code rate; Channel (broadcasting); Lossless compression; Linde–Buzo–Gray algorithm; Algorithm; Mathematics; Data compression; Decoding methods; Statistics; Principle of maximum entropy; Artificial intelligence; Telecommunications; Binary entropy function; Physics","score_opus":0.034335496874563595,"score_gpt":0.25750548155069125,"score_spread":0.22316998467612764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097133655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083257385,0.0000134374,0.8188613,0.027308537,0.0015566656,0.00042978296,0.0000105801355,0.0005052431,0.06805705],"genre_scores_gemma":[0.9510417,0.00007647024,0.03515687,0.008545931,0.0000767525,0.000017777511,0.000005775698,0.0000041481026,0.005074559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991737,0.00008180573,0.00025221385,0.0001640313,0.00014083016,0.00018742155],"domain_scores_gemma":[0.9987222,0.00009372978,0.00009984927,0.00074593205,0.00024640953,0.00009189092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040733936,0.00011607549,0.0001101066,0.000071759176,0.00023563225,0.00038305947,0.00087610236,0.000058066755,0.00048351847],"category_scores_gemma":[0.00007885079,0.00008282437,0.00004500887,0.00012238017,0.00005818953,0.0015489693,0.00034853807,0.0002826787,0.00040595426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001414477,0.000050846218,0.00025674413,0.000009300814,0.000025545132,4.5124182e-7,0.013201936,0.000010007026,0.059699308,0.6546781,0.03366173,0.23839186],"study_design_scores_gemma":[0.0005690772,0.00003517892,0.0023274869,0.000012033056,0.0000048508737,0.00000581582,0.000059059235,0.19259079,0.1798543,0.004508738,0.61965483,0.00037785072],"about_ca_topic_score_codex":0.000026789574,"about_ca_topic_score_gemma":0.00009995913,"teacher_disagreement_score":0.8677843,"about_ca_system_score_codex":0.000024141214,"about_ca_system_score_gemma":0.000056175235,"threshold_uncertainty_score":0.5294188},"labels":[],"label_agreement":null},{"id":"W2097307683","doi":"10.1109/wts.2011.5960833","title":"Throughput optimization in wireless multihop networks with Successive Interference Cancellation","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheduling (production processes); Computer science; Maximum throughput scheduling; Single antenna interference cancellation; Throughput; Computer network; Wireless mesh network; Wireless network; Wireless; Node (physics); Interference (communication); Transmission (telecommunications); Distributed computing; Channel (broadcasting); Mathematical optimization; Dynamic priority scheduling; Engineering; Quality of service; Round-robin scheduling; Telecommunications; Mathematics","score_opus":0.04536098870204255,"score_gpt":0.25604044588555663,"score_spread":0.21067945718351408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097307683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038560298,0.0000849907,0.98171896,0.00015542541,0.00008342458,0.0001521975,9.261659e-8,0.000093962095,0.013854891],"genre_scores_gemma":[0.92398167,0.000355959,0.07529166,0.00018097486,0.000014406006,0.000020775113,0.0000031616198,0.0000057479906,0.00014563954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999213,0.00009942716,0.00018299311,0.00025385397,0.00008440426,0.0001663611],"domain_scores_gemma":[0.9992469,0.0000648763,0.0000856885,0.00042267083,0.00013959581,0.00004029149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012889235,0.00010675521,0.000110447225,0.000073373056,0.000088209876,0.000071489354,0.00060616847,0.000041092342,0.00009284837],"category_scores_gemma":[0.0000089098285,0.00008532213,0.000013265558,0.0005830042,0.000040698593,0.0006212005,0.00020274804,0.00013642853,0.000004966492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006760224,0.00018666754,0.022615893,0.000008087193,0.000021310687,0.000012553185,0.008814372,0.6667914,0.00007621717,0.14643872,0.00016209108,0.15480511],"study_design_scores_gemma":[0.0002825637,0.0000467481,0.002896417,0.000055721957,0.0000012267066,0.000001596713,0.0000500883,0.9961199,0.00034713844,0.000040306946,0.000024974966,0.00013329758],"about_ca_topic_score_codex":0.00011201836,"about_ca_topic_score_gemma":0.0017114548,"teacher_disagreement_score":0.92012566,"about_ca_system_score_codex":0.000054283846,"about_ca_system_score_gemma":0.000042380696,"threshold_uncertainty_score":0.34793353},"labels":[],"label_agreement":null},{"id":"W2097329427","doi":"10.1109/tcomm.2014.032014.130399","title":"On the Performance of Cooperative Relaying Spectrum-Sharing Systems with Collaborative Distributed Beamforming","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; Concordia University","funders":"","keywords":"Beamforming; Rayleigh fading; Phase-shift keying; Cognitive radio; Computer science; Relay; Moment-generating function; Spectral efficiency; Quadrature amplitude modulation; Signal-to-noise ratio (imaging); Electronic engineering; Topology (electrical circuits); Fading; Bit error rate; Probability density function; Algorithm; Mathematics; Telecommunications; Decoding methods; Engineering; Wireless; Statistics","score_opus":0.029785680449203593,"score_gpt":0.2550656941608576,"score_spread":0.22528001371165401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097329427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025745686,0.00012820914,0.9662585,0.0032912532,0.00013156098,0.0005133677,0.000022759143,0.00013661581,0.0037720012],"genre_scores_gemma":[0.99505883,0.0007663431,0.0036066487,0.00016105482,0.000009759286,0.00022688632,0.000008158491,0.00001516565,0.0001471597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984317,0.00045038457,0.00037881767,0.00026626632,0.00025929886,0.00021356839],"domain_scores_gemma":[0.9947471,0.0014579105,0.00021920384,0.0031498529,0.0003627255,0.00006319614],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00060020026,0.00019645269,0.0002302538,0.0001391584,0.0017178336,0.00017035675,0.0024949193,0.000051045507,0.000012603867],"category_scores_gemma":[0.000028325438,0.00013919876,0.00005248482,0.0013991845,0.00025238938,0.00039733684,0.00004018869,0.0005760182,0.000023923658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005695711,0.00041972558,0.000065705804,0.00002045052,0.00016216672,2.8297848e-7,0.0034159017,0.4288471,0.0009234002,0.5596602,0.00013830827,0.006289796],"study_design_scores_gemma":[0.00040965553,0.0005022557,0.00010362677,0.00038421666,0.000022193632,0.0000074945933,0.0003870491,0.98734426,0.008575428,0.00014565598,0.0018758831,0.00024228473],"about_ca_topic_score_codex":0.000014664822,"about_ca_topic_score_gemma":0.000098304794,"teacher_disagreement_score":0.96931314,"about_ca_system_score_codex":0.00011572106,"about_ca_system_score_gemma":0.0000946702,"threshold_uncertainty_score":0.9995818},"labels":[],"label_agreement":null},{"id":"W2097383191","doi":"10.1109/t-wc.2008.071441","title":"Cyclic space-frequency filtering for BICM-OFDM systems with multiple co-located or distributed transmit antennas","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Pairwise error probability; Transmit diversity; Transmission (telecommunications); Algorithm; Filter (signal processing); Fading; Mathematics; Control theory (sociology); Electronic engineering; Telecommunications; Decoding methods; Channel (broadcasting); Engineering","score_opus":0.07432525867899238,"score_gpt":0.2906061796216107,"score_spread":0.21628092094261836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097383191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010038497,0.00042412442,0.98476756,0.002292389,0.00019443732,0.0011527739,0.00021939853,0.00064973073,0.0002610727],"genre_scores_gemma":[0.96750915,0.0036915743,0.026986806,0.0001240262,0.000020057152,0.0011176579,0.00010225311,0.000047969934,0.00040051845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780065,0.0003696041,0.00058307726,0.00049320405,0.0002855256,0.00046791634],"domain_scores_gemma":[0.994336,0.0011138576,0.00019878546,0.00370631,0.00044260902,0.00020241275],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00025133818,0.0003599988,0.0004228919,0.00028176457,0.0024143078,0.00018906605,0.0029521997,0.00012916759,0.000016945673],"category_scores_gemma":[0.000017053044,0.00030918213,0.00015643593,0.0013745032,0.00036962423,0.000618099,0.000020585869,0.00053730304,0.000031087664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030471985,0.01945248,0.004842499,0.0011225881,0.0037707617,0.00019188096,0.039693587,0.3038894,0.1914057,0.10800913,0.007436378,0.3171384],"study_design_scores_gemma":[0.0036960524,0.00061641965,0.0013571106,0.00053498754,0.000080137856,0.0002629331,0.0003343527,0.9655256,0.013102076,0.000040851744,0.013364062,0.0010853921],"about_ca_topic_score_codex":0.00011433743,"about_ca_topic_score_gemma":0.00092797173,"teacher_disagreement_score":0.9577808,"about_ca_system_score_codex":0.00018347902,"about_ca_system_score_gemma":0.0002476252,"threshold_uncertainty_score":0.99993604},"labels":[],"label_agreement":null},{"id":"W2097467897","doi":"10.1186/1687-6180-2012-41","title":"Cooperative MIMO multicell networks","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; MIMO; Telecommunications; Computer network; Beamforming","score_opus":0.033806729268514794,"score_gpt":0.3225495827629747,"score_spread":0.2887428534944599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097467897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004914821,0.05729244,0.928958,0.00048591042,0.00054115267,0.00012716162,1.9429487e-7,0.00007230196,0.0076080402],"genre_scores_gemma":[0.977122,0.004609625,0.01653135,0.001141919,0.00045454074,0.000007713564,6.8153815e-7,0.000015387182,0.00011677038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807197,0.0003932877,0.00045655904,0.00023041795,0.0003142986,0.00053346256],"domain_scores_gemma":[0.9987667,0.00029314993,0.00027652975,0.00023627121,0.00020892473,0.00021839446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010323805,0.00021497386,0.00023080752,0.00018442051,0.00054300064,0.00037695584,0.0009122372,0.00005350769,0.00005360096],"category_scores_gemma":[0.00008011182,0.00017657275,0.000056416837,0.0007958246,0.00007340709,0.0037213103,0.0001705178,0.00091702165,0.000032096064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038246133,0.00024661972,0.0026208523,0.000010618643,0.000006393612,0.000021984,0.0015572034,0.08126338,0.00037341428,0.006790648,0.0001174271,0.9069532],"study_design_scores_gemma":[0.0014748651,0.0002770292,0.0026346412,0.0009163612,0.000008262151,0.00019896866,0.0002779399,0.90010554,0.001443244,0.00052790967,0.091394804,0.00074046454],"about_ca_topic_score_codex":1.2371127e-7,"about_ca_topic_score_gemma":0.0000026310668,"teacher_disagreement_score":0.9722072,"about_ca_system_score_codex":0.00013135221,"about_ca_system_score_gemma":0.000070077185,"threshold_uncertainty_score":0.7200428},"labels":[],"label_agreement":null},{"id":"W2097473185","doi":"10.1109/twc.2008.070688","title":"On the performance of amplify-and-forward cooperative systems with fixed gain relays","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hop (telecommunications); Diversity gain; Computer science; Wireless; Bit error rate; Cooperative diversity; Probability of error; Transmission (telecommunications); Diversity combining; Wireless network; Telecommunications; Algorithm; Fading; Decoding methods","score_opus":0.04753577101598859,"score_gpt":0.25821607464746854,"score_spread":0.21068030363147994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097473185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20304498,0.00037614422,0.79056203,0.003064417,0.00010881554,0.0007662823,0.000017808848,0.00015424586,0.0019052621],"genre_scores_gemma":[0.9899549,0.0069511747,0.0020357815,0.00027011803,0.0000056902745,0.00036952356,0.000003836218,0.000015786425,0.00039321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984455,0.0005276977,0.00034296495,0.0002434437,0.00025333907,0.00018703488],"domain_scores_gemma":[0.9952935,0.0013499979,0.00015358391,0.0028530587,0.00027488213,0.000074975454],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002905961,0.0001921572,0.00023980084,0.00013661747,0.0017080363,0.00006620308,0.0018504435,0.00006525716,0.000011239266],"category_scores_gemma":[0.000009026138,0.00013405691,0.00005078913,0.0007390246,0.00053252256,0.00028072612,0.00003146537,0.00060563145,0.000024613597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025002117,0.0021110734,0.00044330693,0.0000775012,0.0005527087,0.000004581995,0.017327731,0.25988615,0.005486232,0.6650014,0.0017484362,0.047110844],"study_design_scores_gemma":[0.0009152132,0.00081300637,0.0006813605,0.00043368313,0.00003394632,0.0000838226,0.00041638737,0.98400503,0.009764704,0.00003192116,0.0023508845,0.0004700497],"about_ca_topic_score_codex":0.000022250544,"about_ca_topic_score_gemma":0.00007236854,"teacher_disagreement_score":0.78852624,"about_ca_system_score_codex":0.000057506233,"about_ca_system_score_gemma":0.000112170004,"threshold_uncertainty_score":0.9995916},"labels":[],"label_agreement":null},{"id":"W2097475015","doi":"10.1109/glocom.2005.1578379","title":"Theoretical analysis of cooperative diversity in wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Cooperative diversity; Fading; Energy consumption; Diversity (politics); Relay; Computer science; Computer network; Wireless sensor network; Perspective (graphical); Wireless network; Efficient energy use; Energy (signal processing); Wireless; Routing protocol; Routing (electronic design automation); Telecommunications; Engineering; Channel (broadcasting); Artificial intelligence; Electrical engineering","score_opus":0.037773635301519254,"score_gpt":0.29408163922517483,"score_spread":0.2563080039236556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097475015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20221233,0.001241782,0.72595483,0.012395794,0.00038102153,0.0009851998,0.00016756763,0.00041374628,0.056247745],"genre_scores_gemma":[0.97843015,0.0034166244,0.01719278,0.0006932432,0.000034387776,0.000035951165,0.00008278924,0.00000887474,0.00010519367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963681,0.0010730117,0.0009244383,0.00059443957,0.00038386538,0.00065615575],"domain_scores_gemma":[0.9953928,0.00045594847,0.00033923943,0.0028867912,0.00068041036,0.00024483938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008769124,0.0003724813,0.0007867333,0.00043268543,0.00069565437,0.00020161079,0.004533185,0.00019403112,0.00043423497],"category_scores_gemma":[0.00008313733,0.0003825777,0.00027013296,0.0041821254,0.0006389745,0.00060382293,0.002410017,0.0005815311,0.00004132022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027875894,0.0006744347,0.009580131,0.0000041144435,0.00048378893,0.0000036685349,0.00076793344,0.034207135,0.000060548937,0.8885421,0.0020890352,0.063559234],"study_design_scores_gemma":[0.0007107226,0.00005794314,0.027869727,0.000049464863,0.00016678691,0.000008712342,0.00012258258,0.9667824,0.000115301795,0.0008376305,0.0028048735,0.00047383568],"about_ca_topic_score_codex":0.0001597837,"about_ca_topic_score_gemma":0.0069864113,"teacher_disagreement_score":0.9325753,"about_ca_system_score_codex":0.00044764014,"about_ca_system_score_gemma":0.00027120425,"threshold_uncertainty_score":0.9998626},"labels":[],"label_agreement":null},{"id":"W2097717088","doi":"10.1109/glocom.2007.823","title":"Performance of Decode-and-Forward Cooperative Diversity Networks Over Nakagami-m Fading Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Relay; Nakagami distribution; Computer science; Cooperative diversity; Bit error rate; Channel (broadcasting); SIGNAL (programming language); Relay channel; Diversity combining; Antenna diversity; Diversity scheme; Diversity gain; Algorithm; Telecommunications; Electronic engineering; Topology (electrical circuits); Wireless; Electrical engineering; Engineering; Physics","score_opus":0.02913654834944544,"score_gpt":0.26439649651154085,"score_spread":0.23525994816209542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097717088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4633388,0.00024367345,0.5306335,0.00009672116,0.00016315246,0.00009964883,2.6046405e-7,0.000060776427,0.0053634406],"genre_scores_gemma":[0.99403954,0.0009691187,0.0041034073,0.0003855302,0.000039172122,0.000001699569,0.000001226794,0.000004570897,0.00045572512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904865,0.00005545892,0.0002323117,0.00023892512,0.00016647376,0.00025815418],"domain_scores_gemma":[0.99905574,0.00018953727,0.000085911845,0.0003917485,0.0001761906,0.00010085542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351292,0.00012580186,0.00018060356,0.00009776691,0.0004840685,0.000053456966,0.000669254,0.000055253447,0.000049312748],"category_scores_gemma":[0.000023541616,0.000111320776,0.000040337316,0.0004711993,0.00008536636,0.0005379034,0.0017390007,0.00015724367,0.00000450316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014253189,0.00025248187,0.24795729,0.000054288317,0.00020898739,0.000014244291,0.015975088,0.03778375,0.0015234457,0.2384991,0.0028331457,0.45475563],"study_design_scores_gemma":[0.00038499155,0.000112280235,0.045493823,0.00004222414,0.0000055761393,0.0000050322997,0.00005268614,0.9505416,0.0022236388,0.000036448215,0.0008921279,0.00020958304],"about_ca_topic_score_codex":0.000010273702,"about_ca_topic_score_gemma":0.000045722703,"teacher_disagreement_score":0.9127578,"about_ca_system_score_codex":0.000037794463,"about_ca_system_score_gemma":0.000018687315,"threshold_uncertainty_score":0.45395294},"labels":[],"label_agreement":null},{"id":"W2097830764","doi":"10.1109/vetecf.2005.1558422","title":"Optimization of distributed space-time filtering","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Space (punctuation); Operating system","score_opus":0.016313385521742524,"score_gpt":0.23301507354841988,"score_spread":0.21670168802667736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097830764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012341052,0.000060935654,0.98445,0.00062294304,0.00003444592,0.00004138096,0.0000010501919,0.000093486335,0.013461682],"genre_scores_gemma":[0.8049513,0.000041061867,0.19393627,0.00003937963,0.000025900441,0.0000028806267,0.000022664923,0.0000030818665,0.0009774405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996188,0.000032136846,0.000121859644,0.00008830048,0.000066481305,0.00007241537],"domain_scores_gemma":[0.99952275,0.000035541714,0.000043494805,0.00030841603,0.00007473763,0.000015050764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000078719735,0.000043642638,0.00006567212,0.00003296724,0.000051542003,0.000038043785,0.00032737845,0.00001476968,0.000108598135],"category_scores_gemma":[0.000010865315,0.000040018018,0.000020455676,0.0002879068,0.000014387997,0.00017212985,0.00017860872,0.000026940063,0.00001339677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031776963,0.000102676735,0.0005070282,0.0000068862205,0.000009780218,0.0000011149691,0.000100097415,0.676784,0.02631288,0.2739378,0.012095234,0.010139324],"study_design_scores_gemma":[0.000102648555,0.000010765171,0.0009700269,0.000008591927,8.8030447e-7,0.0000010115149,0.000001428704,0.9876749,0.008337883,0.0001770291,0.002654518,0.000060299048],"about_ca_topic_score_codex":0.0000069383973,"about_ca_topic_score_gemma":0.0000037031398,"teacher_disagreement_score":0.8037172,"about_ca_system_score_codex":0.000012812549,"about_ca_system_score_gemma":0.000010776312,"threshold_uncertainty_score":0.16318874},"labels":[],"label_agreement":null},{"id":"W2097853288","doi":"10.1109/wcnc.2004.1311571","title":"Shannon capacity regions for orthogonally multiplexed MIMO broadcast channels with informed transmitters","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"MIMO; Channel capacity; Multiplexing; Beamforming; Computer science; Transmitter; Transmission (telecommunications); Fading; Channel (broadcasting); Spatial multiplexing; Electronic engineering; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering","score_opus":0.060740344695104705,"score_gpt":0.2705581466181112,"score_spread":0.20981780192300648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097853288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011488111,0.000046618923,0.97651964,0.008871564,0.00010568243,0.0005368927,0.0000030655278,0.00022273656,0.002205674],"genre_scores_gemma":[0.819212,0.000097163305,0.1779791,0.002043578,0.000038903712,0.00011538971,0.0000107248,0.000010344132,0.00049275765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990111,0.000031419637,0.0002173715,0.00027623327,0.00016304187,0.00030083244],"domain_scores_gemma":[0.9989071,0.00012919557,0.0000656824,0.00057030475,0.00020442781,0.00012332534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016137393,0.0001633265,0.00016111544,0.00009529761,0.000328222,0.00014982537,0.0007909763,0.000046943645,0.000012582735],"category_scores_gemma":[0.000027291142,0.00012689023,0.000078005134,0.0004248084,0.0000791267,0.0005616377,0.00008561028,0.00012219448,0.000011633899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011776187,0.00028960212,0.00015943657,0.000051256673,0.000110352325,0.000005554136,0.012372874,0.011290289,0.0047477153,0.89758646,0.0020000339,0.07126868],"study_design_scores_gemma":[0.030036718,0.0030439405,0.007762319,0.0011468291,0.000089137524,0.0002828909,0.0010673985,0.29255605,0.044575647,0.018914593,0.5963187,0.004205723],"about_ca_topic_score_codex":0.000019445613,"about_ca_topic_score_gemma":0.00064698694,"teacher_disagreement_score":0.8786719,"about_ca_system_score_codex":0.00007580512,"about_ca_system_score_gemma":0.0001849131,"threshold_uncertainty_score":0.51744336},"labels":[],"label_agreement":null},{"id":"W2097882868","doi":"10.1109/tcomm.2009.07.070510","title":"Error probabilities of noncoherent and coherent FSK in the presence of frequency and phase offsets for two-hop relay networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Frequency-shift keying; Relay; Rayleigh fading; Electronic engineering; Synchronization (alternating current); Hop (telecommunications); Computer science; Phase-shift keying; Bit error rate; Topology (electrical circuits); Telecommunications; Control theory (sociology); Fading; Engineering; Channel (broadcasting); Power (physics); Electrical engineering; Demodulation; Physics","score_opus":0.06746455128897061,"score_gpt":0.34433786787256826,"score_spread":0.27687331658359765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097882868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030843968,0.0026153729,0.9584362,0.0061034146,0.0000719995,0.0012613637,0.000025019128,0.00003737479,0.00060532003],"genre_scores_gemma":[0.9778013,0.0023217849,0.01951759,0.00011907025,0.0000047256435,0.00020314341,0.000004105949,0.0000043188834,0.00002391096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878126,0.00038734623,0.00040688636,0.00017602525,0.00011738309,0.00013108324],"domain_scores_gemma":[0.9968835,0.0011907526,0.00013900227,0.0016046126,0.00014360207,0.00003850045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052824,0.00011414491,0.00018685826,0.00010374551,0.0002963221,0.000039288552,0.0011704061,0.000046080866,0.0000041707344],"category_scores_gemma":[0.00002180592,0.000092597395,0.000048202786,0.00038333779,0.00026228855,0.0002178918,0.000017356722,0.0002748535,2.1828247e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013927296,0.005368,0.00024660703,0.000094362156,0.000098450895,5.4823175e-7,0.028333109,0.02498134,0.0068359966,0.2549036,0.00037358465,0.6786251],"study_design_scores_gemma":[0.0034359726,0.0013578256,0.0020425175,0.0003965195,0.000059176626,0.000015287915,0.0009751759,0.98003536,0.0022486134,0.007683704,0.0013946109,0.0003552293],"about_ca_topic_score_codex":0.000036273548,"about_ca_topic_score_gemma":0.00067838596,"teacher_disagreement_score":0.95505404,"about_ca_system_score_codex":0.000024079629,"about_ca_system_score_gemma":0.00004870685,"threshold_uncertainty_score":0.37760124},"labels":[],"label_agreement":null},{"id":"W2098042023","doi":"10.1109/acssc.2008.5074785","title":"OFDMA based cooperative relay networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Relay; Subcarrier; Orthogonal frequency-division multiple access; Transmitter power output; Orthogonal frequency-division multiplexing; Transmission (telecommunications); Pairwise error probability; Frequency offset; Electronic engineering; Frequency-division multiple access; Linear network coding; Offset (computer science); Carrier frequency offset; Channel (broadcasting); Computer network; Power (physics); Telecommunications; Transmitter; Fading; Engineering; Network packet","score_opus":0.046231693387381555,"score_gpt":0.261564624380547,"score_spread":0.21533293099316544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098042023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002972696,0.00050975115,0.975068,0.0032322567,0.00016187565,0.000108804765,2.1817684e-7,0.00027296628,0.01767346],"genre_scores_gemma":[0.96501255,0.0009858438,0.026893372,0.003835474,0.000051723215,0.000028339859,0.0000026220312,0.0000066357716,0.0031834391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913526,0.00015383691,0.0001622534,0.00023322555,0.00012736676,0.00018807297],"domain_scores_gemma":[0.9989123,0.00014936544,0.000038344093,0.00064214657,0.00017431282,0.000083585255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000157235,0.00010741589,0.00011784766,0.000051851235,0.0004323848,0.00005995841,0.0008128228,0.000042040894,0.00027390508],"category_scores_gemma":[0.00002859283,0.00008860366,0.00004498253,0.0005593415,0.0000656706,0.00028483884,0.00024077232,0.00016780543,0.00007482819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019509665,0.00036473264,0.006749086,0.0000041885623,0.000060412258,0.000063654974,0.0017637367,0.13069424,0.0009793184,0.6230577,0.12494755,0.111295864],"study_design_scores_gemma":[0.00027091458,0.000034619046,0.0024571044,0.0000103812445,0.0000011335924,0.000007846148,0.0000041583235,0.97730726,0.0006694643,0.000013848557,0.019076254,0.00014703527],"about_ca_topic_score_codex":0.000003436268,"about_ca_topic_score_gemma":0.000017345259,"teacher_disagreement_score":0.9620398,"about_ca_system_score_codex":0.000025910233,"about_ca_system_score_gemma":0.00008205664,"threshold_uncertainty_score":0.36131525},"labels":[],"label_agreement":null},{"id":"W2098111043","doi":"10.1002/wcm.1092","title":"Downlink media streaming with wireless fountain coding in wireline‐cum‐WiFi networks","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Retransmission; Wireless network; Network packet; Wireless; Telecommunications link; Automatic repeat request; Real-time computing; Hybrid automatic repeat request; Telecommunications","score_opus":0.040967077370888796,"score_gpt":0.26815583984976094,"score_spread":0.22718876247887215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098111043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36598966,0.004101781,0.6251111,0.0003199867,0.0001584578,0.00065390137,0.00000246735,0.0003762521,0.0032863691],"genre_scores_gemma":[0.9499974,0.006736353,0.04285407,0.00018170208,0.00005143573,0.00009888776,0.000027641523,0.00003082416,0.000021653153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755824,0.0004716187,0.0006784091,0.00055538904,0.00020753345,0.00052883546],"domain_scores_gemma":[0.99592143,0.00084356597,0.00029834892,0.0025276013,0.00023826871,0.0001707887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009636923,0.00033127188,0.00043484036,0.00034003198,0.0008697545,0.00024121786,0.0026901106,0.00012431444,0.000008139121],"category_scores_gemma":[0.000023918898,0.000312754,0.00005722534,0.0013706898,0.00032323456,0.00050589757,0.0023952357,0.00072109175,0.000004687998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001721429,0.00030444885,0.013717596,0.000023247672,0.00004026063,0.000011563583,0.013666663,0.0012270499,0.00026312665,0.1534871,0.00002775047,0.81721395],"study_design_scores_gemma":[0.0007669935,0.00009816604,0.008542567,0.0004986839,0.000011995965,0.000034561082,0.0009452003,0.9873465,0.00008923702,0.00015934001,0.0010344883,0.00047229152],"about_ca_topic_score_codex":0.00011355199,"about_ca_topic_score_gemma":0.00069836277,"teacher_disagreement_score":0.98611945,"about_ca_system_score_codex":0.00009604311,"about_ca_system_score_gemma":0.00009371392,"threshold_uncertainty_score":0.99993247},"labels":[],"label_agreement":null},{"id":"W2098158501","doi":"10.1109/vetecf.2007.251","title":"On the Power Allocation for Cooperative Amplify-and-Forward Transmission","year":2007,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Transmission (telecommunications); Power (physics); Bit error rate; Transmitter power output; Constraint (computer-aided design); Mathematical optimization; Computer network; Telecommunications; Engineering; Mathematics; Transmitter; Channel (broadcasting)","score_opus":0.03131498107798833,"score_gpt":0.2815158993711569,"score_spread":0.2502009182931686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098158501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05681577,0.0002845151,0.923322,0.01812667,0.000099349396,0.0004606368,9.503185e-7,0.00021118255,0.0006788823],"genre_scores_gemma":[0.991037,0.0002628454,0.007374095,0.0011129653,0.000009961534,0.0000785341,0.000002385783,0.000007536122,0.00011464853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999002,0.000069541486,0.00020809643,0.0003409818,0.00012856546,0.00025083506],"domain_scores_gemma":[0.9984825,0.00040564913,0.0000727468,0.00067316485,0.00031454378,0.000051366387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006989619,0.00015033128,0.00014568736,0.00015884393,0.00043642937,0.00008745989,0.000927398,0.0001808085,0.000015761178],"category_scores_gemma":[0.00012638584,0.00010383815,0.000035539106,0.00047297133,0.00020727613,0.0001239889,0.00009896036,0.00032781367,0.00001704109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104910505,0.000029345656,0.00001583441,0.0000021812489,0.000014556704,0.0000014731867,0.00033323106,0.000029498478,0.025471048,0.88186353,0.00033053197,0.09189829],"study_design_scores_gemma":[0.0020810275,0.0014536297,0.0011422483,0.00034462777,0.00003630434,0.00006455121,0.000624361,0.24882072,0.47396833,0.09782458,0.17248441,0.0011551911],"about_ca_topic_score_codex":9.5151836e-7,"about_ca_topic_score_gemma":0.000011974492,"teacher_disagreement_score":0.93422127,"about_ca_system_score_codex":0.00002991377,"about_ca_system_score_gemma":0.000061402265,"threshold_uncertainty_score":0.42343968},"labels":[],"label_agreement":null},{"id":"W2098231859","doi":"10.1109/icc.2011.5963233","title":"Power Allocation for Decode-and-Forward Cellular Relay Network with Channel Uncertainty","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Quality of service; Telecommunications link; Channel (broadcasting); Mathematical optimization; Resource allocation; Channel state information; Computer network; Power (physics); Constraint (computer-aided design); Telecommunications; Wireless; Engineering; Mathematics","score_opus":0.0387630487908766,"score_gpt":0.2421626289187921,"score_spread":0.20339958012791548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098231859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034627416,0.0003725039,0.98492104,0.00077565026,0.000114265145,0.00028987048,3.0660976e-7,0.0001256256,0.009938],"genre_scores_gemma":[0.8901253,0.00017017883,0.10798888,0.00076812337,0.000033614087,0.00006502676,0.0000042060865,0.000009086204,0.00083560625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992127,0.00005559652,0.00015332537,0.0002652807,0.00008954109,0.00022359127],"domain_scores_gemma":[0.9990672,0.00008639282,0.000062141815,0.00053328567,0.00016866908,0.00008234341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037633127,0.00011382463,0.000116593095,0.000035508576,0.00024513717,0.00006203668,0.0004878986,0.000041872077,0.000045035486],"category_scores_gemma":[0.000015487278,0.00008550076,0.00003036369,0.00023868751,0.00004048984,0.0002547762,0.00018929796,0.000077293,0.000011066609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078274556,0.00009782473,0.0005963367,0.000010942893,0.00007197984,0.0000019777456,0.005173501,0.003991614,0.00018933296,0.95561147,0.0069725187,0.027204206],"study_design_scores_gemma":[0.001195528,0.0006832879,0.0023199634,0.00007929416,0.000020742149,0.000011721864,0.00017174326,0.94054615,0.002204656,0.009236033,0.042887956,0.00064289774],"about_ca_topic_score_codex":0.000008168509,"about_ca_topic_score_gemma":0.00008779354,"teacher_disagreement_score":0.9463754,"about_ca_system_score_codex":0.000020789084,"about_ca_system_score_gemma":0.000035757486,"threshold_uncertainty_score":0.348662},"labels":[],"label_agreement":null},{"id":"W2098244346","doi":"10.1109/isit.2009.5205902","title":"Resource management in interference channels with asynchronous users","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Interference (communication); Channel (broadcasting); Computer network; Upper and lower bounds; Transmission (telecommunications); Asynchronous communication; Single antenna interference cancellation; Topology (electrical circuits); Telecommunications; Mathematics; Engineering; Electrical engineering","score_opus":0.02894827334004458,"score_gpt":0.2617994252485455,"score_spread":0.23285115190850092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098244346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008262183,0.000141502,0.850696,0.0042890627,0.000050700273,0.0001902798,3.9022005e-8,0.00015400891,0.13621621],"genre_scores_gemma":[0.9747308,0.00013002577,0.022659583,0.0015292949,0.000010637576,0.000007563063,5.2202637e-7,0.0000021826313,0.00092938275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993867,0.000051478302,0.0001089481,0.00020361891,0.0000890514,0.00016019633],"domain_scores_gemma":[0.9993692,0.000020881234,0.000023400884,0.00051550433,0.00003169924,0.000039285616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011278106,0.00007827039,0.00007623854,0.00009872231,0.0000558449,0.000105700376,0.00079945085,0.0000142077115,0.000022840402],"category_scores_gemma":[0.0000035734188,0.00006149844,0.000011571751,0.00043775688,0.000015843521,0.00019919642,0.0001891895,0.00009042296,0.000023216033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001275554,0.00009329959,0.00018811061,0.0000024612373,0.000008865382,0.000022317254,0.0013391518,0.0013332666,0.000046667104,0.3318393,0.0015395804,0.6635742],"study_design_scores_gemma":[0.0050314474,0.002322672,0.0898657,0.0008894092,0.00001523536,0.00005861451,0.0014259879,0.74058473,0.0034671891,0.008147866,0.1460668,0.0021243352],"about_ca_topic_score_codex":0.0000017865901,"about_ca_topic_score_gemma":0.000032295287,"teacher_disagreement_score":0.96646863,"about_ca_system_score_codex":0.000042986143,"about_ca_system_score_gemma":0.000009473638,"threshold_uncertainty_score":0.25078335},"labels":[],"label_agreement":null},{"id":"W2098345586","doi":"10.1109/wcnc.2002.993387","title":"Coverage enhancement through two-hop relaying in cellular radio systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer science; Computer network; Base station; Node (physics); Transmitter power output; Channel (broadcasting); Radio repeater; Interference (communication); Power control; Hop (telecommunications); Electronic engineering; Power (physics); Transmitter; Remote radio head; Engineering; Physics","score_opus":0.04023371464768147,"score_gpt":0.27631461387622946,"score_spread":0.236080899228548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098345586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012345158,0.0025199903,0.8764596,0.00022550047,0.0003915765,0.00020531358,7.921815e-8,0.00007212645,0.10778065],"genre_scores_gemma":[0.98407346,0.0009827362,0.012371938,0.00037432092,0.000018214558,0.0000300508,0.0000010387982,0.0000059441427,0.0021422768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875134,0.00030802286,0.0002770576,0.00026722474,0.00016574685,0.00023060375],"domain_scores_gemma":[0.9990422,0.000098203374,0.000056849036,0.00071444863,0.000047407957,0.000040905463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052113686,0.00011139037,0.00014832082,0.00005133748,0.00013973478,0.00016378243,0.00056481693,0.000028656348,0.000088971545],"category_scores_gemma":[0.000030443569,0.00010179673,0.000031518128,0.00046847822,0.00001615948,0.0004027633,0.00015767658,0.00014822627,0.00008570644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013272912,0.00006499453,0.00043544668,0.0000070670812,0.000007978942,0.000007801755,0.0012768474,0.0027890583,0.0076253777,0.98355013,0.00080055825,0.0034333942],"study_design_scores_gemma":[0.0039141933,0.00017133406,0.00025218164,0.00034429235,0.000008351602,0.000021270986,0.00045065137,0.439229,0.102121934,0.004735589,0.44748142,0.0012697643],"about_ca_topic_score_codex":0.000024740122,"about_ca_topic_score_gemma":0.00002046044,"teacher_disagreement_score":0.97881454,"about_ca_system_score_codex":0.00011557347,"about_ca_system_score_gemma":0.000046971785,"threshold_uncertainty_score":0.41511503},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016014977294656712,"score_gpt":0.24873354688599147,"score_spread":0.23271856959133477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098360731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010831304,0.00037248273,0.9808572,0.0006426885,0.00028137438,0.00011278391,9.7193336e-8,0.00026395268,0.0066381227],"genre_scores_gemma":[0.94573283,0.00012516117,0.053119667,0.00016901904,0.0000883351,0.000014472092,0.0000060117354,0.0000076139136,0.00073686964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991409,0.00007767829,0.00018933802,0.00027148158,0.000117513126,0.00020304367],"domain_scores_gemma":[0.9993371,0.000114068884,0.00006900733,0.0003198902,0.00011135532,0.00004860046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028034608,0.000109449255,0.00009022065,0.00006568765,0.00029220304,0.00023547396,0.00033002702,0.00006336023,0.000034646568],"category_scores_gemma":[0.000024458275,0.000103454746,0.000028025002,0.00037671693,0.000027298947,0.0004971417,0.00024027961,0.00016334112,0.000018432489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006438562,0.00010529732,0.00097236846,0.000005535577,0.000035571684,0.0000014841804,0.0003218537,0.07850672,0.003698671,0.7125709,0.008113626,0.19560358],"study_design_scores_gemma":[0.00045969625,0.00008853595,0.0022885206,0.0000059016443,0.000004871334,0.000005549446,0.000016666845,0.98785913,0.0003684053,0.000057461744,0.008674326,0.00017095651],"about_ca_topic_score_codex":0.00005393517,"about_ca_topic_score_gemma":0.00013132265,"teacher_disagreement_score":0.93490154,"about_ca_system_score_codex":0.000064393585,"about_ca_system_score_gemma":0.000029927642,"threshold_uncertainty_score":0.42187622},"labels":[],"label_agreement":null},{"id":"W2098500765","doi":"10.1109/tit.2011.2111650","title":"Asymptotic Analysis of Amplify and Forward Relaying in a Parallel MIMO Relay Network","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; MIMO; Multiplexing; Beamforming; Topology (electrical circuits); Computer science; Power (physics); Mathematics; Telecommunications; Combinatorics; Physics","score_opus":0.026983728311104408,"score_gpt":0.2433059930569498,"score_spread":0.2163222647458454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098500765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009432989,0.00007271531,0.9860175,0.00005078482,0.00011244813,0.00013741788,0.0000026964904,0.000058296002,0.0041151266],"genre_scores_gemma":[0.9843406,0.00040877538,0.014871257,0.00029692464,0.0000033011077,0.000031253978,0.000002956376,0.0000033421456,0.000041569863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896276,0.00019569742,0.00045257053,0.00011032478,0.00012530036,0.0001533675],"domain_scores_gemma":[0.9990085,0.00026060524,0.00015504821,0.00044954105,0.000074901276,0.000051454448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078985305,0.00010305871,0.00019510945,0.00056238146,0.00015965797,0.00004095455,0.00033438066,0.000067820845,0.00006982939],"category_scores_gemma":[0.000011345547,0.00009913528,0.000080106045,0.0013985775,0.0000556982,0.0011007198,0.000007675125,0.00021308636,0.000016984071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014587019,0.0001286095,0.0006642506,0.000024768113,0.00046120962,7.550377e-7,0.027577218,0.37534332,0.000022222195,0.381375,0.00006389007,0.21419288],"study_design_scores_gemma":[0.0012997448,0.00022166045,0.023742285,0.00014576757,0.0002910587,0.000007508283,0.00088540453,0.9618229,0.0005512705,0.009584255,0.0009429353,0.0005051939],"about_ca_topic_score_codex":0.000009895054,"about_ca_topic_score_gemma":0.00004847744,"teacher_disagreement_score":0.97490764,"about_ca_system_score_codex":0.000034849134,"about_ca_system_score_gemma":0.000026098993,"threshold_uncertainty_score":0.40426192},"labels":[],"label_agreement":null},{"id":"W2098577979","doi":"10.1109/cwit.2009.5069509","title":"Projective space codes for the injection metric","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear subspace; Finite field; Linear code; Subspace topology; Block code; Metric (unit); Vector space; Dimension (graph theory); Computer science; Context (archaeology); Discrete mathematics; Concatenated error correction code; Expander code; Coding (social sciences); Coding theory; Code (set theory); Mathematics; Algorithm; Combinatorics; Pure mathematics; Decoding methods; Artificial intelligence","score_opus":0.050641920897790065,"score_gpt":0.31789299687529976,"score_spread":0.2672510759775097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098577979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021591282,0.0004949589,0.9786028,0.008951566,0.00009449298,0.00030852557,1.5207148e-7,0.000112328766,0.011219219],"genre_scores_gemma":[0.9687972,0.00022339863,0.028227808,0.0010429649,0.00004538517,0.0000308094,4.2500633e-7,0.0000017263578,0.0016302816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995983,0.00004752785,0.0000683557,0.00012175231,0.00006989106,0.00009414375],"domain_scores_gemma":[0.99916285,0.0003232931,0.000028818746,0.00034282208,0.00012592139,0.000016321012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028296834,0.000049933875,0.0000509925,0.00006594438,0.00029326574,0.00011451421,0.0004803154,0.00001541753,0.000005987263],"category_scores_gemma":[0.00009258254,0.000030257006,0.00003235101,0.00076754054,0.000012505229,0.00018888846,0.00006519406,0.000057656816,0.0000068172976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037576729,0.000025586107,0.00003402136,5.205754e-7,0.00000752445,5.0469048e-8,0.00054119626,0.0002487909,0.0001993559,0.5620279,0.0060456484,0.43086568],"study_design_scores_gemma":[0.0004492368,0.00049968314,0.013678075,0.000009973166,0.000009871707,0.000009654019,0.00021156555,0.8831281,0.005154258,0.009929163,0.08670082,0.00021958204],"about_ca_topic_score_codex":0.00000456219,"about_ca_topic_score_gemma":0.000027225266,"teacher_disagreement_score":0.96858126,"about_ca_system_score_codex":0.000029113146,"about_ca_system_score_gemma":0.00002554858,"threshold_uncertainty_score":0.22555926},"labels":[],"label_agreement":null},{"id":"W2098606832","doi":"10.1145/1374618.1374658","title":"Dice","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Distributed computing; Unicast; Testbed; Linear network coding; Network packet; Multipath routing; Wireless; Wireless network; Emulation; Routing protocol; Wireless Routing Protocol; Telecommunications","score_opus":0.06937128291923605,"score_gpt":0.2744923359927039,"score_spread":0.20512105307346784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098606832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005354654,0.00020362376,0.8098749,0.0020173762,0.00006073708,0.000022518701,1.6584162e-8,0.00017368862,0.1822925],"genre_scores_gemma":[0.9643582,0.00044705626,0.029935157,0.0011521648,0.00001370839,0.0000020244656,1.4869586e-7,0.0000010058609,0.0040905066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997661,0.000020654057,0.00004280196,0.000066683846,0.000048812453,0.000054923734],"domain_scores_gemma":[0.9995964,0.000025220967,0.0000070160545,0.00031894597,0.000027663988,0.000024729688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004253572,0.000023786293,0.000026535043,0.000015670024,0.00013163446,0.000014389603,0.00043525206,0.0000067371357,0.0000690023],"category_scores_gemma":[0.000008316003,0.000019588228,0.000011425036,0.00015731767,0.000014552348,0.0001460296,0.00016663583,0.000032388205,0.00017755285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.514126e-7,0.000026810965,0.0014887351,3.936591e-7,0.0000030326335,0.0000060841567,0.000746535,0.00001230093,0.0006017242,0.8762296,0.028530916,0.092353545],"study_design_scores_gemma":[0.00038404166,0.00004747193,0.047043588,0.0000072205917,8.105416e-7,0.000121048884,0.000012602189,0.13502653,0.0041662687,0.0014849067,0.81140465,0.00030089234],"about_ca_topic_score_codex":9.263834e-7,"about_ca_topic_score_gemma":0.000002840411,"teacher_disagreement_score":0.95900357,"about_ca_system_score_codex":0.000005020618,"about_ca_system_score_gemma":0.000013428679,"threshold_uncertainty_score":0.22821419},"labels":[],"label_agreement":null},{"id":"W2098699135","doi":"10.5539/nct.v1n2p28","title":"Open Wireless System Cloud: An Architecture for Future Wireless Communications System","year":2012,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Municipal wireless network; Wireless; Computer network; Computer science; Wi-Fi array; Cognitive radio; Wireless intrusion prevention system; Wireless network; Wireless WAN; Radio resource management; Cloud computing; Fixed wireless; Flexibility (engineering); Telecommunications","score_opus":0.04076418760378884,"score_gpt":0.2930790842484787,"score_spread":0.25231489664468987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098699135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018850904,0.084862046,0.84390295,0.027478646,0.0012268665,0.004242184,0.000030297486,0.008842265,0.010563844],"genre_scores_gemma":[0.8788422,0.00745139,0.11236279,0.00015635314,0.00017670616,0.0008698568,0.000069622,0.000027061984,0.000044050685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772567,0.0006580369,0.00049995683,0.00039982115,0.00016666224,0.0005498591],"domain_scores_gemma":[0.9918775,0.0004517225,0.00035951345,0.006929075,0.00026186355,0.00012035321],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015051354,0.0003012684,0.00043365624,0.00012479178,0.0021541652,0.0006425739,0.011588764,0.0002960312,9.929556e-7],"category_scores_gemma":[0.00002413013,0.00027282364,0.000061865045,0.0008097543,0.0003219598,0.0011022609,0.007823279,0.00057953905,0.0000067053898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008973026,0.00005569039,0.0003003937,0.00004032418,0.000024813942,8.3011656e-8,0.00076896156,0.000022978542,0.00003783675,0.69879806,0.0010996341,0.29884225],"study_design_scores_gemma":[0.0022896829,0.00044157734,0.0025720128,0.0014767161,0.00012407561,0.00019814286,0.040640086,0.31304908,0.00079177925,0.0107089635,0.62569284,0.0020150084],"about_ca_topic_score_codex":0.000016333033,"about_ca_topic_score_gemma":0.000133244,"teacher_disagreement_score":0.85999125,"about_ca_system_score_codex":0.00014135704,"about_ca_system_score_gemma":0.000053857595,"threshold_uncertainty_score":0.9999724},"labels":[],"label_agreement":null},{"id":"W2098735675","doi":"10.1109/twc.2009.081680","title":"Average BER analysis for binary signallings in decode-and-forward dissimilar cooperative diversity networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Phase-shift keying; Binary number; Fading; Bit error rate; Cooperative diversity; Expression (computer science); Computer science; Relay channel; Algorithm; Frequency-shift keying; Diversity combining; Telecommunications; Mathematics; Linear network coding; Topology (electrical circuits); Decoding methods; Computer network; Channel (broadcasting); Arithmetic; Combinatorics; Physics","score_opus":0.04103740065848943,"score_gpt":0.28615611342605063,"score_spread":0.2451187127675612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098735675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014225071,0.00044655587,0.97938204,0.005030171,0.00006269946,0.00046539074,0.000020039395,0.00014076884,0.00022725736],"genre_scores_gemma":[0.98103976,0.0057994765,0.011963881,0.00089949823,0.000008881311,0.00011242118,0.000025406149,0.000010086502,0.00014056607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834687,0.0003585211,0.00040456557,0.00042281047,0.00016618283,0.000301057],"domain_scores_gemma":[0.99688435,0.0007525782,0.00011450564,0.0018886279,0.0002216047,0.0001383198],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045715837,0.00023302347,0.0003684496,0.00047777317,0.0018618684,0.0001584766,0.0019707277,0.00011649141,0.00001813453],"category_scores_gemma":[0.000008870146,0.00024550463,0.00020687148,0.0019596599,0.00014290078,0.0005443929,0.000082444334,0.0005186727,0.0000033472174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007305918,0.0011330401,0.000834832,0.000006599391,0.00041926355,0.0000026854943,0.0048929257,0.83532494,0.00038984738,0.026915003,0.000140714,0.12986709],"study_design_scores_gemma":[0.00058322866,0.00013329751,0.0043915324,0.000040260824,0.00009540604,0.0000013253308,0.000059966253,0.9933824,0.00027785907,0.00031021363,0.0004288016,0.000295742],"about_ca_topic_score_codex":0.000025580417,"about_ca_topic_score_gemma":0.00093678216,"teacher_disagreement_score":0.9674182,"about_ca_system_score_codex":0.00012413396,"about_ca_system_score_gemma":0.000049173806,"threshold_uncertainty_score":0.9999997},"labels":[],"label_agreement":null},{"id":"W2098857789","doi":"10.1109/jsac.2012.120920","title":"Fair Scheduling and Resource Allocation for Wireless Cellular Network with Shared Relays","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":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Computer network; Frequency reuse; Scheduling (production processes); Beamforming; Wireless; Base station; Wireless network; Resource allocation; Backhaul (telecommunications); Distributed computing; Telecommunications; Mathematical optimization","score_opus":0.049001630630752684,"score_gpt":0.28698898809993334,"score_spread":0.23798735746918065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098857789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09288606,0.0064358716,0.887255,0.010386556,0.00022997396,0.0009278694,0.0000034840898,0.00019470668,0.0016804747],"genre_scores_gemma":[0.9008523,0.0018106644,0.09651152,0.00043649614,0.00017903112,0.00011613827,0.000021091433,0.000021893236,0.000050852603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981643,0.0005746173,0.00042797666,0.00020154599,0.00020419262,0.0004273659],"domain_scores_gemma":[0.9967255,0.0009405442,0.0002835599,0.0014206106,0.00043724984,0.00019252348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011696988,0.00018222418,0.00021876587,0.00019764641,0.0010571812,0.00027234416,0.0016960441,0.00008741064,0.0000039616984],"category_scores_gemma":[0.0001295539,0.00016481218,0.00004069215,0.0012027328,0.00008554142,0.0007007111,0.00024895417,0.00079061417,0.000004475867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050246343,0.0025779046,0.044840552,0.00007304968,0.0004914712,0.000008430024,0.018870736,0.053725168,0.016593505,0.61549646,0.012144469,0.2346758],"study_design_scores_gemma":[0.0036809358,0.000633543,0.027223466,0.0015835622,0.0000784495,0.00032820768,0.00043683933,0.8435803,0.0021874085,0.0023315058,0.11668716,0.0012486026],"about_ca_topic_score_codex":0.0000021907238,"about_ca_topic_score_gemma":0.0000711136,"teacher_disagreement_score":0.80796623,"about_ca_system_score_codex":0.00015502029,"about_ca_system_score_gemma":0.00012823955,"threshold_uncertainty_score":0.8131089},"labels":[],"label_agreement":null},{"id":"W2098968166","doi":"10.1109/lcomm.2007.061887","title":"Comparison of symmetric and asymmetric routing for fixed two-hop cellular relaying network","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SAIT Polytechnic","funders":"","keywords":"Telecommunications link; Computer science; Computer network; Spectral efficiency; Routing (electronic design automation); Dynamic Source Routing; Hop (telecommunications); Cellular network; Routing protocol; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.07953254613723926,"score_gpt":0.3476981624333589,"score_spread":0.2681656162961196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098968166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042215846,0.0059339893,0.94570214,0.003834095,0.00026969606,0.0004386357,0.0000016011172,0.0001265379,0.0014774445],"genre_scores_gemma":[0.7950543,0.00034679656,0.20370734,0.00076437904,0.00006120551,0.000025418449,0.000010259392,0.000014531993,0.000015788815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981251,0.00027325415,0.00071489945,0.0002910663,0.00019955981,0.0003961418],"domain_scores_gemma":[0.9935052,0.0033182674,0.0004097392,0.002449035,0.0002190512,0.00009871355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020434984,0.00017605105,0.0003350469,0.0004648713,0.0008199316,0.00011729705,0.0025085597,0.00006102144,0.0000012410377],"category_scores_gemma":[0.00027147814,0.00019173702,0.00009931333,0.0026396466,0.00016921855,0.00028897324,0.0008219771,0.00035040625,0.0000039899182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030150186,0.0003947163,0.038635522,0.00006288894,0.00018138095,0.00000165579,0.0041599027,0.0059752525,0.07257771,0.4117206,0.0073540756,0.45890614],"study_design_scores_gemma":[0.0021687383,0.00017040761,0.011288565,0.00027202655,0.00009199072,0.00001078614,0.00034680153,0.9407995,0.01869824,0.0009082677,0.024333641,0.0009110365],"about_ca_topic_score_codex":0.000015614303,"about_ca_topic_score_gemma":0.00004537525,"teacher_disagreement_score":0.9348242,"about_ca_system_score_codex":0.0000823244,"about_ca_system_score_gemma":0.00002976138,"threshold_uncertainty_score":0.7818809},"labels":[],"label_agreement":null},{"id":"W2099167905","doi":"10.1109/tit.2007.907518","title":"Throughput Scaling Laws for Wireless Networks With Fading Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fading; Throughput; Scaling law; Computer network; Computer science; Wireless; Scaling; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.02089898317020835,"score_gpt":0.2604493209335271,"score_spread":0.23955033776331872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099167905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011566877,0.00003127045,0.9948893,0.00016767555,0.0006414472,0.0003891938,0.000002821455,0.0002659134,0.0024556506],"genre_scores_gemma":[0.9826937,0.00009015473,0.015986383,0.00093135034,0.00005552837,0.00007157394,0.000005630051,0.000010124328,0.00015561075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998974,0.00006572368,0.0003538946,0.00014109735,0.00017347666,0.00029180045],"domain_scores_gemma":[0.99863017,0.0004938662,0.00013594712,0.0004446163,0.00021424067,0.00008114174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011955984,0.00015245195,0.00013644161,0.00020789332,0.0006828446,0.0002163891,0.0004883458,0.000076176446,0.00001845854],"category_scores_gemma":[0.0000055577907,0.0001330037,0.00007326029,0.00050964893,0.0000567505,0.0018792251,0.000004652645,0.00022833324,0.00002595131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001250762,0.00004003276,0.000001269604,0.000014000523,0.000036307167,3.301925e-7,0.0033585492,0.27099684,0.00004990656,0.14167048,0.000067611225,0.5836396],"study_design_scores_gemma":[0.0010374209,0.00016666269,0.000025918964,0.00012587724,0.000015851174,0.000016673519,0.0005000791,0.97845167,0.011203913,0.0013073407,0.006791632,0.0003569417],"about_ca_topic_score_codex":0.000001218151,"about_ca_topic_score_gemma":0.000009176218,"teacher_disagreement_score":0.981537,"about_ca_system_score_codex":0.00007868275,"about_ca_system_score_gemma":0.00003594471,"threshold_uncertainty_score":0.54237336},"labels":[],"label_agreement":null},{"id":"W2099225340","doi":"10.1109/allerton.2008.4797712","title":"Cooperative strategies for the half-duplex Gaussian parallel relay channel: Simultaneous relaying versus successive relaying","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Gaussian; Channel (broadcasting); Relay channel; Linear network coding; Topology (electrical circuits); Additive white Gaussian noise; Coding (social sciences)","score_opus":0.07764390085016679,"score_gpt":0.3097839497556198,"score_spread":0.232140048905453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099225340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003038689,0.0020269696,0.9763371,0.006206939,0.00056715007,0.0008180877,0.0000018699519,0.0004186616,0.010584587],"genre_scores_gemma":[0.97705376,0.0017682078,0.017717473,0.0007750827,0.00013853578,0.00019985405,0.000009118007,0.000027163516,0.0023107855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797213,0.00022517584,0.0004260784,0.00056191086,0.00029459866,0.0005201332],"domain_scores_gemma":[0.99386585,0.0042841714,0.00018390013,0.0011055856,0.00043321733,0.00012726364],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00040375802,0.00031179804,0.00028608096,0.00009172864,0.0027095613,0.000434158,0.0018260952,0.00010958196,0.000046769605],"category_scores_gemma":[0.0004786152,0.00021485888,0.00013756787,0.0006528774,0.00023057479,0.0010218457,0.000519677,0.00042705558,0.000048341117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002221106,0.00009189182,0.000025414105,0.000011848788,0.00017756312,0.00007123983,0.013671518,0.41317487,0.00022841844,0.5568714,0.005169793,0.010283921],"study_design_scores_gemma":[0.0014365658,0.00024847858,0.000057946512,0.000036461308,0.00001619221,0.00003641735,0.002176962,0.9810833,0.00014344767,0.00020086455,0.014167926,0.00039545703],"about_ca_topic_score_codex":0.000045712168,"about_ca_topic_score_gemma":0.00027232443,"teacher_disagreement_score":0.9740151,"about_ca_system_score_codex":0.000101701065,"about_ca_system_score_gemma":0.00028901797,"threshold_uncertainty_score":0.9985888},"labels":[],"label_agreement":null},{"id":"W2099329089","doi":"10.1109/icc.2005.1495027","title":"On the impact of system resource constraints on wireless relaying channels","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cooperative diversity; Wireless; Antenna diversity; Constraint (computer-aided design); Computer network; Resource (disambiguation); Wireless network; Diversity (politics); Diversity gain; Diversity scheme; Channel (broadcasting); Distributed computing; Fading; Telecommunications; Engineering","score_opus":0.04665686188445333,"score_gpt":0.29193100531485444,"score_spread":0.2452741434304011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099329089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5125328,0.0001264725,0.14670916,0.0053975126,0.00013696756,0.00045453408,0.0000021013182,0.00031635622,0.33432412],"genre_scores_gemma":[0.99889016,0.00001445844,0.0003742391,0.00040043573,0.000035445955,0.000006024293,4.6279666e-7,0.0000043907585,0.00027440104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991826,0.0002004783,0.00017388082,0.00015094684,0.00015130291,0.00014082038],"domain_scores_gemma":[0.99858326,0.00050221034,0.00008053528,0.000733536,0.000057142435,0.00004331026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047353006,0.000091174436,0.00011315863,0.00005464794,0.00017812247,0.000065509645,0.0008274238,0.000027361886,0.00006885188],"category_scores_gemma":[0.000027748933,0.00005180947,0.00007283237,0.00024986878,0.00006217672,0.00008048697,0.00015689847,0.00014638492,0.000065612636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072040975,0.000042891465,0.00002551975,0.0000029900368,0.00001834696,7.7947516e-7,0.0008483602,0.006294948,0.00047693707,0.88105184,0.0029499277,0.10828028],"study_design_scores_gemma":[0.00045830177,0.00031265523,0.0006891288,0.0005500853,0.0000029186376,0.00001822213,0.0003035148,0.98914504,0.0069073937,0.00012970419,0.0012412869,0.00024174136],"about_ca_topic_score_codex":0.000004061682,"about_ca_topic_score_gemma":0.0000018535068,"teacher_disagreement_score":0.9828501,"about_ca_system_score_codex":0.000090051966,"about_ca_system_score_gemma":0.000031348038,"threshold_uncertainty_score":0.21127288},"labels":[],"label_agreement":null},{"id":"W2099370484","doi":"10.1109/twc.2011.042211.110221","title":"Diversity Analysis of Multi-User Multi-Relay Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Decoding methods; Cooperative diversity; Computer network; Diversity gain; Signal-to-noise ratio (imaging); Scheduling (production processes); Diversity (politics); Telecommunications; Topology (electrical circuits); Fading; Mathematics; Physics; Mathematical optimization; Power (physics); Combinatorics","score_opus":0.1050082034628097,"score_gpt":0.29600866053643227,"score_spread":0.19100045707362256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099370484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006137399,0.0003144639,0.9922296,0.00021202574,0.00016570055,0.0002199042,0.000015113,0.00020804325,0.0004977619],"genre_scores_gemma":[0.9242364,0.003193042,0.07193838,0.00016360481,0.0000031338145,0.00005208848,0.0000074496415,0.000012267508,0.00039364197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983021,0.0004737828,0.0004576527,0.00032568088,0.00019726096,0.00024349078],"domain_scores_gemma":[0.9947832,0.00032590813,0.0002149253,0.004214316,0.00033369704,0.00012790218],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00035894415,0.00020111028,0.0003570908,0.00057106576,0.0019214579,0.000032879943,0.004086969,0.00011645045,0.000085632564],"category_scores_gemma":[0.0000061003598,0.00021103724,0.00032817994,0.002747146,0.00027939276,0.0004040643,0.00025822883,0.00050071743,0.000019274567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010753922,0.015042471,0.014672362,0.00003026782,0.008097427,0.000006348562,0.06611873,0.47843084,0.0015674181,0.12328487,0.00023872932,0.29240298],"study_design_scores_gemma":[0.00048493608,0.000040331073,0.014060618,0.000026645723,0.0003353051,8.904738e-7,0.00009758151,0.9834709,0.00093401084,0.000008082604,0.00029738844,0.00024327084],"about_ca_topic_score_codex":0.00020521494,"about_ca_topic_score_gemma":0.0029474054,"teacher_disagreement_score":0.9202912,"about_ca_system_score_codex":0.00007507021,"about_ca_system_score_gemma":0.00004375734,"threshold_uncertainty_score":0.9993779},"labels":[],"label_agreement":null},{"id":"W2099440376","doi":"10.1109/bsc.2010.5473022","title":"On code design in joint MAC scheduling and wireless network coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless network; Wireless; Linear network coding; Computer network; Wi-Fi array; Coding (social sciences); Wireless WAN; Counterexample; Radio resource management; Scheduling (production processes); Distributed computing; Theoretical computer science; Telecommunications; Mathematics","score_opus":0.05827331867000095,"score_gpt":0.2826650668276926,"score_spread":0.22439174815769164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099440376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11652224,0.00008087702,0.8782114,0.0013656898,0.0002247631,0.00013651192,8.3543995e-8,0.00010069982,0.0033577306],"genre_scores_gemma":[0.8738183,0.00021788447,0.1250803,0.00073667796,0.000041609648,0.000009129662,3.157134e-7,0.000005291125,0.00009050952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915254,0.00012777786,0.00017363898,0.00023904354,0.00009471563,0.00021229773],"domain_scores_gemma":[0.99909246,0.00032957844,0.000040192495,0.0004310056,0.000038263395,0.00006850501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076163886,0.00009640521,0.00012311547,0.000067919565,0.00018035092,0.00016459424,0.00042132492,0.000046239813,0.000031329047],"category_scores_gemma":[0.00005657183,0.000086102824,0.000016218666,0.00031265107,0.0000352492,0.0001769157,0.00030997992,0.00035475954,0.00001541177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005552771,0.000028233151,0.00056803756,0.0000026965392,0.0000037248244,0.0000041544863,0.0003314712,0.0051765433,0.011094456,0.91452146,0.0004848666,0.06777881],"study_design_scores_gemma":[0.0002692579,0.00003063945,0.0025432091,0.00005811058,7.7964756e-7,0.000005389159,0.000010001438,0.99042773,0.0019744432,0.004067142,0.00046469757,0.00014862666],"about_ca_topic_score_codex":0.0000035198434,"about_ca_topic_score_gemma":0.00018137322,"teacher_disagreement_score":0.9852512,"about_ca_system_score_codex":0.000015553414,"about_ca_system_score_gemma":0.000029264178,"threshold_uncertainty_score":0.35111713},"labels":[],"label_agreement":null},{"id":"W2099463206","doi":"10.1109/vetecf.2009.5378713","title":"Performance Analysis of SNR-Based Selection Combining and BER-Based Selection Combining of Signals with Different Modulation Levels in Cooperative Communications","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bit error rate; Relay; Maximal-ratio combining; Modulation (music); Selection (genetic algorithm); Computer science; Cooperative diversity; Signal-to-noise ratio (imaging); Link adaptation; Diversity combining; Algorithm; Electronic engineering; Antenna diversity; Telecommunications; Antenna (radio); Topology (electrical circuits); Fading; Mathematics; Artificial intelligence; Engineering; Decoding methods; Physics; Power (physics); Combinatorics","score_opus":0.052067122178146207,"score_gpt":0.2931508615668914,"score_spread":0.2410837393887452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099463206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6315171,0.000041736035,0.36752805,0.00042418457,0.000006556383,0.0001793852,0.0000011578151,0.000039708262,0.00026210365],"genre_scores_gemma":[0.9862693,0.000052981493,0.013470678,0.00013748756,0.0000023459295,0.000018487674,0.000026418787,0.00000534034,0.000016963722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984835,0.00038517796,0.0004926053,0.0002584872,0.00022293792,0.00015731696],"domain_scores_gemma":[0.9983377,0.00031330434,0.00030105154,0.0005222833,0.00047973718,0.000045912613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044360248,0.00016237672,0.00040052432,0.0006696252,0.000246683,0.000055535715,0.00043595428,0.00005502928,0.000017671433],"category_scores_gemma":[0.00002978903,0.00014196686,0.000048279544,0.003050821,0.000092087794,0.0003762745,0.000073218485,0.00019128123,2.016715e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007114319,0.0006369955,0.21212737,0.00001983261,0.00016797165,1.136297e-7,0.0014079134,0.7161329,0.034369305,0.011870078,0.0000074427785,0.023188978],"study_design_scores_gemma":[0.0006051574,0.00038621522,0.31831864,0.00007850504,0.00004229569,3.1538943e-7,0.000027367101,0.6679598,0.012457055,0.000016966382,0.000002625857,0.00010505708],"about_ca_topic_score_codex":0.00003095126,"about_ca_topic_score_gemma":0.0006051359,"teacher_disagreement_score":0.35475218,"about_ca_system_score_codex":0.000082999555,"about_ca_system_score_gemma":0.00009702448,"threshold_uncertainty_score":0.57892406},"labels":[],"label_agreement":null},{"id":"W2099536161","doi":"10.1109/twc.2010.03.070065","title":"Performance analysis and power allocation for M-QAM cooperative diversity systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Cooperative diversity; Computer science; QAM; Quadrature amplitude modulation; Signal-to-noise ratio (imaging); Diversity gain; Wireless; Transmitter power output; Channel (broadcasting); Telecommunications; Bit error rate; Electronic engineering; Power (physics); Computer network; Control theory (sociology); Fading; Engineering; Physics","score_opus":0.03484855356980657,"score_gpt":0.27335070256233246,"score_spread":0.2385021489925259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099536161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12056425,0.0000916867,0.876198,0.0017431466,0.0002812889,0.00045801525,0.000023031751,0.00015944833,0.0004811193],"genre_scores_gemma":[0.988291,0.0015573777,0.009458838,0.00014186978,0.000009638001,0.0002595619,0.000015298196,0.000010267454,0.00025610588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885875,0.00018194388,0.00027932486,0.00032139965,0.00016546731,0.00019313036],"domain_scores_gemma":[0.99644685,0.0005138827,0.00011382715,0.0023516624,0.00046210576,0.00011167928],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00041213603,0.00017028491,0.00023144027,0.00032458451,0.0025706165,0.00020818107,0.0017456721,0.00009552717,0.000013004547],"category_scores_gemma":[0.000009793396,0.00017397257,0.00010598677,0.0011588404,0.00021026435,0.00057417096,0.00008017496,0.00044887478,0.000010018332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001353443,0.0029467582,0.005209574,0.00010392174,0.003036955,0.0000010068356,0.021405652,0.058712415,0.038641524,0.4274125,0.0006603855,0.44173393],"study_design_scores_gemma":[0.0004389817,0.00010422588,0.004141196,0.000021987798,0.00015243386,0.0000042348906,0.00011669369,0.98978806,0.0026913413,0.000024704399,0.0022205026,0.00029564818],"about_ca_topic_score_codex":0.000037647336,"about_ca_topic_score_gemma":0.0007970299,"teacher_disagreement_score":0.93107563,"about_ca_system_score_codex":0.000047989543,"about_ca_system_score_gemma":0.000059959308,"threshold_uncertainty_score":0.9987279},"labels":[],"label_agreement":null},{"id":"W2099597159","doi":"10.1109/iwqos.2007.376547","title":"Parallelized Progressive Network Coding With Hardware Acceleration","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; PowerPC; Linear network coding; SIMD; x86; Speedup; Parallel computing; Computer architecture; Computer network; Operating system; Network packet","score_opus":0.09776376773168913,"score_gpt":0.3754989711180038,"score_spread":0.27773520338631463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099597159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059132226,0.0003348869,0.89912134,0.022975655,0.00059949164,0.00042267208,0.0000037652558,0.00021680411,0.017193146],"genre_scores_gemma":[0.9614253,0.00009102698,0.033231556,0.0047111767,0.00021631783,0.000018785397,0.000035432808,0.000010576089,0.00025982273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99821603,0.00015273942,0.00050784636,0.0003137677,0.00058066205,0.00022896912],"domain_scores_gemma":[0.99746525,0.00065620197,0.0003886924,0.000543041,0.0008702022,0.00007662038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234577,0.00015404173,0.00020634505,0.00009608998,0.00018118277,0.00014816642,0.0012934284,0.000065657056,0.00010362744],"category_scores_gemma":[0.0000943854,0.00013511466,0.000053846772,0.00063216826,0.000038335314,0.00045386812,0.00027574846,0.00022513088,0.000024223413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007937002,0.00038016183,0.0041916715,0.00004466613,0.00023501976,0.000015455786,0.0031000192,0.013986756,0.0013053368,0.8544308,0.0016717684,0.11984465],"study_design_scores_gemma":[0.014929775,0.0008607413,0.48291746,0.0065327827,0.00007103164,0.000089030684,0.0027399533,0.34497127,0.01497644,0.019807884,0.10819446,0.0039091674],"about_ca_topic_score_codex":0.000013545907,"about_ca_topic_score_gemma":0.0003689022,"teacher_disagreement_score":0.9022931,"about_ca_system_score_codex":0.00007765938,"about_ca_system_score_gemma":0.000049401435,"threshold_uncertainty_score":0.5509816},"labels":[],"label_agreement":null},{"id":"W2099615353","doi":"10.1109/icc.2006.255256","title":"Uncoordinated Distributed Space-Time Trellis Coding","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Trellis (graph); Computer science; Space–time code; Space–time trellis code; Node (physics); Coding (social sciences); Block code; Linear network coding; Algorithm; Space–time block code; Wireless; Decoding methods; Theoretical computer science; Topology (electrical circuits); Mathematics; Computer network; Telecommunications; Combinatorics; Engineering; Network packet; Concatenated error correction code","score_opus":0.08132225189048607,"score_gpt":0.3244198392259747,"score_spread":0.24309758733548864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099615353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030557343,0.0003221778,0.5088787,0.070540085,0.00080784777,0.0004683244,0.00022051453,0.00087924016,0.41482738],"genre_scores_gemma":[0.9828435,0.00091266684,0.010284207,0.0003804235,0.0000904417,0.00007241942,0.0005079806,0.000016050457,0.004892317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822444,0.00028780467,0.00046429556,0.00036915037,0.00037579593,0.00027852957],"domain_scores_gemma":[0.99623847,0.00034024514,0.00023274946,0.0023735447,0.0007276476,0.00008732098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031934847,0.00023435673,0.0002137425,0.0002473819,0.0005464438,0.00048470154,0.004923627,0.00008766356,0.00033247803],"category_scores_gemma":[0.000072486626,0.00024250601,0.0001067787,0.0006639483,0.0001745256,0.00050081045,0.0006795289,0.00040576822,0.00068260723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006777771,0.0002664914,0.00018913987,0.0000012960828,0.000032209657,0.0000021173664,0.00007332945,0.0005383235,0.0061611757,0.96280223,0.023263255,0.006663629],"study_design_scores_gemma":[0.0007600989,0.00006665684,0.0025225866,0.00013717785,0.000012969383,0.000013739199,0.00003365426,0.84459776,0.0025680861,0.013669186,0.13507603,0.00054203096],"about_ca_topic_score_codex":0.00010614196,"about_ca_topic_score_gemma":0.00021733569,"teacher_disagreement_score":0.97978777,"about_ca_system_score_codex":0.00021758326,"about_ca_system_score_gemma":0.00012379463,"threshold_uncertainty_score":0.9889108},"labels":[],"label_agreement":null},{"id":"W2099712466","doi":"10.1109/twc.2010.090210.091464","title":"Mitigating Error Propagation in Two-Way Relay Channels with 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":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Relay; Thresholding; Computer science; Relay channel; Linear network coding; Channel (broadcasting); Bit error rate; Algorithm; Coding (social sciences); Error detection and correction; Word error rate; Real-time computing; Electronic engineering; Computer network; Mathematics; Speech recognition; Artificial intelligence; Statistics; Engineering; Physics","score_opus":0.03929448679069258,"score_gpt":0.29664690209795835,"score_spread":0.25735241530726577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099712466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059381142,0.00007796576,0.931901,0.005176822,0.00050288584,0.00060306524,0.0000037685106,0.00036585893,0.001987486],"genre_scores_gemma":[0.9392212,0.00035480052,0.059442263,0.0003512829,0.000049290753,0.00039451555,0.000009387183,0.000030837382,0.00014644657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979141,0.00044698268,0.00050845597,0.00043033768,0.00027727472,0.00042289955],"domain_scores_gemma":[0.99562293,0.0006069583,0.00020399402,0.0031883677,0.00024227609,0.00013549064],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00073547906,0.0002605876,0.00026452745,0.00026991437,0.0013377692,0.00025531667,0.002464109,0.000092485854,0.00002890458],"category_scores_gemma":[0.000014718304,0.00025288103,0.00007916011,0.0017155894,0.0002483001,0.0007570843,0.000045587964,0.0015159643,0.000042181608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006428483,0.0014616945,0.0009250189,0.000037616657,0.00012972075,0.000010311248,0.008874033,0.32443735,0.03296639,0.29670265,0.00025027903,0.33414066],"study_design_scores_gemma":[0.0011046615,0.00009526031,0.00057314953,0.0003504414,0.000017577837,0.00003273083,0.00012293391,0.9876506,0.0077381637,0.0003729228,0.0014194867,0.0005221219],"about_ca_topic_score_codex":0.000060177583,"about_ca_topic_score_gemma":0.00639959,"teacher_disagreement_score":0.87984,"about_ca_system_score_codex":0.00009886337,"about_ca_system_score_gemma":0.00013492646,"threshold_uncertainty_score":0.9999924},"labels":[],"label_agreement":null},{"id":"W2099792699","doi":"10.1109/icc.2013.6654822","title":"Privacy-preserving scheme in smart grid communication using enhanced network coding","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Anonymity; Computer network; Smart grid; Wireless; Traffic analysis; Provisioning; Adversary; Linear network coding; Robustness (evolution); Information privacy; Computer security; Telecommunications; Network packet","score_opus":0.05104210730706715,"score_gpt":0.2902685342022412,"score_spread":0.23922642689517404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099792699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19252983,0.0010460934,0.77980554,0.003162407,0.00027285962,0.0005581291,1.4211386e-7,0.0002993479,0.02232567],"genre_scores_gemma":[0.7664486,0.00051387714,0.23221941,0.000545295,0.00005083009,0.00003678208,0.0000034354034,0.000008857398,0.00017285858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984797,0.00031808752,0.00038374026,0.0002849256,0.0001647473,0.0003687631],"domain_scores_gemma":[0.9976241,0.0002531594,0.00011689082,0.0017540406,0.00017249041,0.00007934696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006003846,0.00014532538,0.00018458156,0.000102252896,0.0003524501,0.0003498001,0.0024524033,0.000058633574,0.00026523293],"category_scores_gemma":[0.000120364544,0.00014409164,0.00004155336,0.00091047335,0.000039622202,0.0013274323,0.002644771,0.00028532383,0.00008401214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018807603,0.00046298094,0.04713716,0.00007795775,0.000103850136,0.0000047562485,0.01009439,0.02327111,0.1886074,0.50646293,0.03370028,0.19005838],"study_design_scores_gemma":[0.00030847942,0.0000111332865,0.009373696,0.00017335857,0.0000013257752,0.0000023243983,0.000054598706,0.9831348,0.0020936718,0.0023019344,0.0022966075,0.00024808725],"about_ca_topic_score_codex":0.00014913495,"about_ca_topic_score_gemma":0.00021312862,"teacher_disagreement_score":0.95986366,"about_ca_system_score_codex":0.000108377426,"about_ca_system_score_gemma":0.000048774524,"threshold_uncertainty_score":0.58758867},"labels":[],"label_agreement":null},{"id":"W2099876783","doi":"10.1109/glocom.2009.5426222","title":"Optimization of Power Constrained Multi-Source Uplink Relay Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Beamforming; Relay; Telecommunications link; Computer science; Decoding methods; Relaxation (psychology); Antenna (radio); Mathematical optimization; Optimization problem; Power (physics); Transmitter power output; Computer network; Algorithm; Telecommunications; Mathematics; Transmitter","score_opus":0.025359786453839357,"score_gpt":0.2684067799738968,"score_spread":0.24304699352005743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099876783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026354546,0.00020606504,0.9896474,0.0012870163,0.000071359376,0.00010010583,8.236148e-8,0.00014435187,0.008280111],"genre_scores_gemma":[0.69773495,0.00016944825,0.30073452,0.00073924084,0.000009041773,0.0000011809389,0.0000022155746,0.0000027272051,0.00060665864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999315,0.00007002299,0.00023140777,0.00016675067,0.0000837922,0.00013299262],"domain_scores_gemma":[0.9991179,0.00007310006,0.00008562076,0.00051940174,0.00015092276,0.000053033367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002191686,0.00008404969,0.00011751996,0.000054464635,0.00009390048,0.000049347138,0.00056186615,0.000050550865,0.00010326182],"category_scores_gemma":[0.00003799386,0.00007493115,0.000042333497,0.00038762475,0.00003900242,0.00019795202,0.00011455046,0.0001075911,0.0000053045387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004125566,0.000102924685,0.000104417144,7.6597274e-7,0.000008558596,6.981873e-7,0.0004122168,0.7980867,0.00030529007,0.097048864,0.0007491214,0.10317631],"study_design_scores_gemma":[0.00031439346,0.0000537267,0.000583029,0.000013900385,0.0000015335661,0.0000027591514,0.000010123177,0.99804395,0.00016292142,0.000019206465,0.00070339476,0.00009105134],"about_ca_topic_score_codex":7.6252934e-7,"about_ca_topic_score_gemma":0.0000014951133,"teacher_disagreement_score":0.69747144,"about_ca_system_score_codex":0.000013752471,"about_ca_system_score_gemma":0.000024218556,"threshold_uncertainty_score":0.30556038},"labels":[],"label_agreement":null},{"id":"W2099912442","doi":"10.1109/glocom.2009.5425571","title":"On Reducing Blocking Probability in Cooperative Ad-hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Blocking (statistics); Computer network; Wireless ad hoc network; Multiple Access with Collision Avoidance for Wireless; Throughput; Markov chain; Relay; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Transmission (telecommunications); Markov process; Protocol (science); Stochastic geometry models of wireless networks; Channel (broadcasting); Carrier sense multiple access with collision avoidance; Distributed computing; Wireless; Telecommunications","score_opus":0.03702784373588706,"score_gpt":0.2848486567798063,"score_spread":0.24782081304391926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099912442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20042673,0.0028795425,0.7339998,0.012449971,0.0003787515,0.00094524043,2.0675348e-7,0.0006360684,0.04828367],"genre_scores_gemma":[0.9881811,0.00041993885,0.009161663,0.0019469926,0.000023972629,0.000011611804,9.389826e-7,0.0000037956513,0.00024998916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998713,0.0002365362,0.00026499093,0.00039010742,0.00013211393,0.0002632331],"domain_scores_gemma":[0.9988378,0.00019468073,0.000047969264,0.0007543235,0.0001003428,0.000064878644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005464182,0.00013589348,0.00016124862,0.00008726745,0.00018717743,0.00015305786,0.0007231379,0.00005030861,0.00003930349],"category_scores_gemma":[0.00010103885,0.00011690808,0.00003535494,0.00077530043,0.000027324682,0.00029482166,0.0001710787,0.00031596865,0.000015605028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016384187,0.00020180191,0.00008915502,0.0000016036531,0.000004045187,0.0000049632185,0.0011890929,0.07622378,0.00025419597,0.3407682,0.00074675615,0.58050007],"study_design_scores_gemma":[0.0004398249,0.00028015574,0.00575642,0.0001439718,0.0000010419245,0.0000034589052,0.000017277536,0.9872671,0.00048089778,0.004123493,0.0012163972,0.00026996664],"about_ca_topic_score_codex":0.000001534975,"about_ca_topic_score_gemma":0.00006932238,"teacher_disagreement_score":0.9110433,"about_ca_system_score_codex":0.00011404227,"about_ca_system_score_gemma":0.00004851524,"threshold_uncertainty_score":0.47673732},"labels":[],"label_agreement":null},{"id":"W2100089651","doi":"10.1109/icc.2011.5962461","title":"Doubly Selective Cascaded Channel Estimation in Amplify-and-Forward Relay Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Fading; Channel (broadcasting); Computer science; Degradation (telecommunications); Block (permutation group theory); Control theory (sociology); Algorithm; Relay channel; Electronic engineering; Mathematics; Telecommunications; Engineering; Power (physics); Physics; Artificial intelligence","score_opus":0.06431912737604667,"score_gpt":0.27395536144032356,"score_spread":0.2096362340642769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100089651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013962388,0.0005192517,0.9563356,0.0003606718,0.00019738791,0.00033923567,3.4999437e-7,0.00019401005,0.028091092],"genre_scores_gemma":[0.9877153,0.0001694977,0.011532776,0.00013693294,0.000009911302,0.0000429296,0.0000013795794,0.0000047791686,0.000386485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919796,0.00012904294,0.00019554423,0.00022386214,0.00009402662,0.00015957301],"domain_scores_gemma":[0.9993989,0.00007186158,0.00005583019,0.0003369328,0.00007931279,0.00005716785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036506145,0.00009224769,0.00012440974,0.00012379678,0.00010543702,0.00007976704,0.00038446378,0.00005458293,0.000008502096],"category_scores_gemma":[0.00003201391,0.000080084785,0.000015259675,0.00042681745,0.000023630546,0.00043410045,0.00021125095,0.00015329797,0.000032120417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030675186,0.00016045036,0.001732106,0.000027591062,0.00004328305,0.000010413512,0.030960497,0.005468683,0.000349274,0.9156559,0.0017948635,0.04376625],"study_design_scores_gemma":[0.00038360344,0.00005769244,0.008180869,0.000038860555,0.0000024308094,0.000019915178,0.00009591957,0.98899573,0.00060725934,0.0010338144,0.00041100927,0.00017291233],"about_ca_topic_score_codex":0.00014920502,"about_ca_topic_score_gemma":0.00013410764,"teacher_disagreement_score":0.983527,"about_ca_system_score_codex":0.00005258523,"about_ca_system_score_gemma":0.000028463077,"threshold_uncertainty_score":0.32657626},"labels":[],"label_agreement":null},{"id":"W2100597260","doi":"10.1002/wcm.2585","title":"Cluster‐based coordination scheme for cooperative cognitive radio networks","year":2015,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Computer network; Cluster (spacecraft); Scheme (mathematics); Throughput; Cognitive network; Selection (genetic algorithm); Matching (statistics); Bipartite graph; Transmission (telecommunications); Linear network coding; Reliability (semiconductor); Distributed computing; Telecommunications; Theoretical computer science; Artificial intelligence; Wireless","score_opus":0.057562788581584035,"score_gpt":0.3204622406239481,"score_spread":0.2628994520423641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100597260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01865651,0.0042443196,0.9734672,0.0015262786,0.00014943923,0.0010211193,0.0000052759124,0.00022936086,0.0007005056],"genre_scores_gemma":[0.9234196,0.0004498699,0.0749805,0.0005860779,0.000061872706,0.0003123679,0.00010136711,0.00001930673,0.00006903861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983129,0.00045509165,0.00040482948,0.00038395746,0.00014517238,0.00029806563],"domain_scores_gemma":[0.99588317,0.0014345432,0.00021566845,0.0012503279,0.0010322587,0.00018401412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010249793,0.00021455312,0.00028177173,0.00012765163,0.0010054656,0.0003409721,0.001394219,0.000089242305,0.0000017713327],"category_scores_gemma":[0.0001422447,0.00022101712,0.00006411401,0.0005789005,0.00021932846,0.0003774169,0.0012549874,0.0002874273,0.0000036991821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005851508,0.0005338472,0.001421499,0.000038147664,0.0001159795,0.0000010632223,0.0071268347,0.019010121,0.00035449475,0.15947971,0.0032425094,0.8086173],"study_design_scores_gemma":[0.0015848388,0.00018062718,0.00014048579,0.00013524732,0.000011719361,0.000006194651,0.0004376173,0.9848551,0.00009316035,0.0000996615,0.012186953,0.00026836657],"about_ca_topic_score_codex":0.0000074688483,"about_ca_topic_score_gemma":0.000025003817,"teacher_disagreement_score":0.965845,"about_ca_system_score_codex":0.00008816534,"about_ca_system_score_gemma":0.00016852096,"threshold_uncertainty_score":0.9012817},"labels":[],"label_agreement":null},{"id":"W2100889655","doi":"10.1002/wcm.2251","title":"A hierarchical framework of dynamic relay selection for mobile users and profit maximization for service providers in wireless relay networks","year":2012,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Computer network; Wireless; Profit maximization; Service provider; Selection (genetic algorithm); Maximization; Telecommunications; Profit (economics); Service (business); Business; Mathematical optimization; Artificial intelligence","score_opus":0.023713010011215233,"score_gpt":0.3030787915883862,"score_spread":0.27936578157717096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100889655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3609803,0.0024652025,0.6343736,0.00050300773,0.00007581319,0.0015098715,0.0000031094633,0.00007356793,0.000015495452],"genre_scores_gemma":[0.8383599,0.0023296638,0.15825331,0.00013846479,0.000027753813,0.0008183469,0.00003896368,0.000023615083,0.000010011667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829245,0.0003065708,0.00056146557,0.00034388815,0.000105418534,0.000390225],"domain_scores_gemma":[0.9967426,0.0015724363,0.00030098818,0.0009669511,0.00030696284,0.00011006583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010130735,0.000200696,0.00032957154,0.0001798352,0.0006492638,0.00012348185,0.0008571589,0.00016968303,7.1930094e-7],"category_scores_gemma":[0.00006233121,0.00021293075,0.00005586671,0.0008127731,0.000139206,0.0004944976,0.0008525889,0.00039418033,2.318752e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007630688,0.0004333522,0.028564697,0.0003638726,0.00007445802,7.99798e-8,0.014021214,0.03699372,0.0015509547,0.13834102,0.000042234627,0.7795381],"study_design_scores_gemma":[0.00058633153,0.0001337808,0.003265721,0.0003042727,0.000015868778,0.000006734382,0.00035429702,0.9939599,0.000059537397,0.00023925578,0.0008467933,0.00022750613],"about_ca_topic_score_codex":0.000024406338,"about_ca_topic_score_gemma":0.00013559777,"teacher_disagreement_score":0.95696616,"about_ca_system_score_codex":0.000084934254,"about_ca_system_score_gemma":0.000066075074,"threshold_uncertainty_score":0.8683064},"labels":[],"label_agreement":null},{"id":"W2101092011","doi":"10.1109/twc.2011.042211.101183","title":"Resource Allocation and Scheduling in Multi-Cell OFDMA Systems with Decode-and-Forward Relaying","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Orthogonal frequency-division multiple access; Mathematical optimization; Subcarrier; Scheduling (production processes); Frequency-division multiple access; Resource allocation; Optimization problem; Convex optimization; Orthogonal frequency-division multiplexing; Base station; Algorithm; Regular polygon; Computer network; Mathematics; Channel (broadcasting)","score_opus":0.07457295392175613,"score_gpt":0.2733253420508579,"score_spread":0.1987523881291018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101092011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055939388,0.0020327342,0.93957645,0.0010131776,0.000052989566,0.00037519453,0.0000030460271,0.00016156289,0.00084545783],"genre_scores_gemma":[0.93058467,0.0067431047,0.062114783,0.00011120703,0.0000033950844,0.00024760576,0.0000019883526,0.00001980215,0.00017346146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856424,0.00037743268,0.0003612196,0.00034208802,0.00013954358,0.00021545829],"domain_scores_gemma":[0.9975866,0.00030692056,0.00013099921,0.0017396647,0.00012396195,0.0001118416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041582712,0.00018662176,0.00020865045,0.00028626024,0.00071305555,0.00013655971,0.0011134101,0.00008854587,0.000005830515],"category_scores_gemma":[0.000005048603,0.00018175849,0.00003058782,0.00063410413,0.00017820134,0.0004837855,0.000046602134,0.0005201527,0.00000836633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018810327,0.004371775,0.0056476216,0.00025774023,0.00029185272,0.000011291035,0.062275864,0.09531896,0.008598887,0.096400924,0.000041358548,0.72659564],"study_design_scores_gemma":[0.00096341094,0.00007859974,0.0016514715,0.00032828512,0.000024334871,0.00001730532,0.0008206687,0.9937474,0.0015063112,0.000016713266,0.0005331061,0.00031239388],"about_ca_topic_score_codex":0.000120109944,"about_ca_topic_score_gemma":0.0007101524,"teacher_disagreement_score":0.89842844,"about_ca_system_score_codex":0.00006784728,"about_ca_system_score_gemma":0.000057954243,"threshold_uncertainty_score":0.74118954},"labels":[],"label_agreement":null},{"id":"W2101132792","doi":"10.1109/icassp.2008.4518335","title":"Joint power and resource allocation for orthogonal amplify-and-forward pairwise user cooperation","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Resource allocation; Pairwise comparison; Computer science; Mathematical optimization; Max-min fairness; Channel (broadcasting); Channel allocation schemes; Bandwidth (computing); Resource management (computing); Joint (building); Transmission (telecommunications); Power (physics); Computer network; Wireless; Telecommunications; Mathematics; Engineering; Artificial intelligence","score_opus":0.06739417976058992,"score_gpt":0.28571297023999553,"score_spread":0.2183187904794056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101132792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.561338,0.00034810771,0.42456055,0.008715111,0.00025143166,0.00067266286,0.000017040502,0.000106438085,0.0039906716],"genre_scores_gemma":[0.9895019,0.0005052115,0.00889094,0.00055539445,0.0000852692,0.00002154009,0.0000035228718,0.000011412443,0.00042483062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987983,0.00001678757,0.00034336073,0.00035385767,0.00032581136,0.00016186573],"domain_scores_gemma":[0.99838734,0.00007344228,0.00026871084,0.00009814732,0.0010935724,0.000078779216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041458884,0.00017551733,0.00018803589,0.00011292391,0.00049228594,0.0003094179,0.0004683927,0.000077370314,0.000009631654],"category_scores_gemma":[0.00014570427,0.00013927919,0.000037194503,0.00012784192,0.00023731147,0.0005298073,0.00021649992,0.00021570854,7.2474404e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030451463,0.000272719,0.0022718864,0.0002838375,0.00011581602,0.000001884004,0.0066079404,0.0003771028,0.37879148,0.42311442,0.0030264726,0.18483193],"study_design_scores_gemma":[0.0013477749,0.0003670723,0.005781205,0.0007514495,0.000043450225,0.00014185786,0.00067676033,0.9595006,0.019989474,0.008052826,0.0027800384,0.0005675026],"about_ca_topic_score_codex":0.00000247744,"about_ca_topic_score_gemma":0.0000016783938,"teacher_disagreement_score":0.9591235,"about_ca_system_score_codex":0.000035353387,"about_ca_system_score_gemma":0.00009340666,"threshold_uncertainty_score":0.567964},"labels":[],"label_agreement":null},{"id":"W2101230188","doi":"10.1109/atc.2008.4760498","title":"Minimalist self-organization in wireless networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Radio resource management; Distributed computing; Wireless network; Self-organization; Wireless; Wireless ad hoc network; Scalability; Fault tolerance; Wireless sensor network; Evolving networks; Adaptability; Heuristic; Computer network; Complex network; Telecommunications; Artificial intelligence","score_opus":0.023074929229205055,"score_gpt":0.23480062962872747,"score_spread":0.2117257003995224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101230188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13426071,0.00012742379,0.8532521,0.0012149339,0.00013327244,0.000106368265,5.7914257e-8,0.0003694383,0.01053566],"genre_scores_gemma":[0.98768115,0.0010319633,0.010360444,0.0005783183,0.000028214607,0.0000035831883,0.0000030326694,0.000005006123,0.00030829958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941754,0.0000734588,0.00014426484,0.00015781965,0.00007921076,0.00012770196],"domain_scores_gemma":[0.9993944,0.0000487941,0.000028888393,0.00036953753,0.00012176351,0.000036603098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010932133,0.000064248816,0.000077512115,0.000057854635,0.0001477824,0.000043232634,0.00055587874,0.000032604585,0.000039442584],"category_scores_gemma":[0.000017004868,0.00006164495,0.000010479256,0.0012646985,0.00001818373,0.000270011,0.0002318424,0.000088827954,0.000028201732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004210004,0.00047316946,0.20206809,0.0000068820113,0.000019960979,0.000057836074,0.0063894964,0.002219863,0.00087664364,0.71775824,0.018043501,0.052082088],"study_design_scores_gemma":[0.00039012785,0.000022365528,0.11133998,0.000013609763,9.4681144e-7,0.000036788097,0.0000150591095,0.8841485,0.00076501386,0.00004692978,0.0029941571,0.00022655781],"about_ca_topic_score_codex":0.000005869011,"about_ca_topic_score_gemma":0.000053246058,"teacher_disagreement_score":0.8819286,"about_ca_system_score_codex":0.000037301255,"about_ca_system_score_gemma":0.000040959832,"threshold_uncertainty_score":0.2513808},"labels":[],"label_agreement":null},{"id":"W2101309139","doi":"10.1109/glocom.2009.5425462","title":"QoS-Driven Node Cooperative Resource Allocation for Wireless Mesh Networks with Service Differentiation","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Quality of service; Resource allocation; Wireless mesh network; Node (physics); Throughput; Resource management (computing); Network packet; Differentiated services; Wireless network; Provisioning; Distributed computing; Wireless; Telecommunications; Engineering","score_opus":0.02496329496541396,"score_gpt":0.2575997868926869,"score_spread":0.23263649192727295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101309139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007602486,0.000050592844,0.9786905,0.01081594,0.0000655614,0.00048881647,7.8206307e-7,0.00022897047,0.0020563214],"genre_scores_gemma":[0.9691866,0.0001048059,0.024384795,0.00559514,0.00011382343,0.00006320376,0.00006611855,0.000010423555,0.00047510752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887383,0.0001335455,0.00022316362,0.0003581888,0.00016879784,0.00024246203],"domain_scores_gemma":[0.9985204,0.00014555505,0.00010899701,0.00064113806,0.0005032546,0.00008065647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017881268,0.00017267963,0.0001747444,0.00006236599,0.0003883863,0.00024803457,0.00077203114,0.0000633319,0.000014536322],"category_scores_gemma":[0.0000124270255,0.00013755212,0.000034500794,0.0006210775,0.000019270688,0.0004598171,0.00010948685,0.00013518083,0.0000072036983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013012286,0.0003084463,0.0003881898,0.000014945199,0.00007919698,0.0000011485919,0.0033541736,0.060556456,0.0037815757,0.7630581,0.009416894,0.15891072],"study_design_scores_gemma":[0.00066247216,0.00016264242,0.0031828363,0.000046710662,0.000009788179,0.0000024930655,0.000051531853,0.9916793,0.0009919858,0.000074988144,0.002911933,0.0002232781],"about_ca_topic_score_codex":0.0000037189,"about_ca_topic_score_gemma":0.00020117822,"teacher_disagreement_score":0.9615841,"about_ca_system_score_codex":0.00005890083,"about_ca_system_score_gemma":0.00004798142,"threshold_uncertainty_score":0.56092125},"labels":[],"label_agreement":null},{"id":"W2101515343","doi":"10.1109/icc.2011.5963123","title":"Completion Delay Minimization for Instantly Decodable Network Coding with Limited Feedback","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Coding (social sciences); Minification; Path (computing); Decoding methods; Mathematical optimization; Algorithm; Mathematics; Computer network","score_opus":0.08065078401681544,"score_gpt":0.25796491742524547,"score_spread":0.17731413340843002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101515343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023544973,0.00009609925,0.9720117,0.00027867194,0.00012125934,0.00034207536,5.63144e-7,0.00021471373,0.02458042],"genre_scores_gemma":[0.61677605,0.00015087506,0.38194513,0.00063700596,0.0000419871,0.000042263786,0.000013248584,0.0000104707115,0.0003829635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906385,0.000079082114,0.00022079425,0.00026085484,0.00011432319,0.0002610871],"domain_scores_gemma":[0.99890506,0.00013799343,0.000104328225,0.00048134488,0.0003004457,0.00007082594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026838915,0.00012446576,0.00014421197,0.00006228713,0.00038818287,0.00011663686,0.0005668559,0.000042169482,0.00006828912],"category_scores_gemma":[0.000024267512,0.00010231473,0.000033327407,0.00059887185,0.00003403527,0.00046882243,0.00015558852,0.00007244961,0.000014173126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012170593,0.00012884813,0.003952719,0.000014667949,0.00005156821,0.0000019967868,0.0017650704,0.002909814,0.00019966936,0.9351253,0.011115305,0.04461335],"study_design_scores_gemma":[0.0012879696,0.00035982046,0.007087671,0.000099230354,0.000015702119,0.00001565313,0.00006971293,0.95922697,0.0009294551,0.001937298,0.028557021,0.00041350233],"about_ca_topic_score_codex":0.000007347382,"about_ca_topic_score_gemma":0.00017308803,"teacher_disagreement_score":0.9563171,"about_ca_system_score_codex":0.00003885538,"about_ca_system_score_gemma":0.000044206565,"threshold_uncertainty_score":0.41722736},"labels":[],"label_agreement":null},{"id":"W2101587820","doi":"10.1109/glocom.2010.5683807","title":"Adaptive Power Allocation for Bidirectional Amplify-and-Forward Multiple-Relay Multiple-User Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Computer science; Resource allocation; Computer network; Interference (communication); Relay channel; Power (physics); Channel (broadcasting)","score_opus":0.026185075578280686,"score_gpt":0.26721167664748297,"score_spread":0.2410266010692023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101587820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008593733,0.00011884087,0.9868527,0.001499189,0.0007968062,0.00045968304,0.000002733712,0.0002462707,0.0014300281],"genre_scores_gemma":[0.8869502,0.000108044034,0.110640496,0.0007065408,0.00012429718,0.00013732618,0.000014602112,0.000013725136,0.0013047927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887043,0.000071009345,0.00024933746,0.0004000985,0.0001461488,0.00026297927],"domain_scores_gemma":[0.99792844,0.0009716793,0.000087933804,0.0005667804,0.00031546576,0.00012967236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004484555,0.00016955662,0.00015240564,0.00009039282,0.00041942913,0.00016616588,0.00056838733,0.00012940055,0.000061319166],"category_scores_gemma":[0.00022959443,0.00014998733,0.00007010869,0.00026478738,0.00007603876,0.00044417215,0.00030485613,0.00033611694,0.000019747484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001194096,0.00026356184,0.008755219,0.0000065079,0.00013115157,8.430164e-7,0.0013416174,0.0048210835,0.008111008,0.78467023,0.015638798,0.17614059],"study_design_scores_gemma":[0.00075146696,0.00006981652,0.009492882,0.0000088721745,0.00000521247,0.0000068503577,0.00003296685,0.92322075,0.00052766467,0.00021122493,0.06543088,0.00024138943],"about_ca_topic_score_codex":0.000015050247,"about_ca_topic_score_gemma":0.0006757505,"teacher_disagreement_score":0.9183997,"about_ca_system_score_codex":0.000026337919,"about_ca_system_score_gemma":0.000048062535,"threshold_uncertainty_score":0.61163056},"labels":[],"label_agreement":null},{"id":"W2101667821","doi":"10.1109/wcnc.2006.1683610","title":"Multi-antenna aspects of wireless fixed relays","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Fading; Wireless; Antenna (radio); Nakagami distribution; Distributed antenna system; Wireless network; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.03603947089018351,"score_gpt":0.26664625213228227,"score_spread":0.23060678124209877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101667821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021471528,0.00032978127,0.93716395,0.0007729726,0.00013491976,0.000119136064,3.872706e-7,0.00014477049,0.039862555],"genre_scores_gemma":[0.9569793,0.000077714234,0.041496605,0.00012158804,0.000017311,0.0000057861234,0.0000013410702,0.0000035722946,0.0012968121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993943,0.000058164496,0.00018179852,0.00014869362,0.00009981249,0.000117236],"domain_scores_gemma":[0.9991802,0.00006679954,0.00005979327,0.00055514346,0.000112220914,0.000025822288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013456862,0.00006665698,0.00010453615,0.000050337127,0.00007463048,0.000033887907,0.00066349516,0.000024713703,0.00003908599],"category_scores_gemma":[0.000011711888,0.000056850287,0.000039124345,0.00032366504,0.000032613425,0.00015792073,0.00025684174,0.00007002456,0.00003098863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016267267,0.00013974258,0.0012536696,0.000004409077,0.0000066452576,0.0000031141637,0.00017825363,0.00005412323,0.07743333,0.9000833,0.0016202127,0.019221567],"study_design_scores_gemma":[0.00073233986,0.000049627077,0.03407067,0.00004479874,0.0000033898175,0.000005843675,0.000023449657,0.9241218,0.033294607,0.0014189623,0.0059821587,0.00025235757],"about_ca_topic_score_codex":0.000031590695,"about_ca_topic_score_gemma":0.0002026497,"teacher_disagreement_score":0.9355077,"about_ca_system_score_codex":0.0000144191135,"about_ca_system_score_gemma":0.00002651042,"threshold_uncertainty_score":0.23182875},"labels":[],"label_agreement":null},{"id":"W2101897080","doi":"10.1109/tvt.2007.891416","title":"Minimum BER Transmit Power Allocation and Beamforming for Two-Input–Multiple-Output Spatial Multiplexing Systems","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Beamforming; Spatial multiplexing; MIMO; Multiplexing; Bit error rate; Electronic engineering; Computer science; Transmitter power output; Phase-shift keying; Interference (communication); Precoding; Control theory (sociology); Transmitter; Engineering; Algorithm; Telecommunications; Decoding methods; Channel (broadcasting)","score_opus":0.02090753524169106,"score_gpt":0.2650266180633008,"score_spread":0.24411908282160974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101897080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04698867,0.0004025546,0.9489409,0.0017846411,0.0005561366,0.0007705392,0.0000066839743,0.00049039023,0.000059526505],"genre_scores_gemma":[0.9647155,0.000095572745,0.034723956,0.00015072137,0.00003326251,0.00016052494,0.0000040070213,0.00002471696,0.000091760536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983728,0.00005774836,0.00044369313,0.0005074764,0.00018769366,0.0004305754],"domain_scores_gemma":[0.99851865,0.00034290703,0.000113933354,0.00071342126,0.00021840118,0.00009271624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005737253,0.00023991024,0.00026606218,0.0005685113,0.0005791985,0.00009571604,0.00059915474,0.00025840913,0.000003154759],"category_scores_gemma":[0.00002473386,0.00024481924,0.00010398964,0.0005907479,0.00013627078,0.00028550564,0.000010961055,0.00038773456,0.000008500349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013243369,0.00044187397,0.00015048645,0.00006899388,0.00021974886,0.000016896693,0.0015930227,0.037395608,0.12116078,0.02703607,0.00004626598,0.81173784],"study_design_scores_gemma":[0.0023765217,0.00033301508,0.00009397163,0.00012634874,0.000034628178,0.00009384677,0.00024001901,0.8807604,0.10403734,0.0001916138,0.011229021,0.00048330257],"about_ca_topic_score_codex":0.000019638615,"about_ca_topic_score_gemma":0.00027570076,"teacher_disagreement_score":0.9177268,"about_ca_system_score_codex":0.0001004204,"about_ca_system_score_gemma":0.000039060193,"threshold_uncertainty_score":0.9983438},"labels":[],"label_agreement":null},{"id":"W2101897605","doi":"10.1109/isit.2011.6034246","title":"Analysis of overlapped chunked codes with small chunks over line networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Network packet; Computer science; Line (geometry); Constant (computer programming); Convergence (economics); Transmission (telecommunications); Algorithm; Theoretical computer science; Mathematics; Computer network; Telecommunications","score_opus":0.0653393016684395,"score_gpt":0.2600588669695073,"score_spread":0.19471956530106782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101897605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049378894,0.00014470637,0.92879176,0.00006365351,0.00003322535,0.00009074043,7.480922e-7,0.00010062876,0.021395663],"genre_scores_gemma":[0.9339076,0.0001920669,0.06503131,0.00029439392,0.0000141877445,0.000007143203,0.0000066609555,0.0000056714407,0.0005409151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990837,0.000086723725,0.0002662584,0.00024981413,0.00013095673,0.00018253952],"domain_scores_gemma":[0.99854356,0.00008782823,0.00013308741,0.0009935946,0.00016922524,0.00007270979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026604175,0.00012441905,0.00028736787,0.00019219534,0.00009414344,0.000039858085,0.00090701977,0.000046980716,0.0003536691],"category_scores_gemma":[0.00001127111,0.00009168935,0.00009526226,0.0018415366,0.000062097664,0.00016928714,0.00032701954,0.000116852025,0.000003516934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023635932,0.0010620995,0.11598863,0.000020625865,0.0047480944,0.000012787388,0.010678367,0.016370675,0.0021989082,0.5663243,0.0008492372,0.2815099],"study_design_scores_gemma":[0.00031309403,0.000099061355,0.09100748,0.000015129131,0.00013286932,6.7485223e-7,0.00002248385,0.90706563,0.0006558747,0.000045972065,0.00046805525,0.00017370422],"about_ca_topic_score_codex":0.000035202804,"about_ca_topic_score_gemma":0.0012916586,"teacher_disagreement_score":0.8906949,"about_ca_system_score_codex":0.000014323819,"about_ca_system_score_gemma":0.00003262793,"threshold_uncertainty_score":0.38724288},"labels":[],"label_agreement":null},{"id":"W2101935851","doi":"10.1109/milcom.2010.5680135","title":"Efficient broadcasting in tactical networks: Forwarding vs. network coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Computer science; Computer network; Linear network coding; Packet forwarding; Network packet; Broadcasting (networking); Broadcast communication network; Routing protocol; Distributed computing","score_opus":0.02332743471944599,"score_gpt":0.2761002871284841,"score_spread":0.25277285240903813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101935851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03988657,0.00014367151,0.9398277,0.0012515936,0.0010235375,0.00018420964,7.803628e-8,0.0002604423,0.017422227],"genre_scores_gemma":[0.9442723,0.000056859273,0.05461691,0.00063297746,0.00029018486,0.000016031647,9.573502e-7,0.000011299579,0.00010251717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830943,0.00014060145,0.000375674,0.00039521366,0.00019977558,0.0005793197],"domain_scores_gemma":[0.9983606,0.00059909304,0.00008226297,0.00073129794,0.000086831176,0.00013995831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012646161,0.00016768284,0.00021861518,0.00010733854,0.00036134545,0.00029816496,0.0010133446,0.00009141837,0.00008263999],"category_scores_gemma":[0.0002274862,0.00015620611,0.00006759183,0.0010641565,0.0000510403,0.00019336147,0.0008532502,0.00075827236,0.000031987285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010736394,0.00008657973,0.009254994,0.0000050735252,0.000011413857,0.000016404587,0.0004600848,0.25973734,0.0010496334,0.6167914,0.0013900572,0.11118625],"study_design_scores_gemma":[0.00026257423,0.00001729616,0.0031694046,0.000044374883,0.000001920945,0.000016970158,0.000015888007,0.9922433,0.000075499345,0.00020575995,0.0037448735,0.00020217357],"about_ca_topic_score_codex":0.0000072612365,"about_ca_topic_score_gemma":0.00016481541,"teacher_disagreement_score":0.9043857,"about_ca_system_score_codex":0.00004708429,"about_ca_system_score_gemma":0.000045710654,"threshold_uncertainty_score":0.63699},"labels":[],"label_agreement":null},{"id":"W2102055072","doi":"10.1109/pimrc.2009.5450147","title":"Performance evaluation of distributed STBC in wireless relay networks with imperfect CSI","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Relay; Space–time block code; Computer network; MIMO; Channel state information; Bit error rate; Cooperative diversity; Linear network coding; Transmission (telecommunications); Wireless; Antenna diversity; Channel (broadcasting); Telecommunications; Fading","score_opus":0.029479749840932382,"score_gpt":0.2796354226800752,"score_spread":0.2501556728391428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102055072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7534969,0.00018844314,0.24255936,0.00041139466,0.000032371074,0.0002039772,2.4424173e-7,0.000050221646,0.0030570796],"genre_scores_gemma":[0.99732983,0.00032906423,0.002178738,0.000103612016,0.000011700193,0.000010649677,0.0000088581955,0.0000026869022,0.000024842766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989591,0.00020177977,0.00021425476,0.0001823949,0.00028233774,0.00016011798],"domain_scores_gemma":[0.9990231,0.000060825278,0.00007934998,0.00052558,0.00027664745,0.000034497345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010095483,0.000090942485,0.00013430712,0.00006797875,0.00007079174,0.000036441976,0.0005025578,0.000036038007,0.000019709852],"category_scores_gemma":[0.000018304012,0.0000699638,0.000019121013,0.0008363135,0.000025309013,0.0003520095,0.00007692914,0.00013814264,0.000002242083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033233235,0.00014598772,0.01933427,0.0000033659246,0.0000104718165,9.2269335e-7,0.00042976454,0.20210709,0.0006063197,0.014926755,0.00025515835,0.76214665],"study_design_scores_gemma":[0.0004963554,0.00014190347,0.13781258,0.000051833937,0.000003814173,0.000002111137,0.000008404349,0.8607205,0.0006166854,0.000017212655,0.000041006962,0.00008757051],"about_ca_topic_score_codex":0.0000036420865,"about_ca_topic_score_gemma":0.000064691114,"teacher_disagreement_score":0.7620591,"about_ca_system_score_codex":0.000073744166,"about_ca_system_score_gemma":0.00007833118,"threshold_uncertainty_score":0.28530407},"labels":[],"label_agreement":null},{"id":"W2102210243","doi":"10.1109/icc.2009.5198609","title":"A Game-Theoretic Analysis of Inter-Session Network Coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear network coding; Price of anarchy; Nash equilibrium; Computer science; Bottleneck; Network packet; Coding (social sciences); Computer network; Game theory; Packet forwarding; Mathematical optimization; Mathematical economics; Price of stability; Mathematics; Economics","score_opus":0.02733456253146172,"score_gpt":0.297381934210771,"score_spread":0.2700473716793093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102210243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007984456,0.00023249185,0.9732358,0.00079848774,0.00005995942,0.000051967523,1.359703e-7,0.00008946989,0.017547246],"genre_scores_gemma":[0.9840248,0.00033301546,0.014675956,0.00072613393,0.000018898694,0.0000014560826,0.0000025237703,0.0000018142093,0.00021538784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992047,0.00012858084,0.00023777646,0.00017497303,0.000105156934,0.00014884459],"domain_scores_gemma":[0.9989906,0.00012661885,0.00008874546,0.000651574,0.00009416439,0.000048276543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003561536,0.00007728882,0.00020380341,0.00017226393,0.00007341728,0.00005917035,0.000757225,0.000026290983,0.00012614566],"category_scores_gemma":[0.000025098227,0.00006237574,0.000107837186,0.0020473604,0.00002981475,0.00016018651,0.00020927814,0.000081572245,0.0000066348957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039530355,0.000043180487,0.0011558586,0.0000016314236,0.00007821597,8.527851e-7,0.00054823625,0.0026195073,0.0006561572,0.8252954,0.0006298428,0.16896716],"study_design_scores_gemma":[0.00013643004,0.00007365569,0.010880384,0.00006271114,0.000067011206,9.3114124e-7,0.000018022623,0.98171026,0.0006543816,0.005117523,0.0011463882,0.00013230348],"about_ca_topic_score_codex":0.0000012128528,"about_ca_topic_score_gemma":0.000010945447,"teacher_disagreement_score":0.97909075,"about_ca_system_score_codex":0.00001877831,"about_ca_system_score_gemma":0.000014832118,"threshold_uncertainty_score":0.25436088},"labels":[],"label_agreement":null},{"id":"W2102468089","doi":"10.1109/infcom.2010.5461917","title":"Multicast Scheduling with Cooperation and Network Coding in Cognitive Radio Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Multicast; Distributed computing; Xcast; Protocol Independent Multicast; Source-specific multicast; Cognitive radio; Scheduling (production processes); Wireless; Engineering","score_opus":0.025521656936119512,"score_gpt":0.2746920409566488,"score_spread":0.24917038402052927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102468089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124756664,0.0001887071,0.87160736,0.00050219154,0.000138222,0.00021573991,1.2118963e-7,0.00009417752,0.0024967883],"genre_scores_gemma":[0.9337569,0.00028829387,0.065348014,0.00040079866,0.000100557125,0.000019381625,0.0000032382432,0.0000075049215,0.00007532469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990898,0.00009084616,0.00018277894,0.00029466712,0.00008823812,0.00025371544],"domain_scores_gemma":[0.99913687,0.00031619752,0.000047591428,0.00027727126,0.0001359196,0.000086159016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046390505,0.0001264929,0.00014785051,0.000061958686,0.00026562947,0.0002732321,0.00028019794,0.0000606303,0.00003335857],"category_scores_gemma":[0.00006570188,0.0001044278,0.000012204829,0.0005409231,0.000082770544,0.00047400364,0.00021876975,0.00044108654,0.0000038161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007229908,0.0001430961,0.05291567,0.000008800454,0.000046221186,0.000028500719,0.002321716,0.043000646,0.0022290568,0.6613212,0.00023855723,0.23767422],"study_design_scores_gemma":[0.0006852031,0.00004125892,0.0099414755,0.00007857448,0.0000031969876,0.00002239264,0.000040975203,0.98865193,0.00011399297,0.00004338859,0.00020171495,0.00017592318],"about_ca_topic_score_codex":0.0000066899333,"about_ca_topic_score_gemma":0.0011036685,"teacher_disagreement_score":0.94565123,"about_ca_system_score_codex":0.0000125721745,"about_ca_system_score_gemma":0.000036908183,"threshold_uncertainty_score":0.42584422},"labels":[],"label_agreement":null},{"id":"W2102478206","doi":"10.1109/cnsr.2007.11","title":"An Adaptive FEC-based Packet Loss Recovery Scheme Using RZ Turbo Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Turbo code; Forward error correction; Network packet; Packet loss; Turbo equalizer; Error detection and correction; Turbo; Decoding methods; Transmission delay; Erasure; Erasure code; Real-time computing; Serial concatenated convolutional codes; Computer network; Algorithm; Concatenated error correction code; Block code; Engineering","score_opus":0.07206988081115726,"score_gpt":0.32385862041228863,"score_spread":0.25178873960113135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102478206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10041761,0.0001684302,0.8935539,0.00028749558,0.00014064486,0.00010989836,0.0000010862612,0.00020197715,0.0051189475],"genre_scores_gemma":[0.71214104,0.000029408357,0.2865959,0.0010695625,0.00005066171,0.0000017019233,0.0000034768486,0.0000070731385,0.000101181475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988331,0.00014754986,0.00022104807,0.00031395856,0.00018951893,0.00029477847],"domain_scores_gemma":[0.99849457,0.00022907164,0.00007666976,0.0008670022,0.00019797124,0.0001347347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081108976,0.00014111672,0.00014366198,0.00011441185,0.0002730773,0.00018272472,0.0008683878,0.000057593188,0.000096046024],"category_scores_gemma":[0.00003389391,0.00012876106,0.00005506113,0.0005267169,0.000068095156,0.0006324758,0.00019391206,0.00016429968,0.000029717736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003432278,0.0010181996,0.011836214,0.00002412371,0.00013302176,0.00011295173,0.001789957,0.0066922987,0.101995,0.3540675,0.00357629,0.5184112],"study_design_scores_gemma":[0.00033863218,0.00019498737,0.0023088276,0.000045867753,0.000003794469,0.000008235551,0.000074791904,0.9688556,0.024786523,0.00051020173,0.0025331916,0.000339321],"about_ca_topic_score_codex":0.000019796193,"about_ca_topic_score_gemma":0.00020044479,"teacher_disagreement_score":0.9621633,"about_ca_system_score_codex":0.000100106874,"about_ca_system_score_gemma":0.0001087184,"threshold_uncertainty_score":0.5250724},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.04857823550778225,"score_gpt":0.28659306463539236,"score_spread":0.2380148291276101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102659255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46140343,0.001361085,0.52784646,0.006479537,0.00025027376,0.000499056,0.0000043115747,0.0002323114,0.0019235673],"genre_scores_gemma":[0.96952486,0.010839392,0.019153973,0.00030610143,0.00004169469,0.000040927473,0.000025989406,0.00002052111,0.00004652247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973502,0.000893157,0.0007140351,0.0002685987,0.0003162053,0.00045778294],"domain_scores_gemma":[0.9961464,0.0008536375,0.00033456078,0.0020302648,0.00047641358,0.00015874665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069681276,0.0002377474,0.00035828288,0.0004444478,0.0009390143,0.000163482,0.0033012154,0.00011133978,0.00000864938],"category_scores_gemma":[0.00013247303,0.0002095327,0.00006109755,0.003699865,0.0001721085,0.00060720165,0.00031947513,0.001893905,0.000011313424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010452397,0.0073575783,0.23345484,0.00002707391,0.0004630447,0.00065957045,0.014508539,0.517966,0.004079217,0.110261925,0.009726391,0.10045063],"study_design_scores_gemma":[0.0035553146,0.00029560286,0.10144322,0.00085907825,0.000011033035,0.0011245792,0.00010763275,0.8863272,0.0002841904,0.00019346272,0.0051156054,0.0006830782],"about_ca_topic_score_codex":0.000019159403,"about_ca_topic_score_gemma":0.0009729561,"teacher_disagreement_score":0.50869244,"about_ca_system_score_codex":0.00037061964,"about_ca_system_score_gemma":0.00033292867,"threshold_uncertainty_score":0.85444957},"labels":[],"label_agreement":null},{"id":"W2102900974","doi":"10.1109/icc.2009.5199483","title":"Speeding Up Homomorpic Hashing Using GPUs","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Hong Kong Baptist University","keywords":"Computer science; CUDA; Speedup; Homomorphic encryption; Parallel computing; Hash function; Cryptography; Exploit; Coding (social sciences); Modular design; Instruction set; General-purpose computing on graphics processing units; Graphics; Graphics processing unit; Encryption; Operating system; Algorithm; Programming language","score_opus":0.09900649578484225,"score_gpt":0.32164785366993237,"score_spread":0.22264135788509012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102900974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033042483,0.00044066075,0.9390687,0.002505376,0.00034872396,0.000072925235,7.3799825e-8,0.00026606218,0.024255022],"genre_scores_gemma":[0.9293194,0.00010857617,0.06837205,0.0013395692,0.00007081791,5.4119033e-7,7.249825e-7,0.0000032720793,0.00078505336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926585,0.000049016187,0.00015485866,0.00019692809,0.00013346112,0.00019989988],"domain_scores_gemma":[0.99928194,0.00004725722,0.00004384201,0.0004878591,0.00007220708,0.000066889486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024406603,0.00008943413,0.000100660334,0.00007954499,0.00029573502,0.00032056432,0.00080214825,0.0000266362,0.00005280807],"category_scores_gemma":[0.00003160257,0.00008256315,0.00003822441,0.00043994715,0.0000146925,0.00058567786,0.00021008527,0.0001273208,0.000034726345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019945796,0.000044781253,0.00032906703,0.0000019482243,0.000009005946,0.000008971352,0.0014309397,0.00053825695,0.049759064,0.5004624,0.002140323,0.44527322],"study_design_scores_gemma":[0.00036449765,0.000056105648,0.0020751874,0.00005662676,0.0000042728448,0.000048014233,0.000056720106,0.9701743,0.0068765916,0.0034399484,0.016515706,0.00033204423],"about_ca_topic_score_codex":0.0000034205036,"about_ca_topic_score_gemma":0.000005077529,"teacher_disagreement_score":0.969636,"about_ca_system_score_codex":0.000048573238,"about_ca_system_score_gemma":0.000030836512,"threshold_uncertainty_score":0.33668277},"labels":[],"label_agreement":null},{"id":"W2102966196","doi":"10.1109/glocom.2010.5684221","title":"Second-Order Properties for Wireless Cooperative Systems with Rayleigh Fading","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Fading; Rayleigh fading; Computer science; Relay; Wireless; Channel (broadcasting); Channel state information; Computer network; Electronic engineering; Telecommunications; Engineering; Physics","score_opus":0.03771822741728107,"score_gpt":0.2539290255652723,"score_spread":0.21621079814799124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102966196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08989296,0.00024990967,0.89144003,0.0010186585,0.0005277832,0.000880818,0.0000018309029,0.00029343387,0.01569457],"genre_scores_gemma":[0.97488195,0.00002494308,0.018131465,0.00036185962,0.00007689699,0.00022646772,0.0000024948852,0.000013054241,0.006280847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909884,0.000063588785,0.00018483169,0.00029610711,0.00012416,0.00023250449],"domain_scores_gemma":[0.99855095,0.00011948389,0.00006107024,0.00060440146,0.00058969227,0.000074417345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027024397,0.00014975024,0.00017976943,0.000058877755,0.00041812664,0.00043911964,0.00078300596,0.00004925693,0.00006556633],"category_scores_gemma":[0.000029070954,0.00009662141,0.000025489982,0.0003303999,0.00007444671,0.00053405354,0.00018099457,0.00020662045,0.000018047238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030860683,0.00008585813,0.0002483018,0.000050502375,0.00006976645,0.0000018006622,0.0031448638,0.00065659895,0.07359239,0.9024,0.003083842,0.016635213],"study_design_scores_gemma":[0.0011404679,0.0002478929,0.00014173554,0.000100245365,0.000007515122,0.000037979527,0.00035987198,0.87587607,0.033782087,0.00006116641,0.08768587,0.000559091],"about_ca_topic_score_codex":0.000005444332,"about_ca_topic_score_gemma":0.00040182174,"teacher_disagreement_score":0.90233886,"about_ca_system_score_codex":0.000017022061,"about_ca_system_score_gemma":0.00011812095,"threshold_uncertainty_score":0.4234441},"labels":[],"label_agreement":null},{"id":"W2102979949","doi":"10.1109/cwit.2011.5872129","title":"On noisy network coding for a Gaussian relay chain network with correlated noises","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Gaussian; Relay; Computer science; Quantization (signal processing); Algorithm; Coding (social sciences); Multicast; Gaussian noise; Relay channel; Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Statistics","score_opus":0.04843190508756347,"score_gpt":0.25046321391076115,"score_spread":0.2020313088231977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102979949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011318937,0.0003002558,0.9442609,0.0006955829,0.0004419846,0.00054172176,6.063835e-7,0.00040355034,0.05222351],"genre_scores_gemma":[0.8448729,0.00023912147,0.14951788,0.0024130472,0.00021295367,0.000117245414,0.000007669103,0.000029575873,0.002589636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845475,0.00014010811,0.00028216373,0.00042849316,0.00016248942,0.0005319794],"domain_scores_gemma":[0.9982598,0.00041234563,0.00013835775,0.0009102174,0.00013657092,0.00014270244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000538496,0.00022564118,0.00023789777,0.000060406488,0.0006021602,0.00011839134,0.0009889281,0.00008198011,0.00011532201],"category_scores_gemma":[0.000040302017,0.00016939554,0.00007003416,0.00077979936,0.00006011478,0.00025105168,0.00025297623,0.0002402726,0.000051436687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012285878,0.00007392536,0.00070533267,0.0000049719897,0.000049797163,0.000006322528,0.0009173792,0.009593532,0.000012852173,0.9452688,0.024208758,0.019035447],"study_design_scores_gemma":[0.002168829,0.0015305546,0.0042057508,0.00059350947,0.000035925885,0.00003004213,0.00005858163,0.9441589,0.00025954237,0.00793299,0.03800971,0.0010156693],"about_ca_topic_score_codex":0.000007810959,"about_ca_topic_score_gemma":0.00013004358,"teacher_disagreement_score":0.93733585,"about_ca_system_score_codex":0.000045048604,"about_ca_system_score_gemma":0.000059923314,"threshold_uncertainty_score":0.6907749},"labels":[],"label_agreement":null},{"id":"W2103276122","doi":"10.1109/ccece.2010.5575250","title":"A multi-stage multi-user decode-and-forward cooperative communications scheme using linear combination","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Transmission (telecommunications); Scheme (mathematics); Wireless; Antenna diversity; Diversity combining; Multi-user; Algorithm; Cooperative diversity; Computer network; Real-time computing; Computer engineering; Wireless network; Telecommunications; Channel (broadcasting); Mathematics","score_opus":0.1308395341226644,"score_gpt":0.3747867377217215,"score_spread":0.24394720359905708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103276122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04688651,0.00021808007,0.9489112,0.0023043887,0.00020913145,0.00040289236,0.000004032449,0.0002675226,0.0007962659],"genre_scores_gemma":[0.3558406,0.00031037335,0.64083016,0.00060164556,0.000013551235,0.000024163784,0.0000089590185,0.000011911255,0.0023586492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987017,0.00022081983,0.00033292442,0.00035138766,0.00015396034,0.00023923365],"domain_scores_gemma":[0.9974914,0.00022160694,0.00011838693,0.0015174759,0.00050678017,0.00014431264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005406115,0.00019171601,0.00019648831,0.00013601896,0.00082211226,0.00026224542,0.0015966955,0.00010253065,0.00007116884],"category_scores_gemma":[0.00020432984,0.0001776343,0.000051512685,0.0005094551,0.00021676319,0.00080514577,0.001579833,0.00055648474,0.00004932574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064747883,0.0008056477,0.0054197717,0.000012523107,0.000066555425,0.0000021611716,0.0031853144,0.00017351127,0.24439822,0.73306865,0.0003125438,0.012548648],"study_design_scores_gemma":[0.0009306696,0.00002308972,0.0020487304,0.000015198975,0.000004870209,0.0000063372268,0.0000793242,0.9709453,0.0021118957,0.000022724313,0.023575664,0.000236182],"about_ca_topic_score_codex":0.000038689515,"about_ca_topic_score_gemma":0.0013202515,"teacher_disagreement_score":0.9707718,"about_ca_system_score_codex":0.00003856782,"about_ca_system_score_gemma":0.000100961384,"threshold_uncertainty_score":0.7243717},"labels":[],"label_agreement":null},{"id":"W2103276485","doi":"10.1109/twc.2011.080311.102004","title":"Channel Training Design in Amplify-and-Forward MIMO Relay Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Computer science; Relay channel; Transmitter; Channel (broadcasting); Upper and lower bounds; Channel state information; Topology (electrical circuits); Computer network; Electronic engineering; Wireless; Telecommunications; Mathematics; Engineering; Electrical engineering","score_opus":0.1396355228324188,"score_gpt":0.2910466967313278,"score_spread":0.151411173898909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103276485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080592424,0.0007249585,0.99489844,0.0010993553,0.00018927666,0.0003674136,0.0000029042692,0.0002519205,0.0016598128],"genre_scores_gemma":[0.9411841,0.008680881,0.049285892,0.00040693762,0.000010221612,0.00028823837,0.0000031917766,0.000023809436,0.0001167439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793684,0.0007212626,0.00045876188,0.00037288084,0.00014718166,0.00036306592],"domain_scores_gemma":[0.9963705,0.00068427634,0.00011584331,0.002580928,0.00009812201,0.00015031002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007246305,0.00023153737,0.00027126426,0.000332055,0.0007821228,0.00010161773,0.0023524424,0.00014485525,0.000025239062],"category_scores_gemma":[0.0000096145895,0.000247953,0.0000774106,0.00096671935,0.00021784582,0.0005072618,0.000051557217,0.0008748116,0.000025520567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071412105,0.0013130878,0.000059467828,0.000013774792,0.00014288681,0.000007876436,0.045031555,0.09254216,0.00033171082,0.081664905,0.00017712403,0.778644],"study_design_scores_gemma":[0.00060804415,0.00010976841,0.00064169517,0.00013271366,0.000017121212,0.000019299605,0.00039082736,0.9956164,0.00049651857,0.00072631164,0.0008428961,0.00039841322],"about_ca_topic_score_codex":0.000050256094,"about_ca_topic_score_gemma":0.0004923291,"teacher_disagreement_score":0.94561255,"about_ca_system_score_codex":0.00008211683,"about_ca_system_score_gemma":0.00008202227,"threshold_uncertainty_score":0.99999726},"labels":[],"label_agreement":null},{"id":"W2103408667","doi":"10.1109/twc.2008.05421","title":"Broadcasting energy efficiency limits in wireless networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Broadcasting (networking); Computer science; Relay; Computer network; Wireless; Wireless network; Wireless sensor network; Efficient energy use; Node (physics); Telecommunications; Electrical engineering; Engineering","score_opus":0.056085593814748,"score_gpt":0.2758197408117673,"score_spread":0.2197341469970193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103408667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013333475,0.00070081075,0.98007286,0.0015148334,0.0002940055,0.00019680696,0.0000031065981,0.00036984988,0.0035142573],"genre_scores_gemma":[0.97854805,0.014534206,0.0056896997,0.00052573835,0.000023995093,0.00020054994,0.00000706185,0.000028986207,0.00044169178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755514,0.0005961406,0.00061540253,0.00047018827,0.00028850872,0.0004746231],"domain_scores_gemma":[0.9950929,0.00082486717,0.00015911313,0.0035637782,0.0002025338,0.00015678002],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00033763077,0.00028577182,0.00031937988,0.00043581933,0.0016148473,0.00010424028,0.0037617139,0.0001428966,0.000025098634],"category_scores_gemma":[0.000009656007,0.00031575756,0.00014156812,0.0022142588,0.00030551746,0.00054237014,0.00005703024,0.00081881415,0.000033196266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027624386,0.0024016567,0.000346815,0.000010545812,0.00006570502,0.000023405777,0.0035247458,0.12456164,0.0026782933,0.09121733,0.00041296746,0.77472925],"study_design_scores_gemma":[0.0005770361,0.00006655217,0.00055969466,0.00012424184,0.000006922952,0.00005285776,0.000043292606,0.9941742,0.0022065318,0.000054571483,0.0017327431,0.00040137945],"about_ca_topic_score_codex":0.00008876775,"about_ca_topic_score_gemma":0.0009558253,"teacher_disagreement_score":0.9743832,"about_ca_system_score_codex":0.00017604444,"about_ca_system_score_gemma":0.0001589383,"threshold_uncertainty_score":0.9999294},"labels":[],"label_agreement":null},{"id":"W2103550819","doi":"10.1109/jsac.2009.090605","title":"Optimized multipath network coding in lossy wireless networks","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Unicast; Linear network coding; Retransmission; Network packet; Multicast; Distributed computing; Wireless network; Network congestion; Multiple description coding; Testbed; Wireless; Telecommunications","score_opus":0.04461161403530175,"score_gpt":0.3111233799775617,"score_spread":0.26651176594225995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103550819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04604916,0.005605715,0.9198113,0.018192206,0.00096833304,0.0009316011,0.0000020753494,0.00043471012,0.0080049215],"genre_scores_gemma":[0.93714815,0.015906025,0.04530169,0.0013962238,0.00015658366,0.000019863155,0.000008985473,0.000016420048,0.000046071877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963764,0.001488552,0.00090047665,0.00031866907,0.00029427084,0.0006216374],"domain_scores_gemma":[0.99571633,0.001069559,0.00036255852,0.0022567376,0.00040547267,0.00018934341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014603892,0.0002727968,0.00042633552,0.00045790832,0.0007594332,0.00039642508,0.004310108,0.00014879322,0.000013705217],"category_scores_gemma":[0.00018996456,0.00027334952,0.000097567725,0.0034163422,0.000079879326,0.00058409263,0.00031387658,0.0021705353,0.000012545705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014153385,0.0014895189,0.0048260526,0.0000032074386,0.000054154352,0.000063977095,0.002242947,0.65987307,0.00046273952,0.07727798,0.0044695544,0.24909525],"study_design_scores_gemma":[0.0016589484,0.00012794138,0.0199524,0.00051571405,0.0000056411927,0.000086943546,0.000027949074,0.97384393,0.000045189765,0.0011528454,0.0022208649,0.00036162214],"about_ca_topic_score_codex":0.0000068558484,"about_ca_topic_score_gemma":0.00023338852,"teacher_disagreement_score":0.891099,"about_ca_system_score_codex":0.00039726085,"about_ca_system_score_gemma":0.00020576244,"threshold_uncertainty_score":0.99997187},"labels":[],"label_agreement":null},{"id":"W2103629191","doi":"","title":"Load balanced multicast with multi-tree groups","year":2008,"lang":"en","type":"article","venue":"Asia-Pacific Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Multicast; Xcast; Source-specific multicast; Protocol Independent Multicast; Pragmatic General Multicast; Computer network; Computer science; IP multicast; Distance Vector Multicast Routing Protocol; Reliable multicast; Distributed computing; Inter-domain; Multicast address","score_opus":0.11926017826126799,"score_gpt":0.3067460342348189,"score_spread":0.18748585597355089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103629191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010200262,0.0013503334,0.6282004,0.038219433,0.00029801248,0.0014074605,0.000022136152,0.0014502244,0.31885174],"genre_scores_gemma":[0.8957403,0.0034560035,0.098876104,0.00028661574,0.000018068848,0.00016289466,0.000021903277,0.000019539386,0.0014186299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978596,0.0004064772,0.00040676922,0.0005197383,0.0004076858,0.00039974906],"domain_scores_gemma":[0.9923676,0.00037749522,0.00019179458,0.00616041,0.00069791835,0.0002047792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030997483,0.00030578245,0.000318006,0.00014605299,0.0012590814,0.00019278008,0.004613852,0.00008835265,0.00007051259],"category_scores_gemma":[0.000106010055,0.00027022042,0.000080582504,0.00087815174,0.00055963476,0.00049787905,0.001073463,0.00060273893,0.0003885563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051609026,0.0016802283,0.008136752,0.000010704386,0.00010718566,0.000026386439,0.011200444,0.000055655066,0.0019176567,0.80082124,0.0035964302,0.17239572],"study_design_scores_gemma":[0.005683044,0.00087655446,0.09800871,0.00057345716,0.000045893103,0.00036385487,0.0034804437,0.7470925,0.0015664618,0.0013905123,0.13849041,0.0024281587],"about_ca_topic_score_codex":0.000024981138,"about_ca_topic_score_gemma":0.0007385464,"teacher_disagreement_score":0.88554,"about_ca_system_score_codex":0.00014884965,"about_ca_system_score_gemma":0.0004444225,"threshold_uncertainty_score":0.999975},"labels":[],"label_agreement":null},{"id":"W2103738894","doi":"10.1109/twc.2012.083112.111528","title":"Joint Relay Selection and Power Allocation for Decode-and-Forward Cellular Relay Network with Channel Uncertainty","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Mathematical optimization; Relay channel; Telecommunications link; Optimization problem; Quality of service; Channel (broadcasting); Transmitter power output; Probabilistic logic; Channel state information; Resource allocation; Beamforming; Channel allocation schemes; Power (physics); Computer network; Wireless; Algorithm; Telecommunications; Mathematics; Artificial intelligence","score_opus":0.03798580246441939,"score_gpt":0.26419041406429983,"score_spread":0.22620461159988042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103738894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019677795,0.0012380633,0.97392994,0.0038361012,0.00020419454,0.00066786405,0.000007068538,0.00022601383,0.00021295006],"genre_scores_gemma":[0.9461935,0.0033721884,0.049318437,0.000346321,0.000037057074,0.00051188143,0.000014932094,0.000030311292,0.00017533476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983669,0.000333368,0.0003714062,0.00034130758,0.00017619661,0.00041081084],"domain_scores_gemma":[0.9973095,0.0004974051,0.00016890457,0.0015397081,0.00027914837,0.00020533483],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007282746,0.00024857666,0.00025310897,0.00016527409,0.0017123221,0.00014706844,0.0007215581,0.0001261044,0.000008379525],"category_scores_gemma":[0.000010612491,0.00023355195,0.00007428301,0.0006616895,0.00016659494,0.0007049045,0.00003794823,0.00046023718,0.000008715578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003169152,0.0025442617,0.0007276987,0.00012537753,0.00083145435,7.426568e-7,0.019827893,0.42025352,0.010717651,0.29003686,0.0019256778,0.25269195],"study_design_scores_gemma":[0.0011935564,0.00040909866,0.0010920549,0.00020370224,0.00011059333,0.000041653926,0.0002529998,0.98022634,0.0043510767,0.00034824898,0.01109041,0.0006802942],"about_ca_topic_score_codex":0.000022254575,"about_ca_topic_score_gemma":0.00040282813,"teacher_disagreement_score":0.92651576,"about_ca_system_score_codex":0.00012371072,"about_ca_system_score_gemma":0.00007149016,"threshold_uncertainty_score":0.9995873},"labels":[],"label_agreement":null},{"id":"W2103850767","doi":"10.1109/icassp.2008.4518218","title":"Cooperative MIMO-beamforming for multiuser relay networks","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Beamforming; Relay; MIMO; Computer science; Node (physics); Signal-to-noise ratio (imaging); Optimization problem; Convex optimization; Computer network; Telecommunications; Regular polygon; Algorithm; Engineering; Mathematics; Power (physics); Physics","score_opus":0.07030764289291581,"score_gpt":0.3001628423493337,"score_spread":0.2298551994564179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103850767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08431046,0.00026018624,0.90421116,0.0023333237,0.00062833994,0.000582606,0.000009574888,0.00011856891,0.007545787],"genre_scores_gemma":[0.96525264,0.00062843447,0.03248709,0.00051763776,0.00020872192,0.000030338733,0.0000020577947,0.000015748883,0.0008573219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985493,0.00001486118,0.0004136699,0.00038828136,0.00037949788,0.00025442336],"domain_scores_gemma":[0.99747795,0.00014200108,0.00036193762,0.00013679327,0.0018002278,0.000081108046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000367934,0.00022465827,0.00024361242,0.00011632776,0.0006824161,0.00026622822,0.0013180644,0.00009344159,0.000014065151],"category_scores_gemma":[0.00015387402,0.00017175809,0.000080978825,0.00023668713,0.00025178172,0.00068505446,0.00028108983,0.00033938923,0.0000015377537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005813841,0.0007531569,0.003193714,0.00035472453,0.00032762974,0.000008097056,0.012609093,0.026613167,0.3257655,0.29614538,0.0077985763,0.3258496],"study_design_scores_gemma":[0.00053512957,0.000113590366,0.00026918508,0.0003972146,0.000014424441,0.000037938466,0.00026485857,0.98435664,0.012080757,0.0012192832,0.000465914,0.0002450546],"about_ca_topic_score_codex":0.000003306262,"about_ca_topic_score_gemma":0.0000021084675,"teacher_disagreement_score":0.95774347,"about_ca_system_score_codex":0.000062046915,"about_ca_system_score_gemma":0.00012475818,"threshold_uncertainty_score":0.7004091},"labels":[],"label_agreement":null},{"id":"W2103967031","doi":"10.1109/glocom.2005.1578334","title":"Exploiting spatial diversity in rate adaptive WLANs with relay infrastructure","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Relay; Computer network; Throughput; Rayleigh fading; Computer science; Fading; Antenna diversity; Wireless; Diversity gain; Wireless network; Wi-Fi; Telecommunications; Channel (broadcasting)","score_opus":0.04221403381932609,"score_gpt":0.2683632542098175,"score_spread":0.2261492203904914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103967031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20036954,0.00072600925,0.7196562,0.013865502,0.000450404,0.000943642,0.0001023173,0.0007043134,0.06318202],"genre_scores_gemma":[0.92926663,0.0012434901,0.068245806,0.0008968846,0.00007201804,0.00005729008,0.00004194596,0.000012859359,0.00016304829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971408,0.0006847235,0.0005734551,0.0005847264,0.00033239005,0.00068386446],"domain_scores_gemma":[0.99657565,0.00021651703,0.0003185211,0.002271622,0.00038196874,0.00023569197],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000575623,0.00037845504,0.0003782625,0.00018621376,0.0016089331,0.00026060123,0.0039997045,0.00015544251,0.00016040148],"category_scores_gemma":[0.0000647838,0.00038235952,0.000095912445,0.0011584808,0.0002412674,0.0010940321,0.0028873112,0.00074450247,0.000109211825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001994426,0.0009152876,0.02858762,0.00001965144,0.00026909244,0.00004211486,0.0076066586,0.03626769,0.00028619045,0.32269126,0.021097131,0.58201784],"study_design_scores_gemma":[0.0045901984,0.00044755574,0.1437903,0.00047388207,0.00007451465,0.0001915417,0.0010014857,0.74015236,0.0006221611,0.0041126707,0.10237133,0.0021720193],"about_ca_topic_score_codex":0.00047342028,"about_ca_topic_score_gemma":0.021702018,"teacher_disagreement_score":0.7288971,"about_ca_system_score_codex":0.00055166276,"about_ca_system_score_gemma":0.0004625969,"threshold_uncertainty_score":0.99986285},"labels":[],"label_agreement":null},{"id":"W2104025686","doi":"10.1109/icdcs.2008.45","title":"Optimized Multipath Network Coding in Lossy Wireless Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Unicast; Linear network coding; Network packet; Retransmission; Multipath routing; Distributed computing; Multicast; Multiple description coding; Testbed; Network congestion; Routing protocol; Wireless network; Packet loss; Multipath propagation; Wireless; Wireless Routing Protocol; Telecommunications; Channel (broadcasting)","score_opus":0.044567705454140974,"score_gpt":0.26581450109689586,"score_spread":0.2212467956427549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104025686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013208365,0.00055768935,0.9776621,0.0005066231,0.00029299446,0.00019414847,9.96446e-8,0.00024916415,0.007328818],"genre_scores_gemma":[0.91038543,0.003498475,0.0845821,0.0008245667,0.00011700418,0.000016882159,0.0000026273574,0.000010297518,0.0005626343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985017,0.00022828214,0.00033739393,0.0003418824,0.00015757068,0.00043316404],"domain_scores_gemma":[0.9987317,0.00026342986,0.00007408893,0.00074808626,0.00008049012,0.000102250706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046191734,0.00016189914,0.0002493979,0.0000815555,0.00035082275,0.000083528605,0.0011103062,0.0000730125,0.000057624547],"category_scores_gemma":[0.00002440208,0.00015061123,0.00006169709,0.00095858425,0.000065785505,0.00038594735,0.000590373,0.00030119473,0.000029385694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045987206,0.00024035241,0.01835677,0.0000062087115,0.000033087876,0.00014908079,0.0025525969,0.57209724,0.00008769869,0.25851282,0.014597303,0.13332088],"study_design_scores_gemma":[0.0007655046,0.000016219612,0.0038834915,0.000039385435,9.016374e-7,0.000020915391,0.000010716502,0.9931761,0.00003481874,0.000062117215,0.0017822495,0.00020756395],"about_ca_topic_score_codex":0.000014170347,"about_ca_topic_score_gemma":0.00006377443,"teacher_disagreement_score":0.89717704,"about_ca_system_score_codex":0.000060922623,"about_ca_system_score_gemma":0.000050917,"threshold_uncertainty_score":0.6141748},"labels":[],"label_agreement":null},{"id":"W2104121938","doi":"","title":"A new detection algorithm for Manets based on product trellises using space time trellis codes","year":2006,"lang":"en","type":"article","venue":"International Conference on Applied Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Phase-shift keying; Algorithm; Additive white Gaussian noise; Trellis (graph); Rayleigh fading; Computer science; Trellis modulation; Fading; Channel (broadcasting); MIMO; Bit error rate; Telecommunications; Decoding methods; Mathematics","score_opus":0.05950911259038357,"score_gpt":0.2984786330400289,"score_spread":0.23896952044964534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104121938","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036507734,0.0000119229,0.9677489,0.0008374164,0.00016929953,0.00044664778,0.000010641884,0.00012287931,0.030287238],"genre_scores_gemma":[0.32850257,0.000022760201,0.669044,0.00021069658,0.00024368345,0.00006916325,0.00003369554,0.000023185286,0.0018502348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878734,0.000022955159,0.00029404243,0.00035483047,0.00035884994,0.00018199651],"domain_scores_gemma":[0.99879646,0.00025405997,0.00020048833,0.00048522372,0.00020830776,0.0000554798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020779262,0.00020460825,0.00019343178,0.00018003702,0.00015297755,0.0002821088,0.00073917577,0.0000506502,0.00010494087],"category_scores_gemma":[0.000031044245,0.00019255701,0.000065664375,0.0001897325,0.000031515716,0.00011051405,0.0000757607,0.0001268099,0.00008071407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029737112,0.00034920103,0.00000118779,0.000017148497,0.000027965356,0.0000014615132,0.00016892994,0.0075269304,0.02955994,0.6914529,0.0012645964,0.26959997],"study_design_scores_gemma":[0.00046457138,0.000062649655,0.000009778151,0.000079653735,0.000008638079,0.0000030382391,0.000009807748,0.9415462,0.037362467,0.017799119,0.002455044,0.00019906014],"about_ca_topic_score_codex":0.000011301145,"about_ca_topic_score_gemma":0.000017990598,"teacher_disagreement_score":0.93401927,"about_ca_system_score_codex":0.0001234919,"about_ca_system_score_gemma":0.00010534283,"threshold_uncertainty_score":0.7852247},"labels":[],"label_agreement":null},{"id":"W2104172471","doi":"10.1109/pacrim.2001.953689","title":"A new optimal transmit and receive diversity scheme","year":2002,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transmit diversity; Fading; Maximal-ratio combining; Computer science; Signal-to-noise ratio (imaging); Diversity combining; Transmission (telecommunications); Antenna diversity; Diversity scheme; Diversity gain; Scheme (mathematics); Constraint (computer-aided design); Antenna (radio); Algorithm; Telecommunications; Electronic engineering; Mathematics; Decoding methods; Engineering","score_opus":0.058278036798150135,"score_gpt":0.24372107851653274,"score_spread":0.1854430417183826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104172471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008681914,0.0011353161,0.95083576,0.0064507015,0.00004502511,0.00006585848,1.4855854e-7,0.00013483789,0.032650456],"genre_scores_gemma":[0.6966463,0.0018438449,0.29310513,0.00081313733,0.000023026498,9.731215e-7,2.2311576e-7,0.000002249175,0.0075651533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996137,0.000028083681,0.00005552144,0.00014044381,0.00007101904,0.00009122405],"domain_scores_gemma":[0.9996013,0.00003314282,0.000012085022,0.0002449948,0.000026246556,0.000082198836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059727852,0.00005104332,0.00005559993,0.000025827441,0.00023885716,0.00006687199,0.000425495,0.00001832505,0.0004882172],"category_scores_gemma":[0.000005986059,0.00004629535,0.000017715043,0.00016614894,0.00001722862,0.0002756227,0.0005470272,0.000068914,0.00004955785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020246143,0.000034157252,0.0016285139,0.000002179678,0.000017222414,0.0000037516686,0.006049001,0.000016592981,0.00032621477,0.13665567,0.0333967,0.82186794],"study_design_scores_gemma":[0.0012090317,0.00012737645,0.007681814,0.000024897925,0.0000069526254,0.000020351174,0.00007602572,0.8414579,0.00092744257,0.0007395616,0.14729497,0.00043368465],"about_ca_topic_score_codex":0.000008963301,"about_ca_topic_score_gemma":0.000016345575,"teacher_disagreement_score":0.8414413,"about_ca_system_score_codex":0.000009159958,"about_ca_system_score_gemma":0.000005328691,"threshold_uncertainty_score":0.5345636},"labels":[],"label_agreement":null},{"id":"W2104189200","doi":"10.1109/wcl.2013.101613.130636","title":"The Impact of Imperfect Channel Estimations on the Performance of Optimum Combining in Decode-and-Forward Relaying in the Presence of Co-Channel Interference","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Channel (broadcasting); Computer science; Relay; Overhead (engineering); Interference (communication); Node (physics); Channel state information; Diversity gain; Co-channel interference; Imperfect; Performance improvement; Computer network; Telecommunications; Electronic engineering; Fading; Wireless; Engineering; Power (physics); Physics","score_opus":0.0476921736671704,"score_gpt":0.308237082248134,"score_spread":0.26054490858096363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104189200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9775836,0.0003062651,0.011450386,0.009768876,0.00003683031,0.0005425225,0.0000027707122,0.000013522413,0.00029525076],"genre_scores_gemma":[0.99672556,0.0021034486,0.0007385453,0.00020402609,0.000003621201,0.00021153277,0.0000024811243,0.000007507371,0.0000032754012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792415,0.00090255844,0.00059539534,0.00016099354,0.00019655148,0.00022037012],"domain_scores_gemma":[0.9926185,0.0042832918,0.0003706708,0.0025465167,0.00015440125,0.000026617716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014663041,0.00015015538,0.00023500415,0.00017148718,0.00042911223,0.000086568914,0.004321971,0.00003855737,0.0000021343276],"category_scores_gemma":[0.00015583068,0.00008653038,0.00007794276,0.00081752986,0.00059978355,0.0003890285,0.0005425925,0.0005100636,0.0000027639671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013417011,0.0015337715,0.04491399,0.00017481802,0.00032667353,0.0000013907894,0.15818903,0.51479584,0.09478222,0.106023416,0.0033812497,0.07574346],"study_design_scores_gemma":[0.0002316292,0.00010938834,0.028215641,0.00038077246,0.0000035589026,0.000003351151,0.00063632615,0.9684822,0.0016708631,0.00016080518,0.000004270987,0.00010119435],"about_ca_topic_score_codex":0.0003148204,"about_ca_topic_score_gemma":0.00011713949,"teacher_disagreement_score":0.4536864,"about_ca_system_score_codex":0.000053505377,"about_ca_system_score_gemma":0.00006081195,"threshold_uncertainty_score":0.8031369},"labels":[],"label_agreement":null},{"id":"W2104242807","doi":"10.1109/twc.2012.031212.101702","title":"Resource Allocation via Linear Programming for Fractional Cooperation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Relay; Mathematical optimization; Resource allocation; Linear programming; Optimization problem; Demodulation; Low-density parity-check code; Decoding methods; Computer network; Telecommunications; Algorithm; Mathematics; Channel (broadcasting)","score_opus":0.06050846789202001,"score_gpt":0.31501340397088207,"score_spread":0.25450493607886204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104242807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062255637,0.00035261188,0.99087906,0.0061253197,0.00034067646,0.0007524144,0.000010515723,0.00039183797,0.00052500394],"genre_scores_gemma":[0.8806766,0.00053405605,0.116702795,0.0005902335,0.00009582981,0.00094549486,0.000067305074,0.000027577664,0.0003601053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983098,0.0003424717,0.00044208378,0.0002863099,0.00023883938,0.00038050528],"domain_scores_gemma":[0.99620813,0.0007184337,0.00016173787,0.0023503264,0.00038918338,0.00017221298],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000663698,0.00021498078,0.00018792164,0.00021958466,0.0017802867,0.00014345649,0.0016341774,0.000121886624,0.000024525838],"category_scores_gemma":[0.000019736057,0.00023218482,0.00013959243,0.0007650757,0.00012475302,0.0011154182,0.000027166916,0.00044748175,0.00008362982],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034101387,0.0016626585,0.000035342622,0.000019181964,0.00010439587,9.249684e-8,0.0021299024,0.009135455,0.0062647085,0.122108646,0.00077756477,0.85772794],"study_design_scores_gemma":[0.00074946426,0.00013531584,0.00013239938,0.00006519546,0.000044723234,0.00001808054,0.00010568262,0.7385303,0.012295227,0.0001378535,0.2472853,0.00050048664],"about_ca_topic_score_codex":0.000008500877,"about_ca_topic_score_gemma":0.00006820739,"teacher_disagreement_score":0.88005406,"about_ca_system_score_codex":0.00017119005,"about_ca_system_score_gemma":0.000089868525,"threshold_uncertainty_score":0.9995193},"labels":[],"label_agreement":null},{"id":"W2104265071","doi":"10.1109/tcomm.2011.012711.090433","title":"DPC Rates and Multiplexing Gains for MIMO Broadcast Systems with Multi-Dimensional Space-Time Modulation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multiplexing; MIMO; Transmitter; Computer science; Transmission (telecommunications); Modulation (music); Spatial multiplexing; Space–time code; Wireless; Coding (social sciences); Disjoint sets; Electronic engineering; Topology (electrical circuits); Telecommunications; Mathematics; Channel (broadcasting); Engineering; Physics","score_opus":0.1369186114890206,"score_gpt":0.31023006074971227,"score_spread":0.17331144926069167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104265071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024283903,0.00056793116,0.9946861,0.00080703216,0.000121862984,0.00073376455,0.0000300081,0.00023199312,0.0003928874],"genre_scores_gemma":[0.8013343,0.0004568222,0.1971979,0.000082766775,0.000009807083,0.00029281073,0.000015121587,0.00002052581,0.0005899433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987281,0.00025900188,0.00030617503,0.00033524542,0.00014395652,0.00022752724],"domain_scores_gemma":[0.9970175,0.00054287055,0.00013283813,0.0018905888,0.00029781333,0.00011839878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030407688,0.00020469275,0.00020345973,0.00020261765,0.0012486322,0.00014027578,0.0009942481,0.00007402312,0.000013759537],"category_scores_gemma":[0.000011620354,0.00019012447,0.00006478632,0.00041154807,0.00022318985,0.0005194831,0.000029783147,0.00025850418,0.000026319512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006044073,0.0075826677,0.0011883645,0.0002078088,0.0013502829,0.000006540135,0.03749188,0.2866918,0.056695156,0.21944955,0.0012596977,0.38747182],"study_design_scores_gemma":[0.0009045348,0.00013943994,0.00095507473,0.00010720035,0.000022402506,0.000016577485,0.000079316815,0.9943353,0.0013712286,0.00007954553,0.0017284149,0.00026096817],"about_ca_topic_score_codex":0.000048006634,"about_ca_topic_score_gemma":0.00015595561,"teacher_disagreement_score":0.7989059,"about_ca_system_score_codex":0.00006356264,"about_ca_system_score_gemma":0.000058936505,"threshold_uncertainty_score":0.9603596},"labels":[],"label_agreement":null},{"id":"W2104523494","doi":"10.1109/icassp.2004.1326844","title":"Quadratic forms on complex random matrices and channel capacity","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Ergodic theory; Channel capacity; MIMO; Channel (broadcasting); Transmitter; Quadratic equation; Subspace topology; Eigenvalues and eigenvectors; Ergodicity; Mathematics; Topology (electrical circuits); Wireless; Random matrix; Spatial correlation; Computer science; Control theory (sociology); Telecommunications; Pure mathematics; Mathematical analysis; Combinatorics; Physics; Statistics; Geometry","score_opus":0.07433031365913699,"score_gpt":0.2799627068760431,"score_spread":0.20563239321690607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104523494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10224988,0.00025770915,0.8662009,0.0067254575,0.00008983515,0.0002604126,6.5178483e-7,0.00022217561,0.023992946],"genre_scores_gemma":[0.98784995,0.00034194565,0.010575745,0.0010995332,0.00001660915,0.000009007271,9.749493e-7,0.0000028749957,0.00010333922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994412,0.000040309515,0.00012234236,0.00016318358,0.000104463295,0.00012848502],"domain_scores_gemma":[0.99942845,0.000091076625,0.000035181907,0.00034575816,0.000038657316,0.00006089054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018194625,0.000084098974,0.00011167204,0.00005620112,0.00023007648,0.00014102651,0.00038836355,0.000020610469,0.00002017477],"category_scores_gemma":[0.000019324538,0.00006059442,0.000023827017,0.00020922271,0.000037817397,0.0002607063,0.00016375064,0.00007873645,0.00003909373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013428116,0.000085111904,0.000048991704,0.000009701528,0.000012624738,0.000001680775,0.0018908646,0.0008500279,0.0005407271,0.9765063,0.00048522925,0.019555341],"study_design_scores_gemma":[0.017307172,0.0010121263,0.023394164,0.00028344488,0.000021072054,0.000099753,0.0004068335,0.7890281,0.006972834,0.14098197,0.018892093,0.0016004492],"about_ca_topic_score_codex":0.00001363655,"about_ca_topic_score_gemma":0.000116179,"teacher_disagreement_score":0.8856001,"about_ca_system_score_codex":0.000024482946,"about_ca_system_score_gemma":0.000014677191,"threshold_uncertainty_score":0.24709687},"labels":[],"label_agreement":null},{"id":"W2104541114","doi":"10.1088/1367-2630/11/8/085005","title":"Distributed authentication for randomly compromised networks","year":2009,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Physics; Computer network","score_opus":0.035716356845697704,"score_gpt":0.28985097817680633,"score_spread":0.25413462133110865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104541114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009491458,0.00038396323,0.994638,0.0036239626,0.0001809075,0.00011769577,6.072689e-7,0.000019086878,0.00008659805],"genre_scores_gemma":[0.9708765,0.0001784463,0.028000994,0.00039157248,0.00047471412,0.0000010873133,0.0000057913376,0.000003602252,0.00006729029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993559,0.000054456905,0.00027278595,0.000076372846,0.00012404569,0.000116403346],"domain_scores_gemma":[0.99892956,0.00013469758,0.00028089172,0.00025703292,0.00031214766,0.00008568751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025561661,0.00007271858,0.00016538288,0.000023562126,0.00010947592,0.00010115843,0.0006312269,0.000024021434,0.0000025724985],"category_scores_gemma":[0.00004126207,0.00006229697,0.00011353622,0.00023782933,0.000011922859,0.00031692407,0.00003219898,0.00012927102,0.0000013967252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011650669,0.00015608557,0.000022190668,0.0000025028414,0.000036968875,9.912957e-7,0.0004932105,0.008922614,0.0038050842,0.16663958,0.022256056,0.79754823],"study_design_scores_gemma":[0.0073561687,0.0004630161,0.0026162774,0.00009603853,0.000040909912,0.000016119266,0.0000105973,0.9121792,0.0031425862,0.049955767,0.02389834,0.00022500794],"about_ca_topic_score_codex":1.5069004e-7,"about_ca_topic_score_gemma":2.8878222e-7,"teacher_disagreement_score":0.9699274,"about_ca_system_score_codex":0.000030213749,"about_ca_system_score_gemma":0.00007855774,"threshold_uncertainty_score":0.25403965},"labels":[],"label_agreement":null},{"id":"W2104641776","doi":"10.1109/icassp.2011.5947074","title":"Power allocation for orthogonal AF relay systems with outage-based QOS constraints","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; Quality of service; Computer science; Mathematical optimization; Channel (broadcasting); Power (physics); Imperfect; Computer network; Mathematics","score_opus":0.0593362133662866,"score_gpt":0.25959548579799135,"score_spread":0.20025927243170477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104641776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020935205,0.00006049149,0.9765578,0.00047235534,0.00021488729,0.00037655773,0.0000017242213,0.00014322724,0.020079434],"genre_scores_gemma":[0.95126504,0.000005279249,0.04748871,0.00044481852,0.000018940054,0.00012953923,0.000005116291,0.0000070898363,0.0006354519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922884,0.00007832945,0.00017658676,0.00022666404,0.00012888025,0.00016072561],"domain_scores_gemma":[0.9989598,0.00009084579,0.000076341974,0.00053392147,0.00027023698,0.00006885531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032511842,0.000101067744,0.00010566692,0.000056574965,0.00014472887,0.00008849949,0.00052163587,0.0000368998,0.00014960162],"category_scores_gemma":[0.000022822147,0.00007619058,0.000032629352,0.00018230405,0.00007721994,0.00021684935,0.0000620271,0.00007142361,0.000031178974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038123017,0.00011546987,0.0009884586,0.000012797992,0.00003247713,0.0000025185198,0.00092005695,0.00041302087,0.0002932913,0.9852869,0.0016198934,0.010276989],"study_design_scores_gemma":[0.0032396317,0.0008803989,0.008011425,0.00022650363,0.000021330723,0.000039190552,0.00036281857,0.94630456,0.002860235,0.00031710073,0.03685537,0.0008814173],"about_ca_topic_score_codex":0.0000035076098,"about_ca_topic_score_gemma":0.000021678445,"teacher_disagreement_score":0.9849698,"about_ca_system_score_codex":0.00002532251,"about_ca_system_score_gemma":0.0001246593,"threshold_uncertainty_score":0.31069618},"labels":[],"label_agreement":null},{"id":"W2104678442","doi":"10.1049/iet-com.2011.0207","title":"Performance analysis of decode-and-forward relaying schemes with adaptive quadrature amplitude modulation (QAM)","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"King Saud University","keywords":"Spectral efficiency; Quadrature amplitude modulation; Rayleigh fading; QAM; Computer science; Transmission (telecommunications); Fading; Link adaptation; Channel state information; Bit error rate; Independent and identically distributed random variables; Channel (broadcasting); Wireless; Algorithm; Telecommunications; Electronic engineering; Mathematics; Statistics; Random variable","score_opus":0.05531626951570032,"score_gpt":0.29886420189556123,"score_spread":0.24354793237986092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104678442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41979524,0.0058574146,0.56537414,0.0024323177,0.00005385235,0.00033278822,0.0000084386165,0.00017727686,0.005968508],"genre_scores_gemma":[0.8726066,0.0020885472,0.12508705,0.00009652901,0.000008871374,0.000037335427,0.000027887341,0.000006885309,0.000040296345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989656,0.00021057206,0.0002832457,0.00016806152,0.00017670325,0.00019582328],"domain_scores_gemma":[0.99675226,0.00030081093,0.0002087811,0.0023794845,0.00027063512,0.0000880552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046247165,0.0001283586,0.00023594992,0.0002574165,0.0004644711,0.00006222894,0.0013108288,0.000056351673,0.000008687454],"category_scores_gemma":[0.000036694866,0.00011224393,0.00006438942,0.0017388749,0.00015039976,0.0008827783,0.0007620491,0.00024916467,0.000004472168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031274823,0.0003851689,0.2669133,0.00002033976,0.0012707746,1.2531339e-7,0.014134476,0.005915089,0.0018648239,0.6045527,0.00013982924,0.10477212],"study_design_scores_gemma":[0.00018240158,0.000044748766,0.2799214,0.000049954928,0.00017806813,0.0000025617685,0.00016585096,0.7153625,0.00021754653,0.000066607245,0.0036106734,0.0001976923],"about_ca_topic_score_codex":0.0000113727,"about_ca_topic_score_gemma":0.00010260515,"teacher_disagreement_score":0.7094474,"about_ca_system_score_codex":0.00004383313,"about_ca_system_score_gemma":0.000039001945,"threshold_uncertainty_score":0.45771745},"labels":[],"label_agreement":null},{"id":"W2104697309","doi":"10.1109/siecpc.2011.5876686","title":"An emerging concept for 4G&amp;#x002B; wireless cellular networks: Terminal relaying","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer network; Computer science; Terminal (telecommunication); Wireless; Cellular network; Scope (computer science); Wireless network; Limit (mathematics); Usability; Telecommunications; Power (physics)","score_opus":0.09532013014259189,"score_gpt":0.3098681029878418,"score_spread":0.2145479728452499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104697309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012660174,0.00044350326,0.98180485,0.00016873563,0.000386813,0.0002265225,4.9586714e-7,0.00027601514,0.004032904],"genre_scores_gemma":[0.87754154,0.00013399031,0.12077471,0.0005239392,0.00013310034,0.000040900923,0.0000094508505,0.00001538517,0.00082698587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871266,0.00013907971,0.0002870549,0.00038490238,0.000120592005,0.0003557372],"domain_scores_gemma":[0.9984884,0.000117451404,0.00009743032,0.0010101842,0.00014913683,0.00013738617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041175503,0.00016358831,0.00017306753,0.000070309565,0.00046530037,0.00014744907,0.0014146741,0.00006316512,0.0001447842],"category_scores_gemma":[0.000019026009,0.00015264275,0.00007696796,0.0002996036,0.00006027123,0.0006724636,0.00029189567,0.000157327,0.000017391512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027344508,0.00023693898,0.0010951543,0.000015848096,0.000045865767,0.000009745772,0.013617488,0.0009228053,0.0063406425,0.4418629,0.0041106935,0.53171456],"study_design_scores_gemma":[0.00051122997,0.00014582375,0.00034275092,0.00005640787,0.000011638287,0.000011980999,0.00023913785,0.97083265,0.0037631048,0.00080190756,0.022797666,0.00048573362],"about_ca_topic_score_codex":0.000012177458,"about_ca_topic_score_gemma":0.00006188629,"teacher_disagreement_score":0.9699098,"about_ca_system_score_codex":0.000028589744,"about_ca_system_score_gemma":0.000042320382,"threshold_uncertainty_score":0.6224591},"labels":[],"label_agreement":null},{"id":"W2104727594","doi":"10.1109/iccw.2010.5503967","title":"An Efficient Multiple Relay Selection Scheme for Cognitive Radio Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Cognitive radio; Computer science; Computational complexity theory; Interference (communication); Greedy algorithm; Selection (genetic algorithm); Scheme (mathematics); Constraint (computer-aided design); Selection algorithm; Mathematical optimization; Algorithm; Computer network; Telecommunications; Wireless; Mathematics; Artificial intelligence; Channel (broadcasting); Power (physics)","score_opus":0.031068504593815,"score_gpt":0.29473824401577897,"score_spread":0.263669739421964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104727594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15044275,0.000058728318,0.8474157,0.00015404137,0.0004894628,0.00039374214,0.0000011277573,0.00022568059,0.0008187895],"genre_scores_gemma":[0.94431067,0.0000094684365,0.055025123,0.000094330186,0.000095723335,0.00009197753,0.0000065002105,0.0000066063285,0.00035959558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992663,0.00007447757,0.00014460387,0.00025196318,0.000098896904,0.00016375603],"domain_scores_gemma":[0.9989279,0.00026728545,0.000050852577,0.00034272653,0.0003297119,0.00008153379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041032681,0.00008411864,0.00009037977,0.00006123956,0.00032051635,0.00019434516,0.00044526145,0.000050646264,0.000014055231],"category_scores_gemma":[0.00012449693,0.000073736315,0.000033256198,0.00026294522,0.000025083094,0.0002053089,0.00007393557,0.00016329082,0.000022822345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058043723,0.0006997152,0.0056326245,0.000028827697,0.00006529106,0.0000010697678,0.0027204265,0.012137807,0.22439437,0.67674255,0.0029042172,0.07461503],"study_design_scores_gemma":[0.00042701553,0.00007462439,0.0008492432,0.000010801215,0.0000021930612,0.0000070354513,0.000043281725,0.9888989,0.0045238934,0.000007974665,0.005040729,0.00011433029],"about_ca_topic_score_codex":0.000008691652,"about_ca_topic_score_gemma":0.000100919075,"teacher_disagreement_score":0.97676104,"about_ca_system_score_codex":0.000020689218,"about_ca_system_score_gemma":0.000042507727,"threshold_uncertainty_score":0.30068797},"labels":[],"label_agreement":null},{"id":"W2104730183","doi":"10.1109/vetecs.2009.5073564","title":"Fountain Codes with XOR of Encoded Packets for Broadcasting and Source Independent Backbone in Multi-Hop Networks Using Network Coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Linear network coding; Computer network; Fountain code; Network packet; Flooding (psychology); Broadcasting (networking); Asynchronous communication; Coding (social sciences); Source code; Wireless ad hoc network; Broadcast communication network; Wireless network; Wireless; Decoding methods; Algorithm; Telecommunications; Block code; Concatenated error correction code; Mathematics","score_opus":0.0646761389017575,"score_gpt":0.30451686594672084,"score_spread":0.23984072704496334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104730183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11135309,0.0006955848,0.8871319,0.00020104754,0.00004201602,0.00037555647,3.8776352e-7,0.00005823358,0.00014217765],"genre_scores_gemma":[0.80317616,0.00016549752,0.19628502,0.0002760931,0.00004037166,0.000008124268,0.0000020161149,0.000009214317,0.000037517377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985239,0.00015294323,0.00040462066,0.00035965344,0.0001564239,0.00040244273],"domain_scores_gemma":[0.9987548,0.00040916205,0.00019616236,0.0003986227,0.0001563625,0.00008488346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087908184,0.00018873227,0.00032665159,0.00010662601,0.0002480863,0.00013660592,0.0004509896,0.000074046526,0.0000039310503],"category_scores_gemma":[0.000056208293,0.00016441345,0.00003717317,0.0005894646,0.000059573937,0.00033396488,0.00024179253,0.00019489173,2.2133992e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018900835,0.00028279956,0.02898405,0.000044626435,0.00005917992,0.000009790572,0.003388046,0.6206614,0.005607279,0.047049884,0.00013734963,0.2935866],"study_design_scores_gemma":[0.0012383587,0.00013879045,0.004509034,0.00026579175,0.0000069771513,0.000015969055,0.00013228423,0.9929013,0.0003103743,0.00019291077,0.000070845475,0.00021735724],"about_ca_topic_score_codex":0.000015655502,"about_ca_topic_score_gemma":0.00042160755,"teacher_disagreement_score":0.69182307,"about_ca_system_score_codex":0.000059005866,"about_ca_system_score_gemma":0.000049704162,"threshold_uncertainty_score":0.6704586},"labels":[],"label_agreement":null},{"id":"W2104748112","doi":"10.1109/icc.2012.6364407","title":"Joint optimal relay selection and power allocation in multicast cooperative networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Unicast; Relay; Mathematical optimization; Integer programming; Optimization problem; Selection (genetic algorithm); Linear programming; Wireless network; Throughput; Computer network; Wireless; Power (physics); Mathematics; Algorithm","score_opus":0.033305093146859054,"score_gpt":0.27483734189363795,"score_spread":0.2415322487467789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104748112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11367512,0.00047558363,0.8825612,0.00091118715,0.00012881446,0.00016498382,6.477039e-8,0.00007871431,0.0020043396],"genre_scores_gemma":[0.96845603,0.00027749996,0.030667162,0.00033529135,0.00003333663,0.00001918415,0.0000016025732,0.000004874933,0.00020501675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991847,0.00016820517,0.00017952011,0.0001717865,0.00007672998,0.00021900861],"domain_scores_gemma":[0.9995037,0.00007084856,0.000036655045,0.0002100276,0.00009701781,0.00008177757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045606802,0.00009358431,0.000098869066,0.00007783849,0.00013530307,0.00009416597,0.00016144337,0.000049243066,0.00005061706],"category_scores_gemma":[0.000044464185,0.00008247226,0.000014313747,0.00041307404,0.000025704141,0.00073667616,0.00020749815,0.00018034368,0.000016559943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031567528,0.0006162379,0.025129706,0.000006775949,0.000045166358,0.0000018826784,0.013942565,0.13437684,0.008357638,0.723104,0.0023746046,0.09201302],"study_design_scores_gemma":[0.0002510249,0.000042188778,0.029280927,0.000013291385,0.00000129948,0.000010690506,0.00007015325,0.96850103,0.0007024649,0.000003847849,0.0009971601,0.00012592816],"about_ca_topic_score_codex":0.000007262118,"about_ca_topic_score_gemma":0.000069835,"teacher_disagreement_score":0.8547809,"about_ca_system_score_codex":0.00005667687,"about_ca_system_score_gemma":0.000017817223,"threshold_uncertainty_score":0.33631212},"labels":[],"label_agreement":null},{"id":"W2104759901","doi":"10.1109/tit.2007.915918","title":"On the Optimal Number of Active Receivers in Fading Broadcast Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fading; Rayleigh fading; Infinity; Computer science; Channel (broadcasting); Power (physics); Topology (electrical circuits); Mathematics; Combinatorics; Algorithm; Discrete mathematics; Telecommunications; Physics; Mathematical analysis","score_opus":0.027237080660768312,"score_gpt":0.2568009202336602,"score_spread":0.2295638395728919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104759901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05835139,0.000005013518,0.92778873,0.0003892401,0.0002747078,0.00018497783,0.0000047794365,0.00005087449,0.012950297],"genre_scores_gemma":[0.99834365,0.00021880743,0.00071419403,0.0005008442,0.0000062565723,0.00002829181,0.0000011897903,0.0000034335405,0.0001833634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991342,0.00020792695,0.00026540156,0.000084981686,0.00017932698,0.00012819242],"domain_scores_gemma":[0.99886096,0.00051616854,0.00011228204,0.00038191196,0.00009786482,0.000030802617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003857344,0.00009839099,0.00010200341,0.00018562652,0.0002934864,0.00003202848,0.00047403527,0.000043829325,0.00020544867],"category_scores_gemma":[0.000019636776,0.000078255754,0.000061175764,0.00053469447,0.0000897546,0.0011779262,0.0000050395597,0.00027245414,0.00019050906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023416162,0.00017936078,0.000006375888,0.000009315108,0.000049544462,0.000001385579,0.057726875,0.30254942,0.00013147954,0.32232803,0.00045854863,0.31632552],"study_design_scores_gemma":[0.005080985,0.0006852826,0.00140793,0.00070720736,0.000029803514,0.00018567209,0.009699985,0.77117944,0.18382446,0.014818146,0.010890858,0.0014902102],"about_ca_topic_score_codex":0.000003885513,"about_ca_topic_score_gemma":0.0000015831187,"teacher_disagreement_score":0.93999225,"about_ca_system_score_codex":0.00007763351,"about_ca_system_score_gemma":0.000045679284,"threshold_uncertainty_score":0.31911772},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05732286662263603,"score_gpt":0.32774770948769205,"score_spread":0.270424842865056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104780755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0719791,0.0001848363,0.8666991,0.005764285,0.00023340546,0.00027874287,8.85203e-7,0.00013130956,0.05472833],"genre_scores_gemma":[0.9561356,0.00005839813,0.041699003,0.00048816134,0.00006660487,0.0000042571605,0.0000023108128,0.0000053645026,0.0015403392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985836,0.00010424199,0.000389601,0.00025627465,0.0003378993,0.00032838242],"domain_scores_gemma":[0.99845046,0.0003374326,0.000085766485,0.0006446792,0.00038102697,0.00010061286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002769477,0.000108123284,0.00019341586,0.00010925469,0.00009766392,0.00005468767,0.00080725265,0.000049250484,0.000043700104],"category_scores_gemma":[0.00024067139,0.000102693964,0.000042032483,0.0009892439,0.000028438013,0.00019605774,0.0005824096,0.00018099128,0.000021345677],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005119715,0.0003038038,0.054038666,0.000030241617,0.000043253818,0.00002673402,0.018119084,0.006033962,0.0035045645,0.55400807,0.02736728,0.33647314],"study_design_scores_gemma":[0.0019370331,0.00035735406,0.597189,0.00073177717,0.0000143251045,0.000017532084,0.0020369359,0.29901385,0.012638178,0.003654498,0.08107293,0.0013366065],"about_ca_topic_score_codex":0.00013029578,"about_ca_topic_score_gemma":0.00254296,"teacher_disagreement_score":0.88415647,"about_ca_system_score_codex":0.00007581247,"about_ca_system_score_gemma":0.000044748016,"threshold_uncertainty_score":0.41877383},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04881039997255162,"score_gpt":0.3068714708438505,"score_spread":0.2580610708712989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104878965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15755466,0.00008800304,0.83910847,0.00091476255,0.0003822855,0.00025155678,0.000008331139,0.00014828252,0.0015436563],"genre_scores_gemma":[0.9828804,0.00095030566,0.015691618,0.00011135037,0.000033041833,0.00013018263,0.000025620884,0.000014329538,0.000163127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983376,0.00033292655,0.0005048853,0.0003194532,0.00024270239,0.00026242872],"domain_scores_gemma":[0.99581754,0.0006661513,0.00020202484,0.002999151,0.00023464226,0.00008047042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054521527,0.00018856015,0.0003363077,0.0005953644,0.0005834286,0.0000606312,0.0018023672,0.00012427443,0.00005352026],"category_scores_gemma":[0.000011904357,0.00019765938,0.00020263385,0.004273118,0.00016774787,0.00050242915,0.000037010148,0.0010344131,0.000014914515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011605214,0.00040296084,0.0009599856,0.0000021460053,0.0001696472,1.130217e-7,0.00052364805,0.9472959,0.0018869287,0.0066325874,0.0000527836,0.04206169],"study_design_scores_gemma":[0.00024540373,0.000036465364,0.03184788,0.00002200214,0.00009080433,0.0000013374035,0.000009743393,0.9660821,0.0006074522,0.00009335743,0.000780294,0.00018314528],"about_ca_topic_score_codex":0.00004010799,"about_ca_topic_score_gemma":0.0029042563,"teacher_disagreement_score":0.8253258,"about_ca_system_score_codex":0.000065238615,"about_ca_system_score_gemma":0.00006928065,"threshold_uncertainty_score":0.8060315},"labels":[],"label_agreement":null},{"id":"W2105001560","doi":"10.1109/infcom.2009.5062101","title":"Passive Loss Inference in Wireless Sensor Networks Based on Network Coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Wireless sensor network; Inference; Computer network; Linear network coding; Lossy compression; Packet loss; Key distribution in wireless sensor networks; Network packet; Wireless network; Path loss; Distributed computing; Wireless; Artificial intelligence; Telecommunications","score_opus":0.028098541754849927,"score_gpt":0.2816830531748419,"score_spread":0.25358451141999194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105001560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038239204,0.00006207742,0.97896445,0.0053622373,0.00018822997,0.00018793486,1.9004524e-7,0.00020021998,0.011210755],"genre_scores_gemma":[0.98347175,0.0002693548,0.009587425,0.0064115147,0.000105010724,0.000010624368,0.0000032269372,0.0000058098312,0.000135257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849415,0.00024521496,0.00028418444,0.00036652788,0.0001897291,0.00042021117],"domain_scores_gemma":[0.99822825,0.00069016754,0.000084385334,0.00080080447,0.00009639988,0.000099971665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033802347,0.00018086995,0.00021218322,0.00010233684,0.00020127266,0.00018552004,0.0009390779,0.00007763196,0.00004081654],"category_scores_gemma":[0.00006212702,0.00016330768,0.000049911483,0.0010118608,0.000033844295,0.000236177,0.00015197173,0.00035802106,0.000024559724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017704442,0.000108063585,0.0028616916,0.0000016828027,0.0000035536555,0.000031018055,0.00012466905,0.4559032,0.000046250912,0.35842678,0.0011728293,0.18130256],"study_design_scores_gemma":[0.00037634812,0.0000914666,0.013969124,0.00012151569,0.0000010307335,0.0000010771581,0.0000049267346,0.98402876,0.0000895836,0.000476547,0.0006210052,0.00021861249],"about_ca_topic_score_codex":0.0000037502857,"about_ca_topic_score_gemma":0.000062383515,"teacher_disagreement_score":0.9796479,"about_ca_system_score_codex":0.0000794618,"about_ca_system_score_gemma":0.000071742055,"threshold_uncertainty_score":0.66594934},"labels":[],"label_agreement":null},{"id":"W2105259861","doi":"10.1109/twc.2014.2365806","title":"Bidirectional Buffer-Aided Relay Networks With Fixed Rate Transmission—Part II: Delay-Constrained Case","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Relay; Transmission (telecommunications); Upper and lower bounds; Network packet; Throughput; Computer network; Transmission delay; Queue; Markov chain; Fading; Queuing delay; Heuristic; Wireless; Telecommunications; Mathematics; Channel (broadcasting); Power (physics)","score_opus":0.032740617099409106,"score_gpt":0.2636321868505649,"score_spread":0.23089156975115577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105259861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010999688,0.00026942883,0.97942185,0.00631781,0.00032548202,0.00044982065,0.000013042574,0.00065809366,0.0015447953],"genre_scores_gemma":[0.9351188,0.0022417188,0.060622077,0.00066311395,0.000046351626,0.00032929506,0.000022915983,0.00004311119,0.0009125944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967692,0.0012825483,0.00062314037,0.00058479636,0.00028522784,0.00045506944],"domain_scores_gemma":[0.99261755,0.0016151173,0.00020502297,0.0048681977,0.00038935032,0.00030476786],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007676035,0.00039597324,0.00038218024,0.0003010448,0.0036260425,0.00022364012,0.0028518992,0.0001788798,0.00011701819],"category_scores_gemma":[0.000022675977,0.00036435813,0.00018901021,0.0014036078,0.00043242492,0.0005915185,0.00006272044,0.0010577971,0.000038360897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014663266,0.0019097218,0.00003518078,0.000021167083,0.00038560244,0.00006205807,0.0021782795,0.20178548,0.002164215,0.0343805,0.0017607509,0.7551704],"study_design_scores_gemma":[0.0015128135,0.00036480135,0.00006527072,0.00021618641,0.0000762493,0.0011022516,0.00007026405,0.9580765,0.0021596644,0.00015558918,0.035514794,0.0006856328],"about_ca_topic_score_codex":0.000041542797,"about_ca_topic_score_gemma":0.0006925496,"teacher_disagreement_score":0.9241191,"about_ca_system_score_codex":0.00012337718,"about_ca_system_score_gemma":0.00017646987,"threshold_uncertainty_score":0.99988085},"labels":[],"label_agreement":null},{"id":"W2105336920","doi":"10.1109/infcom.2011.5935112","title":"Network modulation: A new dimension to enhance wireless network performance","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Wireless network; Wireless ad hoc network; Wireless WAN; Unicast; Wireless; Key distribution in wireless sensor networks; Multicast; Telecommunications","score_opus":0.05122207016593251,"score_gpt":0.27018425837398513,"score_spread":0.21896218820805263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105336920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035841092,0.00027804906,0.9385861,0.0012284318,0.00053157983,0.00023814298,4.7639574e-8,0.00029945592,0.02299711],"genre_scores_gemma":[0.82430094,0.0001980805,0.1694924,0.0026207336,0.00031441485,0.000014709246,0.0000011184461,0.000009183572,0.003048405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998712,0.00008629461,0.00026142702,0.00036553736,0.00018055453,0.00039418403],"domain_scores_gemma":[0.9985558,0.000050985476,0.00006738852,0.0010016259,0.00011734888,0.000206858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003202292,0.0001557893,0.00016141485,0.000037896596,0.0003535255,0.00008063187,0.001022796,0.00004730982,0.00018602333],"category_scores_gemma":[0.000008634202,0.00014153818,0.000036728972,0.0009829598,0.000017966462,0.00048731398,0.0007139655,0.00013777372,0.00031137397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002841107,0.000043881886,0.0030592647,0.000004091346,0.0000148109775,0.000002061635,0.0020489676,0.028482908,0.00027292533,0.13183554,0.07729126,0.75691587],"study_design_scores_gemma":[0.00021429796,0.00022532718,0.04001696,0.00016164054,0.0000048718407,0.000008097384,0.000008049104,0.92111295,0.001939423,0.0028435455,0.0328913,0.0005735532],"about_ca_topic_score_codex":0.000012464967,"about_ca_topic_score_gemma":0.00006141869,"teacher_disagreement_score":0.89263004,"about_ca_system_score_codex":0.000034340213,"about_ca_system_score_gemma":0.000060946102,"threshold_uncertainty_score":0.577176},"labels":[],"label_agreement":null},{"id":"W2105358401","doi":"10.1109/vetecf.2009.5378814","title":"Cooperative Power Allocation Schemes and BER Performance in Decode-and-Forward OFCDM Based Relay Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Power (physics); Node (physics); Topology (electrical circuits); Channel (broadcasting); Computer network; Hop (telecommunications); Relay channel; Electrical engineering; Engineering; Physics","score_opus":0.014878115491390623,"score_gpt":0.25242464042944357,"score_spread":0.23754652493805295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105358401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2608195,0.0013370126,0.7242662,0.0062488094,0.00006706458,0.00027251843,1.846492e-7,0.00011675645,0.006872003],"genre_scores_gemma":[0.97926307,0.0012189036,0.016710648,0.0025162837,0.00001066464,0.000010662506,0.0000028083832,0.00000397955,0.00026299493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913555,0.00009638042,0.00020754771,0.0002767195,0.00009938247,0.00018443952],"domain_scores_gemma":[0.9993223,0.00009753621,0.000043018856,0.0003586323,0.00010801672,0.00007050395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036391488,0.00012624801,0.00013814295,0.00008975604,0.00017021173,0.00013824542,0.00029106546,0.000057472873,0.000029096875],"category_scores_gemma":[0.00003120904,0.00010847441,0.000015123434,0.0003999154,0.00004672326,0.00055348437,0.0001300088,0.00018271072,0.0000052608198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007441912,0.0002958738,0.050123956,0.000013165538,0.000029903804,0.0000058506103,0.0032780615,0.030915303,0.0009328531,0.35141748,0.0019833185,0.5609298],"study_design_scores_gemma":[0.00044550534,0.00011012659,0.06546784,0.0000412841,0.0000016300515,0.0000029736354,0.000016223432,0.93032527,0.0004534177,0.00004061751,0.0029324456,0.00016269383],"about_ca_topic_score_codex":0.0000017721592,"about_ca_topic_score_gemma":0.000045824894,"teacher_disagreement_score":0.89940995,"about_ca_system_score_codex":0.00003038727,"about_ca_system_score_gemma":0.00003905694,"threshold_uncertainty_score":0.4423458},"labels":[],"label_agreement":null},{"id":"W2105439331","doi":"10.1109/tvt.2009.2016345","title":"Cooperative OFDM Channel Estimation in the Presence of Frequency Offsets","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pairwise error probability; Orthogonal frequency-division multiplexing; Relay; Algorithm; Channel (broadcasting); Multiplexing; Frequency offset; Bit error rate; Mathematics; Computer science; Electronic engineering; Statistics; Topology (electrical circuits); Power (physics); Telecommunications; Engineering; Fading; Physics; Combinatorics","score_opus":0.0214490633791099,"score_gpt":0.272170988293637,"score_spread":0.2507219249145271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105439331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027158676,0.0002476372,0.9593212,0.012517778,0.000082868806,0.0002967283,0.0000015858911,0.00012253456,0.00025097118],"genre_scores_gemma":[0.99254215,0.00026072888,0.006758906,0.00035875404,0.000003265703,0.000054716234,9.381545e-7,0.0000032668563,0.000017254415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901044,0.00017548038,0.00025356587,0.00023033102,0.00016612154,0.00016404981],"domain_scores_gemma":[0.9988854,0.00010543394,0.0000732824,0.0007906539,0.00012732178,0.000017931961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027404327,0.00011469227,0.00015255806,0.00035292903,0.00017256694,0.000026211674,0.0010712936,0.00012010103,0.0000071302497],"category_scores_gemma":[0.000024817275,0.00008999486,0.00004529926,0.0015362285,0.00011128602,0.00023306796,0.0000043248942,0.00039293637,0.000011869958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020609326,0.0012549108,0.000027708495,0.000012599651,0.000043501434,0.000031181542,0.0041453424,0.11242813,0.033522695,0.32281592,0.00017347133,0.52552396],"study_design_scores_gemma":[0.00076565717,0.0007926807,0.00095290353,0.00015120236,0.000013660876,0.000065995555,0.00023472632,0.85873055,0.11922933,0.018485118,0.00027080646,0.00030737297],"about_ca_topic_score_codex":0.0000050939148,"about_ca_topic_score_gemma":0.0000546727,"teacher_disagreement_score":0.96538347,"about_ca_system_score_codex":0.000035493904,"about_ca_system_score_gemma":0.00004261074,"threshold_uncertainty_score":0.3669884},"labels":[],"label_agreement":null},{"id":"W2105531431","doi":"10.1109/wcnc.2011.5779227","title":"Combined cooperative communication and multicast for minimum power cost in coded wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multicast; Computer science; Computer network; Network packet; Channel state information; Wireless; Wireless sensor network; Channel (broadcasting); Scheme (mathematics); Distributed computing; Cooperative diversity; Network topology; Telecommunications; Fading; Mathematics","score_opus":0.05675324254367472,"score_gpt":0.2838303790394252,"score_spread":0.22707713649575048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105531431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062169727,0.0002890738,0.9268494,0.0014055711,0.00012585374,0.0013707458,0.00000308205,0.00015074879,0.0076357927],"genre_scores_gemma":[0.9561219,0.00049033965,0.042221908,0.0006725309,0.000006387477,0.00013997233,0.000010945892,0.000010887514,0.00032512346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988121,0.0002655729,0.00031049634,0.0002896358,0.00007553327,0.00024665426],"domain_scores_gemma":[0.99830383,0.00047203896,0.0000804132,0.0007921964,0.00026111823,0.000090388865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044487274,0.00015537726,0.00022092533,0.000082764745,0.00024155962,0.00011237835,0.00072575366,0.000074603115,0.000042011226],"category_scores_gemma":[0.000056687542,0.0001415159,0.000030374149,0.0003308985,0.00012992207,0.00034763888,0.00046176757,0.00017990559,0.000006068518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033459163,0.00088835624,0.007873244,0.000016947823,0.000076665034,0.0000057914262,0.022659339,0.00037701594,0.0016860825,0.9075687,0.0029805554,0.055532694],"study_design_scores_gemma":[0.0020002064,0.000154634,0.009369341,0.00004926161,0.0000041023263,0.0000032719024,0.00038741267,0.98601484,0.00074058305,0.00018477537,0.00082721893,0.0002643492],"about_ca_topic_score_codex":0.000017969256,"about_ca_topic_score_gemma":0.00032490696,"teacher_disagreement_score":0.98563784,"about_ca_system_score_codex":0.000036148504,"about_ca_system_score_gemma":0.000029001154,"threshold_uncertainty_score":0.57708514},"labels":[],"label_agreement":null},{"id":"W2105553752","doi":"10.1109/jcn.2008.6389854","title":"A family of concatenated network codes for improved performance with generations","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Linear network coding; Erasure; Decoding methods; Concatenated error correction code; Network packet; Erasure code; Coding (social sciences); Code rate; Algorithm; Theoretical computer science; Block code; Computer network; Mathematics; Statistics","score_opus":0.04821867966487738,"score_gpt":0.26781795201358133,"score_spread":0.21959927234870394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105553752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052672673,0.014754309,0.9299637,0.0017766237,0.00009220515,0.0002545083,0.000002037235,0.000022344948,0.00046160922],"genre_scores_gemma":[0.8139329,0.051977765,0.13373928,0.00021931056,0.00006209756,0.000015149177,0.0000052135065,0.0000071085024,0.00004121051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990142,0.00013724144,0.0005101847,0.00009128521,0.00008886466,0.00015821081],"domain_scores_gemma":[0.9973352,0.00041018473,0.0005143535,0.00086504227,0.0007996763,0.00007552172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005346324,0.00010715955,0.00027866138,0.00007803231,0.0006253585,0.000044438064,0.0011503822,0.000050511848,0.000001307893],"category_scores_gemma":[0.00001864008,0.00008222021,0.0000612209,0.00044804942,0.00023446903,0.00036374788,0.00025394862,0.00024282736,1.3208775e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007350549,0.0013258161,0.022512829,0.00008708621,0.0013411022,0.0000058960304,0.0057073147,0.12919028,0.010463815,0.23996359,0.025567831,0.5630994],"study_design_scores_gemma":[0.00093456317,0.0005630541,0.0077396953,0.00011350287,0.000030069661,0.00011489739,0.000027175936,0.975354,0.00010041736,0.00013875913,0.014746481,0.0001373664],"about_ca_topic_score_codex":0.000002060078,"about_ca_topic_score_gemma":0.000019809542,"teacher_disagreement_score":0.84616375,"about_ca_system_score_codex":0.000019740559,"about_ca_system_score_gemma":0.00013012846,"threshold_uncertainty_score":0.4809815},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025358600648116323,"score_gpt":0.26102487319447026,"score_spread":0.23566627254635394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105628599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018253304,0.00014544945,0.9288529,0.0018060481,0.00010196355,0.00015589008,3.1577986e-8,0.00014024753,0.050544158],"genre_scores_gemma":[0.9301664,0.000037495593,0.064867005,0.00046490243,0.0000196003,0.000020696847,0.0000011236859,0.00000919008,0.004413575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879444,0.00019613077,0.00018544184,0.00029549125,0.00026472312,0.0002638046],"domain_scores_gemma":[0.99909973,0.00007376519,0.000037916972,0.00042968808,0.0002833299,0.00007555786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071925356,0.00012439404,0.00011685346,0.00012547863,0.00018141913,0.00029635054,0.00042009557,0.000054629847,0.000063847416],"category_scores_gemma":[0.00005180271,0.00010317016,0.000020842355,0.0012332102,0.00001612613,0.0005349971,0.0000953493,0.00028651525,0.000031207263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011642739,0.00007164361,0.006649382,0.0000029215505,0.000014533702,0.000010089164,0.0016491888,0.23181319,0.001242609,0.74580413,0.003706173,0.009024494],"study_design_scores_gemma":[0.0010275769,0.00032122695,0.006218281,0.000103117854,0.000007227264,0.00003889399,0.00086815987,0.866344,0.0038628525,0.0014329039,0.11895862,0.000817179],"about_ca_topic_score_codex":0.000018668125,"about_ca_topic_score_gemma":0.00052339537,"teacher_disagreement_score":0.9119131,"about_ca_system_score_codex":0.000068356596,"about_ca_system_score_gemma":0.000085929925,"threshold_uncertainty_score":0.4207157},"labels":[],"label_agreement":null},{"id":"W2105729195","doi":"10.1109/siu.2010.5653836","title":"Design of distributed space-time trellis code for relay systems over cascaded Nakagami channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise error probability; Trellis (graph); Nakagami distribution; Relay; Space–time trellis code; Computer science; Code (set theory); Algorithm; Convolutional code; Space–time code; Block code; Decoding methods; Theoretical computer science; Electronic engineering; Concatenated error correction code; Fading; Power (physics); Engineering","score_opus":0.044638459987746716,"score_gpt":0.27847218474520063,"score_spread":0.23383372475745393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105729195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036708878,0.0001820016,0.99343187,0.0010029962,0.0004829906,0.0005572359,0.000023520386,0.00014075084,0.00050774147],"genre_scores_gemma":[0.9487832,0.00010799288,0.045113195,0.00010166389,0.00009364462,0.00009161976,0.00002565095,0.000016454702,0.0056665367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894047,0.00013803916,0.00028870755,0.00025636383,0.00015270447,0.00022372081],"domain_scores_gemma":[0.9982365,0.00047033,0.00013720563,0.0008243895,0.0002426802,0.00008893479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058149337,0.00013374991,0.00023707288,0.00007044229,0.00014620171,0.00012179284,0.0009217174,0.000094460236,0.00005290428],"category_scores_gemma":[0.000109839006,0.00011168531,0.000066134606,0.00036200395,0.000049540962,0.00023560424,0.0002026685,0.00015586875,0.000025055386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082884064,0.00034136235,0.00011658645,0.0000721733,0.00015886141,0.000004361101,0.0020903186,0.034636516,0.36789542,0.46247175,0.12342591,0.008703827],"study_design_scores_gemma":[0.00045938723,0.00007265028,0.00006955762,0.000024913044,0.000006788679,0.000005399123,0.000009036626,0.9562203,0.014377354,0.000119202814,0.028473653,0.00016173572],"about_ca_topic_score_codex":0.000010131792,"about_ca_topic_score_gemma":0.000014447944,"teacher_disagreement_score":0.94831866,"about_ca_system_score_codex":0.000023500996,"about_ca_system_score_gemma":0.000057482815,"threshold_uncertainty_score":0.45543948},"labels":[],"label_agreement":null},{"id":"W2105749229","doi":"10.1109/tcomm.2011.080111.090524","title":"Closed-Form Error Analysis of Variable-Gain Multihop Systems in Nakagami-m Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Nakagami distribution; Fading; Hypergeometric function; Mathematics; Bessel function; Random variable; Elementary function; Applied mathematics; Topology (electrical circuits); Algorithm; Computer science; Statistics; Mathematical analysis; Decoding methods; Combinatorics","score_opus":0.11688496621535671,"score_gpt":0.30946869793608434,"score_spread":0.19258373172072762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105749229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038456842,0.00050604617,0.9889749,0.00030485203,0.00032096202,0.00037971028,0.000025369784,0.0001525039,0.005489949],"genre_scores_gemma":[0.9706112,0.0012130124,0.02759319,0.00009100019,0.000005877352,0.00020132854,0.000010891071,0.000014270992,0.0002591982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798584,0.000518595,0.0006979942,0.00031109113,0.00021363013,0.00027286986],"domain_scores_gemma":[0.99515283,0.0005448816,0.00022347222,0.0037285455,0.00025349532,0.00009679624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007404243,0.00019510834,0.00041155328,0.0012065182,0.00043721817,0.00006687038,0.003025121,0.00010616264,0.000058715083],"category_scores_gemma":[0.000017709719,0.00020648669,0.0001825335,0.0044259527,0.0001387089,0.0004755767,0.00004829275,0.00046050988,0.000021030322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006895677,0.0047722487,0.00084787793,0.00007491692,0.002503281,0.00000445235,0.05631613,0.53705025,0.0055936207,0.29365137,0.00013788558,0.098979],"study_design_scores_gemma":[0.0003859515,0.000057002457,0.0013143629,0.00010381803,0.00015160111,0.0000017982602,0.0003345906,0.9954292,0.0010223022,0.00024010756,0.0007121907,0.00024708148],"about_ca_topic_score_codex":0.00052430277,"about_ca_topic_score_gemma":0.0010395386,"teacher_disagreement_score":0.9667655,"about_ca_system_score_codex":0.00014256951,"about_ca_system_score_gemma":0.00008987,"threshold_uncertainty_score":0.84202826},"labels":[],"label_agreement":null},{"id":"W2106028885","doi":"10.1109/siu.2008.4632593","title":"Performance analysis and optimization of relay-assisted vehicle-to-vehicle (V2V) cooperative communication","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Cooperative diversity; Computer science; Channel (broadcasting); Antenna diversity; Scheme (mathematics); Diversity gain; Wireless; Power (physics); Rayleigh fading; Vehicle-to-vehicle; Computer network; Time diversity; Telecommunications; Fading; Mathematics","score_opus":0.035521075669847586,"score_gpt":0.2626321465994829,"score_spread":0.22711107092963534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106028885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42634028,0.00023030883,0.56951463,0.0010108034,0.000016024773,0.00015373861,8.338121e-7,0.00008187383,0.0026515124],"genre_scores_gemma":[0.8767611,0.0021914935,0.12035349,0.00028147644,0.0000045513775,0.000014602527,0.000009900921,0.0000047850835,0.00037860163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989375,0.00021832838,0.00031191038,0.00023458272,0.0001686651,0.00012903503],"domain_scores_gemma":[0.9983472,0.00013911484,0.00011058136,0.00090424553,0.00041493043,0.00008389145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002785354,0.00010838109,0.00021815064,0.0002445864,0.00043749806,0.00004701929,0.00065584504,0.000042826356,0.000043853466],"category_scores_gemma":[0.00004698707,0.00009975649,0.000043328106,0.002306996,0.00009983593,0.0004996061,0.00045671692,0.000110201196,0.000008366249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053067837,0.00035093998,0.08029213,0.000018885014,0.00042261236,0.0000019193023,0.010812823,0.80329186,0.007123689,0.016864805,0.00084539934,0.079921864],"study_design_scores_gemma":[0.00023730092,0.00006766801,0.1059338,0.000014516379,0.000022078077,0.0000032910189,0.00003090453,0.89123803,0.0021732422,0.000002490164,0.0001596665,0.000117030206],"about_ca_topic_score_codex":0.000021085294,"about_ca_topic_score_gemma":0.00006120373,"teacher_disagreement_score":0.45042083,"about_ca_system_score_codex":0.00003314136,"about_ca_system_score_gemma":0.000040768136,"threshold_uncertainty_score":0.40679517},"labels":[],"label_agreement":null},{"id":"W2106030111","doi":"10.1109/lcomm.2010.04.091992","title":"Diversity-multiplexing tradeoff in MIMO relay channels for a broad class of fading distributions","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Relay; MIMO; Multiplexing; Computer science; Transmitter; Relay channel; Spatial multiplexing; Topology (electrical circuits); Telecommunications; Electronic engineering; Channel (broadcasting); Mathematics; Physics; Engineering","score_opus":0.06711446176027135,"score_gpt":0.3006092035798336,"score_spread":0.23349474181956226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106030111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27588058,0.00023471177,0.683215,0.038800664,0.00059988385,0.0006397634,0.000034416164,0.00014195265,0.00045301887],"genre_scores_gemma":[0.94385237,0.00019286697,0.055197764,0.000564602,0.000030747393,0.000098098004,0.00003182714,0.000009007612,0.000022711332],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987533,0.00020521469,0.00039037113,0.00024565135,0.00013497677,0.00027049982],"domain_scores_gemma":[0.99630153,0.0008294923,0.00017674865,0.0024812885,0.00014082606,0.000070085734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006068244,0.00013781994,0.00020824859,0.0002408755,0.0012519339,0.00006594041,0.0037696364,0.00007487964,0.0000047678723],"category_scores_gemma":[0.0001657763,0.00015631475,0.000117969634,0.0007664022,0.000236298,0.00044589865,0.0018044513,0.0005245791,0.000004345712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025672696,0.00077581673,0.010601699,0.000052810607,0.00011072935,0.0000023406633,0.025147172,0.004933267,0.5688879,0.34938663,0.00660069,0.03347529],"study_design_scores_gemma":[0.0032785642,0.00009885154,0.015454311,0.00032078184,0.00004237478,0.000019944448,0.00036314916,0.852045,0.02117962,0.0017680698,0.10433456,0.0010947706],"about_ca_topic_score_codex":0.000044253626,"about_ca_topic_score_gemma":0.0005201168,"teacher_disagreement_score":0.84711176,"about_ca_system_score_codex":0.00007560024,"about_ca_system_score_gemma":0.00004174238,"threshold_uncertainty_score":0.96289897},"labels":[],"label_agreement":null},{"id":"W2106305134","doi":"10.1109/isit.2008.4595022","title":"A semicontinuity theorem and its application to network source coding","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Gaussian; Rate distortion; Rate–distortion theory; Distortion (music); Distributed source coding; Coding (social sciences); Computer science; Source code; Mathematics; Applied mathematics; Algorithm; Mathematical optimization; Theoretical computer science; Topology (electrical circuits); Channel code; Decoding methods; Telecommunications; Combinatorics; Physics; Statistics; Bandwidth (computing)","score_opus":0.02718495152232766,"score_gpt":0.25826179988528236,"score_spread":0.2310768483629547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106305134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03545102,0.00040037525,0.95519596,0.0014739778,0.0000381757,0.00021225995,1.5050742e-7,0.00020066621,0.007027394],"genre_scores_gemma":[0.98657745,0.0004354719,0.010094881,0.001592356,0.00006935748,0.000025377696,8.4093836e-7,0.0000047070207,0.0011995292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993119,0.000071150156,0.0001256944,0.00023258079,0.00008913322,0.00016953443],"domain_scores_gemma":[0.9992909,0.00010179411,0.00003461427,0.00039860213,0.00007705479,0.00009706823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027834403,0.00007916457,0.00009453001,0.00003176064,0.00035793235,0.000050997198,0.0004924354,0.000025841518,0.000012115578],"category_scores_gemma":[0.00002980134,0.00007193942,0.000017802215,0.00038657567,0.00001889998,0.00017376096,0.00051713845,0.00008259894,0.00005236659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054657894,0.000026283846,0.0021688004,0.000003421627,0.000009399757,0.0000011723401,0.0030815531,0.0012593515,0.007888364,0.751392,0.00587137,0.2282928],"study_design_scores_gemma":[0.00034757704,0.00005348194,0.010118718,0.000038083926,0.000003483034,0.00006653599,0.000034275323,0.83865166,0.0023617395,0.0016976673,0.14621085,0.00041591548],"about_ca_topic_score_codex":0.0000021610797,"about_ca_topic_score_gemma":0.000018858129,"teacher_disagreement_score":0.95112646,"about_ca_system_score_codex":0.00001805434,"about_ca_system_score_gemma":0.000015309453,"threshold_uncertainty_score":0.29336044},"labels":[],"label_agreement":null},{"id":"W2106340565","doi":"10.1109/mwc.2012.6189414","title":"Cooperative relaying in Wi-Fi networks with network coding","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Linear network coding; Relay; Network packet; Packet forwarding; Network scheduler; Distributed computing; Scheduling (production processes); Relay channel; Transmission delay; Processing delay; Mathematical optimization","score_opus":0.052657127115899545,"score_gpt":0.2930959710507317,"score_spread":0.24043884393483217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106340565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024789084,0.0074133594,0.95028955,0.0029035727,0.00048771745,0.0006429233,0.0000020669129,0.00041831163,0.013053396],"genre_scores_gemma":[0.95953315,0.00500065,0.03422932,0.0007106705,0.0001424972,0.00020147924,0.00001905494,0.000029214158,0.00013393429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742746,0.0008365333,0.00048602466,0.00030936103,0.00021829341,0.00072229735],"domain_scores_gemma":[0.9951917,0.00080958405,0.00020159915,0.0033857657,0.00021638323,0.00019498366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010419536,0.00026770713,0.00033300332,0.00014283828,0.0010307938,0.00021975159,0.0032954977,0.000110405585,0.0000140871225],"category_scores_gemma":[0.000033162803,0.00024957967,0.000056786197,0.0019138049,0.00023371383,0.0012573793,0.0010428705,0.00084952434,0.000040517552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028395614,0.00063043303,0.05291505,0.000012724192,0.00010726685,0.0000049608243,0.008152493,0.081773296,0.0004891724,0.79387695,0.002854185,0.059155077],"study_design_scores_gemma":[0.00095956697,0.00007324581,0.015796315,0.0004887388,0.000019531599,0.00004012728,0.00032275828,0.96300423,0.00017956144,0.00014784592,0.018179452,0.0007886445],"about_ca_topic_score_codex":0.00001845931,"about_ca_topic_score_gemma":0.00052764575,"teacher_disagreement_score":0.9347441,"about_ca_system_score_codex":0.00017515267,"about_ca_system_score_gemma":0.00010105801,"threshold_uncertainty_score":0.99999565},"labels":[],"label_agreement":null},{"id":"W2106725071","doi":"10.1109/cnsr.2011.44","title":"The Effect of Transmission Capacities on Interference-Free Scheduling in Wireless Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scheduling (production processes); Maximum throughput scheduling; Computer network; Wireless network; Multicast; Linear network coding; Interference alignment; Distributed computing; Wireless; Throughput; Radio resource management; Round-robin scheduling; Fair-share scheduling; Telecommunications; MIMO; Engineering; Channel (broadcasting); Quality of service","score_opus":0.03834145650935384,"score_gpt":0.253011403179984,"score_spread":0.21466994667063016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106725071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23623657,0.00043285431,0.73748577,0.0004126938,0.00017263836,0.00018369447,9.738065e-8,0.00006384717,0.025011826],"genre_scores_gemma":[0.99709314,0.0006166855,0.0021216394,0.00004472544,0.000009402454,0.0000128980655,2.011887e-7,0.0000033971542,0.00009788119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917346,0.00027719446,0.00019038453,0.00012928223,0.00008742342,0.00014223611],"domain_scores_gemma":[0.99877566,0.00046642558,0.000045300447,0.0006505814,0.00003197369,0.000030054096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055065105,0.000086999105,0.00011918945,0.000050881576,0.00012484525,0.000033532448,0.0013181363,0.000034520715,0.000017826238],"category_scores_gemma":[0.000029372057,0.000049897295,0.00003777947,0.00023908028,0.000091600836,0.00011930464,0.00020743378,0.00019217894,0.000002353478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083975254,0.000028105436,0.0013572294,0.000008821643,0.000010006704,0.0000011564406,0.0035803253,0.000572648,0.0003972803,0.35565913,0.000099379606,0.63820195],"study_design_scores_gemma":[0.00061496085,0.00057109987,0.0020485397,0.00031132693,0.0000023266393,0.0000013942538,0.000120074044,0.96311665,0.032001704,0.0008247404,0.00024038074,0.00014681026],"about_ca_topic_score_codex":0.000017849796,"about_ca_topic_score_gemma":0.000091334325,"teacher_disagreement_score":0.962544,"about_ca_system_score_codex":0.000015444179,"about_ca_system_score_gemma":0.000011681723,"threshold_uncertainty_score":0.24494472},"labels":[],"label_agreement":null},{"id":"W2106760612","doi":"10.1109/icc.2008.516","title":"Network Coding Aware Dynamic Subcarrier Assignment in OFDMA Wireless Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Subcarrier; Computer science; Linear network coding; Computer network; Telecommunications link; Orthogonal frequency-division multiplexing; Spectral efficiency; Diversity gain; Heuristic; Wireless network; Wireless; Distributed computing; Channel (broadcasting); Fading; Network packet; Telecommunications","score_opus":0.03246042507695215,"score_gpt":0.2606391580047785,"score_spread":0.22817873292782634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106760612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02226488,0.00069911213,0.9719638,0.0015077222,0.00039400297,0.00021150937,3.2563585e-7,0.00021041572,0.0027482088],"genre_scores_gemma":[0.9921016,0.0033054797,0.0023218044,0.0011696292,0.000075932665,0.000049673778,0.000004497018,0.000012902669,0.0009584704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836713,0.00022222874,0.00034504884,0.0003786821,0.0002189166,0.00046798852],"domain_scores_gemma":[0.99882984,0.00016266112,0.000082882114,0.00073735684,0.000076611854,0.000110646695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038019955,0.00018219762,0.00023456653,0.0000834484,0.00039431968,0.00008658956,0.001082414,0.00008102106,0.00009089286],"category_scores_gemma":[0.000008962743,0.00017092327,0.000056204888,0.0009517257,0.00006271069,0.00034593645,0.0006207591,0.00031534146,0.000018867522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034868834,0.0003515405,0.11636988,0.000018099572,0.00007676709,0.0002066669,0.002838741,0.23474544,0.00046133672,0.34077147,0.025504895,0.2786203],"study_design_scores_gemma":[0.00032626183,0.000022061718,0.016561314,0.00006125354,0.0000016487292,0.000013795561,0.000020006815,0.9813772,0.00002930737,0.00016247811,0.001183319,0.00024136233],"about_ca_topic_score_codex":0.000014054766,"about_ca_topic_score_gemma":0.00025677454,"teacher_disagreement_score":0.9698367,"about_ca_system_score_codex":0.00015104853,"about_ca_system_score_gemma":0.00007129395,"threshold_uncertainty_score":0.6970049},"labels":[],"label_agreement":null},{"id":"W2106776110","doi":"10.1109/icccn.2007.4317942","title":"The Impact of Interference in a Distributed Base Station Scheme Managed by an Agent System","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Base station; Computer science; Computer network; Interference (communication); Relay; Scheme (mathematics); Wireless; Quality of service; Wireless network; Channel (broadcasting); Topology (electrical circuits); Network topology; Mobile telephony; Distributed computing; Mobile radio; Telecommunications; Engineering; Electrical engineering","score_opus":0.04153901803818777,"score_gpt":0.31976137484544276,"score_spread":0.278222356807255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106776110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1669449,0.000106247404,0.83200705,0.00014045573,0.000027055554,0.00011257156,0.000003398866,0.000043535118,0.0006147974],"genre_scores_gemma":[0.9967203,0.000051736155,0.0031395042,0.000016058697,0.0000034515056,0.0000045812903,0.000015129671,0.000002076754,0.000047132155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925584,0.00015676043,0.0002363044,0.00012303518,0.00008692723,0.00014113841],"domain_scores_gemma":[0.9991265,0.00015890403,0.000075323114,0.000496498,0.00009240768,0.0000503526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093264086,0.00006382245,0.00007533702,0.000045530927,0.00009308254,0.00007876819,0.00065873325,0.000016797849,0.000006679135],"category_scores_gemma":[0.000033741264,0.00004086611,0.00002650804,0.0004358103,0.000024755627,0.00022660199,0.0001593428,0.000083115134,0.0000032639769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020039428,0.00072451006,0.025368901,0.00005320577,0.0001009645,0.000019642092,0.006457532,0.0015560879,0.061558682,0.42641026,0.011949142,0.4656007],"study_design_scores_gemma":[0.00034658136,0.00013394507,0.033012595,0.000057694557,0.0000010321847,0.0000019384725,0.0005904271,0.9613442,0.004136254,0.000069128575,0.00019478133,0.00011141169],"about_ca_topic_score_codex":0.00011112418,"about_ca_topic_score_gemma":0.0004667719,"teacher_disagreement_score":0.95978814,"about_ca_system_score_codex":0.00014087767,"about_ca_system_score_gemma":0.000026699481,"threshold_uncertainty_score":0.16664717},"labels":[],"label_agreement":null},{"id":"W2106827777","doi":"10.1109/icc.2011.5962906","title":"Dynamic Resource Allocation in OFDMA Systems with Full-Duplex and Hybrid Relaying","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Subcarrier; Orthogonal frequency-division multiple access; Scheduling (production processes); Orthogonal frequency-division multiplexing; Optimization problem; Resource allocation; Duplex (building); Mathematical optimization; Frequency-division multiple access; Benchmark (surveying); Computer network; Algorithm; Mathematics","score_opus":0.03488637701021895,"score_gpt":0.23673961939977842,"score_spread":0.20185324238955948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106827777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.518922,0.0015065527,0.47024503,0.000813776,0.000053591677,0.0002627909,2.5508336e-7,0.00016195937,0.008034063],"genre_scores_gemma":[0.9882015,0.00031512466,0.010880766,0.00012113149,0.00000405279,0.000025257952,0.000001378015,0.000005236228,0.00044556035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993244,0.000102883074,0.00015060452,0.00020956302,0.00008846716,0.00012411881],"domain_scores_gemma":[0.9994017,0.00004689857,0.00005069111,0.00040811478,0.000050429666,0.000042192645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027158603,0.000077286066,0.00009074105,0.000086694905,0.00009384749,0.00007984233,0.00037317607,0.000017883815,0.0000092544815],"category_scores_gemma":[0.000010198461,0.00006163395,0.000007715708,0.00025557628,0.000029668763,0.00027356992,0.00018678176,0.00009765473,0.000006365096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014254043,0.00037220557,0.02963906,0.0001177956,0.000087018954,0.000059406255,0.023806375,0.011083504,0.007781503,0.533718,0.0012372403,0.39195538],"study_design_scores_gemma":[0.00025444603,0.00005531315,0.009972147,0.00009073487,0.0000019101064,0.00003043271,0.00018143891,0.98803663,0.00009937844,0.000021986001,0.0011287315,0.00012684385],"about_ca_topic_score_codex":0.000050106737,"about_ca_topic_score_gemma":0.00020792025,"teacher_disagreement_score":0.97695315,"about_ca_system_score_codex":0.000032634438,"about_ca_system_score_gemma":0.000019716463,"threshold_uncertainty_score":0.25133598},"labels":[],"label_agreement":null},{"id":"W2106971367","doi":"10.1109/vetecf.2007.353","title":"On the Power Allocation for Decode-and-Forward Cooperative Transmission Over Rayleigh-Fading Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Rayleigh fading; Computer science; Bit error rate; Transmission (telecommunications); Power (physics); Transmitter power output; Fading; Constraint (computer-aided design); Channel (broadcasting); Telecommunications; Computer network; Mathematics; Transmitter","score_opus":0.029690552315714526,"score_gpt":0.28217974852198163,"score_spread":0.2524891962062671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106971367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16391447,0.00031255957,0.82525176,0.009288644,0.00017997574,0.000494813,8.605366e-7,0.00020231445,0.00035462913],"genre_scores_gemma":[0.9929169,0.00030577727,0.005562986,0.0009869997,0.00001836773,0.00009396389,0.0000023413284,0.000011304636,0.000101403144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987313,0.00008362333,0.00026279173,0.00043041716,0.00016078324,0.00033108608],"domain_scores_gemma":[0.99834687,0.00046881096,0.00010002029,0.0006916508,0.00032694117,0.000065728615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008475964,0.00019701551,0.00019499283,0.0002329887,0.0005402987,0.00012374646,0.0010112395,0.00021052764,0.000024735955],"category_scores_gemma":[0.00014522474,0.00014156422,0.0000536858,0.0005894189,0.0001970573,0.00019860864,0.00013146357,0.0003497064,0.000013254325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019788524,0.000044516157,0.000042459094,0.0000040253894,0.00003113353,0.0000033688027,0.0008603095,0.0002196785,0.043475796,0.8925536,0.0003749076,0.062370382],"study_design_scores_gemma":[0.0016022332,0.0007600146,0.0006198054,0.00035250472,0.000028137514,0.000036651043,0.00027307388,0.45621178,0.45400268,0.053262703,0.03202688,0.0008235378],"about_ca_topic_score_codex":0.0000015802138,"about_ca_topic_score_gemma":0.000013115556,"teacher_disagreement_score":0.8392909,"about_ca_system_score_codex":0.000048056467,"about_ca_system_score_gemma":0.00006632313,"threshold_uncertainty_score":0.5772821},"labels":[],"label_agreement":null},{"id":"W2107068971","doi":"10.1186/1687-1499-2013-236","title":"Decoding techniques for alternate-relaying BICM cooperative systems","year":2013,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Detector; Decoding methods; Network packet; Exploit; Algorithm; Relay; Transmission (telecommunications); Bit error rate; Real-time computing; Computer network; Telecommunications","score_opus":0.06290618820964414,"score_gpt":0.3110375627117491,"score_spread":0.24813137450210496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107068971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020188384,0.02115632,0.94219065,0.0076085394,0.0010516566,0.0013690449,0.0000025648962,0.00037822325,0.006054644],"genre_scores_gemma":[0.9338254,0.03633217,0.028483314,0.00065413804,0.00031178017,0.00022994279,0.0000053407744,0.000027830207,0.00013012177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979942,0.0005332097,0.00060419476,0.00028747003,0.00019335812,0.00038758005],"domain_scores_gemma":[0.996461,0.0011159561,0.00039240005,0.0013361599,0.00050765584,0.00018688274],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010541023,0.00024518414,0.00031540144,0.00022003488,0.0022899574,0.0016098369,0.0022441035,0.00008141323,0.00000630069],"category_scores_gemma":[0.000035526275,0.00021292214,0.00009236544,0.00043011282,0.000113364615,0.0008482512,0.0007886156,0.0006640724,0.000011419863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075421235,0.000080294725,0.0006712223,0.000011201989,0.000073625524,0.0000019899085,0.0007899259,0.00025678,0.0015304495,0.13652283,0.0015372501,0.8585169],"study_design_scores_gemma":[0.0005089175,0.00024275265,0.00018709338,0.0008315031,0.000014903459,0.00018421418,0.00018479138,0.9054991,0.00028394785,0.0011473135,0.09046435,0.00045110137],"about_ca_topic_score_codex":0.000010353158,"about_ca_topic_score_gemma":0.000009679552,"teacher_disagreement_score":0.9137073,"about_ca_system_score_codex":0.00010562917,"about_ca_system_score_gemma":0.000054078817,"threshold_uncertainty_score":0.9994266},"labels":[],"label_agreement":null},{"id":"W2107084511","doi":"10.1109/tvt.2011.2157371","title":"Performance Analysis Framework for Transmit Antenna Selection Strategies of Cooperative MIMO AF Relay Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Moment-generating function; MIMO; Nakagami distribution; Relay; Fading; Channel state information; Topology (electrical circuits); Cumulative distribution function; Channel (broadcasting); Mathematics; Upper and lower bounds; Signal-to-noise ratio (imaging); Maximal-ratio combining; Computer science; Algorithm; Random variable; Probability density function; Telecommunications; Statistics; Wireless; Combinatorics; Physics","score_opus":0.02860655596243606,"score_gpt":0.26298816079615783,"score_spread":0.23438160483372178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107084511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040615156,0.000253475,0.9578368,0.00031309726,0.00016254497,0.000349788,0.0000038700914,0.00032614678,0.00013912597],"genre_scores_gemma":[0.9108348,0.0009822694,0.087886505,0.00005502025,0.000010016969,0.00017348683,0.0000019976897,0.000013626152,0.000042310316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986482,0.0001052873,0.00039033106,0.0004250333,0.00012956979,0.0003015236],"domain_scores_gemma":[0.99855524,0.00012314101,0.00014391898,0.00073574303,0.00039455635,0.000047397738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024309596,0.00021312619,0.0003732368,0.0007460625,0.00040144243,0.000037284208,0.00082251034,0.00034439593,0.000045041405],"category_scores_gemma":[0.0000083323785,0.00020332409,0.00022246344,0.0035746456,0.00019968257,0.0003617397,0.0000060650905,0.00055705104,0.000004768672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022256444,0.0010368994,0.0006587468,0.000056016055,0.0023880396,0.000005057678,0.0028743406,0.5469857,0.009727125,0.26613718,0.0000285664,0.16987981],"study_design_scores_gemma":[0.00034590057,0.0006696032,0.0004739464,0.000060031347,0.00022312632,0.000009080108,0.0002170528,0.9513552,0.04534017,0.0009104075,0.0001517418,0.0002437147],"about_ca_topic_score_codex":0.000006777488,"about_ca_topic_score_gemma":0.00010939904,"teacher_disagreement_score":0.8702196,"about_ca_system_score_codex":0.000047848487,"about_ca_system_score_gemma":0.00007046727,"threshold_uncertainty_score":0.8291316},"labels":[],"label_agreement":null},{"id":"W2107255171","doi":"10.1109/sahcnw.2008.24","title":"The Cost Advantage of Network Coding in Uniform Combinatorial Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Calgary","funders":"","keywords":"Linear network coding; Computer science; Network topology; Steiner tree problem; Coding (social sciences); Upper and lower bounds; Bounded function; Theoretical computer science; Routing (electronic design automation); Mathematical optimization; Mathematics; Computer network","score_opus":0.029729620179810328,"score_gpt":0.26930566911754544,"score_spread":0.23957604893773513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107255171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074835694,0.0015699555,0.93614763,0.0011874884,0.0020100342,0.0005373466,3.2417444e-7,0.0001477046,0.050915945],"genre_scores_gemma":[0.9918386,0.0054680514,0.0021715232,0.00017079835,0.00009802587,0.000013719821,0.0000013212646,0.000005050551,0.00023290716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989444,0.00014898696,0.00031932624,0.00014978318,0.00015380658,0.00028368764],"domain_scores_gemma":[0.99857557,0.000559603,0.00009693789,0.0006295013,0.00009017176,0.000048211357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064291427,0.00009408249,0.00015023179,0.00003480925,0.00045195484,0.000044234832,0.0011354388,0.00004134412,0.000010931897],"category_scores_gemma":[0.00004224559,0.00006771625,0.00004205563,0.0007512134,0.000109933826,0.00022553588,0.0004932614,0.00021689394,0.000004706998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010748105,0.000030285648,0.0048908168,9.92171e-7,0.000005753244,0.0000041941444,0.00021611725,0.005103619,0.000012852395,0.9649357,0.0024525484,0.022336375],"study_design_scores_gemma":[0.0010519797,0.00006810548,0.009541373,0.000053140546,0.0000017773225,0.000015880047,0.000061456296,0.9480336,0.00014968708,0.002481589,0.0383195,0.00022193897],"about_ca_topic_score_codex":0.0000070294623,"about_ca_topic_score_gemma":0.00014022087,"teacher_disagreement_score":0.98435503,"about_ca_system_score_codex":0.00004295539,"about_ca_system_score_gemma":0.000053844014,"threshold_uncertainty_score":0.3476117},"labels":[],"label_agreement":null},{"id":"W2107360574","doi":"10.1109/tvt.2011.2145013","title":"Optimized Nonuniform Constellation Rearrangement for Cooperative Relaying","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"University of Ottawa","keywords":"QAM; Quadrature amplitude modulation; Constellation; Constellation diagram; Cartesian product; Heuristic; Topology (electrical circuits); Mathematics; Relay; Computer science; Algorithm; Mathematical optimization; Bit error rate; Decoding methods; Discrete mathematics; Physics; Combinatorics; Power (physics)","score_opus":0.05037336778511688,"score_gpt":0.2658131556275118,"score_spread":0.2154397878423949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107360574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003425824,0.00012300137,0.99101526,0.0011706227,0.0002766509,0.00064034446,0.0000033602405,0.00049421954,0.002850693],"genre_scores_gemma":[0.8542535,0.00035541056,0.1448028,0.00023797285,0.000008199371,0.00016340114,0.0000020802677,0.000013439755,0.00016323778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998972,0.00006708327,0.00026939006,0.00034495586,0.00010831755,0.00023823067],"domain_scores_gemma":[0.99881136,0.000081532744,0.000083960746,0.00073929556,0.00023646376,0.000047401434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000243565,0.0001601879,0.00019479464,0.00036230515,0.00047482806,0.000037460388,0.0006182422,0.00017036931,0.00007337617],"category_scores_gemma":[0.000008875601,0.00015476877,0.00009227105,0.00066499674,0.000117268355,0.00022740311,0.000009304227,0.00027756748,0.000038988885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021641198,0.0008070251,0.000022421546,0.00002753756,0.0003816001,0.000017918244,0.0030534673,0.04266393,0.02632995,0.19920108,0.00048451504,0.7267941],"study_design_scores_gemma":[0.0034168786,0.00097030465,0.000023161741,0.000115629286,0.00006788231,0.000055818262,0.000390543,0.5896229,0.38869417,0.0027286056,0.013220281,0.0006938078],"about_ca_topic_score_codex":0.0000025317581,"about_ca_topic_score_gemma":0.000009692068,"teacher_disagreement_score":0.85082763,"about_ca_system_score_codex":0.0000800359,"about_ca_system_score_gemma":0.000047928996,"threshold_uncertainty_score":0.6311287},"labels":[],"label_agreement":null},{"id":"W2107361497","doi":"10.1109/icassp.2012.6288521","title":"Relay power allocation and pricing in multi-user relay networks using game theory","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Stackelberg competition; Computer science; Relay channel; Game theory; Computer network; Resource allocation; Power (physics); Wireless; Mathematical optimization; Telecommunications; Microeconomics; Mathematics; Economics","score_opus":0.049768919710234,"score_gpt":0.3002705745781107,"score_spread":0.2505016548678767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107361497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08857856,0.0023092206,0.9070927,0.0002514303,0.00017390131,0.00013163868,3.1758052e-8,0.000073714,0.0013887879],"genre_scores_gemma":[0.940405,0.00035518676,0.05800866,0.0005776597,0.000025446816,0.0000055100327,6.4538625e-7,0.000008274354,0.00061360904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895984,0.00029455769,0.00020796472,0.00018812151,0.00008529255,0.00026421016],"domain_scores_gemma":[0.99915606,0.00020200526,0.000060478633,0.0004512695,0.00005213859,0.000078067336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011262489,0.0001043939,0.00010773753,0.00009476381,0.00011576875,0.0000849897,0.00032180065,0.000062667656,0.000023049986],"category_scores_gemma":[0.00006189888,0.00009107961,0.000019420408,0.00039604268,0.000034480057,0.00078534667,0.0003830118,0.00020294206,0.0000084684225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014231913,0.00022937328,0.058779538,0.0000066729162,0.000023498058,0.0000021157532,0.012148772,0.037668455,0.0021953885,0.8235398,0.00020119848,0.06519095],"study_design_scores_gemma":[0.00033837665,0.000012584168,0.042393446,0.00005274059,0.0000030733927,0.000010298163,0.00010575081,0.9539312,0.0001458726,0.000056498215,0.0027589463,0.00019120112],"about_ca_topic_score_codex":0.000006972302,"about_ca_topic_score_gemma":0.000025849246,"teacher_disagreement_score":0.91626275,"about_ca_system_score_codex":0.0000611572,"about_ca_system_score_gemma":0.000017580942,"threshold_uncertainty_score":0.37141186},"labels":[],"label_agreement":null},{"id":"W2107363488","doi":"10.1109/lcomm.2010.07.100407","title":"Amplify-and-Forward Relaying in Channel-Noise-Assisted Cooperative Networks with Relay Selection","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Ergodic theory; Relay; Cumulative distribution function; Probability density function; Channel (broadcasting); Expression (computer science); Computer science; Topology (electrical circuits); Signal-to-noise ratio (imaging); Upper and lower bounds; Closed-form expression; Selection (genetic algorithm); Channel capacity; Noise (video); Relay channel; Outage probability; Mathematics; Algorithm; Applied mathematics; Telecommunications; Statistics; Fading; Mathematical analysis; Physics; Combinatorics; Artificial intelligence","score_opus":0.02841809767530662,"score_gpt":0.26936046351339593,"score_spread":0.2409423658380893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107363488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23900576,0.0004889726,0.7275905,0.029706737,0.00036236306,0.0005210197,0.0000016549662,0.0003554948,0.00196749],"genre_scores_gemma":[0.96163934,0.0006379786,0.03508139,0.0023631388,0.000037906833,0.00016125252,0.000014195667,0.000019542078,0.00004525363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985222,0.00039377125,0.0003164284,0.00033764675,0.00014345185,0.0002864688],"domain_scores_gemma":[0.997314,0.00042299606,0.00013760287,0.00188551,0.00014268677,0.000097233875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005550892,0.0001852745,0.00018502523,0.00021764601,0.0007318438,0.0002524203,0.001693319,0.00010501181,0.000007805696],"category_scores_gemma":[0.000053219996,0.00017967424,0.000032858905,0.0011299659,0.00025340685,0.00058195763,0.00047699548,0.0012081873,0.000011396919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018518994,0.0011662149,0.03073236,0.000046979832,0.00041858276,0.000030429948,0.017507032,0.24569996,0.2362396,0.30391866,0.01313622,0.1509188],"study_design_scores_gemma":[0.0008716231,0.00007536584,0.016824258,0.00010314016,0.000015414262,0.00007449939,0.0000858953,0.97247064,0.00063050736,0.000033978336,0.008337477,0.00047718946],"about_ca_topic_score_codex":0.00004088991,"about_ca_topic_score_gemma":0.0018688923,"teacher_disagreement_score":0.7267707,"about_ca_system_score_codex":0.00006486219,"about_ca_system_score_gemma":0.000057212288,"threshold_uncertainty_score":0.73269033},"labels":[],"label_agreement":null},{"id":"W2107395567","doi":"10.1109/icc.2006.255715","title":"Achievable Communication Rates in Ad hoc Wireless Networks Using Local Node Cooperation","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Node (physics); Relay; Throughput; Wireless; Communication complexity; Mobile ad hoc network; Vehicular ad hoc network; Distributed computing; Telecommunications; Theoretical computer science; Network packet; Engineering","score_opus":0.10135500579580987,"score_gpt":0.34953787562953237,"score_spread":0.2481828698337225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107395567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018658467,0.0022775077,0.92991865,0.0127609065,0.0004839078,0.00054499233,0.000022403485,0.00027030864,0.035062835],"genre_scores_gemma":[0.9701734,0.006307078,0.021880921,0.00065676344,0.00005304791,0.00011529713,0.00027677443,0.00002329285,0.00051339396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741125,0.00068890967,0.00075465936,0.00043570448,0.00036153136,0.0003479451],"domain_scores_gemma":[0.9955977,0.00037488807,0.00030587852,0.0029007867,0.0007444972,0.00007624221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066831685,0.00028778252,0.00027559118,0.00037346696,0.0006565803,0.00055561896,0.004885958,0.00015117248,0.00008656945],"category_scores_gemma":[0.000036110785,0.00031494824,0.00008327617,0.000841255,0.00030190643,0.00097484165,0.000826674,0.0007157195,0.00007316926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035871144,0.000721025,0.0011170559,0.000004262208,0.000034379267,0.0000026780901,0.00031481587,0.09068506,0.0035202133,0.85673404,0.0017787702,0.045051817],"study_design_scores_gemma":[0.00061600166,0.000032534623,0.0015743164,0.00018516633,0.000006036172,0.000008521988,0.000075483564,0.9884906,0.0005392958,0.0022338463,0.0059042214,0.0003339662],"about_ca_topic_score_codex":0.0002965485,"about_ca_topic_score_gemma":0.004027561,"teacher_disagreement_score":0.95151496,"about_ca_system_score_codex":0.0004225769,"about_ca_system_score_gemma":0.00020980001,"threshold_uncertainty_score":0.99993026},"labels":[],"label_agreement":null},{"id":"W2107466469","doi":"10.1109/sis.2011.5952588","title":"Swarm based resource minimization in network coded system?","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multicast; Minification; Particle swarm optimization; Computer science; Linear network coding; Coding (social sciences); Swarm behaviour; Mathematical optimization; Resource (disambiguation); Scheme (mathematics); Distributed computing; Algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.05686738201307582,"score_gpt":0.2446242363681991,"score_spread":0.1877568543551233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107466469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011395937,0.00014211761,0.9114612,0.00042350424,0.000113030634,0.00015752618,1.2541474e-7,0.000262272,0.08630068],"genre_scores_gemma":[0.89215225,0.000017717048,0.10674695,0.0007018003,0.000028932038,0.000018036955,0.0000028982568,0.000005553073,0.00032587544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908197,0.00023182106,0.00021246579,0.00019676624,0.0001002431,0.00017674714],"domain_scores_gemma":[0.9991516,0.00008311341,0.000054754888,0.0006053762,0.0000559577,0.000049225408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037305077,0.00007979151,0.00010407298,0.00007338866,0.000100894984,0.00004812131,0.0007003358,0.000037274844,0.00004861583],"category_scores_gemma":[0.000017921118,0.00007320242,0.00002423011,0.0006647993,0.000017375167,0.00015510574,0.00018125071,0.00008366143,0.000037763475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000364179,0.00018986074,0.009572987,0.000030092768,0.000013101016,0.000017669408,0.0033165682,0.020803744,0.00006984371,0.91128314,0.022421606,0.032244947],"study_design_scores_gemma":[0.00033382792,0.000024211082,0.00355401,0.00006827675,0.0000013357956,0.000001576462,0.00004885781,0.9816978,0.000530179,0.00009508506,0.013516285,0.00012854474],"about_ca_topic_score_codex":0.000014979478,"about_ca_topic_score_gemma":0.00011525968,"teacher_disagreement_score":0.96089405,"about_ca_system_score_codex":0.000047643294,"about_ca_system_score_gemma":0.000035257475,"threshold_uncertainty_score":0.2985108},"labels":[],"label_agreement":null},{"id":"W2107501420","doi":"10.1109/ccece.2003.1226204","title":"Analysis of throughput and delay in multimedia CDMA networks with relaying","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Throughput; Computer network; Relay; Computer science; Node (physics); Quality of service; Base station; Cellular network; Telecommunications; Wireless; Engineering","score_opus":0.021835410354095825,"score_gpt":0.26321955454801216,"score_spread":0.24138414419391632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107501420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13112481,0.00058611605,0.86612475,0.0004343255,0.000015784697,0.00006430102,1.0464767e-7,0.00003205753,0.0016177692],"genre_scores_gemma":[0.9155236,0.0005215818,0.083738916,0.00018309253,0.00000431364,0.0000037420598,0.0000013405128,0.0000024378076,0.000020999918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941254,0.000045042845,0.00016586292,0.00017657038,0.00008567215,0.00011430091],"domain_scores_gemma":[0.999377,0.00010458823,0.000051116433,0.00037920466,0.000052279567,0.000035803703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020184062,0.00006782801,0.00016586018,0.00017052537,0.000051913146,0.000033651326,0.00029885303,0.000027922531,0.000008809182],"category_scores_gemma":[0.000012114039,0.000051741525,0.000024446186,0.0016405693,0.000046892277,0.00021316211,0.00018626559,0.00009764321,7.0308596e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001546803,0.00012106781,0.1225764,0.0000042969496,0.00030906172,0.000014416068,0.0054841605,0.6824955,0.00013776319,0.07068536,0.000027454813,0.11812906],"study_design_scores_gemma":[0.00043149278,0.00003327948,0.06034214,0.000025129775,0.000026586205,0.0000021497988,0.0000424772,0.93881273,0.0000655992,0.0000610094,0.000068421105,0.00008900566],"about_ca_topic_score_codex":0.000060784852,"about_ca_topic_score_gemma":0.001904551,"teacher_disagreement_score":0.7843988,"about_ca_system_score_codex":0.000023080554,"about_ca_system_score_gemma":0.00002251811,"threshold_uncertainty_score":0.21099582},"labels":[],"label_agreement":null},{"id":"W2107706475","doi":"10.1109/twc.2012.030512.110895","title":"Energy-Aware Resource Allocation for Cooperative Cellular Network Using Multi-Objective Optimization Approach","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Relay; Throughput; Resource allocation; Quality of service; Energy consumption; Channel state information; Base station; Computer network; Wireless; Transmission (telecommunications); Efficient energy use; Mathematical optimization; Power (physics); Telecommunications","score_opus":0.07227730191755045,"score_gpt":0.29100568623326534,"score_spread":0.2187283843157149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107706475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018770227,0.0008969932,0.99646086,0.00055942946,0.00028450586,0.0007441825,0.00002236435,0.00030841964,0.00053552026],"genre_scores_gemma":[0.66360396,0.00064500875,0.3345378,0.00032113967,0.000072128474,0.0005138692,0.00008094399,0.000036960606,0.00018817319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974589,0.0008449786,0.00050897646,0.00042661425,0.00023517202,0.00052537076],"domain_scores_gemma":[0.9957451,0.0005949553,0.00024352715,0.0026811948,0.0005396048,0.00019560545],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00062811887,0.00032522518,0.0003105069,0.00022325458,0.002402977,0.00019150254,0.0019647533,0.00017498102,0.000011285001],"category_scores_gemma":[0.000009006625,0.0003517146,0.00017171752,0.0012949109,0.00018833521,0.0010216937,0.0000568514,0.00042360096,0.000006133298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022680602,0.0010677621,0.000013897898,0.00001120004,0.00011553146,7.3118834e-8,0.0023200386,0.93593836,0.0011714428,0.028031124,0.00015205488,0.031155847],"study_design_scores_gemma":[0.00059789175,0.00005143924,0.000009025327,0.000057354217,0.00005053222,0.0000052351083,0.00026584583,0.9919038,0.004423064,0.000023129258,0.0022295692,0.00038312122],"about_ca_topic_score_codex":0.000024947665,"about_ca_topic_score_gemma":0.000054722037,"teacher_disagreement_score":0.66341627,"about_ca_system_score_codex":0.00030472537,"about_ca_system_score_gemma":0.00013954731,"threshold_uncertainty_score":0.9998935},"labels":[],"label_agreement":null},{"id":"W2107893226","doi":"10.1109/glocom.2006.855","title":"WLC41-3: On the Performance of Cooperative Wireless Fixed Relays in Asymmetric Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer science; Hop (telecommunications); Computer network; Reliability (semiconductor); Wireless; Node (physics); Wireless network; Outage probability; Signal strength; Expression (computer science); Relay channel; Bit error rate; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Engineering; Electrical engineering; Power (physics); Fading","score_opus":0.0250920193219738,"score_gpt":0.24538923958885522,"score_spread":0.22029722026688142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107893226","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9628316,0.00044058746,0.009198644,0.003705703,0.0002886219,0.00030048136,0.0000021068727,0.000061658175,0.023170581],"genre_scores_gemma":[0.99843746,0.00021080166,0.00039055123,0.00035584427,0.000035270907,0.00003210289,0.0000028042436,0.00000487828,0.0005302607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989877,0.00019116646,0.00025996272,0.00019875607,0.00017299326,0.00018947422],"domain_scores_gemma":[0.9988934,0.00026195066,0.00009517426,0.0006193066,0.00010773212,0.000022474838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042504666,0.000112540656,0.00016162593,0.0001825879,0.00015635186,0.000060366543,0.0009673334,0.000038520455,0.000030024534],"category_scores_gemma":[0.000030581177,0.000080394624,0.00003789086,0.001807612,0.00005365226,0.00018072873,0.0002508853,0.00019936136,0.000035458357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003627893,0.0005022281,0.017779225,0.000016690028,0.000022746595,0.0000068401937,0.001494334,0.017882057,0.0015619708,0.7727929,0.014366,0.17353876],"study_design_scores_gemma":[0.0008255937,0.00032951077,0.08929162,0.00017475335,0.0000034330342,0.0000054076922,0.000052384567,0.87605983,0.022944398,0.00031533113,0.009632675,0.00036504836],"about_ca_topic_score_codex":0.00003209333,"about_ca_topic_score_gemma":0.00007708164,"teacher_disagreement_score":0.8581778,"about_ca_system_score_codex":0.000058418096,"about_ca_system_score_gemma":0.000035722427,"threshold_uncertainty_score":0.32783976},"labels":[],"label_agreement":null},{"id":"W2108248716","doi":"10.1155/wcn/2006/72493","title":"A Novel Cluster-Based Cooperative MIMO Scheme for Multi-Hop Wireless Sensor Networks","year":2006,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Korea Science and Engineering Foundation","keywords":"Cooperative MIMO; Computer science; MIMO; Hop (telecommunications); Computer network; Energy consumption; Wireless sensor network; Fading; Efficient energy use; Wireless; 3G MIMO; Distributed computing; Channel (broadcasting); Telecommunications","score_opus":0.07923437018773907,"score_gpt":0.3151772264676334,"score_spread":0.23594285627989434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108248716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0106812585,0.00533177,0.9775483,0.0047722207,0.000452282,0.000580447,0.0000064028577,0.00016319762,0.00046411614],"genre_scores_gemma":[0.8229502,0.0050114645,0.16972849,0.0014936477,0.0004793805,0.00010046445,0.000035392528,0.0000477152,0.00015324382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972211,0.00060444867,0.0008288024,0.00047064098,0.00026972947,0.00060523814],"domain_scores_gemma":[0.9953281,0.0014861882,0.0005523092,0.001782559,0.0006367611,0.0002140605],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012555838,0.00040879822,0.00047236518,0.00023806877,0.0027892832,0.0009332553,0.0023128814,0.00015574915,0.0000044792905],"category_scores_gemma":[0.000030051975,0.0003794087,0.00019154036,0.00079286296,0.00024951957,0.00044512772,0.0006959078,0.0010125125,0.0000040191007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032088003,0.002827733,0.004231685,0.000056468634,0.0003428175,0.000018628762,0.00139135,0.077016905,0.009825725,0.16307983,0.00517188,0.7357161],"study_design_scores_gemma":[0.0023134833,0.00016611052,0.0006220644,0.000390457,0.000018787388,0.00007154457,0.000047320773,0.959965,0.00010922463,0.000047561247,0.03579921,0.00044925205],"about_ca_topic_score_codex":0.000010070744,"about_ca_topic_score_gemma":0.0001582282,"teacher_disagreement_score":0.8829481,"about_ca_system_score_codex":0.00013466504,"about_ca_system_score_gemma":0.00013049557,"threshold_uncertainty_score":0.9998658},"labels":[],"label_agreement":null},{"id":"W2108313821","doi":"10.1109/isit.2010.5513258","title":"Distortion exponents of two-way relaying cooperative networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Exponent; Distortion (music); Computer science; Bandwidth (computing); Topology (electrical circuits); Gaussian; Telecommunications; Signal-to-noise ratio (imaging); Upper and lower bounds; Mathematics; Physics; Power (physics); Mathematical analysis; Combinatorics","score_opus":0.026874680405538427,"score_gpt":0.2815128190524884,"score_spread":0.25463813864695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108313821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08808725,0.00009152019,0.89926547,0.0003117382,0.0005229763,0.00011116487,2.3658829e-7,0.000099466626,0.011510202],"genre_scores_gemma":[0.98422444,0.00010270273,0.014922402,0.00018364267,0.000051787174,0.000011292502,0.0000033419128,0.000005306366,0.0004950575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991881,0.00009524831,0.00024103606,0.0001984875,0.00013144214,0.00014565508],"domain_scores_gemma":[0.99889266,0.000104115235,0.000094785784,0.00065667013,0.00018829567,0.00006349797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031946655,0.000092655566,0.00012422532,0.000053744203,0.0001832971,0.000060358092,0.0006825986,0.000041617965,0.000113689784],"category_scores_gemma":[0.000050334507,0.000079351536,0.000041528554,0.000354291,0.000058627324,0.00039058054,0.00033063864,0.00026459273,0.000017210663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070117444,0.00012457167,0.0038266599,0.0000030912404,0.000022110627,0.0000017267167,0.0009829556,0.0025312987,0.046222005,0.8095316,0.0014059015,0.13534102],"study_design_scores_gemma":[0.00075676636,0.00007713241,0.009761804,0.00003457308,0.0000059264744,0.000008715376,0.000038212107,0.96912,0.015491024,0.0004812685,0.0039054798,0.00031904897],"about_ca_topic_score_codex":0.0000090594785,"about_ca_topic_score_gemma":0.00013254922,"teacher_disagreement_score":0.96658874,"about_ca_system_score_codex":0.000016342736,"about_ca_system_score_gemma":0.00002411771,"threshold_uncertainty_score":0.3235862},"labels":[],"label_agreement":null},{"id":"W2108326059","doi":"10.1109/glocom.2009.5425896","title":"Performance Analysis of Incremental-Relay-Selection Decode-and-Forward Technique","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Decoding methods; Selection (genetic algorithm); Relay channel; Diversity gain; Channel (broadcasting); Fading; Cooperative diversity; Transmission (telecommunications); Outage probability; Signal-to-noise ratio (imaging); Maximal-ratio combining; Diversity combining; Telecommunications; Antenna (radio); Computer network; Artificial intelligence","score_opus":0.01980742988273783,"score_gpt":0.275965314505636,"score_spread":0.2561578846228982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108326059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21865726,0.00009477384,0.7732965,0.0004019578,0.000013225067,0.00010950264,1.6734926e-7,0.000092862516,0.007333773],"genre_scores_gemma":[0.9515794,0.00063345407,0.047372386,0.0002603813,0.0000040242603,0.0000069306266,0.0000015727833,0.0000012775506,0.00014058793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994458,0.000045528344,0.00017613167,0.00014362008,0.000099068966,0.00008987078],"domain_scores_gemma":[0.9995202,0.000026925047,0.000059320628,0.00028379387,0.00007785774,0.00003194831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029178246,0.000062777784,0.00013091094,0.0002557278,0.00010460103,0.00002973939,0.00032342167,0.000027207661,0.00004162194],"category_scores_gemma":[0.000008656832,0.00005523819,0.000043881588,0.0014181106,0.000017628357,0.00025222875,0.00010678182,0.00006773548,0.0000022647387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014688712,0.0001637663,0.054468352,0.000007897605,0.00030195905,3.550322e-7,0.00067315705,0.003540973,0.072643235,0.10513779,0.0006065452,0.7624413],"study_design_scores_gemma":[0.0000899659,0.000120562545,0.095339246,0.000009648623,0.00004274898,0.0000022048944,0.000005648873,0.8715882,0.032151308,0.00005801674,0.00049474224,0.000097754695],"about_ca_topic_score_codex":0.000005737331,"about_ca_topic_score_gemma":0.00003649515,"teacher_disagreement_score":0.8680472,"about_ca_system_score_codex":0.000026479434,"about_ca_system_score_gemma":0.000014021952,"threshold_uncertainty_score":0.22525479},"labels":[],"label_agreement":null},{"id":"W2108420689","doi":"10.1109/twc.2009.070966","title":"Performance of cooperative diversity using Equal Gain Combining (EGC) over Nakagami-m fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Nakagami distribution; Maximal-ratio combining; Diversity combining; Moment-generating function; Bit error rate; Signal-to-noise ratio (imaging); Algorithm; Mathematics; Topology (electrical circuits); Wireless; Computer science; Diversity gain; Path loss; Statistics; Telecommunications; Random variable; Channel (broadcasting); Combinatorics","score_opus":0.07863602291790905,"score_gpt":0.3028134178378109,"score_spread":0.22417739491990185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108420689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30581507,0.00012943384,0.6922193,0.00054121687,0.00018518447,0.0002340739,0.000008959729,0.00014677494,0.0007199838],"genre_scores_gemma":[0.9901742,0.0015123708,0.007837066,0.00034059372,0.000013396319,0.000016866948,0.000005556401,0.000012743603,0.00008724828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981449,0.00044217735,0.00046975704,0.00032245828,0.00031214932,0.00030855197],"domain_scores_gemma":[0.9966213,0.00039232775,0.00022152303,0.0023151136,0.00033436093,0.00011535254],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00043332364,0.00024159765,0.00033173192,0.00030616956,0.0023229287,0.00010240536,0.0027626487,0.00009799314,0.000026959957],"category_scores_gemma":[0.00000890752,0.000265162,0.00013418622,0.001160886,0.00022245481,0.00087304687,0.00012454344,0.00056986086,0.000010573594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012864805,0.0029086273,0.0004979964,0.000047912716,0.0003134732,0.0000039919337,0.030411331,0.5437967,0.06534115,0.07856189,0.00015828284,0.27783],"study_design_scores_gemma":[0.0006107914,0.00022875084,0.00043625906,0.00020223173,0.000026306356,0.0000064362375,0.000114757364,0.9786809,0.019193076,0.00009184512,0.00009252878,0.00031608983],"about_ca_topic_score_codex":0.000030429082,"about_ca_topic_score_gemma":0.000037635044,"teacher_disagreement_score":0.68438226,"about_ca_system_score_codex":0.00017023332,"about_ca_system_score_gemma":0.00011072418,"threshold_uncertainty_score":0.99998003},"labels":[],"label_agreement":null},{"id":"W2108494513","doi":"10.1145/1459359.1459396","title":"On large-scale peer-to-peer streaming systems with network coding","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Upload; Peer-to-peer; Server; The Internet; Distributed computing; Network dynamics; Live streaming; Coding (social sciences); Multiple description coding; Computer network; World Wide Web; Network packet","score_opus":0.03304347695269573,"score_gpt":0.26145555073943433,"score_spread":0.2284120737867386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108494513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019452062,0.0001335884,0.93122214,0.0028259195,0.00033755385,0.00025999275,0.0000011040637,0.00033163576,0.04543598],"genre_scores_gemma":[0.95831066,0.000055316897,0.025085285,0.001214714,0.00014371733,0.000026538715,0.0000043721375,0.000013333642,0.015146041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984167,0.00011556263,0.00019908114,0.00034878004,0.00052448176,0.0003953549],"domain_scores_gemma":[0.99836576,0.00019854557,0.000056189347,0.00085327897,0.00036909172,0.00015714705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005219353,0.00015846359,0.00018673511,0.00007551806,0.0006647455,0.00018050373,0.0008329006,0.000039011793,0.000035301804],"category_scores_gemma":[0.000042979493,0.00012201945,0.00003329854,0.00070053653,0.000024396466,0.00023326206,0.00033555305,0.00018707066,0.0001432005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039828305,0.00023582781,0.0072070514,0.0000142635645,0.00006381129,0.00006380855,0.0071137417,0.11068213,0.00014023246,0.6433009,0.21943766,0.011700785],"study_design_scores_gemma":[0.00090629567,0.0003871214,0.0053573134,0.0002950198,0.0000064708133,0.000095400734,0.00030868824,0.80708313,0.00020747435,0.00009814156,0.18459176,0.000663182],"about_ca_topic_score_codex":0.00000950157,"about_ca_topic_score_gemma":0.00009025178,"teacher_disagreement_score":0.9388586,"about_ca_system_score_codex":0.00005978609,"about_ca_system_score_gemma":0.00004781746,"threshold_uncertainty_score":0.51127523},"labels":[],"label_agreement":null},{"id":"W2108553934","doi":"10.1109/ccece.2009.5090141","title":"Capacity analysis of a decode-and-forward cooperative network under adaptive transmission","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Computer science; Monte Carlo method; Nakagami distribution; Outage probability; Transmission (telecommunications); Constant (computer programming); Power (physics); Closed-form expression; Topology (electrical circuits); Wireless; Wireless network; Channel (broadcasting); Mathematics; Telecommunications; Statistics; Physics; Combinatorics","score_opus":0.046929544020556144,"score_gpt":0.2805614002264852,"score_spread":0.23363185620592902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108553934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012149398,0.0005478651,0.9791347,0.0017801723,0.000020314352,0.000108869834,8.5259023e-7,0.000063352454,0.0061944937],"genre_scores_gemma":[0.93430775,0.0005897865,0.06389806,0.0010172044,0.000011070537,0.0000029503235,0.0000023336615,0.0000023155476,0.00016851012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894756,0.00019695704,0.00025840773,0.00026595287,0.00015239656,0.00017870136],"domain_scores_gemma":[0.99904144,0.0001582847,0.00007541224,0.00043040948,0.00019400213,0.00010044737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032117424,0.00012472327,0.00030796303,0.00014238637,0.00018853687,0.0000522614,0.00043669585,0.00004854694,0.00007272291],"category_scores_gemma":[0.000010767242,0.00009846822,0.0001035254,0.0017939847,0.000058440095,0.0002644536,0.00009064193,0.00012316264,0.0000022472605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022079455,0.00008956773,0.0003672505,0.0000013043193,0.00038296226,6.9313995e-7,0.0019873113,0.042644393,0.00084398594,0.7655992,0.00053311256,0.18752815],"study_design_scores_gemma":[0.0002462846,0.000175679,0.03027544,0.000021239932,0.00011445905,0.0000011861715,0.000042399482,0.96424156,0.0008079186,0.003083083,0.0008119,0.00017887345],"about_ca_topic_score_codex":0.000009684217,"about_ca_topic_score_gemma":0.000103308426,"teacher_disagreement_score":0.92215836,"about_ca_system_score_codex":0.000025492554,"about_ca_system_score_gemma":0.00003558297,"threshold_uncertainty_score":0.40154174},"labels":[],"label_agreement":null},{"id":"W2108635022","doi":"10.1002/wcm.1180","title":"Weighted partial network coding and its applications in wireless mesh networks","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Linear network coding; Computer network; Network packet; Decoding methods; Quality of service; Wireless mesh network; Multiple description coding; Coding (social sciences); Multipath propagation; Jitter; Wireless; Wireless network; Algorithm; Telecommunications","score_opus":0.04249036169607289,"score_gpt":0.2780612519177728,"score_spread":0.2355708902216999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108635022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20989983,0.01086181,0.77464586,0.00033493465,0.0001495652,0.0012285622,0.0000023247433,0.00038534412,0.0024917605],"genre_scores_gemma":[0.96940285,0.016901718,0.013185065,0.00014119405,0.00006248616,0.00024577763,0.000018270573,0.000020056965,0.000022597776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798083,0.0004163837,0.00056439784,0.00047469008,0.00011740322,0.0004463144],"domain_scores_gemma":[0.997231,0.00060814904,0.00022069851,0.001624454,0.000154126,0.0001615685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007343983,0.0002467195,0.00034029546,0.00013503493,0.0011390378,0.0001837887,0.0017460276,0.00011242716,0.000006893062],"category_scores_gemma":[0.000010311735,0.00025668225,0.00004580296,0.00093109393,0.0001813495,0.00036173646,0.0027705217,0.0004892414,0.000003253663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004442988,0.00015889708,0.0065397667,0.000017075168,0.000025205625,0.0000013799013,0.0033536442,0.00015049653,0.00014253137,0.70081323,0.000034208795,0.28875908],"study_design_scores_gemma":[0.0003526827,0.000040261664,0.003924851,0.00015001597,0.000010005167,0.000011388039,0.00018171332,0.99172145,0.0000822956,0.0004290652,0.0027844384,0.0003118392],"about_ca_topic_score_codex":0.000025635964,"about_ca_topic_score_gemma":0.00009817351,"teacher_disagreement_score":0.99157095,"about_ca_system_score_codex":0.00004230982,"about_ca_system_score_gemma":0.00004451927,"threshold_uncertainty_score":0.99998856},"labels":[],"label_agreement":null},{"id":"W2108871255","doi":"10.1109/isit.2008.4595416","title":"Diversity-multiplexing trade-off of the hybrid non-orthogonal amplify-decode and forward protocol","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Protocol (science); Relay; Multiplexing; Computer network; Transmission (telecommunications); Cooperative diversity; Telecommunications; Channel (broadcasting); Fading; Physics","score_opus":0.04614081165825286,"score_gpt":0.27420595784032337,"score_spread":0.22806514618207052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108871255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20796849,0.00009246803,0.7327714,0.0046425634,0.00020217878,0.036125887,0.000009651245,0.00022956099,0.017957805],"genre_scores_gemma":[0.9914922,0.000040413663,0.00689989,0.00038442365,0.000016967062,0.001015267,5.4705885e-7,0.0000034971763,0.00014679044],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99924,0.000082161874,0.00016919627,0.00018582998,0.00018544093,0.00013741455],"domain_scores_gemma":[0.9992325,0.00010352309,0.000077492026,0.000497397,0.00003456405,0.000054524757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015619559,0.00008935438,0.00011767927,0.00003623336,0.0010796031,0.000023486657,0.00089423143,0.000021034348,0.00001779887],"category_scores_gemma":[0.000023255627,0.00006206782,0.000053862157,0.000198461,0.00011948812,0.00023729054,0.0025549456,0.00013499464,0.0000018500496],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009964051,0.00066361803,0.4702713,0.0001190041,0.00015938879,0.000025525553,0.023711056,0.0008325352,0.011308086,0.12538306,0.014936528,0.35249028],"study_design_scores_gemma":[0.0029318775,0.00018754709,0.5111735,0.0001169894,0.000009890228,0.00016605202,0.000080833015,0.40583715,0.02429031,0.0009889586,0.05361385,0.0006030446],"about_ca_topic_score_codex":0.0000056653944,"about_ca_topic_score_gemma":0.00002355693,"teacher_disagreement_score":0.78352374,"about_ca_system_score_codex":0.000011472144,"about_ca_system_score_gemma":0.000044726676,"threshold_uncertainty_score":0.8303543},"labels":[],"label_agreement":null},{"id":"W2109032089","doi":"10.1109/ciss.2008.4558515","title":"An efficient adaptive distributed space time coding scheme for cooperative relaying","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Relay channel; Wireless; Signal-to-noise ratio (imaging); Coding (social sciences); Outage probability; Monte Carlo method; Power (physics); Electronic engineering; Channel (broadcasting); Control theory (sociology); Real-time computing; Topology (electrical circuits); Computer network; Telecommunications; Fading; Mathematics; Engineering; Electrical engineering","score_opus":0.05263103972713095,"score_gpt":0.2847454208474526,"score_spread":0.23211438112032162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109032089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021250986,0.00013243535,0.9741811,0.00093636283,0.00008277857,0.0004166153,0.00000984282,0.0003325157,0.0026573502],"genre_scores_gemma":[0.8548415,0.000064565946,0.14396967,0.00028281144,0.000043050844,0.000052066545,0.000030151989,0.000011332755,0.0007048764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987094,0.00015121157,0.00023020059,0.0004193178,0.00017671987,0.00031316053],"domain_scores_gemma":[0.99835384,0.00029651175,0.00008084462,0.0006967751,0.000427635,0.00014438116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033726264,0.00017416579,0.00020594086,0.00007251477,0.00096439593,0.00011473345,0.0008489901,0.00005299634,0.000051391704],"category_scores_gemma":[0.00010403447,0.00015579768,0.00006512126,0.0005566296,0.000087604196,0.0003897799,0.00027028096,0.00015424693,0.00007618816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078377736,0.00045552407,0.00025279878,0.0000068305603,0.00007850671,0.000015758762,0.0056072487,0.028347231,0.035216834,0.91156155,0.012597718,0.005781636],"study_design_scores_gemma":[0.0004935345,0.00017853432,0.00031701435,0.000021273816,0.0000028119446,0.000014207541,0.00008447436,0.9905056,0.0052041486,0.00003963567,0.002896346,0.00024243325],"about_ca_topic_score_codex":0.0000029084385,"about_ca_topic_score_gemma":0.000004250409,"teacher_disagreement_score":0.9621584,"about_ca_system_score_codex":0.00010357536,"about_ca_system_score_gemma":0.000108343724,"threshold_uncertainty_score":0.7417451},"labels":[],"label_agreement":null},{"id":"W2109155742","doi":"10.1109/glocom.2005.1578476","title":"Minimum BER transmit optimization for two-input multiple-output spatial multiplexing","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Spatial multiplexing; MIMO; Beamforming; Transmitter; Phase-shift keying; Computer science; Multiplexing; Transmitter power output; Channel state information; Bit error rate; Precoding; Antenna (radio); Keying; Electronic engineering; Channel (broadcasting); Telecommunications; Wireless; Engineering","score_opus":0.047998556115146855,"score_gpt":0.30071625945223457,"score_spread":0.2527177033370877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109155742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023429429,0.0007871603,0.9708136,0.014988058,0.0006308441,0.0014477989,0.00019674403,0.0006776685,0.008115207],"genre_scores_gemma":[0.6428215,0.0009862582,0.35381112,0.0011068593,0.000217289,0.0003248308,0.00026227505,0.000029036282,0.00044085213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957712,0.00057104387,0.0012243357,0.00092276797,0.00044929254,0.0010613054],"domain_scores_gemma":[0.9940877,0.0006581968,0.00047260732,0.0034196074,0.00095670554,0.00040519686],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007771456,0.00062087004,0.00062272506,0.00024718945,0.0014423737,0.0007296486,0.005013917,0.00023590103,0.00018795047],"category_scores_gemma":[0.00023164338,0.00067931606,0.00034748288,0.00096303463,0.00025921784,0.001291101,0.0007058667,0.0005159295,0.00016232661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089347224,0.0010425239,0.0006890486,0.000030743697,0.00021697824,0.000002314772,0.00095804443,0.14728163,0.0006049891,0.045930535,0.02533632,0.7778175],"study_design_scores_gemma":[0.0025545182,0.000081709375,0.0005103098,0.00007803159,0.000037600847,0.0000278827,0.00004156715,0.8527403,0.00046438834,0.0003174907,0.14246507,0.0006811515],"about_ca_topic_score_codex":0.00014688654,"about_ca_topic_score_gemma":0.0059096916,"teacher_disagreement_score":0.7771364,"about_ca_system_score_codex":0.0005671503,"about_ca_system_score_gemma":0.00053427817,"threshold_uncertainty_score":0.9998576},"labels":[],"label_agreement":null},{"id":"W2109333889","doi":"10.1109/wcnc.2008.336","title":"A Novel Cooperation Scheme for Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Base station; Fading; Wireless sensor network; Quality of service; Efficient energy use; Code division multiple access; Bit error rate; Energy (signal processing); Scheme (mathematics); Wireless; Antenna diversity; Channel (broadcasting); Telecommunications; Engineering; Electrical engineering","score_opus":0.07090881280064491,"score_gpt":0.2816900866867853,"score_spread":0.21078127388614037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109333889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005582317,0.0000967542,0.9905259,0.0013241002,0.0001482986,0.00023892561,5.2251903e-7,0.00018813524,0.0018950326],"genre_scores_gemma":[0.7068049,0.00035545934,0.28885,0.0014545976,0.00011380897,0.000057707188,0.000008614002,0.000008333338,0.0023465892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932176,0.0000288982,0.00016696221,0.0002191489,0.00008301139,0.00018024872],"domain_scores_gemma":[0.9990675,0.0001209492,0.00003941489,0.0004722548,0.00024113084,0.000058756785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015874197,0.000093183946,0.000107459884,0.000038206497,0.00043132485,0.00007538111,0.00049353886,0.000043403994,0.000019321265],"category_scores_gemma":[0.000027190652,0.00008330754,0.000044207314,0.00030405703,0.000034321853,0.00029286457,0.00016111927,0.00008373586,0.000015246012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001881739,0.0002245929,0.00039610555,0.000006694909,0.00003467128,0.0000024991705,0.00083628536,0.004509314,0.032009386,0.88215345,0.020779364,0.059028804],"study_design_scores_gemma":[0.00042932198,0.000031959167,0.00028967642,0.0000067112933,9.658038e-7,0.00002319696,0.0000053794743,0.98496395,0.0010904187,0.000012518521,0.0130148,0.00013112236],"about_ca_topic_score_codex":0.000002425397,"about_ca_topic_score_gemma":0.00001922527,"teacher_disagreement_score":0.9804546,"about_ca_system_score_codex":0.000023670455,"about_ca_system_score_gemma":0.000048855523,"threshold_uncertainty_score":0.33971828},"labels":[],"label_agreement":null},{"id":"W2109491994","doi":"10.1109/glocom.2010.5683391","title":"Feedback Delay Effect on Dual-Hop MIMO AF Relaying with Antenna Selection","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Diversity gain; Moment-generating function; Coding gain; Cumulative distribution function; Monte Carlo method; Relay; Control theory (sociology); Computer science; MIMO; Probability density function; Antenna (radio); Hop (telecommunications); Array gain; Outage probability; Fading; Topology (electrical circuits); Mathematics; Telecommunications; Statistics; Antenna array; Decoding methods; Physics; Beamforming","score_opus":0.016039324812946412,"score_gpt":0.2561814956815597,"score_spread":0.24014217086861328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109491994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6387564,0.00006456122,0.3211624,0.0021813498,0.0005061991,0.00035822293,2.1738408e-7,0.0005875917,0.036383048],"genre_scores_gemma":[0.98182094,0.00003907105,0.016092584,0.0006265975,0.00006764647,0.000019454319,0.00000126767,0.000010640029,0.0013218056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990212,0.00014034031,0.00013638301,0.00030822196,0.00017813941,0.000215757],"domain_scores_gemma":[0.99886596,0.00023609141,0.000055578173,0.00063629646,0.00012515007,0.000080912025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042772136,0.00014270749,0.00012603322,0.00009301349,0.00034720375,0.00019948091,0.0004690951,0.000057417194,0.00008182205],"category_scores_gemma":[0.000051082585,0.00010022242,0.000036803205,0.0005920778,0.000036287587,0.00032511144,0.00016407446,0.00044249193,0.00016624366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002038443,0.00031648675,0.01625655,0.000029110743,0.00010845848,0.000034680714,0.0017783918,0.00041681156,0.32986227,0.2514983,0.008257092,0.391238],"study_design_scores_gemma":[0.0036161453,0.004046103,0.032260347,0.00031490924,0.000033821692,0.0004919159,0.00005603627,0.8338841,0.0751038,0.0003627268,0.048267156,0.0015628992],"about_ca_topic_score_codex":0.000008156664,"about_ca_topic_score_gemma":0.00027778913,"teacher_disagreement_score":0.8334673,"about_ca_system_score_codex":0.000025887719,"about_ca_system_score_gemma":0.00003414891,"threshold_uncertainty_score":0.4086952},"labels":[],"label_agreement":null},{"id":"W2109699934","doi":"10.1109/twc.2009.081470","title":"ML performance analysis of the decode-and-forward protocol in cooperative diversity networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Quadrature amplitude modulation; Relay; Cooperative diversity; QAM; Euclidean distance; Antenna diversity; Algorithm; Pairwise error probability; Diversity gain; Topology (electrical circuits); Mathematics; Bit error rate; Telecommunications; Fading; Decoding methods; Wireless; Artificial intelligence","score_opus":0.036463461545050355,"score_gpt":0.2917088078459298,"score_spread":0.2552453463008794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109699934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04228695,0.000054740853,0.9470866,0.0027335542,0.000053600113,0.0068331333,0.0000066808775,0.000078426965,0.0008663648],"genre_scores_gemma":[0.99524087,0.00076610467,0.0014013911,0.00034205266,0.0000026207522,0.0021757837,0.0000016872594,0.00000420232,0.00006526393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986249,0.0004291814,0.00036196463,0.00023051239,0.00017983258,0.00017361467],"domain_scores_gemma":[0.99699,0.00027292382,0.00014279374,0.0023620208,0.00017644034,0.000055819706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035377804,0.00014494808,0.0002633509,0.0003047766,0.0011663489,0.000055767214,0.002455391,0.00006786295,0.00001127711],"category_scores_gemma":[0.0000058302994,0.00011955786,0.00012764972,0.0029985982,0.00020202559,0.0003510036,0.0001122707,0.0004831926,0.0000014651931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005680896,0.0012283535,0.0071945908,0.000011093472,0.00036819247,3.9327827e-7,0.0051039658,0.5758913,0.0003038314,0.02572817,0.000055761826,0.38405752],"study_design_scores_gemma":[0.00038885535,0.00006904679,0.057159197,0.000057964746,0.00006734217,9.112554e-7,0.000037437218,0.94111216,0.00072108896,0.00003627056,0.00020676789,0.00014294925],"about_ca_topic_score_codex":0.000027582524,"about_ca_topic_score_gemma":0.0011935647,"teacher_disagreement_score":0.95295393,"about_ca_system_score_codex":0.00008274881,"about_ca_system_score_gemma":0.00005611785,"threshold_uncertainty_score":0.8970731},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03420949191589935,"score_gpt":0.27794404214119417,"score_spread":0.24373455022529483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109714708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026540035,0.00042341254,0.9696514,0.0018385901,0.00009045808,0.00029898758,0.0000011090269,0.000037815276,0.0011181707],"genre_scores_gemma":[0.96198636,0.0046522375,0.032977566,0.00032118324,0.000017445416,0.000017328766,0.000013597629,0.000008633646,0.0000056495683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816275,0.00046569348,0.0007647029,0.0001380581,0.00020593041,0.00026285372],"domain_scores_gemma":[0.9975587,0.00052753545,0.00041075615,0.00079419394,0.0006033962,0.00010540451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012277861,0.00015553723,0.00023728737,0.00058580906,0.00031469608,0.00013973568,0.00088790164,0.000089573856,0.000004036096],"category_scores_gemma":[0.00023015257,0.0001412172,0.000026386171,0.0017153777,0.0001282255,0.0011255866,0.00017171302,0.0008114254,0.000001160777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071377384,0.00013712015,0.0010456406,0.0000027484987,0.000020539035,0.000001948899,0.0023656252,0.9818156,0.00004780762,0.0028418878,0.00005824603,0.011591485],"study_design_scores_gemma":[0.0010631798,0.00018803035,0.006876793,0.0002626378,0.000005616404,0.000053422955,0.00029371298,0.99047667,0.0003398863,0.000063243104,0.00020398777,0.0001728206],"about_ca_topic_score_codex":0.0000181869,"about_ca_topic_score_gemma":0.0010451913,"teacher_disagreement_score":0.9366739,"about_ca_system_score_codex":0.00017959625,"about_ca_system_score_gemma":0.0001727322,"threshold_uncertainty_score":0.575867},"labels":[],"label_agreement":null},{"id":"W2109799347","doi":"10.1109/icc.2008.161","title":"Maximum Ratio Combining Precoding for Multi-Antenna Relay Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Precoding; Computer science; Transmission (telecommunications); Ergodic theory; Node (physics); Antenna (radio); Relay channel; Simple (philosophy); Computer network; Topology (electrical circuits); Electronic engineering; Telecommunications; MIMO; Mathematics; Engineering; Electrical engineering","score_opus":0.14619413017344862,"score_gpt":0.3113155172136646,"score_spread":0.165121387040216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109799347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029949858,0.0006703718,0.9922646,0.00045985795,0.0006733533,0.0003952971,7.0584565e-7,0.0002870729,0.002253721],"genre_scores_gemma":[0.8669391,0.00039209353,0.12813692,0.0002796104,0.00004822015,0.00009844299,0.000004174802,0.00001068435,0.004090738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989952,0.000101426274,0.00028263364,0.00027053698,0.000117249205,0.00023297059],"domain_scores_gemma":[0.9988485,0.00020580369,0.00008609227,0.00059322314,0.00019341371,0.000072983494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036282238,0.00011718788,0.00016711798,0.00007361423,0.00061127695,0.00014187761,0.00077367865,0.000042694057,0.000011245117],"category_scores_gemma":[0.000080588296,0.000104343795,0.00006218933,0.00025054388,0.00003269479,0.00042935778,0.00025737792,0.000110294844,0.000037202295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028447916,0.0004284888,0.006159883,0.00008017549,0.00013453506,0.000021159214,0.012136163,0.003669381,0.016834151,0.88991356,0.026877243,0.04371681],"study_design_scores_gemma":[0.00058107765,0.000044670225,0.00045370494,0.00003660488,0.0000020675734,0.000024829775,0.000053030057,0.9880469,0.00040020293,0.00003431175,0.01015863,0.00016399375],"about_ca_topic_score_codex":0.000006218963,"about_ca_topic_score_gemma":0.00001185959,"teacher_disagreement_score":0.9843775,"about_ca_system_score_codex":0.000041259966,"about_ca_system_score_gemma":0.000050804167,"threshold_uncertainty_score":0.470151},"labels":[],"label_agreement":null},{"id":"W2109818332","doi":"10.1109/cwit.2007.375690","title":"Space-Time Coded Cooperative Diversity with Multiple-Antenna Nodes","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Relay; Pairwise error probability; Computer science; Block code; Antenna diversity; Transmit diversity; Diversity gain; Monte Carlo method; Antenna (radio); Topology (electrical circuits); Computer network; Telecommunications; MIMO; Beamforming; Decoding methods; Mathematics; Fading; Statistics; Power (physics); Electrical engineering; Engineering; Physics","score_opus":0.03140862809108706,"score_gpt":0.2541511401381967,"score_spread":0.2227425120471096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109818332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044033516,0.000092703165,0.9341402,0.0012773747,0.000051032377,0.00017476347,9.68987e-7,0.0002709958,0.019958463],"genre_scores_gemma":[0.9562739,0.0000566976,0.039256115,0.00076918025,0.000021338867,0.0000021591823,0.000002747386,0.0000056720437,0.003612183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990078,0.00008328111,0.00013789545,0.000288743,0.00021191349,0.0002703469],"domain_scores_gemma":[0.99861765,0.00031072227,0.00005313304,0.00059004023,0.00030807822,0.000120380086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044854233,0.00014188001,0.00015500913,0.000080652724,0.0006687181,0.00011380721,0.00091025315,0.000036605714,0.00012201234],"category_scores_gemma":[0.000050832576,0.00010497804,0.000033652494,0.0005492759,0.00009982006,0.0004487766,0.001252067,0.00014836581,0.0001445394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061940023,0.0011713626,0.18302315,0.000023505154,0.0004890315,0.00023934392,0.027364526,0.0010331927,0.08002851,0.60165,0.01467147,0.08968651],"study_design_scores_gemma":[0.0040771975,0.00050927035,0.10121907,0.00011219249,0.000025263555,0.000055535522,0.00063608994,0.8464406,0.031641793,0.00021353511,0.0137326,0.0013368437],"about_ca_topic_score_codex":0.000026544321,"about_ca_topic_score_gemma":0.00046546484,"teacher_disagreement_score":0.9122404,"about_ca_system_score_codex":0.000051444164,"about_ca_system_score_gemma":0.00003706491,"threshold_uncertainty_score":0.5143306},"labels":[],"label_agreement":null},{"id":"W2109825376","doi":"10.1109/twc.2011.030311.100589","title":"Low Complexity Selection Cooperation Techniques Using Information Accumulation in Dual-Hop Relaying Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Relay; Hop (telecommunications); Computer science; Fading; Transmission (telecommunications); Signal-to-noise ratio (imaging); Algorithm; Outage probability; Decoding methods; Mathematics; Topology (electrical circuits); Computer network; Telecommunications; Physics; Combinatorics","score_opus":0.14475104643076067,"score_gpt":0.32792418716806687,"score_spread":0.1831731407373062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109825376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023052154,0.000044622782,0.9740866,0.00032161237,0.00020338662,0.00063026074,0.000004647363,0.0005217086,0.0011350482],"genre_scores_gemma":[0.9218973,0.0010594357,0.0764756,0.00030663167,0.000017279826,0.00017804162,0.000029133113,0.000018650178,0.000017913224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774945,0.0006492329,0.0007658896,0.00029270008,0.00022674169,0.00031601024],"domain_scores_gemma":[0.9972125,0.00019931364,0.00027444863,0.0017984131,0.0004231925,0.00009212874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006553089,0.00025778977,0.00024733652,0.0006230833,0.001224928,0.00022973208,0.001065521,0.00019132197,0.000040826046],"category_scores_gemma":[0.0000145394715,0.00029584533,0.00009208826,0.0019088178,0.00016446116,0.003119889,0.000049687398,0.0007873498,0.000027329059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012713108,0.002066844,0.00065999996,0.000050705454,0.00009147207,0.0000019726692,0.012724974,0.2077476,0.009693893,0.13235489,0.000109454486,0.63437104],"study_design_scores_gemma":[0.0003641823,0.00007034988,0.00093216595,0.00014376423,0.000013360216,0.000014292309,0.00008691256,0.9843888,0.013173038,0.00027161947,0.00021144493,0.00033001485],"about_ca_topic_score_codex":0.00021098916,"about_ca_topic_score_gemma":0.0012605322,"teacher_disagreement_score":0.89884514,"about_ca_system_score_codex":0.0003909222,"about_ca_system_score_gemma":0.00012450852,"threshold_uncertainty_score":0.9999494},"labels":[],"label_agreement":null},{"id":"W2109840139","doi":"10.1109/isit.2012.6284655","title":"Partial decode-forward for quantum relay channels","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Computer science; Quantum; Relay channel; Computer network; Telecommunications; Physics; Quantum mechanics","score_opus":0.09778072651569861,"score_gpt":0.33315767667611434,"score_spread":0.23537695016041574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109840139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080721284,0.0014999538,0.98668665,0.0035958816,0.0032611724,0.00060472783,0.000004852648,0.00032991782,0.0032096165],"genre_scores_gemma":[0.8947125,0.0011993084,0.098993205,0.0009960047,0.0008615456,0.00052316976,0.00004668653,0.000029550154,0.00263802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837685,0.00014188404,0.00037473498,0.00049916,0.0001796774,0.00042770113],"domain_scores_gemma":[0.9975407,0.00023110668,0.00017268924,0.0016675828,0.00022061555,0.0001673123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077626837,0.00025443578,0.00031455574,0.000091979564,0.00024178212,0.00032187335,0.0021782347,0.00021373222,0.00009731975],"category_scores_gemma":[0.00008258894,0.00022670388,0.00020912015,0.00014263278,0.000034486482,0.00025026288,0.003381074,0.0004141581,0.00011541177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011679809,0.0001133997,0.0000820275,0.000054672284,0.00007717634,6.991548e-7,0.0015528409,0.0024950027,0.000090790745,0.88353586,0.030176353,0.08180952],"study_design_scores_gemma":[0.00025356052,0.000032563337,0.00006896923,0.00006922602,0.000015696805,0.0000026723833,0.0000092294285,0.8035141,0.0011027233,0.0064640143,0.18802162,0.00044557895],"about_ca_topic_score_codex":0.0000057139437,"about_ca_topic_score_gemma":0.000014752933,"teacher_disagreement_score":0.8939053,"about_ca_system_score_codex":0.0000649181,"about_ca_system_score_gemma":0.00013207634,"threshold_uncertainty_score":0.92447156},"labels":[],"label_agreement":null},{"id":"W2109987104","doi":"10.1109/icc.2008.488","title":"Adaptive Random Network Coding in WiMAX","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; WiMAX; Linear network coding; Computer network; Network packet; Random access; Link adaptation; Coding (social sciences); Communication source; Wireless broadband; Wireless network; Distributed computing; Wireless; Channel (broadcasting); Fading; Telecommunications","score_opus":0.06415119283744383,"score_gpt":0.2654340821377891,"score_spread":0.20128288930034524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109987104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041595353,0.000732156,0.93010485,0.0008978083,0.00015651164,0.00014558426,7.5771986e-8,0.00014910492,0.063654356],"genre_scores_gemma":[0.954679,0.0011725737,0.042504236,0.0007588154,0.00005428689,0.00001313849,5.303793e-7,0.0000037605191,0.0008136211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918103,0.00014320479,0.00017363844,0.0001854472,0.00010534651,0.00021134502],"domain_scores_gemma":[0.9992667,0.0002030597,0.000033776018,0.00040016,0.00004902774,0.000047318525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029987286,0.00008052,0.00013434507,0.00005423692,0.00021035653,0.00003247871,0.00061595446,0.000025793417,0.00005391675],"category_scores_gemma":[0.00002600459,0.00007169416,0.00003348572,0.0006083675,0.000039064067,0.00029169273,0.00030861466,0.00013918428,0.00005475374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059853726,0.00010821419,0.008853901,0.0000022144366,0.000021580978,0.00006996696,0.0036452827,0.0077304984,0.0001668499,0.8558446,0.025863469,0.097633556],"study_design_scores_gemma":[0.0024354204,0.00006154922,0.019747755,0.000057846108,0.0000014153746,0.00004322934,0.000039232116,0.9582823,0.00022339163,0.002119375,0.016648337,0.0003401321],"about_ca_topic_score_codex":0.00000829604,"about_ca_topic_score_gemma":0.00009516127,"teacher_disagreement_score":0.9505518,"about_ca_system_score_codex":0.000035789057,"about_ca_system_score_gemma":0.000042706597,"threshold_uncertainty_score":0.29236028},"labels":[],"label_agreement":null},{"id":"W2110112500","doi":"10.1109/glocom.2010.5683569","title":"Cooperative Algorithm for the Global Planning Problem of UMTS Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tabu search; UMTS frequency bands; Computer science; Mathematical optimization; Network planning and design; Genetic algorithm; Algorithm; Computation; Core (optical fiber); Mathematics; Computer network","score_opus":0.031108640634598367,"score_gpt":0.30743335124471743,"score_spread":0.2763247106101191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110112500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002106223,0.00031588957,0.99229044,0.0011447717,0.00024354616,0.00033147095,0.0000019311237,0.00006317726,0.005398169],"genre_scores_gemma":[0.5260001,0.000089616005,0.47272575,0.0006376432,0.00012570902,0.00007084121,0.0000033537588,0.0000052609685,0.00034175103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935585,0.000045165536,0.00017795665,0.00016307356,0.00009337895,0.00016457458],"domain_scores_gemma":[0.99879485,0.00035167253,0.00006912424,0.00048383404,0.00025927136,0.0000412322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038007845,0.00008769688,0.000107687905,0.0000138458645,0.00028312003,0.000101073136,0.0010308208,0.000042470587,0.000021228705],"category_scores_gemma":[0.000022796648,0.000055039898,0.00004551513,0.0003351799,0.000072432034,0.00017217516,0.00031808933,0.0001633097,0.0000022578222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022448567,0.000024189696,0.00021758638,0.0000012582868,0.000021577596,2.2471795e-7,0.00028973055,0.002341968,0.00010392733,0.38665277,0.002234442,0.6081101],"study_design_scores_gemma":[0.00021492646,0.000044489312,0.000594194,0.000010234578,0.0000034832333,0.0000041564517,0.000028699696,0.98147434,0.00029256145,0.0006540419,0.016597332,0.00008156941],"about_ca_topic_score_codex":0.0000051925886,"about_ca_topic_score_gemma":0.0000645267,"teacher_disagreement_score":0.97913235,"about_ca_system_score_codex":0.0000113236,"about_ca_system_score_gemma":0.00005286062,"threshold_uncertainty_score":0.22444619},"labels":[],"label_agreement":null},{"id":"W2110233602","doi":"10.1109/tvt.2011.2178870","title":"Outage Analysis of Cooperative CDMA Systems in Nakagami- $m$ Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Nakagami distribution; Telecommunications link; Moment-generating function; Maximal-ratio combining; Code division multiple access; Signal-to-noise ratio (imaging); Cumulative distribution function; Electronic engineering; Base station; Computer science; Probability density function; Topology (electrical circuits); Algorithm; Mathematics; Engineering; Telecommunications; Statistics; Electrical engineering; Decoding methods","score_opus":0.04226158480910014,"score_gpt":0.26416940244635523,"score_spread":0.2219078176372551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110233602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11737427,0.0003564716,0.881033,0.00020733899,0.0002613012,0.0002243763,0.000004414489,0.00020016731,0.00033863186],"genre_scores_gemma":[0.9974296,0.0002813574,0.0020446763,0.000049399372,0.0000037238044,0.000094969975,0.0000012156545,0.000008995548,0.000086071654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986765,0.00017092416,0.00040279087,0.0003662517,0.0001429408,0.00024059771],"domain_scores_gemma":[0.9986855,0.000067321154,0.00011554673,0.00091595185,0.00017427768,0.000041419033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002812982,0.00016312824,0.00041741296,0.002017973,0.00013859624,0.000027018612,0.0009249738,0.0001908233,0.000032764183],"category_scores_gemma":[0.000009897085,0.0001596671,0.00012646666,0.0048535303,0.0001272204,0.00019986386,0.000013754921,0.00037685063,0.000016548103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052134717,0.0015567791,0.0010551679,0.000044156786,0.0024957326,0.00011611379,0.012650003,0.68197995,0.036590435,0.16311021,0.000028948209,0.10032034],"study_design_scores_gemma":[0.0005446876,0.0002588172,0.000547155,0.00009900197,0.00015819554,0.0000129793825,0.00045134238,0.9167748,0.080245554,0.00017748744,0.00038239642,0.00034758696],"about_ca_topic_score_codex":0.000046363137,"about_ca_topic_score_gemma":0.00018467371,"teacher_disagreement_score":0.8800553,"about_ca_system_score_codex":0.00007708224,"about_ca_system_score_gemma":0.000034958313,"threshold_uncertainty_score":0.65110356},"labels":[],"label_agreement":null},{"id":"W2110238232","doi":"10.1109/isit.2007.4557132","title":"Delay-Throughput Analysis in Decentralized Single-Hop Wireless Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Wireless network; Throughput; Hop (telecommunications); Computer science; Transmission (telecommunications); Transmission delay; Network delay; Computer network; Code rate; Topology (electrical circuits); Wireless; Mathematics; Algorithm; Network packet; Telecommunications; Combinatorics; Decoding methods","score_opus":0.0362917167169893,"score_gpt":0.2916152048644915,"score_spread":0.25532348814750216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110238232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056268316,0.0005338827,0.935817,0.0005051439,0.000119242555,0.000097733595,1.00127245e-7,0.00014430707,0.0065142848],"genre_scores_gemma":[0.9737775,0.00068533374,0.024360098,0.0009231407,0.000025951938,0.0000037310424,0.000005230002,0.0000059916733,0.00021305027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985371,0.00013758366,0.0003924069,0.00032929564,0.00017543424,0.00042813763],"domain_scores_gemma":[0.99867344,0.00025337015,0.000075168966,0.00078568363,0.00010023759,0.00011208968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008327276,0.00013498387,0.00024243454,0.00029327595,0.00011899864,0.00014880107,0.0009721818,0.00007147272,0.0001029616],"category_scores_gemma":[0.00002018264,0.0001248969,0.000107385444,0.003697072,0.000039033883,0.00032165932,0.00035795948,0.00018630413,0.000015733975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032743206,0.00040965888,0.05454039,0.000003026828,0.000260438,0.00005972122,0.0015418115,0.017208137,0.00074072916,0.22323523,0.0008708162,0.7010973],"study_design_scores_gemma":[0.00048235414,0.000023423432,0.023466595,0.000012149309,0.000023108065,0.0000034953734,0.000037800575,0.9707028,0.00040867252,0.0001266782,0.00446654,0.0002463463],"about_ca_topic_score_codex":0.00003971147,"about_ca_topic_score_gemma":0.0054314104,"teacher_disagreement_score":0.9534947,"about_ca_system_score_codex":0.00010906208,"about_ca_system_score_gemma":0.000022527378,"threshold_uncertainty_score":0.5093148},"labels":[],"label_agreement":null},{"id":"W2110537587","doi":"10.1109/icc.2009.5199311","title":"Performance Analysis of Multi-Branch Decode-and-Forward Cooperative Diversity Networks over Nakagami-m Fading Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Nakagami distribution; Maximal-ratio combining; Fading; Moment-generating function; Probability density function; Computer science; Cooperative diversity; Signal-to-noise ratio (imaging); Diversity combining; Closed-form expression; Expression (computer science); Topology (electrical circuits); Channel (broadcasting); Outage probability; Algorithm; Cumulative distribution function; Node (physics); Statistics; Mathematics; Telecommunications; Physics; Combinatorics","score_opus":0.036346026532022756,"score_gpt":0.27688325749823556,"score_spread":0.2405372309662128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110537587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36597106,0.00028964836,0.6324817,0.00017207667,0.00008597293,0.00010460861,9.000603e-7,0.00006561235,0.0008284083],"genre_scores_gemma":[0.993631,0.0015064019,0.003831817,0.0006717911,0.000020057212,0.0000026309644,0.00000414092,0.0000032076582,0.00032892372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988632,0.00011131488,0.0002676657,0.0003335695,0.00018058675,0.00024363693],"domain_scores_gemma":[0.9989319,0.000114799026,0.0001118427,0.0005299626,0.00021024108,0.00010129497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037000392,0.00016222971,0.00035284593,0.00026700605,0.00052262685,0.0000871044,0.00076450896,0.00006210628,0.00005115342],"category_scores_gemma":[0.000019604671,0.00014337157,0.000109324305,0.0017295544,0.00006085744,0.0006132381,0.0006490988,0.0001597067,0.000002575282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004152281,0.00031227764,0.09935898,0.000011981166,0.0010154101,0.0000034036916,0.010431243,0.5807283,0.0009440684,0.021545734,0.00068073935,0.28492633],"study_design_scores_gemma":[0.00030638117,0.00006403795,0.11089857,0.0000157199,0.00006340378,6.701295e-7,0.000014348231,0.88794166,0.00043899572,0.000010746821,0.000084285304,0.00016119696],"about_ca_topic_score_codex":0.000011511342,"about_ca_topic_score_gemma":0.000058148256,"teacher_disagreement_score":0.6286499,"about_ca_system_score_codex":0.000039032584,"about_ca_system_score_gemma":0.000018022278,"threshold_uncertainty_score":0.58465225},"labels":[],"label_agreement":null},{"id":"W2110674033","doi":"10.1109/lcn.2014.6925821","title":"Optimal rate allocation and scheduling in cooperative streaming","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Mobile device; Cellular network; Session (web analytics); Wireless; Real-time computing; Distributed computing; Telecommunications; Engineering; Operating system","score_opus":0.026191970068456676,"score_gpt":0.27312114986525443,"score_spread":0.24692917979679777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110674033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24527442,0.000087651606,0.74935186,0.0012181173,0.00003169685,0.00006657796,3.8692434e-8,0.000051359722,0.0039182934],"genre_scores_gemma":[0.93860143,0.00013005653,0.060685176,0.00036475091,0.000014160233,0.0000076270253,0.0000011256526,0.0000027157014,0.00019295067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993508,0.00017913352,0.000126792,0.00018477344,0.00004911466,0.00010940759],"domain_scores_gemma":[0.99947745,0.00015124622,0.000026117157,0.00024109715,0.000066947665,0.000037168506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004993694,0.00006715574,0.00008038162,0.00006394174,0.00010781746,0.00013538069,0.00025190407,0.000021902473,0.0000084533895],"category_scores_gemma":[0.000089682275,0.000060659324,0.000007931312,0.00024850215,0.000024029989,0.00036970843,0.00021105209,0.000092821356,0.000009194849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002869681,0.000029541916,0.0013503573,0.0000034126438,0.0000046736327,6.15798e-7,0.0013880997,0.03104606,0.005354044,0.7685558,0.000020034917,0.19224447],"study_design_scores_gemma":[0.00022608099,0.00003276308,0.005513151,0.000020734757,5.4727343e-7,0.0000012734339,0.000056968496,0.9920594,0.0014365843,0.00013879078,0.00042595997,0.00008770775],"about_ca_topic_score_codex":0.000005485073,"about_ca_topic_score_gemma":0.00008006135,"teacher_disagreement_score":0.9610134,"about_ca_system_score_codex":0.000015869478,"about_ca_system_score_gemma":0.000019391244,"threshold_uncertainty_score":0.24736154},"labels":[],"label_agreement":null},{"id":"W2110743031","doi":"10.1109/wcnc.2010.5506305","title":"One-Bit Feedback Selection Schemes for Power-Efficient Multiuser and Multirelay Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Rayleigh fading; Selection (genetic algorithm); Outage probability; Hop (telecommunications); Dual (grammatical number); Transmitter power output; Transmission (telecommunications); Power (physics); Computer network; Fading; Telecommunications; Channel (broadcasting); Transmitter","score_opus":0.03043829083928951,"score_gpt":0.2765658123577506,"score_spread":0.24612752151846107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110743031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18587254,0.0002690381,0.80987847,0.00084923964,0.0005882252,0.0005205525,8.4906793e-7,0.0002355618,0.0017855131],"genre_scores_gemma":[0.940558,0.000035818244,0.058150146,0.00013046357,0.000042553733,0.000055140445,0.0000012204196,0.0000074779446,0.0010191523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992254,0.000041282747,0.00017068088,0.00027275528,0.00010912409,0.00018076214],"domain_scores_gemma":[0.99910235,0.00016130916,0.000054845037,0.00037966052,0.000221787,0.00008007277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032418614,0.00009812064,0.00011351661,0.00006564926,0.00029372537,0.0002492031,0.00037089412,0.00006319695,0.00001884518],"category_scores_gemma":[0.00006907182,0.00008928385,0.00003122653,0.00021204099,0.000035597717,0.00017168629,0.00020037172,0.00016267574,0.00002012644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019358711,0.0003307663,0.0016375367,0.000036743557,0.00005153888,2.7675406e-7,0.0015343111,0.0008125182,0.12953207,0.7397412,0.0024059038,0.123897776],"study_design_scores_gemma":[0.00050164945,0.000049141723,0.0018895636,0.000016642298,0.0000030232725,0.0000047562467,0.00002814149,0.9366426,0.004438057,0.000024713558,0.056241963,0.00015974171],"about_ca_topic_score_codex":0.0000114565,"about_ca_topic_score_gemma":0.0000655241,"teacher_disagreement_score":0.9358301,"about_ca_system_score_codex":0.00001758988,"about_ca_system_score_gemma":0.000026864527,"threshold_uncertainty_score":0.36408898},"labels":[],"label_agreement":null},{"id":"W2110789418","doi":"10.1109/tvt.2009.2029980","title":"Performance Analysis of TDMA Relay Protocols Over Nakagami-$m$ Fading","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Nakagami distribution; Relay; Algorithm; Phase-shift keying; Quadrature amplitude modulation; Rayleigh fading; QAM; Maximal-ratio combining; Topology (electrical circuits); Time division multiple access; Computer science; Independent and identically distributed random variables; Telecommunications; Mathematics; Statistics; Bit error rate; Physics; Combinatorics; Random variable; Decoding methods","score_opus":0.02276005109920705,"score_gpt":0.2895012370451625,"score_spread":0.2667411859459555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110789418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19138506,0.000050678747,0.8056178,0.0010522137,0.000049315855,0.0011434942,0.0000016307129,0.00033028392,0.00036952374],"genre_scores_gemma":[0.9919309,0.00015780324,0.0071164602,0.0001829072,0.000004484894,0.0004991366,8.9224733e-7,0.0000059070067,0.00010148882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885833,0.0000681315,0.00032782266,0.00032712222,0.00019379587,0.00022480071],"domain_scores_gemma":[0.9984859,0.000043424563,0.00012170982,0.0011747233,0.0001339231,0.000040294406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020602292,0.00014905102,0.00030635195,0.0011938771,0.00023478274,0.000028984035,0.000979836,0.00017229722,0.000037214664],"category_scores_gemma":[0.000006716723,0.00014383091,0.00016774303,0.004125481,0.000085987325,0.0002318906,0.0000074017435,0.00037905065,0.000013836286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028768172,0.00059278536,0.0006870681,0.000014917148,0.00059505034,0.000009834088,0.00042279993,0.18084246,0.057430454,0.016741356,0.00005781681,0.74257666],"study_design_scores_gemma":[0.0005313103,0.00054192095,0.0059915865,0.000099276775,0.00015400257,0.000011877844,0.000017239594,0.8646037,0.12490993,0.0001684649,0.0026632533,0.0003074711],"about_ca_topic_score_codex":0.0000011237378,"about_ca_topic_score_gemma":0.000011822398,"teacher_disagreement_score":0.8005459,"about_ca_system_score_codex":0.000064525644,"about_ca_system_score_gemma":0.00003460788,"threshold_uncertainty_score":0.58652544},"labels":[],"label_agreement":null},{"id":"W2110863679","doi":"10.1109/icc.2008.701","title":"Ergodic Capacity Analysis of Wireless Relaying Systems In Rayleigh Fading","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ergodic theory; Rayleigh fading; Fading; Wireless; Computer science; Channel state information; Channel (broadcasting); Topology (electrical circuits); Electronic engineering; Telecommunications; Mathematics; Engineering; Electrical engineering; Mathematical analysis","score_opus":0.07549297563609439,"score_gpt":0.26758243573886303,"score_spread":0.19208946010276864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110863679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7304956,0.0003642244,0.2648037,0.000068195746,0.00006924346,0.00006474629,3.246756e-7,0.000053247968,0.00408075],"genre_scores_gemma":[0.99666375,0.0004894483,0.0026319632,0.000049484748,0.0000072972916,0.000007351816,0.0000011307854,0.0000029183168,0.00014665666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989473,0.00019206529,0.0003356819,0.00020312794,0.00017090577,0.00015090525],"domain_scores_gemma":[0.9989926,0.0001786452,0.00008989627,0.00060050964,0.00009495209,0.000043345706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004105521,0.00008063411,0.0002841708,0.00045990123,0.00013440101,0.000029739867,0.00066910614,0.00003775817,0.000015366777],"category_scores_gemma":[0.00002726164,0.00007362637,0.00007682277,0.0027452684,0.000047896014,0.00025627555,0.00020478424,0.00012524315,0.00000467343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008333847,0.00023049081,0.3519581,0.000036104855,0.0005174031,0.000029090797,0.015097724,0.06979166,0.01521928,0.5335913,0.00042817206,0.013092392],"study_design_scores_gemma":[0.00016662736,0.000011237621,0.045917857,0.0000346927,0.000017924936,0.000005666429,0.000073583076,0.95271677,0.0007125938,0.000014662491,0.00020363611,0.00012472617],"about_ca_topic_score_codex":0.00019655784,"about_ca_topic_score_gemma":0.00022843464,"teacher_disagreement_score":0.88292515,"about_ca_system_score_codex":0.00006253402,"about_ca_system_score_gemma":0.00003099942,"threshold_uncertainty_score":0.30023962},"labels":[],"label_agreement":null},{"id":"W2110900500","doi":"10.1109/icsens.2010.5690001","title":"Energy efficiency and packet error rate in wireless sensor networks with cooperative relay","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Relay; Computer science; Frequency-shift keying; Wireless sensor network; Network packet; Efficient energy use; Keying; Energy consumption; Transmission (telecommunications); Bit error rate; Computer network; Power control; Wireless; Power (physics); Control theory (sociology); Telecommunications; Demodulation; Engineering; Electrical engineering; Channel (broadcasting)","score_opus":0.015729208221108775,"score_gpt":0.24622101079616474,"score_spread":0.23049180257505597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110900500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28842542,0.00012578149,0.70464903,0.0016605154,0.00016670807,0.0001338052,3.613581e-7,0.00011306775,0.004725297],"genre_scores_gemma":[0.99108183,0.0002966124,0.0068586217,0.0007926848,0.000034100147,0.000019883964,0.0000021350618,0.000009032404,0.00090508733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887896,0.00021365967,0.00018893363,0.00036112216,0.00009816214,0.00025916644],"domain_scores_gemma":[0.9989207,0.00022827974,0.000053646316,0.00056208455,0.00013460076,0.00010070326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038990553,0.00015717605,0.00017392213,0.000085969456,0.0002008586,0.00017690135,0.00049633643,0.00006750563,0.000035692025],"category_scores_gemma":[0.000020343823,0.00011333582,0.000015206199,0.0006674662,0.00013449701,0.00029358087,0.00029014307,0.0003472055,0.000004533878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072181036,0.00033996085,0.011279464,0.000007697458,0.000037799633,0.00007367501,0.0033434231,0.016302649,0.01142392,0.8371049,0.0012579983,0.118756324],"study_design_scores_gemma":[0.0005612175,0.000097249394,0.0040259096,0.00002425232,0.0000017645064,0.00001832579,0.000054280452,0.99174875,0.0010659855,0.000029681863,0.0021296744,0.00024292529],"about_ca_topic_score_codex":0.00002296646,"about_ca_topic_score_gemma":0.00263636,"teacher_disagreement_score":0.9754461,"about_ca_system_score_codex":0.000013696802,"about_ca_system_score_gemma":0.000058035923,"threshold_uncertainty_score":0.46217006},"labels":[],"label_agreement":null},{"id":"W2111049732","doi":"10.1145/1023783.1023790","title":"A performance comparison of dynamic channel and ressource allocation protocols for mobile cellular networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Channel allocation schemes; Computer network; Resource allocation; Bandwidth (computing); Channel (broadcasting); Blocking (statistics); Cellular network; Interference (communication); Distributed computing; Bandwidth allocation; Wireless; Telecommunications","score_opus":0.03942844718573525,"score_gpt":0.32157661831634077,"score_spread":0.28214817113060553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111049732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06755775,0.00024940108,0.92672527,0.00021926001,0.000025255884,0.0049596983,2.7786055e-7,0.00005734508,0.00020575657],"genre_scores_gemma":[0.9776733,0.00009855805,0.018200194,0.00005570585,0.000012069927,0.0038622029,0.0000046313376,0.000005338549,0.000088026565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935204,0.000029919138,0.00022323978,0.00017957675,0.000083159735,0.00013206385],"domain_scores_gemma":[0.9992788,0.000051675066,0.000103482926,0.00040012636,0.00012818418,0.000037735572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000246133,0.00008144262,0.00014219666,0.0000435066,0.00016128278,0.000045851786,0.00041416948,0.00003837122,0.0000017993094],"category_scores_gemma":[0.0000094169745,0.00007345957,0.000023989054,0.0002029499,0.000042179887,0.00019470057,0.00017045798,0.00007172466,0.0000010422708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089043206,0.00060839666,0.001073002,0.0002561845,0.000041978685,2.789843e-7,0.010979028,0.3031837,0.014030178,0.076121345,0.00024431368,0.5933725],"study_design_scores_gemma":[0.00050973915,0.00024065205,0.0004491976,0.00008287559,0.0000020559444,7.1854106e-7,0.000052181716,0.9926848,0.0049890885,0.000123177,0.0007745531,0.00009099314],"about_ca_topic_score_codex":0.0000020205823,"about_ca_topic_score_gemma":0.0000128796155,"teacher_disagreement_score":0.91011554,"about_ca_system_score_codex":0.000028736204,"about_ca_system_score_gemma":0.00002505213,"threshold_uncertainty_score":0.2995594},"labels":[],"label_agreement":null},{"id":"W2111416419","doi":"10.1109/icc.2007.920","title":"Closed-Form Expressions for the Outage and Error Probabilities of Decode-and-Forward Relaying in Dissimilar Rayleigh Fading Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Fading; Rayleigh fading; Computer science; Outage probability; Probability of error; Wireless; Computer network; Channel (broadcasting); Electronic engineering; Telecommunications; Topology (electrical circuits); Algorithm; Engineering; Electrical engineering; Power (physics); Physics","score_opus":0.05793018137771416,"score_gpt":0.31830420976002544,"score_spread":0.2603740283823113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111416419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2656186,0.0011849309,0.7289693,0.0020046625,0.00012259808,0.0006391532,0.0000018148136,0.00005428893,0.0014046977],"genre_scores_gemma":[0.9761605,0.00032860518,0.022956284,0.00015698376,0.000017540666,0.000042775853,6.8412567e-7,0.0000057860543,0.00033084207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915344,0.000041627252,0.00029941674,0.0002008256,0.00009690866,0.00020778715],"domain_scores_gemma":[0.9982887,0.0011385562,0.00007357027,0.00038370534,0.00006110423,0.0000543947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011461688,0.000100618396,0.00015304572,0.00008990881,0.0002908257,0.00006829828,0.00043178108,0.000041313793,0.0000063084653],"category_scores_gemma":[0.00016111515,0.000064960754,0.000036749927,0.00020140702,0.00009088854,0.0003042305,0.00044282267,0.000114535316,2.4791805e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007602608,0.00013452815,0.014285193,0.00015333075,0.000050580147,0.0000024164383,0.06701817,0.0008911683,0.0055769864,0.63962644,0.00041607555,0.2717691],"study_design_scores_gemma":[0.002637628,0.00030678255,0.03911192,0.000736971,0.000030050414,0.000015742327,0.011227096,0.8758276,0.020543857,0.03629026,0.012413758,0.0008583347],"about_ca_topic_score_codex":0.0000083767545,"about_ca_topic_score_gemma":0.00014389648,"teacher_disagreement_score":0.87493646,"about_ca_system_score_codex":0.000021428825,"about_ca_system_score_gemma":0.000019686608,"threshold_uncertainty_score":0.26490226},"labels":[],"label_agreement":null},{"id":"W2111437890","doi":"10.1109/ccece.2011.6030513","title":"Novel techniques in cooperative wireless networks using network coding","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Decoding methods; Linear network coding; Relay; Redundancy (engineering); Encoder; Coding (social sciences); Computer network; Coding gain; Wireless network; Wireless; Relay channel; Algorithm; Power (physics); Telecommunications; Mathematics","score_opus":0.09788736845140115,"score_gpt":0.2949845105243695,"score_spread":0.19709714207296836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111437890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031932269,0.00023210247,0.9773899,0.00008127045,0.00016793792,0.00023193164,1.697338e-7,0.00027218636,0.018431291],"genre_scores_gemma":[0.80762625,0.000367863,0.19113697,0.00065648713,0.00007966487,0.000020879466,0.0000010931428,0.000011582272,0.00009918781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986672,0.00014788062,0.0003366982,0.00034214868,0.00011447938,0.00039158954],"domain_scores_gemma":[0.9989805,0.00010040938,0.000087460394,0.0006130354,0.00014235331,0.00007621753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005858922,0.00017739473,0.00022357132,0.000106050975,0.00024741545,0.000115392584,0.0010303084,0.00008547893,0.0000623578],"category_scores_gemma":[0.0000160846,0.00016386103,0.000041775198,0.0010942728,0.00006492965,0.0005765505,0.0006785458,0.00029393059,0.0000053639583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017119986,0.00022132685,0.0043695383,0.000004934406,0.000027459722,0.000014378495,0.0022937465,0.008898421,0.0049228636,0.8935512,0.00072877377,0.084950276],"study_design_scores_gemma":[0.00020892723,0.000038285947,0.0014172945,0.00011575284,0.000002394018,0.000014504163,0.000041278097,0.9939914,0.0030959344,0.00024018496,0.0005441073,0.00028995652],"about_ca_topic_score_codex":0.00006184098,"about_ca_topic_score_gemma":0.00031238454,"teacher_disagreement_score":0.98509294,"about_ca_system_score_codex":0.00008506462,"about_ca_system_score_gemma":0.000059091795,"threshold_uncertainty_score":0.66820586},"labels":[],"label_agreement":null},{"id":"W2111475688","doi":"10.1109/glocom.2011.6133701","title":"Interference-Controlled Load Sharing with Femtocell Relay for Macrocells in Cellular Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Femtocell; Macrocell; Computer network; Computer science; Backhaul (telecommunications); Quality of service; Base station; Relay; Wireless; Cellular network; Telecommunications","score_opus":0.05642555651758458,"score_gpt":0.2461276785476959,"score_spread":0.18970212203011133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111475688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011097553,0.000434044,0.95130605,0.00013658681,0.00010748784,0.00061742775,1.3088099e-7,0.00011181067,0.03618889],"genre_scores_gemma":[0.95778114,0.00017260663,0.038685292,0.00030497846,0.000027100492,0.00013263826,0.0000011161209,0.000011403262,0.0028837554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881023,0.00005824198,0.00031524728,0.0003921349,0.000104727835,0.00031939996],"domain_scores_gemma":[0.99883676,0.00013455379,0.00009236156,0.00070176175,0.00015926697,0.00007531885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056508253,0.00016397815,0.0002711813,0.000086391534,0.00010938115,0.00012052975,0.0013148757,0.000058295507,0.00011492515],"category_scores_gemma":[0.000019796797,0.00012256575,0.00006228163,0.00035864222,0.0000321677,0.0002884033,0.00040609026,0.00019537058,0.000019498028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00321423,0.0013058608,0.030206533,0.00009085571,0.0002927015,0.00007870182,0.024210354,0.009996768,0.004788125,0.7836964,0.003800588,0.13831887],"study_design_scores_gemma":[0.0037588573,0.00019165147,0.00040462447,0.0000877346,0.0000065845134,0.0000025616653,0.00005093042,0.99173343,0.0022121076,0.0006335588,0.00065611274,0.00026187152],"about_ca_topic_score_codex":0.000025965348,"about_ca_topic_score_gemma":0.000491219,"teacher_disagreement_score":0.98173666,"about_ca_system_score_codex":0.00006506268,"about_ca_system_score_gemma":0.000057219822,"threshold_uncertainty_score":0.49980858},"labels":[],"label_agreement":null},{"id":"W2111779131","doi":"10.1109/vetecs.2009.5073774","title":"Performance Analysis of Amplify-and-Forward Cooperative Networks with Relay Selection over Rayleigh Fading Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Rayleigh fading; Relay; Moment-generating function; Probability density function; Fading; Selection (genetic algorithm); Cumulative distribution function; Computer science; Diversity gain; Diversity combining; Outage probability; Maximal-ratio combining; Cooperative diversity; Topology (electrical circuits); Function (biology); Algorithm; Moment (physics); Mathematics; Telecommunications; Statistics; Channel (broadcasting); Physics; Artificial intelligence; Power (physics); Combinatorics","score_opus":0.01744196788168578,"score_gpt":0.25526083813850936,"score_spread":0.23781887025682358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111779131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28854656,0.0001252516,0.70832413,0.00021463542,0.00003131071,0.0000840961,2.1778122e-7,0.00006781304,0.0026059432],"genre_scores_gemma":[0.99252963,0.00069329434,0.006072807,0.00038767725,0.000022211825,0.000006139091,0.0000046342475,0.0000036879662,0.00027991828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915993,0.00007982405,0.00020090975,0.00024559244,0.00014103267,0.00017271136],"domain_scores_gemma":[0.999284,0.00008441827,0.00009897144,0.00030635472,0.00016763227,0.00005858099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026176593,0.00011691606,0.00022022163,0.00021635764,0.00023373829,0.00009548796,0.00030060965,0.000048643058,0.000053982167],"category_scores_gemma":[0.000010020228,0.000091382004,0.000041073643,0.0021222378,0.000038685685,0.00045761545,0.0000871327,0.00015481302,0.0000013270414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003438306,0.000050630955,0.0091853645,0.0000030063961,0.00033906812,6.104188e-7,0.0012667425,0.8972127,0.00049718725,0.054109067,0.00024605045,0.03705521],"study_design_scores_gemma":[0.00019633537,0.00022614887,0.02960252,0.00002001939,0.00006185233,0.000002807909,0.000013551299,0.96866816,0.00084182067,0.0000053387857,0.00023327404,0.0001281608],"about_ca_topic_score_codex":0.000005541389,"about_ca_topic_score_gemma":0.00003859505,"teacher_disagreement_score":0.70398307,"about_ca_system_score_codex":0.000025383628,"about_ca_system_score_gemma":0.000023272127,"threshold_uncertainty_score":0.372645},"labels":[],"label_agreement":null},{"id":"W2111914658","doi":"10.1109/isit.2006.261959","title":"On Rateless Coding over Fading Channels with Delay Constraints","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Computer science; Computer network; Channel (broadcasting); Coding (social sciences); Throughput; Wireless; Decoding methods; Algorithm; Telecommunications; Mathematics; Statistics","score_opus":0.026257355555290494,"score_gpt":0.2599243375499993,"score_spread":0.23366698199470878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111914658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048697587,0.000037536123,0.88125074,0.0004652648,0.00012569065,0.00011090015,4.0828832e-7,0.00018164978,0.06913022],"genre_scores_gemma":[0.99312687,0.000020695677,0.005163315,0.00067268976,0.000044057422,0.000013989011,0.00000200115,0.000006693408,0.0009497117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991896,0.00006425773,0.00013898598,0.0002388266,0.00015557009,0.00021274119],"domain_scores_gemma":[0.9992753,0.0001531181,0.00004944853,0.0004027992,0.00007239139,0.00004690404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017909263,0.00011687544,0.000113168535,0.000077746474,0.00023067325,0.0002170596,0.0005010039,0.000027948205,0.0001878076],"category_scores_gemma":[0.00000805116,0.000088848225,0.000024336703,0.00033161114,0.000067117006,0.0002522577,0.0001349131,0.00011894907,0.000044826906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042589827,0.000032005333,0.00019219695,0.0000016034311,0.00000674085,0.0000117940635,0.000115146686,0.0025056442,0.00058798277,0.9791115,0.002000436,0.015430709],"study_design_scores_gemma":[0.0033764832,0.0004328981,0.005150936,0.000438613,0.0000122566535,0.000141204,0.000098851604,0.932812,0.030644845,0.010482641,0.014937704,0.0014716208],"about_ca_topic_score_codex":0.000007273002,"about_ca_topic_score_gemma":0.00003387203,"teacher_disagreement_score":0.9686288,"about_ca_system_score_codex":0.000039194016,"about_ca_system_score_gemma":0.00003088398,"threshold_uncertainty_score":0.36231256},"labels":[],"label_agreement":null},{"id":"W2111917392","doi":"10.1109/twc.2011.030911.100769","title":"Outage Probability and Optimum Combining for Time Division Broadcast Protocol","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Relay; Broadcasting (networking); Protocol (science); Upper and lower bounds; Outage probability; Computer network; Channel (broadcasting); Multiplexing; Signal-to-noise ratio (imaging); Division (mathematics); Terminal (telecommunication); Topology (electrical circuits); Fading; Telecommunications; Mathematics","score_opus":0.09155401629247627,"score_gpt":0.3142755569233702,"score_spread":0.22272154063089394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111917392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012671717,0.00002984638,0.9783547,0.0008404723,0.00006649394,0.017188465,0.000015441381,0.0003219203,0.0019154674],"genre_scores_gemma":[0.8165669,0.00011222869,0.13993002,0.00015527345,0.0000058103037,0.042913876,0.0000054080165,0.000022093938,0.0002884038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984808,0.00033290876,0.00040628613,0.0003829507,0.00014526384,0.00025180014],"domain_scores_gemma":[0.9961247,0.00047715538,0.00013636099,0.0028947005,0.0002381371,0.00012896777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051325234,0.00020676799,0.00022843851,0.00014266468,0.0012672404,0.00014128706,0.001992686,0.000087565015,0.00004229268],"category_scores_gemma":[0.000012994403,0.00020551523,0.000101913196,0.00040894063,0.00024938674,0.00052920636,0.00007568209,0.00036106742,0.00003590009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009474088,0.0026024804,0.00010814684,0.00007890226,0.000104118226,6.4314514e-7,0.008581815,0.000643321,0.004417813,0.07784223,0.00023548023,0.9052903],"study_design_scores_gemma":[0.002793538,0.0007594319,0.0010822269,0.00029496223,0.000041430172,0.000013804013,0.00011116518,0.9659306,0.010716578,0.0049884957,0.012395612,0.0008721713],"about_ca_topic_score_codex":0.00001102132,"about_ca_topic_score_gemma":0.00003928181,"teacher_disagreement_score":0.96528727,"about_ca_system_score_codex":0.00006315074,"about_ca_system_score_gemma":0.00006995736,"threshold_uncertainty_score":0.97467166},"labels":[],"label_agreement":null},{"id":"W2111960598","doi":"10.1109/wcnc.2011.5779318","title":"Amplify-and-forward partial relay selection with feedback delay","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Selection (genetic algorithm); Channel (broadcasting); Relay channel; Control theory (sociology); Computer science; Signal-to-noise ratio (imaging); Channel state information; Bit error rate; SIGNAL (programming language); Outage probability; Noise (video); Telecommunications; Fading; Power (physics); Wireless; Physics; Artificial intelligence","score_opus":0.04642730755612515,"score_gpt":0.2490173489494301,"score_spread":0.20259004139330494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111960598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035930645,0.00008778217,0.935252,0.0004149279,0.000065251574,0.00010430275,1.1027244e-7,0.00022043874,0.027924526],"genre_scores_gemma":[0.9264641,0.00014763307,0.072024025,0.00039300832,0.000025131028,0.0000128826705,6.6983387e-7,0.0000051412353,0.0009274084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993838,0.00006725293,0.00010954727,0.0002028244,0.000089281704,0.00014728612],"domain_scores_gemma":[0.9994806,0.000030410694,0.00003630635,0.00030318624,0.0000757346,0.000073748764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016271422,0.00008262171,0.00007868034,0.00004003281,0.00018442479,0.00007284134,0.00031420813,0.000033183205,0.00013469368],"category_scores_gemma":[0.000007735814,0.00006046071,0.000014256726,0.00027219896,0.00003793527,0.00032874756,0.00017014524,0.00012005926,0.000059122387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006340942,0.00013353559,0.017228326,0.000005934506,0.0000656614,0.000005510792,0.004767141,0.00013547516,0.0007249443,0.7815362,0.004095623,0.19123821],"study_design_scores_gemma":[0.002514265,0.0014948294,0.04723835,0.00008638459,0.00004636353,0.00035278205,0.00024256554,0.7806692,0.021563346,0.0014764406,0.14289817,0.0014172953],"about_ca_topic_score_codex":0.000018055478,"about_ca_topic_score_gemma":0.00010871657,"teacher_disagreement_score":0.89053345,"about_ca_system_score_codex":0.000015367814,"about_ca_system_score_gemma":0.000027551045,"threshold_uncertainty_score":0.24655162},"labels":[],"label_agreement":null},{"id":"W2112125542","doi":"10.1109/isit.2012.6284221","title":"Joint optimization of the transmit covariance and the relay precoder in general Gaussian amplify-and-forward relay channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Karush–Kuhn–Tucker conditions; Covariance; Gaussian; Computer science; Optimization problem; Control theory (sociology); Relay channel; Precoding; Mathematical optimization; Mathematics; Topology (electrical circuits); Algorithm; MIMO; Telecommunications; Beamforming; Statistics; Artificial intelligence; Power (physics); Physics","score_opus":0.03064440415614699,"score_gpt":0.2472508820063783,"score_spread":0.2166064778502313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112125542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008539646,0.0015325551,0.9763063,0.010007213,0.00016335832,0.00033564103,5.08809e-7,0.00002328366,0.0030914843],"genre_scores_gemma":[0.95553017,0.0014657606,0.041444454,0.00073254254,0.000031832882,0.000024619676,5.4866445e-7,0.0000050021818,0.00076506863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990671,0.0003216731,0.00022501944,0.00013369802,0.00010133992,0.00015114114],"domain_scores_gemma":[0.99936205,0.000111540976,0.000074946794,0.00037685785,0.000034394747,0.000040207542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008335277,0.000082348,0.00013200832,0.000033377175,0.00015108024,0.000059328035,0.00037362069,0.000042094944,0.000023515988],"category_scores_gemma":[0.00003594869,0.00004363329,0.000028992376,0.00027533362,0.00011949564,0.00030916042,0.00023558905,0.00015220519,0.0000010330444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028506636,0.000070533446,0.0023482472,0.00001516744,0.000027148562,1.4380169e-7,0.014578557,0.1445362,0.00027596336,0.81943613,0.0004799355,0.01820345],"study_design_scores_gemma":[0.0008240674,0.000012330963,0.010192094,0.000037495294,0.0000059452814,0.000008070619,0.000035908357,0.98628634,0.00042644003,0.0003496266,0.0017224628,0.00009920141],"about_ca_topic_score_codex":0.000018118846,"about_ca_topic_score_gemma":0.000033257304,"teacher_disagreement_score":0.94699055,"about_ca_system_score_codex":0.000013962728,"about_ca_system_score_gemma":0.000017999568,"threshold_uncertainty_score":0.17793138},"labels":[],"label_agreement":null},{"id":"W2112446430","doi":"10.1109/glocom.2010.5684098","title":"Lattice Sequential Decoding: Achievable Rates and Diversity-Multiplexing Tradeoff","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Multiplexing; Computer science; Lattice (music); Algorithm; Theoretical computer science; Telecommunications; Physics","score_opus":0.06048341164459334,"score_gpt":0.2959300458455624,"score_spread":0.23544663420096903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112446430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5919843,0.00022089097,0.37404603,0.006488816,0.00069496,0.00021349797,0.0000011746984,0.000433801,0.025916548],"genre_scores_gemma":[0.9356033,0.000119722536,0.06303928,0.00050955935,0.000042758245,0.000001941538,0.0000012671754,0.0000036072217,0.000678516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933904,0.000059662318,0.00010586419,0.00022093824,0.00010312454,0.00017135596],"domain_scores_gemma":[0.9992796,0.00016332563,0.000033886132,0.00037616974,0.00005490836,0.00009209182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030926368,0.000087807835,0.000088800676,0.00005541628,0.00073569734,0.00024991744,0.0006727437,0.000060246883,0.00011799449],"category_scores_gemma":[0.000049665097,0.00008040003,0.000025633357,0.00018921545,0.00005740401,0.00056282565,0.0014793773,0.00033743493,0.000022074695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009110234,0.00008594299,0.025291413,0.000011029093,0.000036466616,0.0000075388425,0.0044731754,0.0000340695,0.076712206,0.7915702,0.0018589384,0.09990994],"study_design_scores_gemma":[0.0015683208,0.00008915726,0.03252537,0.000029262928,0.000018592384,0.00006127637,0.00013430735,0.8701536,0.02452469,0.0043569086,0.065768585,0.0007699342],"about_ca_topic_score_codex":0.000018830864,"about_ca_topic_score_gemma":0.00028695384,"teacher_disagreement_score":0.8701195,"about_ca_system_score_codex":0.000008641225,"about_ca_system_score_gemma":0.000019472565,"threshold_uncertainty_score":0.5658464},"labels":[],"label_agreement":null},{"id":"W2112514684","doi":"10.1109/wcnc.2009.4917977","title":"Super-Imposed Pilot-Aided Channel Estimation and Power Allocation for Relay Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Bit error rate; Channel (broadcasting); Computer science; Bandwidth (computing); Power (physics); Relay channel; Communications system; Control theory (sociology); Electronic engineering; Telecommunications; Engineering","score_opus":0.04421136898092009,"score_gpt":0.2825768233104809,"score_spread":0.2383654543295608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112514684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009871553,0.00051944755,0.98178357,0.0050706253,0.00015943762,0.00044995392,4.4119653e-7,0.00017916893,0.001965806],"genre_scores_gemma":[0.97418797,0.00013151127,0.024449874,0.0006295056,0.000020719099,0.000031487878,0.00000796074,0.0000040566,0.00053689035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993117,0.00006194999,0.0001893136,0.00020774802,0.00009549151,0.00013381068],"domain_scores_gemma":[0.99922436,0.00012716978,0.00004954823,0.00038944473,0.00015328784,0.00005617893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034346193,0.000089614514,0.000103621605,0.00006703053,0.00020117925,0.00021113096,0.0003025824,0.000031123807,0.000003458178],"category_scores_gemma":[0.00007039724,0.000079181445,0.000018694464,0.00018592183,0.000013461367,0.00047868723,0.00005548399,0.000051078154,0.000008459631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024420424,0.0001330027,0.000021530188,0.000016336546,0.000015147246,4.9899427e-7,0.0019814665,0.0043069837,0.010377143,0.8945605,0.00484827,0.083714716],"study_design_scores_gemma":[0.00042341105,0.00030033014,0.001135842,0.000026894651,0.0000026470282,0.0000056189497,0.000033254895,0.99503106,0.000541889,0.00095912185,0.0014154571,0.00012447509],"about_ca_topic_score_codex":0.000003446095,"about_ca_topic_score_gemma":0.000005269863,"teacher_disagreement_score":0.9907241,"about_ca_system_score_codex":0.000029503952,"about_ca_system_score_gemma":0.00002255846,"threshold_uncertainty_score":0.32289255},"labels":[],"label_agreement":null},{"id":"W2112701221","doi":"10.1109/sahcn.2008.49","title":"On the Benefits of Network Coding in Multi-Channel Wireless Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Linear network coding; Wireless mesh network; Wireless network; Distributed computing; Order One Network Protocol; Channel (broadcasting); Wireless; Telecommunications","score_opus":0.09217735320848915,"score_gpt":0.2715549232622654,"score_spread":0.17937757005377625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112701221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076108195,0.00070772134,0.9178675,0.0014462357,0.00024365839,0.00023571367,2.5089446e-7,0.00008377411,0.0033069619],"genre_scores_gemma":[0.9951708,0.0018798921,0.0017609983,0.0009408475,0.000036414713,0.000014459488,7.0456684e-7,0.000005951971,0.00018994891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902534,0.00016738781,0.00024703852,0.0001903152,0.00013426736,0.00023567057],"domain_scores_gemma":[0.9985885,0.0005833457,0.00007918128,0.0006376551,0.000073884126,0.00003746113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043907337,0.00010608641,0.00015343966,0.000049861377,0.0002530816,0.000024652933,0.0009934547,0.000043347358,0.00001871304],"category_scores_gemma":[0.000033825087,0.000073621995,0.000043452157,0.00071804057,0.00006161349,0.00011906226,0.00036856686,0.00021653743,0.00000810859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059854206,0.00008452261,0.0009691973,0.0000013915397,0.000007563173,0.0000022246859,0.0008449209,0.34842986,0.000013485984,0.6384383,0.0023231742,0.008879404],"study_design_scores_gemma":[0.00024626148,0.000027292635,0.01072101,0.00007668836,6.172359e-7,0.000003626858,0.000015070385,0.9883778,0.00012955969,0.00021335258,0.00008858415,0.00010013409],"about_ca_topic_score_codex":0.000010628559,"about_ca_topic_score_gemma":0.0001638997,"teacher_disagreement_score":0.9190626,"about_ca_system_score_codex":0.000022229688,"about_ca_system_score_gemma":0.000021891603,"threshold_uncertainty_score":0.30022177},"labels":[],"label_agreement":null},{"id":"W2112815587","doi":"10.5267/j.msl.2014.11.006","title":"Delay-based network coding packet selection","year":2014,"lang":"en","type":"article","venue":"Management Science Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Coding (social sciences); Network packet; Selection (genetic algorithm); Computer network; Artificial intelligence; Statistics; Mathematics","score_opus":0.0193993806530078,"score_gpt":0.24860406012253963,"score_spread":0.22920467946953182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112815587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009288013,0.000010989962,0.970504,0.011375195,0.00039184236,0.00016197383,4.9291316e-8,0.00024041711,0.008027509],"genre_scores_gemma":[0.9037487,0.000018213866,0.07780212,0.018231375,0.000086251195,0.000021835442,9.401943e-7,0.000005366942,0.00008523398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983538,0.00012279794,0.0001694849,0.00045840375,0.0004337748,0.00046176137],"domain_scores_gemma":[0.9990655,0.000064455104,0.00007908862,0.00067000295,0.00003338484,0.00008756148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016455479,0.00012086348,0.00009483656,0.00021608364,0.0009011732,0.0005052227,0.0017651012,0.000014839924,0.000017201972],"category_scores_gemma":[0.000024022422,0.00011766048,0.00003763941,0.0021382764,0.00017730208,0.00062070217,0.0005027122,0.00011553358,0.00007223353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004912775,0.000047543013,0.008669357,0.000019543195,0.000016179223,0.0000055716496,0.00021226541,0.080507174,0.0069373185,0.6762879,0.031137628,0.19615461],"study_design_scores_gemma":[0.00025528707,0.000029522738,0.012954943,0.00003916294,0.0000051474203,0.0000017214547,0.000006158134,0.9388119,0.00056317204,0.00046246214,0.04663813,0.00023236909],"about_ca_topic_score_codex":0.0000016534011,"about_ca_topic_score_gemma":0.000006204481,"teacher_disagreement_score":0.8944607,"about_ca_system_score_codex":0.00010977405,"about_ca_system_score_gemma":0.0000098023875,"threshold_uncertainty_score":0.6931187},"labels":[],"label_agreement":null},{"id":"W2113103425","doi":"10.1007/s11276-013-0647-0","title":"Optimized BS assignment and resource allocation in cooperative OFDM networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Computer science; Resource allocation; Computer network; Orthogonal frequency-division multiplexing; Wireless broadband; Bandwidth allocation; Max-min fairness; Base station; Bandwidth (computing); Throughput; Wireless network; Transmission (telecommunications); Wireless; Distributed computing; Channel (broadcasting); Telecommunications","score_opus":0.01709600577990329,"score_gpt":0.23895907610102754,"score_spread":0.22186307032112426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113103425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014489301,0.0019642445,0.97800475,0.0025433642,0.0001618149,0.0006659999,2.6490994e-7,0.00014523612,0.0020250338],"genre_scores_gemma":[0.99060345,0.002530979,0.0049620713,0.0012141508,0.00011578986,0.00018819893,0.000018111381,0.00001892045,0.00034831354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979473,0.0005006153,0.00042613148,0.0004997636,0.00018733827,0.00043885576],"domain_scores_gemma":[0.99852014,0.00032368745,0.00013294435,0.00072448497,0.0001405271,0.00015821963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005387056,0.00024254937,0.0003132863,0.00010324016,0.00026691848,0.00040390564,0.0007722192,0.00014865029,0.00006452021],"category_scores_gemma":[0.000023193636,0.00022730888,0.000039554685,0.0006901288,0.000105860076,0.00057162775,0.00060089433,0.00046284604,0.00001616863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019845504,0.00010776631,0.0006766023,0.0000045832703,0.00002911989,0.000004896048,0.0010675896,0.6799191,0.00010400402,0.035611536,0.0062076985,0.27624723],"study_design_scores_gemma":[0.0008416145,0.000045333556,0.0036971304,0.000091376096,0.0000034137793,0.0000047545755,0.00009093825,0.9931589,0.000030020274,0.000073691954,0.0016944949,0.00026838345],"about_ca_topic_score_codex":0.00003116427,"about_ca_topic_score_gemma":0.000054043445,"teacher_disagreement_score":0.97611415,"about_ca_system_score_codex":0.00010278347,"about_ca_system_score_gemma":0.000035878584,"threshold_uncertainty_score":0.9269387},"labels":[],"label_agreement":null},{"id":"W2113141637","doi":"10.1109/ciss.2011.5766167","title":"On linear processing for dual-hop multi-channel relaying","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Ontario Tech University","funders":"","keywords":"Pairing; Relay; Channel (broadcasting); Maximization; Permutation (music); Computer science; Permutation matrix; Relay channel; Topology (electrical circuits); Path (computing); Algorithm; Mathematics; Mathematical optimization; Power (physics); Telecommunications; Computer network; Physics; Combinatorics","score_opus":0.17560223954847773,"score_gpt":0.3270017334281078,"score_spread":0.15139949387963006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113141637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010610748,0.00014877725,0.99033606,0.00041745492,0.00012268737,0.00017924224,2.5382548e-7,0.00021366552,0.0075208014],"genre_scores_gemma":[0.7463284,0.00004723607,0.25108218,0.0009939567,0.000032102987,0.00003839228,0.0000010524856,0.00000898112,0.0014676993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934626,0.00003616427,0.00014738944,0.00022386397,0.00007603822,0.00017027315],"domain_scores_gemma":[0.99926984,0.00008706552,0.00005069143,0.00040449455,0.00013454664,0.000053387506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002587397,0.000089382986,0.000085311316,0.00006007022,0.0002973845,0.00005690194,0.0004544027,0.000033685727,0.000020934714],"category_scores_gemma":[0.00007280024,0.0000744895,0.000039035473,0.0001966402,0.000018579125,0.00027319667,0.00020383824,0.00009451557,0.00004189275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056625035,0.00068695174,0.000086836386,0.00005181829,0.000034102366,0.0000072768007,0.02246063,0.0008287158,0.0015925327,0.4950152,0.004666641,0.47451267],"study_design_scores_gemma":[0.00045538033,0.000094224655,0.0001537665,0.00005089227,0.000002116788,0.0000026649748,0.00006371719,0.9920568,0.0032671017,0.0012571445,0.002428066,0.00016814494],"about_ca_topic_score_codex":0.0000022052436,"about_ca_topic_score_gemma":0.0000105738745,"teacher_disagreement_score":0.99122804,"about_ca_system_score_codex":0.00001751805,"about_ca_system_score_gemma":0.000029803028,"threshold_uncertainty_score":0.30375937},"labels":[],"label_agreement":null},{"id":"W2113185407","doi":"10.1155/2010/649541","title":"Performance Analysis of Two-Hop OSTBC Transmission over Rayleigh Fading Channels","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangdong Province","keywords":"Computer science; Rayleigh fading; Relay; Fading; Hop (telecommunications); MIMO; Block code; Monte Carlo method; Diversity gain; Telecommunications; Algorithm; Topology (electrical circuits); Mathematics; Decoding methods; Statistics; Channel (broadcasting); Physics","score_opus":0.041477597150283235,"score_gpt":0.30385825254790505,"score_spread":0.2623806553976218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113185407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89496005,0.003163468,0.096477374,0.0015741605,0.0005926899,0.00015994383,0.0000012493269,0.00007819379,0.0029928633],"genre_scores_gemma":[0.9608703,0.030661065,0.00804958,0.00021471767,0.00013606121,0.0000072190232,0.0000060948014,0.0000141205455,0.000040809082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825555,0.00036226565,0.0005823121,0.00023839886,0.00027766835,0.00028378217],"domain_scores_gemma":[0.9970168,0.00057990744,0.0004269827,0.001590817,0.00020972926,0.0001757587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011996574,0.00019961706,0.00038430837,0.00052426284,0.0012315243,0.00027859048,0.0021101243,0.00007353852,0.000035282763],"category_scores_gemma":[0.000010844072,0.00017420585,0.00016955081,0.0017485698,0.00014894793,0.00047598436,0.00052133325,0.0010495117,0.00000196474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017066806,0.00013763331,0.01197916,0.000007311665,0.00029102183,0.0000020912064,0.0021338013,0.0036706189,0.01094129,0.018580228,0.000055611064,0.95218414],"study_design_scores_gemma":[0.00047251995,0.00008171308,0.008100868,0.00020555696,0.000105917774,0.000029095763,0.000019242249,0.972755,0.00046031398,0.00013067716,0.017404074,0.00023501695],"about_ca_topic_score_codex":0.0000035009475,"about_ca_topic_score_gemma":0.000027838005,"teacher_disagreement_score":0.9690844,"about_ca_system_score_codex":0.00002855807,"about_ca_system_score_gemma":0.000046600115,"threshold_uncertainty_score":0.9472013},"labels":[],"label_agreement":null},{"id":"W2113241087","doi":"10.1109/twc.2010.06.091423","title":"Cooperative wireless multicast: performance analysis and power/location optimization","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Computer science; Computer network; Relay; Cooperative diversity; Overhead (engineering); Network packet; Wireless; Source-specific multicast; Transmission (telecommunications); Fading; Signal-to-noise ratio (imaging); Channel (broadcasting); Power (physics); Telecommunications","score_opus":0.024500443818434206,"score_gpt":0.27556966491117657,"score_spread":0.2510692210927424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113241087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07201153,0.00007906221,0.9242775,0.0021236485,0.00020593706,0.00032843556,0.000012132784,0.00026664237,0.0006951092],"genre_scores_gemma":[0.946987,0.0027078285,0.049632017,0.00026905705,0.000010504559,0.00018826344,0.000020984662,0.000019788713,0.00016460908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982713,0.0003270136,0.00044332477,0.0004507884,0.0002462471,0.0002613296],"domain_scores_gemma":[0.9954374,0.0004650514,0.00016114353,0.0031499006,0.00061996904,0.00016658014],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00040588583,0.0002570808,0.00029300607,0.0005375081,0.0015808648,0.00030722874,0.0018410431,0.00013884377,0.00006468297],"category_scores_gemma":[0.000015903455,0.00026603776,0.000099468074,0.0028701166,0.0003502321,0.0008917819,0.00005261834,0.0008367925,0.000031608863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045955832,0.0017942986,0.0010927817,0.000031397067,0.00090473105,0.0000013769558,0.00757847,0.37778467,0.017761411,0.06702144,0.000065094224,0.52591836],"study_design_scores_gemma":[0.00035418285,0.00006899171,0.0020643082,0.00002761197,0.00009713216,0.000007418267,0.00006890511,0.9914652,0.005181451,0.000012115579,0.00034666172,0.00030599025],"about_ca_topic_score_codex":0.000023388697,"about_ca_topic_score_gemma":0.0007493818,"teacher_disagreement_score":0.87497544,"about_ca_system_score_codex":0.00005740983,"about_ca_system_score_gemma":0.000108100554,"threshold_uncertainty_score":0.9999792},"labels":[],"label_agreement":null},{"id":"W2113242882","doi":"10.1109/vetecf.2003.1285363","title":"A relaying algorithm for multihop TDMA TDD networks using diversity","year":2003,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Time division multiple access; Throughput; Channel (broadcasting); Routing algorithm; Selection algorithm; Distributed computing; Routing (electronic design automation); Algorithm; Selection (genetic algorithm); Routing protocol; Wireless; Telecommunications","score_opus":0.08355126861563636,"score_gpt":0.2960899173584639,"score_spread":0.21253864874282755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113242882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010682711,0.00039634775,0.9948195,0.00011429632,0.00028393458,0.00019947377,3.8058175e-7,0.00012913262,0.0029886698],"genre_scores_gemma":[0.3279351,0.00012484762,0.67084295,0.00055597833,0.000035480203,0.000006697062,0.000001119767,0.000006056509,0.0004918135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991443,0.000115908115,0.00014269125,0.00025065115,0.00010064138,0.00024577038],"domain_scores_gemma":[0.99907213,0.00018254752,0.00005379711,0.00047802879,0.00013752375,0.00007594192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043123338,0.00010249735,0.00011538292,0.000051390914,0.00096866867,0.000111704074,0.0006157788,0.000048910006,0.000025847346],"category_scores_gemma":[0.00005121821,0.00009859888,0.000069152295,0.00034104014,0.000024627776,0.0003433853,0.0007067073,0.00011356893,0.0000051883117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003062663,0.000092522285,0.0016790036,0.000004282521,0.00004238493,0.0000038632365,0.0010032026,0.009114473,0.00019048483,0.15219735,0.0015831739,0.8340862],"study_design_scores_gemma":[0.00036165613,0.000016824446,0.00012936957,0.000010641174,0.0000044957774,0.000005585716,0.00003296609,0.99145955,0.0001450382,0.00026765093,0.00742166,0.00014456725],"about_ca_topic_score_codex":0.000008354636,"about_ca_topic_score_gemma":0.00001192758,"teacher_disagreement_score":0.98234504,"about_ca_system_score_codex":0.000060972692,"about_ca_system_score_gemma":0.000030899057,"threshold_uncertainty_score":0.7450314},"labels":[],"label_agreement":null},{"id":"W2113249692","doi":"10.1109/twc.2008.030327","title":"Cooperative Diversity in Interference Limited Wireless Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Decodes; Computer network; Computer science; Node (physics); Wireless network; Interference (communication); Asynchronous communication; Diversity gain; Wireless; Cooperative diversity; Throughput; Decoding methods; Power (physics); Telecommunications; Fading; Channel (broadcasting); Engineering","score_opus":0.08408753970415885,"score_gpt":0.283523059503642,"score_spread":0.19943551979948315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113249692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05611016,0.00027254593,0.9392399,0.0019599476,0.0002425774,0.00034864128,0.0000074353047,0.0002994653,0.0015192884],"genre_scores_gemma":[0.98427504,0.0117714135,0.0029098352,0.0005648726,0.000012055373,0.00013592579,0.000009408697,0.000017357723,0.00030409422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977847,0.00070854113,0.0004649183,0.0004435354,0.00023382509,0.00036450577],"domain_scores_gemma":[0.9955744,0.0006624567,0.00012455291,0.0031891244,0.00030156,0.00014787144],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002916159,0.000271495,0.00032262952,0.00036201734,0.0023394392,0.000091432885,0.004162232,0.00013432122,0.000037075453],"category_scores_gemma":[0.000009083852,0.00029260392,0.00011786034,0.0018043027,0.00041793106,0.00070636696,0.00023236465,0.0010569778,0.000052506195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023665332,0.007668062,0.00565338,0.000031382566,0.00040913344,0.00007616364,0.044629224,0.19090343,0.002861608,0.13825472,0.0019009126,0.6073753],"study_design_scores_gemma":[0.00094103056,0.00012981368,0.0035210552,0.00015313188,0.000011710383,0.00003243793,0.00015670675,0.9922959,0.0015967997,0.000080999656,0.00056683674,0.0005135333],"about_ca_topic_score_codex":0.00009591108,"about_ca_topic_score_gemma":0.0017467844,"teacher_disagreement_score":0.9363301,"about_ca_system_score_codex":0.00022013573,"about_ca_system_score_gemma":0.00012478628,"threshold_uncertainty_score":0.9999526},"labels":[],"label_agreement":null},{"id":"W2113336188","doi":"10.1109/icc.2009.5199349","title":"Power Allocation for Wireless Communications Using Variable Time-Fraction Collaboration","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Channel state information; Computer science; Relay; Fraction (chemistry); Variable (mathematics); Frame (networking); Transmitter power output; Channel (broadcasting); Wireless; Power (physics); Scheme (mathematics); Diversity gain; Upper and lower bounds; Exploit; MIMO; Computer network; Real-time computing; Telecommunications; Mathematics","score_opus":0.04163316423704604,"score_gpt":0.32125968889610557,"score_spread":0.2796265246590595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113336188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015984109,0.00014866971,0.9806699,0.0063078753,0.00008926556,0.00038723313,0.0000013256064,0.00019740312,0.0105998805],"genre_scores_gemma":[0.63901967,0.00013620242,0.3588613,0.0011971355,0.000028219452,0.000026454965,0.000033894874,0.0000059246186,0.00069116993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991963,0.00011986983,0.0002302768,0.00019698273,0.000112312155,0.00014428551],"domain_scores_gemma":[0.99794644,0.00014804582,0.0001138781,0.0011867835,0.0005582549,0.00004659898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003942388,0.000094027055,0.00011015725,0.000086150096,0.0005348078,0.00026008365,0.00086586195,0.00005536771,0.00003990038],"category_scores_gemma":[0.00005227826,0.000097416385,0.000028714703,0.0007414684,0.000021307378,0.0010130274,0.00012210786,0.000081219885,0.000026020221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008318086,0.00015965984,0.000013748844,0.0000021320955,0.000011951985,5.096915e-8,0.0003655106,0.000820324,0.10343348,0.8493339,0.003928831,0.041922126],"study_design_scores_gemma":[0.00024507067,0.00006506965,0.00014816124,0.000016130227,0.0000053052645,0.0000021410908,0.000035951925,0.96276206,0.0021449188,0.0037050976,0.030727098,0.00014297775],"about_ca_topic_score_codex":0.000003192569,"about_ca_topic_score_gemma":0.0000077205705,"teacher_disagreement_score":0.9619418,"about_ca_system_score_codex":0.00013074727,"about_ca_system_score_gemma":0.00012969611,"threshold_uncertainty_score":0.4113363},"labels":[],"label_agreement":null},{"id":"W2113358876","doi":"10.1109/glocom.2007.142","title":"Optimal Channel Assignment in Multi-Hop Cellular Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Hop (telecommunications); Network packet; Distributed computing; Channel (broadcasting); Network topology; Heuristics; Wireless; Telecommunications","score_opus":0.05674194663350821,"score_gpt":0.29046535886086255,"score_spread":0.23372341222735435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113358876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034916014,0.00047629746,0.9910917,0.0005041086,0.00019219947,0.00012897511,4.897322e-8,0.00010019971,0.004014826],"genre_scores_gemma":[0.9445648,0.00015460672,0.053825825,0.0005674922,0.00003800042,0.0000074745167,0.0000014872921,0.000005416823,0.0008348553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902093,0.00007096158,0.00023189031,0.00023556026,0.00012629095,0.00031438956],"domain_scores_gemma":[0.9992248,0.0000938462,0.0000392605,0.0005086969,0.000045630128,0.00008780266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000870669,0.00010266701,0.00010626232,0.00009697578,0.00009881361,0.000075481585,0.00075547886,0.000050906503,0.000044568922],"category_scores_gemma":[0.0000131818415,0.00009380982,0.00003362753,0.0004575221,0.000022509827,0.00019986392,0.00044655404,0.00018472911,0.000031847296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034238277,0.0011645638,0.0036212984,0.000009180656,0.00004340182,0.00016666857,0.0055057127,0.4375755,0.00645596,0.20671085,0.0040523144,0.33466032],"study_design_scores_gemma":[0.0003585985,0.000023149694,0.0021123104,0.00001255139,5.999613e-7,0.000001550772,0.000049716775,0.99319607,0.0016295834,0.000018090132,0.002459105,0.00013868517],"about_ca_topic_score_codex":0.000007021776,"about_ca_topic_score_gemma":0.00011714187,"teacher_disagreement_score":0.94107324,"about_ca_system_score_codex":0.000068890644,"about_ca_system_score_gemma":0.000016641425,"threshold_uncertainty_score":0.38254532},"labels":[],"label_agreement":null},{"id":"W2113395889","doi":"10.1109/lcomm.2010.08.100691","title":"Error Probability Analysis of Bidirectional Relay Systems Using Alamouti Scheme","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Phase-shift keying; Space–time block code; Computer science; Relay channel; Node (physics); Block code; Linear network coding; Topology (electrical circuits); Algorithm; Diversity gain; Bit error rate; Telecommunications; Computer network; Mathematics; Fading; Decoding methods; Power (physics); Engineering; Physics; Combinatorics","score_opus":0.10009192749369676,"score_gpt":0.32879543597080146,"score_spread":0.2287035084771047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113395889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7545127,0.0004280899,0.2372012,0.0057085035,0.00066514214,0.00035356978,0.000013472955,0.00020167202,0.0009156371],"genre_scores_gemma":[0.87577796,0.0000798228,0.12373458,0.0002826513,0.000025125804,0.0000399224,0.000020271676,0.00000786905,0.00003182049],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983072,0.00046743633,0.00052004954,0.00028029634,0.00023916722,0.00018584859],"domain_scores_gemma":[0.99418604,0.00044393644,0.00028021692,0.0047051487,0.00031085405,0.00007380054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009195874,0.00013836838,0.0002837219,0.00042109558,0.00045768853,0.00011212558,0.0030730283,0.00007675161,0.000021999242],"category_scores_gemma":[0.00010784638,0.00014163717,0.00015683867,0.0023667405,0.00032020124,0.00036516416,0.0005889065,0.0005194031,0.0000087976005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070099086,0.0004924657,0.029548408,0.000024712874,0.0010877363,7.54104e-7,0.0017025032,0.0359884,0.807318,0.119057596,0.0015117003,0.0032607247],"study_design_scores_gemma":[0.0001438237,0.000007890631,0.010544099,0.000020399639,0.00011948309,0.0000055990163,0.00002092498,0.9801754,0.000847804,0.00003463381,0.007872646,0.00020734462],"about_ca_topic_score_codex":0.00010724554,"about_ca_topic_score_gemma":0.0003350818,"teacher_disagreement_score":0.9441869,"about_ca_system_score_codex":0.000077891214,"about_ca_system_score_gemma":0.000088940964,"threshold_uncertainty_score":0.5775796},"labels":[],"label_agreement":null},{"id":"W2113464786","doi":"10.1109/glocom.2008.ecp.886","title":"Novel Rateless Coded Selection Cooperation in Dual-Hop Relaying Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Decoding methods; Node (physics); Fading; Computer network; Single antenna interference cancellation; Selection (genetic algorithm); Interference (communication); Exploit; Telecommunications; Power (physics); Engineering; Computer security","score_opus":0.06613986875106533,"score_gpt":0.2759087786885166,"score_spread":0.2097689099374513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113464786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119343445,0.0002033416,0.8745831,0.00042586197,0.00026301935,0.00022124249,2.1281312e-7,0.000204612,0.0047551347],"genre_scores_gemma":[0.9896186,0.000417026,0.008279656,0.00020918944,0.0000421065,0.00003363016,0.0000039710017,0.0000066000275,0.0013892016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990024,0.00015174663,0.000282004,0.00024764508,0.00014143654,0.00017474762],"domain_scores_gemma":[0.9992988,0.00008286302,0.00005844795,0.00032139488,0.00019374929,0.000044740747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036817876,0.00010098313,0.00013681778,0.0001345673,0.00033291624,0.00012999318,0.00024733407,0.00005301247,0.000013780854],"category_scores_gemma":[0.000039280778,0.00009525443,0.000020140962,0.00094365457,0.000022414039,0.00058500806,0.00013858684,0.00016874135,0.000039902214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027028611,0.00046096058,0.0058839307,0.000025318277,0.000031665648,0.000025981222,0.0066816634,0.09519488,0.23155357,0.64114916,0.0055812052,0.0133846495],"study_design_scores_gemma":[0.00055818126,0.000030922994,0.0023800023,0.00003227936,8.799147e-7,0.00012541002,0.00004813085,0.99072653,0.0034551458,0.000008433954,0.002457255,0.00017680819],"about_ca_topic_score_codex":0.000064180436,"about_ca_topic_score_gemma":0.00025534828,"teacher_disagreement_score":0.89553165,"about_ca_system_score_codex":0.000104806706,"about_ca_system_score_gemma":0.00008554512,"threshold_uncertainty_score":0.38843626},"labels":[],"label_agreement":null},{"id":"W2113591233","doi":"10.1109/wcnc.2013.6555221","title":"Multiply-and-forward - A robust transmission scheme for two-way cooperative communication in the presence of nonlinear power amplifier distortion","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Distortion (music); Amplifier; Nonlinear distortion; Relay; Bit error rate; Transmission (telecommunications); Computer science; Modulation (music); Power (physics); Nonlinear system; SIGNAL (programming language); Electronic engineering; Control theory (sociology); Telecommunications; Mathematics; Topology (electrical circuits); Electrical engineering; Engineering; Physics; Acoustics; Decoding methods; Bandwidth (computing); Artificial intelligence","score_opus":0.039594486883341946,"score_gpt":0.2912683710595365,"score_spread":0.2516738841761946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113591233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041244693,0.00057899556,0.95084435,0.004802665,0.000028645534,0.0010451116,0.0000016947233,0.00003551336,0.0014183412],"genre_scores_gemma":[0.8620635,0.00029133924,0.1369616,0.00030593792,0.000006715264,0.00017869352,0.000009843611,0.000005010421,0.00017731352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989234,0.00027966598,0.00030780627,0.00020251631,0.00014394251,0.00014265157],"domain_scores_gemma":[0.9983091,0.0005409378,0.0000896977,0.0007297968,0.0002890223,0.000041469997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000594492,0.00010736045,0.00014318226,0.00005973062,0.0002081878,0.00010759741,0.0009102022,0.000040024872,0.000044146807],"category_scores_gemma":[0.00009793049,0.000070764174,0.00004145784,0.0003236525,0.00009898012,0.00058549014,0.00018436514,0.00015313641,0.0000048916772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013459727,0.0014285858,0.0038954574,0.00010365104,0.00008345088,7.555323e-7,0.06998551,0.005421371,0.054694794,0.3926494,0.008337867,0.46326455],"study_design_scores_gemma":[0.00094841723,0.00010613557,0.00518322,0.00008753156,0.0000036172014,0.0000021293101,0.000513363,0.98340994,0.0025835114,0.00044599548,0.006546761,0.00016938258],"about_ca_topic_score_codex":0.00006331852,"about_ca_topic_score_gemma":0.00010841704,"teacher_disagreement_score":0.97798854,"about_ca_system_score_codex":0.000021418975,"about_ca_system_score_gemma":0.000028088456,"threshold_uncertainty_score":0.28856793},"labels":[],"label_agreement":null},{"id":"W2113910601","doi":"10.1109/cwit.2011.5872132","title":"Average outage and non-outage duration of selective decode-and-forward relaying","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rayleigh fading; Logarithm; Outage probability; Fading; Signal-to-noise ratio (imaging); Computer science; Channel (broadcasting); Duration (music); Transmission (telecommunications); Telecommunications; Statistics; Mathematics; Electronic engineering; Topology (electrical circuits); Engineering; Physics; Acoustics","score_opus":0.03465254987683155,"score_gpt":0.2532903424882093,"score_spread":0.21863779261137775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113910601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17614895,0.0001646582,0.79698056,0.00013657601,0.00005084134,0.00014458265,5.0242454e-7,0.00006001814,0.0263133],"genre_scores_gemma":[0.9675297,0.00039635136,0.03150927,0.00016139993,0.000007409983,0.0000064287965,7.2517145e-7,0.000004418746,0.00038427315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933004,0.000067795125,0.00020499963,0.00020229015,0.00008183804,0.000113025366],"domain_scores_gemma":[0.99938136,0.000079541765,0.00008450734,0.0003038824,0.00009635331,0.000054366352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028737015,0.00008686159,0.00012636468,0.00007324682,0.0001426811,0.000047530248,0.00025281977,0.000036899648,0.000028130882],"category_scores_gemma":[0.000038690112,0.00007610027,0.000021584157,0.00020110811,0.00004353253,0.00044770903,0.00032648607,0.00010174225,0.000005515106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007645195,0.00025727373,0.073368505,0.000080454,0.0001699548,0.000015659032,0.11468254,0.00007582244,0.03581249,0.45315728,0.00086086214,0.3214427],"study_design_scores_gemma":[0.0018755698,0.00054872857,0.26215878,0.00014255672,0.000028782519,0.000051019284,0.0006366345,0.6408347,0.08365621,0.007938507,0.0012289106,0.0008996363],"about_ca_topic_score_codex":0.000020939211,"about_ca_topic_score_gemma":0.00006406272,"teacher_disagreement_score":0.79138076,"about_ca_system_score_codex":0.00001427328,"about_ca_system_score_gemma":0.00002107948,"threshold_uncertainty_score":0.3103279},"labels":[],"label_agreement":null},{"id":"W2113921875","doi":"10.1109/twc.2013.013013.120940","title":"Resource Allocation, Transmission Coordination and User Association in Heterogeneous Networks: A Flow-Based Unified Approach","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Software deployment; Resource allocation; Base station; Computer network; Relay; Transmission (telecommunications); Heterogeneous network; Throughput; Distributed computing; Resource (disambiguation); Resource management (computing); Wireless network; Wireless; Telecommunications","score_opus":0.024943788376824504,"score_gpt":0.2477550901416152,"score_spread":0.2228113017647907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113921875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004680687,0.00040002636,0.98368376,0.009598467,0.00006319983,0.00074514176,0.000003128677,0.00024612073,0.00057943515],"genre_scores_gemma":[0.957879,0.0012636315,0.039174113,0.00065084966,0.000010915717,0.0006040801,0.00003720001,0.000025184338,0.00035500972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975618,0.0008845386,0.0005271043,0.00042380707,0.0002837678,0.0003189965],"domain_scores_gemma":[0.9967599,0.0007013426,0.00018582074,0.0019104428,0.00030089126,0.00014162397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005905939,0.00024242762,0.00025348132,0.00036641094,0.00077076425,0.00029834718,0.0014498609,0.000192996,0.000024457753],"category_scores_gemma":[0.0000141052415,0.0002590318,0.00008470152,0.0012190103,0.000095040945,0.00062040705,0.000025572723,0.00060358003,0.000021398282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021353524,0.0012635554,0.00024273118,0.000024685562,0.00006648095,5.480024e-7,0.0015406108,0.53586197,0.0014871492,0.0065530674,0.0007843847,0.45215347],"study_design_scores_gemma":[0.00075530924,0.000045962555,0.00079027616,0.00007376374,0.000013760905,0.0000031465136,0.00005275103,0.99330544,0.000701202,0.00008297877,0.003907338,0.00026808525],"about_ca_topic_score_codex":0.00006460898,"about_ca_topic_score_gemma":0.00017760442,"teacher_disagreement_score":0.9531983,"about_ca_system_score_codex":0.00032416996,"about_ca_system_score_gemma":0.00008315308,"threshold_uncertainty_score":0.9999862},"labels":[],"label_agreement":null},{"id":"W2113967535","doi":"10.1109/iccnc.2013.6504164","title":"Mitigating the asymmetric interests among peers in peer-to-peer video-on-demand systems","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Video on demand; Incentive; Exploit; Peer-to-peer; On demand; Multimedia; Coding (social sciences); The Internet; Computer network; Video streaming; World Wide Web; Computer security","score_opus":0.07177435605892733,"score_gpt":0.31667204494787415,"score_spread":0.2448976888889468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113967535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3254092,0.0035093047,0.17075306,0.25621676,0.0060434635,0.0038726456,0.00001475673,0.00092179555,0.23325904],"genre_scores_gemma":[0.9929309,0.000862582,0.003165851,0.0013961904,0.00022548203,0.00015839054,0.000027308975,0.000021847902,0.0012114439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678284,0.00076175464,0.0007075846,0.0005621514,0.00074238156,0.00044328882],"domain_scores_gemma":[0.9947557,0.0014339432,0.00036530825,0.0021101062,0.0011520517,0.00018291747],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017560435,0.00031842783,0.00030556438,0.000507462,0.00081491575,0.0016705006,0.0049204505,0.000103945225,0.000030741958],"category_scores_gemma":[0.00034998948,0.00027009487,0.00007882914,0.0010172422,0.00022487795,0.0003810127,0.0022421519,0.0009415245,0.000160703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014903294,0.00028781465,0.016666139,0.000013070596,0.00013384169,0.0000034111742,0.006155811,0.016524013,0.000068674104,0.6698452,0.037801795,0.2524853],"study_design_scores_gemma":[0.00035813244,0.00008943118,0.024268864,0.0006867982,0.0000049967616,0.0000100929665,0.0005400138,0.949523,0.000007969259,0.0014313514,0.022744311,0.0003350654],"about_ca_topic_score_codex":0.00046676485,"about_ca_topic_score_gemma":0.00031543954,"teacher_disagreement_score":0.93299896,"about_ca_system_score_codex":0.00015987836,"about_ca_system_score_gemma":0.000067833425,"threshold_uncertainty_score":0.99997514},"labels":[],"label_agreement":null},{"id":"W2113996774","doi":"10.1109/tmc.2010.251","title":"Wireless Fountain Coding with IEEE 802.11e Block ACK for Media Streaming in Wireline-cum-WiFi Networks: A Performance Study","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Network packet; Wireless network; Automatic repeat request; Wireless; Linear network coding; Wireline; Real-time computing; Telecommunications link; Hybrid automatic repeat request; Telecommunications","score_opus":0.044597579841522475,"score_gpt":0.2693348494283819,"score_spread":0.2247372695868594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113996774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4182318,0.00004270467,0.5801461,0.000014502565,0.00043502785,0.00085547916,0.000001500014,0.00017865354,0.0000942657],"genre_scores_gemma":[0.9867241,0.00015870902,0.012502084,0.00010086006,0.000112604874,0.000304055,0.0000020440032,0.0000443633,0.000051185445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974404,0.00024900137,0.0006570113,0.00072411203,0.0003034496,0.0006260003],"domain_scores_gemma":[0.9977605,0.000740163,0.00021612922,0.0009015511,0.00024457928,0.00013711474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091005675,0.00038083908,0.00043735138,0.00040487462,0.0008062397,0.0001604793,0.0011474892,0.000097810174,0.000008534127],"category_scores_gemma":[0.0000070631827,0.00036275756,0.000100187164,0.0013991542,0.0000820489,0.00049993215,0.000024810184,0.0006152112,0.000008051518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014081279,0.0012683424,0.0024732538,0.000041789026,0.00009326873,0.000014832008,0.01705128,0.65042526,0.00027733418,0.0002601173,0.000035316694,0.3279184],"study_design_scores_gemma":[0.0017177137,0.0009598459,0.0013552948,0.00037745252,0.000026455356,0.000017054437,0.0010802493,0.99236745,0.0015856622,0.0000074554277,0.00004673961,0.00045865998],"about_ca_topic_score_codex":0.00002924819,"about_ca_topic_score_gemma":0.0005359778,"teacher_disagreement_score":0.5684923,"about_ca_system_score_codex":0.0001746463,"about_ca_system_score_gemma":0.00009959751,"threshold_uncertainty_score":0.99988246},"labels":[],"label_agreement":null},{"id":"W2114000865","doi":"10.1109/lcomm.2006.060849","title":"A Noise Reduction Amplify-and-Forward Relay Protocol for Distributed Spatial Diversity","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Transmission (telecommunications); Computer science; Noise (video); Antenna diversity; Wireless; Protocol (science); Computer network; Signal-to-noise ratio (imaging); Relay channel; Telecommunications; Electronic engineering; Physics; Engineering","score_opus":0.055038625517106705,"score_gpt":0.30707717325257716,"score_spread":0.25203854773547046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114000865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022191943,0.000028127755,0.94500345,0.026866129,0.000112778165,0.025178576,0.000021497362,0.00025470465,0.0003155357],"genre_scores_gemma":[0.7988502,0.00006236597,0.09987161,0.0013770113,0.00018373472,0.09931347,0.00017925714,0.00002342207,0.00013892936],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988123,0.00024384155,0.00029584317,0.00028290617,0.00014570226,0.0002193686],"domain_scores_gemma":[0.9972606,0.00021237112,0.00016678436,0.0021380025,0.00015951664,0.00006274633],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00035073006,0.00014940568,0.00015012744,0.00010240177,0.0015496239,0.00017376168,0.0019991226,0.00005990249,0.000004460492],"category_scores_gemma":[0.00003278298,0.00015590081,0.00007195856,0.00034587327,0.00019467607,0.00040758718,0.0014149396,0.00023778199,0.000010586183],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003020053,0.00199241,0.009333636,0.00018600111,0.0002589633,0.0000044647536,0.0047174315,0.007575302,0.12838769,0.25776875,0.40798774,0.1814856],"study_design_scores_gemma":[0.005543868,0.00019238295,0.023990909,0.00017838713,0.000066932706,0.000049311402,0.00007394384,0.25054845,0.004604751,0.0030145661,0.71044886,0.0012876343],"about_ca_topic_score_codex":0.00016564953,"about_ca_topic_score_gemma":0.00014638566,"teacher_disagreement_score":0.8451318,"about_ca_system_score_codex":0.000116409705,"about_ca_system_score_gemma":0.000032377855,"threshold_uncertainty_score":0.9997502},"labels":[],"label_agreement":null},{"id":"W2114115739","doi":"10.1109/tcomm.2011.042111.100310","title":"Analysis and Design of Cooperative BICM-OFDM Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise error probability; Orthogonal frequency-division multiplexing; Relay; Computer science; Disjoint sets; Cooperative diversity; Diversity gain; Multiplexing; Transmit diversity; Electronic engineering; Selection (genetic algorithm); Wireless; Diversity scheme; Computer network; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Wireless network; Engineering; Fading","score_opus":0.1283991337974955,"score_gpt":0.29790581125811916,"score_spread":0.16950667746062364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114115739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038285615,0.0008396526,0.9956237,0.00026325652,0.00008502514,0.00028953704,0.000009954163,0.00010358324,0.0024024495],"genre_scores_gemma":[0.9408439,0.0045420188,0.05418791,0.000059657796,0.0000027326216,0.0001147208,0.0000021425028,0.000007592671,0.00023932046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985021,0.0006505317,0.0003572009,0.00022331554,0.00013092333,0.00013596719],"domain_scores_gemma":[0.9963855,0.0004962704,0.00012862046,0.002611408,0.00029587097,0.00008233624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003905255,0.00013575245,0.00025202884,0.0004245045,0.00051925774,0.00006571555,0.0016111432,0.00005624419,0.000034797024],"category_scores_gemma":[0.000008903678,0.0001309746,0.00008526908,0.0017870081,0.00022164863,0.00032135722,0.000029578248,0.00023903286,0.000014788078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015527305,0.005482266,0.0011271586,0.00007507051,0.0067591877,0.000005287982,0.0576793,0.15798794,0.014029822,0.45595133,0.0005483684,0.30019897],"study_design_scores_gemma":[0.0004120256,0.00023456571,0.001464477,0.000056397836,0.00031273707,0.000007807423,0.00031654106,0.98802,0.00793654,0.00021500445,0.00069345906,0.00033045138],"about_ca_topic_score_codex":0.00008281197,"about_ca_topic_score_gemma":0.00013243374,"teacher_disagreement_score":0.94143575,"about_ca_system_score_codex":0.00003172202,"about_ca_system_score_gemma":0.00006163408,"threshold_uncertainty_score":0.5340989},"labels":[],"label_agreement":null},{"id":"W2114205786","doi":"10.1109/t-wc.2008.070586","title":"Achievable Rates and Fairness in Rateless Coded Relaying Schemes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Constraint (computer-aided design); Computer network; Protocol (science); Throughput; Wireless; Power (physics); Decoding methods; Algorithm; Telecommunications; Mathematics","score_opus":0.06234053443832743,"score_gpt":0.2975043991850211,"score_spread":0.23516386474669365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114205786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1548709,0.0011516148,0.83914006,0.0030729228,0.00012252014,0.00031515592,0.000004956341,0.0002522699,0.001069612],"genre_scores_gemma":[0.96912813,0.0155819375,0.014503661,0.00025097572,0.0000064862784,0.00018260925,0.0000041796375,0.000018489665,0.00032354702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834186,0.000446899,0.00040503914,0.00035087127,0.00017598702,0.00027933583],"domain_scores_gemma":[0.9967107,0.0005818317,0.00009704823,0.0023578312,0.00014694661,0.000105613355],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000329153,0.00020726278,0.00026634522,0.00030780566,0.0014035602,0.00011648107,0.0018874201,0.000094633084,0.0000140012335],"category_scores_gemma":[0.000010559037,0.00022023857,0.000061481995,0.0011163594,0.00031812055,0.00069582363,0.00005918564,0.0006497503,0.000029929499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015983243,0.004881329,0.0062099784,0.00011493826,0.00031489608,0.00004964176,0.024226926,0.02126996,0.03879613,0.288376,0.00071350444,0.6148869],"study_design_scores_gemma":[0.0031517218,0.00016902173,0.0073194318,0.00044947278,0.000027954,0.00016868023,0.00065239193,0.93587893,0.041404635,0.0009470283,0.008510377,0.0013203769],"about_ca_topic_score_codex":0.000036564383,"about_ca_topic_score_gemma":0.0004502702,"teacher_disagreement_score":0.91460896,"about_ca_system_score_codex":0.00008786912,"about_ca_system_score_gemma":0.00011192655,"threshold_uncertainty_score":0.99989647},"labels":[],"label_agreement":null},{"id":"W2114488342","doi":"10.1109/icc.2011.5962983","title":"Joint Handoff and Energy Management for a Wireless Mesh Network","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Handover; Energy consumption; Computer network; Scheduling (production processes); Wireless mesh network; Wireless; Transmission (telecommunications); Throughput; Wireless network; Real-time computing; Mathematical optimization; Engineering; Telecommunications; Electrical engineering","score_opus":0.06405437601589334,"score_gpt":0.24644731858187557,"score_spread":0.18239294256598224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114488342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004143005,0.0003154992,0.95242727,0.0003384225,0.00011924057,0.00008594159,1.2083271e-7,0.000091528214,0.04620769],"genre_scores_gemma":[0.7946236,0.002165328,0.19509788,0.0017323158,0.000058716785,0.000117665426,0.0000015016204,0.000007796757,0.0061951717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994432,0.000036353526,0.00012020021,0.00018484106,0.00005388664,0.000161553],"domain_scores_gemma":[0.9994606,0.000030949013,0.000031171254,0.00038320204,0.000041148887,0.000052943367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018822253,0.00007301627,0.00009132981,0.000030669427,0.0001674495,0.00006482966,0.00032460073,0.00001778357,0.00002911298],"category_scores_gemma":[0.0000019105782,0.00006126504,0.000027675824,0.00013778471,0.000022045799,0.00012555181,0.0004651486,0.00002701064,0.000002945822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030156793,0.000012591834,0.000025965011,0.0000023936811,0.0000127676385,6.285707e-7,0.0001833155,0.0000019562776,0.00001579519,0.7933134,0.00471169,0.20171647],"study_design_scores_gemma":[0.0017286348,0.00022272496,0.004859205,0.0000986939,0.00002219026,0.000011968556,0.00007299257,0.69428694,0.0023695314,0.03806593,0.25766623,0.00059498096],"about_ca_topic_score_codex":0.00000544243,"about_ca_topic_score_gemma":0.000051013212,"teacher_disagreement_score":0.7942093,"about_ca_system_score_codex":0.000008809653,"about_ca_system_score_gemma":0.0000062770014,"threshold_uncertainty_score":0.2498316},"labels":[],"label_agreement":null},{"id":"W2114529148","doi":"10.1109/glocom.2010.5683989","title":"Bi-Directional Cooperative Relays for Transmitted Reference Pulse Cluster UWB Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Relay; Reliability (semiconductor); Electronic engineering; Channel state information; Channel (broadcasting); Computer network; Ultra-wideband; Telecommunications; Wireless; Engineering","score_opus":0.044040027847414204,"score_gpt":0.2887530284895423,"score_spread":0.24471300064212811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114529148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061186478,0.00016885377,0.9613014,0.0031820037,0.0010881923,0.00079650525,0.0000073831757,0.00031283716,0.027024215],"genre_scores_gemma":[0.95777416,0.00010294841,0.033794314,0.00082084164,0.0001334532,0.00034444727,0.000018655297,0.000011810075,0.0069993855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886453,0.00012443325,0.0002709718,0.0003543447,0.00015844483,0.00022727044],"domain_scores_gemma":[0.99832946,0.00038531155,0.000058179357,0.0006328028,0.0004934895,0.000100750076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044588768,0.00014717119,0.00016606155,0.00008665515,0.00040834094,0.00027265568,0.0008306466,0.00009526993,0.00014141745],"category_scores_gemma":[0.00007857366,0.00011957377,0.000054600423,0.00037966893,0.00005611492,0.00044910025,0.00013021722,0.00032870466,0.00006139078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027794265,0.000105359555,0.00011871994,0.000013686716,0.000037758848,8.089225e-7,0.0007212943,0.0003676827,0.018135626,0.93622816,0.0137124155,0.030530691],"study_design_scores_gemma":[0.0010175627,0.00013086841,0.0009284579,0.00003162881,0.000007742256,0.000032298183,0.000046157795,0.67980117,0.0031933528,0.000463939,0.313956,0.0003907953],"about_ca_topic_score_codex":0.00001580369,"about_ca_topic_score_gemma":0.00030542305,"teacher_disagreement_score":0.9516555,"about_ca_system_score_codex":0.000025478506,"about_ca_system_score_gemma":0.00009723838,"threshold_uncertainty_score":0.4876077},"labels":[],"label_agreement":null},{"id":"W2114679125","doi":"10.1109/vtcfall.2013.6692034","title":"A Game Theoretic Power Allocation and Relay Load Balancing in OFDMA-Based DF Cellular Relay Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; Computer science; Telecommunications link; Computer network; Cellular network; Transmission (telecommunications); Power (physics); Spectral efficiency; Scheme (mathematics); Telecommunications; Mathematics","score_opus":0.009025979824495505,"score_gpt":0.2157053734366227,"score_spread":0.20667939361212717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114679125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16047223,0.0017144448,0.8282362,0.0044049826,0.00013528833,0.00034278055,8.997402e-8,0.0001386296,0.0045552994],"genre_scores_gemma":[0.99063957,0.00042443938,0.0070782825,0.0013810146,0.000017104741,0.000056692388,0.000002234913,0.000009315901,0.0003913223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877757,0.00023540457,0.00026443112,0.0003125145,0.00016294193,0.00024713684],"domain_scores_gemma":[0.9988255,0.00022724696,0.00006986065,0.0006419037,0.00015002534,0.00008547361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005813365,0.00013589681,0.00014494844,0.000085976186,0.00009504316,0.0002028829,0.00052076293,0.000075525044,0.00021317128],"category_scores_gemma":[0.000050890358,0.00011619468,0.00002968063,0.0004611698,0.00006433176,0.00037159113,0.00024410615,0.00023424315,0.000049923212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027473843,0.00038036957,0.029025115,0.00004843198,0.00004396204,0.00001837409,0.006945497,0.082807995,0.01543487,0.7254265,0.004433891,0.13540755],"study_design_scores_gemma":[0.00037355206,0.000034073608,0.007054483,0.00008803735,0.0000021679523,0.0000015176531,0.000028660112,0.9905059,0.00054747885,0.00049609184,0.000696019,0.00017201852],"about_ca_topic_score_codex":0.00003950334,"about_ca_topic_score_gemma":0.00006278835,"teacher_disagreement_score":0.9076979,"about_ca_system_score_codex":0.00008003229,"about_ca_system_score_gemma":0.0000647611,"threshold_uncertainty_score":0.47382814},"labels":[],"label_agreement":null},{"id":"W2114939682","doi":"10.1049/iet-com.2010.0509","title":"Minimum mean squared error design of single-antenna two-way distributed relays based on full or partial channel state information","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Beamforming; Channel state information; Telecommunications link; Computer science; Mean squared error; Lagrange multiplier; Relay channel; Channel (broadcasting); Mathematical optimization; Control theory (sociology); Wireless; Telecommunications; Mathematics; Statistics; Power (physics)","score_opus":0.16356992139466783,"score_gpt":0.29878718463953674,"score_spread":0.1352172632448689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114939682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008760571,0.00009269156,0.9943087,0.0019685414,0.00012907045,0.0006532661,0.000062027604,0.00022015272,0.0016894663],"genre_scores_gemma":[0.93712866,0.00017240255,0.061910704,0.0004073772,0.000008206863,0.00016437855,0.00016310919,0.0000122809015,0.00003287879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773645,0.00080737803,0.0007012427,0.00020288804,0.00026383618,0.0002882144],"domain_scores_gemma":[0.9945415,0.00064977654,0.00043692207,0.0037163456,0.0005311856,0.0001242723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075452455,0.00020827848,0.00025238495,0.00021889855,0.00047007677,0.00010606496,0.0031902462,0.00006372823,0.00004981862],"category_scores_gemma":[0.00025099883,0.00018696222,0.0000890064,0.00095045666,0.00020179903,0.00085305853,0.0007275193,0.0002805165,0.00006820984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005542934,0.015182351,0.0007190544,0.0002646132,0.0008325817,0.000022351416,0.21962634,0.09123834,0.049803812,0.3479117,0.021941254,0.24691468],"study_design_scores_gemma":[0.001003581,0.00050175836,0.0003849119,0.00011487886,0.000017292728,0.0000033771926,0.00020901322,0.99199516,0.0021067495,0.00056297047,0.002835876,0.0002644524],"about_ca_topic_score_codex":0.000027681417,"about_ca_topic_score_gemma":0.00015148723,"teacher_disagreement_score":0.9362526,"about_ca_system_score_codex":0.00008975848,"about_ca_system_score_gemma":0.00015780529,"threshold_uncertainty_score":0.7624098},"labels":[],"label_agreement":null},{"id":"W2115167160","doi":"10.1109/ccece.2008.4564684","title":"Adaptive coded cooperative relaying schemes","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Signal-to-noise ratio (imaging); Outage probability; Computer science; Range (aeronautics); Probability of error; Algorithm; Mathematical optimization; Decoding methods; Fading; Mathematics; Telecommunications; Engineering","score_opus":0.039094567872777465,"score_gpt":0.21856473570095342,"score_spread":0.17947016782817596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115167160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065408066,0.00062558433,0.9205834,0.003069007,0.00028729544,0.0005824111,0.000005320973,0.0006219649,0.008816927],"genre_scores_gemma":[0.9852943,0.0007699775,0.012815892,0.00076567056,0.00010133974,0.000053556458,0.0000033280062,0.00001937072,0.0001766015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798846,0.000026435971,0.00031380952,0.0006897121,0.00025959,0.0007220016],"domain_scores_gemma":[0.9982638,0.000092304275,0.00007823135,0.00026329933,0.00061411806,0.0006882717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015508686,0.00038364917,0.00037853676,0.00041284118,0.0005845241,0.0004304165,0.00095049274,0.00014067246,0.000030875613],"category_scores_gemma":[0.00006562844,0.0003794091,0.000055083867,0.00086413434,0.00010060622,0.0006148544,0.00022471676,0.0006796674,0.00003081693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010125459,0.000033219363,0.0005546936,0.000010345638,0.000043225373,0.00003512084,0.0016484832,0.00016316993,0.0006612355,0.9454515,0.0008664195,0.050522484],"study_design_scores_gemma":[0.00034182836,0.00031937103,0.002319866,0.00012137795,0.0000050336953,0.00010346212,0.000020788539,0.9921809,0.0005015958,0.00035173466,0.0032066603,0.0005273738],"about_ca_topic_score_codex":0.00023722892,"about_ca_topic_score_gemma":0.00025410144,"teacher_disagreement_score":0.99201775,"about_ca_system_score_codex":0.00018719584,"about_ca_system_score_gemma":0.0005974767,"threshold_uncertainty_score":0.9998658},"labels":[],"label_agreement":null},{"id":"W2115189853","doi":"10.1109/tmc.2010.43","title":"Optimal Cooperative Relaying Schemes in IR-UWB Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of Melbourne; University of Cambridge","keywords":"Computer science; Computer network; Network packet; Throughput; Fading; Overhead (engineering); Relay; Wireless; Wireless network; Cooperative diversity; Diversity gain; Interval (graph theory); Distributed computing; Channel (broadcasting); Power (physics); Telecommunications","score_opus":0.01948486199234165,"score_gpt":0.27817714473698946,"score_spread":0.2586922827446478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115189853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16078956,0.00013753338,0.83691996,0.00018116942,0.0009686264,0.0003034331,7.5033086e-7,0.00024594658,0.000453016],"genre_scores_gemma":[0.95259607,0.00012784195,0.046767272,0.0002608146,0.00008337693,0.00005871912,0.0000013557968,0.000019523866,0.00008502055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982736,0.00019497501,0.00042021065,0.0005078652,0.00018762091,0.00041574254],"domain_scores_gemma":[0.99844235,0.00045389068,0.00009510109,0.0007730722,0.00012067494,0.00011490569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005458526,0.00023707739,0.00024835285,0.00022820542,0.000663811,0.00023632537,0.00093149213,0.00012930202,0.0000609312],"category_scores_gemma":[0.00001221001,0.0002453836,0.00009695405,0.001003223,0.00008693981,0.00041595055,0.00002702584,0.0014213695,0.000037203197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068385443,0.0001410163,0.000057113903,0.0000028003758,0.000016801727,0.000006183962,0.0008670434,0.8391181,0.0019021871,0.0023386627,0.00003674387,0.1555065],"study_design_scores_gemma":[0.00046306342,0.00009042679,0.00014746148,0.000068961774,0.0000038797375,0.000017855087,0.000068002555,0.99244744,0.004900016,0.000011254051,0.0015025606,0.00027910707],"about_ca_topic_score_codex":0.000007772175,"about_ca_topic_score_gemma":0.000099774465,"teacher_disagreement_score":0.7918065,"about_ca_system_score_codex":0.00006802984,"about_ca_system_score_gemma":0.00007588282,"threshold_uncertainty_score":0.9999998},"labels":[],"label_agreement":null},{"id":"W2115441830","doi":"10.1109/icc.2009.5198755","title":"Application of Phase Shift in Coherent Multi-Relay MIMO Communications","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"MIMO; Relay; Computer science; Channel state information; Bisection method; Channel (broadcasting); Electronic engineering; Control theory (sociology); Algorithm; Wireless; Telecommunications; Engineering; Physics","score_opus":0.06709356651470794,"score_gpt":0.3587904121879013,"score_spread":0.2916968456731934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115441830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004938996,0.00065124576,0.9855712,0.0050700083,0.000019991654,0.00027523056,7.0712144e-7,0.00007961828,0.0033930007],"genre_scores_gemma":[0.92138135,0.00037823524,0.077754326,0.0003942114,0.000004231545,0.000026351148,0.0000075694184,0.0000022502668,0.00005149227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992087,0.00012670721,0.00030347268,0.00015807388,0.000091896756,0.00011116867],"domain_scores_gemma":[0.99805814,0.00009353283,0.00009012769,0.0016418635,0.00007408812,0.00004225788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026426942,0.00007553831,0.0001216558,0.00010003185,0.00007920751,0.000028873332,0.001618806,0.00003252877,0.0000129144655],"category_scores_gemma":[0.000020554411,0.00007134679,0.000032860924,0.0005450919,0.00004375801,0.00019924784,0.00026314793,0.00012684519,0.000020585981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004283533,0.0013083409,0.00080129097,0.0000022692368,0.0000046683026,2.2150132e-7,0.0012684427,0.00017689409,0.006302898,0.45833436,0.00019360191,0.53160274],"study_design_scores_gemma":[0.0014600817,0.00009419827,0.021714913,0.00002495405,0.000002416392,8.455454e-7,0.000026714533,0.9655606,0.0014696372,0.0011243869,0.008374184,0.00014706496],"about_ca_topic_score_codex":0.000019352525,"about_ca_topic_score_gemma":0.0003043375,"teacher_disagreement_score":0.9653837,"about_ca_system_score_codex":0.000033069155,"about_ca_system_score_gemma":0.000028935532,"threshold_uncertainty_score":0.30081713},"labels":[],"label_agreement":null},{"id":"W2115481960","doi":"10.1109/twc.2009.081642","title":"Amplify-and-forward cooperative OFDM with multiple-relays: performance analysis and relay selection methods","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subcarrier; Orthogonal frequency-division multiplexing; Computer science; Relay; Pairwise error probability; Precoding; Algorithm; Signal-to-noise ratio (imaging); Selection (genetic algorithm); Electronic engineering; Channel (broadcasting); Topology (electrical circuits); Telecommunications; Fading; Mathematics; MIMO; Power (physics); Engineering; Physics; Artificial intelligence","score_opus":0.0355348168228404,"score_gpt":0.31450042061088695,"score_spread":0.2789656037880466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115481960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036839843,0.0004042316,0.959076,0.0025960093,0.00003686261,0.00039533796,0.0000061952264,0.00024646643,0.00039906538],"genre_scores_gemma":[0.82205045,0.0069086896,0.17033242,0.0003756971,0.0000062357626,0.0001391625,0.000007903217,0.000011371354,0.00016808257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980454,0.00069392764,0.00037319597,0.000449525,0.0001824279,0.00025552578],"domain_scores_gemma":[0.9968246,0.00077521475,0.00014309643,0.0018099707,0.00029197132,0.00015513263],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00051612756,0.00026330986,0.0003554452,0.0004877328,0.0016771051,0.00023422884,0.001039337,0.000110364956,0.000011271535],"category_scores_gemma":[0.000011801317,0.00023592568,0.00007764306,0.0024785295,0.00025183577,0.00070746953,0.000027520238,0.0007141908,0.0000068265463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006956444,0.00051701406,0.0012052523,0.000010078666,0.00062720984,5.474106e-7,0.003534264,0.042108797,0.0045516235,0.014048071,0.000029116363,0.93329847],"study_design_scores_gemma":[0.000612884,0.00037007834,0.0090681845,0.000055214667,0.00022436173,0.000022718034,0.00009522172,0.98207134,0.00584978,0.000029467743,0.00123608,0.00036465598],"about_ca_topic_score_codex":0.000027813068,"about_ca_topic_score_gemma":0.0005825656,"teacher_disagreement_score":0.93996257,"about_ca_system_score_codex":0.00008675704,"about_ca_system_score_gemma":0.000070161586,"threshold_uncertainty_score":0.9996226},"labels":[],"label_agreement":null},{"id":"W2115571348","doi":"10.1109/ccece.2008.4564652","title":"Performance of selection combining in cooperative relaying networks over Rayleigh fading channel","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Rayleigh fading; Moment-generating function; Fading; Probability density function; Cumulative distribution function; Maximal-ratio combining; Channel state information; Keying; Fading distribution; Topology (electrical circuits); Phase-shift keying; Closed-form expression; Algorithm; Diversity gain; Channel (broadcasting); Computer science; Diversity combining; Signal-to-noise ratio (imaging); Mathematics; Expression (computer science); Telecommunications; Statistics; Bit error rate; Mathematical analysis; Wireless; Combinatorics","score_opus":0.023912678544078424,"score_gpt":0.20813693243690268,"score_spread":0.18422425389282426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115571348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8112208,0.00021180956,0.18612434,0.000304355,0.00017307063,0.0003228096,8.7708344e-7,0.00014924443,0.0014926719],"genre_scores_gemma":[0.99701667,0.0010816627,0.0015659377,0.00018697689,0.00006106541,0.000035717112,0.0000025742183,0.000016287573,0.000033135515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982188,0.000027828108,0.00040673642,0.0005137185,0.00020351095,0.00062940334],"domain_scores_gemma":[0.9989589,0.00009094832,0.00011098504,0.0001564581,0.00036152283,0.00032122977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023826864,0.000304927,0.00040230088,0.00061027677,0.00030892767,0.00016875932,0.0006180298,0.00014263898,0.00001457827],"category_scores_gemma":[0.000039894345,0.00032016722,0.00004033321,0.0013023078,0.00006430813,0.000602699,0.00014754188,0.00067824754,0.000002307739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009970208,0.00024053988,0.0900748,0.00017491276,0.00014220735,0.000057444086,0.011286937,0.10715949,0.00501654,0.67830807,0.0005385962,0.10690076],"study_design_scores_gemma":[0.00039297467,0.0003215835,0.025271202,0.0002824454,0.0000031441105,0.000046712437,0.000012018962,0.97281396,0.0003859114,0.000041321633,0.00008016724,0.0003485726],"about_ca_topic_score_codex":0.0003373151,"about_ca_topic_score_gemma":0.00035135713,"teacher_disagreement_score":0.86565447,"about_ca_system_score_codex":0.00019695872,"about_ca_system_score_gemma":0.0003234968,"threshold_uncertainty_score":0.999925},"labels":[],"label_agreement":null},{"id":"W2115669786","doi":"10.1109/cwit.2013.6621609","title":"On the asymptotic performance of multiuser opportunistic df cooperative systems over frequency selective fading channels using MMSE SC-FDE","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Relay; Upper and lower bounds; Minimum mean square error; Bandwidth (computing); SC-FDE; Computer science; Equalization (audio); Diversity scheme; Algorithm; Maximal-ratio combining; Asymptotic analysis; Mathematics; Control theory (sociology); Telecommunications; Statistics; Decoding methods; Physics; Power (physics); Mathematical analysis","score_opus":0.06262594488949658,"score_gpt":0.2734310199580774,"score_spread":0.21080507506858082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115669786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8190893,0.00019478577,0.16755152,0.00045299227,0.0005181977,0.0011276162,0.0000023442963,0.00012843007,0.010934821],"genre_scores_gemma":[0.9969744,0.00010630461,0.0017416594,0.00042605517,0.00004509245,0.00007065551,0.0000017866822,0.000014448474,0.0006195699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983167,0.0003656382,0.00038662346,0.00033119167,0.00028286886,0.00031699848],"domain_scores_gemma":[0.99768895,0.00064341305,0.00019581777,0.0007893023,0.00058844476,0.00009408504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004606713,0.00022036616,0.00026107347,0.00012474734,0.0005044022,0.00025170954,0.0009982747,0.00005817981,0.00019324459],"category_scores_gemma":[0.00016373124,0.00014524223,0.00005449075,0.0006837822,0.00010358867,0.0007312119,0.0002929978,0.00026301236,0.00006715168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013968348,0.00025291662,0.0025573946,0.00005740449,0.0001921973,0.0000039852894,0.0067502167,0.0723149,0.038028702,0.87365186,0.001898619,0.004277826],"study_design_scores_gemma":[0.00020879494,0.0001437786,0.0012747529,0.00020269169,0.000006874812,0.000006964587,0.00009262564,0.99520695,0.0024296488,0.0001728265,0.000044703298,0.00020939925],"about_ca_topic_score_codex":0.00011627795,"about_ca_topic_score_gemma":0.0000093147555,"teacher_disagreement_score":0.92289203,"about_ca_system_score_codex":0.00014001058,"about_ca_system_score_gemma":0.00013475594,"threshold_uncertainty_score":0.5922806},"labels":[],"label_agreement":null},{"id":"W2115773137","doi":"10.1109/tvt.2012.2227576","title":"AF Cooperative CDMA Outage Probability Analysis in Nakagami-$m$ Fading Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Nakagami distribution; Cumulative distribution function; Probability density function; Signal-to-noise ratio (imaging); Interference (communication); Relay; Base station; Outage probability; Computer science; Maximal-ratio combining; Code division multiple access; Algorithm; Topology (electrical circuits); Fading distribution; Mathematics; Electronic engineering; Statistics; Telecommunications; Engineering; Channel (broadcasting); Physics; Decoding methods; Rayleigh fading; Combinatorics","score_opus":0.031911681769431946,"score_gpt":0.27552293624478347,"score_spread":0.24361125447535154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115773137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18596728,0.0003054969,0.8107971,0.0017982428,0.00026585077,0.00031126261,0.0000027423607,0.0003601798,0.00019184074],"genre_scores_gemma":[0.9930946,0.00016536828,0.0062130713,0.00018685305,0.00001612748,0.00018809517,0.0000020125285,0.000011211282,0.00012265866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823886,0.00027108807,0.00036271464,0.00045673733,0.00018092971,0.00048964814],"domain_scores_gemma":[0.99842787,0.000108359745,0.000079528894,0.001153016,0.00013766869,0.00009355332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005618228,0.00022342011,0.00036914612,0.0012126599,0.0003132557,0.000062768595,0.0009091312,0.00024191245,0.00005837086],"category_scores_gemma":[0.000024611705,0.00021712205,0.00015895977,0.0049592066,0.00014996126,0.0004923368,0.000022438602,0.0006562982,0.00006808853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056050925,0.0037926491,0.009652144,0.000045673736,0.0015659375,0.000049606555,0.0101275155,0.53816617,0.022187522,0.10959389,0.00008487654,0.30467796],"study_design_scores_gemma":[0.0019679125,0.00045082683,0.0045542954,0.00012597127,0.00030776547,0.000060120965,0.00048099042,0.80645514,0.1754364,0.0022757708,0.006310708,0.0015740829],"about_ca_topic_score_codex":0.000009023736,"about_ca_topic_score_gemma":0.000176047,"teacher_disagreement_score":0.80712736,"about_ca_system_score_codex":0.0002034906,"about_ca_system_score_gemma":0.000040669733,"threshold_uncertainty_score":0.88539803},"labels":[],"label_agreement":null},{"id":"W2115951725","doi":"10.1109/isit.2004.1365155","title":"On interacting encoders and decoders in multiuser settings","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Encoder; Relay; Computer science; Decoding methods; Channel (broadcasting); Algorithm; Theoretical computer science; Computer network; Physics","score_opus":0.022289680149858406,"score_gpt":0.28502823344738615,"score_spread":0.26273855329752777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115951725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50542074,0.00014208867,0.46300733,0.0130950855,0.00016594931,0.00016647547,9.8122584e-8,0.00017492095,0.017827332],"genre_scores_gemma":[0.9614435,0.00008747226,0.036163222,0.002227748,0.0000048879224,0.000004224331,2.556852e-7,0.0000030903498,0.0000656001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994857,0.00003694121,0.000115186034,0.00017903507,0.00006213498,0.00012100612],"domain_scores_gemma":[0.99948037,0.00020018207,0.000027028516,0.00023467148,0.000020893734,0.000036830486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018602137,0.00006488984,0.0000632471,0.00008490468,0.00007957023,0.00009010444,0.00028268748,0.000018994006,0.000011958527],"category_scores_gemma":[0.00010386287,0.000057983052,0.000012550758,0.00018918779,0.000017445052,0.00030564354,0.00019387798,0.000136668,0.00001660017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001719534,0.00019580801,0.0034047647,0.000011782025,0.000015614572,0.000020758709,0.022914976,0.015287251,0.0025349676,0.5765395,0.0009770319,0.37808034],"study_design_scores_gemma":[0.004931923,0.0002586853,0.015043192,0.0007461631,0.0000034841557,0.0000392257,0.0018468831,0.9409159,0.009807051,0.017460583,0.007945052,0.0010018597],"about_ca_topic_score_codex":0.000019318439,"about_ca_topic_score_gemma":0.00030452138,"teacher_disagreement_score":0.92562866,"about_ca_system_score_codex":0.000045601966,"about_ca_system_score_gemma":0.000017594988,"threshold_uncertainty_score":0.23644802},"labels":[],"label_agreement":null},{"id":"W2116074433","doi":"10.1109/glocom.2009.5425752","title":"Joint Power Allocation and Relay Selection in Cooperative Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University; Massachusetts Institute of Technology","keywords":"Relay; Mathematical optimization; Computer science; Maximization; Selection (genetic algorithm); Joint (building); Relaxation (psychology); Transmitter power output; Power (physics); Optimization problem; Relaxation technique; Minification; Transmission (telecommunications); Set (abstract data type); Resource allocation; Mathematics; Computer network; Telecommunications; Engineering; Artificial intelligence","score_opus":0.022269398800599333,"score_gpt":0.25871271075982993,"score_spread":0.2364433119592306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116074433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028380245,0.0003706238,0.9575067,0.005491906,0.00005276225,0.0001606544,2.8072613e-8,0.00011069883,0.007926374],"genre_scores_gemma":[0.99148595,0.00053078873,0.0061536324,0.0014618394,0.000013649849,0.0000056784747,9.2071406e-7,0.0000021232108,0.0003454109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993433,0.000115730974,0.00015749448,0.0001953531,0.00006494195,0.00012319414],"domain_scores_gemma":[0.9996457,0.00003374051,0.000030722502,0.00016253084,0.00008772055,0.000039555824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027337903,0.00007521436,0.000086030435,0.00007809828,0.00011227812,0.000109717614,0.00016674293,0.000039473045,0.000024040826],"category_scores_gemma":[0.00002631271,0.00006684445,0.000011672816,0.00050741236,0.000014924272,0.00038363438,0.00006968586,0.00014826909,0.000006291879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084905405,0.00011207642,0.00087694,8.517338e-7,0.000006449636,0.0000017534805,0.0014162123,0.028489437,0.0042550177,0.83179545,0.0022213112,0.13081601],"study_design_scores_gemma":[0.00024594564,0.000120472956,0.059124105,0.00001716898,7.064343e-7,0.000007417418,0.000021852438,0.93865514,0.00048685557,0.00022359256,0.0009769561,0.00011978374],"about_ca_topic_score_codex":0.0000036030413,"about_ca_topic_score_gemma":0.00008958773,"teacher_disagreement_score":0.96310574,"about_ca_system_score_codex":0.000043684206,"about_ca_system_score_gemma":0.000021651082,"threshold_uncertainty_score":0.27258372},"labels":[],"label_agreement":null},{"id":"W2116084766","doi":"10.1109/pimrc.2008.4699554","title":"Vandermonde matrix packet-level FEC for joint recovery from errors and packet loss","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Retransmission; Computer science; Network packet; Erasure code; Erasure; Error detection and correction; Forward error correction; Decoding methods; Packet loss; Algorithm; Computer network","score_opus":0.11469189257240839,"score_gpt":0.29579177381028005,"score_spread":0.18109988123787166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116084766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15414596,0.0010414,0.8391482,0.0034714343,0.0002294514,0.00026827652,0.000018029732,0.00016345884,0.0015137879],"genre_scores_gemma":[0.8605225,0.0029432976,0.13174905,0.001128595,0.000072002294,0.000029768757,0.000019542947,0.000012724995,0.003522533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898994,0.00008204542,0.00023443929,0.00034095946,0.00012953581,0.00022306896],"domain_scores_gemma":[0.9988016,0.0002787752,0.000071014816,0.00063876325,0.00010078247,0.00010909848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020571379,0.00014506083,0.0001958568,0.00006513298,0.00036099806,0.000098603196,0.0004658546,0.00005888073,0.000070599024],"category_scores_gemma":[0.00006470497,0.00012525899,0.00007151174,0.00018311845,0.000070867165,0.00038113806,0.00039530022,0.00011016037,0.000028456874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001390543,0.00042763934,0.010364171,0.000047575024,0.00029347537,0.00006194495,0.008051281,0.00016243212,0.010837292,0.13913208,0.23605871,0.59442437],"study_design_scores_gemma":[0.008494562,0.0009138409,0.25628906,0.00025720356,0.00006407171,0.00032766187,0.0006426545,0.4931759,0.024085471,0.081728056,0.13087007,0.0031514356],"about_ca_topic_score_codex":0.000025543222,"about_ca_topic_score_gemma":0.00013670934,"teacher_disagreement_score":0.70739913,"about_ca_system_score_codex":0.000035221914,"about_ca_system_score_gemma":0.00006250821,"threshold_uncertainty_score":0.51079136},"labels":[],"label_agreement":null},{"id":"W2116324928","doi":"10.1109/vetecs.2009.5073454","title":"Comparison of Relaying Strategies for Cooperative Diversity Systems with Adaptive Modulation","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Computer science; Cooperative diversity; Spectral efficiency; Link adaptation; Outage probability; Signal-to-noise ratio (imaging); Transmission (telecommunications); Diversity gain; Maximal-ratio combining; Diversity combining; Modulation (music); Fading; Electronic engineering; Computer network; Telecommunications; Decoding methods; Engineering; Channel (broadcasting)","score_opus":0.11017612441022161,"score_gpt":0.326211266015053,"score_spread":0.2160351416048314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116324928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0246502,0.00017645735,0.9694902,0.00020571018,0.000039944087,0.0003188923,9.681225e-7,0.00006891264,0.0050487476],"genre_scores_gemma":[0.97700405,0.000013440512,0.022818707,0.00004759891,0.000010653899,0.000006578192,0.0000027924407,0.0000019131721,0.0000942357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936026,0.0000741832,0.00016834942,0.0001633627,0.00013151772,0.00010231139],"domain_scores_gemma":[0.99908155,0.00011025045,0.000111814676,0.00027253572,0.00039417774,0.00002967092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001570004,0.00008297228,0.00017604449,0.000049378657,0.00036282407,0.000090628186,0.00038376538,0.000027004176,0.0000021488831],"category_scores_gemma":[0.000008463466,0.00006458355,0.000023400446,0.0002495027,0.000030121959,0.00061275845,0.00013624881,0.00006351341,8.016228e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038172417,0.000068636786,0.0010431402,0.0000046890805,0.000019423573,1.8375678e-7,0.004454345,0.089692816,0.00047617668,0.8950212,0.00027464225,0.008906544],"study_design_scores_gemma":[0.00033887764,0.00055527745,0.0045142523,0.000039270602,0.0000050184535,7.3617167e-7,0.0018116134,0.99153847,0.00044514792,0.0005619327,0.000081865444,0.00010757063],"about_ca_topic_score_codex":0.000011455857,"about_ca_topic_score_gemma":0.000029239363,"teacher_disagreement_score":0.9523539,"about_ca_system_score_codex":0.000032524826,"about_ca_system_score_gemma":0.00005060968,"threshold_uncertainty_score":0.2790586},"labels":[],"label_agreement":null},{"id":"W2116523945","doi":"10.1109/icc.2008.438","title":"Geometric Random Linear Codes in Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless sensor network; Computer science; Random access; Decoding methods; Scalability; Linear network coding; Server; Linear code; Encoding (memory); Coding (social sciences); Key distribution in wireless sensor networks; Node (physics); Computer network; Sensor node; Theoretical computer science; Distributed computing; Algorithm; Wireless; Wireless network; Block code; Mathematics; Engineering; Telecommunications; Artificial intelligence","score_opus":0.050354400067593175,"score_gpt":0.27528821466938597,"score_spread":0.2249338146017928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116523945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021050034,0.0008836617,0.96960527,0.0006661718,0.00011061898,0.00011474557,1.027668e-7,0.00013645785,0.0074329167],"genre_scores_gemma":[0.9563214,0.003645303,0.037918698,0.000659995,0.000049698327,0.000008545418,0.0000014497317,0.000004270937,0.0013906368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919015,0.00013351066,0.00019188851,0.00018369031,0.00011127042,0.00018947707],"domain_scores_gemma":[0.99906504,0.00030545096,0.000031767075,0.00047552044,0.00006794442,0.000054289263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003051193,0.00008149327,0.00014583707,0.00021894765,0.0001463385,0.000032139425,0.00059823255,0.000036959947,0.00005921624],"category_scores_gemma":[0.00007574173,0.00006913684,0.000037173082,0.0017140032,0.00003560186,0.00018544334,0.0002555621,0.00015889222,0.000054182878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014965338,0.00094736123,0.1115271,0.000016326932,0.000091245645,0.00031845033,0.0042943093,0.23933351,0.0006548609,0.10804627,0.046653878,0.48796704],"study_design_scores_gemma":[0.0011020097,0.00002184636,0.015045348,0.000008844748,6.8806656e-7,0.000024258654,0.000007792426,0.9768417,0.00017476756,0.00002127175,0.006611147,0.00014034822],"about_ca_topic_score_codex":0.000010690282,"about_ca_topic_score_gemma":0.000041251067,"teacher_disagreement_score":0.9352714,"about_ca_system_score_codex":0.000024206021,"about_ca_system_score_gemma":0.000026125763,"threshold_uncertainty_score":0.28193185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.054201976055747676,"score_gpt":0.2942957767705044,"score_spread":0.24009380071475672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116551454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2417888,0.001869109,0.7210186,0.03337959,0.00019928522,0.0012353647,0.000007753214,0.00010775075,0.0003937205],"genre_scores_gemma":[0.9495674,0.0005775906,0.048906993,0.0005822397,0.000025935273,0.00029623174,0.000008471128,0.000011013044,0.000024165993],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860483,0.0002655693,0.00049691787,0.00025443686,0.00014216384,0.00023606484],"domain_scores_gemma":[0.99571395,0.0013864863,0.00020695051,0.0025625871,0.0000944174,0.000035596197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010094143,0.0001463465,0.00020769877,0.0001293302,0.00060809264,0.00010661023,0.0024766827,0.00005198826,0.0000019250233],"category_scores_gemma":[0.00009980911,0.00011605669,0.00008893323,0.00044977985,0.00022165422,0.00039349025,0.00075045205,0.000269258,0.000001130836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013332264,0.001384707,0.042440698,0.0003439142,0.00015418619,0.000003271,0.036668766,0.048003968,0.37868407,0.27594528,0.012401002,0.20383681],"study_design_scores_gemma":[0.0025350964,0.00009472709,0.03441607,0.00073931995,0.000050220562,0.000009621011,0.00037107436,0.8857872,0.029113151,0.015159125,0.030781148,0.00094328175],"about_ca_topic_score_codex":0.000038542756,"about_ca_topic_score_gemma":0.00017066975,"teacher_disagreement_score":0.8377832,"about_ca_system_score_codex":0.000082328384,"about_ca_system_score_gemma":0.000029684586,"threshold_uncertainty_score":0.47326544},"labels":[],"label_agreement":null},{"id":"W2116555730","doi":"10.1109/glocom.2010.5684083","title":"A Dual-Hop Amplify-and-Forward MIMO Cooperative Beamformer in Distributed Wireless Sensor Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Beamforming; MIMO; Computer science; Hop (telecommunications); Node (physics); Relay channel; Computer network; Wireless sensor network; Wireless; Signal-to-noise ratio (imaging); Wireless network; Transmitter power output; Topology (electrical circuits); Wireless ad hoc network; Fading; Power (physics); Control theory (sociology); Transmitter; Telecommunications; Engineering; Channel (broadcasting); Electrical engineering; Physics","score_opus":0.0184860146258826,"score_gpt":0.2643156418448829,"score_spread":0.24582962721900029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116555730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16034393,0.00015217172,0.8322271,0.003092583,0.0003522437,0.00036013138,0.000006489503,0.0002080658,0.003257248],"genre_scores_gemma":[0.9859677,0.00047123196,0.012065589,0.000875533,0.00007023765,0.00004011209,0.000028141452,0.0000108999875,0.0004705699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862486,0.00014193502,0.00032154747,0.00039697145,0.00014648493,0.0003681791],"domain_scores_gemma":[0.9986492,0.0002747331,0.000067543515,0.0006872085,0.00016545772,0.0001558588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043609677,0.00020151373,0.0002501128,0.00009499055,0.00025287006,0.00026827634,0.00055537536,0.00012693471,0.00009929776],"category_scores_gemma":[0.00006372601,0.00016832122,0.000038373055,0.00071546866,0.00012205007,0.00043195064,0.00059414,0.00065909047,0.000029147313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005324534,0.0004020688,0.011383276,0.000015272963,0.00008572168,0.000032528664,0.0037037898,0.0029543587,0.014664077,0.77953297,0.0055105416,0.18166214],"study_design_scores_gemma":[0.0011022761,0.000078288285,0.011441592,0.00003729821,0.0000060272723,0.000045190754,0.00017898474,0.9452661,0.00080273504,0.0002057535,0.040266313,0.00056941033],"about_ca_topic_score_codex":0.000029084702,"about_ca_topic_score_gemma":0.001216399,"teacher_disagreement_score":0.94231176,"about_ca_system_score_codex":0.000028799914,"about_ca_system_score_gemma":0.000055539054,"threshold_uncertainty_score":0.68639404},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0326593209367927,"score_gpt":0.26295878030493214,"score_spread":0.23029945936813945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116674255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10183093,0.00007832136,0.89615107,0.00048044085,0.00008293245,0.00021615539,0.00000967398,0.000091835886,0.0010586514],"genre_scores_gemma":[0.96621597,0.0024283633,0.031022048,0.00009211818,0.0000061731034,0.0000567407,0.0000060671273,0.000008757284,0.00016377716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988434,0.00022499988,0.00027310688,0.0002866597,0.00019082332,0.00018105388],"domain_scores_gemma":[0.9971396,0.0004372658,0.00015230884,0.0016697117,0.00049742224,0.000103732185],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030774734,0.00017470344,0.00027451484,0.0004115681,0.0017458082,0.000063054846,0.0013915075,0.000092669216,0.00003965954],"category_scores_gemma":[0.0000062733307,0.00016051372,0.00009895748,0.0025002942,0.00033355205,0.000517151,0.00008392929,0.0007522197,0.0000054442303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011387077,0.0010932279,0.006095055,0.000006665489,0.00192948,4.332099e-7,0.0045309886,0.841828,0.001035944,0.017444154,0.000051489682,0.12587072],"study_design_scores_gemma":[0.0002867029,0.0002751896,0.0061236247,0.000020870395,0.00039862274,0.0000046281816,0.000079821744,0.9914056,0.0009900904,0.000007156817,0.00021768556,0.00018998931],"about_ca_topic_score_codex":0.00007196743,"about_ca_topic_score_gemma":0.005544287,"teacher_disagreement_score":0.865129,"about_ca_system_score_codex":0.000047628815,"about_ca_system_score_gemma":0.00007442374,"threshold_uncertainty_score":0.9995538},"labels":[],"label_agreement":null},{"id":"W2116674353","doi":"10.1109/icassp.2012.6288418","title":"Sum rate maximization for multi-pair two-way relaying with single-antenna amplify and forward relays","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Maximization; Computational complexity theory; Mathematical optimization; Computer science; Optimization problem; Relay; Signal-to-noise ratio (imaging); Algorithm; Power (physics); Mathematics; Telecommunications","score_opus":0.0915248579450896,"score_gpt":0.2968180543031793,"score_spread":0.2052931963580897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116674353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007833016,0.00047862815,0.9888462,0.0011094653,0.00012953233,0.0004306647,9.80599e-7,0.00019234321,0.0009791635],"genre_scores_gemma":[0.71555394,0.00010601213,0.28291142,0.0005608585,0.0000414079,0.000057568763,0.000007680933,0.000013769012,0.0007473805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990403,0.00011350556,0.00019579369,0.0002475786,0.00008750462,0.00031529364],"domain_scores_gemma":[0.99893725,0.0002154419,0.00009291445,0.00047404357,0.00015711418,0.00012321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059585844,0.00014181423,0.00014501596,0.000075626376,0.00035882732,0.00017464034,0.00033567857,0.00004489289,0.000010309086],"category_scores_gemma":[0.00007701201,0.00010993593,0.00002901208,0.00027748098,0.00004457309,0.0008778221,0.00024588231,0.00011522251,0.000009657229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018262959,0.0007389333,0.07293014,0.00009419185,0.00017354831,0.000003164406,0.00920898,0.0010723071,0.027634354,0.6325578,0.0033652063,0.25203872],"study_design_scores_gemma":[0.0020467143,0.00018366253,0.006605152,0.00007307132,0.000020410349,0.000024599689,0.00015634924,0.9689023,0.002077411,0.00018290407,0.019287443,0.00043998082],"about_ca_topic_score_codex":0.000004722783,"about_ca_topic_score_gemma":0.000059971815,"teacher_disagreement_score":0.96783,"about_ca_system_score_codex":0.000038019814,"about_ca_system_score_gemma":0.000017627171,"threshold_uncertainty_score":0.4483057},"labels":[],"label_agreement":null},{"id":"W2116770744","doi":"10.1109/glocom.2007.739","title":"Performance Analysis of Dual-Hop Relaying Communications Over Generalized Gamma Fading Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Probability density function; Gamma distribution; Generalized gamma distribution; Fading distribution; Computer science; Mathematics; Path loss; Closed-form expression; Channel (broadcasting); Topology (electrical circuits); Algorithm; Rayleigh fading; Statistics; Wireless; Telecommunications; Combinatorics; Mathematical analysis","score_opus":0.06881645325810189,"score_gpt":0.3239001044126403,"score_spread":0.2550836511545384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116770744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48029575,0.00049973367,0.497716,0.00065182283,0.0001227926,0.00012406132,7.728148e-7,0.00014291012,0.020446144],"genre_scores_gemma":[0.9530897,0.0015427744,0.044276617,0.0003376871,0.000019079242,0.0000069627336,0.000009946449,0.0000061262604,0.0007110646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987558,0.00012451268,0.00045467654,0.00021458768,0.0002089373,0.00024147294],"domain_scores_gemma":[0.9972597,0.0003061726,0.00017397439,0.0019797594,0.0002043669,0.000076021926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011999832,0.00011609021,0.00025640544,0.0005114254,0.00034550103,0.00006990386,0.0014379412,0.000047565234,0.00010035751],"category_scores_gemma":[0.000039353417,0.00010871443,0.000132015,0.0028986079,0.00007408018,0.00042966337,0.00096306513,0.00015284769,0.000010403251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003237177,0.00038450724,0.067273706,0.000030306717,0.0017204565,0.0000037233956,0.014950942,0.026198426,0.039397646,0.5985889,0.0015385536,0.24988051],"study_design_scores_gemma":[0.00024509852,0.00002069034,0.02669363,0.000021203667,0.000070547765,0.0000013756774,0.000048438964,0.9649057,0.0033628275,0.00003757684,0.004417598,0.00017532228],"about_ca_topic_score_codex":0.000021798469,"about_ca_topic_score_gemma":0.0001272517,"teacher_disagreement_score":0.9387073,"about_ca_system_score_codex":0.000053151587,"about_ca_system_score_gemma":0.000026398407,"threshold_uncertainty_score":0.44332457},"labels":[],"label_agreement":null},{"id":"W2116812846","doi":"10.1109/twc.2009.12.090361","title":"Optimum beamforming in the broadcasting phase of bidirectional cooperative communication with multiple decode-and-forward relays","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Beamforming; Computer science; Broadcasting (networking); Upper and lower bounds; Signal-to-noise ratio (imaging); Relay; Telecommunications; Electronic engineering; Algorithm; Computer network; Mathematics; Power (physics); Engineering","score_opus":0.04706128904993414,"score_gpt":0.30859168285746114,"score_spread":0.261530393807527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116812846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0382939,0.00081436086,0.95258546,0.0063567096,0.000036687205,0.00065583654,0.000012246207,0.0001098053,0.0011349869],"genre_scores_gemma":[0.9374624,0.0041770814,0.057745636,0.0003657651,0.000005472693,0.00018837678,0.000012542733,0.000010664195,0.000032064323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981045,0.0006472696,0.0005060048,0.00026676222,0.00025652128,0.0002189253],"domain_scores_gemma":[0.99558955,0.0014389375,0.00020763432,0.0024343643,0.00026646035,0.000063053914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007175839,0.00020418064,0.0002544085,0.00027633258,0.0011405955,0.00012315717,0.0021830816,0.000072577306,0.000006194241],"category_scores_gemma":[0.000022219372,0.00016415457,0.00006711853,0.0012685708,0.0002819038,0.00064899767,0.000031169842,0.0006963145,0.0000036738566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012979384,0.002669763,0.00016798328,0.000013428804,0.00008596324,0.0000017748839,0.016150765,0.0258815,0.004513413,0.053574055,0.0000656722,0.89674586],"study_design_scores_gemma":[0.0027347351,0.0006350886,0.001207877,0.0003841703,0.000039381404,0.00006718974,0.0011945595,0.9853891,0.00578253,0.00034264696,0.0017964308,0.0004262744],"about_ca_topic_score_codex":0.00003740701,"about_ca_topic_score_gemma":0.0006674056,"teacher_disagreement_score":0.95950764,"about_ca_system_score_codex":0.00007884809,"about_ca_system_score_gemma":0.00009973005,"threshold_uncertainty_score":0.8772654},"labels":[],"label_agreement":null},{"id":"W2116958737","doi":"10.1109/icc.2011.5962490","title":"Range of Achievable Diversity Order in Multiple Relay Networks with Multiple Users","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Upper and lower bounds; Cooperative diversity; Diversity (politics); Signal-to-noise ratio (imaging); Order (exchange); Computer science; Selection (genetic algorithm); Diversity gain; Range (aeronautics); Relay channel; Computer network; Outage probability; Telecommunications; Topology (electrical circuits); Mathematics; Fading; Wireless; Physics; Combinatorics; Engineering; Power (physics); Wireless network; Business; Decoding methods","score_opus":0.06417028442210491,"score_gpt":0.22997038799768388,"score_spread":0.16580010357557895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116958737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29048455,0.00017018658,0.69936156,0.000112971116,0.00008075313,0.00024718078,5.137593e-7,0.0001019235,0.009440357],"genre_scores_gemma":[0.9319324,0.000127776,0.06751949,0.00014489294,0.0000055070677,0.0000057589273,9.580071e-7,0.0000048548536,0.00025837412],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991901,0.00011368605,0.00016310535,0.00021417471,0.00012295543,0.00019597993],"domain_scores_gemma":[0.9989707,0.0001564075,0.00006884491,0.00060472055,0.00014356802,0.00005579485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028024457,0.00009970835,0.0001511572,0.00008223269,0.00017708224,0.000018655677,0.00087096356,0.00004485632,0.00007448575],"category_scores_gemma":[0.000045141438,0.00007988075,0.000026704241,0.000682594,0.000071131704,0.0004226588,0.0010172346,0.00015702892,0.00000774347],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059949205,0.0001416401,0.98382145,0.0000033331544,0.00001445893,0.0000037543737,0.0030674648,0.0042308746,0.000037432004,0.0048731356,0.00020929001,0.0035372344],"study_design_scores_gemma":[0.0015741524,0.00010177598,0.36820027,0.00003667506,0.0000040665036,0.0000018057787,0.0001196794,0.62917864,0.00021325954,0.000036892223,0.00033884478,0.00019391568],"about_ca_topic_score_codex":0.00036956937,"about_ca_topic_score_gemma":0.0038542529,"teacher_disagreement_score":0.64144784,"about_ca_system_score_codex":0.000025910387,"about_ca_system_score_gemma":0.000021297948,"threshold_uncertainty_score":0.32574424},"labels":[],"label_agreement":null},{"id":"W2117145663","doi":"10.1109/tcomm.2010.03.080118","title":"Capacity of amplify-and-forward multi-hop relaying systems under adaptive transmission","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Channel capacity; Nakagami distribution; Signal-to-noise ratio (imaging); Computer science; Control theory (sociology); Noise power; Communications system; Adaptive system; Channel (broadcasting); Electronic engineering; Topology (electrical circuits); Mathematics; Power (physics); Telecommunications; Engineering; Physics","score_opus":0.10172004464597555,"score_gpt":0.30624978644737333,"score_spread":0.20452974180139777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117145663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032263563,0.00039679412,0.9916648,0.0023800249,0.00030796428,0.00031759404,0.000012277622,0.00016913272,0.0015250073],"genre_scores_gemma":[0.9145071,0.0022380098,0.08285542,0.00009316264,0.000009150219,0.00008530932,0.0000025140612,0.0000145463955,0.0001948021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985016,0.00039782177,0.00044191032,0.0002795396,0.00019115931,0.00018794193],"domain_scores_gemma":[0.99608606,0.00070995296,0.00015922273,0.002637055,0.00026945572,0.00013824122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004782939,0.0001826428,0.00024742822,0.00021877314,0.000947259,0.00007284161,0.0017726393,0.00013875961,0.000025490925],"category_scores_gemma":[0.000011914989,0.0001724834,0.000084411135,0.0005512455,0.00040083478,0.00040268168,0.000029286237,0.00095670763,0.000014694472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037179823,0.001355483,0.000046004625,0.0000513672,0.00022559379,4.3495652e-7,0.010753549,0.016564855,0.15514901,0.56343055,0.00018807512,0.25219792],"study_design_scores_gemma":[0.0012468381,0.0001959702,0.0009081019,0.00026574952,0.00006692333,0.000027275533,0.00069645065,0.97480047,0.008392338,0.0011942609,0.011649771,0.0005558716],"about_ca_topic_score_codex":0.00012621644,"about_ca_topic_score_gemma":0.0003443978,"teacher_disagreement_score":0.9582356,"about_ca_system_score_codex":0.00004043134,"about_ca_system_score_gemma":0.00006178482,"threshold_uncertainty_score":0.7285646},"labels":[],"label_agreement":null},{"id":"W2117238805","doi":"10.1186/1687-1499-2012-300","title":"Inter-relay Handoff in two-hop relaying networks with highly mobile vehicles","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Relay; Handover; Computer science; Computer network; RSS; Cellular network; Hop (telecommunications); Base station; Transmission (telecommunications); Telecommunications","score_opus":0.03865581625037046,"score_gpt":0.3005166614991721,"score_spread":0.26186084524880165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117238805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50683975,0.069356255,0.41132334,0.0041526444,0.001252076,0.0007235897,0.0000010577919,0.00029939448,0.006051914],"genre_scores_gemma":[0.9566032,0.033125963,0.009192185,0.00060425804,0.0003279248,0.00005497126,0.000004248741,0.00003115354,0.00005603725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973752,0.00091885775,0.0005967724,0.00026662997,0.00023514351,0.00060738745],"domain_scores_gemma":[0.99671084,0.00092471024,0.00036389407,0.0015994305,0.00013650818,0.0002646283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016936978,0.00028246804,0.0003466165,0.00027528818,0.001240008,0.0005100413,0.0017660117,0.00007042961,0.0000061039214],"category_scores_gemma":[0.000012810904,0.00023313606,0.00007251849,0.0009273588,0.0001709626,0.0009229014,0.0009991428,0.0014407403,0.0000074637383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006366395,0.00039219623,0.07278583,0.000006559252,0.00007829973,0.000011620951,0.0037768935,0.012061099,0.00022217039,0.02412452,0.0003192201,0.88615793],"study_design_scores_gemma":[0.0029730978,0.00043332865,0.012117424,0.0020602192,0.000036290665,0.00046206143,0.00047516887,0.88898176,0.00009565819,0.00018281805,0.09119486,0.0009873114],"about_ca_topic_score_codex":0.000007883799,"about_ca_topic_score_gemma":0.00011241012,"teacher_disagreement_score":0.88517064,"about_ca_system_score_codex":0.00013454386,"about_ca_system_score_gemma":0.00004613899,"threshold_uncertainty_score":0.9537265},"labels":[],"label_agreement":null},{"id":"W2117247368","doi":"10.1109/icc.2011.5962909","title":"Adaptive Resource Allocation in OFDMA Relay Networks with Network Coding","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Orthogonal frequency-division multiplexing; Linear network coding; Rayleigh fading; Computer network; Resource allocation; Relay; Link adaptation; Frequency-division multiple access; Fading; Bit error rate; Transmitter power output; Coding (social sciences); Channel (broadcasting); Power (physics); Transmitter; Mathematics","score_opus":0.05506769181808765,"score_gpt":0.23849722765124798,"score_spread":0.18342953583316032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117247368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002003831,0.000575478,0.947808,0.0005503959,0.00007202458,0.00020149982,6.552172e-8,0.00017493735,0.048613764],"genre_scores_gemma":[0.92844224,0.0004257101,0.069707185,0.00076341006,0.000060311748,0.000043110897,0.0000017179216,0.000010599765,0.00054568326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988008,0.00021921715,0.00023081942,0.00031211335,0.00013301386,0.00030403576],"domain_scores_gemma":[0.99899185,0.0001242987,0.00009207832,0.00062843837,0.00009096276,0.00007235297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051116245,0.00013490033,0.00014632281,0.000076281984,0.0001735947,0.00006128261,0.00081524084,0.000058119567,0.000062770516],"category_scores_gemma":[0.000011549701,0.00011048302,0.00002455689,0.000967524,0.000048158377,0.0003780212,0.00032362962,0.00025626956,0.000013073364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009168709,0.00012678634,0.012746677,0.0000030223662,0.00003787403,0.000015480735,0.0045361854,0.10706409,0.000024508303,0.75668305,0.004337216,0.114333406],"study_design_scores_gemma":[0.00039598864,0.00012427311,0.019622367,0.00014320432,0.000004306433,0.000006314632,0.000114707764,0.9756366,0.00008433966,0.0002872301,0.0033207966,0.00025986444],"about_ca_topic_score_codex":0.000029725446,"about_ca_topic_score_gemma":0.0005397682,"teacher_disagreement_score":0.92643845,"about_ca_system_score_codex":0.000053373216,"about_ca_system_score_gemma":0.000036968373,"threshold_uncertainty_score":0.45053667},"labels":[],"label_agreement":null},{"id":"W2117341422","doi":"10.1109/netcod.2012.6261881","title":"A geometric framework for investigating the multiple unicast network coding conjecture","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Unicast; Conjecture; Linear network coding; Mathematical proof; Computer science; Coding (social sciences); Theoretical computer science; Graph; Collatz conjecture; Graph theory; Mathematics; Discrete mathematics; Combinatorics; Multicast; Distributed computing; Computer network","score_opus":0.09101748553738828,"score_gpt":0.31422118654513365,"score_spread":0.22320370100774536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117341422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020595458,0.0022768206,0.98858166,0.004571132,0.00048067304,0.0003673574,7.295556e-7,0.00018378625,0.0014783089],"genre_scores_gemma":[0.7068072,0.000118717384,0.2898729,0.0026388795,0.00039457492,0.000053812677,0.0000020231928,0.000008621486,0.000103253406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875003,0.0001788815,0.00023041612,0.00019548113,0.00014882398,0.0004963574],"domain_scores_gemma":[0.9952048,0.0035813996,0.000116353476,0.00086149195,0.00009879435,0.00013715008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011276696,0.00013881862,0.00014838381,0.00006351921,0.0008513098,0.00022515333,0.0012852077,0.00007567179,0.000028444523],"category_scores_gemma":[0.0012204491,0.00009171267,0.00007605383,0.0015936568,0.00006922017,0.0003608756,0.00063612126,0.00031503255,0.000019849202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011605582,0.000018580971,0.0072422964,0.0000046771556,0.000017668224,7.2075174e-8,0.0008996856,0.0007484987,0.000050090443,0.94439846,0.0053513222,0.041267496],"study_design_scores_gemma":[0.0008526598,0.000107076616,0.015961243,0.0002051071,0.000027754464,0.000026846146,0.000299338,0.7125251,0.0012103826,0.031186726,0.23680173,0.000795996],"about_ca_topic_score_codex":0.0000030802023,"about_ca_topic_score_gemma":0.000014188497,"teacher_disagreement_score":0.9132117,"about_ca_system_score_codex":0.000040220813,"about_ca_system_score_gemma":0.000034986126,"threshold_uncertainty_score":0.6547673},"labels":[],"label_agreement":null},{"id":"W2117482630","doi":"10.1109/cwit.2009.5069508","title":"A key-based error control scheme for network coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Transmitter; Scheme (mathematics); Coding (social sciences); Key (lock); Adversarial system; Error detection and correction; Theoretical computer science; Algorithm; Computer network; Mathematics; Artificial intelligence; Computer security","score_opus":0.047505654006580605,"score_gpt":0.30161578559316027,"score_spread":0.2541101315865797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117482630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024313075,0.00027189034,0.9807291,0.012407003,0.00012023748,0.00030162663,5.346413e-7,0.00025154406,0.0056749056],"genre_scores_gemma":[0.74587816,0.000015256324,0.24342379,0.010234071,0.00010149184,0.000026426978,0.0000022640925,0.0000038471685,0.00031465935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991556,0.00006235594,0.00018337376,0.00021915478,0.000100398756,0.0002791166],"domain_scores_gemma":[0.9989478,0.00024407651,0.000056269077,0.00054262707,0.00013353696,0.000075678036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039522094,0.000104532955,0.00014403416,0.00003869155,0.00029221876,0.00014418436,0.0007442719,0.000035541187,0.00003332445],"category_scores_gemma":[0.000053473443,0.00009249019,0.00007775239,0.0003064708,0.00001625166,0.00018590532,0.000049016697,0.00008455138,0.000018211607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002345043,0.000058697537,0.00017637502,0.0000031967304,0.000011649036,9.220924e-7,0.00009955986,0.003082055,0.0014638294,0.9104814,0.022325851,0.062273014],"study_design_scores_gemma":[0.0010332193,0.000104528845,0.00054426224,0.000022392092,0.0000027745969,8.117807e-7,0.0000028900076,0.9468189,0.0002810165,0.0017146515,0.049327895,0.00014666261],"about_ca_topic_score_codex":3.9627486e-7,"about_ca_topic_score_gemma":0.000007586516,"teacher_disagreement_score":0.94373685,"about_ca_system_score_codex":0.000027100903,"about_ca_system_score_gemma":0.00005650071,"threshold_uncertainty_score":0.37716404},"labels":[],"label_agreement":null},{"id":"W2117541287","doi":"10.1109/icc.2008.413","title":"Throughput Optimization for Hierarchical Cooperation in Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Throughput; Computer science; Wireless ad hoc network; Scheme (mathematics); Computer network; Scaling; Exponent; Wireless; Cluster (spacecraft); Wireless network; Mobile ad hoc network; Distributed computing; Mathematics; Network packet; Telecommunications","score_opus":0.05149140509389501,"score_gpt":0.2847153561578143,"score_spread":0.2332239510639193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117541287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013403976,0.0008183358,0.99383146,0.0020853167,0.00012996688,0.0002979032,2.4492073e-7,0.00011359844,0.0013827542],"genre_scores_gemma":[0.64673793,0.0068526226,0.34447044,0.001280767,0.000052203097,0.00008214825,0.000023762974,0.000008466155,0.0004916506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917936,0.000099034536,0.00022020777,0.00023694834,0.00008468295,0.00017974207],"domain_scores_gemma":[0.9992712,0.00015038163,0.000034429446,0.00037662723,0.0001225767,0.00004477649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021651259,0.000088902576,0.00011356105,0.00007064134,0.0002588492,0.00006553232,0.0004446677,0.000055874527,0.00004069604],"category_scores_gemma":[0.00005131549,0.00008186237,0.000032975087,0.0004821555,0.000038477603,0.00044245503,0.00015040414,0.00012175852,0.0000053005347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023003186,0.00012012449,0.00025555003,0.0000030908996,0.0000067346014,0.000002822196,0.0010056342,0.63674784,0.000055716504,0.18449387,0.0037346422,0.17355098],"study_design_scores_gemma":[0.0004604443,0.00005586421,0.0003454013,0.000008788364,6.522011e-7,0.0000065605072,0.0000041876638,0.9928519,0.000045127214,0.000114893155,0.0059971656,0.00010899671],"about_ca_topic_score_codex":7.977762e-7,"about_ca_topic_score_gemma":0.00004225334,"teacher_disagreement_score":0.6493611,"about_ca_system_score_codex":0.00004248873,"about_ca_system_score_gemma":0.000056944984,"threshold_uncertainty_score":0.33382505},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08976932936101299,"score_gpt":0.3162120079074109,"score_spread":0.22644267854639788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117554110","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046379678,0.00008334381,0.3656337,0.009281252,0.002003716,0.081904896,0.00002141846,0.0038883102,0.4908037],"genre_scores_gemma":[0.9673276,0.00046906437,0.009994652,0.0011541697,0.001033797,0.019315727,0.00002868566,0.000083657,0.00059264293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945478,0.000053004085,0.0012577199,0.001456331,0.0012394072,0.0014457803],"domain_scores_gemma":[0.9961883,0.00017718978,0.0009712044,0.0004101265,0.0018524199,0.00040079304],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016524672,0.00080639485,0.0008235904,0.00035219814,0.0010614418,0.0011287894,0.003431164,0.0002774626,0.00014523648],"category_scores_gemma":[0.00014460088,0.000760299,0.00014291491,0.0020922807,0.0002892253,0.0017076737,0.0011070195,0.0013981203,0.000031184212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003322356,0.00020710981,0.040569812,0.000036035763,0.00009440529,0.00003790928,0.00067425636,0.00069082354,0.00033461914,0.9472737,0.005726256,0.0040228455],"study_design_scores_gemma":[0.002719935,0.0006887888,0.005810969,0.0035981932,0.000017052598,0.00024435596,0.00022626318,0.9796234,0.00021259449,0.0023064124,0.0032030726,0.0013489627],"about_ca_topic_score_codex":0.000008491967,"about_ca_topic_score_gemma":0.000021239983,"teacher_disagreement_score":0.97893256,"about_ca_system_score_codex":0.00048285178,"about_ca_system_score_gemma":0.00037143254,"threshold_uncertainty_score":0.99990815},"labels":[],"label_agreement":null},{"id":"W2117613248","doi":"10.1109/glocomw.2010.5700431","title":"Efficient resource minimization scheme for network coding-assisted multicast system","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Linear network coding; Multicast; Computer science; Coding (social sciences); Distributed computing; Computational complexity theory; Computer network; Minification; Scheme (mathematics); Algorithm; Mathematics","score_opus":0.03385512429919422,"score_gpt":0.27415809326758833,"score_spread":0.24030296896839412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117613248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00572119,0.00005494594,0.9844111,0.0012648521,0.0005195526,0.00043467036,0.0000010201389,0.00044270032,0.007149946],"genre_scores_gemma":[0.69261247,0.000003143858,0.3064581,0.00022825692,0.00014566552,0.000050947798,0.0000071041313,0.000009213163,0.00048512526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894714,0.00008047635,0.00027074607,0.0003045334,0.00012673881,0.00027034586],"domain_scores_gemma":[0.9984562,0.00031557464,0.000099543344,0.00079639215,0.00023135562,0.00010098075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013095,0.000121861216,0.00014206955,0.000054879492,0.000468859,0.0001998059,0.0007929754,0.000070239264,0.000018741468],"category_scores_gemma":[0.00010311432,0.000107958454,0.00006309936,0.00045300246,0.00003778902,0.00006307171,0.00030040622,0.00015656996,0.000025820173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016511798,0.000102244645,0.00020570317,0.00003926726,0.000020886853,8.6785815e-7,0.00039553753,0.0063999146,0.0066457954,0.94246167,0.015979918,0.027731676],"study_design_scores_gemma":[0.0003821828,0.00002083636,0.0005065904,0.00003374486,0.0000035214314,0.0000073988035,0.00003306239,0.9338336,0.0003786902,0.0000075673825,0.06465546,0.00013736356],"about_ca_topic_score_codex":0.0000010914736,"about_ca_topic_score_gemma":0.000021129688,"teacher_disagreement_score":0.9424541,"about_ca_system_score_codex":0.0000364613,"about_ca_system_score_gemma":0.0000364143,"threshold_uncertainty_score":0.44024178},"labels":[],"label_agreement":null},{"id":"W2117840980","doi":"10.1109/wcnc.2011.5779396","title":"On the average capacity of rate adaptive single-relay selection decode-and-forward dual-hop relaying in Rayleigh fading channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Rayleigh fading; Fading; Logarithm; Hop (telecommunications); Channel capacity; Signal-to-noise ratio (imaging); Topology (electrical circuits); Computer science; Channel (broadcasting); Power (physics); Electronic engineering; Telecommunications; Mathematics; Control theory (sociology); Engineering; Physics","score_opus":0.1009088727936584,"score_gpt":0.2482472763203801,"score_spread":0.1473384035267217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117840980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6099871,0.00005152061,0.37475094,0.00033767417,0.00015230474,0.00023265372,3.7023835e-7,0.00007201186,0.0144154485],"genre_scores_gemma":[0.9931803,0.00011142574,0.0061531337,0.00033329293,0.0000140217735,0.000017861328,2.7566313e-7,0.0000074142285,0.00018231182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986806,0.0004414811,0.00027915556,0.0002684798,0.00012311776,0.00020720248],"domain_scores_gemma":[0.9988404,0.00051850406,0.0001204965,0.000363133,0.000110819106,0.000046682362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010342929,0.00013580381,0.00017012829,0.00014768999,0.00024178236,0.00005399352,0.00038750187,0.000055904246,0.00006185863],"category_scores_gemma":[0.00013314841,0.00009841764,0.000043937718,0.0005880297,0.00006470178,0.00035156557,0.00026367386,0.0002800574,0.000010964265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063870684,0.0001905043,0.0010331935,0.000007833859,0.00004815973,0.0000036259655,0.026875542,0.004996881,0.017861111,0.9356226,0.00022106669,0.013075618],"study_design_scores_gemma":[0.0007243663,0.00046838235,0.0039365105,0.00023222153,0.00000857566,0.000015594687,0.00028495857,0.87279207,0.1126784,0.008268634,0.00017227016,0.00041802437],"about_ca_topic_score_codex":0.000058952242,"about_ca_topic_score_gemma":0.00014820104,"teacher_disagreement_score":0.927354,"about_ca_system_score_codex":0.000073251926,"about_ca_system_score_gemma":0.000022591972,"threshold_uncertainty_score":0.40133548},"labels":[],"label_agreement":null},{"id":"W2117865319","doi":"10.1109/vetecf.2008.172","title":"Cooperative Phase Sweep Amplify-and-Forward Transmission","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Fading; Relay; Computer science; Node (physics); Transmission (telecommunications); Cooperative diversity; MIMO; Electronic engineering; Channel (broadcasting); Topology (electrical circuits); Computer network; Telecommunications; Engineering; Electrical engineering; Physics","score_opus":0.05486493238548639,"score_gpt":0.3092000792180316,"score_spread":0.2543351468325452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117865319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016122768,0.00073426636,0.9683232,0.0022909446,0.00004800095,0.00012709845,4.752064e-7,0.00017925477,0.012174009],"genre_scores_gemma":[0.96292454,0.003383409,0.03016229,0.001222083,0.000024595402,0.0000125834895,0.0000035510193,0.000005631348,0.0022612931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992411,0.000098143784,0.00015644782,0.00023337553,0.000119962504,0.00015094697],"domain_scores_gemma":[0.99929893,0.00008603021,0.00002542091,0.0003756137,0.000088221466,0.00012578894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013257534,0.0001052411,0.0001251007,0.00005194717,0.00044537595,0.000060967726,0.00043996438,0.000036281475,0.00015579359],"category_scores_gemma":[0.000014319526,0.00008211888,0.000028091954,0.00027641092,0.00007072015,0.00036006933,0.00016362772,0.00013490945,0.000048717455],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001737043,0.00022576957,0.00005567871,0.000004205135,0.000021516029,0.000032037493,0.0047634635,0.000087524844,0.0067743603,0.16869971,0.006774969,0.8125434],"study_design_scores_gemma":[0.0033229464,0.00045958307,0.0010042458,0.000037224323,0.000006863807,0.00029834572,0.00007614419,0.5072693,0.012265799,0.0005441194,0.47413358,0.0005818164],"about_ca_topic_score_codex":0.000004618356,"about_ca_topic_score_gemma":0.0000037632922,"teacher_disagreement_score":0.9468018,"about_ca_system_score_codex":0.000014303628,"about_ca_system_score_gemma":0.000045799217,"threshold_uncertainty_score":0.34255168},"labels":[],"label_agreement":null},{"id":"W2117956658","doi":"10.1109/cwit.2007.375718","title":"Precoding in Multiple-Antenna Broadcast Systems with a Probabilistic Viewpoint","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Precoding; Computer science; Probabilistic logic; Algorithm; Coding (social sciences); Zero-forcing precoding; Electronic engineering; Theoretical computer science; Channel (broadcasting); Telecommunications; MIMO; Mathematics; Engineering; Statistics; Artificial intelligence","score_opus":0.05408291339089519,"score_gpt":0.2708450450601836,"score_spread":0.2167621316692884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117956658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012479058,0.00080500194,0.9756439,0.00036172365,0.00018179668,0.000489093,1.9843398e-7,0.00017614088,0.009863108],"genre_scores_gemma":[0.9836407,0.00011576689,0.015512267,0.00019450005,0.00003361368,0.00002828535,8.4381753e-7,0.000007138774,0.00046690548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884915,0.00009706686,0.00031247336,0.00028823182,0.00015945622,0.00029364382],"domain_scores_gemma":[0.998778,0.0003053013,0.000067850735,0.00059144245,0.00017628059,0.00008113817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009539464,0.000121697514,0.0001635591,0.00013777398,0.00010773048,0.00014585746,0.00064010103,0.000031584696,0.000009894556],"category_scores_gemma":[0.00015692033,0.00008979233,0.000022590753,0.00068403926,0.000049939044,0.00029067404,0.00023917694,0.00016526863,0.000026454542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000898381,0.00047143133,0.03111681,0.0001352944,0.000040830477,0.00008043076,0.007186124,0.003831554,0.0026551816,0.7034578,0.00036495595,0.2505698],"study_design_scores_gemma":[0.0009717621,0.00013119944,0.012173392,0.0004130882,0.0000029774237,0.000046774716,0.00022691261,0.9736181,0.0001914857,0.00012648602,0.011726143,0.00037165973],"about_ca_topic_score_codex":0.000029296913,"about_ca_topic_score_gemma":0.0008132586,"teacher_disagreement_score":0.9711616,"about_ca_system_score_codex":0.00009968387,"about_ca_system_score_gemma":0.000041423158,"threshold_uncertainty_score":0.36616248},"labels":[],"label_agreement":null},{"id":"W2118254212","doi":"10.1109/tvt.2011.2165570","title":"Average Rate Maximization in Relay Networks Over Slow Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Relay; Maximization; Constraint (computer-aided design); Channel (broadcasting); Mathematical optimization; Transmission (telecommunications); Computer science; Power (physics); Optimization problem; Electronic engineering; Mathematics; Telecommunications; Engineering; Physics","score_opus":0.02694296364994075,"score_gpt":0.23640225725446717,"score_spread":0.20945929360452642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118254212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027179398,0.00018117402,0.9704545,0.0005834377,0.00053049106,0.00023186121,5.615587e-7,0.00045833635,0.00038021052],"genre_scores_gemma":[0.991889,0.0008509424,0.006653363,0.0002999547,0.000012956716,0.00008988429,0.0000012451356,0.000017299175,0.00018537337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987106,0.00016969061,0.0002912563,0.00040502852,0.000099941506,0.00032352595],"domain_scores_gemma":[0.9988973,0.00005195508,0.00008013883,0.0008483308,0.000073608695,0.000048665024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031189804,0.00018010064,0.0001973743,0.0006667721,0.00024480693,0.000044373483,0.0008203978,0.0002724724,0.00007195849],"category_scores_gemma":[0.000009027268,0.00018823716,0.00007008087,0.0016570337,0.000077906465,0.00033166356,0.000016086515,0.0006292044,0.00004048328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024931778,0.00031786872,0.00017854382,0.0000059830722,0.000048772712,0.000066062144,0.001069634,0.8411144,0.0026197913,0.024809256,0.00006791741,0.12967683],"study_design_scores_gemma":[0.0005730821,0.000103616876,0.00034961803,0.00006458608,0.0000062583254,0.000021428086,0.000017268076,0.97635716,0.020432811,0.0010185374,0.00079063495,0.0002649821],"about_ca_topic_score_codex":0.000008610082,"about_ca_topic_score_gemma":0.00005501102,"teacher_disagreement_score":0.9647096,"about_ca_system_score_codex":0.00009736531,"about_ca_system_score_gemma":0.000025238742,"threshold_uncertainty_score":0.7676088},"labels":[],"label_agreement":null},{"id":"W2118489804","doi":"10.1109/ccece.2006.277619","title":"Performance Comparison of Two Transmit Diversity Schemes with Imperfect Multipath Channel Estimation","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Maximal-ratio combining; Bit error rate; Multipath propagation; Channel (broadcasting); Diversity combining; Degradation (telecommunications); Computer science; Transmit diversity; Algorithm; Electronic engineering; Telecommunications; Fading; Engineering","score_opus":0.034419608586881444,"score_gpt":0.2790619401964423,"score_spread":0.24464233160956086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118489804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47022375,0.00008619644,0.5274344,0.00009948828,0.000017948038,0.00007769938,2.811303e-7,0.00006418722,0.0019960138],"genre_scores_gemma":[0.95290655,0.000031708354,0.046923816,0.000027354512,0.000009430775,0.0000038740322,0.0000035951982,0.0000027857986,0.00009086539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993696,0.00004221979,0.00015271823,0.00015218051,0.00016396097,0.000119274984],"domain_scores_gemma":[0.9994152,0.00004740893,0.000073430136,0.0003278644,0.00011004162,0.000026033156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014145793,0.00008767642,0.00013656421,0.000057171383,0.00028767413,0.000029640645,0.00048722397,0.000018128798,0.000012772081],"category_scores_gemma":[0.000003040787,0.00006899512,0.000026851443,0.0002966551,0.000046752775,0.00040435183,0.0002354254,0.00007794849,0.000006249109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007368601,0.00073237706,0.35382146,0.00008565242,0.000051804378,0.0000015651077,0.0063743694,0.12966125,0.004240756,0.06698396,0.0007541555,0.43721896],"study_design_scores_gemma":[0.00053587666,0.000091963375,0.020562232,0.000027118762,0.00000462352,0.0000012095458,0.000015229467,0.963965,0.014576174,0.00003966937,0.00008055104,0.000100328594],"about_ca_topic_score_codex":0.000057396577,"about_ca_topic_score_gemma":0.00012320583,"teacher_disagreement_score":0.8343038,"about_ca_system_score_codex":0.000020601943,"about_ca_system_score_gemma":0.000019250736,"threshold_uncertainty_score":0.28135395},"labels":[],"label_agreement":null},{"id":"W2118597021","doi":"10.1109/wcl.2013.052813.130176","title":"QAM Constellation Design for Complex Field Network Coding in Multi-Way Relay Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Relay; Additive white Gaussian noise; Linear network coding; QAM; Precoding; Quadrature amplitude modulation; Demodulation; Throughput; Computer network; Constellation; Relay channel; Channel (broadcasting); Constellation diagram; Electronic engineering; Algorithm; MIMO; Telecommunications; Bit error rate; Wireless; Network packet; Engineering","score_opus":0.14826665615185267,"score_gpt":0.3177926819130673,"score_spread":0.16952602576121464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118597021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008589759,0.0003054849,0.9563888,0.032518912,0.00034430288,0.0013345344,0.0000014330739,0.00019058243,0.00032623406],"genre_scores_gemma":[0.7573662,0.00064356887,0.23718753,0.004447344,0.000051969553,0.00022765,0.000020315345,0.000018049965,0.000037367496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776256,0.00070791045,0.0005747765,0.00035907765,0.00014876804,0.00044689298],"domain_scores_gemma":[0.99471164,0.0022602042,0.00022435086,0.0025194283,0.00019178237,0.00009260078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076568534,0.00022323726,0.00029256797,0.00018994053,0.00070088636,0.00032999183,0.0029541187,0.00009987923,0.000026352986],"category_scores_gemma":[0.00005841988,0.00024282144,0.000092139715,0.0007480864,0.00014595926,0.0006453378,0.0005208583,0.00037596887,0.00005512437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004049429,0.0006686545,0.0033286533,0.00006995439,0.0001666261,0.0000034828674,0.007857429,0.37025023,0.13106614,0.08834521,0.15007447,0.24812867],"study_design_scores_gemma":[0.0006905467,0.000032831624,0.0009152155,0.0001178724,0.0000052875394,0.000003845237,0.000041912936,0.9919008,0.0010849593,0.00017689461,0.004721969,0.00030785453],"about_ca_topic_score_codex":0.00005554996,"about_ca_topic_score_gemma":0.00008993679,"teacher_disagreement_score":0.74877644,"about_ca_system_score_codex":0.00012205707,"about_ca_system_score_gemma":0.000043131116,"threshold_uncertainty_score":0.99019706},"labels":[],"label_agreement":null},{"id":"W2118621919","doi":"10.1109/isit.2010.5513485","title":"Diversity-multiplexing tradeoff and outage probability in MIMO relay channels","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Relay; Rayleigh fading; MIMO; Nakagami distribution; Multiplexing; Topology (electrical circuits); Additive white Gaussian noise; Computer science; Fading distribution; Channel (broadcasting); Channel state information; Mathematics; Electronic engineering; Telecommunications; Wireless; Physics; Engineering; Combinatorics","score_opus":0.08287602217399967,"score_gpt":0.28294364892381757,"score_spread":0.2000676267498179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118621919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7174242,0.0009056127,0.26273966,0.008455249,0.0015442732,0.0014106019,0.0000057377742,0.00048273828,0.0070318906],"genre_scores_gemma":[0.9649888,0.000405282,0.03391525,0.00024050778,0.00004554756,0.000026100894,0.0000052400255,0.0000068083127,0.00036642785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983453,0.00024361174,0.00029319202,0.00069195597,0.00017748309,0.0002484154],"domain_scores_gemma":[0.998281,0.00018606351,0.00010718993,0.0012398445,0.000080260535,0.0001056535],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00090114336,0.00022369553,0.0002966851,0.00015005781,0.00048003613,0.00021504036,0.0016892188,0.00026768973,0.000034574707],"category_scores_gemma":[0.000113649156,0.00021376176,0.0000664817,0.00020976634,0.000094941955,0.0002594252,0.020139655,0.0013756377,0.0000057072048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006032264,0.0013014473,0.12896816,0.0007404215,0.00016579086,0.00008269088,0.15170418,0.019546341,0.0023403238,0.36430082,0.0014169709,0.3293725],"study_design_scores_gemma":[0.0008724433,0.000045205117,0.03781879,0.0002902552,0.000008461459,0.000008175718,0.00007536723,0.93381655,0.00051560503,0.020133954,0.005461906,0.00095328654],"about_ca_topic_score_codex":0.000087671586,"about_ca_topic_score_gemma":0.0010029069,"teacher_disagreement_score":0.9142702,"about_ca_system_score_codex":0.0000693718,"about_ca_system_score_gemma":0.00006619452,"threshold_uncertainty_score":0.9877853},"labels":[],"label_agreement":null},{"id":"W2118817065","doi":"10.1109/jsac.2008.080412","title":"Reduced-Complexity Belief Propagation for System-Wide MUD in the Uplink of Cellular Networks","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":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Telecommunications link; Multiuser detection; Belief propagation; Base station; Fading; Path loss; Decoding methods; Cellular network; Wireless network; Computer network; Algorithm; Wireless; Distributed computing; Telecommunications; Code division multiple access","score_opus":0.09683187822944359,"score_gpt":0.3069989266246265,"score_spread":0.21016704839518294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118817065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09961356,0.0021906353,0.8848946,0.009449091,0.00035056422,0.0013021535,0.0000036673064,0.0001006754,0.0020950607],"genre_scores_gemma":[0.97888404,0.0020903528,0.018510498,0.00027417432,0.000071174654,0.00011924846,0.000017602211,0.000012206401,0.0000206876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711865,0.0013079215,0.00083429366,0.00019575095,0.00026655887,0.00027684463],"domain_scores_gemma":[0.99514306,0.0016251697,0.00047059974,0.0020142226,0.0006854836,0.000061489256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016606542,0.00016118186,0.0002797021,0.00031699263,0.0008700782,0.00009073096,0.0037339875,0.00008691202,0.0000023819293],"category_scores_gemma":[0.00034112294,0.00013023781,0.00009265434,0.0018884097,0.00016873892,0.00030328965,0.00018330038,0.00096320215,0.0000028452714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033616062,0.005633973,0.0147165125,0.00013370262,0.00023713186,0.000050378698,0.02679644,0.08104555,0.017848095,0.787387,0.012479399,0.05333562],"study_design_scores_gemma":[0.0013386487,0.00026622118,0.028819598,0.00060855,0.000014933558,0.0002243582,0.000204828,0.96226954,0.001786877,0.0016127416,0.00253038,0.00032334536],"about_ca_topic_score_codex":0.000014359087,"about_ca_topic_score_gemma":0.00016886774,"teacher_disagreement_score":0.881224,"about_ca_system_score_codex":0.0002379322,"about_ca_system_score_gemma":0.00025069114,"threshold_uncertainty_score":0.69387394},"labels":[],"label_agreement":null},{"id":"W2118966480","doi":"10.1109/icdcs.2009.29","title":"Stochastic Multicast with Network Coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Multicast; Linear network coding; Service provider; Mathematical optimization; Exploit; Optimization problem; Purchasing; Network planning and design; Heuristic; Stochastic optimization; Stochastic programming; Service (business); Distributed computing; Computer network; Algorithm; Artificial intelligence","score_opus":0.03069937269010298,"score_gpt":0.2690255002901051,"score_spread":0.2383261276000021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118966480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010136969,0.00011892453,0.98445094,0.0020508443,0.00005034763,0.00008859594,4.325605e-8,0.00021588332,0.012010754],"genre_scores_gemma":[0.92700756,0.000024370913,0.071002446,0.0015353936,0.00005524253,0.0000030442332,3.9748423e-7,0.000002704281,0.00036883287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993644,0.000040692816,0.00010617479,0.00017397045,0.000109641915,0.00020515405],"domain_scores_gemma":[0.9992669,0.00008096875,0.00003068623,0.00048430986,0.00006770957,0.000069381196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014211201,0.00008339875,0.00009170061,0.000027538841,0.00020605126,0.00012922699,0.0005612371,0.00001685224,0.00003380217],"category_scores_gemma":[0.000014066324,0.00006171706,0.000017497947,0.00038602465,0.000020004863,0.00022214034,0.000101896025,0.00009630789,0.000041275893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072024336,0.000047277757,0.00014435679,7.878974e-7,0.000007526566,0.000004895328,0.00034552522,0.016130647,0.00013441917,0.79288554,0.0023749236,0.18791692],"study_design_scores_gemma":[0.0004057699,0.00017710174,0.0052402886,0.00005396168,0.0000034484592,0.000022131382,0.000014573738,0.99030036,0.00007869644,0.0012159258,0.0022530456,0.00023471055],"about_ca_topic_score_codex":6.092627e-7,"about_ca_topic_score_gemma":0.000015958156,"teacher_disagreement_score":0.9741697,"about_ca_system_score_codex":0.000016916749,"about_ca_system_score_gemma":0.000022441249,"threshold_uncertainty_score":0.25167486},"labels":[],"label_agreement":null},{"id":"W2119060217","doi":"10.1109/cwit.2011.5872137","title":"Joint typicality analysis for half-duplex cooperative communication","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Joint (building); Constraint (computer-aided design); Duplex (building); Channel code; Block (permutation group theory); Channel (broadcasting); Coding (social sciences); Code (set theory); Block code; Algorithm; Theoretical computer science; Computer network; Mathematics; Statistics; Engineering; Combinatorics; Programming language","score_opus":0.1745987516724962,"score_gpt":0.31495026282437444,"score_spread":0.14035151115187824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119060217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002366473,0.00021583696,0.97686493,0.0015513562,0.00003642053,0.00025472222,0.0000015025057,0.00016468974,0.018544063],"genre_scores_gemma":[0.8236432,0.00018111261,0.17470363,0.000662758,0.000008471442,0.00006842222,0.000016258104,0.0000039839438,0.0007121597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896216,0.00024462971,0.00027961665,0.00025530808,0.000095447765,0.00016283253],"domain_scores_gemma":[0.99787366,0.00014293991,0.00008618832,0.0014277607,0.00039380716,0.00007564859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057670387,0.00010646945,0.00020541606,0.00011991502,0.0003394514,0.00009756983,0.0010862625,0.000042257016,0.0003352005],"category_scores_gemma":[0.00008656852,0.000089610956,0.00013665606,0.00093545864,0.00006670564,0.00033714678,0.0004445007,0.00010279384,0.00003722131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009086365,0.00012677026,0.0010137621,0.0000024021163,0.00021143458,1.656546e-7,0.0022733402,0.00011883936,0.00021892544,0.9800859,0.0012762686,0.014663116],"study_design_scores_gemma":[0.00069660414,0.00015157137,0.06665007,0.000014235155,0.00013459344,0.0000016751862,0.00019529636,0.89824504,0.0071810847,0.0052549974,0.020982673,0.0004921753],"about_ca_topic_score_codex":0.000043214044,"about_ca_topic_score_gemma":0.000434065,"teacher_disagreement_score":0.97483087,"about_ca_system_score_codex":0.00003730839,"about_ca_system_score_gemma":0.000037966598,"threshold_uncertainty_score":0.36702102},"labels":[],"label_agreement":null},{"id":"W2119062559","doi":"10.1109/infcom.2010.5462169","title":"Efficient Resource Allocation with Flexible Channel Cooperation in OFDMA Cognitive Radio Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cognitive radio; Channel allocation schemes; Resource allocation; Computer network; Channel (broadcasting); Selfishness; Heuristics; Leverage (statistics); Relay; Distributed computing; Telecommunications; Wireless","score_opus":0.019997280628314684,"score_gpt":0.25347724953051753,"score_spread":0.23347996890220285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119062559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10513924,0.00015544162,0.8850918,0.0019751552,0.00013379993,0.00036687974,3.5383349e-7,0.00018394098,0.0069534075],"genre_scores_gemma":[0.99536884,0.000075607524,0.0031552187,0.00057205686,0.00006731284,0.00008082283,0.0000123239315,0.000009525767,0.0006582998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896073,0.00012682797,0.00020261541,0.00032452997,0.00015758807,0.00022772426],"domain_scores_gemma":[0.999046,0.00014863997,0.00006541156,0.00043550692,0.00022927062,0.00007516834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004709383,0.00013196947,0.00012627884,0.00013338843,0.00020884251,0.00016872639,0.0004899664,0.0000672014,0.00005269695],"category_scores_gemma":[0.000041427316,0.000108042324,0.00001940725,0.00090385164,0.00006147775,0.00017188911,0.00017114785,0.0003520189,0.000017441704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013045878,0.00068680296,0.0020255963,0.000013282569,0.000044184213,0.000009165034,0.0057341997,0.5099508,0.00663446,0.3337542,0.0016913437,0.13932547],"study_design_scores_gemma":[0.00060681126,0.000057693123,0.0039293184,0.000052639516,0.000002994688,0.000006981305,0.000060777802,0.99180883,0.0022065763,0.000014266812,0.0010775835,0.00017554364],"about_ca_topic_score_codex":0.000014585125,"about_ca_topic_score_gemma":0.00037843606,"teacher_disagreement_score":0.8902296,"about_ca_system_score_codex":0.00002920375,"about_ca_system_score_gemma":0.000066032226,"threshold_uncertainty_score":0.4405838},"labels":[],"label_agreement":null},{"id":"W2119567095","doi":"10.1109/camsap.2009.5413267","title":"Power allocation in decode-and-forward cooperative networks via SEP minimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Power (physics); Minification; Convex optimization; Scheme (mathematics); Optimization problem; Regular polygon; Mathematics","score_opus":0.015571498991108325,"score_gpt":0.2645343101527044,"score_spread":0.24896281116159608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119567095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048062773,0.00045271683,0.9822569,0.004000781,0.00007694127,0.00018398494,8.634266e-8,0.000099876,0.0081224395],"genre_scores_gemma":[0.9813646,0.00069775275,0.0150158275,0.002593668,0.000016898142,0.000009613001,0.0000064637966,0.000003982746,0.0002911584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990743,0.0001433759,0.00023999001,0.00026561477,0.00010144146,0.0001752797],"domain_scores_gemma":[0.9992978,0.00007825599,0.00005046505,0.0003727886,0.00013653269,0.00006415585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025700693,0.000115703304,0.00012853568,0.000103470644,0.00012867953,0.00013915844,0.00037351024,0.000059302856,0.00005330014],"category_scores_gemma":[0.000034369456,0.00010565003,0.000020123669,0.00060729735,0.000023284028,0.0005467522,0.000120884026,0.0001317522,0.000012859186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023306318,0.00022591765,0.0020060164,0.0000022695594,0.000017115859,0.0000046600426,0.0034715675,0.06492267,0.0008195849,0.45069754,0.0033940224,0.47441533],"study_design_scores_gemma":[0.0003187751,0.000080677855,0.015888918,0.000016199556,0.0000012433982,0.0000042505467,0.000022982724,0.9811137,0.0002080771,0.0005385552,0.001648672,0.00015796954],"about_ca_topic_score_codex":0.0000030643307,"about_ca_topic_score_gemma":0.00008745384,"teacher_disagreement_score":0.9765584,"about_ca_system_score_codex":0.00004544158,"about_ca_system_score_gemma":0.000028294928,"threshold_uncertainty_score":0.43082833},"labels":[],"label_agreement":null},{"id":"W2119612043","doi":"10.1109/wcl.2012.010912.110220","title":"Performance Analysis of Zero-Forcing for Two-Way MIMO AF Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Relay; Computer science; Multiplexing; Relay channel; Transmission (telecommunications); Linear network coding; Outage probability; Signal-to-noise ratio (imaging); Channel (broadcasting); Topology (electrical circuits); Telecommunications; Computer network; Mathematics; Fading","score_opus":0.04744994333609972,"score_gpt":0.29469158679061336,"score_spread":0.24724164345451363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119612043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23968177,0.0010295206,0.75536984,0.0027594466,0.00026009072,0.00028591958,0.0000047383623,0.00011386772,0.0004948386],"genre_scores_gemma":[0.95286757,0.0012647079,0.04433199,0.0012006969,0.000057168138,0.00016196542,0.0000487411,0.000019118275,0.000048073234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816734,0.00034453342,0.00058164395,0.0002487305,0.00019866638,0.00045909386],"domain_scores_gemma":[0.9943551,0.0008515936,0.00035818285,0.0040914025,0.0002227946,0.00012096552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010354168,0.00020499626,0.00040416513,0.0004210652,0.0006739186,0.00008426014,0.0036473155,0.00006603175,0.0000066487232],"category_scores_gemma":[0.00002786593,0.00021080025,0.00025238213,0.0021581815,0.00020859012,0.00080188963,0.0006641269,0.00031173014,0.0000074045965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048669513,0.00084050815,0.07638026,0.000078453646,0.0025910535,4.2888593e-7,0.010439168,0.43972766,0.06033648,0.122487135,0.007945531,0.27912465],"study_design_scores_gemma":[0.0003395965,0.000018300494,0.008394247,0.00005256863,0.00019339341,0.0000016330355,0.000026497268,0.98597234,0.0013765655,0.00000487008,0.0033570507,0.00026294665],"about_ca_topic_score_codex":0.000017190494,"about_ca_topic_score_gemma":0.000055364177,"teacher_disagreement_score":0.7131858,"about_ca_system_score_codex":0.000099100675,"about_ca_system_score_gemma":0.000027504615,"threshold_uncertainty_score":0.8596185},"labels":[],"label_agreement":null},{"id":"W2119780651","doi":"10.1109/isit.2010.5513566","title":"On the capacity of the half-duplex diamond channel","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Duplex (building); Diamond; Channel (broadcasting); Computer science; Geology; Materials science; Computer network; Chemistry; Composite material","score_opus":0.08288352159476177,"score_gpt":0.27261806492515595,"score_spread":0.1897345433303942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119780651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36440757,0.0005558922,0.3809323,0.12891884,0.006021402,0.0021140077,0.000016752581,0.0003772886,0.11665597],"genre_scores_gemma":[0.99569213,0.00016727041,0.0014600181,0.0015301879,0.00005753379,0.0000390536,0.0000010281508,0.0000064094374,0.0010463413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880725,0.00029606695,0.00021515191,0.00028364686,0.00025340583,0.0001444906],"domain_scores_gemma":[0.9960236,0.00044665716,0.00019088645,0.003141354,0.00016200902,0.00003548313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059191306,0.00016366868,0.00016915538,0.000036230133,0.00027715988,0.00012838746,0.0045838994,0.00013519295,0.0001128451],"category_scores_gemma":[0.00017630882,0.000078928344,0.00014783855,0.00020807736,0.00016594301,0.000048175956,0.004646028,0.0012208391,0.000020648738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001279035,0.000057784833,0.000024297598,0.000009454249,0.00002237443,1.2654625e-7,0.0015040718,0.0009196695,0.0006938588,0.9854427,0.0061478848,0.0051764976],"study_design_scores_gemma":[0.00025640745,0.000050914427,0.0076975645,0.0003560523,0.000018212517,0.000004104011,0.00005159878,0.8510469,0.030248959,0.086901255,0.022713918,0.0006540911],"about_ca_topic_score_codex":0.000055637523,"about_ca_topic_score_gemma":0.00040303564,"teacher_disagreement_score":0.89854145,"about_ca_system_score_codex":0.000022077618,"about_ca_system_score_gemma":0.0000851283,"threshold_uncertainty_score":0.85181016},"labels":[],"label_agreement":null},{"id":"W2119975703","doi":"10.1109/twc.2010.01.090432","title":"Optimum/sub-optimum detectors for multi-branch dual-hop amplify-and-forward cooperative diversity networks with limited CSI","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Channel state information; Detector; Computer science; Hop (telecommunications); Relay; Detection theory; Algorithm; Dual (grammatical number); Diversity gain; Control theory (sociology); Mathematical optimization; Mathematics; Telecommunications; Wireless; Fading; Decoding methods; Artificial intelligence; Physics; Power (physics)","score_opus":0.048943530410934896,"score_gpt":0.2812820438825463,"score_spread":0.23233851347161139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119975703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05803419,0.00015204247,0.93832666,0.0015820146,0.0003877317,0.00096117565,0.000045741996,0.00039532196,0.000115153336],"genre_scores_gemma":[0.9273914,0.0023550696,0.069134295,0.00042670552,0.000031289357,0.00044492248,0.000025395895,0.00003998639,0.00015090276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979374,0.00035447502,0.00042422727,0.0005846046,0.0002424412,0.00045686035],"domain_scores_gemma":[0.9946146,0.0011436159,0.0001900505,0.00314867,0.00062867487,0.00027440593],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004557744,0.00039307945,0.0003937597,0.0002671235,0.0039741714,0.00031205828,0.0022791496,0.0002343313,0.000015490983],"category_scores_gemma":[0.000018331726,0.00037317578,0.00014257162,0.0009928733,0.0005445682,0.00069239445,0.00015267324,0.0013727793,0.000012952314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067822833,0.0053239083,0.00087955775,0.000092720686,0.0015274659,0.000008077546,0.018483076,0.26741755,0.049997997,0.046481926,0.0011395486,0.60796994],"study_design_scores_gemma":[0.0019813424,0.0002864303,0.00055982923,0.00007575268,0.00008475004,0.000022143233,0.00012567884,0.9865048,0.007887944,0.000035001372,0.0017983697,0.0006379411],"about_ca_topic_score_codex":0.000035552854,"about_ca_topic_score_gemma":0.002695275,"teacher_disagreement_score":0.8693572,"about_ca_system_score_codex":0.00008451567,"about_ca_system_score_gemma":0.000119774595,"threshold_uncertainty_score":0.999872},"labels":[],"label_agreement":null},{"id":"W2120051217","doi":"10.1109/tmc.2006.72","title":"Reliable packet transmissions in multipath routed wireless networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Network packet; Load balancing (electrical power); Source routing; Computer network; Erasure; Erasure code; Path (computing); Multipath propagation; Distributed computing; Algorithm; Decoding methods; Routing protocol; Routing table","score_opus":0.016994762535962084,"score_gpt":0.25754107185144776,"score_spread":0.24054630931548568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120051217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05569963,0.0002546593,0.94194055,0.00022423964,0.00048385758,0.00037758928,0.0000019111937,0.00037508502,0.00064249185],"genre_scores_gemma":[0.9878331,0.00025952503,0.011363631,0.00016891336,0.00006309972,0.00005972599,0.000004437912,0.000022980148,0.00022458579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980982,0.0002132085,0.0005101039,0.00050278945,0.00020761519,0.000468078],"domain_scores_gemma":[0.99865794,0.000315958,0.00009516766,0.0007505732,0.00007912707,0.00010120415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039474666,0.00024185248,0.00027035206,0.0002449483,0.00057200604,0.00015281556,0.0007930616,0.000116367984,0.00002935315],"category_scores_gemma":[0.0000019647168,0.0002474865,0.00012342473,0.0012736595,0.000049105103,0.00028804535,0.000011541434,0.00061886455,0.000021299842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000700528,0.00027755415,0.00011000766,0.0000045519464,0.0000062067757,0.0000071192408,0.0002970688,0.83203155,0.00052097824,0.0007823319,0.00013531756,0.16582029],"study_design_scores_gemma":[0.0006944814,0.000064569846,0.00071450294,0.0001606661,0.000004928967,0.000008166201,0.000027485388,0.9944925,0.0021361152,0.000074888056,0.0013409825,0.00028071878],"about_ca_topic_score_codex":0.00008964695,"about_ca_topic_score_gemma":0.0002442965,"teacher_disagreement_score":0.9321335,"about_ca_system_score_codex":0.00012890888,"about_ca_system_score_gemma":0.000059552418,"threshold_uncertainty_score":0.99999774},"labels":[],"label_agreement":null},{"id":"W2120113362","doi":"10.1109/glocom.2010.5683766","title":"Optimal Outage Efficient Routing in Amplify-and-Forward Multihop Wireless Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Metric (unit); Network topology; Routing (electronic design automation); Performance metric; Wireless network; Routing protocol; Network packet; Distributed computing; Wireless; Topology (electrical circuits); Mathematical optimization; Mathematics; Engineering; Telecommunications","score_opus":0.01842631571735785,"score_gpt":0.26831368088267554,"score_spread":0.2498873651653177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120113362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40703437,0.000038868347,0.58997446,0.0004828276,0.00023078597,0.00012006521,1.7497403e-7,0.00011442636,0.0020040337],"genre_scores_gemma":[0.9733322,0.000071464456,0.026020205,0.00033273065,0.000048479775,0.000012551063,0.0000015152262,0.000007378626,0.000173434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989253,0.00008118614,0.0002480724,0.0003190971,0.00012225455,0.00030408605],"domain_scores_gemma":[0.9990036,0.00020366201,0.000055468405,0.0005811509,0.00005414524,0.0001020114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006278711,0.00013002803,0.00015413019,0.0000838162,0.0001894321,0.00021326232,0.0007348752,0.00008020274,0.00003079684],"category_scores_gemma":[0.000045230307,0.000114647664,0.000030772793,0.000358801,0.000057271427,0.00015216085,0.00080043037,0.00053110695,0.00001535224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010925646,0.00018761543,0.011194472,0.000006037651,0.000013772854,0.000013285258,0.003887283,0.051143155,0.0042339517,0.55508256,0.00019784941,0.37402907],"study_design_scores_gemma":[0.00031246702,0.0000118881535,0.00615714,0.000013530096,0.0000010009637,0.0000057135185,0.00005274544,0.9923325,0.00016929145,0.0000108517115,0.0007773978,0.00015544984],"about_ca_topic_score_codex":0.00002301755,"about_ca_topic_score_gemma":0.0003026844,"teacher_disagreement_score":0.94118935,"about_ca_system_score_codex":0.000019053594,"about_ca_system_score_gemma":0.000023957142,"threshold_uncertainty_score":0.4675196},"labels":[],"label_agreement":null},{"id":"W2120116321","doi":"10.1109/ssp.2012.6319834","title":"Quantized network coding for sparse messages","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Linear network coding; Decoding methods; Quantization (signal processing); Network packet; Data compression; Multiple description coding; Coding (social sciences); Arithmetic coding; Compressed sensing","score_opus":0.09860477150820754,"score_gpt":0.3253556254492502,"score_spread":0.22675085394104263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120116321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009271448,0.0013976203,0.9817086,0.0014648836,0.0004913415,0.00018884908,2.3527728e-7,0.0002057479,0.013615607],"genre_scores_gemma":[0.8383131,0.00038608463,0.15878811,0.00090308924,0.00024093292,0.000036706188,0.000001988248,0.000006182617,0.0013237961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992171,0.00007967982,0.00015306112,0.00012945283,0.00008074741,0.0003399444],"domain_scores_gemma":[0.9989989,0.00032456627,0.000046880305,0.00047512093,0.00006572321,0.0000888079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007126534,0.00008388737,0.00011682692,0.000027933489,0.00027387633,0.000102594786,0.00060355716,0.00002807612,0.00006106539],"category_scores_gemma":[0.000052248106,0.000070991955,0.000053766064,0.00024786315,0.000017452785,0.00045899555,0.0002799468,0.00006204708,0.000043493044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003109833,0.000023925099,0.0011089959,0.00000265586,0.000009783093,7.418771e-8,0.0002396412,0.000060600065,0.00031684883,0.9435666,0.025936164,0.028731605],"study_design_scores_gemma":[0.0011612299,0.00006158115,0.006202199,0.00005592572,0.00001418208,0.000008328251,0.000059857222,0.3078079,0.0029379649,0.0035073727,0.6776304,0.0005530634],"about_ca_topic_score_codex":8.3665236e-7,"about_ca_topic_score_gemma":0.000006945191,"teacher_disagreement_score":0.94005924,"about_ca_system_score_codex":0.000015970452,"about_ca_system_score_gemma":0.000015164903,"threshold_uncertainty_score":0.28949678},"labels":[],"label_agreement":null},{"id":"W2120202158","doi":"10.1109/twc.2009.071306","title":"On relay selection for decode-and-forward relaying","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Expression (computer science); Relay channel; Monte Carlo method; Algorithm; Mathematics; Artificial intelligence; Statistics; Power (physics)","score_opus":0.04341680237889981,"score_gpt":0.3056392059559475,"score_spread":0.2622224035770477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120202158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006935462,0.0002009365,0.9805214,0.010091128,0.000159065,0.00046168122,0.000006514378,0.0003782363,0.0012456072],"genre_scores_gemma":[0.94417053,0.0025976712,0.051210146,0.0014077388,0.000014780927,0.00020553137,0.0000057707257,0.000016304735,0.00037151077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862427,0.00023472523,0.00034900702,0.00036368065,0.00016732706,0.00026099558],"domain_scores_gemma":[0.99670994,0.00089944206,0.000112651425,0.0019657838,0.00019396185,0.00011820935],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003704986,0.00020264398,0.00020354023,0.0002653494,0.0017444671,0.00017316699,0.0014554723,0.00010699713,0.000009487457],"category_scores_gemma":[0.000020794658,0.00021154337,0.00012298525,0.0006640365,0.0000819408,0.0004084702,0.000014045122,0.00051927206,0.000028405879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003999485,0.0005109026,0.000009269985,0.0000057988723,0.00004466234,1.7526305e-7,0.0008899773,0.012769183,0.0024645878,0.3354929,0.00061976083,0.6471528],"study_design_scores_gemma":[0.0010160636,0.0006264289,0.0003316973,0.00014712034,0.00003738349,0.000017911727,0.00004693994,0.97828454,0.0064433543,0.004125711,0.008440255,0.00048258077],"about_ca_topic_score_codex":0.000005243507,"about_ca_topic_score_gemma":0.0001109604,"teacher_disagreement_score":0.9655154,"about_ca_system_score_codex":0.00012744818,"about_ca_system_score_gemma":0.00006343136,"threshold_uncertainty_score":0.9995551},"labels":[],"label_agreement":null},{"id":"W2120215810","doi":"10.1109/twc.2011.122211.101840","title":"An Autonomous Resource Block Assignment Scheme for OFDMA-Based Relay-Assisted Cellular Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Assiut University; Cairo University","keywords":"Computer science; Relay; Computer network; Scheme (mathematics); Wireless; Block (permutation group theory); Channel (broadcasting); Wireless network; Resource allocation; Terminal (telecommunication); Telecommunications; Mathematics","score_opus":0.0739659531846752,"score_gpt":0.2817010117566891,"score_spread":0.2077350585720139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120215810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025813456,0.0003523866,0.99262196,0.0019168555,0.00021737351,0.000752628,0.000021484946,0.0006162628,0.0009196764],"genre_scores_gemma":[0.87655044,0.0004264031,0.121059895,0.0006515212,0.000023004255,0.0009968103,0.000029931756,0.000043249584,0.00021872247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975692,0.0006617811,0.0005809785,0.00053091324,0.00023280903,0.00042429965],"domain_scores_gemma":[0.9931658,0.0005256686,0.00023525815,0.005537072,0.0002890576,0.00024713983],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00058348227,0.00031370373,0.0003030191,0.0002534409,0.0017452153,0.00017352299,0.0042556166,0.0001849566,0.000048762144],"category_scores_gemma":[0.000005778401,0.00033880092,0.00022237531,0.0008032722,0.00022237013,0.0004030721,0.000036679605,0.00063843484,0.000020045507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002834672,0.010439849,0.0001045642,0.000051122544,0.00047254752,0.0000053315093,0.0053631095,0.21122853,0.02362234,0.0656249,0.0013866936,0.6814175],"study_design_scores_gemma":[0.00079292513,0.00024307879,0.00021162315,0.00008670023,0.000046859197,0.0000030384756,0.00007070017,0.9757756,0.014089369,0.000052681473,0.008205176,0.00042222135],"about_ca_topic_score_codex":0.0000257641,"about_ca_topic_score_gemma":0.00019219927,"teacher_disagreement_score":0.87396914,"about_ca_system_score_codex":0.00019286992,"about_ca_system_score_gemma":0.00017445048,"threshold_uncertainty_score":0.9999064},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09475132157149174,"score_gpt":0.3027697721859978,"score_spread":0.20801845061450608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120448104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016194427,0.00016584944,0.97382414,0.0070231236,0.00029053286,0.00025194552,0.0000035548742,0.0002469642,0.0019994506],"genre_scores_gemma":[0.9809412,0.0024422766,0.015991054,0.00041450822,0.000007934882,0.00007323411,0.0000025380155,0.00000980654,0.00011747229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884105,0.00022171419,0.00026927138,0.00026330195,0.00017495197,0.0002297113],"domain_scores_gemma":[0.9968907,0.00024494596,0.000066695815,0.0026062853,0.00010380057,0.00008754301],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030070197,0.00014369031,0.00015273943,0.00028299747,0.0014480691,0.00009343861,0.0029103968,0.00007268869,0.000014218988],"category_scores_gemma":[0.0000073932174,0.00016190576,0.00008535391,0.0010463248,0.00011719432,0.0005395871,0.00012446751,0.0005804018,0.000097363576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003926633,0.0041413857,0.00043866673,0.00002265986,0.00012999006,0.000015480535,0.029814173,0.18842798,0.0045955596,0.29079404,0.00016463058,0.48141617],"study_design_scores_gemma":[0.01164882,0.00053788745,0.00718573,0.0012655611,0.000083765124,0.0000842336,0.0019249932,0.9082745,0.03286492,0.02317974,0.009871963,0.0030778984],"about_ca_topic_score_codex":0.00016395882,"about_ca_topic_score_gemma":0.0014430542,"teacher_disagreement_score":0.9647468,"about_ca_system_score_codex":0.00024761198,"about_ca_system_score_gemma":0.0000767346,"threshold_uncertainty_score":0.9998519},"labels":[],"label_agreement":null},{"id":"W2120451541","doi":"10.1109/vtcfall.2012.6399039","title":"Low Complexity Detectors for Cooperative Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"King Abdullah University of Science and Technology","keywords":"Detector; Computer science; Bit error rate; Preprocessor; Diversity gain; Block (permutation group theory); Wireless; Reduction (mathematics); Signal-to-noise ratio (imaging); Electronic engineering; Noise (video); Wireless sensor network; Algorithm; Channel (broadcasting); Real-time computing; Telecommunications; MIMO; Engineering; Mathematics; Computer network; Artificial intelligence","score_opus":0.07556150546289588,"score_gpt":0.3017841688093903,"score_spread":0.22622266334649443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120451541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016634991,0.00020058548,0.97937965,0.0005754866,0.00041859082,0.00034931235,0.0000015366712,0.00021598788,0.0022238274],"genre_scores_gemma":[0.9553374,0.00009414689,0.04278062,0.0009858649,0.00019246427,0.000055322274,0.00000644902,0.0000101188525,0.00053759397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989251,0.00015479386,0.00019735299,0.00021012311,0.00010337822,0.00040927602],"domain_scores_gemma":[0.99868125,0.0003135799,0.000058043097,0.0005758449,0.0002122168,0.00015908647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038638027,0.00014702744,0.0001729409,0.000042265132,0.00040191933,0.00012637189,0.000679498,0.000053022737,0.00007344374],"category_scores_gemma":[0.00003782557,0.00012334916,0.00006672453,0.0003364719,0.000079660196,0.0004900306,0.00031615584,0.00013486359,0.000032255743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019604147,0.00024643663,0.0015134495,0.000013637544,0.0000406828,4.6104077e-7,0.0014957084,0.0010351003,0.0017782823,0.8482713,0.0067012445,0.13888408],"study_design_scores_gemma":[0.00053264876,0.000077965335,0.002675539,0.000020338488,0.000005548572,0.0000062632,0.00007120213,0.9769698,0.009017869,0.00013829846,0.0101095205,0.00037500908],"about_ca_topic_score_codex":0.0000030126475,"about_ca_topic_score_gemma":0.000046211848,"teacher_disagreement_score":0.9759347,"about_ca_system_score_codex":0.000047047182,"about_ca_system_score_gemma":0.000026100282,"threshold_uncertainty_score":0.5030033},"labels":[],"label_agreement":null},{"id":"W2120530281","doi":"10.1109/tcomm.2011.050911.100063","title":"On Outage Probability and Diversity-Multiplexing Tradeoff in MIMO Relay Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiplexing; Outage probability; MIMO; Relay; Computer science; Electronic engineering; Telecommunications; Topology (electrical circuits); Channel (broadcasting); Fading; Engineering; Electrical engineering; Physics; Power (physics)","score_opus":0.14930326292531437,"score_gpt":0.2839082592346494,"score_spread":0.13460499630933503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120530281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033469606,0.00026459777,0.95276594,0.003661029,0.00029731973,0.00068375614,0.000013545184,0.0003067898,0.00853742],"genre_scores_gemma":[0.9734049,0.0010017148,0.025022175,0.00029992397,0.0000043364057,0.0000878956,0.000002018635,0.000009365575,0.00016766253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985677,0.00045107817,0.00028620398,0.0003340223,0.00014570837,0.00021527948],"domain_scores_gemma":[0.99682254,0.00050558156,0.00007076232,0.0024304113,0.00007026571,0.00010043733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045615225,0.00016305714,0.0001709625,0.00025150957,0.00112637,0.0000667452,0.0018893899,0.00007910849,0.000040725816],"category_scores_gemma":[0.000020527632,0.00017121737,0.00006865275,0.00060095364,0.00018819694,0.0004245497,0.0001075868,0.0005989091,0.00003118308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019619311,0.007925245,0.0022042394,0.000062220905,0.0002000113,0.000012503913,0.12885259,0.016969996,0.0013010236,0.5224816,0.00038067417,0.3194137],"study_design_scores_gemma":[0.005793521,0.00134011,0.035553537,0.0008383174,0.00008423743,0.00004507124,0.0012396382,0.88568425,0.009808907,0.04990981,0.0072206645,0.0024819488],"about_ca_topic_score_codex":0.00007499266,"about_ca_topic_score_gemma":0.00077473925,"teacher_disagreement_score":0.9399353,"about_ca_system_score_codex":0.00010205441,"about_ca_system_score_gemma":0.00003387664,"threshold_uncertainty_score":0.8663241},"labels":[],"label_agreement":null},{"id":"W2120593674","doi":"10.1109/icc.2011.5962774","title":"N Plus Normalized Threshold Opportunistic Relay Selection with Outdated Channel State Information","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Decoding methods; Selection (genetic algorithm); Channel state information; Moment-generating function; Relay channel; Correctness; Computer science; Signal-to-noise ratio (imaging); Expression (computer science); Channel (broadcasting); Topology (electrical circuits); Outage probability; Computer network; Algorithm; Mathematics; Telecommunications; Probability density function; Statistics; Wireless; Fading; Power (physics); Combinatorics; Physics; Artificial intelligence","score_opus":0.06553147831721062,"score_gpt":0.24450537499442507,"score_spread":0.17897389667721444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120593674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062034084,0.000023788152,0.9638622,0.0002484105,0.00009153272,0.00022222985,0.0000010516457,0.00039901386,0.028948383],"genre_scores_gemma":[0.9804835,0.00027655292,0.017522838,0.00072296173,0.000010000632,0.000028520519,0.00002290175,0.0000058028113,0.00092692923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923205,0.00005215156,0.00023391991,0.00013476965,0.00015786338,0.00018926086],"domain_scores_gemma":[0.99912447,0.000017314127,0.00011280397,0.00040070756,0.00025605594,0.00008865172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024830239,0.00011429954,0.00010893746,0.0001212978,0.00021471186,0.00012810665,0.00049396546,0.000030732044,0.000115833056],"category_scores_gemma":[0.00001239486,0.00008792749,0.000019772531,0.00051736634,0.000028676839,0.0017402717,0.00017598251,0.00013249004,0.000102445105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060937245,0.00034657132,0.0023399475,0.00006153102,0.0002537994,0.000023307703,0.052394412,0.01005108,0.0011691386,0.69203454,0.013241239,0.22747506],"study_design_scores_gemma":[0.0009224975,0.00020581276,0.0021336768,0.000025155412,0.000006914695,0.000026420601,0.000072142895,0.9888106,0.0015222735,0.0002577181,0.005744367,0.00027241846],"about_ca_topic_score_codex":0.00003342674,"about_ca_topic_score_gemma":0.00012441675,"teacher_disagreement_score":0.9787595,"about_ca_system_score_codex":0.00005355937,"about_ca_system_score_gemma":0.00010814816,"threshold_uncertainty_score":0.3585579},"labels":[],"label_agreement":null},{"id":"W2120627558","doi":"10.1109/wcnc.2009.4917680","title":"Diversity-Multiplexing Tradeoff Bounds for Wireless Relay Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Multiplexing; Computer science; Relay; Computer network; Wireless; Wireless network; Cooperative diversity; Antenna diversity; Antenna (radio); Diversity gain; Telecommunications; Fading","score_opus":0.04737072280599189,"score_gpt":0.27611771947052516,"score_spread":0.22874699666453327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120627558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004542931,0.0002231064,0.9858679,0.0037564116,0.00018490234,0.00018151557,3.176692e-7,0.0002551252,0.0049877493],"genre_scores_gemma":[0.9674891,0.000207559,0.029147089,0.0020883002,0.00008114332,0.0000058378832,0.0000036080146,0.00000386548,0.0009734807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917746,0.000055251207,0.00015288303,0.00024821458,0.00011171482,0.00025449778],"domain_scores_gemma":[0.9991195,0.00016252228,0.000047736045,0.0005063095,0.00008333265,0.00008055054],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002899133,0.000105964886,0.00012572043,0.00005287357,0.0014349627,0.00013842042,0.0010901634,0.000052803185,0.000014751268],"category_scores_gemma":[0.000017673972,0.00009913633,0.000077404,0.00031254135,0.000024003444,0.00039429488,0.0006618628,0.00013151267,0.0000045864995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012642328,0.00008259199,0.0005624101,0.0000022607965,0.000015411582,0.0000018391559,0.0018120286,0.0029776578,0.00030325298,0.64647615,0.009138342,0.33861542],"study_design_scores_gemma":[0.0004518951,0.00008812244,0.0028270993,0.000015151692,0.0000030314086,0.0000026965197,0.000018585924,0.979085,0.00017013746,0.0010061298,0.01614842,0.00018371803],"about_ca_topic_score_codex":0.0000021757335,"about_ca_topic_score_gemma":0.00002073142,"teacher_disagreement_score":0.97610736,"about_ca_system_score_codex":0.00004124161,"about_ca_system_score_gemma":0.000018876593,"threshold_uncertainty_score":0.99986506},"labels":[],"label_agreement":null},{"id":"W2120752472","doi":"10.1109/cwit.2009.5069512","title":"An opportunistic-based protocol for bidirectional cooperative networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Protocol (science); Relay; Cooperative diversity; Outage probability; Channel (broadcasting); Upper and lower bounds; Selection (genetic algorithm); Exploit; Scheme (mathematics); Power (physics); Distributed computing; Fading; Mathematics; Computer security","score_opus":0.0916778520068448,"score_gpt":0.37279351924523246,"score_spread":0.28111566723838766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120752472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046292525,0.0000022221227,0.9582283,0.0018939245,0.000051303843,0.03411784,0.0000013095522,0.00026230703,0.005438178],"genre_scores_gemma":[0.29468036,0.0000073276387,0.35325313,0.018107243,0.00048579098,0.33110705,0.00008920578,0.000024329838,0.002245557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991281,0.00011231512,0.00018898486,0.00027289227,0.00010914256,0.00018858259],"domain_scores_gemma":[0.998859,0.00011965752,0.000053834327,0.0005296598,0.00031719616,0.0001206616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029910044,0.00011738348,0.000111002,0.00005596336,0.00036359302,0.00021672928,0.0006533584,0.00004251801,0.00010912321],"category_scores_gemma":[0.000030695606,0.000098573015,0.000043781016,0.00029801767,0.000027125829,0.00033682003,0.000033806653,0.000091527996,0.000005362201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048464964,0.00034672642,0.000040720464,0.0000025324887,0.0000066262082,0.0000012648671,0.000051819632,0.011522321,0.00075421337,0.78579473,0.012802995,0.18862756],"study_design_scores_gemma":[0.0006663013,0.0004369859,0.0003158819,0.000011449025,0.0000011113657,0.0000014934892,0.0000029268501,0.93758994,0.0004186203,0.00044624807,0.059961848,0.00014719539],"about_ca_topic_score_codex":6.844253e-7,"about_ca_topic_score_gemma":0.000011032941,"teacher_disagreement_score":0.9260676,"about_ca_system_score_codex":0.000033161643,"about_ca_system_score_gemma":0.00015331026,"threshold_uncertainty_score":0.40196908},"labels":[],"label_agreement":null},{"id":"W2120791636","doi":"10.1049/iet-com.2013.0659","title":"Multi‐hop relaying systems in the presence of co‐channel interference over Nakagami‐ <i>m</i> fading channels","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"University of Tabuk","keywords":"Nakagami distribution; Fading; Co-channel interference; Interference (communication); Computer science; Channel (broadcasting); Fading distribution; Telecommunications; Computer network; Rayleigh fading","score_opus":0.09812969559055215,"score_gpt":0.3301040105758546,"score_spread":0.23197431498530244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120791636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015804602,0.0042839595,0.96081436,0.0057597514,0.00050765683,0.0008882073,0.000008107392,0.00018746762,0.011745889],"genre_scores_gemma":[0.99164,0.001503805,0.0062009315,0.00037891025,0.00002311332,0.00014426184,0.000008942636,0.000009484091,0.00009057795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973699,0.001411626,0.0005061012,0.00024658052,0.00022125653,0.0002445348],"domain_scores_gemma":[0.99358594,0.0017947989,0.0002447756,0.0041290466,0.0001959353,0.000049520095],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0017302951,0.00015126371,0.00022719036,0.00015701134,0.00041930572,0.00020948926,0.0067627975,0.0000629062,0.000003490708],"category_scores_gemma":[0.00036998486,0.00012535974,0.000063311396,0.00084015104,0.00019697353,0.000480609,0.0013655738,0.00046405106,0.000018410206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001992296,0.0013224799,0.0046500303,0.00015420973,0.00010123739,0.0000021945566,0.12289481,0.033318643,0.016141498,0.78021145,0.0062801144,0.03490342],"study_design_scores_gemma":[0.00034840268,0.00004098907,0.0020196692,0.00032723453,0.000004853406,0.000006503965,0.0006709971,0.9858486,0.00017687785,0.00037027488,0.009997656,0.0001879353],"about_ca_topic_score_codex":0.000103724844,"about_ca_topic_score_gemma":0.00015436334,"teacher_disagreement_score":0.9758354,"about_ca_system_score_codex":0.000044237826,"about_ca_system_score_gemma":0.000042872085,"threshold_uncertainty_score":0.9986111},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03229868936485061,"score_gpt":0.2693690723793093,"score_spread":0.23707038301445868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120896095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062254636,0.00030142802,0.97746533,0.010444659,0.0001599998,0.000236094,0.00003509691,0.0005955305,0.010139307],"genre_scores_gemma":[0.97431177,0.0008787629,0.02269689,0.00020699583,0.0000241855,0.000097306,0.00002941281,0.000016660902,0.0017380395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857956,0.00030426926,0.00035338168,0.00028429492,0.00020522017,0.00027327222],"domain_scores_gemma":[0.9955425,0.0004861596,0.000104379695,0.0035864909,0.00019192882,0.00008852681],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00024658398,0.00018971004,0.00018562734,0.00018793199,0.0013208793,0.00021851236,0.0026723754,0.00007550392,0.000068491354],"category_scores_gemma":[0.00000806887,0.00020327707,0.0001310443,0.001021996,0.00014961103,0.0003825339,0.00003962769,0.00043993403,0.00043319777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041375337,0.0052052126,0.00009165843,0.000028847744,0.00032051196,0.000010100208,0.001594489,0.12042234,0.064923115,0.62784034,0.043199554,0.13632244],"study_design_scores_gemma":[0.0009871542,0.00010820373,0.0007256556,0.000112059155,0.000048675553,0.000038771297,0.00003889816,0.8565692,0.017900696,0.0026043598,0.120090336,0.00077602733],"about_ca_topic_score_codex":0.000032653345,"about_ca_topic_score_gemma":0.00015162851,"teacher_disagreement_score":0.9736892,"about_ca_system_score_codex":0.00013111977,"about_ca_system_score_gemma":0.00007114086,"threshold_uncertainty_score":0.99997926},"labels":[],"label_agreement":null},{"id":"W2120987109","doi":"10.1109/tcomm.2010.03.070409","title":"Fixed relaying versus selective relaying in multi-hop diversity transmission systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Hop (telecommunications); Relay; Computer science; Diversity gain; Bit error rate; Fading; Transmission (telecommunications); Diversity scheme; Cooperative diversity; Outage probability; Diversity combining; Electronic engineering; Telecommunications; Decoding methods; Engineering; Physics","score_opus":0.09965880473049743,"score_gpt":0.3175072360297983,"score_spread":0.21784843129930087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120987109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009331838,0.00037107183,0.98376656,0.001783681,0.0009828797,0.00047888808,0.000006236829,0.00034884692,0.0029299944],"genre_scores_gemma":[0.9582108,0.0016936265,0.03962395,0.00007450906,0.000010546606,0.00011714237,0.000004646606,0.000017098759,0.00024767642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981258,0.00053068314,0.00040168592,0.00039174463,0.00024406813,0.0003060273],"domain_scores_gemma":[0.9958759,0.00093306135,0.00011815806,0.0027078823,0.00022190527,0.00014309117],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00059764326,0.00021331903,0.00022565316,0.0003699382,0.002346002,0.00015251635,0.0028874506,0.00016673534,0.000020697422],"category_scores_gemma":[0.000030470756,0.00023217549,0.00011916622,0.0012921711,0.00013768312,0.00068913674,0.00009765671,0.0016486098,0.000055270208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005644395,0.0072236937,0.002099693,0.000093656025,0.00054457854,0.000024137413,0.061401907,0.10153745,0.09418491,0.09120941,0.0009771079,0.64013904],"study_design_scores_gemma":[0.003326679,0.00014061517,0.0024217458,0.00017773348,0.000040395273,0.000015216716,0.0004884472,0.9814526,0.002915241,0.000095970645,0.008287626,0.0006377416],"about_ca_topic_score_codex":0.00017283646,"about_ca_topic_score_gemma":0.0017020345,"teacher_disagreement_score":0.94887894,"about_ca_system_score_codex":0.00018845985,"about_ca_system_score_gemma":0.000111153604,"threshold_uncertainty_score":0.9989528},"labels":[],"label_agreement":null},{"id":"W2121304904","doi":"10.1109/icc.2006.255029","title":"Low-Complexity Cooperative Coding for Sensor Networks using Rateless and LDGM Codes","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Coding (social sciences); Online codes; Wireless sensor network; Computer network; Linear network coding; Channel (broadcasting); Node (physics); Decoding methods; Distributed computing; Algorithm; Block code; Linear code; Mathematics; Engineering","score_opus":0.20535018977858485,"score_gpt":0.375488632811532,"score_spread":0.17013844303294715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121304904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014844656,0.00024232254,0.96646637,0.0061809183,0.00040481164,0.0005233128,0.00008088258,0.0001618131,0.011094926],"genre_scores_gemma":[0.94185513,0.0009033942,0.055903636,0.0005254403,0.00013050126,0.000099002325,0.00012451933,0.000016033482,0.0004423318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841166,0.0002786885,0.00044498418,0.00038579621,0.000210955,0.0002679279],"domain_scores_gemma":[0.996924,0.0005723532,0.00022270181,0.001264027,0.0009399614,0.00007696801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039347648,0.00023197355,0.00024638898,0.00016234072,0.00110176,0.0007409104,0.0022000787,0.00008367351,0.00003414489],"category_scores_gemma":[0.00006068528,0.00023853012,0.000069788,0.00028528148,0.00041945488,0.00043859493,0.00052273204,0.00031789855,0.000010038801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017589173,0.00017634367,0.00016763307,0.0000051122156,0.00003108703,7.2762543e-7,0.0001741369,0.0055358363,0.0044768215,0.9830288,0.0008219125,0.005563997],"study_design_scores_gemma":[0.00052261463,0.00004131178,0.0006139286,0.00011846682,0.000009160637,0.000010100063,0.00007142576,0.98982424,0.0016430848,0.0037609902,0.0030958704,0.00028882982],"about_ca_topic_score_codex":0.000088907116,"about_ca_topic_score_gemma":0.000680393,"teacher_disagreement_score":0.9842884,"about_ca_system_score_codex":0.0001323627,"about_ca_system_score_gemma":0.00013452239,"threshold_uncertainty_score":0.97269756},"labels":[],"label_agreement":null},{"id":"W2121425660","doi":"10.1186/1687-1499-2011-65","title":"Multihop relaying and multiple antenna techniques: performance trade-offs in cellular systems","year":2011,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Path loss; Cellular network; Spectral efficiency; Interference (communication); Antenna (radio); Computer network; Wireless; Enhanced Data Rates for GSM Evolution; Throughput; Wireless network; Signal-to-interference-plus-noise ratio; Cellular communication; Channel (broadcasting); Electronic engineering; Telecommunications","score_opus":0.0788240716198979,"score_gpt":0.26550311294365947,"score_spread":0.18667904132376156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121425660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8134142,0.057585485,0.11979302,0.0019427052,0.00078768394,0.0008901011,0.000001610772,0.000367009,0.0052181906],"genre_scores_gemma":[0.9007335,0.089842744,0.009120728,0.00017380864,0.00007510945,0.000018354478,0.0000016726533,0.000018302211,0.00001579154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980952,0.0005837434,0.00056618074,0.00026615505,0.0001644613,0.00032423972],"domain_scores_gemma":[0.99789745,0.00041476524,0.00029063603,0.0011814467,0.00007167946,0.00014402496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012635039,0.00021212721,0.00028036564,0.0002658364,0.0010483899,0.000296431,0.0014442172,0.00008821865,0.0000015758077],"category_scores_gemma":[0.000017157492,0.00019508392,0.000043636905,0.00051528576,0.00014636498,0.00057269953,0.0006971618,0.0009464328,0.0000018253141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003331183,0.00023193106,0.063792616,0.000029607198,0.000036796733,0.000024763724,0.00703455,0.000060189443,0.0024301335,0.010902841,0.000046138684,0.91537714],"study_design_scores_gemma":[0.00063104683,0.00017966832,0.01379178,0.0013278816,0.000008937895,0.00022203708,0.00034938456,0.97153443,0.000248781,0.000081993545,0.011235181,0.00038889484],"about_ca_topic_score_codex":0.0000145727245,"about_ca_topic_score_gemma":0.000030931136,"teacher_disagreement_score":0.97147423,"about_ca_system_score_codex":0.00006583818,"about_ca_system_score_gemma":0.000031139105,"threshold_uncertainty_score":0.80634737},"labels":[],"label_agreement":null},{"id":"W2121578930","doi":"10.1109/tvt.2008.927033","title":"A Convolutional-Based Distributed Coded Cooperation Scheme for Relay Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Code word; Computer science; Algorithm; Convolutional code; Decoding methods; Node (physics); Redundancy (engineering); Theoretical computer science; Topology (electrical circuits); Mathematics; Engineering","score_opus":0.02440895322594596,"score_gpt":0.26984249871784827,"score_spread":0.2454335454919023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121578930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053814454,0.00016901088,0.9727793,0.020135734,0.00025817912,0.0005140495,0.000022307837,0.0007147506,0.000025221343],"genre_scores_gemma":[0.95636344,0.00006219064,0.042156506,0.0010384646,0.000018114042,0.0002241965,0.00003229933,0.000009263461,0.000095536925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988301,0.000069787064,0.000272242,0.00039425708,0.00014206674,0.00029158083],"domain_scores_gemma":[0.9986454,0.00009464917,0.00007544889,0.0007602914,0.0003609545,0.00006321071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020496904,0.0001780729,0.00020024947,0.00033921236,0.00054916524,0.000070892,0.00068082125,0.0002332231,0.000016319851],"category_scores_gemma":[0.000027522103,0.000182472,0.00010809897,0.0010770351,0.00009023797,0.0001848659,0.0000034587392,0.00032375037,0.00002930074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013530832,0.0013922473,0.000010379765,0.000018768016,0.00013432413,0.000013815347,0.0001427454,0.35065454,0.12836063,0.3767759,0.0023070842,0.14005427],"study_design_scores_gemma":[0.0011639253,0.00040983665,0.000018752253,0.00003701892,0.00001208926,0.000012434944,0.0000066180696,0.8730234,0.11283726,0.0010998753,0.011140017,0.00023878989],"about_ca_topic_score_codex":8.0487985e-7,"about_ca_topic_score_gemma":0.0000097137445,"teacher_disagreement_score":0.950982,"about_ca_system_score_codex":0.0001274267,"about_ca_system_score_gemma":0.0001131106,"threshold_uncertainty_score":0.7440992},"labels":[],"label_agreement":null},{"id":"W2121634370","doi":"10.1109/sahcn.2008.22","title":"Effect of Joint Cooperation and Multi-Hopping on the Capacity of Wireless Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Exponent; Computer science; Wireless network; Topology (electrical circuits); Wireless; Combinatorics; Mathematics; Telecommunications","score_opus":0.07079124642554963,"score_gpt":0.2645895432713059,"score_spread":0.19379829684575628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121634370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59553427,0.000085702806,0.40349266,0.0002780761,0.000037054495,0.00013187907,1.2939414e-7,0.00001880046,0.00042143842],"genre_scores_gemma":[0.99754596,0.0005328841,0.0017078485,0.00015093615,0.000009900184,0.000006602712,3.9181407e-7,0.0000024847386,0.00004298166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922067,0.00033293045,0.0001711323,0.00011340032,0.00008575932,0.000076104116],"domain_scores_gemma":[0.99902403,0.00040892197,0.0000736653,0.0003782313,0.000092454036,0.000022668213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054918503,0.00007042291,0.0001395708,0.000030170915,0.0001804512,0.000015203951,0.00026096823,0.000025868325,0.000007575359],"category_scores_gemma":[0.00005990498,0.00004211994,0.000027928565,0.00020357268,0.00010714562,0.000096472315,0.00015202162,0.00010328921,0.0000010049081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071735136,0.0003086622,0.007757287,0.000084460145,0.00010200933,0.0000030151264,0.0071921367,0.01483488,0.09482759,0.59582597,0.0017338276,0.27725843],"study_design_scores_gemma":[0.00025463535,0.00017206132,0.0031964483,0.000047025576,0.0000018411357,0.000004020088,0.0000050252547,0.9479833,0.048240695,0.0000040848477,0.00003554209,0.000055276392],"about_ca_topic_score_codex":0.0000107642145,"about_ca_topic_score_gemma":0.000017353643,"teacher_disagreement_score":0.93314844,"about_ca_system_score_codex":0.00000911915,"about_ca_system_score_gemma":0.000011020869,"threshold_uncertainty_score":0.17176013},"labels":[],"label_agreement":null},{"id":"W2121688038","doi":"10.1109/icc.2009.5198857","title":"Cooperative Amplify-and-Forward Beamforming for OFDM Systems with Multiple Relays","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Beamforming; Computer science; Frequency domain; Multiplexing; Transmission (telecommunications); Interference (communication); Algorithm; Power (physics); Time domain; Frequency-division multiplexing; Mathematical optimization; Mathematics; Telecommunications; Channel (broadcasting); Physics","score_opus":0.03012752257942091,"score_gpt":0.26690056992001443,"score_spread":0.2367730473405935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121688038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024387243,0.00042468638,0.99008584,0.0012624259,0.00006779781,0.00068022223,0.0000017662397,0.00016742438,0.0048710876],"genre_scores_gemma":[0.90676033,0.00018387067,0.090776555,0.0007927096,0.000040581173,0.0000921323,0.000006246545,0.0000068088793,0.00134076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991598,0.00004969666,0.00019024465,0.00027316378,0.000111638845,0.00021545931],"domain_scores_gemma":[0.9989595,0.0002496538,0.00006114923,0.00044518456,0.0001957753,0.00008875389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026458228,0.0001331245,0.00017851779,0.00005730527,0.00037651503,0.00024911566,0.00043701468,0.000041307063,0.0000034037328],"category_scores_gemma":[0.000047821002,0.0000949952,0.000024030096,0.00023835003,0.000032013028,0.00045954838,0.00010488605,0.000108966444,0.000006213465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046493926,0.0000801521,0.00041242817,0.000015788008,0.000041269006,0.0000020075677,0.0021227049,0.0042806743,0.0014530008,0.8998025,0.0024975901,0.08924537],"study_design_scores_gemma":[0.001162582,0.0005736742,0.0005156981,0.00007883044,0.000007883636,0.00002914588,0.00023525897,0.9354014,0.00081946113,0.00021228341,0.06063828,0.0003255464],"about_ca_topic_score_codex":0.0000061077226,"about_ca_topic_score_gemma":0.0000381985,"teacher_disagreement_score":0.9311207,"about_ca_system_score_codex":0.000031511143,"about_ca_system_score_gemma":0.00004028592,"threshold_uncertainty_score":0.38737917},"labels":[],"label_agreement":null},{"id":"W2121736200","doi":"10.1109/isit.2010.5513497","title":"Lattice sequential decoder for coded MIMO channel: Performance and complexity analysis","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"MIMO; Computer science; Computational complexity theory; Algorithm; Decoding methods; Lattice (music); Channel (broadcasting); Multiplexing; Lattice reduction; Theoretical computer science; Electronic engineering; Telecommunications; Physics; Engineering","score_opus":0.0896070612060259,"score_gpt":0.3188891924817777,"score_spread":0.2292821312757518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121736200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16289109,0.000038830916,0.8327789,0.001488643,0.00015367293,0.00015105563,0.0000022107931,0.00010246258,0.002393163],"genre_scores_gemma":[0.89924884,0.000080645106,0.0996045,0.00051155617,0.00003727247,0.000018992569,0.000007649355,0.000003712258,0.00048684096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993252,0.000038554543,0.00014696903,0.00023627725,0.000086038606,0.0001669207],"domain_scores_gemma":[0.99908483,0.00011893245,0.000047338777,0.00051235093,0.00015990282,0.00007664985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000350231,0.00008874941,0.00014449624,0.00009673258,0.00032643246,0.00015771545,0.00051957526,0.000037603564,0.00007542616],"category_scores_gemma":[0.00002569268,0.000077698794,0.000056963883,0.00045084246,0.00007802512,0.0003060152,0.00029113409,0.00012456097,0.0000072519947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043733577,0.00020528761,0.008911425,0.000047647078,0.0006091253,0.0000011035156,0.0028755616,0.00058874517,0.008552092,0.8675459,0.003819379,0.10679998],"study_design_scores_gemma":[0.00026003664,0.000023694682,0.008351484,0.0000020101306,0.000036249025,0.0000024867677,0.000008006307,0.9831204,0.0013572484,0.0006690762,0.0060431054,0.00012622654],"about_ca_topic_score_codex":0.0000086244,"about_ca_topic_score_gemma":0.0009321891,"teacher_disagreement_score":0.9825316,"about_ca_system_score_codex":0.000007117733,"about_ca_system_score_gemma":0.000021267502,"threshold_uncertainty_score":0.3168465},"labels":[],"label_agreement":null},{"id":"W2121793268","doi":"10.1109/twc.2009.071275","title":"On the design of delay-tolerant distributed space-time codes with minimum length","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Decoding methods; Asynchronous communication; Full Rate; Space–time code; Guard (computer science); Transmission (telecommunications); Algorithm; Block code; Telecommunications","score_opus":0.041962339531911884,"score_gpt":0.26417271358652855,"score_spread":0.22221037405461666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121793268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058967024,0.00014267936,0.97630614,0.016197277,0.000041325322,0.0004913989,0.000031222393,0.00018397985,0.00070926454],"genre_scores_gemma":[0.9820023,0.001109379,0.016099274,0.0005331172,0.000005424068,0.000094421615,0.000010016766,0.000013478169,0.00013259017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980408,0.0007842285,0.00036729572,0.00026761377,0.00029394825,0.00024609547],"domain_scores_gemma":[0.99362755,0.0019708478,0.00017966429,0.0038606182,0.0002747858,0.00008653988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043657096,0.0002309892,0.0002747673,0.00014932979,0.0010463251,0.0001101887,0.0030544393,0.0000700601,0.000034182976],"category_scores_gemma":[0.0000124947255,0.00016558531,0.00009944288,0.0010317515,0.00028242936,0.00023711147,0.000018264083,0.0005228087,0.000045817113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035020543,0.0046975594,0.000008242354,0.000012845644,0.00041968338,0.000005498897,0.0051079127,0.29963475,0.023418875,0.48534414,0.002992791,0.17800747],"study_design_scores_gemma":[0.0007200698,0.00070946047,0.00016872857,0.00023967169,0.000047738828,0.000015655643,0.00009269288,0.9802041,0.015485528,0.0010642208,0.00087562914,0.00037650522],"about_ca_topic_score_codex":0.00000746558,"about_ca_topic_score_gemma":0.000036065558,"teacher_disagreement_score":0.9761056,"about_ca_system_score_codex":0.00007638544,"about_ca_system_score_gemma":0.00012478611,"threshold_uncertainty_score":0.80475926},"labels":[],"label_agreement":null},{"id":"W2121877231","doi":"10.1109/iccw.2008.17","title":"Co-Channel Interference Cancellation in Multihop Relay Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Single antenna interference cancellation; Computer science; Relay; Telecommunications link; Interference (communication); Co-channel interference; Electronic engineering; Computer network; Channel (broadcasting); Fading; Engineering; Physics","score_opus":0.060904726258540695,"score_gpt":0.2898766061163556,"score_spread":0.22897187985781486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121877231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012758369,0.00033430176,0.96808904,0.00064294843,0.00016478206,0.00010946077,1.1579542e-7,0.000115293034,0.017785657],"genre_scores_gemma":[0.99182695,0.0017027471,0.0047077616,0.0004207031,0.000028848575,0.000011920147,0.0000024212893,0.0000039335214,0.0012946948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992411,0.00009947473,0.00019489422,0.0002110079,0.00008420414,0.00016931136],"domain_scores_gemma":[0.9993063,0.00010095205,0.000043926146,0.00043887828,0.000062283565,0.00004766746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017632937,0.00008466341,0.00009930017,0.00008106057,0.00014318714,0.000034557448,0.0005778328,0.00004177443,0.000043745775],"category_scores_gemma":[0.000022053788,0.000078589015,0.000022445445,0.0004123709,0.000037350663,0.0002786398,0.00013570276,0.00017810988,0.000038576774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006223944,0.00047693835,0.042816546,0.000014291366,0.000036851492,0.000096808886,0.023147201,0.42371124,0.0018230902,0.16818386,0.0394597,0.30017123],"study_design_scores_gemma":[0.00022611313,0.000019935986,0.009795324,0.000021131882,2.745354e-7,0.000008410743,0.00001384229,0.98799294,0.00027053623,0.000056104913,0.0014816547,0.00011375304],"about_ca_topic_score_codex":0.000033587985,"about_ca_topic_score_gemma":0.00041168637,"teacher_disagreement_score":0.9790686,"about_ca_system_score_codex":0.00005916991,"about_ca_system_score_gemma":0.000036138383,"threshold_uncertainty_score":0.3204767},"labels":[],"label_agreement":null},{"id":"W2121938034","doi":"10.1109/glocom.2005.1578374","title":"On the optimal number of hops in infrastructure-based fixed relay networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Hop (telecommunications); Relay; Computer science; Computer network; Wireless network; Spectral efficiency; Wireless; Topology (electrical circuits); Mathematics; Telecommunications; Channel (broadcasting); Power (physics)","score_opus":0.02535904658105658,"score_gpt":0.28665937485464854,"score_spread":0.26130032827359195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121938034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17547993,0.0013036615,0.6642432,0.047483243,0.0008869707,0.001816466,0.000097847194,0.0005743738,0.10811428],"genre_scores_gemma":[0.94005466,0.0010376151,0.056363262,0.0021779065,0.000051694293,0.00008669855,0.00003862166,0.00001478066,0.00017477309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966197,0.0009382829,0.0009181674,0.00048813503,0.00038361334,0.00065207115],"domain_scores_gemma":[0.99440515,0.0008068876,0.00041458552,0.003818584,0.00038541816,0.00016939016],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00086590816,0.00039582662,0.0004517647,0.00014141436,0.000479101,0.00025374148,0.0054915776,0.00019692592,0.0004791589],"category_scores_gemma":[0.00016779629,0.00033492874,0.00017580988,0.0015932696,0.00034244885,0.0004173287,0.0007246469,0.0008741823,0.00016741091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054013544,0.00065310136,0.0039435066,0.0000072494036,0.00007539251,0.0000028019656,0.0003502667,0.26855543,0.000058504913,0.5551875,0.057912692,0.11319948],"study_design_scores_gemma":[0.001147337,0.00007876984,0.016801953,0.00016337122,0.000016618173,0.000024895759,0.00005298907,0.9273637,0.00021674037,0.0017870546,0.051815033,0.00053152826],"about_ca_topic_score_codex":0.0000740464,"about_ca_topic_score_gemma":0.0013898277,"teacher_disagreement_score":0.7645747,"about_ca_system_score_codex":0.00041495243,"about_ca_system_score_gemma":0.00049550954,"threshold_uncertainty_score":0.9999103},"labels":[],"label_agreement":null},{"id":"W2122182743","doi":"10.1109/icc.2009.5199201","title":"Multi-Hop Capacity of MIMO-Multiplexing Relaying in WiMAX Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Multiplexing; Computer science; MIMO; Mesh networking; WiMAX; Relay; Telecommunications; Channel (broadcasting); Wireless; Physics","score_opus":0.07135532774249563,"score_gpt":0.2925919619569134,"score_spread":0.22123663421441775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122182743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041875083,0.0003194651,0.9525263,0.0009422178,0.000111061534,0.0001566611,2.2596203e-7,0.0001262261,0.003942772],"genre_scores_gemma":[0.8587363,0.00026991265,0.14031212,0.0005575504,0.000016982354,0.0000032515322,9.5361975e-7,0.000003502101,0.000099446625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988801,0.00015495178,0.0003488424,0.00024879607,0.00012573916,0.00024158768],"domain_scores_gemma":[0.9989601,0.00014732969,0.000094008356,0.0006391536,0.00010005181,0.00005934956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005141413,0.000116486364,0.0001941361,0.00011611623,0.00010851104,0.000054657077,0.0008422029,0.00006006608,0.000017483371],"category_scores_gemma":[0.00008563588,0.00010945087,0.000054285134,0.000668924,0.000036135578,0.00039462792,0.0002188433,0.00025145995,0.000004869552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026929158,0.0006992301,0.021375056,0.00001579882,0.000030952215,0.0000143651205,0.0077157617,0.03591019,0.04093477,0.44032717,0.0012535454,0.45169622],"study_design_scores_gemma":[0.00047045635,0.00003018152,0.0252023,0.000061082836,9.698281e-7,0.000002389405,0.000031971307,0.9725895,0.001017061,0.00017563977,0.00027515838,0.00014331068],"about_ca_topic_score_codex":0.000025617019,"about_ca_topic_score_gemma":0.00018630203,"teacher_disagreement_score":0.9366793,"about_ca_system_score_codex":0.00004791856,"about_ca_system_score_gemma":0.000022604392,"threshold_uncertainty_score":0.44632772},"labels":[],"label_agreement":null},{"id":"W2122200978","doi":"10.1109/glocom.2009.5425445","title":"Reliability-Based Rate Allocation in Wireless Inter-Session Network Coding Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Unicast; Linear network coding; Computer science; Computer network; Wireless network; Wireless; Reliability (semiconductor); Wireless WAN; Network topology; Session (web analytics); Distributed computing; Multicast; Wi-Fi array; Telecommunications","score_opus":0.03115151271823896,"score_gpt":0.2831872667828633,"score_spread":0.25203575406462436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122200978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03415464,0.0001569539,0.9595105,0.002207348,0.00034744028,0.00026813167,9.9877816e-8,0.00022239547,0.0031324637],"genre_scores_gemma":[0.9920481,0.000108634275,0.006424886,0.0011282826,0.000055249,0.000017954055,0.000005251821,0.0000044216226,0.00020724595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984781,0.00048457808,0.00035640338,0.00031616204,0.00012311536,0.00024163017],"domain_scores_gemma":[0.99873894,0.000209733,0.00009112164,0.00076302874,0.00013487878,0.00006229015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011770527,0.00012338701,0.00017060469,0.00009311181,0.00015526699,0.0002045052,0.0007557338,0.000056114553,0.000010039595],"category_scores_gemma":[0.000038313254,0.00010726203,0.000034545064,0.000787133,0.000019483872,0.0004074448,0.00012507176,0.00018689607,0.000020492844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036609785,0.00028919618,0.003861578,0.00003111991,0.000006904462,0.0000070991127,0.00059548265,0.08507542,0.014008455,0.6357277,0.003837389,0.25652304],"study_design_scores_gemma":[0.00030078777,0.00006214409,0.007408788,0.00024151668,0.0000011975297,9.008901e-7,0.000016308724,0.9897121,0.0005096626,0.00044202677,0.0011528687,0.00015167624],"about_ca_topic_score_codex":0.000012709113,"about_ca_topic_score_gemma":0.00003025767,"teacher_disagreement_score":0.95789343,"about_ca_system_score_codex":0.00012336977,"about_ca_system_score_gemma":0.00006364544,"threshold_uncertainty_score":0.43740186},"labels":[],"label_agreement":null},{"id":"W2122355024","doi":"10.1109/icc.2005.1494418","title":"Distributed space-time block coding with imperfect channel estimation","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Imperfect; Relay; Computer science; Channel (broadcasting); Block code; Algorithm; Coding (social sciences); Bit error rate; Channel code; Control theory (sociology); Block (permutation group theory); Power (physics); Mathematics; Decoding methods; Telecommunications; Control (management); Statistics","score_opus":0.017498911992920124,"score_gpt":0.2489728354923704,"score_spread":0.23147392349945028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122355024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010640622,0.000101985366,0.9761043,0.0076081557,0.0000310439,0.0001509817,0.0000012877391,0.00037443545,0.0049871453],"genre_scores_gemma":[0.95101243,0.000064321306,0.047829427,0.00029233098,0.000042778087,0.000012209572,0.000011697133,0.0000062475874,0.0007285424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924463,0.000063280306,0.00013419492,0.00021595269,0.00014484677,0.00019707934],"domain_scores_gemma":[0.99917084,0.00008989563,0.000054157925,0.00050825346,0.00010080409,0.00007605072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019760881,0.00011624131,0.00011647036,0.000059141978,0.00023863246,0.000173336,0.0005027818,0.00002879804,0.00006358888],"category_scores_gemma":[0.000026968182,0.000090199996,0.000026799644,0.00044061683,0.000026463358,0.0004933121,0.00020638008,0.0001018318,0.00020785767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005791843,0.00050104805,0.00042786857,0.000027816986,0.00016164221,0.000014657787,0.0039208243,0.24422301,0.016657837,0.29236436,0.042440683,0.39920232],"study_design_scores_gemma":[0.00027924997,0.000053142532,0.00040028334,0.000024641893,0.0000034710902,0.000017174552,0.0000063928655,0.9909644,0.0040554213,0.000051304516,0.0039924467,0.00015207934],"about_ca_topic_score_codex":0.0000023776893,"about_ca_topic_score_gemma":0.000018459074,"teacher_disagreement_score":0.9403718,"about_ca_system_score_codex":0.00006402288,"about_ca_system_score_gemma":0.000034843284,"threshold_uncertainty_score":0.36782488},"labels":[],"label_agreement":null},{"id":"W2122471890","doi":"10.1109/iwqos.2006.250447","title":"Echelon: Peer-to-Peer Network Diagnosis with 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":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Peer-to-peer; Linear network coding; Troubleshooting; Network topology; Server; Computer network; Distributed computing; Leverage (statistics); Dissemination; Telecommunications; Artificial intelligence; Network packet","score_opus":0.0679937543639916,"score_gpt":0.3419990575953241,"score_spread":0.27400530323133254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122471890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05946077,0.00046367873,0.56462497,0.3226354,0.0018360143,0.0006585662,0.000019753721,0.00042973406,0.049871128],"genre_scores_gemma":[0.94179124,0.00008610106,0.040687006,0.013893141,0.0009020909,0.00008391186,0.00006168965,0.000023165223,0.002471665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99703985,0.00026428682,0.00062311295,0.0004837248,0.001220785,0.000368207],"domain_scores_gemma":[0.995799,0.0012096935,0.00031716522,0.00086733507,0.0016950313,0.00011175817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017023218,0.00023620931,0.00031200156,0.0001056006,0.00025283502,0.00023839722,0.0021029415,0.00008886393,0.00014446602],"category_scores_gemma":[0.00016608684,0.00022114579,0.00008631094,0.0013284797,0.000039660594,0.00034653654,0.00060282706,0.00031003056,0.00009562447],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016605393,0.00030959712,0.017310685,0.000022615533,0.00012680814,0.0000062670397,0.00078031176,0.2744618,0.000084389234,0.60631126,0.07534991,0.02507033],"study_design_scores_gemma":[0.0029312307,0.00030706546,0.27489054,0.0027774856,0.00004139495,0.000018837945,0.00031890612,0.1266451,0.0011525764,0.023469763,0.5653926,0.0020544776],"about_ca_topic_score_codex":0.00016263752,"about_ca_topic_score_gemma":0.0019048282,"teacher_disagreement_score":0.8823305,"about_ca_system_score_codex":0.000119494034,"about_ca_system_score_gemma":0.000056030276,"threshold_uncertainty_score":0.90180635},"labels":[],"label_agreement":null},{"id":"W2122544392","doi":"10.1109/ciss.2010.5464830","title":"Fractional cooperation and the max-min rate in a multi-source cooperative network","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Overhead (engineering); Computer science; Orthogonal frequency-division multiplexing; Upper and lower bounds; Multiplexing; Computer network; Matching (statistics); Key (lock); Mathematical optimization; Computational complexity theory; Algorithm; Mathematics; Telecommunications; Statistics; Channel (broadcasting)","score_opus":0.030123060405621477,"score_gpt":0.2816149932040487,"score_spread":0.25149193279842724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122544392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025750788,0.00031214656,0.95962024,0.009898451,0.0003345056,0.00040774368,3.6759906e-7,0.00009150439,0.0035842718],"genre_scores_gemma":[0.9781541,0.00030900404,0.016250482,0.002812276,0.000087834786,0.000060770835,0.0000030730955,0.0000063332145,0.002316124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988313,0.0004243848,0.0002210855,0.00025123855,0.00009233938,0.00017965898],"domain_scores_gemma":[0.9987305,0.0005830288,0.00005424436,0.00042792392,0.00015236605,0.00005192786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011713955,0.00011754879,0.00013986748,0.000044759632,0.00042382124,0.00030953187,0.000475795,0.000053971555,0.00010241503],"category_scores_gemma":[0.00017781886,0.00007706113,0.000023271125,0.000478438,0.00016909264,0.00042372255,0.00032456795,0.00046359203,0.000031312222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004655207,0.00008499518,0.0013230605,0.0000015291268,0.000018010762,0.000002073165,0.0024363839,0.008949696,0.0031055463,0.94246686,0.0025673045,0.038997997],"study_design_scores_gemma":[0.0016974831,0.000015711095,0.0077319555,0.000009390894,0.0000019195318,0.000009833488,0.00003835553,0.9606061,0.0001920735,0.00030954363,0.029248085,0.00013953148],"about_ca_topic_score_codex":0.000026015266,"about_ca_topic_score_gemma":0.002739312,"teacher_disagreement_score":0.9524033,"about_ca_system_score_codex":0.0000144334335,"about_ca_system_score_gemma":0.00005991609,"threshold_uncertainty_score":0.32597333},"labels":[],"label_agreement":null},{"id":"W2122599120","doi":"10.1109/glocom.2008.ecp.206","title":"Characterization of Relay Channels Using the Bhattacharyya Parameter","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Demodulation; Bhattacharyya distance; Relay; Decoding methods; Computer science; Code word; Algorithm; Signal-to-noise ratio (imaging); Estimation theory; Frame (networking); Noise (video); Telecommunications; Physics; Artificial intelligence","score_opus":0.10031064672583583,"score_gpt":0.2959010774709747,"score_spread":0.19559043074513888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122599120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40346453,0.000045316116,0.59501827,0.0007671516,0.0001208663,0.00007716402,2.0286417e-7,0.000033257453,0.00047326487],"genre_scores_gemma":[0.9896359,0.0003109529,0.009035269,0.0005309353,0.000029993887,0.0000042473243,0.000001926084,0.0000034739942,0.00044732128],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942774,0.00010843902,0.0001559613,0.00011060565,0.0001052748,0.00009198954],"domain_scores_gemma":[0.9992165,0.000082210616,0.00007582874,0.0005147735,0.000089278925,0.000021428104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015683849,0.000057771376,0.00007960897,0.00003832821,0.0002100776,0.000028300296,0.00056744856,0.00002096395,0.00003654698],"category_scores_gemma":[0.000022460565,0.000037936017,0.00003315211,0.0003248424,0.00005217987,0.0002919842,0.00021705458,0.000068056834,0.000007932835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011782277,0.00021279995,0.00461059,0.000013096917,0.00006699557,0.0000069656303,0.015177752,0.0017080919,0.7633712,0.1595122,0.00064076704,0.05466774],"study_design_scores_gemma":[0.00018432956,0.000037276044,0.0071076388,0.000024477762,0.0000036929744,0.000043965116,0.000017741944,0.9151341,0.07192456,0.000110385,0.0052519636,0.00015990208],"about_ca_topic_score_codex":0.0000027956626,"about_ca_topic_score_gemma":9.480237e-7,"teacher_disagreement_score":0.913426,"about_ca_system_score_codex":0.000010500957,"about_ca_system_score_gemma":0.000024867772,"threshold_uncertainty_score":0.16157682},"labels":[],"label_agreement":null},{"id":"W2122912623","doi":"10.1145/1542245.1542255","title":"Random network coding on the iPhone","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Unicast; Computer science; Computer network; Coding (social sciences); Wireless; Energy consumption; Wireless network; Cellular network; Random access; Multicast; Telecommunications; Network packet; Engineering","score_opus":0.04128179296103787,"score_gpt":0.2681919501051912,"score_spread":0.22691015714415333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122912623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012620969,0.00032307926,0.78853744,0.04521761,0.00021555206,0.00016360806,4.8741995e-8,0.00021830291,0.16406223],"genre_scores_gemma":[0.976243,0.00037270522,0.006855107,0.015131576,0.00011562804,0.000004874548,3.4644685e-7,0.0000020313691,0.0012747204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993384,0.00013982358,0.00011112748,0.00013365038,0.00011421816,0.00016281613],"domain_scores_gemma":[0.99887794,0.00037276535,0.000029999213,0.00064763403,0.00003706663,0.000034579807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048755627,0.000070319424,0.00007873081,0.000017730641,0.00037092614,0.00015102651,0.0008832956,0.000016848848,0.00010511161],"category_scores_gemma":[0.00004147762,0.00004109349,0.00003811362,0.0003729215,0.000016088765,0.00010534627,0.00011644768,0.00012867153,0.00011725217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053511867,0.000014570165,0.000010445011,1.12059425e-7,0.000003077498,6.538827e-7,0.00014028673,0.00038107196,0.00012885717,0.883299,0.030006004,0.08601059],"study_design_scores_gemma":[0.0023719182,0.000326279,0.009826377,0.00013037943,0.000006648577,0.000013701598,0.000048193036,0.68652946,0.0030511776,0.03419038,0.2628882,0.0006172989],"about_ca_topic_score_codex":4.7981814e-7,"about_ca_topic_score_gemma":0.0000040829646,"teacher_disagreement_score":0.9749809,"about_ca_system_score_codex":0.000013963305,"about_ca_system_score_gemma":0.000012649119,"threshold_uncertainty_score":0.28529015},"labels":[],"label_agreement":null},{"id":"W2122912686","doi":"10.1109/lcn.2006.322030","title":"Optimal Multi-hop Cellular Architecture for Wireless Communications","year":2006,"lang":"en","type":"article","venue":"Conference on Local Computer Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Hop (telecommunications); Cellular network; Base station; Wireless network; Wireless; Distributed computing; Network architecture; Throughput; Cellular architecture; Architecture; Network topology; Telecommunications; Reference architecture; Software architecture; Software","score_opus":0.051770489924519277,"score_gpt":0.28068162479560865,"score_spread":0.22891113487108938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122912686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065274443,0.00049512275,0.99384385,0.0027913454,0.00040929762,0.00051543344,0.000004157049,0.00033459964,0.0009534268],"genre_scores_gemma":[0.7746069,0.00016127714,0.22371176,0.00085876463,0.00028584208,0.00010107914,0.00007555682,0.000021177057,0.0001776391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998001,0.0002849188,0.0004288771,0.0005802448,0.00019535072,0.0005096404],"domain_scores_gemma":[0.9967507,0.0004107497,0.00015093507,0.0021892386,0.0003578025,0.00014057574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031411112,0.0003242065,0.0003330641,0.00011673487,0.000603515,0.00041156608,0.0033666987,0.00016102615,0.000012577956],"category_scores_gemma":[0.0000058156265,0.0003091761,0.00015679869,0.00042162806,0.00027955358,0.00019083833,0.0011402607,0.00057027856,0.000025269721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015374444,0.0002297989,0.000024275683,0.000007556583,0.000020084526,0.0000030904102,0.00018349892,0.17791751,0.00011384502,0.43430802,0.003741454,0.3834355],"study_design_scores_gemma":[0.0006997644,0.00015015279,0.00016813246,0.0000884174,0.0000057411903,0.0000045772226,0.000010076984,0.9814367,0.00015150585,0.0008923163,0.016027603,0.00036500796],"about_ca_topic_score_codex":0.000011344693,"about_ca_topic_score_gemma":0.000112433125,"teacher_disagreement_score":0.8035192,"about_ca_system_score_codex":0.000075248296,"about_ca_system_score_gemma":0.00008458798,"threshold_uncertainty_score":0.99993604},"labels":[],"label_agreement":null},{"id":"W2123316989","doi":"10.1007/s11277-015-2298-1","title":"Optimal Energy to Spectral-Efficiency Trade-off in Cooperative Networks","year":2015,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Path loss; Metric (unit); Spectral efficiency; Power (physics); Transmitter power output; Fading; Efficient energy use; Throughput; Mathematical optimization; Antenna (radio); Computer network; Telecommunications; Topology (electrical circuits); Wireless; Electrical engineering; Mathematics; Beamforming; Decoding methods","score_opus":0.0584829365015486,"score_gpt":0.30102412182619,"score_spread":0.2425411853246414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123316989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03530128,0.0071865628,0.90287143,0.037217468,0.00027085442,0.00047451028,0.000008458924,0.00035034204,0.016319098],"genre_scores_gemma":[0.98288316,0.0017808074,0.013155345,0.0017016885,0.00005756513,0.0000978325,0.000028823717,0.000018515962,0.00027625536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977743,0.000632695,0.0004175581,0.0004221276,0.0003105059,0.000442822],"domain_scores_gemma":[0.9969995,0.00030051178,0.00008749965,0.0020649703,0.00020427188,0.00034325322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064146094,0.00023753667,0.0002848526,0.00024499002,0.00045610746,0.0002336379,0.0040000286,0.00008831515,0.000017062113],"category_scores_gemma":[0.00007402745,0.00024597577,0.00007644424,0.0018819108,0.00018328826,0.00045867998,0.0015054198,0.0004953543,0.000037140777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004062564,0.00095634384,0.00066201645,0.0000031380482,0.00004191742,0.000012924958,0.02670334,0.08050222,0.00048152838,0.77090317,0.008041705,0.11165107],"study_design_scores_gemma":[0.00048502334,0.00012447653,0.0012355469,0.000048466638,0.000003732996,0.000015799742,0.000764786,0.96373105,0.0000816517,0.000076550634,0.03309009,0.00034284045],"about_ca_topic_score_codex":0.00006149731,"about_ca_topic_score_gemma":0.0011135964,"teacher_disagreement_score":0.9475819,"about_ca_system_score_codex":0.00027238068,"about_ca_system_score_gemma":0.00029933424,"threshold_uncertainty_score":0.9999992},"labels":[],"label_agreement":null},{"id":"W2123408601","doi":"10.1109/wcnc.2011.5779282","title":"Scheduling and network coding in wireless multicast networks: A case for unequal time shares","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Wireless network; Computer network; Multicast; Scheduling (production processes); Wireless; Distributed computing; Maximum throughput scheduling; Round-robin scheduling; Fair-share scheduling; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.07352614722334168,"score_gpt":0.28743649740464594,"score_spread":0.21391035018130428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123408601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049624663,0.0005974998,0.947441,0.000168124,0.00010602318,0.0003333275,8.5754664e-7,0.00013068829,0.0015978103],"genre_scores_gemma":[0.8960875,0.00019973934,0.10327122,0.00024981613,0.000070100185,0.000041872874,0.000002225456,0.000009541961,0.00006796651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989464,0.00008987281,0.00026257764,0.00030718013,0.000058718633,0.00033520936],"domain_scores_gemma":[0.9990143,0.00038345013,0.00005946438,0.00037132532,0.00007791003,0.00009352352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700454,0.00013225303,0.00018652364,0.000065847555,0.00025401838,0.00012969572,0.0004180406,0.000055966233,0.00004089246],"category_scores_gemma":[0.000044945707,0.00012369815,0.00003248615,0.00035730118,0.00004293026,0.0003413063,0.00047167577,0.00014022844,0.0000067484884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075746364,0.00019704747,0.0049101356,0.000036337016,0.000054562875,0.00031457323,0.005088523,0.014026069,0.00030877767,0.6580769,0.0008736173,0.31603774],"study_design_scores_gemma":[0.00044184198,0.000042822558,0.0003081312,0.00007330247,0.0000031399593,0.00006342628,0.000053636566,0.99835885,0.000049457256,0.0002663906,0.0001652097,0.00017378553],"about_ca_topic_score_codex":0.000021265483,"about_ca_topic_score_gemma":0.00027182352,"teacher_disagreement_score":0.9843328,"about_ca_system_score_codex":0.000023290635,"about_ca_system_score_gemma":0.000021321388,"threshold_uncertainty_score":0.50442636},"labels":[],"label_agreement":null},{"id":"W2123545238","doi":"10.1109/tmc.2013.106","title":"An Optimization Framework for XOR-Assisted Cooperative Relaying in Cellular Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Cooperative diversity; Relay; Maximization; Optimization problem; Bipartite graph; Resource allocation; Coding (social sciences); Mathematical optimization; Channel (broadcasting); Computer network; Theoretical computer science; Power (physics); Algorithm; Mathematics; Fading","score_opus":0.027734281654068244,"score_gpt":0.28793953124787675,"score_spread":0.26020524959380853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123545238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010606916,0.0001562513,0.9869474,0.00022624814,0.0005834939,0.0011164375,0.0000012269511,0.0002836831,0.000078326695],"genre_scores_gemma":[0.7408381,0.00008323679,0.25842988,0.00027884092,0.000055768516,0.0002650386,0.000005752925,0.000021327507,0.00002200114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981398,0.00033195387,0.0004661379,0.0005255744,0.00014986572,0.00038669488],"domain_scores_gemma":[0.9980378,0.00072466343,0.0001295719,0.00075367105,0.00023349297,0.00012075911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041308222,0.0002290343,0.00025259977,0.00021513403,0.00072695594,0.0003817019,0.0007616685,0.00015514363,0.0000580528],"category_scores_gemma":[0.000014881939,0.00024093031,0.000090908856,0.0009785539,0.000044482233,0.0006965892,0.000011178539,0.00053320045,0.000014418963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005418247,0.00016773939,0.000013362806,0.0000043783793,0.000010612551,7.211492e-7,0.00065939437,0.8618472,0.0004194888,0.0020442181,0.000017960347,0.13480948],"study_design_scores_gemma":[0.00041445394,0.0002137143,0.000085140506,0.00013515096,0.000005590812,0.0000026741843,0.00012414204,0.9969605,0.0015691804,0.00016095431,0.000059594862,0.00026888205],"about_ca_topic_score_codex":0.000013622717,"about_ca_topic_score_gemma":0.000016973334,"teacher_disagreement_score":0.7302312,"about_ca_system_score_codex":0.00013685999,"about_ca_system_score_gemma":0.00005088845,"threshold_uncertainty_score":0.9824853},"labels":[],"label_agreement":null},{"id":"W2123576001","doi":"10.1109/tcomm.2014.2329834","title":"Diversity–Multiplexing Tradeoff of Asynchronous Decode-and-Forward Cooperative Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; IGNIS Innovation (Canada)","funders":"","keywords":"Asynchronous communication; Multiplexing; Computer science; Transmitter; Orthogonal frequency-division multiplexing; Bandwidth (computing); Electronic engineering; Computer network; Waveform; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.04129521618978292,"score_gpt":0.2712260852320172,"score_spread":0.22993086904223425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123576001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020615398,0.00042845248,0.99255246,0.001863101,0.00015172434,0.00022953548,0.000006737254,0.00015670678,0.0025497514],"genre_scores_gemma":[0.97088003,0.0033015807,0.025326643,0.00031905426,0.000013012752,0.00004194405,0.0000042741644,0.0000122509055,0.00010122607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984544,0.0005182643,0.0003608189,0.0002790419,0.00017090597,0.00021660325],"domain_scores_gemma":[0.99628365,0.0009788402,0.0001360703,0.0022685663,0.00021113903,0.00012174877],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00044615555,0.0001810962,0.00025851128,0.00017973605,0.0024661731,0.00006702748,0.002112247,0.0000860575,0.000024984427],"category_scores_gemma":[0.000022617895,0.00018820445,0.00010353566,0.0005930367,0.0002948934,0.0003928786,0.00019645586,0.00045815008,0.000011000985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039158203,0.0010488675,0.00043433142,0.000024351195,0.00028011788,6.6732116e-7,0.011093498,0.22389969,0.0011065918,0.20594113,0.00027754804,0.555854],"study_design_scores_gemma":[0.00058760983,0.00015611264,0.0008212673,0.00006812145,0.00002767992,0.000006682722,0.00008783886,0.9934404,0.0014493325,0.0003376944,0.0027663026,0.0002509504],"about_ca_topic_score_codex":0.000031305695,"about_ca_topic_score_gemma":0.00036920074,"teacher_disagreement_score":0.9688185,"about_ca_system_score_codex":0.00006119963,"about_ca_system_score_gemma":0.000044274584,"threshold_uncertainty_score":0.99883246},"labels":[],"label_agreement":null},{"id":"W2123815406","doi":"10.1109/twc.2012.030812.111316","title":"Partially-Blind Estimation of Reciprocal Channels for AF Two-Way Relay Networks Employing M-PSK Modulation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Cramér–Rao bound; Channel (broadcasting); Signal-to-noise ratio (imaging); Mathematics; Algorithm; Statistics; Relay; Upper and lower bounds; Computer science; Modulation (music); Telecommunications; Physics","score_opus":0.08645576876648822,"score_gpt":0.33260205573279505,"score_spread":0.24614628696630683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123815406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011057439,0.00051382603,0.985343,0.0011739461,0.00067104195,0.0007962764,0.000011190922,0.00023268904,0.00020058261],"genre_scores_gemma":[0.9193895,0.0008955293,0.07876934,0.00012767229,0.000068717134,0.0005784374,0.000036363217,0.000031231302,0.00010319431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791163,0.0004398982,0.00069335895,0.00029544724,0.00025064702,0.00040903868],"domain_scores_gemma":[0.995596,0.0009243565,0.00031405594,0.00264698,0.00035726515,0.00016133235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008727138,0.00024026578,0.00030670484,0.00027163545,0.0010863645,0.00011062098,0.0016862581,0.000141361,0.000014265272],"category_scores_gemma":[0.000028240383,0.00025925122,0.00018574312,0.00092387735,0.00015729482,0.0010954225,0.000042724678,0.00044199947,0.00001678559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004272864,0.0005281619,0.00003813165,0.000013124191,0.00005847603,4.3447805e-8,0.0016747258,0.6878112,0.0008886285,0.028337298,0.000070140064,0.28053734],"study_design_scores_gemma":[0.0009074099,0.000079731195,0.00020828105,0.000107720334,0.000037607675,0.000003837106,0.000037768998,0.9926013,0.004714254,0.0002277333,0.00081234676,0.000262031],"about_ca_topic_score_codex":0.000018073899,"about_ca_topic_score_gemma":0.00009997306,"teacher_disagreement_score":0.90833205,"about_ca_system_score_codex":0.00012484634,"about_ca_system_score_gemma":0.000067756,"threshold_uncertainty_score":0.999986},"labels":[],"label_agreement":null},{"id":"W2124058479","doi":"10.1109/vetecf.2008.343","title":"A Novel Distributed Space-Time Block Coding Protocol for Cooperative Wireless Relay Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Block code; Space–time code; Coding (social sciences); Cooperative diversity; Wireless; Space–time block code; Spectral efficiency; Diversity gain; Block (permutation group theory); Antenna diversity; Computer network; Space time; Channel (broadcasting); Algorithm; Fading; Topology (electrical circuits); Decoding methods; Telecommunications; Mathematics; Engineering; Electrical engineering","score_opus":0.05684659573112328,"score_gpt":0.3022141831593288,"score_spread":0.24536758742820552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124058479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002556047,0.000007814296,0.9483675,0.0014022974,0.000061171646,0.047969647,0.0000065524855,0.0003410939,0.0015883495],"genre_scores_gemma":[0.41618893,0.00008071829,0.16605996,0.0018516076,0.0004301503,0.4049032,0.000080892336,0.00007850104,0.010326059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984731,0.00010945727,0.00036077178,0.00045616404,0.00018638687,0.00041410138],"domain_scores_gemma":[0.9980932,0.0003892908,0.00013450187,0.0007643264,0.00047272473,0.00014598489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032204433,0.00024046854,0.00029249393,0.00006484701,0.0009005016,0.00016457237,0.0010420906,0.00009591147,0.000053194715],"category_scores_gemma":[0.00008297359,0.00020419544,0.00009900734,0.00071691466,0.00010634355,0.00041250678,0.00049558934,0.0002350383,0.000032309887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003499556,0.0016869145,0.0006118213,0.000068788846,0.00029012334,0.00003114408,0.0035410244,0.084001094,0.033413313,0.62768763,0.23014106,0.01817714],"study_design_scores_gemma":[0.0017253532,0.00013280811,0.00018635868,0.00005962893,0.0000031071222,0.00004504205,0.000010116602,0.9640247,0.0020302215,0.000015299562,0.031455755,0.00031158046],"about_ca_topic_score_codex":0.000003736594,"about_ca_topic_score_gemma":0.000013685053,"teacher_disagreement_score":0.88002366,"about_ca_system_score_codex":0.00009102197,"about_ca_system_score_gemma":0.00014143511,"threshold_uncertainty_score":0.8326848},"labels":[],"label_agreement":null},{"id":"W2124201613","doi":"10.1109/tsp.2011.2177830","title":"A Semi-Closed-Form Solution to Optimal Distributed Beamforming for Two-Way Relay Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Beamforming; Transceiver; Transmitter power output; Computer science; Minification; Relay channel; Transmitter; Power (physics); Optimization problem; Mathematical optimization; Topology (electrical circuits); Control theory (sociology); Mathematics; Telecommunications; Channel (broadcasting); Algorithm; Wireless; Artificial intelligence","score_opus":0.053976609656040515,"score_gpt":0.2837499881424275,"score_spread":0.22977337848638701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124201613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023175688,0.00012005844,0.99596566,0.00027443108,0.00022395744,0.0004438208,0.000008970936,0.00030819702,0.00033733834],"genre_scores_gemma":[0.8899772,0.000021333995,0.10928156,0.00033793427,0.00006783944,0.00017125954,0.0000064942187,0.000021423271,0.000114926115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984425,0.00006119209,0.00038200297,0.00043944494,0.00020832625,0.0004665609],"domain_scores_gemma":[0.9989119,0.00011206381,0.00012286667,0.00039535182,0.00027078125,0.00018699172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044573375,0.00023050678,0.000207836,0.0001777737,0.0011554078,0.00020094459,0.00070271135,0.00009148384,0.000031144296],"category_scores_gemma":[0.0000058645323,0.00022759815,0.00012442196,0.0008282505,0.000048108355,0.000915898,0.00001362291,0.00034507294,0.000015754687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012481834,0.00019779013,0.000002678198,0.00002073824,0.000029635921,0.000001898868,0.003494571,0.29399398,0.0029802083,0.00052185886,0.00014699093,0.69848484],"study_design_scores_gemma":[0.000536548,0.00022947366,0.000018929075,0.00017214222,0.000022988992,0.000013741188,0.00007568473,0.97780186,0.019793749,0.0000955567,0.00092558214,0.0003137681],"about_ca_topic_score_codex":0.0000071245704,"about_ca_topic_score_gemma":0.00003653528,"teacher_disagreement_score":0.88765967,"about_ca_system_score_codex":0.00015982422,"about_ca_system_score_gemma":0.000098838376,"threshold_uncertainty_score":0.9281183},"labels":[],"label_agreement":null},{"id":"W2124298966","doi":"10.1109/glocom.2010.5684225","title":"Transmission Schemes for Two-User Linear Multi-Access Relay Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Time division multiple access; Computer network; Decoding methods; Relay channel; Transmission (telecommunications); Symbol rate; Single antenna interference cancellation; Interference (communication); Telecommunications; Bit error rate; Channel (broadcasting)","score_opus":0.05527827233620437,"score_gpt":0.35459375321448416,"score_spread":0.2993154808782798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124298966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021463518,0.0001592893,0.99385035,0.0019461907,0.0003811184,0.0002639615,2.7543894e-7,0.00023048399,0.001021983],"genre_scores_gemma":[0.42023888,0.00020861068,0.575565,0.0010389315,0.00015677875,0.000054579763,0.0000055533533,0.000013475443,0.0027181946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991751,0.000044334443,0.00019494473,0.0002761659,0.00009054788,0.00021890768],"domain_scores_gemma":[0.998835,0.0001622649,0.000047089972,0.0006838617,0.00016213911,0.00010963187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032907253,0.00011792751,0.00011803904,0.00004812032,0.00029961782,0.00020199358,0.0014350414,0.000070266826,0.000110565044],"category_scores_gemma":[0.00003626712,0.000093805604,0.0000718492,0.0002784949,0.000033928558,0.00053328293,0.0003024604,0.00028515694,0.000012489196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018278275,0.00018252867,0.00073915976,0.0000101677115,0.000022195427,0.0000011574673,0.00033904178,0.0026110504,0.015939685,0.23586495,0.0057193805,0.7385524],"study_design_scores_gemma":[0.0005051566,0.000014526513,0.00018620766,0.000009665018,0.0000019005968,0.0000014162779,0.0000017872286,0.7508249,0.004114133,0.00003774935,0.24418269,0.00011983646],"about_ca_topic_score_codex":0.000003334142,"about_ca_topic_score_gemma":0.0000694157,"teacher_disagreement_score":0.7482139,"about_ca_system_score_codex":0.0000074146797,"about_ca_system_score_gemma":0.000035494137,"threshold_uncertainty_score":0.38252816},"labels":[],"label_agreement":null},{"id":"W2124448858","doi":"10.1109/glocom.2006.957","title":"WSN11-6: Throughput Performance of Cooperative Diversity in Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Throughput; Cooperative diversity; Relay; Wireless ad hoc network; Blocking (statistics); Fading; Mobile ad hoc network; Diversity gain; Protocol (science); Transmission (telecommunications); Optimized Link State Routing Protocol; Interference (communication); Distributed computing; Wireless; Routing protocol; Telecommunications; Network packet; Channel (broadcasting)","score_opus":0.02444884634170552,"score_gpt":0.2521722302363591,"score_spread":0.22772338389465357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124448858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9289232,0.012116119,0.05157076,0.00023591434,0.00024409532,0.0002934149,0.0000027202302,0.0000898149,0.0065239677],"genre_scores_gemma":[0.9926668,0.004421867,0.0024852543,0.00013801495,0.000028107343,0.00001348745,0.0000062886756,0.000003950328,0.00023623958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990362,0.00011672738,0.00024504645,0.00023686982,0.0001432674,0.00022188434],"domain_scores_gemma":[0.9991488,0.00007543256,0.00008946778,0.00053050084,0.00012314592,0.00003263908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024470745,0.00011877968,0.00019422344,0.000062633575,0.0002456301,0.00004186286,0.0009121812,0.000051692452,0.00004184168],"category_scores_gemma":[0.0000070914525,0.00011542516,0.000043667562,0.0006424221,0.00007565253,0.00041132586,0.0012552646,0.0001706623,0.000014951446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094012335,0.00087719725,0.21710931,0.000041537212,0.000046435434,0.000019822932,0.004994016,0.17725697,0.00042698925,0.044938464,0.012917371,0.5412779],"study_design_scores_gemma":[0.0016021234,0.00042993488,0.24716304,0.00015097867,0.000008128632,0.000007994883,0.000108419204,0.69860595,0.001333587,0.00036119978,0.049648974,0.00057966966],"about_ca_topic_score_codex":0.000023887427,"about_ca_topic_score_gemma":0.0005074715,"teacher_disagreement_score":0.54069823,"about_ca_system_score_codex":0.00007572835,"about_ca_system_score_gemma":0.000038647115,"threshold_uncertainty_score":0.47069013},"labels":[],"label_agreement":null},{"id":"W2124529962","doi":"10.1109/icc.2008.231","title":"Row-Monomial Distributed Orthogonal Space-Time Block Codes with Channel Phase Information","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Monomial; Block code; Upper and lower bounds; Computer science; Channel state information; Channel (broadcasting); Hamming code; Bandwidth (computing); Hamming distance; Block (permutation group theory); Mathematics; Algorithm; Discrete mathematics; Combinatorics; Computer network; Telecommunications; Decoding methods; Wireless","score_opus":0.02335305138417724,"score_gpt":0.2446106645584261,"score_spread":0.22125761317424886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124529962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11610267,0.00006465205,0.876519,0.0025993218,0.000058558115,0.00021260238,0.000014570103,0.00031472006,0.0041138777],"genre_scores_gemma":[0.9913397,0.00016620288,0.0076773083,0.00039876264,0.00004046677,0.000016571494,0.00008958532,0.0000037358013,0.00026769485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925154,0.000055044282,0.00019855937,0.00013853452,0.000169149,0.00018714734],"domain_scores_gemma":[0.99914545,0.000055315035,0.00008507147,0.0004328996,0.00018168069,0.00009960712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012453631,0.00012213805,0.00013351355,0.00007254923,0.00035787545,0.000114423,0.00051175244,0.00003417569,0.00006253169],"category_scores_gemma":[0.000020069534,0.00009658075,0.000032649077,0.00039173246,0.000063585794,0.0011561643,0.00021162063,0.000109687746,0.0001718845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012587394,0.0031032593,0.0035448559,0.000057919657,0.00059474196,0.00012644913,0.022781756,0.057812903,0.005979618,0.31621924,0.26145557,0.32706496],"study_design_scores_gemma":[0.0025391092,0.00028184665,0.0017769714,0.000020454545,0.0000058742858,0.00011002793,0.000030380645,0.94441384,0.0023378835,0.000057373258,0.04806333,0.00036291784],"about_ca_topic_score_codex":0.0000037622601,"about_ca_topic_score_gemma":0.000013142599,"teacher_disagreement_score":0.8866009,"about_ca_system_score_codex":0.00003787096,"about_ca_system_score_gemma":0.00011071634,"threshold_uncertainty_score":0.39384487},"labels":[],"label_agreement":null},{"id":"W2124757755","doi":"10.1109/icc.2008.569","title":"Efficient Power Allocation in Cooperative OFDM System with Channel Variation","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Overhead (engineering); Resource allocation; Relay; Channel allocation schemes; Channel (broadcasting); Multiplexing; Resource management (computing); Scheme (mathematics); Wireless; Distributed computing; Power (physics); Computer network; Telecommunications; Mathematics","score_opus":0.026350719799629073,"score_gpt":0.23644599520071297,"score_spread":0.2100952754010839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124757755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056660645,0.00008581085,0.9311263,0.0007562313,0.00008679071,0.0002608974,2.2551814e-7,0.00015191732,0.010871214],"genre_scores_gemma":[0.9951611,0.000029416298,0.004275152,0.00020550762,0.000011765406,0.000040069135,0.0000022350182,0.000005211617,0.0002695381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990746,0.00015240804,0.00019163455,0.00024732665,0.00018375342,0.00015029365],"domain_scores_gemma":[0.99916565,0.00005855892,0.000058418726,0.00043814525,0.00023448726,0.000044736214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025921885,0.00010199686,0.00011381338,0.00011688788,0.00020394384,0.000047840418,0.00038301107,0.000032043736,0.000013314771],"category_scores_gemma":[0.000016014177,0.000078688936,0.000014801007,0.00075263594,0.000029641758,0.00016168604,0.00011543054,0.000097470205,0.000047203215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030537845,0.00031820362,0.00053872756,0.000011787546,0.000024449482,0.000024808796,0.024644287,0.24147512,0.0014577168,0.7297121,0.00037609987,0.00138613],"study_design_scores_gemma":[0.00047373452,0.0000834445,0.017653296,0.000049543156,9.383308e-7,0.000031435306,0.00016981288,0.9808727,0.00037201928,0.0000049306664,0.00014395194,0.00014423001],"about_ca_topic_score_codex":0.0000225859,"about_ca_topic_score_gemma":0.00007942712,"teacher_disagreement_score":0.93850046,"about_ca_system_score_codex":0.00013584734,"about_ca_system_score_gemma":0.00009147997,"threshold_uncertainty_score":0.32088417},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015362404773240764,"score_gpt":0.25363475973223976,"score_spread":0.23827235495899898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124990550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025186902,0.00007244681,0.935551,0.0018311179,0.00049473846,0.00023619425,0.0000012072518,0.00022977182,0.03639665],"genre_scores_gemma":[0.90639776,0.00008198361,0.08960898,0.0018014456,0.00037386586,0.000027225207,0.000008533681,0.000011049711,0.0016891634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988861,0.000093160284,0.00018589626,0.00031023385,0.00023026475,0.0002943609],"domain_scores_gemma":[0.99866563,0.00029162827,0.000052247717,0.0006716557,0.00021463024,0.00010419389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056437566,0.0001449129,0.00015719248,0.000048269078,0.00064936315,0.00031768144,0.0007043417,0.00004874966,0.00034149803],"category_scores_gemma":[0.000050563904,0.00010608754,0.000036922058,0.00035335834,0.000042210922,0.00038154816,0.0002567372,0.0003423166,0.000054705146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007542142,0.00020596274,0.0057641845,0.000005183739,0.000051457915,0.0000070935494,0.0011864911,0.006375612,0.0018271192,0.93832344,0.01580522,0.030372798],"study_design_scores_gemma":[0.004436531,0.00018586691,0.008599099,0.0000964374,0.000010351329,0.000022136805,0.00007347257,0.8579079,0.0019176058,0.0006039397,0.12553813,0.0006085468],"about_ca_topic_score_codex":0.000001822482,"about_ca_topic_score_gemma":0.00042227277,"teacher_disagreement_score":0.9377195,"about_ca_system_score_codex":0.000014405403,"about_ca_system_score_gemma":0.00006618988,"threshold_uncertainty_score":0.49944422},"labels":[],"label_agreement":null},{"id":"W2125358412","doi":"10.1109/isit.2006.261640","title":"Parity Forwarding For Multiple-Relay Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Computer network; Relay channel; Topology (electrical circuits); Network topology; Decoding methods; Telecommunications; Mathematics","score_opus":0.030057149305380945,"score_gpt":0.2685396120433114,"score_spread":0.23848246273793045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125358412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097499776,0.00029759586,0.9881547,0.0009833059,0.00020191511,0.0002065131,3.9932823e-7,0.00022271174,0.008957827],"genre_scores_gemma":[0.8987702,0.000058342986,0.09948792,0.00038575186,0.0001316147,0.000043867785,0.0000062072027,0.000005576399,0.0011104906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927336,0.000044859284,0.00017704777,0.0002081849,0.00007361079,0.00022295056],"domain_scores_gemma":[0.9989931,0.0003471696,0.000044094657,0.00047823158,0.00009846858,0.00003896435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030189686,0.0000872502,0.00010469709,0.00003566086,0.0003007151,0.00014726877,0.00062364567,0.000041641837,0.000012537972],"category_scores_gemma":[0.000038489896,0.000077033554,0.000074823816,0.000223579,0.000019067742,0.00024977195,0.000249412,0.00008486401,0.000008812891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004671461,0.00005548961,0.004327689,0.0000033270155,0.000010417216,5.0410057e-7,0.00005031676,0.016149305,0.00022136235,0.86418086,0.027356923,0.087639146],"study_design_scores_gemma":[0.0003207319,0.000015473775,0.002270106,0.0000064773917,0.0000019183258,0.0000012430157,0.0000031193804,0.9517713,0.00028221676,0.001039112,0.044170752,0.00011751634],"about_ca_topic_score_codex":0.000015269512,"about_ca_topic_score_gemma":0.00018953896,"teacher_disagreement_score":0.93562204,"about_ca_system_score_codex":0.000027504797,"about_ca_system_score_gemma":0.000015015794,"threshold_uncertainty_score":0.3141337},"labels":[],"label_agreement":null},{"id":"W2125790276","doi":"10.1109/tvt.2014.2310708","title":"Energy-Aware Cooperation Strategy With Uncoordinated Group Relays for Delay-Sensitive Services","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Computer network; Quality of service; Scalability; Fading; Network packet; Energy consumption; Transmission (telecommunications); Transmission delay; Wireless; Provisioning; Timer; Broadcasting (networking); Channel (broadcasting); Telecommunications; Engineering","score_opus":0.011223334643334812,"score_gpt":0.22755119593570367,"score_spread":0.21632786129236886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125790276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011085272,0.00006658089,0.9858025,0.00175323,0.00013480587,0.00035055593,0.000005743835,0.0006402114,0.00016113733],"genre_scores_gemma":[0.98940456,0.00012607107,0.009487055,0.00048855704,0.000017824495,0.00031466637,0.000016785894,0.00002258236,0.000121878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872714,0.0001358398,0.00023456637,0.00048439624,0.00013298985,0.0002850604],"domain_scores_gemma":[0.99852943,0.0001157163,0.00009334502,0.0007919981,0.0004092106,0.00006027322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018501528,0.00022395053,0.0002316386,0.00034241987,0.0005607654,0.00009674379,0.00063018576,0.00024078097,0.000006301599],"category_scores_gemma":[0.0000020714747,0.00019753577,0.00006469515,0.0010204542,0.000104105355,0.00031063333,0.000008622732,0.00030185527,0.000012906577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010958607,0.00037785585,0.000011257264,0.000032513297,0.00019895128,0.000015519092,0.00023158446,0.06301902,0.018267518,0.2191831,0.00009258384,0.6984605],"study_design_scores_gemma":[0.0010498073,0.0010906939,0.000011129192,0.00007985861,0.000033042998,0.000065316606,0.00008454591,0.9262033,0.06236936,0.0009413173,0.007729967,0.00034162667],"about_ca_topic_score_codex":0.000016439044,"about_ca_topic_score_gemma":0.00076285185,"teacher_disagreement_score":0.9783193,"about_ca_system_score_codex":0.00006961654,"about_ca_system_score_gemma":0.0000407228,"threshold_uncertainty_score":0.8055275},"labels":[],"label_agreement":null},{"id":"W2125814139","doi":"10.1109/iscas.2007.378132","title":"Optimized multi-path routing using dual decomposition for wireless video streaming","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Distributed computing; Wireless ad hoc network; Link-state routing protocol; Dual (grammatical number); Static routing; Routing (electronic design automation); Optimized Link State Routing Protocol; Multipath routing; Wireless; Routing protocol; Telecommunications","score_opus":0.06594953466236829,"score_gpt":0.3503642768357175,"score_spread":0.2844147421733492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125814139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06404178,0.000069162685,0.9346658,0.00013965376,0.00016878724,0.00023958548,6.211611e-7,0.00018054,0.00049407664],"genre_scores_gemma":[0.5307907,0.000013547273,0.468945,0.00014564343,0.000040919615,0.000004179748,0.0000034810448,0.0000061140045,0.000050406466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989415,0.00006460393,0.00030241808,0.00027344134,0.00011566819,0.00030239415],"domain_scores_gemma":[0.99890155,0.00035889237,0.000105555184,0.00038744032,0.00016821812,0.00007835821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008979883,0.00012236177,0.00014760625,0.00008928255,0.0004771903,0.00017867607,0.0004067718,0.000047068042,0.000008623655],"category_scores_gemma":[0.00004160378,0.00011829553,0.00006811549,0.0002800711,0.000021407877,0.00042938182,0.00028134332,0.00009665371,0.000003259821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000885856,0.00037364254,0.0007989735,0.000021403835,0.00007584681,0.000014755285,0.00380044,0.017187703,0.18479523,0.1643323,0.0001893951,0.6283217],"study_design_scores_gemma":[0.00090545515,0.000023326562,0.0005259802,0.00004726878,0.0000050296308,0.000010253476,0.00009710763,0.9873154,0.010745811,0.000039123013,0.0001190881,0.0001661352],"about_ca_topic_score_codex":0.000013376183,"about_ca_topic_score_gemma":0.000037288657,"teacher_disagreement_score":0.9701277,"about_ca_system_score_codex":0.000095361895,"about_ca_system_score_gemma":0.000037916016,"threshold_uncertainty_score":0.4823952},"labels":[],"label_agreement":null},{"id":"W2125955963","doi":"10.1109/tvt.2007.912601","title":"On the Design of Large-Scale UMTS Mobile Networks Using Hybrid Genetic Algorithms","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"UMTS frequency bands; Roaming; Computer science; Cellular network; Computer network; Node (physics); Mobile telephony; Heuristic; Algorithm; Mobile computing; Distributed computing; Mobile radio; Engineering; Artificial intelligence","score_opus":0.03334866353553348,"score_gpt":0.2599238704159909,"score_spread":0.22657520688045743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125955963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072858706,0.0004979259,0.925404,0.00042843068,0.00019648265,0.0003784865,0.0000026353414,0.00021242292,0.000020914518],"genre_scores_gemma":[0.9627816,0.0010244633,0.03577306,0.00025838395,0.000012745071,0.00009795041,4.4056307e-7,0.000015222321,0.000036122856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987074,0.00022346029,0.00027000776,0.00032298308,0.00018351949,0.00029262106],"domain_scores_gemma":[0.99833786,0.00020755889,0.00009571832,0.0011931221,0.00012586455,0.00003988556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002362707,0.00016896619,0.00020825634,0.0002611139,0.00062776776,0.00001781628,0.0010520716,0.0001325771,0.00003197538],"category_scores_gemma":[0.0000065100376,0.00013564709,0.0000972614,0.0009568851,0.00022109729,0.000077547666,0.000016517512,0.00049747364,0.000017807106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008244612,0.00026736228,0.000006386548,0.0000019377264,0.00004219884,0.000020719308,0.00015261902,0.95884967,0.0037537946,0.0013632647,0.0001240874,0.035409693],"study_design_scores_gemma":[0.00024589282,0.00022278841,0.000016900514,0.000030405263,0.000011263104,0.00012317239,0.00002356061,0.94787765,0.050560664,0.00030750918,0.0004394509,0.00014076916],"about_ca_topic_score_codex":0.0000024506962,"about_ca_topic_score_gemma":0.000004058867,"teacher_disagreement_score":0.8899229,"about_ca_system_score_codex":0.000054667722,"about_ca_system_score_gemma":0.000054998676,"threshold_uncertainty_score":0.55315274},"labels":[],"label_agreement":null},{"id":"W2126117638","doi":"10.1109/wcnc.2005.1424643","title":"On the distributed space-time signal design for a large number of relay terminals","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Euclidean distance; Pairwise error probability; Computer science; Metric (unit); Topology (electrical circuits); Code (set theory); Channel (broadcasting); Euclidean space; Algorithm; Scaling; Mathematics; Fading; Telecommunications; Engineering; Power (physics); Set (abstract data type); Mathematical analysis; Combinatorics","score_opus":0.046069311789924176,"score_gpt":0.30292643259006974,"score_spread":0.25685712080014556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126117638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029646836,0.000035821013,0.98436,0.008951562,0.000016461212,0.00027074505,0.0000064881074,0.00005195095,0.0033422906],"genre_scores_gemma":[0.92896587,0.000023244605,0.06741816,0.0009141963,0.000030862964,0.000041272553,0.0000042059783,0.000005138335,0.0025970717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925923,0.00016570745,0.0001607064,0.00013984664,0.00011247821,0.00016202913],"domain_scores_gemma":[0.99819994,0.0010862236,0.000067572546,0.00050265633,0.000109431916,0.00003418219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000658406,0.000079467165,0.00010716162,0.000019113682,0.00016780736,0.000051927418,0.0007042178,0.00002741573,0.00058870466],"category_scores_gemma":[0.000085285945,0.000049893453,0.000058953658,0.00021385566,0.000020834574,0.000122389,0.00016003316,0.00007335536,0.00013244979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023502207,0.0001658557,0.000044149012,0.000002365377,0.00002072892,3.882145e-7,0.0003852687,0.00084170466,0.0019546086,0.8975615,0.085371464,0.013628453],"study_design_scores_gemma":[0.00045711073,0.00009803228,0.00017436051,0.000034527464,0.0000056482627,0.0000043184523,0.000012937874,0.9272937,0.01828489,0.0021416147,0.05134809,0.00014473335],"about_ca_topic_score_codex":4.2603006e-7,"about_ca_topic_score_gemma":0.0000024599403,"teacher_disagreement_score":0.92645204,"about_ca_system_score_codex":0.000022195387,"about_ca_system_score_gemma":0.000032816955,"threshold_uncertainty_score":0.64459026},"labels":[],"label_agreement":null},{"id":"W2126158911","doi":"10.1109/icc.2011.5962700","title":"Maximum-Likelihood Detectors for Full-Rate Cooperative Communication Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Detector; Computer science; Single antenna interference cancellation; Interference (communication); Relay; Transmission (telecommunications); Viterbi algorithm; Bit error rate; Monte Carlo method; Key (lock); Communications system; Algorithm; Electronic engineering; Exploit; Real-time computing; Decoding methods; Telecommunications; Channel (broadcasting); Mathematics; Statistics; Engineering; Physics","score_opus":0.06704240813205142,"score_gpt":0.27049563053451386,"score_spread":0.20345322240246244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126158911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052847285,0.0010131384,0.9748865,0.0004061245,0.0002839018,0.00067241734,0.000002604766,0.00032309265,0.017127497],"genre_scores_gemma":[0.9337231,0.0005321299,0.064626336,0.00034607737,0.000026658645,0.00024931965,0.000009209101,0.000013885107,0.00047330966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998686,0.000348472,0.0003125236,0.00028635754,0.00009896982,0.00026763204],"domain_scores_gemma":[0.9977591,0.00024656058,0.00011439484,0.0013254151,0.00045322048,0.00010131128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007257564,0.0001597739,0.00018364546,0.000089138965,0.00044752363,0.00020123487,0.0015887414,0.000060885264,0.00006139945],"category_scores_gemma":[0.00006890518,0.00013692233,0.00006178009,0.00039752957,0.00005622678,0.00053013774,0.0004241185,0.00013236402,0.00007866381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041275005,0.00017304455,0.00015138037,0.000017185164,0.00007912962,0.0000010344688,0.0056957584,0.000115886345,0.003975135,0.9183901,0.004721847,0.06663825],"study_design_scores_gemma":[0.00217048,0.00087421265,0.0019225067,0.00016482307,0.000033511944,0.000026540314,0.0010288417,0.91097176,0.016775988,0.011998504,0.05281882,0.0012139885],"about_ca_topic_score_codex":0.000030642655,"about_ca_topic_score_gemma":0.00017223172,"teacher_disagreement_score":0.92843837,"about_ca_system_score_codex":0.000052915595,"about_ca_system_score_gemma":0.00006572712,"threshold_uncertainty_score":0.55835307},"labels":[],"label_agreement":null},{"id":"W2126192696","doi":"10.1109/vetecs.2008.401","title":"Performance Evaluation of Joint FEC and ARQ Optimization Heuristic Algorithms under Gilbert-Elliot Wireless Channel","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Automatic repeat request; Algorithm; Selective Repeat ARQ; Forward error correction; Hybrid automatic repeat request; Heuristic; Error detection and correction; Channel (broadcasting); Wireless; Network packet; Transmission (telecommunications); Real-time computing; Decoding methods; Computer network; Telecommunications; Artificial intelligence","score_opus":0.11299307345127177,"score_gpt":0.28781169876396234,"score_spread":0.17481862531269057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126192696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12534481,0.00040911778,0.8699898,0.0004793477,0.00010185538,0.00020244427,2.8811968e-7,0.00005051278,0.0034218025],"genre_scores_gemma":[0.97673404,0.0029779158,0.019842893,0.00012545116,0.000022070308,0.000014175996,0.000004572326,0.000005580707,0.00027329655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989708,0.00015174584,0.00023026732,0.00020628878,0.00032046522,0.00012042058],"domain_scores_gemma":[0.99898726,0.000059496586,0.00009633849,0.00038522252,0.00042225976,0.000049413607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005665966,0.000096072225,0.00013260913,0.000095465286,0.00022031821,0.000030696927,0.00025524612,0.00003503681,0.000040222305],"category_scores_gemma":[0.000028563702,0.000086296604,0.000021721782,0.00035645638,0.00007177145,0.00032761114,0.00018415976,0.0000745639,0.0000051533552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008784308,0.0001894023,0.0005532317,0.000029784936,0.000037618862,9.625137e-7,0.0027308718,0.7522657,0.0007742868,0.014475349,0.00047075012,0.22846328],"study_design_scores_gemma":[0.00034460516,0.000046630972,0.0072503425,0.000028377133,0.0000067919414,0.000014344069,0.000019369681,0.9906824,0.0013951157,0.00007891423,0.000026953627,0.00010614893],"about_ca_topic_score_codex":0.000006738933,"about_ca_topic_score_gemma":0.0000071336626,"teacher_disagreement_score":0.8513892,"about_ca_system_score_codex":0.000042303527,"about_ca_system_score_gemma":0.000076008175,"threshold_uncertainty_score":0.35190734},"labels":[],"label_agreement":null},{"id":"W2126199484","doi":"10.1109/glocom.2004.1378978","title":"On the aggregate SNR of amplified relaying channels","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Aggregate (composite); Computer science; Channel (broadcasting); Computer network; Materials science; Nanotechnology","score_opus":0.059385445316355284,"score_gpt":0.2798799410454983,"score_spread":0.220494495729143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126199484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07714134,0.0005860787,0.7286958,0.04998308,0.00027063396,0.0002753885,3.2693416e-7,0.00020761492,0.14283973],"genre_scores_gemma":[0.9913446,0.00017118262,0.0046202047,0.0022766914,0.000029763143,0.0000062570934,2.1221791e-7,0.000002685117,0.001548413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947625,0.00008058979,0.00012787925,0.00011037762,0.000105267216,0.00009960244],"domain_scores_gemma":[0.9989514,0.00028214612,0.0000538799,0.0006341709,0.000054637112,0.000023775978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030494083,0.0000549315,0.00006481598,0.000033464425,0.00013949198,0.00005077121,0.00081416324,0.000015961987,0.00011844991],"category_scores_gemma":[0.000052929132,0.00003360297,0.000031673302,0.00023911199,0.000026419768,0.00012169188,0.00023353241,0.00009280263,0.000089526045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013336041,0.000017232218,0.000007410258,5.546933e-7,0.0000041923986,1.2407267e-7,0.00050980353,0.0005056242,0.00069692783,0.9185852,0.0027402637,0.076931365],"study_design_scores_gemma":[0.00059511594,0.00014588816,0.00063925184,0.00016279658,0.000004616106,0.0000068858603,0.000101538244,0.8056213,0.067554206,0.013255953,0.11153013,0.0003823063],"about_ca_topic_score_codex":0.0000015764602,"about_ca_topic_score_gemma":0.000006727435,"teacher_disagreement_score":0.9142032,"about_ca_system_score_codex":0.000012790443,"about_ca_system_score_gemma":0.000012940523,"threshold_uncertainty_score":0.15129314},"labels":[],"label_agreement":null},{"id":"W2126219130","doi":"10.1109/tvt.2010.2048768","title":"Modeling and Performance Analysis of Multihop Cooperative Wireless Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Retransmission; Computer science; Fading; Computer network; Spectral efficiency; Nakagami distribution; Robustness (evolution); Latency (audio); Network packet; Wireless; Physical layer; Spread spectrum; Throughput; Wireless network; Channel (broadcasting); Telecommunications","score_opus":0.014788016818257341,"score_gpt":0.24764246050365918,"score_spread":0.23285444368540184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126219130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46222314,0.00006250607,0.5372298,0.00022988321,0.00007596981,0.00006524773,8.730797e-7,0.00009515776,0.000017441978],"genre_scores_gemma":[0.99233365,0.00088242133,0.0066572274,0.00006191328,0.000005282731,0.000033744698,0.0000011610431,0.0000070481024,0.000017576624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991377,0.000047470006,0.00023915796,0.00029961954,0.00010207054,0.00017395297],"domain_scores_gemma":[0.99889886,0.000054877648,0.000053621417,0.0007391213,0.00020991609,0.000043579435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017777747,0.00013259637,0.000265701,0.0006747978,0.0002773148,0.00003039405,0.00055287656,0.00019080855,0.000012157543],"category_scores_gemma":[0.0000049052474,0.0001254204,0.00007267703,0.0021583107,0.00013842812,0.00017595128,0.000013812463,0.0006220178,0.0000021743238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007066498,0.00008227721,0.00012836834,0.0000029990288,0.00023284927,0.0000011727625,0.0001664042,0.79753995,0.011735667,0.005637165,8.47592e-7,0.18446526],"study_design_scores_gemma":[0.00018853322,0.000073999785,0.000104776955,0.00001232507,0.000080477956,0.000005846706,0.000021716294,0.9830965,0.016239693,0.000016579723,0.00003486767,0.00012471198],"about_ca_topic_score_codex":0.0000062318,"about_ca_topic_score_gemma":0.00028806503,"teacher_disagreement_score":0.53057253,"about_ca_system_score_codex":0.0000138060095,"about_ca_system_score_gemma":0.000024306893,"threshold_uncertainty_score":0.5114495},"labels":[],"label_agreement":null},{"id":"W2126252670","doi":"10.1110/tcomm.2010.062510.080615","title":"SER Analysis and PDF Derivation for Multi-Hop Amplify-and-Forward Relay Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Moment-generating function; Relay; Hop (telecommunications); Random variable; Cumulative distribution function; Probability density function; Erlang (programming language); Expression (computer science); Mathematics; Topology (electrical circuits); Probability of error; Bit error rate; Computer science; Algorithm; Telecommunications; Statistics; Combinatorics; Physics; Decoding methods; Theoretical computer science; Quantum mechanics","score_opus":0.06593631995843402,"score_gpt":0.3211921444500576,"score_spread":0.2552558244916236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126252670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034454563,0.00028109323,0.99247146,0.0026556249,0.00022984645,0.00044866948,0.000018881823,0.00015140623,0.0002975728],"genre_scores_gemma":[0.864588,0.0020979831,0.13202117,0.00018109585,0.000012135673,0.00035164235,0.000017356953,0.000011415661,0.0007191645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988896,0.00018680179,0.0003311243,0.0003017719,0.00011540226,0.00017529727],"domain_scores_gemma":[0.996433,0.000804383,0.00011466002,0.0022772301,0.00025190553,0.00011882324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045750084,0.00015539184,0.00021408134,0.00034060905,0.001228697,0.00028476113,0.0010582848,0.00011318271,0.000022122462],"category_scores_gemma":[0.000029126519,0.00015756938,0.00009450444,0.000789473,0.00015578543,0.00040512465,0.000032584638,0.00047997732,0.000026620039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008515131,0.0023605113,0.0016128467,0.000137436,0.002913998,9.96563e-7,0.011034591,0.038851116,0.04581479,0.36615545,0.0011890444,0.5298441],"study_design_scores_gemma":[0.00050017383,0.000043252727,0.0019405044,0.000016737114,0.00014462508,0.000007139646,0.00009168668,0.9740248,0.00073260133,0.00010842378,0.022150151,0.00023990546],"about_ca_topic_score_codex":0.000045070577,"about_ca_topic_score_gemma":0.0015457117,"teacher_disagreement_score":0.9351737,"about_ca_system_score_codex":0.000028867084,"about_ca_system_score_gemma":0.000039756254,"threshold_uncertainty_score":0.9450268},"labels":[],"label_agreement":null},{"id":"W2126261023","doi":"10.1109/wcsp.2013.6677075","title":"Distributed beamforming and power allocation in two-way multi-relay networks with second-order channel statistics","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Beamforming; Relay; Channel state information; Transceiver; Computer science; Channel (broadcasting); Signal-to-noise ratio (imaging); Relay channel; Power (physics); Taylor series; Mathematical optimization; Topology (electrical circuits); Telecommunications; Mathematics; Wireless","score_opus":0.018455295181582447,"score_gpt":0.25912847179569465,"score_spread":0.2406731766141122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126261023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013192934,0.00019285701,0.98521334,0.0005549133,0.000060880615,0.00027917957,0.0000025683341,0.000069388465,0.00043395607],"genre_scores_gemma":[0.83820707,0.00011594708,0.1607537,0.00044250756,0.00000970796,0.00004476395,0.000029716648,0.000007831655,0.0003887708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999114,0.00007344545,0.00022246977,0.00024950202,0.00009804659,0.00024256756],"domain_scores_gemma":[0.9991118,0.00012869283,0.000069424306,0.00038312157,0.000221045,0.00008592547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001957095,0.00013411253,0.0001356225,0.000068898014,0.00014273179,0.00020059312,0.00033679992,0.000033886383,0.00012658669],"category_scores_gemma":[0.000025913998,0.000106956955,0.0000085638785,0.00045405782,0.000048746966,0.0005652772,0.0002477156,0.00018326036,0.000014614348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048014765,0.0009759617,0.02343553,0.000057360277,0.00018872172,0.000024602668,0.013394607,0.27642733,0.0014154861,0.3142598,0.012964843,0.35680777],"study_design_scores_gemma":[0.00067416084,0.000039535436,0.019474303,0.000027246955,0.0000016094716,0.0000056330186,0.00008919984,0.978776,0.00004737008,0.00008543994,0.00060194376,0.00017758191],"about_ca_topic_score_codex":0.000063359024,"about_ca_topic_score_gemma":0.0018594459,"teacher_disagreement_score":0.8250141,"about_ca_system_score_codex":0.0000387811,"about_ca_system_score_gemma":0.000029012926,"threshold_uncertainty_score":0.43615782},"labels":[],"label_agreement":null},{"id":"W2126269115","doi":"10.1109/tvt.2008.2010217","title":"Performance of Optimum Switching Adaptive $M$-QAM for Amplify-and-Forward Relays","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Quadrature amplitude modulation; Upper and lower bounds; Algorithm; Computer science; QAM; Rayleigh fading; Relay; Bit error rate; Mathematics; Fading; Physics; Power (physics); Mathematical analysis","score_opus":0.030771367420799407,"score_gpt":0.250483196710073,"score_spread":0.2197118292892736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126269115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22132158,0.00019132116,0.7770066,0.0008204761,0.00010332296,0.00028392533,0.0000023276843,0.00019350185,0.00007693234],"genre_scores_gemma":[0.94641703,0.0014505353,0.051811006,0.00008546459,0.000007218913,0.0001520641,5.705428e-7,0.000010955204,0.000065126405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909943,0.000037294216,0.00024820748,0.00029441557,0.00011062092,0.00021004851],"domain_scores_gemma":[0.99899226,0.00010959624,0.00009012086,0.0006256126,0.00014066852,0.000041730138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015927135,0.00013936026,0.00022080538,0.00033298516,0.00047266262,0.000010560212,0.00057871523,0.00016957185,0.0000040170335],"category_scores_gemma":[0.000007921457,0.0001361729,0.0000733376,0.00054133224,0.00014653924,0.00020212079,0.000013321855,0.00036292354,0.000007091297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020354989,0.0006343708,0.00037946613,0.00007692334,0.0003284832,0.00001582942,0.0022536907,0.068823636,0.055553555,0.08455082,0.00018718671,0.7869925],"study_design_scores_gemma":[0.00094104983,0.0009884909,0.00023581911,0.00008618621,0.000025834539,0.00015431075,0.00005635444,0.87268907,0.121033855,0.00040718867,0.0030649768,0.0003168673],"about_ca_topic_score_codex":0.0000019678182,"about_ca_topic_score_gemma":0.0000080007085,"teacher_disagreement_score":0.80386543,"about_ca_system_score_codex":0.000037337686,"about_ca_system_score_gemma":0.00004585285,"threshold_uncertainty_score":0.55529696},"labels":[],"label_agreement":null},{"id":"W2126317372","doi":"10.1109/bsc.2006.1644622","title":"Transmission Over Channels with Known Two-Level Interference at the Transmitter","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transmitter; Precoding; Channel (broadcasting); Interference (communication); Transmission (telecommunications); Additive white Gaussian noise; Computer science; Channel capacity; Topology (electrical circuits); Adjacent-channel interference; Information transmission; Zero-forcing precoding; Telecommunications; Computer network; Mathematics; Combinatorics; MIMO","score_opus":0.03782699933035655,"score_gpt":0.26398295808612476,"score_spread":0.22615595875576822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126317372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013291242,0.00039162123,0.9543802,0.007088848,0.00007320686,0.00014971993,5.7090045e-7,0.00010309864,0.024521453],"genre_scores_gemma":[0.9744196,0.00008976536,0.008312634,0.0012803576,0.000051600877,0.000019152007,0.0000026008158,0.0000072643547,0.015817022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913496,0.00010198362,0.00015459169,0.00024926476,0.00016231491,0.00019690047],"domain_scores_gemma":[0.99916893,0.00009536636,0.00003285482,0.00059716566,0.00006224919,0.000043449152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001653712,0.0001303426,0.00009777093,0.000035651567,0.00029726903,0.0001479202,0.00089986366,0.00002420294,0.00052423193],"category_scores_gemma":[0.0000012212104,0.00006773234,0.000043319906,0.00029473923,0.000069517046,0.00025277014,0.00015658425,0.0001334697,0.00005292631],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084892374,0.0002509045,0.0011725952,0.000014819436,0.000042562267,0.000011589428,0.0047642007,0.0022266782,0.018528506,0.20064414,0.029368138,0.74289095],"study_design_scores_gemma":[0.003322629,0.0003567178,0.019850034,0.00028278143,0.000024072491,0.000085901505,0.000049401573,0.4931285,0.059090607,0.0030113119,0.41968,0.0011180172],"about_ca_topic_score_codex":0.00003827619,"about_ca_topic_score_gemma":0.000407823,"teacher_disagreement_score":0.96112835,"about_ca_system_score_codex":0.000030326257,"about_ca_system_score_gemma":0.000025009302,"threshold_uncertainty_score":0.5739972},"labels":[],"label_agreement":null},{"id":"W2126318303","doi":"10.1109/twc.2013.051613.121171","title":"Relay Selection for OFDM Wireless Systems under Asymmetric Information: A Contract-Theory Based Approach","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Wireless; Computer science; Orthogonal frequency-division multiplexing; Selection (genetic algorithm); Contract theory; Computer network; Information asymmetry; Telecommunications; Business; Artificial intelligence; Finance; Economics; Microeconomics","score_opus":0.03839588408406567,"score_gpt":0.26660151889517175,"score_spread":0.2282056348111061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126318303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012377693,0.0002645354,0.99119985,0.0024176873,0.0003776717,0.0018157611,0.000024930989,0.0005511491,0.0021106172],"genre_scores_gemma":[0.9577157,0.00053747254,0.03702399,0.0009488249,0.000026750082,0.0032364975,0.000054733522,0.00003000587,0.00042601168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733657,0.00079091697,0.0007547521,0.00035555818,0.00034716172,0.00041501824],"domain_scores_gemma":[0.99390554,0.0017696953,0.0003237721,0.0028389408,0.0009737228,0.00018831382],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008212696,0.00032023125,0.0003574954,0.0006899732,0.0017055525,0.0007123535,0.0026495343,0.00020832769,0.00003055852],"category_scores_gemma":[0.00002343746,0.00032569777,0.0002095853,0.0020301465,0.0001760785,0.0020552464,0.00002839664,0.00067227817,0.00016773002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004031839,0.0011741981,0.000020016565,0.00007561938,0.00019900162,6.494273e-8,0.0009131355,0.22412275,0.0008207331,0.481527,0.00121333,0.28989384],"study_design_scores_gemma":[0.0009993598,0.00012063726,0.00014332237,0.00006607386,0.000037695427,0.000010093929,0.00017967919,0.9919828,0.0008735168,0.00022498476,0.0049768602,0.0003849385],"about_ca_topic_score_codex":0.00009379293,"about_ca_topic_score_gemma":0.000053802156,"teacher_disagreement_score":0.95647794,"about_ca_system_score_codex":0.00029692572,"about_ca_system_score_gemma":0.00024894593,"threshold_uncertainty_score":0.99991953},"labels":[],"label_agreement":null},{"id":"W2126417905","doi":"10.1109/ccece.2008.4564590","title":"Throughput enhancement in cooperative diversity wireless networks using adaptive modulation","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Throughput; Diversity gain; Computer science; Cooperative diversity; Rayleigh fading; Link adaptation; Fading; Signal-to-noise ratio (imaging); Modulation (music); Diversity combining; Diversity scheme; Computer network; Antenna diversity; Transmission (telecommunications); Electronic engineering; Wireless; Telecommunications; Channel (broadcasting); Engineering; Physics","score_opus":0.051113480108264005,"score_gpt":0.22446167560870703,"score_spread":0.17334819550044303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126417905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24368688,0.00010879179,0.75491923,0.0003033184,0.00011221691,0.00026596346,9.273923e-7,0.000080252685,0.00052240264],"genre_scores_gemma":[0.9947024,0.00061585306,0.0042282287,0.0003181363,0.00007261973,0.000021153584,0.0000029568125,0.000011255748,0.000027421756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982504,0.000031533265,0.00028587086,0.0005976231,0.0002260823,0.00060844637],"domain_scores_gemma":[0.9989338,0.000054606673,0.000077039804,0.00018557877,0.0003820143,0.00036693987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015949008,0.0003082524,0.0003333581,0.00036492356,0.00055563665,0.00022298945,0.0006739011,0.0001263617,0.000014507792],"category_scores_gemma":[0.000016262746,0.0003254417,0.00003736558,0.0008796166,0.000068771944,0.0006153311,0.00041491608,0.0005159295,0.0000033940573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004098501,0.00015141486,0.010250957,0.000024110046,0.0000766312,0.00007904549,0.006711083,0.03852698,0.0010133428,0.8212857,0.00021775939,0.121621944],"study_design_scores_gemma":[0.00032003984,0.000189377,0.0105554415,0.000122409,0.0000033229408,0.000025378418,0.000017116372,0.9880153,0.00012778441,0.00018136113,0.00006149552,0.00038096012],"about_ca_topic_score_codex":0.0012261014,"about_ca_topic_score_gemma":0.0011292248,"teacher_disagreement_score":0.94948834,"about_ca_system_score_codex":0.0003856964,"about_ca_system_score_gemma":0.00033302858,"threshold_uncertainty_score":0.9999198},"labels":[],"label_agreement":null},{"id":"W2126427712","doi":"10.1109/pimrc.2006.254227","title":"An Agent System to Manage Mobile Connections in a Distributed Base Station Scheme","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Base station; Scalability; Distributed computing; Computer network; Protocol (science); Resource allocation; Simple (philosophy); Scheme (mathematics); Node (physics); Mobile agent; Macro; Resource management (computing); Engineering; Database","score_opus":0.02462539309067619,"score_gpt":0.2812417462211027,"score_spread":0.2566163531304265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126427712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1310185,0.000035778823,0.86584526,0.0004853198,0.00006636438,0.00028156934,0.00000577699,0.0002244577,0.0020369487],"genre_scores_gemma":[0.97589236,0.0000064267488,0.02359878,0.00014145818,0.000017166683,0.000119736236,0.00004639747,0.000003449593,0.00017423824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992731,0.00011819951,0.00018142341,0.00020452094,0.00009122694,0.00013150624],"domain_scores_gemma":[0.9992818,0.00004154676,0.000028105473,0.0005117233,0.00007731778,0.00005950384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021196,0.00006708699,0.00007514613,0.00011350157,0.00012553885,0.00013552373,0.00037179163,0.000018269147,0.000024982313],"category_scores_gemma":[0.000007861353,0.00006552202,0.00001675883,0.0007521623,0.000007260247,0.00028262747,0.00011392743,0.000054460994,0.000052262196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062224462,0.00032714245,0.0017382083,0.000016494181,0.0000058151622,0.000015047546,0.0007766555,0.050527688,0.0055341013,0.9201391,0.003610321,0.01730321],"study_design_scores_gemma":[0.00026329572,0.00006337715,0.010388733,0.00002843203,0.0000011428203,0.0000027320723,0.0003009156,0.9752155,0.0007641324,0.00007110121,0.012757108,0.00014356387],"about_ca_topic_score_codex":0.00016534122,"about_ca_topic_score_gemma":0.0015245883,"teacher_disagreement_score":0.9246878,"about_ca_system_score_codex":0.00014052894,"about_ca_system_score_gemma":0.000014297406,"threshold_uncertainty_score":0.26719105},"labels":[],"label_agreement":null},{"id":"W2126633408","doi":"10.1109/vtcf.2006.497","title":"Cell Dimensioning and Network Throughput in Cellular Multi-Hop Relay Networks","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Spectral efficiency; Relay; Computer science; Dimensioning; Throughput; Computer network; Overhead (engineering); Physical layer; Hop (telecommunications); Interference (communication); Cellular network; Electronic engineering; Engineering; Telecommunications; Wireless; Channel (broadcasting)","score_opus":0.01855270346729799,"score_gpt":0.23470390229878643,"score_spread":0.21615119883148845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126633408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23085554,0.00901959,0.7573561,0.0013514679,0.00025027175,0.00024378678,2.4938592e-7,0.0004032241,0.0005197591],"genre_scores_gemma":[0.9516867,0.0011900489,0.046616692,0.00020366402,0.000047616257,0.00003862557,0.000003664853,0.000014997997,0.0001980079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981263,0.00017890689,0.00039449183,0.00062596914,0.00013667658,0.00053762336],"domain_scores_gemma":[0.99853915,0.00010760448,0.00014570277,0.0010068623,0.00014717762,0.00005349565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041203643,0.00025449827,0.0003280126,0.00022848518,0.00031082833,0.00012872604,0.0010572223,0.00034667875,0.0000069774014],"category_scores_gemma":[0.000022953778,0.000253683,0.000042449792,0.0012518867,0.00024982198,0.00025271406,0.0006346465,0.0007189023,0.000021901189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020241008,0.0006037083,0.08635919,0.00004038066,0.000054274165,0.0005500432,0.0005776699,0.2617007,0.07616623,0.49506095,0.004705874,0.074160755],"study_design_scores_gemma":[0.0007128745,0.000050250088,0.002037465,0.00012239607,0.0000068606478,0.000014885988,0.000022444307,0.98380315,0.006681177,0.0026454877,0.003523646,0.00037938423],"about_ca_topic_score_codex":0.000025145358,"about_ca_topic_score_gemma":0.00021375704,"teacher_disagreement_score":0.72210246,"about_ca_system_score_codex":0.00004807914,"about_ca_system_score_gemma":0.000057377787,"threshold_uncertainty_score":0.99999154},"labels":[],"label_agreement":null},{"id":"W2126979605","doi":"10.1109/tit.2010.2059651","title":"New Coding Schemes for the Symmetric $K$-Description Problem","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Erasure; Gaussian; Linear network coding; Computer science; Algorithm; Rate–distortion theory; Decoding methods; Theoretical computer science; Coding (social sciences); Multiple description coding; Quantization (signal processing); Binary erasure channel; Quadratic equation; Mathematical optimization; Mathematics; Channel (broadcasting); Channel capacity; Data compression; Telecommunications; Statistics; Network packet","score_opus":0.025355686392186504,"score_gpt":0.2554970244999948,"score_spread":0.2301413381078083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126979605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012571842,0.0000373239,0.9941592,0.0013867513,0.0010767902,0.00046572075,0.0000037852053,0.00020923969,0.0025354482],"genre_scores_gemma":[0.9430603,0.00019852935,0.054566693,0.0010289334,0.00006249244,0.00016749468,0.0000043037667,0.000007195978,0.0009040928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992301,0.00005682363,0.0002822442,0.00010265794,0.00016693579,0.00016125859],"domain_scores_gemma":[0.99851555,0.0005796385,0.000113178845,0.00054696586,0.00017986349,0.000064812215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079946505,0.000111900954,0.00008161409,0.00025425214,0.000761254,0.00037363643,0.00070911774,0.00006267034,0.00008015354],"category_scores_gemma":[0.00003223013,0.000084209285,0.00008845892,0.00064599497,0.000036673595,0.00209179,0.0000053981644,0.00034045643,0.00013371753],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011370015,0.000010630839,3.641036e-7,0.0000046229407,0.000011906791,1.0152292e-8,0.0006670079,0.0005925085,0.00042804793,0.45982403,0.0006196969,0.5378298],"study_design_scores_gemma":[0.0017545419,0.00019150463,0.00013264909,0.00006448983,0.00005064004,0.000022600098,0.000406807,0.50712395,0.03299259,0.036556944,0.4201493,0.0005539968],"about_ca_topic_score_codex":0.000002398357,"about_ca_topic_score_gemma":0.000012666722,"teacher_disagreement_score":0.9429346,"about_ca_system_score_codex":0.00003451822,"about_ca_system_score_gemma":0.00008751891,"threshold_uncertainty_score":0.5855027},"labels":[],"label_agreement":null},{"id":"W2127373254","doi":"10.1109/cwit.2007.375728","title":"Interference-Limited versus Noise-Limited Communication Over Dense Wireless Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scaling; Wireless network; Wireless; Algorithm; Topology (electrical circuits); Mathematics; Combinatorics; Telecommunications","score_opus":0.05093892190008184,"score_gpt":0.29828892913474636,"score_spread":0.24735000723466452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127373254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06394815,0.000517832,0.9109624,0.0009963559,0.00048701945,0.00020552002,3.7707892e-7,0.00046481256,0.022417555],"genre_scores_gemma":[0.9842885,0.0012012772,0.012824741,0.0010253404,0.000059459737,0.00001147323,0.000021014625,0.000014637045,0.0005535375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983409,0.00024629818,0.00042962056,0.0003508344,0.0002195042,0.00041286575],"domain_scores_gemma":[0.99661285,0.00084827316,0.00014531097,0.0019321241,0.00029793914,0.00016348726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085753825,0.00021007896,0.0001994974,0.00017937236,0.00037862366,0.00026621838,0.0021322428,0.00012137838,0.00014015536],"category_scores_gemma":[0.000072846706,0.00019815507,0.00007992942,0.0010947053,0.00010267397,0.00053833827,0.0011248572,0.0004157486,0.00006491119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003354659,0.00030165788,0.0029280738,0.0000068596228,0.00011575172,0.000011553623,0.0019873607,0.00088961003,0.0020140938,0.44302768,0.011519628,0.53686225],"study_design_scores_gemma":[0.0019095074,0.00014022924,0.020116612,0.00008467512,0.000014147204,0.000007696589,0.00014274042,0.96511954,0.0012008179,0.00019739813,0.010534796,0.00053183205],"about_ca_topic_score_codex":0.000023550878,"about_ca_topic_score_gemma":0.0006403146,"teacher_disagreement_score":0.96422994,"about_ca_system_score_codex":0.000125166,"about_ca_system_score_gemma":0.000039715236,"threshold_uncertainty_score":0.80805296},"labels":[],"label_agreement":null},{"id":"W2127578919","doi":"10.1109/icict.2009.5267181","title":"Power optimization of relay channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; Computer science; Transmission (telecommunications); Relay channel; Wireless; Power (physics); Channel (broadcasting); Computer network; Constraint (computer-aided design); Quality of service; Telecommunications; Engineering","score_opus":0.02569952987538358,"score_gpt":0.2695663547000732,"score_spread":0.2438668248246896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127578919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059231516,0.00012534692,0.94810885,0.0024311321,0.000069010486,0.000039836345,3.690753e-8,0.0000612936,0.048572153],"genre_scores_gemma":[0.89477104,0.00013456472,0.1037908,0.0006196289,0.000006540522,6.8884816e-7,5.1065354e-7,0.0000010256724,0.0006751971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996638,0.000030801755,0.00010060708,0.00008014961,0.00006537463,0.000059316448],"domain_scores_gemma":[0.9995126,0.000019685363,0.00003240274,0.0003319208,0.000081992664,0.000021375006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106430874,0.000035139557,0.0000521826,0.000038833114,0.00003998083,0.000026024412,0.00037305706,0.000015833062,0.00011770833],"category_scores_gemma":[0.000016060154,0.0000299722,0.000018170746,0.00025584974,0.000007934395,0.00019233575,0.00006376649,0.000032861306,0.000008245796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022687154,0.00008157983,0.000032448308,7.9014586e-7,0.0000045301563,5.4264757e-7,0.00094941776,0.1458636,0.0011478955,0.8007656,0.0034682911,0.04768305],"study_design_scores_gemma":[0.00015409231,0.00010066022,0.0005605491,0.000012255259,6.526252e-7,0.0000018487139,0.000008663245,0.99149185,0.0032856273,0.0005731722,0.0037237592,0.000086849446],"about_ca_topic_score_codex":2.0434712e-7,"about_ca_topic_score_gemma":1.9103823e-7,"teacher_disagreement_score":0.89417875,"about_ca_system_score_codex":0.0000063761713,"about_ca_system_score_gemma":0.000010664105,"threshold_uncertainty_score":0.12888236},"labels":[],"label_agreement":null},{"id":"W2127603053","doi":"10.1109/cwit.2011.5872158","title":"Green resource allocation with QoS provisioning for cooperative cellular network","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Quality of service; Relay; Provisioning; Resource allocation; Transmitter power output; Computer network; Throughput; Energy consumption; Cellular network; Base station; Transmission (telecommunications); Efficient energy use; Power (physics); Wireless; Telecommunications; Engineering; Channel (broadcasting); Transmitter","score_opus":0.05297013600437248,"score_gpt":0.24883324317213804,"score_spread":0.19586310716776556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127603053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011362651,0.00020488616,0.97625005,0.0007876046,0.000062134706,0.0005345619,2.7571045e-7,0.0001801698,0.02084405],"genre_scores_gemma":[0.68517566,0.000033460594,0.30908117,0.001214267,0.00018364491,0.00016692083,0.00001299811,0.000018541501,0.004113369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903727,0.00011342359,0.00018179789,0.00030702347,0.00012314704,0.00023737157],"domain_scores_gemma":[0.9988398,0.000113652175,0.00007816918,0.00062726554,0.00026856706,0.00007255314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038239415,0.00012740353,0.0001253222,0.000040699655,0.0004241009,0.000094891584,0.0007538067,0.00003730564,0.000043810986],"category_scores_gemma":[0.00002014969,0.0000948392,0.000030237334,0.0004149438,0.00004398532,0.0003631988,0.00023279106,0.00010065219,0.000016983286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083701874,0.00011534256,0.0005176911,0.000011351345,0.000060462145,0.0000031395177,0.007912138,0.0017137007,0.0010780895,0.85229456,0.010094332,0.12611549],"study_design_scores_gemma":[0.0017545056,0.0013027707,0.0016811815,0.00019679496,0.00002794583,0.00001211266,0.00041514396,0.7577976,0.016247809,0.0019995903,0.21764451,0.00092001347],"about_ca_topic_score_codex":0.0000141690925,"about_ca_topic_score_gemma":0.00009298516,"teacher_disagreement_score":0.85029495,"about_ca_system_score_codex":0.000025480727,"about_ca_system_score_gemma":0.00006446767,"threshold_uncertainty_score":0.386743},"labels":[],"label_agreement":null},{"id":"W2127820767","doi":"10.1109/twc.2013.081413.121321","title":"Transceiver Design for SC-FDE Based MIMO Relay Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; MIMO; Precoding; Optimization problem; Computer science; Control theory (sociology); Covariance matrix; Mathematics; Frequency domain; Minimum mean square error; Mathematical optimization; Algorithm; Beamforming; Power (physics); Telecommunications; Statistics","score_opus":0.07889703189364018,"score_gpt":0.2881383941685716,"score_spread":0.20924136227493145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127820767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004335414,0.0004965004,0.9886224,0.0071378713,0.0003692784,0.0016713793,0.000019711648,0.00044181506,0.00080749526],"genre_scores_gemma":[0.8806194,0.0009448362,0.11444772,0.00053838256,0.00001704541,0.0025575664,0.000011004814,0.00003338071,0.00083067454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780476,0.0006974621,0.0005008509,0.00039658192,0.00023496497,0.00036538235],"domain_scores_gemma":[0.99351877,0.0017399105,0.00013766468,0.003942249,0.0004889421,0.00017245808],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004696027,0.0002644341,0.00028239354,0.00026934088,0.0014513296,0.0003786623,0.0034543215,0.00013283346,0.00005806674],"category_scores_gemma":[0.00001112813,0.00026746705,0.00020438907,0.0007581084,0.00018256251,0.0006839788,0.00001316265,0.00045522238,0.0002008993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006232823,0.0025266553,0.000015710497,0.00008784426,0.0003235423,0.000001106828,0.0030417948,0.48115477,0.020130131,0.08978696,0.008564087,0.39430508],"study_design_scores_gemma":[0.0007777128,0.00012345424,0.000056965066,0.00011596339,0.000028799259,0.0000038872417,0.00004984857,0.98446965,0.004437069,0.00014765668,0.009441174,0.00034781336],"about_ca_topic_score_codex":0.000037467024,"about_ca_topic_score_gemma":0.00006772017,"teacher_disagreement_score":0.88018584,"about_ca_system_score_codex":0.00013679589,"about_ca_system_score_gemma":0.00017193753,"threshold_uncertainty_score":0.99997777},"labels":[],"label_agreement":null},{"id":"W2127929681","doi":"10.1109/lcn.2007.89","title":"Rate Splitting MIMO-based MAC Protocol","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"MIMO; Computer science; Computer network; Throughput; Multi-user MIMO; Transmission (telecommunications); 3G MIMO; Protocol (science); Channel (broadcasting); Wireless; Telecommunications","score_opus":0.048411883641984656,"score_gpt":0.33725348025343344,"score_spread":0.28884159661144876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127929681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037599634,0.000006622168,0.9345613,0.0012694934,0.000050428258,0.010658071,5.401839e-8,0.00024750902,0.052830487],"genre_scores_gemma":[0.5954169,0.000003069257,0.3772492,0.007900815,0.00014502692,0.015331214,0.000001925851,0.000017473647,0.0039343503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920255,0.00008771351,0.00020131789,0.00019065423,0.00010259979,0.00021514729],"domain_scores_gemma":[0.9989942,0.00019140409,0.00005390989,0.0005911546,0.000097433345,0.00007190738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012260393,0.00008063845,0.00007213291,0.00006458336,0.00018074579,0.00012241646,0.00072543765,0.00002513136,0.00012856018],"category_scores_gemma":[0.000046599107,0.00006764841,0.00003406529,0.00041071855,0.000021524373,0.00017761221,0.0002195157,0.00010581603,0.000096315576],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024563777,0.00013580157,0.002155859,0.000020338295,0.00000914494,0.000014270631,0.00031619164,0.00017559524,0.010458666,0.36688882,0.004212096,0.61558867],"study_design_scores_gemma":[0.0013948801,0.00009976252,0.0091684945,0.00006362527,0.0000017646998,0.000003942294,0.00002472031,0.46640852,0.07581932,0.00085360755,0.44573614,0.00042523962],"about_ca_topic_score_codex":0.0000023679104,"about_ca_topic_score_gemma":0.000028302784,"teacher_disagreement_score":0.6151634,"about_ca_system_score_codex":0.00002803106,"about_ca_system_score_gemma":0.000047583322,"threshold_uncertainty_score":0.27586222},"labels":[],"label_agreement":null},{"id":"W2127932079","doi":"10.1109/icc.2006.255655","title":"Stimulating Cooperative Diversity in Wireless Ad Hoc Networks through Pricing","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer network; Wireless ad hoc network; Cooperative diversity; Computer science; Nash equilibrium; Game theory; Wireless; Diversity (politics); Wireless network; Channel (broadcasting); Power control; Telecommunications; Power (physics); Fading; Microeconomics; Economics","score_opus":0.14620772945645497,"score_gpt":0.3518665285425901,"score_spread":0.20565879908613513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127932079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045655794,0.0012116861,0.7682798,0.016088706,0.0008129517,0.0006505002,0.000026751912,0.00037644967,0.16689736],"genre_scores_gemma":[0.9843351,0.0030891297,0.011137883,0.0006428793,0.00005789641,0.00005013218,0.00007515158,0.000011603998,0.0006001801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981177,0.00037298285,0.0004863825,0.00039010603,0.00034709784,0.00028575727],"domain_scores_gemma":[0.9971302,0.00045120216,0.00021264837,0.0015933609,0.0005636223,0.0000489241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036837312,0.00022133363,0.00022418893,0.0001864902,0.00085373013,0.0003011556,0.004115113,0.00008975984,0.00006315897],"category_scores_gemma":[0.000044755772,0.00023601073,0.0000696706,0.00065654964,0.00016550778,0.0007982603,0.0019832668,0.0005989858,0.000041817537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015273783,0.00036315797,0.0041714073,0.0000020203984,0.000026739666,0.0000041903336,0.0010958129,0.02179811,0.00059698254,0.94844186,0.0010530057,0.022431416],"study_design_scores_gemma":[0.00065473065,0.000056514582,0.008222968,0.00017671987,0.0000046553873,0.000003994673,0.000116339645,0.9824749,0.00015791136,0.0040296344,0.0037670012,0.00033457982],"about_ca_topic_score_codex":0.00017079547,"about_ca_topic_score_gemma":0.0025444818,"teacher_disagreement_score":0.96067685,"about_ca_system_score_codex":0.00027157212,"about_ca_system_score_gemma":0.0001078853,"threshold_uncertainty_score":0.9624238},"labels":[],"label_agreement":null},{"id":"W2127948416","doi":"10.1109/cwit.2015.7255185","title":"Improved training and training power allocation schemes for multi-relay AF networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Training (meteorology); Computer science; Scheme (mathematics); Channel (broadcasting); Power (physics); Mean squared error; Relay channel; Mathematical optimization; Telecommunications; Mathematics; Statistics","score_opus":0.15532965950064243,"score_gpt":0.330341518657775,"score_spread":0.17501185915713258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127948416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029704273,0.00072815764,0.99361634,0.001208962,0.00020720644,0.00025169228,2.788434e-7,0.00016744938,0.00084951194],"genre_scores_gemma":[0.7227749,0.00006152721,0.27609193,0.0005717784,0.00003943197,0.000041277202,0.000003621801,0.000007931627,0.00040760488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914795,0.00006125687,0.00019975199,0.00027243482,0.00007965846,0.00023894095],"domain_scores_gemma":[0.9991088,0.00013347415,0.000066042245,0.00034968098,0.00019677685,0.00014523386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007058813,0.00011898634,0.00014367474,0.00005265171,0.00018488405,0.000185343,0.00041499484,0.000059768096,0.0000056153613],"category_scores_gemma":[0.00015220125,0.00010701574,0.000033586464,0.00019743557,0.000040383835,0.0004209628,0.00019540882,0.000115694274,0.0000016769919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012414586,0.00004759185,0.00008764552,0.0000036808312,0.000034474015,4.3573198e-7,0.02102796,0.0006209275,0.0009793027,0.21139997,0.0010391552,0.7647464],"study_design_scores_gemma":[0.0008853953,0.00007916909,0.00011606567,0.0000153616,0.0000031381387,0.0000038376866,0.000762147,0.9825631,0.00011201602,0.00011125506,0.015190651,0.00015787334],"about_ca_topic_score_codex":0.0000021145852,"about_ca_topic_score_gemma":0.00003798678,"teacher_disagreement_score":0.9819422,"about_ca_system_score_codex":0.000027623419,"about_ca_system_score_gemma":0.000087907836,"threshold_uncertainty_score":0.43639752},"labels":[],"label_agreement":null},{"id":"W2127974382","doi":"10.1109/icc.2008.704","title":"On the Outage and Error Probability of Amplify-And-Forward Multi-Hop Diversity Transmission Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Hop (telecommunications); Outage probability; Bit error rate; Transmission (telecommunications); Probability of error; Diversity gain; Communications system; Topology (electrical circuits); Electronic engineering; Algorithm; Telecommunications; Decoding methods; Fading; Electrical engineering; Engineering","score_opus":0.11721286405920049,"score_gpt":0.2771204149955139,"score_spread":0.15990755093631337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127974382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5418277,0.00038637948,0.45467582,0.0013755214,0.00004681845,0.00036615942,0.0000012864186,0.00006172282,0.0012585941],"genre_scores_gemma":[0.99535453,0.00033551405,0.0038461448,0.00012055313,0.00000308821,0.000004009341,3.1747518e-7,0.0000016048981,0.00033422367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993369,0.0001695978,0.00012340907,0.00016936626,0.00011938415,0.00008137195],"domain_scores_gemma":[0.9992325,0.0002284661,0.000040639457,0.000387774,0.00005947671,0.000051197694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035763005,0.00006887692,0.00010903106,0.000022064138,0.00047239364,0.00002366809,0.0003787832,0.000028425156,0.0000122084975],"category_scores_gemma":[0.00003195467,0.00004080985,0.00002225133,0.00011010895,0.00011316219,0.000111139394,0.00048242474,0.00009569479,0.00000197492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010670605,0.0008565476,0.0423438,0.00021945352,0.00010097177,0.000008642275,0.05914323,0.0009226637,0.003815097,0.7812764,0.0029689076,0.108237594],"study_design_scores_gemma":[0.0014878942,0.00029435207,0.08768402,0.00015161482,0.000013814292,0.000027446293,0.0004896672,0.9013607,0.0011480694,0.0015150766,0.0054078028,0.00041955043],"about_ca_topic_score_codex":0.000037374262,"about_ca_topic_score_gemma":0.000013285032,"teacher_disagreement_score":0.900438,"about_ca_system_score_codex":0.000011824796,"about_ca_system_score_gemma":0.000013268761,"threshold_uncertainty_score":0.36333176},"labels":[],"label_agreement":null},{"id":"W2128172018","doi":"10.1109/acssc.2005.1600028","title":"Structural Results on Optimal Rate and Number of Clusters in Cluster based Cooperative MIMO Sensor Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MIMO; Fading; Energy consumption; Node (physics); Computer science; Cluster (spacecraft); Wireless sensor network; Function (biology); Topology (electrical circuits); Channel (broadcasting); Energy (signal processing); Path loss; Mathematical optimization; Computer network; Mathematics; Telecommunications; Wireless; Statistics; Engineering; Electrical engineering","score_opus":0.02149838843089094,"score_gpt":0.27244066288938934,"score_spread":0.25094227445849837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128172018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7373405,0.00006197603,0.23888834,0.004105363,0.00019833498,0.0004657176,0.00000569386,0.00009168327,0.018842364],"genre_scores_gemma":[0.97859085,0.000022640623,0.019642191,0.0009842146,0.000029272574,0.0000058801156,0.000010364754,0.0000062804875,0.00070830464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986756,0.00035790855,0.00035360118,0.00030305388,0.000108248474,0.00020161175],"domain_scores_gemma":[0.9989121,0.00041520956,0.00008937215,0.00042146863,0.00011806365,0.000043791882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037477864,0.00014646916,0.00018794142,0.00007240488,0.00009685845,0.000092188115,0.00032451615,0.000056899662,0.000021542706],"category_scores_gemma":[0.00003324471,0.00011831489,0.000029816001,0.0003724997,0.00008388334,0.00020848666,0.00020102311,0.0001767655,0.0000046661285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004491748,0.000088661225,0.0039062134,0.000009251792,0.000015360276,0.0000132980385,0.0006764084,0.9308402,0.00031711283,0.05282801,0.0031235388,0.007732793],"study_design_scores_gemma":[0.0016445382,0.00005759574,0.011266793,0.00003926313,0.0000015615121,0.0000039429174,0.000023311894,0.98614126,0.0004832408,0.000021851252,0.00016659683,0.00015006048],"about_ca_topic_score_codex":0.000034903624,"about_ca_topic_score_gemma":0.00023574321,"teacher_disagreement_score":0.24125032,"about_ca_system_score_codex":0.00002893204,"about_ca_system_score_gemma":0.000029080831,"threshold_uncertainty_score":0.48247412},"labels":[],"label_agreement":null},{"id":"W2128219900","doi":"10.1109/acssc.2009.5470056","title":"Optimal power allocation for orthogonal relay systems with quality-of-service constraints","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; Computer science; Narrowband; Channel state information; Relay channel; Computer network; Quality of service; Channel (broadcasting); Transmitter power output; Coherence time; Power (physics); Coherence (philosophical gambling strategy); Wireless; Telecommunications; Mathematics","score_opus":0.057947222867722636,"score_gpt":0.31942807457582506,"score_spread":0.2614808517081024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128219900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018989444,0.000109464905,0.97058016,0.0041751373,0.000066219334,0.000268515,0.0000015891751,0.000073465315,0.00573603],"genre_scores_gemma":[0.93490994,0.000011471701,0.06393664,0.00089425145,0.00001222999,0.000022241975,0.000005624722,0.0000029675698,0.00020462129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916846,0.00009485871,0.00026948017,0.00018354865,0.00015622693,0.00012742504],"domain_scores_gemma":[0.9987681,0.00013977471,0.000120559765,0.00045661043,0.0004661495,0.000048797014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004933982,0.000083778126,0.00014083592,0.000043301407,0.00009681688,0.00006708837,0.0005041857,0.00003320525,0.000022950704],"category_scores_gemma":[0.000026893935,0.000065628745,0.000028574965,0.00029141858,0.000034269568,0.00023819969,0.00004972287,0.00006156562,0.0000062719637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002240555,0.000058628248,0.00007300717,0.000009345555,0.000014149659,2.0939531e-7,0.00041825385,0.0038746584,0.0012475376,0.98427385,0.00024416586,0.0097637875],"study_design_scores_gemma":[0.0027817048,0.0010661521,0.020081887,0.00025744268,0.000016461934,0.00004091377,0.0005671232,0.9627674,0.0018119062,0.00060901453,0.009236189,0.0007637833],"about_ca_topic_score_codex":0.0000051455495,"about_ca_topic_score_gemma":0.000021250902,"teacher_disagreement_score":0.9836648,"about_ca_system_score_codex":0.000016887381,"about_ca_system_score_gemma":0.00008211961,"threshold_uncertainty_score":0.26762626},"labels":[],"label_agreement":null},{"id":"W2128516130","doi":"10.1109/iwcmc.2011.5982789","title":"Optimal dual-cast beamforming for network coding-based two-way relay transmission","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Beamforming; Relay; Linear network coding; Computer science; Coding (social sciences); Transmission (telecommunications); Dual (grammatical number); Relay channel; Computer network; Wireless; Terminal (telecommunication); Telecommunications; Mathematics","score_opus":0.0712761601213788,"score_gpt":0.2851553864323646,"score_spread":0.2138792263109858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128516130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013651671,0.00021586832,0.98526865,0.00062286376,0.00022590291,0.0003241046,6.661143e-7,0.0002691221,0.011707662],"genre_scores_gemma":[0.38221997,0.000068186535,0.61625236,0.0006719298,0.00008694136,0.000047671816,0.000005536083,0.000013571405,0.0006337886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987189,0.00008764673,0.00030862621,0.00034293032,0.00014750307,0.00039439942],"domain_scores_gemma":[0.9987826,0.00020357875,0.00008657681,0.0006468844,0.00013620348,0.00014417796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063398655,0.00017193882,0.0001788774,0.00006780229,0.0005278894,0.00009788029,0.00073861604,0.000057618425,0.00017931942],"category_scores_gemma":[0.00001906534,0.00014623809,0.00011835069,0.00037887142,0.000042478365,0.00037901726,0.00016871086,0.00015489731,0.000023119177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015942799,0.00031557368,0.0003364677,0.000038782644,0.000060458555,0.000011258719,0.004358372,0.07792725,0.0025678743,0.48622736,0.0118450485,0.41615212],"study_design_scores_gemma":[0.0008372033,0.00015863415,0.000119649245,0.000070459915,0.00000812398,0.000006490902,0.000015817177,0.9472668,0.004964195,0.00026051578,0.04603199,0.000260086],"about_ca_topic_score_codex":0.0000063548096,"about_ca_topic_score_gemma":0.00002005378,"teacher_disagreement_score":0.8693396,"about_ca_system_score_codex":0.000035171775,"about_ca_system_score_gemma":0.000066075336,"threshold_uncertainty_score":0.5963416},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027735625260103845,"score_gpt":0.2775726853735803,"score_spread":0.24983706011347648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128555802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043541365,0.000020666099,0.992286,0.00051635195,0.0013687531,0.0003501943,0.000002486124,0.00016968016,0.0048504146],"genre_scores_gemma":[0.9921335,0.00011789957,0.0047011306,0.002716468,0.00002810293,0.00006437841,0.000005019194,0.0000040717828,0.00022942638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904835,0.00013050376,0.0003431574,0.000120360906,0.00015587617,0.00020174058],"domain_scores_gemma":[0.998691,0.0006711858,0.00010974666,0.00036695608,0.000113129514,0.00004795943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008571407,0.000119486416,0.00012076391,0.00045841956,0.00036420638,0.00013109266,0.0003645141,0.00006791636,0.000024991567],"category_scores_gemma":[0.0000479137,0.00011923214,0.00007366317,0.0010792838,0.000016009802,0.0012399845,0.0000017845905,0.00024561642,0.000060655002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008076928,0.00005949377,7.29371e-7,0.0000029253072,0.000005424006,9.677875e-8,0.00084686367,0.20133704,0.000013240732,0.2359505,0.0013342795,0.56036866],"study_design_scores_gemma":[0.0010411205,0.00045909907,0.00023938021,0.00010674135,0.0000073090628,0.0000045694087,0.00012170088,0.9668459,0.0022886465,0.022077924,0.0065276558,0.0002799137],"about_ca_topic_score_codex":6.707767e-7,"about_ca_topic_score_gemma":0.000007031877,"teacher_disagreement_score":0.9916981,"about_ca_system_score_codex":0.00014427722,"about_ca_system_score_gemma":0.00003684396,"threshold_uncertainty_score":0.48621458},"labels":[],"label_agreement":null},{"id":"W2128691106","doi":"10.1109/lcomm.2012.032612.112408","title":"Joint Optimal Threshold-Based Relaying and ML Detection in Cooperative Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Phase-shift keying; Computer science; Relay; Algorithm; Signal-to-noise ratio (imaging); Binary number; Bit error rate; Node (physics); Detector; Thresholding; Decoding methods; Joint (building); Mathematics; Telecommunications; Artificial intelligence; Physics","score_opus":0.058470119564286556,"score_gpt":0.2830607856514662,"score_spread":0.22459066608717965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128691106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17021859,0.0027250198,0.815386,0.010419894,0.00025043153,0.0003129943,6.5717103e-7,0.0001559031,0.0005305394],"genre_scores_gemma":[0.97431564,0.0008777978,0.02141583,0.003198292,0.00004767117,0.00011443108,0.0000063242455,0.00001400859,0.000010007971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848956,0.00047525315,0.000339143,0.00022735572,0.00012357086,0.00034513566],"domain_scores_gemma":[0.9974194,0.00029627973,0.00010990121,0.0019862938,0.0000788476,0.00010923292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000788431,0.0001685197,0.00017994935,0.00021322753,0.00056920963,0.00016690814,0.0012258289,0.00006741114,0.0000051475195],"category_scores_gemma":[0.000044587356,0.00017574121,0.000044688404,0.00072171295,0.00018703741,0.0008040757,0.000554846,0.00055012427,0.00001318818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065123284,0.0013584072,0.033505954,0.000042984448,0.00016554876,0.000009384627,0.014629846,0.42701712,0.20791797,0.07448515,0.004178858,0.23662364],"study_design_scores_gemma":[0.0005127885,0.000027183221,0.009518529,0.00006891291,0.0000071703153,0.0000108747245,0.00006570934,0.98349226,0.0032209118,0.000011258688,0.0027679517,0.0002964571],"about_ca_topic_score_codex":0.00001466077,"about_ca_topic_score_gemma":0.000111688234,"teacher_disagreement_score":0.80409706,"about_ca_system_score_codex":0.00013639704,"about_ca_system_score_gemma":0.000027510036,"threshold_uncertainty_score":0.71665186},"labels":[],"label_agreement":null},{"id":"W2128844968","doi":"10.1109/isit.2012.6283852","title":"Optimal index codes with near-extreme rates","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Scalar (mathematics); Rank (graph theory); Coding (social sciences); Index (typography); Discrete mathematics; Computer science; Statistics","score_opus":0.06321831517756284,"score_gpt":0.28580614408989635,"score_spread":0.22258782891233353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128844968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057684775,0.0006471484,0.9146165,0.0012843309,0.000076874545,0.0000831583,1.4751524e-7,0.00018885339,0.025418203],"genre_scores_gemma":[0.9087024,0.00005887373,0.0896669,0.0004630158,0.00003376767,0.0000072808825,8.8744054e-7,0.000003993342,0.001062916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943197,0.000058484835,0.00008362402,0.0001104864,0.00010716258,0.0002083024],"domain_scores_gemma":[0.99931675,0.00006425462,0.00002676543,0.00043582512,0.000068490845,0.00008791924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019088722,0.000077233424,0.00007598481,0.000023851971,0.00018907685,0.00017690453,0.00051884627,0.000019402769,0.00015541898],"category_scores_gemma":[0.000009146151,0.000053722444,0.000015856924,0.0002679223,0.000049885955,0.00059418014,0.00025597573,0.00008528085,0.00009105608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000301447,0.00035555827,0.23979442,0.0000081235785,0.000075381606,0.000003761814,0.0057378914,0.0025034735,0.0012745503,0.57771593,0.012855781,0.15964496],"study_design_scores_gemma":[0.0007566739,0.00014175415,0.108230695,0.00003605093,0.0000064303,0.000041868127,0.0001458402,0.7508827,0.0044114664,0.000096158175,0.13468248,0.0005679235],"about_ca_topic_score_codex":0.0000049009122,"about_ca_topic_score_gemma":0.000019881272,"teacher_disagreement_score":0.8510176,"about_ca_system_score_codex":0.0000139409185,"about_ca_system_score_gemma":0.000031995227,"threshold_uncertainty_score":0.21907377},"labels":[],"label_agreement":null},{"id":"W2128874299","doi":"10.1109/tcomm.2010.080310.090292","title":"Performance Analysis of Bidirectional Communication Protocols Based on Decode-and-Forward Relaying","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Relay; Outage probability; Linear network coding; Multiplexing; Signal-to-noise ratio (imaging); Topology (electrical circuits); Computer network; Coding (social sciences); Protocol (science); Diversity gain; Asymptotic analysis; Power (physics); Channel (broadcasting); Fading; Mathematics; Telecommunications; Network packet; Statistics","score_opus":0.048973838145291555,"score_gpt":0.3224145168985834,"score_spread":0.27344067875329187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128874299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02636692,0.00006592749,0.95687777,0.004476597,0.0001523265,0.0024875463,0.000029554547,0.00032260988,0.009220754],"genre_scores_gemma":[0.94168216,0.00064512045,0.05521837,0.00026613547,0.000005008343,0.0020402796,0.000015649259,0.000012951499,0.0001142955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984098,0.00036384157,0.00047935493,0.0002893535,0.00028378336,0.00017383638],"domain_scores_gemma":[0.9936223,0.0010693631,0.0002222419,0.004668114,0.00031861704,0.000099387624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007334649,0.0001794818,0.0002766183,0.0007935256,0.0011375401,0.00009961918,0.0022806725,0.0001051212,0.00007170834],"category_scores_gemma":[0.000031588093,0.00018323347,0.0001731392,0.002179881,0.0002698513,0.0003736309,0.000040826082,0.00081712566,0.000016127133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016469978,0.003971808,0.006275676,0.00006494125,0.0012752329,4.7428935e-7,0.003039333,0.21049465,0.016824579,0.082952954,0.00033418468,0.67460144],"study_design_scores_gemma":[0.00035371954,0.00010561436,0.008653798,0.000074121184,0.00011311461,0.0000018659937,0.00001674034,0.9827198,0.0039211493,0.00007511664,0.0037654943,0.00019948203],"about_ca_topic_score_codex":0.000017855806,"about_ca_topic_score_gemma":0.0004787421,"teacher_disagreement_score":0.9153153,"about_ca_system_score_codex":0.000052789044,"about_ca_system_score_gemma":0.00011196996,"threshold_uncertainty_score":0.87491536},"labels":[],"label_agreement":null},{"id":"W2128895134","doi":"10.1109/icc.2005.1494450","title":"Joint source coding, routing and resource allocation for wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Wireless sensor network; Linear network coding; Physical layer; Distributed computing; Computer network; Cross-layer optimization; Network layer; Optimization problem; Coding (social sciences); Wireless network; Wireless; Layer (electronics); Algorithm; Telecommunications","score_opus":0.03789000210543738,"score_gpt":0.264462912521666,"score_spread":0.2265729104162286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128895134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007141517,0.00022609203,0.98342544,0.0063702585,0.00003986408,0.0002204209,1.6236876e-7,0.00020402131,0.0023722374],"genre_scores_gemma":[0.93831414,0.00021626656,0.057372015,0.0017476595,0.00018132439,0.00002249057,0.000003801175,0.000010253406,0.002132055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909854,0.000082249666,0.00022739044,0.00027523845,0.000091653426,0.00022491436],"domain_scores_gemma":[0.99911445,0.00019991955,0.0000847453,0.00042411388,0.00009914631,0.00007759287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053525367,0.000109400185,0.00012541297,0.0000478885,0.00038544435,0.00021498998,0.00034834375,0.0000480293,0.000008606923],"category_scores_gemma":[0.000043878317,0.000102234415,0.000036155565,0.00017564598,0.000033574146,0.00023633454,0.00030000086,0.00011368164,0.0000051657616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056457184,0.0000296454,0.00017671743,0.0000060841985,0.0000131106335,1.7551588e-7,0.0013219938,0.0073081288,0.0013192183,0.20560531,0.004302644,0.77991134],"study_design_scores_gemma":[0.00026469707,0.000021456153,0.0002878403,0.000025140589,0.0000029674286,0.000006136029,0.000070291164,0.9344979,0.0008342194,0.000024964276,0.063828684,0.00013570211],"about_ca_topic_score_codex":0.0000027747092,"about_ca_topic_score_gemma":0.000032509473,"teacher_disagreement_score":0.9311726,"about_ca_system_score_codex":0.000038490412,"about_ca_system_score_gemma":0.000015403639,"threshold_uncertainty_score":0.41689983},"labels":[],"label_agreement":null},{"id":"W2128925306","doi":"10.1109/vetecf.2010.5594177","title":"On the Performance of Dual-Hop Fixed Gain Relaying Systems over Composite Multipath/Shadowing Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Relay; Multipath propagation; Cumulative distribution function; Computer science; Shadow mapping; Hop (telecommunications); Outage probability; Topology (electrical circuits); Fading distribution; Electronic engineering; Signal-to-noise ratio (imaging); Telecommunications; Algorithm; Probability density function; Channel (broadcasting); Mathematics; Statistics; Engineering; Rayleigh fading; Electrical engineering; Physics","score_opus":0.03212944594453131,"score_gpt":0.26136804845795325,"score_spread":0.22923860251342193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128925306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556772,0.000098432516,0.037148334,0.0007192623,0.00082802953,0.00025561432,6.161362e-7,0.00010901694,0.0051634796],"genre_scores_gemma":[0.9971825,0.000051546158,0.0017664719,0.00044541716,0.000054335214,0.000021291999,0.0000011172862,0.000007746499,0.0004696122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989234,0.00019740421,0.00026434017,0.00020679714,0.00022432372,0.00018372004],"domain_scores_gemma":[0.9980922,0.0006776166,0.000114037925,0.0009534757,0.00011414273,0.00004853813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009959381,0.0001224721,0.00015018087,0.000070049275,0.00036158488,0.00015087296,0.00087115396,0.0000483492,0.00003666083],"category_scores_gemma":[0.00007741947,0.00008074241,0.000051964747,0.0003264976,0.000050376333,0.00028013883,0.00041887848,0.00035615926,0.000036258672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017964225,0.00013261112,0.0027515516,0.000037922946,0.000042617394,0.000003245872,0.003909039,0.013467846,0.25299308,0.7126285,0.0017397328,0.012275925],"study_design_scores_gemma":[0.00019247772,0.000041295585,0.0011248426,0.00010685587,0.0000019009664,0.0000051214233,0.000040157865,0.98654896,0.011089282,0.000025664018,0.0006991652,0.00012428388],"about_ca_topic_score_codex":0.000014185528,"about_ca_topic_score_gemma":0.000008425651,"teacher_disagreement_score":0.9730811,"about_ca_system_score_codex":0.000016533655,"about_ca_system_score_gemma":0.000021219494,"threshold_uncertainty_score":0.32925797},"labels":[],"label_agreement":null},{"id":"W2128988673","doi":"10.1109/allerton.2010.5706932","title":"Multicast streaming codes (Mu-SCo) for burst erasure channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer science; Erasure; Erasure code; Computer network; Channel (broadcasting); Binary erasure channel; Network packet; Online codes; Code (set theory); Fountain code; Channel capacity; Decoding methods; Algorithm; Linear code; Programming language","score_opus":0.04481887982989631,"score_gpt":0.30434401674674916,"score_spread":0.25952513691685286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128988673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02132106,0.00009642991,0.96986127,0.0030909544,0.0007132186,0.00028792408,0.0000027549252,0.00023684099,0.0043895724],"genre_scores_gemma":[0.90079874,0.000038966013,0.0974221,0.00038282463,0.00013144646,0.000041036423,0.000004230626,0.0000074764866,0.0011732063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925184,0.000031574025,0.00015066094,0.00024349592,0.00010260101,0.00021983577],"domain_scores_gemma":[0.9987591,0.00026677502,0.00004167455,0.00065949676,0.00018867965,0.00008427064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027739088,0.00010808255,0.0001176594,0.00005249944,0.00030185448,0.00023594433,0.0008749685,0.000050252085,0.00006372615],"category_scores_gemma":[0.00010870848,0.00009199356,0.000051407333,0.00018966703,0.000041828058,0.00028599828,0.00026515804,0.00017322706,0.000028801609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011000704,0.00016592261,0.00056432566,0.000015785263,0.000034110813,0.0000019739352,0.001333928,0.00023935921,0.055181902,0.58203495,0.004546919,0.3558698],"study_design_scores_gemma":[0.00069527316,0.00008621011,0.0010947951,0.000027094347,0.0000057390757,0.000009442755,0.000072435665,0.8965902,0.013822646,0.0009506462,0.08630683,0.00033872575],"about_ca_topic_score_codex":0.0000052569994,"about_ca_topic_score_gemma":0.0001930855,"teacher_disagreement_score":0.8963508,"about_ca_system_score_codex":0.000010200408,"about_ca_system_score_gemma":0.00003269383,"threshold_uncertainty_score":0.37513885},"labels":[],"label_agreement":null},{"id":"W2129149713","doi":"10.1109/glocom.2009.5425502","title":"Efficient Multipoint P2P File Sharing in MANETs","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Server; Multicast; Linear network coding; File sharing; Upload; Scalability; Overlay network; Download; BitTorrent tracker; Peer-to-peer; File size; Overlay; Distributed computing; Operating system; The Internet","score_opus":0.034282265758892844,"score_gpt":0.2771119790238397,"score_spread":0.24282971326494687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129149713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12084844,0.0008597542,0.6144753,0.011285869,0.00032258476,0.00071563246,0.0000027066542,0.00085062045,0.25063905],"genre_scores_gemma":[0.9748801,0.000026081472,0.023356754,0.00095236464,0.0000125622955,0.0000070378887,0.0000024528772,0.0000018586616,0.00076081173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993635,0.000029561388,0.00014558922,0.00020998027,0.00008992791,0.00016145072],"domain_scores_gemma":[0.99931616,0.00005297488,0.000022431535,0.0005377107,0.000027652506,0.00004305931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017404532,0.000066060216,0.00007402228,0.000078463796,0.00006858134,0.000082959654,0.0007572157,0.000019282197,0.0004905433],"category_scores_gemma":[0.000028046401,0.000058889418,0.000021977727,0.00033029448,0.000007857316,0.00006669729,0.00028672587,0.00010041701,0.00010785474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004959686,0.0003345011,0.0005585475,0.0000030113245,0.0000037943437,0.000021737174,0.0022840202,0.02881528,0.0018893714,0.269759,0.010155066,0.6861707],"study_design_scores_gemma":[0.00017849276,0.00002086995,0.02490843,0.000024166331,2.0518205e-7,0.0000026949947,0.000008894508,0.96986014,0.00029939864,0.00030841556,0.0042944252,0.000093889175],"about_ca_topic_score_codex":0.000005695847,"about_ca_topic_score_gemma":0.000042449297,"teacher_disagreement_score":0.9410448,"about_ca_system_score_codex":0.00003771642,"about_ca_system_score_gemma":0.000011483562,"threshold_uncertainty_score":0.5371105},"labels":[],"label_agreement":null},{"id":"W2129320079","doi":"10.1109/glocom.2009.5425344","title":"Power Allocation for Cooperative Diversity Networks with Inaccurate CSI: A Robust and Constrained Kalman Filter Approach","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Kalman filter; Robustness (evolution); Computer science; Channel state information; Channel (broadcasting); Control theory (sociology); Mathematical optimization; Fading; Wireless; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.04223310646049603,"score_gpt":0.2491552241672676,"score_spread":0.20692211770677157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129320079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004880689,0.0001316257,0.98258597,0.0020055545,0.000027524073,0.00045293386,0.000001082523,0.00010427941,0.009810335],"genre_scores_gemma":[0.92499703,0.000082380015,0.0728813,0.001588729,0.000017488057,0.00001718532,0.000013677848,0.0000036459887,0.00039858092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991807,0.000080326274,0.00013300237,0.0003177136,0.000094841016,0.00019344324],"domain_scores_gemma":[0.99914914,0.00009314259,0.000059750924,0.0003537958,0.00026262132,0.00008157387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023310169,0.000140807,0.00014762997,0.000048306603,0.0005774495,0.00018617259,0.000423949,0.000046439778,0.000015641197],"category_scores_gemma":[0.00001738614,0.00010765149,0.000023480943,0.00028538686,0.00008364679,0.00049940386,0.0002854477,0.00011253404,9.2813764e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020462778,0.0004181975,0.0012211275,0.000012573043,0.0001224074,0.000004413061,0.007581083,0.04463059,0.00026650046,0.8696739,0.009473037,0.06639156],"study_design_scores_gemma":[0.001111015,0.0004190638,0.004482266,0.000019658111,0.000008427561,0.000013881428,0.00019351843,0.9923722,0.00008208514,0.00016639626,0.0008626911,0.00026879253],"about_ca_topic_score_codex":0.0000022741426,"about_ca_topic_score_gemma":0.000018845607,"teacher_disagreement_score":0.9477416,"about_ca_system_score_codex":0.000026977059,"about_ca_system_score_gemma":0.00003426272,"threshold_uncertainty_score":0.44413328},"labels":[],"label_agreement":null},{"id":"W2129368916","doi":"10.1109/twc.2010.09l510.100125","title":"Cross-Layer Design for Multihop Wireless Relaying Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Channel state information; Routing (electronic design automation); Computer network; Fading; Wireless network; Wireless; Channel (broadcasting); Mathematical optimization; Distributed computing; Mathematics; Telecommunications","score_opus":0.08147284503244252,"score_gpt":0.3330124264827765,"score_spread":0.251539581450334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129368916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006755573,0.00017821789,0.9877699,0.0023013088,0.0010094647,0.00090043346,0.000014109436,0.0005658267,0.0005051924],"genre_scores_gemma":[0.8606101,0.001511872,0.1358965,0.0004639444,0.000052986343,0.0008752235,0.00001132962,0.000046558634,0.0005314623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977459,0.0003931877,0.0005946035,0.0005348503,0.00023717742,0.0004943137],"domain_scores_gemma":[0.9917803,0.0021323327,0.00020523006,0.0051445966,0.00052996515,0.00020761782],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00089766213,0.00032673552,0.0003112866,0.00024670232,0.0026980368,0.00049269217,0.004664313,0.0002492983,0.000047706297],"category_scores_gemma":[0.00002718248,0.00034577007,0.00023786168,0.00089672644,0.00034912655,0.00076841464,0.00006275691,0.0013720967,0.00005243481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007854634,0.0012529766,0.00009341769,0.000019244151,0.00016815627,0.0000014760209,0.0016980103,0.11726205,0.033649914,0.092404604,0.000689092,0.7526825],"study_design_scores_gemma":[0.0008319306,0.00007416326,0.00016340462,0.000048783706,0.00002304093,0.000011656857,0.000024805036,0.98116535,0.010371493,0.00023253003,0.00662336,0.00042949323],"about_ca_topic_score_codex":0.000016444212,"about_ca_topic_score_gemma":0.00033886347,"teacher_disagreement_score":0.8639033,"about_ca_system_score_codex":0.00008439492,"about_ca_system_score_gemma":0.0001500568,"threshold_uncertainty_score":0.99989945},"labels":[],"label_agreement":null},{"id":"W2129460458","doi":"10.1109/infcom.2009.5061949","title":"Layered Multicast with Inter-Layer Network Coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multicast; Computer science; Computer network; Linear network coding; Source-specific multicast; Pragmatic General Multicast; Xcast; Protocol Independent Multicast; Distributed computing; Multicast address; Distance Vector Multicast Routing Protocol; IP multicast; Reliable multicast","score_opus":0.04727612964586093,"score_gpt":0.2871906357101646,"score_spread":0.2399145060643037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129460458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035188391,0.0001201701,0.9608361,0.0035341945,0.00008601741,0.00011283412,8.791855e-8,0.0002760863,0.031515628],"genre_scores_gemma":[0.92167443,0.00007501238,0.074835815,0.0025769805,0.00006671429,0.000003918865,6.317516e-7,0.0000041138615,0.00076240103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991839,0.00007084617,0.00015403885,0.0002282833,0.00011377692,0.00024917102],"domain_scores_gemma":[0.99906534,0.00007637011,0.00004367524,0.00063950167,0.00009253551,0.00008258304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019021372,0.00011228243,0.00012436346,0.000037087924,0.0001994567,0.00019223076,0.0007645917,0.000026118962,0.00007495294],"category_scores_gemma":[0.0000137163,0.00008283177,0.00002853851,0.0004231323,0.000022356731,0.0003139822,0.00018490171,0.00013496383,0.000060958762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022015325,0.000091694186,0.0024917393,0.0000021739422,0.000023135906,0.000015976259,0.00082041766,0.0019658967,0.0012134687,0.56335855,0.012495515,0.4174994],"study_design_scores_gemma":[0.0011507792,0.00042410794,0.016412055,0.00015828562,0.0000068824347,0.000048438535,0.000050257662,0.93944365,0.0020324201,0.0013400798,0.038327947,0.00060512905],"about_ca_topic_score_codex":0.0000014902495,"about_ca_topic_score_gemma":0.000043265045,"teacher_disagreement_score":0.9374777,"about_ca_system_score_codex":0.000023991928,"about_ca_system_score_gemma":0.000022398774,"threshold_uncertainty_score":0.33777815},"labels":[],"label_agreement":null},{"id":"W2129559363","doi":"10.1155/2010/403936","title":"Superimposed Training-Based Joint CFO and Channel Estimation for CP-OFDM Modulated Two-Way Relay Networks","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Deutsche Forschungsgemeinschaft","keywords":"Estimator; Carrier frequency offset; Computer science; Joint (building); Mean squared error; Algorithm; Minimum mean square error; Relay; Channel (broadcasting); Orthogonal frequency-division multiplexing; Frequency offset; Estimation; Statistics; Telecommunications; Mathematics","score_opus":0.07578830487838042,"score_gpt":0.3039097662474574,"score_spread":0.228121461369077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129559363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1273969,0.0038496123,0.8588317,0.007747248,0.0009310616,0.00057682575,0.0000029664193,0.0002064699,0.000457244],"genre_scores_gemma":[0.952288,0.0048856386,0.041633844,0.0007740709,0.00028001796,0.000056583365,0.000025513591,0.000036387704,0.000019970179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978864,0.00044391875,0.00064963807,0.00036880787,0.00020516731,0.00044607188],"domain_scores_gemma":[0.9965794,0.00097076007,0.00040983452,0.0014769811,0.00028744858,0.0002755772],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017482858,0.00030068474,0.000377071,0.00023591313,0.0022822246,0.0007661272,0.0013032692,0.00013953676,0.000004954791],"category_scores_gemma":[0.00006192592,0.00028118092,0.00011077491,0.0005011787,0.00022385422,0.00046244878,0.00044558189,0.0012754347,0.0000013400253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049637893,0.00016384097,0.00025653248,0.000011869564,0.000070545764,0.000004191029,0.0020181732,0.041945368,0.0036028887,0.030075265,0.0002027845,0.9215989],"study_design_scores_gemma":[0.0012688818,0.0001746995,0.0012303153,0.00024905064,0.000019674691,0.000101536156,0.000040042374,0.9898592,0.000090686626,0.0007775253,0.0058624744,0.00032591214],"about_ca_topic_score_codex":0.00000371236,"about_ca_topic_score_gemma":0.000075042546,"teacher_disagreement_score":0.9479138,"about_ca_system_score_codex":0.000046531808,"about_ca_system_score_gemma":0.000086411645,"threshold_uncertainty_score":0.99996406},"labels":[],"label_agreement":null},{"id":"W2129564636","doi":"10.1109/twc.2013.092413.121328","title":"Diversity and Delay Analysis of Buffer-Aided BICM-OFDM Relaying","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise error probability; Orthogonal frequency-division multiplexing; Diversity gain; Relay; Computer science; Diversity scheme; Multiplexing; Upper and lower bounds; Cooperative diversity; Maximal-ratio combining; Wireless; Algorithm; Bit error rate; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Fading; Wireless network; Channel (broadcasting); Physics","score_opus":0.05453406457256862,"score_gpt":0.2758905417239244,"score_spread":0.22135647715135578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129564636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25063053,0.0002860751,0.7465115,0.0016586094,0.000058928614,0.00020971584,0.0000067503424,0.000120856355,0.00051702774],"genre_scores_gemma":[0.9843064,0.0039436994,0.011340542,0.00019186678,0.0000028212892,0.00006917297,0.000004546826,0.000008248684,0.00013272782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986128,0.00036786927,0.00036499382,0.00026922792,0.00020250848,0.00018257732],"domain_scores_gemma":[0.9959144,0.000704218,0.00015221718,0.0028139937,0.00030053745,0.00011462385],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00027326396,0.00015516956,0.00030188085,0.0005490782,0.0030064138,0.00007051092,0.00210037,0.000076282355,0.000060587987],"category_scores_gemma":[0.000008687284,0.00015942758,0.00015988013,0.0020607747,0.00024664594,0.0005843065,0.00031903907,0.00035452135,0.00001722902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032480017,0.0026647924,0.011701215,0.00005561427,0.0046912483,0.0000029118041,0.045459095,0.030043732,0.015637107,0.12552603,0.00042971486,0.7637561],"study_design_scores_gemma":[0.00047254082,0.00007656246,0.023166202,0.000060310238,0.0004244123,0.000005252349,0.00023746036,0.97226787,0.002157618,0.00039083525,0.00036356677,0.00037739702],"about_ca_topic_score_codex":0.0003104377,"about_ca_topic_score_gemma":0.00050987303,"teacher_disagreement_score":0.9422241,"about_ca_system_score_codex":0.000059132366,"about_ca_system_score_gemma":0.000030900053,"threshold_uncertainty_score":0.99829155},"labels":[],"label_agreement":null},{"id":"W2129621924","doi":"10.1109/twc.2010.110510.091591","title":"Cooperative Transmission with Constant Envelope Modulations and Phase-Only Forward Relays","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rayleigh fading; Fading; Relay; Computer science; Transmission (telecommunications); Antenna (radio); Modulation (music); Envelope (radar); Telecommunications; Electronic engineering; Phase-shift keying; Topology (electrical circuits); Decoding methods; Control theory (sociology); Bit error rate; Physics; Acoustics; Electrical engineering; Engineering; Radar","score_opus":0.030980994907014017,"score_gpt":0.2895231416869317,"score_spread":0.2585421467799177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129621924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023413341,0.00019256333,0.9656438,0.006850097,0.00013050475,0.00068053196,0.000029080687,0.0003168987,0.0027431608],"genre_scores_gemma":[0.9234943,0.0029950205,0.072636,0.00030361625,0.00001084681,0.00025569845,0.000016087808,0.000026694988,0.00026174771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983151,0.00028462126,0.00041635515,0.0004453232,0.0002517889,0.00028682515],"domain_scores_gemma":[0.9959553,0.00057546835,0.00012467042,0.0027314054,0.0003706902,0.000242457],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002985459,0.00028711383,0.00027787843,0.00025062278,0.0020040376,0.00025713167,0.0016756029,0.0001292218,0.00006615559],"category_scores_gemma":[0.000007668666,0.00025259118,0.00007411638,0.00091911556,0.0005459358,0.00074089365,0.00003176508,0.0010848935,0.000025561983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005971595,0.001221244,0.00005666872,0.000010780027,0.00012488475,0.0000028698098,0.0040274784,0.0014244034,0.03034799,0.22265404,0.00012387978,0.73994607],"study_design_scores_gemma":[0.005215154,0.00081019953,0.00061779167,0.0003097891,0.00012139291,0.0002617157,0.00039604824,0.9179147,0.021728063,0.0011140184,0.050178666,0.0013324486],"about_ca_topic_score_codex":0.00001688922,"about_ca_topic_score_gemma":0.000866953,"teacher_disagreement_score":0.9164903,"about_ca_system_score_codex":0.000047738937,"about_ca_system_score_gemma":0.00029573857,"threshold_uncertainty_score":0.9999926},"labels":[],"label_agreement":null},{"id":"W2129713744","doi":"10.1109/glocom.2007.653","title":"Relay Selection and Distributed BLAST in Multi-Antenna Cooperative Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Transmission (telecommunications); Multiplexing; Computer network; Cooperative diversity; Scheme (mathematics); Antenna (radio); Outage probability; Telecommunications; Wireless; Wireless network; Fading; Mathematics; Artificial intelligence","score_opus":0.03318819367326564,"score_gpt":0.2880475560529768,"score_spread":0.2548593623797112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129713744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029415792,0.00023482705,0.96927166,0.00038147828,0.00009180274,0.00013236937,3.604155e-7,0.00010229764,0.00036944103],"genre_scores_gemma":[0.9851201,0.00036682657,0.013991718,0.0002736541,0.000018405197,0.0000056624026,0.000005414003,0.0000043184746,0.00021388983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991457,0.000101757425,0.00021435219,0.00023987035,0.00007122749,0.00022708629],"domain_scores_gemma":[0.9993989,0.00015142772,0.000039288876,0.00021281136,0.00012555625,0.00007203766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005646903,0.00010094098,0.00011143677,0.00008706448,0.00016692077,0.00010178128,0.00026593028,0.00005460139,0.00001513316],"category_scores_gemma":[0.000054969198,0.000088589004,0.000015702053,0.0008592896,0.00003415822,0.0002998307,0.00022692731,0.00022528552,0.0000061667756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014844174,0.0010526432,0.19061646,0.000015690488,0.000102698934,0.00006808586,0.0061728004,0.07187293,0.016406624,0.40900335,0.003423681,0.3011166],"study_design_scores_gemma":[0.00041422565,0.00003658035,0.061572064,0.000016462716,9.2593353e-7,0.000007597985,0.000051192063,0.9367335,0.00024496173,0.000007298933,0.00079948374,0.000115736686],"about_ca_topic_score_codex":0.000015637157,"about_ca_topic_score_gemma":0.0026521012,"teacher_disagreement_score":0.95570433,"about_ca_system_score_codex":0.00005813673,"about_ca_system_score_gemma":0.000019372159,"threshold_uncertainty_score":0.36125547},"labels":[],"label_agreement":null},{"id":"W2129871822","doi":"10.1109/ccece.2011.6030493","title":"Cooperative inter-vehicular communications in highway traffic","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise error probability; Relay; Fading; Computer science; Channel (broadcasting); Cooperative diversity; Computer network; Monte Carlo method; Antenna diversity; Topology (electrical circuits); Wireless; Telecommunications; Mathematics; Statistics; Engineering; Power (physics); Electrical engineering; Physics","score_opus":0.09968109644358636,"score_gpt":0.2982189458942212,"score_spread":0.19853784945063485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129871822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0640042,0.0021613222,0.66930574,0.008217225,0.0003664006,0.0007868469,0.0000016667085,0.00093542226,0.25422117],"genre_scores_gemma":[0.95475817,0.0005951826,0.04336851,0.0006336139,0.0000065567165,0.000042991687,0.0000031867671,0.0000056921563,0.00058607623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989606,0.0003013435,0.00025609892,0.00022473592,0.00008031626,0.00017687905],"domain_scores_gemma":[0.997948,0.00009774246,0.000042836546,0.0017255954,0.0001238457,0.00006198707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032369434,0.000110445406,0.00013445369,0.00012907457,0.00015517054,0.00007187908,0.002444403,0.000040827454,0.00017321696],"category_scores_gemma":[0.00003103442,0.00009676957,0.000038724822,0.00065638404,0.00009778612,0.00044297212,0.00090675394,0.00023076315,0.00014407857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004435568,0.00038863416,0.00049021345,0.0000024094822,0.000018984565,0.000006411182,0.012593224,0.00011649756,0.0003925569,0.82353497,0.0014141354,0.16103752],"study_design_scores_gemma":[0.0013260959,0.00018895284,0.014287564,0.00012503151,0.0000069241255,0.000021700984,0.0006699337,0.90534824,0.0036474492,0.0012577546,0.07231574,0.00080464105],"about_ca_topic_score_codex":0.000017460346,"about_ca_topic_score_gemma":0.0008456309,"teacher_disagreement_score":0.9052317,"about_ca_system_score_codex":0.00004684543,"about_ca_system_score_gemma":0.000049275066,"threshold_uncertainty_score":0.45423496},"labels":[],"label_agreement":null},{"id":"W2130325251","doi":"10.1109/lcomm.2012.072012.120989","title":"BER Analysis of Three-Phase XOR-and-Forward Relaying Using Alamouti STBC","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Space–time block code; Relay; Rayleigh fading; Computer science; Block code; Bit error rate; Phase-shift keying; Bitwise operation; Algorithm; Channel (broadcasting); Transmit diversity; Relay channel; Decoding methods; Fading; Telecommunications; Physics","score_opus":0.11645400058538272,"score_gpt":0.35553385086152733,"score_spread":0.23907985027614462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130325251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36728048,0.0025943203,0.62387544,0.005394938,0.00012762877,0.00016009087,0.0000050509034,0.00008576672,0.00047625753],"genre_scores_gemma":[0.91789865,0.000605913,0.08027109,0.0011496221,0.000023671015,0.000017150904,0.000012935126,0.000010536246,0.0000104561],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853206,0.0003510802,0.00044016316,0.00019653125,0.00019380018,0.00028638012],"domain_scores_gemma":[0.9956327,0.00041893453,0.00024542448,0.0034585958,0.0001238374,0.000120528675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007544926,0.00015354234,0.00030559703,0.0004600167,0.00050407765,0.000086015556,0.0021527603,0.00005061549,0.000016434415],"category_scores_gemma":[0.000048081918,0.00015712487,0.00014846344,0.0018183453,0.00023890349,0.0007183495,0.0009844803,0.00026720777,0.000007713234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003153762,0.0018373491,0.19843568,0.000052959633,0.004992265,0.0000026163784,0.024211904,0.009552839,0.30839813,0.19627124,0.0037297895,0.2524837],"study_design_scores_gemma":[0.00072731025,0.000027103695,0.022881187,0.00006485283,0.0007673878,0.000009062726,0.00011452599,0.9640839,0.0017482067,0.00008526249,0.008994832,0.00049634674],"about_ca_topic_score_codex":0.000043042866,"about_ca_topic_score_gemma":0.00008345122,"teacher_disagreement_score":0.9545311,"about_ca_system_score_codex":0.000076240874,"about_ca_system_score_gemma":0.000027200867,"threshold_uncertainty_score":0.6407366},"labels":[],"label_agreement":null},{"id":"W2130355676","doi":"10.1109/acssc.2008.5074794","title":"Diversity-Fidelity Tradeoff in transmission of analog sources over MIMO fading channels","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fading; MIMO; Computer science; Multiplexing; Channel (broadcasting); MIMO-OFDM; Spatial multiplexing; Coding (social sciences); Transmission (telecommunications); Electronic engineering; Algorithm; Telecommunications; Mathematics; Engineering; Statistics","score_opus":0.06326804087088128,"score_gpt":0.27067436192283195,"score_spread":0.20740632105195067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130355676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6695722,0.00042665852,0.32651344,0.0005785251,0.000049266324,0.000077767705,2.4660636e-7,0.00004983214,0.0027320867],"genre_scores_gemma":[0.99498713,0.0007458541,0.003860938,0.00018958887,0.000010774468,0.0000011812396,6.711399e-7,0.0000021835317,0.00020170715],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991958,0.000114687,0.00020227673,0.00018427828,0.0001610611,0.0001418897],"domain_scores_gemma":[0.9994605,0.00008831592,0.000048231785,0.0003060869,0.000042028845,0.00005480734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025565285,0.00007786692,0.00014703094,0.00012840256,0.0003882287,0.000011557161,0.0006981499,0.00003717683,0.0000718976],"category_scores_gemma":[0.000011267074,0.00006905547,0.00005523913,0.00050723995,0.000050173487,0.0003124362,0.00057471334,0.00011284975,0.0000025146987],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008224171,0.0011708334,0.37145212,0.00009354111,0.00009100625,0.00008037417,0.20373698,0.013010526,0.023970097,0.10423817,0.0039549703,0.27811915],"study_design_scores_gemma":[0.0017539682,0.00015050448,0.39449862,0.00016689031,0.000007036498,0.000019581612,0.00020656848,0.57395536,0.017444609,0.0016262527,0.009606386,0.0005642303],"about_ca_topic_score_codex":0.0000754587,"about_ca_topic_score_gemma":0.00003897492,"teacher_disagreement_score":0.5609448,"about_ca_system_score_codex":0.00002349056,"about_ca_system_score_gemma":0.000023164306,"threshold_uncertainty_score":0.29859808},"labels":[],"label_agreement":null},{"id":"W2130371801","doi":"10.1109/lcomm.2010.111910.101902","title":"Performance Analysis of Wireless Systems from the MGF of the Reciprocal of the Signal-to-Noise Ratio","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reciprocal; Fading; Bit error rate; Wireless; Signal-to-noise ratio (imaging); Computer science; Moment-generating function; Probability of error; Algorithm; Mathematics; Applied mathematics; Topology (electrical circuits); Probability density function; Telecommunications; Statistics; Combinatorics; Decoding methods","score_opus":0.03266951009892366,"score_gpt":0.26018275821849657,"score_spread":0.2275132481195729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130371801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9484919,0.00020416094,0.030769145,0.019546434,0.00031930584,0.00038620803,0.000018708677,0.000017810413,0.0002463438],"genre_scores_gemma":[0.99709326,0.00016857675,0.0016085446,0.0010222475,0.000020569883,0.000048278842,0.0000039819597,0.0000061866604,0.000028334043],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818087,0.00071344484,0.0005225167,0.00015615243,0.0003069208,0.00012012361],"domain_scores_gemma":[0.99151623,0.0010217418,0.0004519355,0.006681333,0.0002986342,0.000030147301],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006873173,0.00011045732,0.0002520074,0.00009206663,0.00046230401,0.000048152542,0.008708681,0.00004244317,0.000007345831],"category_scores_gemma":[0.00005947433,0.00006203978,0.00018638397,0.0023300194,0.0004900803,0.00014485093,0.0012632511,0.0004096061,0.0000025155216],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010844686,0.00017942302,0.05316939,0.000015964513,0.00055572524,3.9601638e-8,0.009227031,0.031150449,0.87317747,0.016758265,0.0027912683,0.012964152],"study_design_scores_gemma":[0.00019919219,0.000017466078,0.18327437,0.00015904295,0.00023133989,8.538906e-7,0.00015788598,0.7783405,0.034303036,0.000019268145,0.0031291188,0.00016788956],"about_ca_topic_score_codex":0.00017848218,"about_ca_topic_score_gemma":0.0006620761,"teacher_disagreement_score":0.8388744,"about_ca_system_score_codex":0.000024051726,"about_ca_system_score_gemma":0.00007932846,"threshold_uncertainty_score":0.9966547},"labels":[],"label_agreement":null},{"id":"W2130510313","doi":"10.1109/glocom.2008.ecp.704","title":"Cooperative OFDM Channel Estimation with Frequency Offsets","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Pairwise error probability; Algorithm; Channel (broadcasting); Frequency offset; Mathematics; Relay; Topology (electrical circuits); Computer science; Carrier frequency offset; Multiplexing; Statistics; Electronic engineering; Telecommunications; Power (physics); Physics; Combinatorics; Engineering; Fading","score_opus":0.04325347603580785,"score_gpt":0.2618816673853291,"score_spread":0.21862819134952124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130510313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008591144,0.00016906668,0.9618364,0.0019919309,0.00005758487,0.00015203295,4.0672862e-7,0.00021602225,0.026985392],"genre_scores_gemma":[0.9010672,0.0002168647,0.0969909,0.00068165344,0.000016926931,0.000022754404,0.0000052591945,0.000005013474,0.0009934169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927074,0.00007722176,0.00013613913,0.00021308016,0.00015829288,0.00014454883],"domain_scores_gemma":[0.99911916,0.000054193926,0.000045378114,0.00049845356,0.00021890944,0.000063908716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009919193,0.00010472755,0.00010491371,0.000061255065,0.00038748683,0.000055242002,0.0005070307,0.000026042862,0.000067271496],"category_scores_gemma":[0.000023652816,0.00007684276,0.000018196935,0.0004738375,0.000067065404,0.0006093528,0.00012719707,0.0001029518,0.000106019965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019433675,0.00035495797,0.0017887878,0.000010475975,0.00007451529,0.000067020585,0.012268658,0.0063413563,0.0017573423,0.8718774,0.014158234,0.091281824],"study_design_scores_gemma":[0.0006378118,0.00024206065,0.008165402,0.000038512284,0.000003090487,0.00014347865,0.000039792278,0.98480004,0.0033337162,0.0009537871,0.0012928378,0.00034944495],"about_ca_topic_score_codex":0.000011763406,"about_ca_topic_score_gemma":0.000051917254,"teacher_disagreement_score":0.9784587,"about_ca_system_score_codex":0.000031495823,"about_ca_system_score_gemma":0.000092039576,"threshold_uncertainty_score":0.31335568},"labels":[],"label_agreement":null},{"id":"W2130527451","doi":"10.1109/icme.2009.5202768","title":"Optimal resource allocation for video communication over distributed systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless ad hoc network; Distributed computing; Computer network; Optimization problem; Resource allocation; Wireless sensor network; Wireless Routing Protocol; Wireless; Routing (electronic design automation); Routing protocol","score_opus":0.03391522222914118,"score_gpt":0.2886163918182279,"score_spread":0.25470116958908673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130527451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019155522,0.00081888493,0.98751146,0.0059750592,0.000048996462,0.00037388082,0.000002851701,0.00024904672,0.003104275],"genre_scores_gemma":[0.9595682,0.00011070333,0.03858208,0.0010474893,0.00003418227,0.000050390176,0.00009337647,0.000004680214,0.00050888007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912715,0.00014226673,0.00024063942,0.00020139065,0.0001263329,0.00016220569],"domain_scores_gemma":[0.9983428,0.00019698997,0.00009597168,0.0011220173,0.0001845468,0.00005765279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045175554,0.0000960501,0.00011348107,0.00005024662,0.00031042044,0.00027209963,0.0010886806,0.000038154107,0.000007955957],"category_scores_gemma":[0.0000673182,0.00008950476,0.00004425404,0.0003169106,0.00002031952,0.00039308894,0.00015187671,0.000087475404,0.000010598245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014011492,0.000090481706,0.000035768935,0.0000052529967,0.000012310144,2.0060166e-7,0.0003575276,0.012138833,0.0010462491,0.90515435,0.048301943,0.03284309],"study_design_scores_gemma":[0.0003475628,0.000065458386,0.001406191,0.000028324082,0.000003557443,0.0000029827463,0.000035523397,0.78191286,0.00028550124,0.00033105127,0.21544282,0.00013815946],"about_ca_topic_score_codex":0.000004663176,"about_ca_topic_score_gemma":0.0000053339727,"teacher_disagreement_score":0.9576527,"about_ca_system_score_codex":0.00006800202,"about_ca_system_score_gemma":0.000028481803,"threshold_uncertainty_score":0.36498982},"labels":[],"label_agreement":null},{"id":"W2130581765","doi":"10.1109/tit.2010.2059630","title":"On the Limitations of the Naive Lattice Decoding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Multiplexing; Fading; MIMO; Upper and lower bounds; Lattice (music); Mathematics; Algorithm; Diversity gain; Maximum likelihood; Computer science; Topology (electrical circuits); Discrete mathematics; Telecommunications; Combinatorics; Statistics; Physics; Channel (broadcasting); Mathematical analysis","score_opus":0.0385577405410906,"score_gpt":0.25083432302036807,"score_spread":0.21227658247927747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130581765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013805512,0.000004904951,0.9643574,0.0031409564,0.0008338652,0.00022017573,0.0000050610247,0.00006617421,0.017565958],"genre_scores_gemma":[0.99609697,0.000073386254,0.0015713095,0.0020287978,0.000009448872,0.000040687773,5.429e-7,0.0000032587557,0.00017558681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991865,0.00019993728,0.00025038669,0.0000677986,0.0001951509,0.00010021894],"domain_scores_gemma":[0.99687195,0.0020010474,0.00013997716,0.00078552146,0.00017300042,0.000028512583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064953556,0.00008444647,0.00006335243,0.0001007406,0.00070280756,0.00009669212,0.0008959126,0.000042721847,0.00007439978],"category_scores_gemma":[0.00013336932,0.00005084605,0.00008494693,0.00047260022,0.000109226945,0.000748554,0.000007937153,0.00043897034,0.00012180666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070739347,0.000027572676,8.181675e-7,0.0000015312593,0.000011647576,1.4705697e-8,0.0031701915,0.003105182,0.000369532,0.8634842,0.00018605837,0.12963618],"study_design_scores_gemma":[0.0018630747,0.00036234985,0.002210223,0.00028519955,0.00009389582,0.000034489174,0.003390404,0.5182876,0.23025036,0.17624249,0.0659969,0.0009830398],"about_ca_topic_score_codex":9.840893e-7,"about_ca_topic_score_gemma":0.00001809622,"teacher_disagreement_score":0.98229146,"about_ca_system_score_codex":0.000019838331,"about_ca_system_score_gemma":0.0000553221,"threshold_uncertainty_score":0.5405499},"labels":[],"label_agreement":null},{"id":"W2130788090","doi":"10.1109/icc.2006.255350","title":"Distributed Space-Time Block Coded OFDM for Relay-Assisted Transmission","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orthogonal frequency-division multiplexing; Relay; Space–time block code; Computer science; Fading; Multipath propagation; Interleaving; Block code; Antenna diversity; Relay channel; Electronic engineering; Transmission (telecommunications); Diversity scheme; Diversity gain; Multiplexing; Telecommunications; Decoding methods; Channel (broadcasting); Wireless; Engineering; Power (physics); Physics","score_opus":0.09538596805359514,"score_gpt":0.33776628548171894,"score_spread":0.2423803174281238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130788090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019038719,0.0003070326,0.87505263,0.065127544,0.0004016679,0.00074467994,0.00028464754,0.00048352306,0.0556944],"genre_scores_gemma":[0.92639065,0.00071421306,0.06626273,0.0004205472,0.00008998877,0.00024105266,0.0008336765,0.000021523896,0.0050256094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982273,0.00024216018,0.00052494614,0.00038796183,0.00034670555,0.00027095233],"domain_scores_gemma":[0.9961985,0.00050288823,0.00024106652,0.002064459,0.0008953388,0.00009775372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003441115,0.0002352931,0.00023276205,0.00019536559,0.00062529166,0.00033553515,0.004087936,0.000110273824,0.0001154984],"category_scores_gemma":[0.00006255562,0.00023665039,0.00015329738,0.00041496276,0.00014475711,0.00035029816,0.0003239721,0.00032039973,0.00014613419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046410496,0.000773052,0.00006375,0.0000059747376,0.00006792946,0.0000012908309,0.00015391028,0.0016874953,0.029573308,0.9010324,0.040908813,0.025685672],"study_design_scores_gemma":[0.000984459,0.00008519981,0.0011810211,0.00012510939,0.000015209821,0.0000104114315,0.00001537582,0.785452,0.0024950437,0.0052387514,0.20404446,0.0003529336],"about_ca_topic_score_codex":0.000038882652,"about_ca_topic_score_gemma":0.00010968638,"teacher_disagreement_score":0.9244868,"about_ca_system_score_codex":0.00017108949,"about_ca_system_score_gemma":0.00016142087,"threshold_uncertainty_score":0.9650323},"labels":[],"label_agreement":null},{"id":"W2130885995","doi":"10.1109/glocom.2010.5683464","title":"Resource Allocation and Scheduling in Multi-Cell OFDMA Decode-and-Forward Relaying Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Orthogonal frequency-division multiple access; Subcarrier; Mathematical optimization; Scheduling (production processes); Optimization problem; Relay; Resource allocation; Frequency-division multiple access; Convex optimization; Orthogonal frequency-division multiplexing; Base station; Power (physics); Algorithm; Computer network; Regular polygon; Mathematics","score_opus":0.0284432962349636,"score_gpt":0.27187930368612867,"score_spread":0.24343600745116506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130885995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30341032,0.0010626637,0.6918693,0.0020613193,0.00008574749,0.00012364479,6.163676e-8,0.00008822487,0.0012986807],"genre_scores_gemma":[0.8820379,0.0009877083,0.1161856,0.00046766782,0.000021201022,0.000012616503,0.0000010241549,0.000006164082,0.00028014253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992053,0.00007972483,0.00019681669,0.00027231703,0.000073072544,0.00017278118],"domain_scores_gemma":[0.99925953,0.00017015434,0.000053243286,0.00038826923,0.00004880645,0.000079973135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000573337,0.000097183365,0.0001055698,0.0000891307,0.00018721103,0.00016566507,0.00037024135,0.00007566919,0.000011868646],"category_scores_gemma":[0.00005607391,0.000091278256,0.000015037919,0.00027599037,0.00004074564,0.00030060337,0.0004683435,0.0003806301,0.000003243807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010761751,0.00014980664,0.048824053,0.000019088153,0.000011770148,0.0000036147587,0.0031666593,0.01373088,0.014236928,0.09906492,0.00016219991,0.82061934],"study_design_scores_gemma":[0.00039177414,0.000008852452,0.008219101,0.000023174549,0.0000016504258,0.00000353577,0.00004984643,0.988644,0.00034732866,0.000038184764,0.002151013,0.000121536184],"about_ca_topic_score_codex":0.000014107366,"about_ca_topic_score_gemma":0.0004225911,"teacher_disagreement_score":0.9749131,"about_ca_system_score_codex":0.00001115976,"about_ca_system_score_gemma":0.00001762081,"threshold_uncertainty_score":0.37222192},"labels":[],"label_agreement":null},{"id":"W2130888004","doi":"10.1109/twc.2010.071410.090974","title":"An Accurate Approximation to the Average Error Probability of Cooperative Diversity in Nakagami-m Fading","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Nakagami distribution; Independent and identically distributed random variables; Diversity combining; Mathematics; Signal-to-noise ratio (imaging); Upper and lower bounds; Statistics; Algorithm; Applied mathematics; Telecommunications; Computer science; Random variable; Mathematical analysis; Decoding methods","score_opus":0.07544720649076446,"score_gpt":0.3127027800356767,"score_spread":0.23725557354491222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130888004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23574394,0.0000146276925,0.7591313,0.0037416113,0.00017686366,0.00065804063,0.00001655824,0.00009428686,0.0004227502],"genre_scores_gemma":[0.9841813,0.00013450357,0.015181748,0.00025093905,0.000008714438,0.00018722448,0.0000066673088,0.000009422164,0.000039495044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813616,0.00070071634,0.00041065153,0.00031981582,0.00022745792,0.00020522183],"domain_scores_gemma":[0.99517864,0.00047538267,0.00013277805,0.0037594147,0.00035051696,0.000103291466],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00088420504,0.00016671875,0.0002057831,0.00021577837,0.0013982311,0.00011177966,0.003920904,0.000081178914,0.000026031395],"category_scores_gemma":[0.000029972973,0.00014441898,0.00007284728,0.001342248,0.00020939302,0.00075236766,0.00013041445,0.000810413,0.000017649476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009700605,0.004243255,0.0009866048,0.00004009777,0.000101280195,0.0000012780483,0.071962595,0.3457397,0.06403727,0.20566061,0.00010762024,0.30702266],"study_design_scores_gemma":[0.0005282924,0.0001444652,0.005423089,0.00006707958,0.000013174038,0.0000039238444,0.0003374822,0.9756548,0.016190622,0.00062861026,0.0006692171,0.00033925637],"about_ca_topic_score_codex":0.00010133144,"about_ca_topic_score_gemma":0.008647059,"teacher_disagreement_score":0.74843735,"about_ca_system_score_codex":0.000086868444,"about_ca_system_score_gemma":0.00010277929,"threshold_uncertainty_score":0.99990183},"labels":[],"label_agreement":null},{"id":"W2130994857","doi":"10.1109/icc.2009.5199262","title":"On the Performance of Amplify-and-Forward Cooperative Diversity with the Nth Best-Relay Selection Scheme","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Relay; Expression (computer science); Cooperative diversity; Selection (genetic algorithm); Computer science; Function (biology); Signal-to-noise ratio (imaging); Topology (electrical circuits); Node (physics); Maximal-ratio combining; Closed-form expression; Algorithm; Channel (broadcasting); Wireless; Mathematics; Artificial intelligence; Telecommunications; Wireless network; Combinatorics; Fading; Engineering; Physics; Biology","score_opus":0.026027136426742665,"score_gpt":0.24148197869622434,"score_spread":0.21545484226948167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130994857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9191597,0.000075763164,0.06496178,0.009510462,0.000020593528,0.00021176397,3.096722e-7,0.00004492161,0.0060146977],"genre_scores_gemma":[0.9960729,0.00023758116,0.001392019,0.0016775766,0.0000092985965,0.0000036815231,3.594005e-7,0.0000016057688,0.0006049957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941623,0.00010561143,0.00007803644,0.00013966195,0.00015698027,0.00010346233],"domain_scores_gemma":[0.9992596,0.00018289899,0.00005156174,0.00033176734,0.0001492796,0.000024909268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028566114,0.0000829528,0.00007998183,0.000025059173,0.00088160386,0.00006010112,0.0005647415,0.00002088495,0.00002826587],"category_scores_gemma":[0.000015612295,0.00003785791,0.000015795813,0.00038121053,0.00008883124,0.00020571801,0.0002721228,0.00018872101,0.000008510942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074697775,0.00015758396,0.004073483,0.0000034336429,0.000052270287,3.347502e-7,0.0046900655,0.0035270862,0.0012345021,0.9474382,0.0040394776,0.034708858],"study_design_scores_gemma":[0.0009197636,0.0033755132,0.03918836,0.00010836245,0.000024160481,0.000016483045,0.00047720544,0.9337193,0.016485453,0.00023165676,0.005027077,0.0004266705],"about_ca_topic_score_codex":0.000006194388,"about_ca_topic_score_gemma":0.000036880578,"teacher_disagreement_score":0.94720656,"about_ca_system_score_codex":0.000019277906,"about_ca_system_score_gemma":0.000026362113,"threshold_uncertainty_score":0.6780673},"labels":[],"label_agreement":null},{"id":"W2130996137","doi":"10.1109/cce.2008.4578972","title":"On constellation permutations in decode-and-forward relay communications","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Saskatchewan","funders":"","keywords":"Relay; Phase-shift keying; Rayleigh fading; Constellation; Computer science; Permutation (music); Bit error rate; Quadrature amplitude modulation; Algorithm; QAM; Upper and lower bounds; Fading; Probability of error; Telecommunications; Electronic engineering; Mathematics; Decoding methods; Engineering; Physics","score_opus":0.06743113952369592,"score_gpt":0.3047132314958244,"score_spread":0.2372820919721285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130996137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15106587,0.00096891786,0.57660466,0.013853931,0.000116521245,0.00044613468,0.0000014353786,0.00032763163,0.2566149],"genre_scores_gemma":[0.9721623,0.0021489216,0.024531582,0.0007738763,0.0000041860812,0.000009464858,0.0000050382614,0.0000036382364,0.00036097976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929273,0.0001529078,0.00019647252,0.00016131657,0.00009214492,0.00010445484],"domain_scores_gemma":[0.99847263,0.00047483185,0.000039783616,0.0009032933,0.00006124885,0.000048193324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018405364,0.00007130764,0.000086914704,0.00014209386,0.00036238585,0.000039986036,0.00059362105,0.000031839423,0.000034696826],"category_scores_gemma":[0.000055851106,0.000068074994,0.000020853466,0.00041926993,0.000106514635,0.00025122514,0.00030422068,0.00015295343,0.00005479785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018718154,0.00006637089,0.005557181,9.824524e-7,0.000004319714,0.0000016964339,0.001886345,0.0014504051,0.0000673102,0.97226316,0.000978302,0.017722035],"study_design_scores_gemma":[0.0006574909,0.00006393631,0.046875603,0.000037580776,0.0000024585922,0.000050698265,0.000087030305,0.93758214,0.0001315202,0.0044251215,0.009829647,0.00025675172],"about_ca_topic_score_codex":0.000007202763,"about_ca_topic_score_gemma":0.000120482066,"teacher_disagreement_score":0.96783805,"about_ca_system_score_codex":0.000038558846,"about_ca_system_score_gemma":0.00004699174,"threshold_uncertainty_score":0.27872154},"labels":[],"label_agreement":null},{"id":"W2131192130","doi":"10.1109/icdcsw.2009.33","title":"Approximate BER Expressions of Distributed Alamouti's Code in Two-Hop Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bit error rate; Computer science; Code (set theory); Hop (telecommunications); Algorithm; Signal-to-noise ratio (imaging); Channel (broadcasting); Range (aeronautics); Cooperative diversity; Theoretical computer science; Telecommunications; Fading; Engineering","score_opus":0.038915650455191846,"score_gpt":0.31154854455427994,"score_spread":0.2726328940990881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131192130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020504883,0.00062153436,0.9626313,0.0015310303,0.00012454667,0.00026694548,0.0000073010187,0.00015883357,0.014153612],"genre_scores_gemma":[0.99347705,0.00010697304,0.006010685,0.00012484108,0.000011072143,0.000010484551,0.000008878257,0.000002513639,0.0002475268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909616,0.00013533965,0.00028818817,0.00018148097,0.00013007321,0.00016874024],"domain_scores_gemma":[0.9990282,0.000082083585,0.000074714255,0.00067558646,0.000085274856,0.00005412764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002532966,0.00008723758,0.00016622414,0.00007184609,0.00006793804,0.000061235885,0.0007557795,0.000023988649,0.000019118],"category_scores_gemma":[0.000030418247,0.00007058811,0.000030863568,0.0004959655,0.000023316892,0.00021333441,0.00021391774,0.00010460774,0.0000068622776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113189735,0.00041814128,0.002312954,0.000014380301,0.000012744549,0.0000069033517,0.0015495934,0.0094764,0.028875597,0.9260238,0.0052758018,0.026022362],"study_design_scores_gemma":[0.00091734395,0.000046823006,0.008709035,0.00019368264,0.0000028874842,0.0000062143486,0.0001174384,0.97849965,0.0049931672,0.00096645457,0.0052945707,0.00025273522],"about_ca_topic_score_codex":0.000014549369,"about_ca_topic_score_gemma":0.000040252005,"teacher_disagreement_score":0.97297215,"about_ca_system_score_codex":0.000031716158,"about_ca_system_score_gemma":0.000028787468,"threshold_uncertainty_score":0.28784993},"labels":[],"label_agreement":null},{"id":"W2131515251","doi":"10.1109/icassp.2006.1660903","title":"An adaptive protocol for cooperative communications achieving asymptotic minimum symbol-error-rate","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Protocol (science); Transmission (telecommunications); Transmitter power output; Power (physics); Cooperative diversity; Wireless; Transmit diversity; Symbol rate; Diversity gain; Mathematical optimization; Computer network; Bit error rate; Mathematics; Wireless network; Fading; Telecommunications; Channel (broadcasting)","score_opus":0.08849977535631663,"score_gpt":0.36134091995355405,"score_spread":0.2728411445972374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131515251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040627082,0.000033263364,0.90370387,0.0029668265,0.000054762015,0.067278124,0.000005648267,0.00043209328,0.025119144],"genre_scores_gemma":[0.5891512,0.0000068821237,0.1745543,0.0010004994,0.000111958325,0.23319249,0.000034511435,0.000030520645,0.0019176205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980471,0.00058742083,0.00043810488,0.00043999692,0.00014318356,0.00034420856],"domain_scores_gemma":[0.9963951,0.0005356192,0.00015669638,0.0023061517,0.00050044403,0.00010595539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006445762,0.00023535904,0.0002378511,0.00011489419,0.000961726,0.00039436022,0.002753914,0.00006973453,0.000040129402],"category_scores_gemma":[0.000054663076,0.00020746556,0.000082361,0.00056401093,0.00014473373,0.0009891336,0.00062725117,0.00020826234,0.000038437767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041967454,0.00054203946,0.00030417318,0.000011831401,0.000027588254,7.1535186e-7,0.00089662144,0.0012519003,0.005587655,0.97556007,0.0045777243,0.011197721],"study_design_scores_gemma":[0.0014780706,0.0006503884,0.0031344462,0.00008380898,0.000009665223,0.0000047191024,0.00024537742,0.9515003,0.0019415645,0.002137514,0.03828344,0.0005307243],"about_ca_topic_score_codex":0.00002034925,"about_ca_topic_score_gemma":0.00044489806,"teacher_disagreement_score":0.9734225,"about_ca_system_score_codex":0.00008471831,"about_ca_system_score_gemma":0.0001363319,"threshold_uncertainty_score":0.84602004},"labels":[],"label_agreement":null},{"id":"W2131829656","doi":"10.1109/ciss.2009.5054744","title":"Successive relaying for the half-duplex parallel relay channel","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Linear network coding; Gaussian; Markov chain; Coding (social sciences); Dirty paper coding; Duplex (building); Computer network; Decoding methods; Markov process; Encoding (memory); Topology (electrical circuits); Channel code; Algorithm; Channel (broadcasting); Mathematics; MIMO; Precoding; Physics; Statistics; Network packet; Chemistry; Combinatorics; Artificial intelligence","score_opus":0.055563435123176845,"score_gpt":0.30455799330154404,"score_spread":0.2489945581783672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131829656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018803263,0.0012866488,0.950494,0.040559635,0.0001249918,0.00028891052,1.5788073e-7,0.00015867568,0.0068989703],"genre_scores_gemma":[0.9574391,0.000672585,0.03270341,0.0055144387,0.00008972568,0.00005372373,0.0000019364581,0.0000052161054,0.003519856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992299,0.000057130666,0.00016790183,0.00021705273,0.00011255191,0.00021544623],"domain_scores_gemma":[0.9984832,0.0005419446,0.00006503786,0.00073801714,0.00012322927,0.000048613427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003463424,0.000099431716,0.000097440454,0.00003642917,0.0006193233,0.00019183797,0.0013456221,0.000034458368,0.000020781288],"category_scores_gemma":[0.000098047014,0.00006320814,0.000069223956,0.00028526032,0.000025756895,0.00032281206,0.00018518536,0.00012990736,0.000024390765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008048572,0.00003567231,0.000012359173,0.0000015144991,0.000014765503,0.0000011206095,0.0011100452,0.006090578,0.00014763375,0.8367809,0.015945666,0.13985169],"study_design_scores_gemma":[0.00033888358,0.00007247002,0.0008283231,0.000014852899,0.000004439754,0.0000039175616,0.00006349598,0.94878757,0.00016739342,0.0022803003,0.04728882,0.00014953688],"about_ca_topic_score_codex":0.0000041384815,"about_ca_topic_score_gemma":0.00002223169,"teacher_disagreement_score":0.9572511,"about_ca_system_score_codex":0.00002251152,"about_ca_system_score_gemma":0.000029677716,"threshold_uncertainty_score":0.47633967},"labels":[],"label_agreement":null},{"id":"W2131869931","doi":"10.1109/isit.2011.6033800","title":"On the maximum achievable rates in the decode-forward diamond channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Rayleigh fading; Decoding methods; Fading; Channel (broadcasting); Throughput; Channel state information; Topology (electrical circuits); Computer network; Wireless; Algorithm; Telecommunications; Mathematics; Physics","score_opus":0.08155368913310249,"score_gpt":0.27523602311147927,"score_spread":0.19368233397837678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131869931","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087099485,0.0007362175,0.2997604,0.03380786,0.00041993486,0.0008467627,9.558851e-7,0.0002102836,0.5771181],"genre_scores_gemma":[0.99278593,0.00022144424,0.0012049493,0.0051430217,0.000014870737,0.00004379532,4.7001504e-7,0.0000037385396,0.0005817999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991524,0.0002634088,0.00012537821,0.00015763757,0.00012126399,0.00017991112],"domain_scores_gemma":[0.99860835,0.0004177494,0.000032070588,0.00088477164,0.000033031673,0.000024042958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007984973,0.00008692087,0.00007061848,0.00004399113,0.00024091043,0.000118423595,0.0018927753,0.00002268303,0.00016802139],"category_scores_gemma":[0.000054639753,0.00004096457,0.0000332465,0.0004122296,0.000040434203,0.00017696439,0.0002981179,0.00018143118,0.00016315584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063155253,0.00010071843,0.00029311224,9.904315e-7,0.00000642263,0.0000023458847,0.007661929,0.000038324935,0.000036421483,0.9681695,0.008766706,0.0149172],"study_design_scores_gemma":[0.0012677205,0.00059234124,0.04604744,0.000119178134,0.000011382978,0.000022287317,0.0028342705,0.46997884,0.010923633,0.42045578,0.046741158,0.0010059724],"about_ca_topic_score_codex":0.000023714863,"about_ca_topic_score_gemma":0.00024682333,"teacher_disagreement_score":0.90568644,"about_ca_system_score_codex":0.000012243402,"about_ca_system_score_gemma":0.000017571321,"threshold_uncertainty_score":0.3517279},"labels":[],"label_agreement":null},{"id":"W2131876845","doi":"10.1109/tit.2007.904773","title":"Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block code; Computer science; Decoding methods; Cooperative diversity; Antenna diversity; Code (set theory); Linear code; Transmission (telecommunications); Space–time block code; Fountain code; Full Rate; Constellation; Theoretical computer science; Algorithm; Telecommunications; Antenna (radio); Fading","score_opus":0.023432815274668107,"score_gpt":0.2602419983474376,"score_spread":0.2368091830727695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131876845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021318786,0.000022764312,0.9949913,0.0002865963,0.00042842905,0.00036517045,0.000105890205,0.00020515389,0.0014628221],"genre_scores_gemma":[0.9937874,0.00006501011,0.0049186787,0.0010199982,0.00001797378,0.000035763285,0.000033783195,0.000004230476,0.00011715901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902153,0.000097166,0.0003338915,0.00012936926,0.00018824406,0.00022977398],"domain_scores_gemma":[0.99850416,0.00051310525,0.000109084496,0.0004060427,0.00037210775,0.00009551169],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010702523,0.00014055058,0.00013307754,0.00018428617,0.0013477743,0.0001414634,0.0005844617,0.00006616667,0.000052128737],"category_scores_gemma":[0.000017704628,0.0001324368,0.000096048134,0.00041560555,0.000075012795,0.0016999525,0.000016327003,0.00019266647,0.00007367114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037393929,0.00021312307,0.000012853023,0.000024559433,0.00012217202,0.0000013361332,0.012586836,0.043861683,0.00013794847,0.42581683,0.0013656811,0.515483],"study_design_scores_gemma":[0.0074468777,0.0012078825,0.0013401348,0.00023075035,0.00013539106,0.000074756375,0.004887524,0.7793854,0.08597059,0.014132278,0.10308386,0.0021045678],"about_ca_topic_score_codex":0.000002856854,"about_ca_topic_score_gemma":0.000028367896,"teacher_disagreement_score":0.9916555,"about_ca_system_score_codex":0.000117271775,"about_ca_system_score_gemma":0.000047518966,"threshold_uncertainty_score":0.9999523},"labels":[],"label_agreement":null},{"id":"W2131951334","doi":"10.1109/glocom.2008.ecp.788","title":"A Fair Subcarrier Allocation Algorithm for Cooperative Multiuser OFDM Systems with Grouped Users","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Subcarrier; Computer science; Telecommunications link; Orthogonal frequency-division multiplexing; Base station; Resource allocation; Relay; Computer network; Diversity gain; Algorithm; Resource management (computing); MIMO; Channel (broadcasting)","score_opus":0.04306042163336094,"score_gpt":0.26308987228261266,"score_spread":0.22002945064925172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131951334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005550162,0.00022075807,0.99142,0.0005311938,0.00016438426,0.00077083526,0.0000029875193,0.00023868924,0.0011009909],"genre_scores_gemma":[0.8246994,0.00021772402,0.16990666,0.0005195639,0.000069561225,0.0003392002,0.000021852422,0.000018479474,0.004207538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988061,0.00013984139,0.00023763058,0.00036666027,0.00020544848,0.00024432736],"domain_scores_gemma":[0.9983608,0.00016659079,0.0000797899,0.00065394124,0.0006352979,0.00010356131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024234282,0.00017421653,0.00019951476,0.00008085035,0.0005042098,0.00013933347,0.00065482606,0.00005273551,0.000011423222],"category_scores_gemma":[0.00002547305,0.00013125174,0.000043221768,0.00048971747,0.00008265127,0.0006653329,0.00013146957,0.000106115425,0.000019807298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017574221,0.0009711976,0.004032324,0.0000827252,0.00070344,0.000052040417,0.03149167,0.016982004,0.0051339483,0.60478145,0.03944041,0.29615307],"study_design_scores_gemma":[0.001107749,0.00020288596,0.0007390026,0.000026648511,0.000005858286,0.00003458033,0.00022518977,0.98194563,0.00093618006,0.000011615798,0.01448802,0.0002766251],"about_ca_topic_score_codex":0.000032243697,"about_ca_topic_score_gemma":0.00008138677,"teacher_disagreement_score":0.9649636,"about_ca_system_score_codex":0.00007010167,"about_ca_system_score_gemma":0.0001242304,"threshold_uncertainty_score":0.535229},"labels":[],"label_agreement":null},{"id":"W2132061279","doi":"10.1109/twc.2008.071098","title":"On the capacity of Rayleigh fading cooperative systems under adaptive transmission","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Saskatchewan","funders":"","keywords":"Rayleigh fading; Independent and identically distributed random variables; Fading; Upper and lower bounds; Channel capacity; Computer science; Signal-to-noise ratio (imaging); Control theory (sociology); Link adaptation; Transmission (telecommunications); Fading distribution; Channel (broadcasting); Topology (electrical circuits); Mathematics; Telecommunications; Random variable; Statistics; Mathematical analysis","score_opus":0.07995144036716158,"score_gpt":0.2851358295160062,"score_spread":0.20518438914884463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132061279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009845872,0.0003064716,0.977704,0.008491912,0.0001455267,0.0005336173,0.00001418829,0.00015796816,0.0028004278],"genre_scores_gemma":[0.9936699,0.0017832246,0.0035864555,0.0006667082,0.000009102804,0.0001011048,0.0000027556125,0.000012668999,0.00016807721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976808,0.0009969552,0.00046732184,0.00029915804,0.0003207294,0.00023505317],"domain_scores_gemma":[0.9949161,0.0015012203,0.00018058786,0.002954102,0.0003495627,0.00009844554],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00047091438,0.00023843818,0.0002870765,0.00018924473,0.0014283007,0.0001225671,0.002740529,0.00009743449,0.000025763607],"category_scores_gemma":[0.000008978493,0.00018083592,0.00014780468,0.0009976358,0.0002588591,0.00033783691,0.000014989011,0.0007350381,0.000026270014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002796628,0.0006579726,6.500876e-7,0.000003975367,0.00006772276,2.5580712e-7,0.002764967,0.0737533,0.00942999,0.8735752,0.00019014138,0.039527837],"study_design_scores_gemma":[0.0007674636,0.0006471908,0.00022481136,0.00056404824,0.000043359763,0.00001028368,0.00063368864,0.9577296,0.034283917,0.003173519,0.0014077858,0.000514331],"about_ca_topic_score_codex":0.000024590116,"about_ca_topic_score_gemma":0.000037802798,"teacher_disagreement_score":0.983824,"about_ca_system_score_codex":0.00013221282,"about_ca_system_score_gemma":0.00009764234,"threshold_uncertainty_score":0.99987173},"labels":[],"label_agreement":null},{"id":"W2132064078","doi":"10.1287/moor.2013.0620","title":"Approximability of Robust Network Design","year":2013,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Steiner tree problem; Network planning and design; Polytope; Approximation algorithm; Robustness (evolution); Combinatorics; Mathematical optimization; Reduction (mathematics); Generalization; Discrete mathematics; Regular polygon; Convex polytope; Convex optimization; Computer science; Convex set","score_opus":0.2796842248226325,"score_gpt":0.387521989843839,"score_spread":0.10783776502120651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132064078","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011295068,0.00021393386,0.9829191,0.0007991864,0.000025149078,0.0007477143,6.2477284e-7,0.000027187552,0.0039720587],"genre_scores_gemma":[0.4355773,0.00008979936,0.5639044,0.000008687676,0.000013287405,0.00010007034,0.0000010338598,0.000004777941,0.00030066236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981783,0.00050831464,0.00045357656,0.00017344602,0.00044814852,0.00023819656],"domain_scores_gemma":[0.9964067,0.0007916619,0.000043751832,0.0012152831,0.0014805236,0.00006211852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028440843,0.00007740418,0.0001995919,0.000130369,0.00026744144,0.00013668727,0.0013059893,0.000043182597,0.00020880558],"category_scores_gemma":[0.00059598504,0.00006530146,0.000043570853,0.0010388978,0.0002054103,0.000378839,0.00059786666,0.00020755883,0.000058370333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017541107,0.0005618198,0.00006589479,0.00010040067,0.000028234219,2.1869577e-7,0.0031721124,0.20308027,0.0068021673,0.7698559,0.0047211484,0.011610045],"study_design_scores_gemma":[0.00010557544,0.00007182695,0.00018277182,0.00005402368,0.0000013907435,0.0000012453312,0.00011622844,0.982056,0.004389037,0.012875274,0.000079294994,0.00006731947],"about_ca_topic_score_codex":0.00002267272,"about_ca_topic_score_gemma":0.000013714242,"teacher_disagreement_score":0.7789757,"about_ca_system_score_codex":0.00003072599,"about_ca_system_score_gemma":0.00015224295,"threshold_uncertainty_score":0.26629162},"labels":[],"label_agreement":null},{"id":"W2132094497","doi":"10.1109/isit.2010.5513578","title":"Multiplexing gain of amplify-forward relaying in wireless multi-antenna relay networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multiplexing; Relay; Computer network; Multicast; Rayleigh fading; Wireless network; Ergodic theory; Wireless ad hoc network; Topology (electrical circuits); Wireless; Fading; Channel (broadcasting); Mathematics; Telecommunications; Physics; Combinatorics","score_opus":0.0377286373402508,"score_gpt":0.28936122252191987,"score_spread":0.2516325851816691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132094497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085834086,0.00010076629,0.91172224,0.00033567185,0.00041461093,0.00017322325,4.444393e-7,0.00012254664,0.0012963878],"genre_scores_gemma":[0.90178037,0.00022729624,0.09749747,0.0002350561,0.00003205896,0.000015145166,0.0000030609817,0.000011266258,0.00019826351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857134,0.0001558732,0.00046880942,0.00033013674,0.00015453759,0.0003192927],"domain_scores_gemma":[0.99833286,0.0003582558,0.00014226025,0.0009518455,0.00012649788,0.00008827083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039515,0.00015324782,0.00024422788,0.00016272024,0.00014179663,0.0000761149,0.0012124814,0.00012626073,0.000034808163],"category_scores_gemma":[0.00013796429,0.00013960332,0.000066468936,0.000674385,0.00007618366,0.0003700045,0.0006314374,0.0007217898,0.000008998397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003101201,0.0005155586,0.09484784,0.00003153255,0.000046791076,0.000024850367,0.004628822,0.024056258,0.17756945,0.4358188,0.00049989653,0.2619292],"study_design_scores_gemma":[0.00051908055,0.000015102965,0.0074370154,0.000055567354,0.0000012702397,0.000003892046,0.000051160685,0.9903624,0.0009884419,0.000034063498,0.00035570053,0.00017629957],"about_ca_topic_score_codex":0.000054738175,"about_ca_topic_score_gemma":0.0011921194,"teacher_disagreement_score":0.96630615,"about_ca_system_score_codex":0.000026043175,"about_ca_system_score_gemma":0.00003976916,"threshold_uncertainty_score":0.5692858},"labels":[],"label_agreement":null},{"id":"W2132173309","doi":"10.1109/vetec.1992.245300","title":"A CSMA/CD portable data system using adaptive Reed-Solomon coding","year":2003,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Codec; Computer science; Fading; Coding (social sciences); Wireless; Encoder; Real-time computing; Carrier sense multiple access with collision avoidance; Computer hardware; Computer network; Decoding methods; Embedded system; Algorithm; Telecommunications; Wireless lan; Mathematics","score_opus":0.18650085258133134,"score_gpt":0.31736468965977765,"score_spread":0.13086383707844632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132173309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001143851,0.00061788276,0.92176706,0.00009221314,0.00027251884,0.00016509031,0.0000023808134,0.00025845694,0.07568056],"genre_scores_gemma":[0.87999576,0.000089413144,0.1190324,0.00016436624,0.000027129045,0.0000041650123,0.00000574754,0.0000088784145,0.00067214743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998523,0.0002619994,0.00027623572,0.00046238524,0.00019295454,0.00028340003],"domain_scores_gemma":[0.99741375,0.00011214338,0.00010903041,0.0021369038,0.00013428996,0.000093901086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087316,0.00013722217,0.00018274733,0.000078261364,0.00039685637,0.00022709018,0.0017467141,0.00004509031,0.00004411516],"category_scores_gemma":[0.000071131675,0.00012596202,0.000028641323,0.0005910506,0.000030257112,0.0009103761,0.0009455335,0.00014973339,0.000044402757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000294759,0.000036722577,0.00034529553,0.000011019665,0.0000279638,0.000014401766,0.00034792154,0.00047534323,0.001867868,0.98885304,0.002003278,0.0060141925],"study_design_scores_gemma":[0.00021592068,0.000025488192,0.00005284969,0.00010085858,0.000008437328,0.00006234618,0.00042044895,0.98771507,0.0010988937,0.000095457915,0.009971126,0.00023313316],"about_ca_topic_score_codex":0.00004097898,"about_ca_topic_score_gemma":0.00009029758,"teacher_disagreement_score":0.9887576,"about_ca_system_score_codex":0.0001055058,"about_ca_system_score_gemma":0.000124971,"threshold_uncertainty_score":0.51365817},"labels":[],"label_agreement":null},{"id":"W2132211658","doi":"10.1109/twc.2009.081108","title":"Hard/soft detection with limited CSI for multi-hop systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Channel state information; Overhead (engineering); Relay; Channel (broadcasting); Diversity gain; Maximum a posteriori estimation; Algorithm; Computer network; Wireless; Telecommunications; Maximum likelihood; MIMO; Mathematics; Power (physics); Statistics","score_opus":0.0784405269543637,"score_gpt":0.29943935563231694,"score_spread":0.22099882867795323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132211658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019708048,0.000432179,0.9930566,0.0025423544,0.00025387513,0.0008753164,0.000016529279,0.0005939331,0.00025843838],"genre_scores_gemma":[0.941039,0.0012432861,0.056156464,0.00042487934,0.000020900949,0.0005209649,0.000011361108,0.000022726179,0.0005603806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839365,0.00030087458,0.00039789648,0.0003888398,0.00021044097,0.00030828093],"domain_scores_gemma":[0.9954059,0.0004378946,0.00016257515,0.003360616,0.0004986592,0.00013436412],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003050929,0.00024860416,0.00026011892,0.00027916,0.0015532235,0.0003056962,0.0022302184,0.00011067938,0.0000037024918],"category_scores_gemma":[0.000010775159,0.00023616049,0.00012540375,0.0009849387,0.000114659015,0.00056927104,0.000012776752,0.00046150124,0.000027662987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010624613,0.00185715,0.000010665628,0.000025295552,0.00015755721,0.0000010684187,0.0017918024,0.03106996,0.02963217,0.026714109,0.00020842004,0.90842557],"study_design_scores_gemma":[0.0011638121,0.0003884057,0.000389395,0.00012851747,0.000037331676,0.000019914633,0.000101492886,0.9826505,0.007564529,0.00004655858,0.0071281195,0.00038137962],"about_ca_topic_score_codex":0.000016456004,"about_ca_topic_score_gemma":0.00028880447,"teacher_disagreement_score":0.9515806,"about_ca_system_score_codex":0.00014720598,"about_ca_system_score_gemma":0.00008727787,"threshold_uncertainty_score":0.9997466},"labels":[],"label_agreement":null},{"id":"W2132310235","doi":"10.4108/chinacom.2010.113","title":"Soft QoS Provisioning for wireless sensor networks: A cooperative communications approach","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Norges Forskningsråd","keywords":"Relay; Computer science; Cooperative diversity; Computer network; Provisioning; Wireless; Wireless sensor network; Quality of service; Efficient energy use; Spectral efficiency; Communications system; Telecommunications; Wireless network; Channel (broadcasting); Engineering; Electrical engineering","score_opus":0.04589826816933899,"score_gpt":0.30121359440084333,"score_spread":0.2553153262315043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132310235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010210505,0.00017320424,0.9845617,0.0025867193,0.00029508767,0.00080219307,0.0000019072559,0.00032796327,0.010230163],"genre_scores_gemma":[0.5671795,0.00014813662,0.43033823,0.00077551184,0.00013030405,0.00031229763,0.000026066347,0.00001538902,0.0010745818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986922,0.00016869527,0.00030767897,0.0003859257,0.00013338446,0.00031208261],"domain_scores_gemma":[0.9963359,0.00064405653,0.00010451399,0.0023005127,0.00049369567,0.00012130775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006065517,0.00018054477,0.00020821497,0.00007672898,0.0010176689,0.0003996527,0.0025909217,0.00009410397,0.000020383872],"category_scores_gemma":[0.0001324312,0.00015338439,0.000081597624,0.00052447594,0.00015901212,0.00047235674,0.0010707894,0.00048662067,0.00001513785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008626913,0.0002476046,0.0001598041,0.000008535384,0.00003563385,2.9286946e-7,0.0014081721,0.0016625026,0.0043174913,0.8398905,0.004652378,0.14760846],"study_design_scores_gemma":[0.00036502836,0.000040208834,0.0000906598,0.000012437641,0.0000048585903,0.000008227817,0.000106726184,0.963562,0.00032523516,0.00011596122,0.0351456,0.00022302585],"about_ca_topic_score_codex":0.0000047739354,"about_ca_topic_score_gemma":0.000104499064,"teacher_disagreement_score":0.9618995,"about_ca_system_score_codex":0.000022182978,"about_ca_system_score_gemma":0.00010795147,"threshold_uncertainty_score":0.78271884},"labels":[],"label_agreement":null},{"id":"W2132388463","doi":"10.1109/ccece.2011.6030679","title":"Optimal linear MIMO relay communication under a constraint on the condition number of relay transform matrix","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Iran Telecommunication Research Center","keywords":"Relay; MIMO; Relay channel; Maximization; Multiplexing; Computer science; Transformation matrix; Node (physics); Constraint (computer-aided design); Matrix (chemical analysis); Control theory (sociology); Mathematics; Topology (electrical circuits); Mathematical optimization; Power (physics); Telecommunications; Beamforming; Engineering","score_opus":0.0652160517191458,"score_gpt":0.3156593464520596,"score_spread":0.2504432947329138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132388463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06883445,0.0001644799,0.7130662,0.012442209,0.00010215529,0.00051723956,0.0000046335335,0.00019284103,0.20467578],"genre_scores_gemma":[0.9358206,0.00040034752,0.062295325,0.0008021138,0.000008167301,0.000022792721,0.0000069303455,0.0000069542466,0.000636768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989598,0.0002667336,0.00031013312,0.00016133855,0.0001632441,0.00013878426],"domain_scores_gemma":[0.9982544,0.00033145348,0.00011346214,0.0010871582,0.00015721188,0.000056324017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005884251,0.00011165158,0.00012680721,0.00004130894,0.0002335171,0.000032647782,0.0010483051,0.00006247551,0.0008847851],"category_scores_gemma":[0.000036145542,0.00007655733,0.00007612957,0.00027194156,0.00020433655,0.00023646855,0.00015258278,0.00025896632,0.00013591623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012296538,0.00009915656,0.000049705097,0.0000025678683,0.000021921984,3.674301e-7,0.0023713312,0.00033034966,0.00023928197,0.99258405,0.0011209482,0.0031680518],"study_design_scores_gemma":[0.004477187,0.001031885,0.008732456,0.0007396344,0.000108759596,0.00020348125,0.0052077756,0.82010496,0.08744647,0.032238804,0.037891917,0.0018166497],"about_ca_topic_score_codex":0.00001802989,"about_ca_topic_score_gemma":0.000024412728,"teacher_disagreement_score":0.9603452,"about_ca_system_score_codex":0.000032768632,"about_ca_system_score_gemma":0.0000622636,"threshold_uncertainty_score":0.9687776},"labels":[],"label_agreement":null},{"id":"W2132570764","doi":"10.1109/vetecs.2009.5073887","title":"Total Power Control for Cooperative Base Stations Uplink","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Telecommunications link; Base station; Power control; Computer science; Power (physics); Computer network; Interference (communication); Real-time computing; Mobile station; Telecommunications; Channel (broadcasting)","score_opus":0.029092848612755753,"score_gpt":0.29646893044685496,"score_spread":0.2673760818340992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132570764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008525334,0.00012131849,0.97756964,0.012714464,0.00009391721,0.0003440432,0.0000038696644,0.0001398598,0.008160383],"genre_scores_gemma":[0.9381821,0.00002198224,0.055258106,0.0047352263,0.000022866569,0.000021273636,0.00000593303,0.0000031602885,0.001749349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934894,0.00005723676,0.00016107927,0.00019450711,0.00007445429,0.0001637692],"domain_scores_gemma":[0.9989566,0.00022655688,0.000034122364,0.0004129674,0.00029785084,0.00007190156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018148203,0.00008897323,0.000106751104,0.000046816014,0.00027380043,0.00015311857,0.00038923507,0.000024638377,0.00011628676],"category_scores_gemma":[0.00007707939,0.00007510259,0.00004853518,0.00022602019,0.000018890893,0.00035090614,0.000043800836,0.00007224559,0.00003504271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100874895,0.000090679576,0.000011104121,5.320991e-7,0.000012187303,7.292248e-7,0.0007746082,0.0008239469,0.0017433305,0.9434467,0.010186164,0.042899944],"study_design_scores_gemma":[0.002000816,0.0005076645,0.0020907798,0.0000115040575,0.00000636761,0.000005888331,0.000080675505,0.9793287,0.0014196393,0.0031538303,0.011085761,0.00030839126],"about_ca_topic_score_codex":5.7180364e-7,"about_ca_topic_score_gemma":0.000005498489,"teacher_disagreement_score":0.9785047,"about_ca_system_score_codex":0.000024301793,"about_ca_system_score_gemma":0.000063602536,"threshold_uncertainty_score":0.30625945},"labels":[],"label_agreement":null},{"id":"W2132868910","doi":"10.1109/pimrc.2008.4699649","title":"On the capacity of Pairwise Collaborative Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Transmitter; Relay channel; Computer science; Computer network; Decoding methods; Decodes; Channel (broadcasting); Pairwise comparison; Coding (social sciences); Pooling; Channel code; Linear network coding; Encoding (memory); Topology (electrical circuits); Telecommunications; Network packet; Mathematics; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.06007427169094578,"score_gpt":0.2504873332601714,"score_spread":0.19041306156922563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132868910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10082336,0.00023167883,0.8333833,0.006130061,0.00015700712,0.00025223414,7.874063e-7,0.00011461447,0.05890691],"genre_scores_gemma":[0.99477684,0.00042859622,0.0032310535,0.0011534847,0.000014021638,0.000009130768,2.809687e-7,0.0000020758102,0.00038452502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936604,0.00020000098,0.0001189563,0.00010846589,0.00011439269,0.00009214719],"domain_scores_gemma":[0.99869424,0.00045389775,0.000053136402,0.00059684727,0.00017369715,0.000028203001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022282824,0.00006140628,0.000082262944,0.000022390615,0.0002469124,0.000017067847,0.0006752888,0.000020525762,0.00007135417],"category_scores_gemma":[0.00006710838,0.000036578756,0.000028238977,0.0005650962,0.00011028823,0.0000962923,0.00016151337,0.00011087811,0.000014451823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002675431,0.00003634936,0.00015812725,3.601502e-7,0.0000074439486,6.7285583e-7,0.0010614669,0.0008701357,0.000082897146,0.9789441,0.016056692,0.0027790843],"study_design_scores_gemma":[0.00048007892,0.0002769261,0.009595404,0.00004419813,0.0000033021659,0.000010563483,0.00012573671,0.9629217,0.0071329745,0.004367394,0.014727613,0.0003141543],"about_ca_topic_score_codex":0.0000030369556,"about_ca_topic_score_gemma":0.000018327732,"teacher_disagreement_score":0.9745767,"about_ca_system_score_codex":0.000013626399,"about_ca_system_score_gemma":0.000037075395,"threshold_uncertainty_score":0.18990755},"labels":[],"label_agreement":null},{"id":"W2133045785","doi":"10.1109/tvt.2011.2149549","title":"Accurate and Efficient Network Tomography Through Network Coding","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Network tomography; Linear network coding; Computer science; Tomography; Computed tomography; Coding (social sciences); Network topology; Computer network; Mathematics; Physics","score_opus":0.03578074266462257,"score_gpt":0.25186707483239007,"score_spread":0.21608633216776751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133045785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0126038445,0.0012936858,0.98271173,0.00086364674,0.00052823464,0.0002496176,9.837771e-7,0.0007155604,0.0010327141],"genre_scores_gemma":[0.9534148,0.0013414116,0.044632155,0.0004556909,0.000032734042,0.000074483854,4.933355e-7,0.000015270993,0.000032954715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853396,0.00012237881,0.00027725642,0.00046700798,0.00013429564,0.00046511454],"domain_scores_gemma":[0.998719,0.000079934645,0.00009300006,0.00094524503,0.000096016425,0.00006683938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002613275,0.00021631127,0.00023561675,0.00020178345,0.00071107806,0.000060271905,0.00082787994,0.00020588841,0.000031846994],"category_scores_gemma":[0.0000044172625,0.00020875272,0.000093762304,0.0018830611,0.00022269749,0.00017574498,0.000029619501,0.0005199509,0.000029177976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058083344,0.0005456631,0.00031190977,0.000023964129,0.00034653652,0.00007262004,0.0021963508,0.20699263,0.0014357719,0.5637899,0.0010194017,0.22320718],"study_design_scores_gemma":[0.0022722739,0.001095811,0.0015380563,0.0005145738,0.00015345002,0.00034094552,0.00025045598,0.887722,0.041454062,0.032896843,0.029813372,0.0019481116],"about_ca_topic_score_codex":0.0000045730144,"about_ca_topic_score_gemma":0.000028792816,"teacher_disagreement_score":0.940811,"about_ca_system_score_codex":0.000029479112,"about_ca_system_score_gemma":0.000024491503,"threshold_uncertainty_score":0.85126895},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04314384442252283,"score_gpt":0.3194169616991871,"score_spread":0.27627311727666426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133149827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036749907,0.0071073296,0.94107175,0.011664171,0.0002993539,0.0013822459,0.000014440338,0.00041500377,0.0012957786],"genre_scores_gemma":[0.8503262,0.0026125645,0.14544173,0.0007443408,0.000033097465,0.00057647226,0.00002679517,0.000018102524,0.000220717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888337,0.00015190768,0.00031582758,0.00029297327,0.00012809304,0.00022785777],"domain_scores_gemma":[0.99629784,0.0004013921,0.000121557736,0.0028302674,0.00023328661,0.00011566704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036419817,0.00016584664,0.00020133686,0.00010389409,0.00060749013,0.00016124292,0.0020448058,0.00005749949,0.000005990887],"category_scores_gemma":[0.000034171135,0.00016849526,0.000064855114,0.00040001507,0.0002449498,0.00028441715,0.0004429966,0.00019551377,0.000031464082],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085803265,0.002060017,0.0007728585,0.00012681379,0.00019378182,0.000005358288,0.007217977,0.016869599,0.05934399,0.49381128,0.017002888,0.40250966],"study_design_scores_gemma":[0.007843613,0.00062940933,0.0020303791,0.00029353768,0.000055385288,0.000035723537,0.000075104734,0.34428227,0.012478017,0.0032301908,0.6280324,0.0010139456],"about_ca_topic_score_codex":0.0000057490965,"about_ca_topic_score_gemma":0.00009715929,"teacher_disagreement_score":0.8135763,"about_ca_system_score_codex":0.00011135494,"about_ca_system_score_gemma":0.00014270417,"threshold_uncertainty_score":0.6871037},"labels":[],"label_agreement":null},{"id":"W2133431248","doi":"10.1109/twc.2012.032812.111476","title":"Resource Allocation for Two-Way AF Relaying with Receive Channel Knowledge","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Decoding methods; Multiplexing; Resource allocation; Coding (social sciences); Channel (broadcasting); Relay; Computer network; Transmitter power output; Exploit; Constraint (computer-aided design); Mathematical optimization; Upper and lower bounds; Power (physics); Algorithm; Telecommunications; Transmitter; Mathematics; Statistics","score_opus":0.06577431010897368,"score_gpt":0.3080892538285011,"score_spread":0.24231494371952744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133431248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014595861,0.0009990096,0.98611754,0.0046463716,0.00024383987,0.0007185032,0.000012290162,0.00038543428,0.005417446],"genre_scores_gemma":[0.9630943,0.0009403013,0.033684272,0.00035221723,0.000058945065,0.0009569288,0.000024798224,0.000040440915,0.000847805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981775,0.00046538995,0.00038517654,0.00033350798,0.00018905368,0.0004493572],"domain_scores_gemma":[0.9948489,0.0010416143,0.00017349901,0.003366412,0.0003697369,0.00019982501],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006931472,0.0002578295,0.00024056918,0.0002663685,0.0018030105,0.00013909911,0.0023296827,0.00009448849,0.000013350958],"category_scores_gemma":[0.000013360794,0.00024888606,0.00011921195,0.0010227803,0.00018202639,0.00086195325,0.000040182764,0.00051779253,0.00009103017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014539748,0.0034442276,0.000051486622,0.000062603714,0.0003476717,3.943257e-7,0.024650453,0.016055536,0.005752614,0.235918,0.002569991,0.71100163],"study_design_scores_gemma":[0.004146656,0.00056613906,0.00046495534,0.0006964991,0.00019774548,0.00006261294,0.0015187562,0.79352576,0.032676235,0.00051984034,0.16384073,0.0017840865],"about_ca_topic_score_codex":0.000010391357,"about_ca_topic_score_gemma":0.00027022613,"teacher_disagreement_score":0.9616347,"about_ca_system_score_codex":0.00019430024,"about_ca_system_score_gemma":0.00009841496,"threshold_uncertainty_score":0.99999636},"labels":[],"label_agreement":null},{"id":"W2133468959","doi":"10.1109/ccece.2007.234","title":"Virtual Space-Time Coding for Cooperative Communication and Downlink Receiver Hardware Implementation","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Telecommunications link; Computer science; MIMO; Coding (social sciences); Communications system; Key (lock); 3G MIMO; High data rate; Computer hardware; Electronic engineering; Embedded system; Computer network; Telecommunications; Engineering; Wireless","score_opus":0.03299745559588002,"score_gpt":0.32405786551081184,"score_spread":0.2910604099149318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133468959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010898063,0.0002855258,0.9798395,0.0036681937,0.000070282076,0.0005606515,0.0000052012306,0.00015766152,0.004514913],"genre_scores_gemma":[0.90508926,0.0008822001,0.09128596,0.00091280486,0.000044520075,0.000040388026,0.000073210176,0.000011101492,0.0016605828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990329,0.00011976857,0.0002633191,0.00025141166,0.00011775611,0.00021485872],"domain_scores_gemma":[0.9984723,0.00052093563,0.000093700364,0.0005134768,0.00031858514,0.00008102302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053704,0.00012355199,0.00013634673,0.000096179145,0.00056073215,0.00021025284,0.0005062762,0.000045582685,0.000116696785],"category_scores_gemma":[0.000058882702,0.00011571893,0.0000322384,0.00028191588,0.000059691356,0.0006398469,0.00035837176,0.000109259236,0.000023598275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026848305,0.00003786007,0.00029986832,0.0000049494765,0.00003355756,4.814199e-7,0.004432546,0.000035199708,0.010231871,0.6027182,0.008676114,0.37350255],"study_design_scores_gemma":[0.009652267,0.0014702409,0.024854565,0.00025261578,0.00007243508,0.00004386235,0.0073725604,0.5007759,0.10556313,0.004300328,0.34338456,0.002257592],"about_ca_topic_score_codex":0.000008826329,"about_ca_topic_score_gemma":0.00019362674,"teacher_disagreement_score":0.89419115,"about_ca_system_score_codex":0.00006913273,"about_ca_system_score_gemma":0.00003810601,"threshold_uncertainty_score":0.47188812},"labels":[],"label_agreement":null},{"id":"W2133561200","doi":"10.1109/cwit.2009.5069551","title":"Adaptive power loading for OFDM cooperative networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Bit error rate; Fading; Power (physics); Channel (broadcasting); Transmission (telecommunications); Monte Carlo method; Modulation (music); Electronic engineering; Telecommunications; Mathematics; Engineering; Statistics","score_opus":0.03966123477853657,"score_gpt":0.28770221988064526,"score_spread":0.2480409851021087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133561200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022853445,0.00037885222,0.9669599,0.0026075118,0.00015542112,0.00030051928,4.942725e-7,0.00018833582,0.029180441],"genre_scores_gemma":[0.9473892,0.00012226646,0.04700283,0.0038844743,0.000056709265,0.00002200812,0.0000024476305,0.0000052384185,0.0015148642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990987,0.000075058524,0.00018521499,0.00028444052,0.000093949,0.0002626234],"domain_scores_gemma":[0.99892104,0.00019206924,0.00005127138,0.00049138756,0.00026072797,0.000083512234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025712184,0.00013301057,0.00015202675,0.0000552603,0.0003177722,0.00017049849,0.0007516691,0.000047453606,0.000057765294],"category_scores_gemma":[0.00004124593,0.000113254995,0.00006516505,0.00038425543,0.000026224921,0.00043928364,0.00013633024,0.00012867767,0.00002000849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012384152,0.000044273613,0.000010432944,3.0365234e-7,0.00001249956,8.803214e-7,0.000442848,0.0019951477,0.00024031388,0.92402196,0.010356028,0.06286291],"study_design_scores_gemma":[0.0004851455,0.00042022648,0.00052719424,0.000022475053,0.0000031523878,0.0000039516494,0.00005919272,0.9806643,0.00069920096,0.0016241213,0.015227747,0.00026327916],"about_ca_topic_score_codex":5.910431e-7,"about_ca_topic_score_gemma":0.0000075154353,"teacher_disagreement_score":0.97866917,"about_ca_system_score_codex":0.00004364822,"about_ca_system_score_gemma":0.00003859443,"threshold_uncertainty_score":0.46184045},"labels":[],"label_agreement":null},{"id":"W2133748043","doi":"10.1109/glocom.2009.5425246","title":"SNR Maximization and Distributed Beamforming in Multiuser Multi-Relay Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Beamforming; Computer science; Maximization; Mathematical optimization; Optimization problem; Iterative method; Constraint (computer-aided design); Bisection method; Signal-to-noise ratio (imaging); Power (physics); Noise (video); Margin (machine learning); Algorithm; Mathematics; Telecommunications","score_opus":0.02586275791288116,"score_gpt":0.2672563940137642,"score_spread":0.24139363610088305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133748043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007945711,0.00031488758,0.9899726,0.0011543019,0.000050000308,0.0001247371,2.763421e-7,0.00010660752,0.00033086652],"genre_scores_gemma":[0.91148174,0.00060136645,0.08713057,0.00063789723,0.00001301743,0.0000043358596,0.000010730486,0.0000028724928,0.00011744756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993083,0.00006211992,0.00018785814,0.00019994976,0.00006691973,0.00017486332],"domain_scores_gemma":[0.99948126,0.0000554261,0.00003985628,0.00031809005,0.00004994266,0.000055404194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020336526,0.00009125383,0.000100009056,0.00006990062,0.00012151387,0.00011382796,0.0003339798,0.000047846013,0.000009487731],"category_scores_gemma":[0.0000363033,0.00008211561,0.000016139933,0.00046029149,0.00001652765,0.00042724842,0.00016076457,0.00013242927,0.0000032909038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001142297,0.00026142728,0.015907738,0.0000034254688,0.000009418425,0.0000079613765,0.0014685305,0.14272289,0.0005100173,0.088132754,0.0006324045,0.750332],"study_design_scores_gemma":[0.00044739636,0.00001844532,0.048702557,0.00001832834,8.310487e-7,0.0000026687333,0.000013570205,0.9497643,0.00005145418,0.00006157142,0.00081128854,0.00010759913],"about_ca_topic_score_codex":0.000005668668,"about_ca_topic_score_gemma":0.00010606663,"teacher_disagreement_score":0.9035361,"about_ca_system_score_codex":0.000032742493,"about_ca_system_score_gemma":0.000010596203,"threshold_uncertainty_score":0.33485776},"labels":[],"label_agreement":null},{"id":"W2133816628","doi":"10.1109/iwcmc.2011.5982414","title":"An opportunistic subcarrier allocation algorithm based on cooperative coefficient for OFDM relaying systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Subcarrier; Telecommunications link; Computer science; Base station; Orthogonal frequency-division multiplexing; Algorithm; Channel (broadcasting); Throughput; Rayleigh scattering; Electronic engineering; Computer network; Telecommunications; Wireless; Engineering; Physics","score_opus":0.0979123204848837,"score_gpt":0.2997930302069782,"score_spread":0.2018807097220945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133816628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022958816,0.00004662789,0.99087816,0.00021224305,0.00039891462,0.00061393116,0.000008266608,0.00020932441,0.0074029225],"genre_scores_gemma":[0.91032284,0.000022289587,0.08794506,0.0009032367,0.000047390302,0.00018443065,0.0000556458,0.000014844105,0.00050425803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861085,0.00027317216,0.0002891811,0.00039715366,0.00019917762,0.00023045689],"domain_scores_gemma":[0.9980925,0.0002004961,0.00009863322,0.00095707877,0.0004962061,0.00015513533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794881,0.00015972926,0.00016431419,0.000117525,0.00041307454,0.00018733733,0.00080706563,0.000055385262,0.00004163261],"category_scores_gemma":[0.000065707456,0.00013736912,0.000043765183,0.00033799344,0.00004789123,0.00030117139,0.00007406902,0.00010587077,0.000020384576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029061603,0.0004743809,0.00005971196,0.000015448859,0.000023053657,0.000004528542,0.0023213848,0.011164046,0.0009277883,0.8721799,0.0014684534,0.11133222],"study_design_scores_gemma":[0.00036185968,0.00042809156,0.00008290566,0.00003410359,0.0000057122443,0.0000018790215,0.00016442506,0.9942999,0.0006180196,0.000040063398,0.003767261,0.00019577351],"about_ca_topic_score_codex":0.000012901661,"about_ca_topic_score_gemma":0.0000075998496,"teacher_disagreement_score":0.9831359,"about_ca_system_score_codex":0.000077284705,"about_ca_system_score_gemma":0.0001463801,"threshold_uncertainty_score":0.56017506},"labels":[],"label_agreement":null},{"id":"W2133845767","doi":"10.1109/wiopt.2011.5930037","title":"Joint routing, scheduling, and network coding for wireless multihop networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear network coding; Computer science; Maximum throughput scheduling; Unicast; Computer network; Scheduling (production processes); Wireless network; Signal-to-interference-plus-noise ratio; Distributed computing; Wireless mesh network; Wireless; Coding (social sciences); Throughput; Mathematical optimization; Dynamic priority scheduling; Round-robin scheduling; Multicast; Mathematics; Telecommunications; Quality of service","score_opus":0.08204351785227845,"score_gpt":0.2750651369714942,"score_spread":0.19302161911921575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133845767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004580552,0.0005223929,0.9889081,0.0002453069,0.00031069753,0.00028480636,2.0224508e-7,0.00023705566,0.004910877],"genre_scores_gemma":[0.79092604,0.0006252926,0.2073523,0.0006446978,0.00013811169,0.0000343346,0.0000016147414,0.000011098275,0.0002664914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988301,0.00008159103,0.00028003048,0.0003469542,0.00008139142,0.00037992967],"domain_scores_gemma":[0.99894744,0.00015095166,0.000109851186,0.0005378438,0.00013373219,0.00012015008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006613823,0.0001544643,0.00020182916,0.000040996187,0.00047330576,0.00015415768,0.0005826498,0.0000682452,0.000029457959],"category_scores_gemma":[0.00004333675,0.00013911145,0.000058638547,0.0002503553,0.000055402605,0.00028822303,0.0005972844,0.00016238638,0.000005077589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008598555,0.00003651327,0.0019636652,0.0000068677405,0.000026307958,0.0000011585089,0.0012485629,0.00073477475,0.00011006845,0.8641286,0.0013348846,0.13039999],"study_design_scores_gemma":[0.00037539774,0.00005010436,0.0020190978,0.000055809305,0.0000052934415,0.000004891824,0.000035961923,0.99461657,0.00026407026,0.00088100566,0.0014800148,0.00021178038],"about_ca_topic_score_codex":0.000009809629,"about_ca_topic_score_gemma":0.00005309983,"teacher_disagreement_score":0.9938818,"about_ca_system_score_codex":0.000020517953,"about_ca_system_score_gemma":0.000024196797,"threshold_uncertainty_score":0.56728005},"labels":[],"label_agreement":null},{"id":"W2134027571","doi":"10.1109/glocom.2007.747","title":"Relay Selection for Low-Complexity Coded Cooperation","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Relay; Decoding methods; Selection (genetic algorithm); Relay channel; Heuristic; Computer science; Computer network; Transmission (telecommunications); Scheme (mathematics); Mutual information; Diversity gain; Channel (broadcasting); Wireless; Algorithm; Telecommunications; Mathematics; Fading; Artificial intelligence; Power (physics)","score_opus":0.06890904537933018,"score_gpt":0.3213797822309525,"score_spread":0.2524707368516223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134027571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01138552,0.00003841272,0.98132926,0.0010297963,0.00016940576,0.00025073945,3.0388267e-7,0.00023104221,0.005565536],"genre_scores_gemma":[0.8266983,0.000029364739,0.17080751,0.0008507595,0.00007140778,0.000015727928,0.000007999751,0.0000048946786,0.001514038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993131,0.000043568074,0.0001899929,0.00019259268,0.000085956104,0.00017478889],"domain_scores_gemma":[0.9992077,0.00013796875,0.00004304942,0.00028393266,0.00027495556,0.000052436873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070853304,0.00007318297,0.00007702403,0.00006190948,0.0003461342,0.00010970783,0.000359761,0.00003808512,0.000046232675],"category_scores_gemma":[0.00006138444,0.000067221226,0.000033108154,0.00039468714,0.000023994407,0.00032725494,0.000085885564,0.000077861274,0.00002833862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014429293,0.000054471093,0.00018065688,0.0000044475296,0.0000053077465,1.3256589e-7,0.00026180802,0.00039021642,0.013894598,0.92063636,0.004157305,0.060400274],"study_design_scores_gemma":[0.0006232974,0.00009119442,0.0022931658,0.000011890828,0.000002863364,0.000006561726,0.0000150303495,0.9187886,0.04487507,0.0010659843,0.032004204,0.00022215175],"about_ca_topic_score_codex":0.00000503197,"about_ca_topic_score_gemma":0.0005192583,"teacher_disagreement_score":0.9195704,"about_ca_system_score_codex":0.000058260157,"about_ca_system_score_gemma":0.000034752156,"threshold_uncertainty_score":0.2741202},"labels":[],"label_agreement":null},{"id":"W2134058599","doi":"10.1109/wd.2010.5657753","title":"Adaptive Random Linear Network Coding with Controlled Forwarding for wireless broadcast","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Network packet; Linear network coding; Flooding (psychology); Broadcasting (networking); Broadcast radiation; Multicast; Latency (audio); Broadcast communication network; Wireless network; Wireless ad hoc network; Wireless; Distributed computing; Telecommunications","score_opus":0.02569550208476594,"score_gpt":0.26625127328786874,"score_spread":0.2405557712031028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134058599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038733955,0.00011223754,0.9864175,0.0008198311,0.0003714256,0.0009395748,8.745286e-7,0.00021629762,0.007248871],"genre_scores_gemma":[0.82676804,0.00007806407,0.17147475,0.00045427715,0.00030480424,0.0001807498,0.000002732522,0.000014736874,0.0007218461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987507,0.000096020165,0.00028058476,0.00033348962,0.0001648112,0.0003744172],"domain_scores_gemma":[0.99778414,0.0010191535,0.00013492163,0.00061546586,0.00033329806,0.00011302112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084839354,0.00018532116,0.0004149325,0.000057899633,0.0005735671,0.00019737778,0.0008273913,0.0000631138,0.0000316355],"category_scores_gemma":[0.000073602045,0.00013159841,0.00012315167,0.0003623633,0.0000632532,0.00036555875,0.00023508964,0.00028276735,0.000010145305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016560478,0.000079423735,0.00032699917,0.000008829824,0.00020285475,0.000003657061,0.0007530842,0.0034450565,0.0034430672,0.8260769,0.003045456,0.1609586],"study_design_scores_gemma":[0.011991918,0.00014563242,0.00004244655,0.000041340914,0.000017601884,0.0000096351005,0.000040715713,0.97573364,0.00064457755,0.00040255184,0.010680543,0.00024937515],"about_ca_topic_score_codex":0.0000031752154,"about_ca_topic_score_gemma":0.0001401859,"teacher_disagreement_score":0.9722886,"about_ca_system_score_codex":0.000018170573,"about_ca_system_score_gemma":0.000078704405,"threshold_uncertainty_score":0.5366428},"labels":[],"label_agreement":null},{"id":"W2134081331","doi":"10.1109/ccece.2002.1012947","title":"Performance comparison between the use of group signatures and robust error correction codes in wireless multiuser communication systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Space–time block code; Computer science; Convolutional code; Block code; Wireless; Concatenated error correction code; Bandwidth (computing); Communications system; Code (set theory); Coding (social sciences); Real-time computing; Computer engineering; Algorithm; Computer network; Decoding methods; Telecommunications; Mathematics","score_opus":0.10993905265765891,"score_gpt":0.2908597324070865,"score_spread":0.1809206797494276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134081331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86656326,0.001098548,0.13110319,0.00018307762,0.00016295462,0.00034099972,6.4488546e-7,0.000055384964,0.00049192447],"genre_scores_gemma":[0.99332374,0.0008666751,0.0056357784,0.000044512948,0.0000058181595,0.000019636756,0.000004668889,0.0000047009676,0.00009448564],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986805,0.00062593044,0.00030699285,0.0001488824,0.00012333128,0.000114383765],"domain_scores_gemma":[0.99838364,0.00069403026,0.0001393471,0.0006508381,0.00010527396,0.000026885606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000589365,0.00009464705,0.00018154093,0.00007615197,0.00022134456,0.00012869843,0.0005103631,0.000053980508,0.0000025298361],"category_scores_gemma":[0.000050193423,0.00006801059,0.000017086346,0.0004041943,0.00008969014,0.00048381797,0.00017551795,0.0002367019,0.0000011162399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017370723,0.00018944411,0.72064316,0.00004081504,0.00003722602,2.0094264e-7,0.0040983707,0.12579541,0.0007879316,0.06639231,0.0021162243,0.07988154],"study_design_scores_gemma":[0.00019633364,0.000027960417,0.109073475,0.00008434028,0.0000034006841,0.0000011974781,0.00014821408,0.8884445,0.00035387432,0.000003957181,0.0015776005,0.00008514547],"about_ca_topic_score_codex":0.000118113334,"about_ca_topic_score_gemma":0.0005143509,"teacher_disagreement_score":0.7626491,"about_ca_system_score_codex":0.00003078902,"about_ca_system_score_gemma":0.000014237899,"threshold_uncertainty_score":0.27733913},"labels":[],"label_agreement":null},{"id":"W2134094981","doi":"10.1109/vtcf.2006.546","title":"Performance of Cooperative Ad-Hoc Networks in Rayleigh Fading Channels","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Relay; Throughput; Wireless ad hoc network; Rayleigh fading; Computer science; Cooperative diversity; Fading; Node (physics); Diversity gain; Channel (broadcasting); Blocking (statistics); Transmission (telecommunications); Mobile ad hoc network; Wireless; Telecommunications; Network packet; Engineering","score_opus":0.021153203173515007,"score_gpt":0.24254216953223592,"score_spread":0.2213889663587209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134094981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8167815,0.0027401163,0.17803231,0.00089670357,0.0002453612,0.0002589207,6.489432e-7,0.00024176908,0.00080263463],"genre_scores_gemma":[0.9936674,0.002311719,0.003728674,0.00007193836,0.000022763787,0.00006111006,0.0000031453026,0.000010108736,0.00012311629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984757,0.00011911162,0.00044178157,0.0004240733,0.00015600918,0.00038338063],"domain_scores_gemma":[0.99854356,0.00007419447,0.00015928509,0.0008498841,0.0003397169,0.00003333519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032539247,0.00021038787,0.00035040348,0.0004485074,0.00015534452,0.000055563512,0.0015182096,0.00024107686,0.000015169316],"category_scores_gemma":[0.000029128487,0.00020534101,0.000045509696,0.001716327,0.00027633298,0.00032995816,0.00034006973,0.00048462706,0.000014700298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005163294,0.0005246,0.0351331,0.000059972077,0.00007785902,0.00009236121,0.0011745662,0.21620734,0.10648174,0.3475908,0.000537943,0.29206806],"study_design_scores_gemma":[0.0005865945,0.00018382841,0.002492087,0.00022333027,0.0000044294793,0.00001912487,0.00003115658,0.94570535,0.04791389,0.0007260107,0.0017897374,0.00032447843],"about_ca_topic_score_codex":0.000005109479,"about_ca_topic_score_gemma":0.00007797601,"teacher_disagreement_score":0.72949797,"about_ca_system_score_codex":0.000059390895,"about_ca_system_score_gemma":0.000095707226,"threshold_uncertainty_score":0.8373564},"labels":[],"label_agreement":null},{"id":"W2134198979","doi":"10.1109/tcomm.2013.110413.120762","title":"Multi-Way MIMO Amplify-and-Forward Relay Networks with Zero-Forcing Transmission","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Relay; Transmission (telecommunications); Pairwise comparison; Pairwise error probability; Relay channel; Multiplexing; Node (physics); Channel state information; Topology (electrical circuits); Signal-to-noise ratio (imaging); Computer science; Channel (broadcasting); Electronic engineering; Mathematics; Control theory (sociology); Telecommunications; Engineering; Wireless; Physics; Power (physics)","score_opus":0.04130863413088687,"score_gpt":0.27266169821131425,"score_spread":0.23135306408042738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134198979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005233044,0.0010435593,0.98866105,0.0071535716,0.00010827221,0.000547172,0.0000022959011,0.00036558489,0.0015951941],"genre_scores_gemma":[0.80203867,0.0069175404,0.18928424,0.0005414967,0.000010668751,0.0003072197,0.000006808905,0.000027049406,0.0008663217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823153,0.00040451906,0.00041675867,0.00040781265,0.00020083193,0.00033854172],"domain_scores_gemma":[0.99573267,0.00059618364,0.00012404754,0.0030808207,0.00023383088,0.00023242363],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030495122,0.0002754625,0.0002574633,0.00021409788,0.0016915862,0.00025360953,0.002081951,0.00012997018,0.00010078692],"category_scores_gemma":[0.0000058559303,0.00022893323,0.00007839886,0.0007942993,0.00030561138,0.0008102092,0.000037154823,0.0008333988,0.000082465885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002636492,0.0007733241,0.000079795616,0.000021271102,0.0001788991,0.0000013393595,0.004995185,0.09049811,0.004161568,0.014987991,0.0016154916,0.8826606],"study_design_scores_gemma":[0.00091171404,0.00017382801,0.0008836726,0.00020245551,0.00003562176,0.000024805278,0.000114437855,0.9797244,0.0004893817,0.00019291336,0.016815923,0.00043083692],"about_ca_topic_score_codex":0.00010884072,"about_ca_topic_score_gemma":0.00019972338,"teacher_disagreement_score":0.8892263,"about_ca_system_score_codex":0.00007284013,"about_ca_system_score_gemma":0.000045830267,"threshold_uncertainty_score":0.9996081},"labels":[],"label_agreement":null},{"id":"W2134199557","doi":"10.1109/vetecf.2010.5594291","title":"Two-Way Relaying Using Constant Envelop Modulation and Phase-Superposition-Phase-Forward","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Rayleigh fading; Superposition principle; Phase-shift keying; Transmission (telecommunications); Bit error rate; Computer science; Modulation (music); Electronic engineering; Phase (matter); Amplifier; Power (physics); Topology (electrical circuits); Control theory (sociology); Fading; Channel (broadcasting); Telecommunications; Engineering; Mathematics; Physics; Electrical engineering; Bandwidth (computing); Acoustics","score_opus":0.04931451716925619,"score_gpt":0.3344850153274178,"score_spread":0.28517049815816164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134199557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35177886,0.00008481991,0.64264154,0.00066287717,0.00018835287,0.00012737441,0.0000010785935,0.00011881565,0.0043962747],"genre_scores_gemma":[0.86708915,0.00006859038,0.13232566,0.0003892213,0.0000465986,0.000005427582,0.0000054751526,0.000006678744,0.00006319566],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907887,0.000075916294,0.00024088322,0.00027722845,0.0001456378,0.0001814513],"domain_scores_gemma":[0.99908596,0.00010776948,0.00006583753,0.00049414614,0.00014251593,0.00010375299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035198402,0.00012228404,0.00012776627,0.00010348795,0.00048392007,0.0002551068,0.00033025767,0.000047841237,0.00009592337],"category_scores_gemma":[0.000039342198,0.00011336896,0.000029842124,0.0003090902,0.00007662195,0.00069431076,0.00025390513,0.00022496849,0.000011136448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007811184,0.00010742119,0.0002667502,0.0000034355123,0.000014862116,0.0000034105294,0.00075298984,0.00019420544,0.4333369,0.33942765,0.00012785781,0.22575672],"study_design_scores_gemma":[0.0015026081,0.000044130153,0.00012570481,0.000018767807,0.000005474974,0.000043623113,0.000026396345,0.98848844,0.006464424,0.0010400818,0.0020519937,0.00018835734],"about_ca_topic_score_codex":0.000008269291,"about_ca_topic_score_gemma":0.000035866942,"teacher_disagreement_score":0.98829424,"about_ca_system_score_codex":0.000026651189,"about_ca_system_score_gemma":0.000052767475,"threshold_uncertainty_score":0.4623052},"labels":[],"label_agreement":null},{"id":"W2134285433","doi":"10.1109/icc.2008.807","title":"Amplify-and-Forward Cooperative Systems with Fixed Gain Relays","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Diversity gain; Hop (telecommunications); Computer science; Probability density function; Channel (broadcasting); Transmission (telecommunications); Topology (electrical circuits); Wireless; Cooperative diversity; Communications system; Probability of error; Bit error rate; Algorithm; Mathematics; Telecommunications; Statistics","score_opus":0.041474281629820565,"score_gpt":0.24950097503868937,"score_spread":0.2080266934088688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134285433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013276079,0.0010290184,0.9520603,0.0010948752,0.00010325431,0.0003904684,9.3948006e-7,0.00027856114,0.03176653],"genre_scores_gemma":[0.9806669,0.0010061382,0.012487507,0.00056507724,0.000028519773,0.00005623028,0.0000029693192,0.000007901956,0.005178769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908304,0.00015441992,0.00016471845,0.0002660419,0.00015303987,0.00017871492],"domain_scores_gemma":[0.9989914,0.00014679076,0.00004704244,0.0005554421,0.0001586854,0.00010067416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001608277,0.00012549061,0.00016520376,0.000054462194,0.00042180775,0.00012546507,0.00047465804,0.00003826786,0.000021546897],"category_scores_gemma":[0.000022686087,0.00008772333,0.000016142956,0.0003529269,0.00009696521,0.00033635253,0.00025262425,0.0001564841,0.00005235835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003281766,0.000121165984,0.006428528,0.00001734537,0.000102400896,0.00006147344,0.006489114,0.0037166956,0.0009815212,0.943511,0.027298637,0.011239314],"study_design_scores_gemma":[0.0020197802,0.00064268743,0.00522428,0.00014553286,0.000012403304,0.0007378185,0.00053296273,0.8593836,0.0012455056,0.00009144074,0.1289733,0.0009906905],"about_ca_topic_score_codex":0.000015096477,"about_ca_topic_score_gemma":0.000026980415,"teacher_disagreement_score":0.96739084,"about_ca_system_score_codex":0.000027307626,"about_ca_system_score_gemma":0.000064891814,"threshold_uncertainty_score":0.35772538},"labels":[],"label_agreement":null},{"id":"W2134310554","doi":"10.1109/icc.2007.964","title":"Design of Collaborative Codes Achieving Space-Time Diversity","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Pairwise error probability; Computer science; Diversity gain; Cooperative diversity; Space–time code; Relay; Coding (social sciences); Coding gain; Theoretical computer science; Reliability (semiconductor); Wireless network; Wireless; Block code; Algorithm; Decoding methods; Telecommunications; Fading; Mathematics","score_opus":0.042147062421068304,"score_gpt":0.2732527367088976,"score_spread":0.2311056742878293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134310554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007527961,0.00019753039,0.97988737,0.00046054853,0.00003870075,0.00012364145,3.7533252e-7,0.00007978128,0.011684103],"genre_scores_gemma":[0.8305952,0.00012844108,0.16858912,0.00012847819,0.000009165493,6.581014e-7,4.6167978e-7,0.0000021144222,0.0005463635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930537,0.00014177847,0.00013492051,0.00013869183,0.00014334288,0.00013592806],"domain_scores_gemma":[0.99885577,0.000410903,0.00007348212,0.00036785594,0.00024108206,0.00005089057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088638376,0.00006993213,0.00012011988,0.00007300803,0.00028335856,0.00003368564,0.00071573054,0.000026466214,0.000062783336],"category_scores_gemma":[0.000052524025,0.00006263815,0.000021071106,0.00064998475,0.00005347942,0.00026741298,0.0010729751,0.0000664093,0.00003000851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011491957,0.00038887074,0.0143186385,0.000017889164,0.00016318007,0.000018607787,0.024597293,0.0036983667,0.15272301,0.644365,0.0117663145,0.1478279],"study_design_scores_gemma":[0.0028473374,0.0010216756,0.0693122,0.00023367167,0.000047390207,0.000015829813,0.0015848792,0.6101914,0.29634973,0.0034753813,0.013233438,0.0016870358],"about_ca_topic_score_codex":0.0000053887816,"about_ca_topic_score_gemma":0.00001854016,"teacher_disagreement_score":0.82306725,"about_ca_system_score_codex":0.000030786014,"about_ca_system_score_gemma":0.0000414011,"threshold_uncertainty_score":0.25543097},"labels":[],"label_agreement":null},{"id":"W2134332461","doi":"10.1109/twc.2008.060952","title":"Cooperative Diversity with Multiple-Antenna Nodes in Fading Relay Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Relay; Pairwise error probability; Computer science; Fading; Channel state information; Topology (electrical circuits); Transmitter power output; Cooperative diversity; Channel (broadcasting); Computer network; Transmission (telecommunications); Telecommunications; Wireless; Mathematics; Power (physics); Combinatorics; Physics; Transmitter","score_opus":0.0690217161624929,"score_gpt":0.2715420785368708,"score_spread":0.20252036237437787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134332461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084079534,0.00020548777,0.9120405,0.0022299597,0.00013384102,0.00036451683,0.000009106918,0.00024933284,0.00068775343],"genre_scores_gemma":[0.9840031,0.0043579917,0.010785963,0.0003386976,0.000008895158,0.00014594597,0.0000060367884,0.000018688432,0.0003346453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820256,0.00047739164,0.00033985465,0.00039658093,0.00026329455,0.00032028984],"domain_scores_gemma":[0.99623597,0.00072045054,0.000106071675,0.0025397004,0.0002770902,0.00012073979],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00025827636,0.00024503015,0.00028428718,0.00035326765,0.0028426703,0.00008278227,0.0027443182,0.00008734459,0.000017987544],"category_scores_gemma":[0.0000124288135,0.00023330648,0.000084410094,0.0014573634,0.0003799773,0.00078375946,0.00012474207,0.000758151,0.00004259805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005773313,0.010688446,0.027547324,0.00007267166,0.0008958561,0.00019216553,0.1715438,0.47858733,0.015317916,0.07709284,0.00066380715,0.2168205],"study_design_scores_gemma":[0.0023000236,0.00021930161,0.004618278,0.00030664945,0.00002175814,0.00009160968,0.00055035815,0.98526,0.0047874865,0.000050564722,0.001018418,0.00077552284],"about_ca_topic_score_codex":0.00012616986,"about_ca_topic_score_gemma":0.0017443307,"teacher_disagreement_score":0.9012545,"about_ca_system_score_codex":0.00018460014,"about_ca_system_score_gemma":0.000116149575,"threshold_uncertainty_score":0.99845546},"labels":[],"label_agreement":null},{"id":"W2134584916","doi":"10.1109/waina.2012.215","title":"Co-existence of Evolutionary Mixed-Bias Scheduling with Quiescence and IEEE 802.11 DCF for Wireless Mesh Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Scheduling (production processes); IEEE 802.11; IEEE 802.11s; Network packet; Computer network; Wireless mesh network; Throughput; Wireless network; Wireless; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.06064428285903567,"score_gpt":0.289292749528522,"score_spread":0.22864846666948635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134584916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12482389,0.0008590711,0.87275904,0.00026734182,0.00017521498,0.00023799774,0.0000012645794,0.00007654008,0.0007996264],"genre_scores_gemma":[0.89152014,0.00040215536,0.10762534,0.00018081623,0.00007370769,0.000029656934,0.0000029968528,0.000007737262,0.00015744568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989365,0.00009703233,0.0002395373,0.00023745105,0.00016918893,0.0003202879],"domain_scores_gemma":[0.9986093,0.00038247652,0.00012860942,0.00052318466,0.00023340619,0.00012301192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045828352,0.00014011952,0.00019558409,0.000053871077,0.00025958233,0.00005589186,0.0006056799,0.000052499672,0.000007726277],"category_scores_gemma":[0.000030127729,0.000113877446,0.000036646223,0.00031488814,0.00017216426,0.00064921484,0.00015266032,0.00011146461,0.0000019673464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006585505,0.00025014783,0.097827435,0.00007893102,0.000052502834,9.669654e-7,0.0017646041,0.0012811173,0.0018576042,0.83338886,0.002208971,0.061222997],"study_design_scores_gemma":[0.000671974,0.0001670537,0.025690233,0.00019799234,0.000015259224,0.000031946165,0.00024526418,0.9679796,0.0031467634,0.00014599047,0.0013094374,0.00039849797],"about_ca_topic_score_codex":0.0000066535285,"about_ca_topic_score_gemma":0.000044586577,"teacher_disagreement_score":0.96669847,"about_ca_system_score_codex":0.000028621751,"about_ca_system_score_gemma":0.00005746929,"threshold_uncertainty_score":0.46437874},"labels":[],"label_agreement":null},{"id":"W2134721134","doi":"10.1109/pimrc.2009.5450070","title":"Autonomous infrastructure based multihop cellular networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Base station; Computer network; Cellular network; Computer science; Bottleneck; Transmission (telecommunications); Transmitter power output; Mobile station; Access network; Mobile telephony; Telecommunications; Mobile radio; Channel (broadcasting); Embedded system","score_opus":0.014246841929211686,"score_gpt":0.24054944358261698,"score_spread":0.2263026016534053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134721134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011884065,0.00026833406,0.98361224,0.0028336612,0.00014755999,0.0000987027,1.1891204e-7,0.0003379072,0.011513067],"genre_scores_gemma":[0.9184226,0.00004750845,0.075919986,0.005126941,0.000058684996,0.000002833341,0.0000038627268,0.0000036682281,0.00041393287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992064,0.000079597594,0.00016204524,0.00023390511,0.000105835265,0.00021219088],"domain_scores_gemma":[0.9989336,0.00005501819,0.00004418821,0.0008034372,0.000074477815,0.00008926168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001465135,0.000118861346,0.00010991184,0.000057911246,0.00018206386,0.00015751591,0.0009888734,0.000058287886,0.00014424347],"category_scores_gemma":[0.000015372423,0.000102171856,0.000050600484,0.000382064,0.000019383626,0.00021644404,0.0001283796,0.00018559514,0.00002619896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035869841,0.00006225173,0.00022177692,0.0000011782628,0.000006329859,0.000008173096,0.00019772748,0.051693887,0.0021162208,0.18238866,0.009860827,0.75343937],"study_design_scores_gemma":[0.00022531244,0.000038918584,0.0038528359,0.000006084328,0.0000012824977,0.0000013964767,0.0000024601352,0.9734423,0.0009836764,0.00043447502,0.020870104,0.00014115585],"about_ca_topic_score_codex":0.0000010179917,"about_ca_topic_score_gemma":0.0000037544253,"teacher_disagreement_score":0.9217484,"about_ca_system_score_codex":0.00003673914,"about_ca_system_score_gemma":0.00004860065,"threshold_uncertainty_score":0.41664472},"labels":[],"label_agreement":null},{"id":"W2134865073","doi":"10.1109/mcom.2007.4378328","title":"Radio Resource Management in MIMO-OFDM- Mesh Networks: Issues and Approaches","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Reinforcement learning; MIMO; Wireless mesh network; Scheduling (production processes); Orthogonal frequency-division multiplexing; Router; Radio resource management; Game theory; Admission control; Wireless; Wireless network; Stochastic game; Q-learning; Distributed computing; Telecommunications; Mathematical optimization; Artificial intelligence; Channel (broadcasting)","score_opus":0.07608413418537142,"score_gpt":0.3037574017853133,"score_spread":0.2276732675999419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134865073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041086623,0.039760567,0.7861877,0.021941427,0.00028897138,0.0011385373,0.0000016395262,0.00052672566,0.14604576],"genre_scores_gemma":[0.8356106,0.020571018,0.14089623,0.0006092247,0.000075378746,0.000073858886,0.000020813904,0.000021154847,0.0021216648],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983799,0.00033176996,0.00044577286,0.0003402509,0.0001648078,0.00033750723],"domain_scores_gemma":[0.9958717,0.00035279713,0.000110046196,0.003500156,0.00006009095,0.00010519743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016075943,0.00018389877,0.00021288266,0.0002899214,0.00034952836,0.00017439971,0.0029333725,0.000066491615,0.0000072069397],"category_scores_gemma":[0.000024598721,0.00019161619,0.000040985335,0.001107281,0.00020833286,0.00034019517,0.0016043917,0.0003657611,0.000031517055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016053147,0.00034054345,0.0013954723,0.000018307044,0.000057413396,0.000010837892,0.0019042678,0.0006329919,0.00010080281,0.4055909,0.011843496,0.57808894],"study_design_scores_gemma":[0.0010929158,0.000055878416,0.042140216,0.00014522171,0.000019694353,0.000029972594,0.00032480792,0.39923656,0.000088613364,0.001277619,0.5550271,0.0005614006],"about_ca_topic_score_codex":0.000007026188,"about_ca_topic_score_gemma":0.0003815199,"teacher_disagreement_score":0.831502,"about_ca_system_score_codex":0.0000785688,"about_ca_system_score_gemma":0.00001312803,"threshold_uncertainty_score":0.78138816},"labels":[],"label_agreement":null},{"id":"W2134903892","doi":"10.1109/itw.2007.4313055","title":"Average Throughput with Linear Network Coding over the Binary Field","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Linear network coding; Throughput; Binary number; Computer science; Coding (social sciences); Multicast; Maximum throughput scheduling; Algorithm; Computer network; Mathematics; Statistics; Arithmetic; Network packet; Telecommunications","score_opus":0.030989617216003552,"score_gpt":0.2867916858249907,"score_spread":0.25580206860898713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134903892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007836984,0.00032192766,0.9497159,0.0032373257,0.0001852489,0.00012363603,6.296679e-8,0.00014899102,0.03842993],"genre_scores_gemma":[0.9645931,0.00030305845,0.026030518,0.007569993,0.00022833662,0.0000037815657,7.607598e-7,0.0000065448658,0.0012638825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991579,0.0000656832,0.00015190846,0.00019126576,0.00016381862,0.00026939128],"domain_scores_gemma":[0.99834615,0.00073615054,0.0000483562,0.000758902,0.0000610784,0.000049337286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065361074,0.00010213865,0.00008949707,0.000024376151,0.00044728603,0.00010659192,0.0009004178,0.00003494577,0.00013813013],"category_scores_gemma":[0.00002521054,0.000058616606,0.000033790107,0.00054561574,0.000037350244,0.00025151848,0.00045509712,0.00022619306,0.000031242213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049482638,0.000082412625,0.00901496,0.00000637223,0.00006209113,0.000049939572,0.0026462083,0.00802188,0.00029893676,0.81658214,0.04896606,0.1142195],"study_design_scores_gemma":[0.0009394494,0.00047013667,0.036596697,0.0001394692,0.0000101711385,0.00005243413,0.00011134364,0.55962574,0.002137453,0.0011221647,0.3981262,0.00066870655],"about_ca_topic_score_codex":0.0000090226995,"about_ca_topic_score_gemma":0.00013857598,"teacher_disagreement_score":0.9567561,"about_ca_system_score_codex":0.000019472029,"about_ca_system_score_gemma":0.000023589148,"threshold_uncertainty_score":0.34402078},"labels":[],"label_agreement":null},{"id":"W2134905923","doi":"10.1109/icassp.2006.1661062","title":"Optimal Power Allocation for Full-Duplex Cooperative Multiple Access","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Quality of service; Computer network; Mathematical optimization; Transmission (telecommunications); Channel (broadcasting); Convex optimization; Key (lock); Power (physics); Pairwise comparison; Regular polygon; Telecommunications; Mathematics","score_opus":0.045149661911998186,"score_gpt":0.3116903215743187,"score_spread":0.2665406596623205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134905923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02953234,0.00013869334,0.9627987,0.0025701008,0.00014150879,0.00040554313,0.000002143279,0.00018863972,0.0042223125],"genre_scores_gemma":[0.91038793,0.000030316272,0.08691715,0.00056944904,0.000056213787,0.000113995,0.000026915908,0.0000078768235,0.0018901274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991106,0.00006283634,0.0002171395,0.00028890226,0.00011666511,0.00020390251],"domain_scores_gemma":[0.99878323,0.0002220085,0.00006052613,0.0004963479,0.0003936596,0.000044237055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002038139,0.0001208263,0.0001156748,0.00006248469,0.0003052043,0.000400269,0.0010436164,0.000040691248,0.00009098085],"category_scores_gemma":[0.00006028227,0.00010528488,0.00004997635,0.00033949997,0.000034567965,0.00081659044,0.0003461368,0.00007147038,0.00003288304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005207542,0.00034939536,0.0007358499,0.00000877283,0.000036101883,0.000001280803,0.0007865762,0.11845956,0.024718273,0.7713211,0.058856346,0.024674661],"study_design_scores_gemma":[0.0006187394,0.00008183878,0.0021455938,0.000007827905,0.0000023884043,0.0000024943809,0.000022822276,0.9503002,0.008152641,0.00008466757,0.038375467,0.00020530139],"about_ca_topic_score_codex":0.000018118331,"about_ca_topic_score_gemma":0.00024114044,"teacher_disagreement_score":0.8808556,"about_ca_system_score_codex":0.00004226352,"about_ca_system_score_gemma":0.000056443543,"threshold_uncertainty_score":0.4293393},"labels":[],"label_agreement":null},{"id":"W2134914860","doi":"10.1109/camsap.2009.5413281","title":"Cooperative amplify-and-forward beamforming with multi-antenna source and relays","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Beamforming; Rayleigh fading; Relay; Computer science; Signal-to-noise ratio (imaging); Antenna (radio); Transmission (telecommunications); Node (physics); Maximal-ratio combining; Topology (electrical circuits); Fading; Electronic engineering; Algorithm; Telecommunications; Engineering; Decoding methods; Acoustics; Power (physics); Physics; Electrical engineering","score_opus":0.026928943848745213,"score_gpt":0.262006105657863,"score_spread":0.23507716180911775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134914860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017260104,0.00056420127,0.97745895,0.0021783246,0.000020956026,0.00019724578,3.012568e-7,0.00014635091,0.0021735383],"genre_scores_gemma":[0.887099,0.0006957071,0.10870972,0.0019973295,0.000014688475,0.000009384629,0.0000014544723,0.0000055298647,0.0014671489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992328,0.00005756187,0.00014255705,0.00028058205,0.00009855163,0.0001879369],"domain_scores_gemma":[0.9993023,0.00008440423,0.00004337762,0.000364011,0.00009813392,0.000107722444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019088593,0.00013427567,0.00014851814,0.000057506888,0.00035585993,0.00021175815,0.00031173305,0.000035913934,0.0000088467705],"category_scores_gemma":[0.000024979534,0.00009509667,0.000013372832,0.0002422049,0.00006845955,0.00045729664,0.00021945641,0.00017090759,0.000007059213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037782556,0.00015759184,0.0028386305,0.000008788809,0.000054945223,0.000011231716,0.011516089,0.00034967918,0.006784745,0.27013373,0.0006172903,0.7074895],"study_design_scores_gemma":[0.0018082645,0.00066104764,0.011086975,0.000115641604,0.00001435487,0.00012670382,0.0005677362,0.9543501,0.0011305829,0.0002250286,0.029263651,0.000649919],"about_ca_topic_score_codex":0.0000052567325,"about_ca_topic_score_gemma":0.000048673195,"teacher_disagreement_score":0.9540004,"about_ca_system_score_codex":0.000014838523,"about_ca_system_score_gemma":0.00002357568,"threshold_uncertainty_score":0.38779297},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Relay; Eavesdropping; Selection (genetic algorithm); Cooperative diversity; Wireless network; Wireless; Outage probability; Relay channel","score_opus":0.041135545299955015,"score_gpt":0.3173365994603299,"score_spread":0.2762010541603749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134968843","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6384414,0.00065416336,0.34909347,0.008441458,0.00035397828,0.0014530494,0.000003532817,0.00018844307,0.0013704944],"genre_scores_gemma":[0.98530966,0.0019579614,0.011627365,0.00046371936,0.00013814495,0.00038873093,0.000012752126,0.0000230181,0.00007867279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731576,0.0010786094,0.0006078402,0.00032022464,0.00021897377,0.00045856947],"domain_scores_gemma":[0.99597734,0.0012816804,0.00026949676,0.0012141555,0.001109275,0.00014803646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006642412,0.00024760317,0.00034815163,0.0003884127,0.00073122006,0.00041424134,0.0024208685,0.0001248678,0.000019217876],"category_scores_gemma":[0.00020867157,0.00023613953,0.000094386436,0.002420804,0.00009498249,0.0009183765,0.0002698654,0.0016837936,0.000023646124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019601692,0.004871827,0.007549713,0.000017405444,0.00020525389,0.0000056200533,0.012477863,0.7779401,0.009339974,0.09756958,0.016257651,0.07356902],"study_design_scores_gemma":[0.0009190742,0.00024895472,0.0045795795,0.00014850155,0.0000057938714,0.00003244771,0.00006884871,0.990857,0.0006621046,0.0006056103,0.0015962321,0.00027585457],"about_ca_topic_score_codex":0.000027611479,"about_ca_topic_score_gemma":0.0007798668,"teacher_disagreement_score":0.34686822,"about_ca_system_score_codex":0.0004176401,"about_ca_system_score_gemma":0.00023484572,"threshold_uncertainty_score":0.96294904},"labels":[],"label_agreement":null},{"id":"W2135055618","doi":"10.5281/zenodo.41255","title":"Sequential Interference Subtraction Multi-User Transceivers: Designs For General Bounded Channel Uncertainty Models","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Precoding; Channel (broadcasting); Bounded function; Computer science; Zero-forcing precoding; Interference (communication); Transceiver; Robustness (evolution); Mathematical optimization; Intersection (aeronautics); Algorithm; Mathematics; MIMO; Telecommunications; Engineering; Wireless","score_opus":0.24926362709589922,"score_gpt":0.32953054491239747,"score_spread":0.08026691781649825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135055618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013208281,0.000084400715,0.9846558,0.00046482473,0.0003061049,0.0003376796,0.0000028060467,0.00019950775,0.000740615],"genre_scores_gemma":[0.8696935,0.00042123336,0.12726113,0.0003839521,0.000060205493,0.00006597216,0.000009431163,0.000008585959,0.002095964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989645,0.00009214101,0.00021880503,0.00033799742,0.00012492646,0.00026165397],"domain_scores_gemma":[0.99909836,0.00009209175,0.000056293742,0.00044169475,0.00022408656,0.000087458786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018756144,0.00014917219,0.00014586256,0.0000815496,0.00047310308,0.0001093725,0.0007577151,0.000063607135,0.00003407628],"category_scores_gemma":[0.000013335176,0.0001383407,0.00010463144,0.0002116464,0.00006798905,0.0009276529,0.000067400906,0.00013201212,0.000011874978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029219288,0.0007556816,0.00007058431,0.000031294505,0.0001695895,0.000013958766,0.015447464,0.16048884,0.042513732,0.72039974,0.006911601,0.052905332],"study_design_scores_gemma":[0.0008734642,0.00007777704,0.00009300109,0.00001356097,0.0000049139635,0.000015305895,0.000031606352,0.99075717,0.0044000326,0.0018975645,0.0016322254,0.0002033828],"about_ca_topic_score_codex":0.00005072977,"about_ca_topic_score_gemma":0.0003039628,"teacher_disagreement_score":0.85739464,"about_ca_system_score_codex":0.00009681564,"about_ca_system_score_gemma":0.000109117966,"threshold_uncertainty_score":0.564137},"labels":[],"label_agreement":null},{"id":"W2135079382","doi":"10.1109/icc.2007.787","title":"Cooperation and Routing in Multi-Hop Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Hop (telecommunications); Routing protocol; Cooperative diversity; Bandwidth (computing); Distributed computing; Dynamic Source Routing; Network routing; Routing (electronic design automation); Fading","score_opus":0.05184010672963648,"score_gpt":0.3068512800788597,"score_spread":0.25501117334922324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135079382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017242577,0.00022797468,0.9789624,0.00039828327,0.00006722074,0.00007739117,1.59167e-8,0.00006738255,0.0029567443],"genre_scores_gemma":[0.96266663,0.0002500698,0.036246385,0.0005775738,0.000017959537,0.0000019133845,7.498453e-7,0.0000025547974,0.0002361446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944395,0.000048219874,0.00016061263,0.00014954185,0.000046141395,0.00015151287],"domain_scores_gemma":[0.9995632,0.00010689989,0.000023191322,0.00021784798,0.00004784798,0.00004099254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007379225,0.0000565361,0.00006298052,0.000058893176,0.00010885453,0.00010033524,0.00022375815,0.000030848227,0.000008444637],"category_scores_gemma":[0.000037649923,0.00005153764,0.000008281797,0.00035031902,0.000016290436,0.00026544515,0.00021267639,0.00011059791,0.000004253862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037964774,0.000055648135,0.0170707,0.0000014644208,0.0000033935755,0.0000058223504,0.0014490129,0.0014219987,0.0010573859,0.47810796,0.0001551463,0.5006677],"study_design_scores_gemma":[0.00026106992,0.000009503576,0.027835457,0.000011013369,3.0168042e-7,0.0000029907205,0.000029918583,0.9710523,0.00018570364,0.000017403967,0.00051737495,0.00007694482],"about_ca_topic_score_codex":0.00000971921,"about_ca_topic_score_gemma":0.0008982795,"teacher_disagreement_score":0.9696303,"about_ca_system_score_codex":0.00002191167,"about_ca_system_score_gemma":0.000009715005,"threshold_uncertainty_score":0.2101644},"labels":[],"label_agreement":null},{"id":"W2135386172","doi":"10.1109/netcod.2009.5191397","title":"Sparse network coding with overlapping classes","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Decoding methods; Computer science; Disjoint sets; Coding (social sciences); Gaussian; Algorithm; Theoretical computer science; Network packet; Shannon–Fano coding; Tunstall coding; Variable-length code; Mathematics; Computer network; Discrete mathematics","score_opus":0.05815886776890307,"score_gpt":0.2848231238879329,"score_spread":0.22666425611902985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135386172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075208594,0.001422253,0.91740113,0.0023025528,0.00039015317,0.00029787477,4.5862322e-7,0.000584874,0.07684863],"genre_scores_gemma":[0.6589624,0.004714258,0.33123234,0.0031196894,0.000495672,0.00004039638,0.000017008819,0.000024269246,0.001393923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981314,0.00020472065,0.0003216491,0.00063933857,0.00028934958,0.00041351974],"domain_scores_gemma":[0.99752206,0.00016565534,0.00021622643,0.0017867911,0.00019173401,0.00011752989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045128062,0.00032531496,0.00038615515,0.00009432345,0.00032134607,0.00071925344,0.0021356624,0.00015023464,0.000051929477],"category_scores_gemma":[0.000022408838,0.00026914992,0.00008926134,0.00046566772,0.000045209992,0.0002697345,0.002589875,0.0007863423,0.000031869597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011822597,0.00010767598,0.0006688527,0.00004005513,0.00010419084,0.000028427437,0.00047565982,0.060570724,0.00005630334,0.7893963,0.025882222,0.12265779],"study_design_scores_gemma":[0.00069551414,0.0002535436,0.0067916173,0.0022554698,0.0000429747,0.000046195222,0.000039754075,0.8589594,0.00017381145,0.020875674,0.10801014,0.0018559187],"about_ca_topic_score_codex":0.0000063682164,"about_ca_topic_score_gemma":0.000107518565,"teacher_disagreement_score":0.79838866,"about_ca_system_score_codex":0.00009767072,"about_ca_system_score_gemma":0.00022826105,"threshold_uncertainty_score":0.9999761},"labels":[],"label_agreement":null},{"id":"W2135389503","doi":"10.1109/isssta.2008.46","title":"Optimized Power Allocation for Multiple-Antenna Multiple-Relay Cooperative Communication System","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Medical Research Council","keywords":"Relay; Rayleigh fading; Computer science; Beamforming; Hop (telecommunications); Power (physics); Transmitter power output; Power budget; Interference (communication); Relay channel; Antenna (radio); Communications system; Channel (broadcasting); Electronic engineering; Computer network; Fading; Telecommunications; Power control; Engineering","score_opus":0.048982161164175066,"score_gpt":0.2719526973388063,"score_spread":0.22297053617463122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135389503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043721823,0.0007122338,0.9876832,0.0024612644,0.00021281152,0.0011387202,0.000004719336,0.0005785777,0.002836298],"genre_scores_gemma":[0.75069106,0.0004896019,0.24712744,0.00039594623,0.000019895146,0.00029635718,0.000041913023,0.000016372798,0.00092138513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981166,0.00040607277,0.0005197344,0.00043179732,0.00022131413,0.0003044565],"domain_scores_gemma":[0.9959347,0.0011840989,0.00019166288,0.0016331567,0.000936386,0.00011996205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005929117,0.0002368368,0.00030941053,0.00012639572,0.0011126373,0.0001394881,0.001597021,0.00009937364,0.000022508926],"category_scores_gemma":[0.00036990058,0.00020904615,0.00012633977,0.00049017626,0.00012157883,0.000744304,0.00045493062,0.00019518017,0.000071030656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005240108,0.0011735413,0.0028308507,0.000096268595,0.00046540712,0.000012253269,0.024712255,0.024759855,0.027214443,0.8658968,0.034950417,0.017363861],"study_design_scores_gemma":[0.0023854072,0.00008637216,0.0007651863,0.00006797748,0.000006914763,0.000029538098,0.00030960198,0.98673666,0.0019934385,0.000012187705,0.007296991,0.0003097267],"about_ca_topic_score_codex":0.00002081241,"about_ca_topic_score_gemma":0.000057368346,"teacher_disagreement_score":0.9619768,"about_ca_system_score_codex":0.00016420613,"about_ca_system_score_gemma":0.00011509397,"threshold_uncertainty_score":0.85576195},"labels":[],"label_agreement":null},{"id":"W2135562102","doi":"10.1109/vetecs.2009.5073464","title":"Cooperative Communication Using Bit-Selective Adaptive Demodulation and Raptor Codes: The Gaussian Relay Channel Case","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Demodulation; Computer science; Additive white Gaussian noise; QAM; Relay; Decoding methods; Bit error rate; Algorithm; Channel (broadcasting); Quadrature amplitude modulation; Communications system; Telecommunications","score_opus":0.05532247978223265,"score_gpt":0.2959430020150161,"score_spread":0.24062052223278346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135562102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044236615,0.0016619915,0.94304615,0.005913153,0.000062036335,0.0006273936,0.0000019392558,0.00017011998,0.0042805844],"genre_scores_gemma":[0.9722466,0.00052361994,0.025894409,0.001147203,0.000029533481,0.000014895801,0.0000040140158,0.000006886012,0.00013284879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843156,0.00065537303,0.0002541484,0.00031253693,0.00014034238,0.00020604048],"domain_scores_gemma":[0.9983071,0.00031478237,0.0001325285,0.0008353785,0.000331219,0.00007895477],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000566193,0.00017627234,0.00016928565,0.00009478657,0.0013524778,0.00025361203,0.0005675945,0.00006547226,0.000009065086],"category_scores_gemma":[0.00006613434,0.00012570857,0.00003597847,0.00071009796,0.00012569132,0.0007486703,0.0002583909,0.00028560736,0.000005348017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077520825,0.00025597,0.00014788809,0.000004157657,0.00013014671,0.000047128084,0.036997043,0.018705884,0.0041161664,0.78249174,0.0015944707,0.15543187],"study_design_scores_gemma":[0.0003499096,0.00014575214,0.001676385,0.00003653874,0.000011834021,0.000327329,0.0006918606,0.99390066,0.00086304586,0.0015455647,0.00024187776,0.00020924324],"about_ca_topic_score_codex":0.000053572705,"about_ca_topic_score_gemma":0.00027432485,"teacher_disagreement_score":0.97519475,"about_ca_system_score_codex":0.00010188892,"about_ca_system_score_gemma":0.00006825444,"threshold_uncertainty_score":0.9999476},"labels":[],"label_agreement":null},{"id":"W2135579584","doi":"10.1109/glocom.2003.1258209","title":"Combining space-time coding with power-efficient medium access control for mobile ad-hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Network packet; Throughput; Quality of service; Power control; Access control; Media access control; Coding (social sciences); Linear network coding; Vehicular ad hoc network; Multiple Access with Collision Avoidance for Wireless; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Wireless; Power (physics); Routing protocol; Telecommunications","score_opus":0.020327946539356736,"score_gpt":0.2780356544742644,"score_spread":0.2577077079349077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135579584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005699187,0.0012361897,0.98623395,0.0027120793,0.00025174159,0.00090119214,0.0000014446019,0.000355943,0.0026082762],"genre_scores_gemma":[0.9795454,0.0002850591,0.0184305,0.0011829364,0.000043056032,0.00021635405,0.0000051741945,0.000021205551,0.0002702712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985054,0.00007749408,0.0002817097,0.00043088067,0.00024395077,0.0004605452],"domain_scores_gemma":[0.9982588,0.0003952906,0.00013844398,0.00076879334,0.00027534127,0.00016331865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052781845,0.00021775228,0.00029240578,0.00009998787,0.00048836495,0.000492733,0.0015256882,0.00006421216,0.00006292157],"category_scores_gemma":[0.000032649306,0.00017222932,0.00007502895,0.00055803877,0.00008014621,0.0003905282,0.00043592646,0.00019928424,0.000022920693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001728211,0.0004391881,0.00020791304,0.00001631478,0.00013697037,0.000011985142,0.0023652469,0.7135481,0.0014174832,0.24553764,0.0022343702,0.03391193],"study_design_scores_gemma":[0.0047470205,0.00066107314,0.00035689448,0.00015245465,0.000017017705,0.000014646655,0.00009023525,0.9790359,0.0010321524,0.00024426598,0.0131640835,0.00048423783],"about_ca_topic_score_codex":0.000001486124,"about_ca_topic_score_gemma":0.000023534907,"teacher_disagreement_score":0.97384626,"about_ca_system_score_codex":0.00010959945,"about_ca_system_score_gemma":0.00013707268,"threshold_uncertainty_score":0.70233077},"labels":[],"label_agreement":null},{"id":"W2135763018","doi":"10.1109/ccece.2007.231","title":"A Joint Network-Channel Coding Scheme for Relay-Based Communications","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Saskatchewan","funders":"","keywords":"Computer science; Relay; Fading; Linear network coding; Diversity gain; Relay channel; Computer network; Turbo code; Coding gain; Bit error rate; Wireless; Channel (broadcasting); Electronic engineering; Telecommunications; Decoding methods; Power (physics); Network packet; Engineering","score_opus":0.12324399338806154,"score_gpt":0.3275710556404166,"score_spread":0.20432706225235509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135763018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015490162,0.00059531356,0.9762046,0.0067280857,0.00014697544,0.00034176552,7.640101e-7,0.00030741107,0.015520236],"genre_scores_gemma":[0.41263908,0.00017259171,0.58398896,0.0025621606,0.00007155185,0.000048779086,0.000011213051,0.000010636043,0.0004950499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883217,0.00007495176,0.00035191386,0.00024156104,0.00012838167,0.0003710442],"domain_scores_gemma":[0.9970245,0.00062328915,0.000107055144,0.0018721349,0.0002594657,0.00011359526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624536,0.0001257955,0.00015210379,0.00009377501,0.0006872444,0.00012943102,0.0016569152,0.000057404686,0.000017477063],"category_scores_gemma":[0.000100243014,0.000121239296,0.000099336874,0.0005410483,0.00006763233,0.00022016208,0.0006594671,0.00018298054,0.000026792653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000786495,0.00007285696,0.00009466832,0.0000064857436,0.00001560319,6.127513e-7,0.00022960817,0.00074205897,0.00079624366,0.96730405,0.010403125,0.02032682],"study_design_scores_gemma":[0.0004890756,0.00004783346,0.000370648,0.000048164107,0.0000036220363,0.0000023157593,0.000027504213,0.9323073,0.0010301046,0.002068168,0.06339978,0.00020547688],"about_ca_topic_score_codex":0.0000035915505,"about_ca_topic_score_gemma":0.0001415139,"teacher_disagreement_score":0.9652359,"about_ca_system_score_codex":0.000064987784,"about_ca_system_score_gemma":0.00006970761,"threshold_uncertainty_score":0.5285798},"labels":[],"label_agreement":null},{"id":"W2135863246","doi":"10.1109/cwit.2007.375711","title":"Bit-Interleaved Coded Modulation for the Relay Channel Using Bilayer LDPC Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Relay; Concatenation (mathematics); Computer science; Bit error rate; Algorithm; Decoding methods; Channel (broadcasting); Modulation (music); Coding (social sciences); Code (set theory); Parity bit; Forward error correction; Electronic engineering; Topology (electrical circuits); Telecommunications; Mathematics; Physics; Electrical engineering; Arithmetic; Engineering; Statistics","score_opus":0.1031729607311798,"score_gpt":0.3323976888637922,"score_spread":0.22922472813261235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135863246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015073416,0.00023833994,0.980976,0.0016488263,0.00024476927,0.00031213817,5.452614e-7,0.00012179183,0.001384188],"genre_scores_gemma":[0.9497878,0.00007155607,0.048516717,0.0008185134,0.00007329279,0.000011278825,0.000002035955,0.000008018252,0.0007107879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918073,0.000053268643,0.00022369571,0.00020235425,0.00012295211,0.0002170036],"domain_scores_gemma":[0.99857295,0.0005242928,0.00007524987,0.0005962163,0.00018690122,0.000044398177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009464664,0.00009818746,0.00009709179,0.00007352849,0.00044985293,0.00014130982,0.00068250735,0.00004084818,0.000016380094],"category_scores_gemma":[0.00005743163,0.000065500884,0.00006126208,0.00035032968,0.00003567526,0.00026333466,0.00022333163,0.00009107671,0.000008802721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010971647,0.00019802168,0.00057911215,0.000021164735,0.0001421981,0.0000026671871,0.006331676,0.06676426,0.076447316,0.49680567,0.0044739516,0.34812427],"study_design_scores_gemma":[0.00023755537,0.000023224813,0.001047932,0.00001578364,0.0000042136944,0.0000033845845,0.0000703993,0.9874252,0.0058173463,0.0006983282,0.004550843,0.00010575198],"about_ca_topic_score_codex":0.000011835232,"about_ca_topic_score_gemma":0.00018937685,"teacher_disagreement_score":0.9347144,"about_ca_system_score_codex":0.000050023333,"about_ca_system_score_gemma":0.000024046092,"threshold_uncertainty_score":0.34599504},"labels":[],"label_agreement":null},{"id":"W2135883213","doi":"10.1109/vetecs.2009.5073776","title":"Performance Analysis of Decode-and-Forward Cooperative Diversity Using Differential EGC over Nakagami-m Fading Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Nakagami distribution; Maximal-ratio combining; Diversity combining; Signal-to-noise ratio (imaging); Algorithm; Cooperative diversity; Computer science; Topology (electrical circuits); Bit error rate; Wireless; Mathematics; Electronic engineering; Statistics; Telecommunications; Decoding methods; Engineering; Combinatorics","score_opus":0.04467233682828105,"score_gpt":0.28529236013833975,"score_spread":0.24062002331005872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135883213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67733437,0.00006222242,0.32167447,0.000087809305,0.00005574814,0.000062592524,0.0000010588416,0.00003657748,0.00068518124],"genre_scores_gemma":[0.9960349,0.00034696047,0.0032355573,0.00022437682,0.000017653549,7.8047714e-7,0.000003283662,0.0000024859537,0.00013399766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.00009156043,0.00022650223,0.00027589712,0.0001999752,0.00019253365],"domain_scores_gemma":[0.9991783,0.000067719266,0.00010114211,0.00041240206,0.00016219208,0.000078247926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018369616,0.00013745055,0.00030899374,0.0002973642,0.00052223075,0.00009395706,0.0005939274,0.00004271511,0.00009833714],"category_scores_gemma":[0.000016283277,0.00012038903,0.00009816264,0.0011910193,0.00005230063,0.00055818434,0.00089619856,0.00010626993,0.0000013863748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001621623,0.00086590456,0.22011414,0.000053996147,0.0036973103,0.000012118206,0.042070426,0.1656031,0.049842976,0.16026832,0.0005203389,0.3567892],"study_design_scores_gemma":[0.00021696916,0.000056987228,0.089123644,0.000015725536,0.00010254507,8.555505e-7,0.000021785054,0.9079649,0.0022966682,0.000026082125,0.00002895757,0.00014489768],"about_ca_topic_score_codex":0.000015834428,"about_ca_topic_score_gemma":0.000024522655,"teacher_disagreement_score":0.7423618,"about_ca_system_score_codex":0.00004657637,"about_ca_system_score_gemma":0.000021623227,"threshold_uncertainty_score":0.4909322},"labels":[],"label_agreement":null},{"id":"W2135952624","doi":"10.1109/tencon.1994.369143","title":"Effect of fading in a multihop packet radio network with capture","year":2002,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Rayleigh fading; Computer network; Network packet; Computer science; Transmission (telecommunications); Hop (telecommunications); Range (aeronautics); Radio networks; Telecommunications; Wireless; Wireless network; Engineering","score_opus":0.0192583335499457,"score_gpt":0.24668145074307254,"score_spread":0.22742311719312686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135952624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3557951,0.0065777437,0.5637848,0.0024931962,0.00029565196,0.0010244244,6.542991e-7,0.00038379047,0.069644675],"genre_scores_gemma":[0.99112874,0.0002064152,0.008066071,0.0001309959,0.000021094964,0.000011335428,3.6223867e-7,0.0000048571933,0.00043009967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991584,0.00024185075,0.00014366925,0.00016803689,0.00010680957,0.00018127654],"domain_scores_gemma":[0.9991052,0.00030274663,0.000048323316,0.00047128098,0.000032086416,0.00004033448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037132532,0.000097524826,0.00017347495,0.000056978268,0.000057437013,0.000034586024,0.000504445,0.000031818094,0.00007080675],"category_scores_gemma":[0.000025194446,0.00006695715,0.000027228525,0.0006752628,0.000029920944,0.00017379315,0.00014034394,0.00014053841,0.000011248863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102502454,0.00026600837,0.08992788,0.00010327658,0.00009711972,0.00007001737,0.013709067,0.0471514,0.0013854378,0.08568934,0.022523887,0.73897403],"study_design_scores_gemma":[0.0013624311,0.00034152094,0.002822561,0.00017233445,0.0000045121883,0.000015842144,0.000018216442,0.9907534,0.0011444078,0.000031639906,0.0031103133,0.00022278565],"about_ca_topic_score_codex":0.00000962373,"about_ca_topic_score_gemma":0.00013801489,"teacher_disagreement_score":0.943602,"about_ca_system_score_codex":0.00002365693,"about_ca_system_score_gemma":0.000005946337,"threshold_uncertainty_score":0.27304336},"labels":[],"label_agreement":null},{"id":"W2135995799","doi":"10.1109/icc.2011.5963177","title":"Multipath-Doppler Diversity for Broadband Cooperative Vehicular Communications","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multipath propagation; Fading; Computer science; Narrowband; Precoding; Pairwise error probability; Doppler effect; Diversity scheme; Antenna diversity; Electronic engineering; Communications system; Telecommunications; MIMO; Wireless; Engineering; Beamforming; Physics; Channel (broadcasting)","score_opus":0.1531470547294815,"score_gpt":0.29782700166465,"score_spread":0.14467994693516847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135995799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035170254,0.00057565526,0.9700997,0.0010947101,0.00012080599,0.0005227666,0.000005159413,0.00023095006,0.023833232],"genre_scores_gemma":[0.82838213,0.0005358793,0.16924883,0.00079574867,0.000013212196,0.000060984145,0.000012058595,0.0000056028557,0.00094551744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992028,0.00013569536,0.00016002945,0.00023034541,0.000094537536,0.00017661383],"domain_scores_gemma":[0.99782705,0.00016238946,0.000053104253,0.0015337254,0.00034167682,0.000082036895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028144938,0.00010972906,0.0001257164,0.0000523062,0.0010811068,0.00006414757,0.0022798842,0.000041140902,0.000082591825],"category_scores_gemma":[0.000041237476,0.000097414544,0.000067962035,0.0002514654,0.00010389749,0.0004200773,0.0028134345,0.0001135349,0.00004596166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001859564,0.00040154325,0.003412769,0.000008097435,0.00008613426,0.0000016033285,0.017134905,0.00002522828,0.0008413163,0.90682685,0.007755453,0.063487485],"study_design_scores_gemma":[0.0037204837,0.00037024848,0.02743065,0.000075704564,0.000052322917,0.00002019979,0.00067060813,0.75241387,0.0113644,0.0057414765,0.196861,0.0012790621],"about_ca_topic_score_codex":0.00003453178,"about_ca_topic_score_gemma":0.00019149664,"teacher_disagreement_score":0.9010854,"about_ca_system_score_codex":0.000031713826,"about_ca_system_score_gemma":0.000035544075,"threshold_uncertainty_score":0.8315109},"labels":[],"label_agreement":null},{"id":"W2136080029","doi":"10.1016/s0012-365x(03)00235-8","title":"A note on random homomorphism from arbitrary graphs to Z","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Discrete mathematics; Random graph; Graph","score_opus":0.03144709697083665,"score_gpt":0.27727898541952223,"score_spread":0.2458318884486856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136080029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02201563,0.0001987613,0.92961484,0.0013977959,0.0002307672,0.00035478812,0.000007543834,0.00018021553,0.045999654],"genre_scores_gemma":[0.70417416,0.00012058259,0.293013,0.0022470395,0.000026920545,0.000047779336,0.000006891433,0.000019995787,0.0003436432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889797,0.00013254162,0.0002626163,0.00026217976,0.00023625621,0.00020843504],"domain_scores_gemma":[0.9981659,0.00044618215,0.00007370157,0.0011235105,0.00005753924,0.00013314227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029723466,0.00016462384,0.00022839468,0.00009306341,0.00017521385,0.00017970258,0.0008412401,0.000041671025,0.00007522913],"category_scores_gemma":[0.00023333367,0.00013787366,0.00009131109,0.0004263808,0.00003111537,0.00014403705,0.00016198921,0.00016476726,0.00029711888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006243351,0.000093182476,0.000016520362,0.0000063222183,0.000019268931,0.0000068558575,0.004391108,0.000055350978,0.0007732234,0.98819625,0.0014862461,0.004949416],"study_design_scores_gemma":[0.004409892,0.00037863618,0.00067688426,0.00071896776,0.000054501903,0.000026192296,0.00032261314,0.15822381,0.019039012,0.7280182,0.08645581,0.0016754556],"about_ca_topic_score_codex":0.0000026115913,"about_ca_topic_score_gemma":0.000010323235,"teacher_disagreement_score":0.6821585,"about_ca_system_score_codex":0.000025398655,"about_ca_system_score_gemma":0.000033130924,"threshold_uncertainty_score":0.5622325},"labels":[],"label_agreement":null},{"id":"W2136153546","doi":"10.1109/tsp.2010.2053030","title":"On the Distortion Exponents of Layered Broadcast Transmission in Multi-Relay Cooperative Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Multiplexing; Computer science; Topology (electrical circuits); Distortion (music); Exponent; Relay channel; Transmission (telecommunications); Gaussian; Telecommunications; Bandwidth (computing); Mathematics; Computer network; Power (physics); Physics","score_opus":0.04367551960342274,"score_gpt":0.2857290448395449,"score_spread":0.24205352523612217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136153546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03898826,0.00015938115,0.9598027,0.00044011595,0.00016536126,0.00023864924,0.000001283114,0.00005597708,0.00014831287],"genre_scores_gemma":[0.9968429,0.0001058946,0.0027128314,0.00019171406,0.00001441828,0.00003104461,0.0000010945802,0.00001262561,0.000087455184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870837,0.00021762807,0.00034879518,0.00029161712,0.0002356671,0.00019792434],"domain_scores_gemma":[0.99905926,0.00026403714,0.00011916496,0.00034986218,0.0001422577,0.00006541747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040253444,0.00016824863,0.00016772146,0.00014279642,0.00048271683,0.000096742704,0.00056714274,0.00009428488,0.00007269996],"category_scores_gemma":[0.000006982965,0.0001230676,0.00006949724,0.0006871266,0.0000981376,0.00037247315,0.0000044145736,0.00078918063,0.0000066986227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006858799,0.0004624005,0.000010915377,0.000008943589,0.000010253359,0.0000016849547,0.002024345,0.3039404,0.041344028,0.00053025485,0.000016941538,0.6515812],"study_design_scores_gemma":[0.0005670915,0.00009890662,0.00019252452,0.0002283355,0.000005463475,0.000003025233,0.000049959242,0.95789564,0.040605117,0.000033047974,0.00016601973,0.00015490141],"about_ca_topic_score_codex":0.000006623694,"about_ca_topic_score_gemma":0.000053872318,"teacher_disagreement_score":0.9578547,"about_ca_system_score_codex":0.00004370197,"about_ca_system_score_gemma":0.00007490371,"threshold_uncertainty_score":0.5018551},"labels":[],"label_agreement":null},{"id":"W2136165704","doi":"10.1109/vetecf.2004.1400326","title":"Equalization techniques for space-time coded cooperative systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Space–time block code; Orthogonality; Relay; Computer science; Equalization (audio); Block code; Fading; Multiplexing; Algorithm; Signal-to-noise ratio (imaging); Electronic engineering; Telecommunications; Power (physics); Decoding methods; Mathematics; Engineering; Physics","score_opus":0.041271083427352036,"score_gpt":0.3073193264197125,"score_spread":0.26604824299236046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136165704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010831903,0.00033146527,0.97810817,0.0032102838,0.00006406963,0.00055135845,0.0000017209467,0.0004956932,0.017128933],"genre_scores_gemma":[0.67319566,0.00040820127,0.3009797,0.0015582738,0.0002781174,0.00036506256,0.000030661617,0.000021117863,0.023163188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992022,0.000120542885,0.00020619361,0.00021115039,0.00010584421,0.00015407283],"domain_scores_gemma":[0.9989422,0.00015481678,0.00006373336,0.00044855513,0.00034182976,0.000048883117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036859684,0.00010211809,0.00013572568,0.000069818496,0.0002209833,0.00023974698,0.00054138957,0.000044435557,0.00004216256],"category_scores_gemma":[0.00005491289,0.000087137414,0.0000329233,0.00029471648,0.000022364233,0.00048477206,0.0001572864,0.000051593575,0.00007763064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036057354,0.000038603033,0.000005092676,0.000005009603,0.000010626325,1.0839067e-7,0.00047854785,0.0008324133,0.009969688,0.9275117,0.022514112,0.03863051],"study_design_scores_gemma":[0.0001640639,0.000056971166,0.00000481732,0.000021749687,0.0000020246275,0.0000020627215,0.000015497671,0.7528171,0.023043808,0.000101080106,0.22363321,0.00013759127],"about_ca_topic_score_codex":0.0000023306945,"about_ca_topic_score_gemma":0.000013168148,"teacher_disagreement_score":0.9274106,"about_ca_system_score_codex":0.00006287381,"about_ca_system_score_gemma":0.00004325749,"threshold_uncertainty_score":0.35533607},"labels":[],"label_agreement":null},{"id":"W2136215137","doi":"10.1109/glocom.2009.5425247","title":"Distributed Beamforming in Multiuser Multi-Relay Networks with Guaranteed QoS","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Beamforming; Relay; Computer science; Quality of service; Mathematical optimization; Optimization problem; Iterative method; Signal-to-noise ratio (imaging); Interference (communication); Power (physics); Computer network; Algorithm; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.023578135209795157,"score_gpt":0.26366901820735983,"score_spread":0.24009088299756468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136215137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011710106,0.00022987071,0.9856828,0.0010565594,0.000072048046,0.00021076959,4.8143613e-7,0.00020336149,0.0008340022],"genre_scores_gemma":[0.894638,0.00010568206,0.10382644,0.0011956258,0.000026827667,0.000010207604,0.000007567186,0.000005258966,0.00018436411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989524,0.00007866922,0.00024725674,0.00028005877,0.00012732306,0.0003142954],"domain_scores_gemma":[0.9990911,0.000078479825,0.000058734542,0.00062531274,0.000076208555,0.00007015035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024488883,0.00015070582,0.00016720385,0.00008874518,0.00015110636,0.00012236487,0.0008191229,0.000054038243,0.00001600906],"category_scores_gemma":[0.000022931816,0.000114238836,0.000032699227,0.0008256539,0.000028064893,0.00039102178,0.000150759,0.0002485093,0.000011794156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012244582,0.0012630264,0.026563628,0.00000768058,0.00005788882,0.0000923083,0.0043966593,0.4462965,0.0016415928,0.095872246,0.002703311,0.4209827],"study_design_scores_gemma":[0.0010783401,0.000071305105,0.022754943,0.000055147775,0.0000017056889,0.000008466616,0.000031508505,0.9728659,0.00016133822,0.000012968888,0.0027536168,0.0002047622],"about_ca_topic_score_codex":0.00001261631,"about_ca_topic_score_gemma":0.0003763083,"teacher_disagreement_score":0.8829279,"about_ca_system_score_codex":0.000054562923,"about_ca_system_score_gemma":0.000027842505,"threshold_uncertainty_score":0.46585244},"labels":[],"label_agreement":null},{"id":"W2136273774","doi":"10.1186/1687-1499-2013-11","title":"On the achievable rates of symmetric Gaussian multi-way relay channels","year":2013,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Computer science; Relay; Telecommunications link; Transmission (telecommunications); Channel (broadcasting); Gaussian; Transmitter power output; Computer network; Power (physics); Upper and lower bounds; Lattice (music); Telecommunications; Topology (electrical circuits); Real-time computing; Mathematics; Physics; Transmitter; Acoustics; Combinatorics","score_opus":0.08275604438410564,"score_gpt":0.305471770982041,"score_spread":0.22271572659793534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136273774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5567554,0.060092296,0.2388999,0.10948993,0.0028713043,0.0024461946,0.000004713501,0.0003782605,0.02906195],"genre_scores_gemma":[0.9649445,0.029323684,0.0044742934,0.0009296123,0.00009129629,0.000033890996,0.0000018415868,0.000016658776,0.00018426671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977948,0.00095493504,0.00050729566,0.00020295505,0.00024177945,0.0002982572],"domain_scores_gemma":[0.995318,0.0020126733,0.0004371446,0.0018625287,0.00023765925,0.00013198958],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012178608,0.0001971142,0.00025345464,0.00025016128,0.0016103586,0.0005307959,0.002693939,0.00006185022,0.000031253934],"category_scores_gemma":[0.000068362395,0.00013179496,0.00009288237,0.0010810061,0.00017259223,0.00036516285,0.0007777645,0.00090567564,0.00002956651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011527121,0.00036702937,0.0013243266,0.0000075155494,0.000097997,0.0000021224137,0.0015162054,0.0010523003,0.0006198977,0.46501344,0.0021347567,0.5278529],"study_design_scores_gemma":[0.0007365476,0.00034273096,0.006811009,0.00081828295,0.000015490545,0.00006536798,0.0001641157,0.96768665,0.0003679673,0.0030323823,0.019570967,0.0003884827],"about_ca_topic_score_codex":0.000009667883,"about_ca_topic_score_gemma":0.000009845492,"teacher_disagreement_score":0.96663433,"about_ca_system_score_codex":0.00004477493,"about_ca_system_score_gemma":0.000035367284,"threshold_uncertainty_score":0.9996894},"labels":[],"label_agreement":null},{"id":"W2136278360","doi":"10.1109/vetecf.2008.173","title":"Diversity Combining of Signals with Different Modulation Levels in Cooperative Relay Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Maximal-ratio combining; Relay; Detector; Computer science; Diversity combining; Diversity gain; Cooperative diversity; Algorithm; Bit error rate; Channel state information; Antenna diversity; Modulation (music); Diversity scheme; Bandwidth (computing); Selection (genetic algorithm); Channel (broadcasting); Electronic engineering; Topology (electrical circuits); Telecommunications; MIMO; Mathematics; Fading; Artificial intelligence; Wireless; Engineering; Physics","score_opus":0.07600848746610751,"score_gpt":0.25980736199759064,"score_spread":0.18379887453148314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136278360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47951528,0.000044123033,0.519363,0.00014688927,0.000021148518,0.000091382215,1.7312625e-7,0.000027895478,0.00079014985],"genre_scores_gemma":[0.9971629,0.00013084851,0.002357402,0.000120519486,0.000006556373,0.0000043480904,0.0000017492134,0.000003340009,0.00021236677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991321,0.00018039231,0.00019764002,0.00018995136,0.00016448517,0.00013544454],"domain_scores_gemma":[0.9992543,0.0001334836,0.00008203604,0.0003368543,0.00015172298,0.000041643256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016722534,0.00010003184,0.0001847179,0.00008046139,0.0004428909,0.000014246761,0.0004607637,0.000034722852,0.000032105894],"category_scores_gemma":[0.00001382146,0.00007623161,0.000023019747,0.0004635186,0.000068202404,0.00032105294,0.0009094697,0.00014267633,0.0000011870062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004840312,0.0003805743,0.29331383,0.000006393751,0.000055224584,0.000018904419,0.01599007,0.5852417,0.0010194749,0.093577586,0.00031656338,0.01003131],"study_design_scores_gemma":[0.0005000593,0.00009275867,0.29781583,0.000037757385,0.0000013006372,0.0000034663844,0.000031407377,0.7006878,0.00067404646,0.000041750136,0.000009970609,0.000103790844],"about_ca_topic_score_codex":0.000018850405,"about_ca_topic_score_gemma":0.00014281023,"teacher_disagreement_score":0.5176476,"about_ca_system_score_codex":0.000040961142,"about_ca_system_score_gemma":0.00002608316,"threshold_uncertainty_score":0.34064034},"labels":[],"label_agreement":null},{"id":"W2136371315","doi":"10.1109/icc.2008.541","title":"Practical Coding-Aware Mechanism for Opportunistic Routing in Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Linear network coding; Computer network; Wireless mesh network; Coding (social sciences); Routing protocol; Network packet; Throughput; Distributed computing; Multipath routing; Dynamic Source Routing; Wireless network; Wireless; Telecommunications","score_opus":0.12779743833782747,"score_gpt":0.3334111982811271,"score_spread":0.2056137599432996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136371315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085126655,0.0000016311976,0.99359924,0.0028623438,0.000192225,0.00027317836,5.857921e-7,0.00015861068,0.0020609442],"genre_scores_gemma":[0.97006744,0.00047342584,0.027616937,0.0011580015,0.000060513732,0.000056471494,0.000007334649,0.000010582396,0.00054929894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987749,0.00012241467,0.00030997396,0.000315853,0.00014452501,0.00033232308],"domain_scores_gemma":[0.9985638,0.000552303,0.00008863798,0.00050758175,0.0001797967,0.0001078595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047598177,0.00013216087,0.00019258565,0.000071624185,0.00035683063,0.000085625325,0.0005959522,0.00007253445,0.000026721193],"category_scores_gemma":[0.00015110213,0.00012613356,0.000053292824,0.0003507774,0.00003806313,0.00034405425,0.00036269595,0.0002225335,0.0000077503955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039111756,0.00004109128,0.00014613829,0.0000023636262,0.000004579316,0.000018241566,0.0001555364,0.0000030922336,0.0000639278,0.99393857,0.0015248251,0.0040977215],"study_design_scores_gemma":[0.00035931493,0.00004163751,0.00017642597,0.000029809435,0.0000023426937,0.0000494281,0.000038022605,0.9978339,0.00015300565,0.0010522844,0.000090310816,0.00017350016],"about_ca_topic_score_codex":0.000006287034,"about_ca_topic_score_gemma":0.00007430482,"teacher_disagreement_score":0.9978308,"about_ca_system_score_codex":0.00006356698,"about_ca_system_score_gemma":0.00013651089,"threshold_uncertainty_score":0.5143577},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.045405994252301164,"score_gpt":0.2777678915224783,"score_spread":0.23236189727017717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136379375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848417,0.00024887713,0.006928055,0.0063769026,0.00003132256,0.00014812428,0.0000059353506,0.0000240208,0.0013950758],"genre_scores_gemma":[0.99614936,0.0007426364,0.0024822517,0.00059719814,0.000004504388,0.0000056279814,0.0000031355019,0.0000042987635,0.000010956634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991314,0.0002601256,0.00022349064,0.00013593453,0.00012783892,0.00012124376],"domain_scores_gemma":[0.9974487,0.00070231827,0.00017601547,0.0015441797,0.00009813557,0.000030683263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040219945,0.000102107944,0.00014270474,0.0000866572,0.0005886517,0.00003694147,0.0013295726,0.000033651017,0.000008729843],"category_scores_gemma":[0.000023724931,0.000078254096,0.000051733674,0.00026906838,0.00069497543,0.0001953478,0.00097216316,0.00024759077,0.0000025383306],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009015024,0.00071904453,0.37640288,0.00005281198,0.0005260051,0.000001492364,0.015633196,0.007164476,0.107082516,0.43769613,0.0115809655,0.043050334],"study_design_scores_gemma":[0.0009304851,0.00027127788,0.9649056,0.00026707829,0.000038730563,0.000021105998,0.00032555062,0.029137312,0.0022967395,0.0007324222,0.0006319954,0.00044170217],"about_ca_topic_score_codex":0.000060080736,"about_ca_topic_score_gemma":0.000019297886,"teacher_disagreement_score":0.5885027,"about_ca_system_score_codex":0.00004626354,"about_ca_system_score_gemma":0.000025916654,"threshold_uncertainty_score":0.45274925},"labels":[],"label_agreement":null},{"id":"W2136731589","doi":"10.1109/wcnc.2005.1424743","title":"Effect of relaying on capacity improvement in wireless local area networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer network; Throughput; Computer science; Relay channel; Wireless network; Node (physics); Wireless; Link Access Procedure for Frame Relay; Power (physics); Telecommunications; Engineering","score_opus":0.02248047891555296,"score_gpt":0.2605455965610991,"score_spread":0.23806511764554614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136731589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39036965,0.000047631536,0.6042775,0.00038661063,0.000062906365,0.00014649922,8.422731e-8,0.000045073008,0.004664032],"genre_scores_gemma":[0.9981496,0.00009923106,0.0012731139,0.0003734035,0.00002118997,0.000014999833,5.810756e-7,0.0000036105023,0.00006431804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999141,0.0001680409,0.00021524087,0.00018523482,0.00012375577,0.00016672799],"domain_scores_gemma":[0.99910605,0.00027663543,0.000053914624,0.00049050146,0.00003191896,0.000040971692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006603455,0.00009617665,0.0001519725,0.00006633324,0.00005771237,0.000025842599,0.00051403063,0.000040051826,0.000019696168],"category_scores_gemma":[0.0000146901875,0.000076008386,0.000037594775,0.00030036143,0.0000357089,0.00014727896,0.00022636054,0.00019533875,0.000007369108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148538265,0.000057096677,0.0008063665,0.000005235006,0.0000048036995,6.784378e-7,0.00016571379,0.017503837,0.00089941954,0.03560553,0.00016165373,0.9447748],"study_design_scores_gemma":[0.0004264871,0.00031161637,0.0006354497,0.00005852354,0.0000011087515,6.761386e-7,0.0000045475135,0.976561,0.021640474,0.00001570776,0.00025398366,0.00009039407],"about_ca_topic_score_codex":0.000015219548,"about_ca_topic_score_gemma":0.0001660883,"teacher_disagreement_score":0.9590572,"about_ca_system_score_codex":0.00009310457,"about_ca_system_score_gemma":0.000011436541,"threshold_uncertainty_score":0.3099532},"labels":[],"label_agreement":null},{"id":"W2136837026","doi":"10.1109/twc.2010.06.081631","title":"Lifetime-resource tradeoff for multicast traffic in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear network coding; Computer science; Multicast; Computer network; Wireless sensor network; Wireless network; Coding (social sciences); Distributed computing; Wireless; Mathematics","score_opus":0.03497798696367323,"score_gpt":0.28683543418198815,"score_spread":0.25185744721831493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136837026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040994532,0.00012107575,0.9497266,0.006890235,0.00043169,0.00091347424,0.000022980192,0.00040748875,0.0004919556],"genre_scores_gemma":[0.96266735,0.0008164625,0.03500147,0.00049545144,0.000050751187,0.00064681604,0.000020604213,0.00004575585,0.0002553311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997723,0.00041053595,0.00063891796,0.00052331924,0.0001937278,0.0005105414],"domain_scores_gemma":[0.99369603,0.0017107965,0.0001545048,0.0040400643,0.00019039193,0.00020821014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061183487,0.00032429266,0.0003661318,0.00036581774,0.0010920217,0.00022740042,0.003684352,0.00023642236,0.00002729515],"category_scores_gemma":[0.00001848875,0.00035201068,0.00021925491,0.0011478587,0.0003151936,0.00039136523,0.000040219737,0.0015027707,0.000030604355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068007736,0.0023393354,0.00004092145,0.000022661254,0.00008989937,0.000002572085,0.0027914296,0.1169842,0.009850167,0.03798366,0.00048431827,0.82934284],"study_design_scores_gemma":[0.0010865448,0.000071687595,0.00021337006,0.00006920597,0.00001836211,0.000014109334,0.00010216135,0.9871609,0.0015218491,0.000035620586,0.009295195,0.00041099943],"about_ca_topic_score_codex":0.000016624383,"about_ca_topic_score_gemma":0.0023404344,"teacher_disagreement_score":0.9216728,"about_ca_system_score_codex":0.000084298386,"about_ca_system_score_gemma":0.00011090226,"threshold_uncertainty_score":0.9998932},"labels":[],"label_agreement":null},{"id":"W2136915087","doi":"10.1109/glocom.2008.ecp.787","title":"On Optimal Power Allocation for Source-Orthogonal Relay-Nonorthogonal Amplify-and-Forward Relaying","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Upper and lower bounds; Mathematical optimization; Power (physics); Computer science; Channel (broadcasting); Selection (genetic algorithm); Optimization problem; Asymptotically optimal algorithm; Mathematics; Telecommunications","score_opus":0.037909742551605126,"score_gpt":0.2696929305997769,"score_spread":0.23178318804817177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136915087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14694622,0.00015694565,0.8464882,0.0017421021,0.00012103488,0.00023262824,0.000001345784,0.00017467262,0.004136861],"genre_scores_gemma":[0.9125077,0.00024022422,0.083443746,0.0015829081,0.000045450914,0.000059467504,0.000014644005,0.00001424255,0.002091617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987653,0.00007826554,0.00027485198,0.00040088926,0.00021676105,0.00026393065],"domain_scores_gemma":[0.99868906,0.00042265395,0.00008392195,0.0005283197,0.00015291446,0.00012315548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038022344,0.00016361958,0.00015870758,0.000109420165,0.0006834185,0.00009140082,0.00051841006,0.00007671361,0.000058602884],"category_scores_gemma":[0.00009807407,0.00014871708,0.0000784757,0.00022503856,0.00007416977,0.0003423615,0.0002761831,0.00021178198,0.000043101994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006874586,0.00012879846,0.0015132037,0.0000063325197,0.000045334196,0.000004453618,0.0017928148,0.007292479,0.00043275245,0.9305696,0.007490661,0.050654843],"study_design_scores_gemma":[0.0022320494,0.0008324164,0.018097188,0.000074335934,0.0000171038,0.00026876276,0.00010863937,0.81957775,0.0007262723,0.0016563281,0.1553564,0.0010527215],"about_ca_topic_score_codex":0.0000020184514,"about_ca_topic_score_gemma":0.000007285304,"teacher_disagreement_score":0.92891324,"about_ca_system_score_codex":0.000038694452,"about_ca_system_score_gemma":0.000075394964,"threshold_uncertainty_score":0.6064507},"labels":[],"label_agreement":null},{"id":"W2137049957","doi":"10.1109/vetecf.2005.1558065","title":"Noncoherent distributed space~time block coding","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Coding (social sciences); Block code; Block (permutation group theory); Node (physics); Computer network; Space–time code; Distributed computing; Wireless sensor network; Wireless; Wireless network; Code (set theory); Channel (broadcasting); Decoding methods; Fading; Telecommunications; Engineering; Mathematics; Set (abstract data type)","score_opus":0.01909021013102562,"score_gpt":0.24671724385956995,"score_spread":0.22762703372854431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137049957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008284151,0.0002525939,0.9173538,0.005619343,0.00014175885,0.00016109325,0.0000025050217,0.0005242869,0.06766043],"genre_scores_gemma":[0.9824455,0.000044562632,0.012587055,0.00020270629,0.000069237685,0.00000857022,0.00001443842,0.0000049946275,0.004622952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924904,0.00006486234,0.00016289784,0.00019809134,0.00013301836,0.00019207472],"domain_scores_gemma":[0.9991979,0.000081235696,0.000045160283,0.00054833404,0.0000770053,0.000050336388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014407396,0.000096723474,0.000106106025,0.000040639206,0.00018957694,0.00017420626,0.0006693218,0.000028036531,0.00015993533],"category_scores_gemma":[0.000011565492,0.00008419643,0.00004324615,0.00033002734,0.000023273675,0.00018592904,0.0003711164,0.00008874975,0.0003163188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036822164,0.00021258838,0.0012148159,0.0000050038993,0.000019821044,0.000010242749,0.00012556466,0.0019660015,0.019533362,0.78809,0.16618514,0.022633808],"study_design_scores_gemma":[0.00064128824,0.000052669537,0.007403428,0.000036725465,0.0000056346594,0.000017290246,0.000010167012,0.7417143,0.0120488135,0.0016129747,0.23599948,0.00045725345],"about_ca_topic_score_codex":0.000014312327,"about_ca_topic_score_gemma":0.000033761444,"teacher_disagreement_score":0.9741613,"about_ca_system_score_codex":0.00005005716,"about_ca_system_score_gemma":0.00002569315,"threshold_uncertainty_score":0.40657437},"labels":[],"label_agreement":null},{"id":"W2137214351","doi":"10.1109/pacrim.2011.6032888","title":"On the performance of AF opportunistic relaying with adaptive transmission over Rayleigh fading channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Rayleigh fading; Fading; Computer science; Link adaptation; Spectral efficiency; Transmission (telecommunications); Quadrature amplitude modulation; Channel (broadcasting); Channel capacity; Bit error rate; Electronic engineering; Control theory (sociology); Telecommunications; Engineering","score_opus":0.09799347660235089,"score_gpt":0.2504147367676785,"score_spread":0.15242126016532762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137214351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.191487,0.00006776845,0.7545567,0.00041325254,0.00007391463,0.00022386565,3.0843023e-7,0.00007932339,0.053097837],"genre_scores_gemma":[0.991383,0.0001779841,0.007664032,0.00028593568,0.000007845218,0.000010865234,3.730922e-7,0.0000058974915,0.0004640361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992959,0.00008615692,0.00014958844,0.00016652468,0.0001634696,0.00013837205],"domain_scores_gemma":[0.9991352,0.00017471027,0.00007909378,0.0004857368,0.00007543724,0.0000498173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002973477,0.00009955043,0.00010432471,0.00005186233,0.00023300847,0.000023536551,0.0006606578,0.000023491502,0.00022225353],"category_scores_gemma":[0.00000884919,0.00005447199,0.000028277045,0.00027300176,0.00005714219,0.00023377717,0.00010574698,0.00014181665,0.000008246221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008029779,0.00007658094,0.00026362995,0.0000084136445,0.000025616107,0.0000031596044,0.00656953,0.00038263947,0.0012471351,0.9457673,0.00021972101,0.045355994],"study_design_scores_gemma":[0.00043200018,0.000845199,0.0024309775,0.0003995921,0.000009754944,0.000007904482,0.00014688932,0.97641706,0.017557329,0.0007866343,0.00070391234,0.0002627463],"about_ca_topic_score_codex":0.0000039686934,"about_ca_topic_score_gemma":0.0000014588595,"teacher_disagreement_score":0.9760344,"about_ca_system_score_codex":0.00001636344,"about_ca_system_score_gemma":0.000037438265,"threshold_uncertainty_score":0.24335203},"labels":[],"label_agreement":null},{"id":"W2137283249","doi":"10.1109/bsc.2006.1644572","title":"Information Rates for the Relay Channel with Confidentiality","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Corollary; Decoding methods; Relay; Upper and lower bounds; Channel (broadcasting); Confidentiality; Relay channel; Channel capacity; Computer science; Sequence (biology); Random variable; Computer network; Mathematics; Topology (electrical circuits); Theoretical computer science; Telecommunications; Computer security; Discrete mathematics; Combinatorics; Statistics; Biology","score_opus":0.025274070159533337,"score_gpt":0.27678065090351267,"score_spread":0.25150658074397936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137283249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006735638,0.000094165895,0.9883873,0.004378163,0.00006796966,0.0002032697,4.566556e-7,0.00006784999,0.0061272993],"genre_scores_gemma":[0.99196875,0.000042782274,0.006224864,0.0008468638,0.000032092004,0.000050372542,0.0000063763787,0.0000014343287,0.0008264601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996785,0.000024219995,0.00010433514,0.000045599387,0.00007039624,0.00007695389],"domain_scores_gemma":[0.99934167,0.00014770913,0.00004405078,0.00030905986,0.00014677788,0.000010739683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023795955,0.000042639796,0.00003896347,0.000017982416,0.00025744122,0.00022350563,0.00040034382,0.000011955802,0.000010947998],"category_scores_gemma":[0.0000096171925,0.000023337014,0.000016704824,0.00014685404,0.000024083347,0.00058215513,0.00007625881,0.000036728317,0.000013761426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086644595,0.000015736803,0.00010989146,0.0000037979871,0.00001076785,3.8655283e-8,0.00073511817,0.0024910504,0.0000475271,0.9552773,0.018988028,0.022312034],"study_design_scores_gemma":[0.0006206993,0.000058679707,0.007874461,0.0000109837165,0.0000061314972,0.0000041516773,0.00018181566,0.79349136,0.0027301072,0.002229643,0.19263476,0.00015721044],"about_ca_topic_score_codex":0.000044731074,"about_ca_topic_score_gemma":0.0001832409,"teacher_disagreement_score":0.9912952,"about_ca_system_score_codex":0.000008545404,"about_ca_system_score_gemma":0.000019784218,"threshold_uncertainty_score":0.21552698},"labels":[],"label_agreement":null},{"id":"W2137382216","doi":"10.1109/glocom.2010.5683873","title":"Optimal Sum Rate of the MIMO Relay Communication System","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Robustness (evolution); Computation; MIMO; Computer science; Relay; Convergence (economics); Algorithm; Iterative method; Rate of convergence; Mathematical optimization; Communications system; Mathematics; Telecommunications; Channel (broadcasting)","score_opus":0.02394054883043909,"score_gpt":0.25787979768457964,"score_spread":0.23393924885414055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137382216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5176274,0.00065834814,0.35250476,0.02387657,0.001443069,0.00068188005,0.0000017712917,0.00051716156,0.10268906],"genre_scores_gemma":[0.9588083,0.000054632925,0.04012661,0.0001632151,0.000010885914,0.000007844433,6.3439404e-7,0.0000031845093,0.0008247017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929446,0.0002537082,0.00018249602,0.00010437512,0.000077902274,0.00008703324],"domain_scores_gemma":[0.9976971,0.0001551851,0.00009895368,0.0018713914,0.00014985228,0.000027483453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006162723,0.00005842378,0.00007981696,0.00002458047,0.00022970919,0.000059103142,0.0021187712,0.000034883484,0.000022831731],"category_scores_gemma":[0.000042999603,0.0000378732,0.00004458678,0.00030024792,0.00007381155,0.00017421512,0.00082230614,0.00022956428,0.000020644464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014822089,0.000022936714,0.0004550619,0.000005510181,0.000006719819,9.066333e-8,0.0004864725,0.000188814,0.015353529,0.97679913,0.0021500175,0.004530261],"study_design_scores_gemma":[0.0005938527,0.000037207476,0.018557929,0.00013297515,0.0000107884825,0.000021690072,0.00024675106,0.8467978,0.058889866,0.00023588492,0.07416949,0.00030574104],"about_ca_topic_score_codex":0.000013383384,"about_ca_topic_score_gemma":0.00011218827,"teacher_disagreement_score":0.9765632,"about_ca_system_score_codex":0.000012436497,"about_ca_system_score_gemma":0.000037996433,"threshold_uncertainty_score":0.39372393},"labels":[],"label_agreement":null},{"id":"W2137554319","doi":"10.1109/tsp.2011.2150221","title":"Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Hop (telecommunications); Mathematical optimization; Channel state information; Closed-form expression; Node (physics); Minification; Optimization problem; Power (physics); Expression (computer science); Relay channel; Convex optimization; Transmission (telecommunications); Decoding methods; Fading; Mathematics; Algorithm; Wireless; Telecommunications; Regular polygon","score_opus":0.034787257424259935,"score_gpt":0.27618729930552477,"score_spread":0.24140004188126485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137554319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014694871,0.00010131134,0.9953162,0.00021836173,0.00010009849,0.00012324982,3.646901e-7,0.0001360062,0.0025348964],"genre_scores_gemma":[0.98382735,0.00004468638,0.015298579,0.00070502603,0.000012376501,0.000036777317,0.0000016433361,0.000012594172,0.000060946837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990882,0.00010797117,0.00021881986,0.00027462866,0.00014985364,0.00016050524],"domain_scores_gemma":[0.9994443,0.00008830514,0.00007116519,0.0002492545,0.000090356974,0.000056615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024642627,0.00012512667,0.00010939601,0.0002216032,0.00023797133,0.00008523412,0.00026115665,0.0000527212,0.000055116758],"category_scores_gemma":[0.0000037260138,0.000120925746,0.000033071992,0.00054820743,0.00003271451,0.00039780064,0.0000032062087,0.00025960553,0.0000076123692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006665504,0.00022088189,0.000076594566,0.000009748965,0.0000070487467,0.0000030230874,0.0015805415,0.5251096,0.00024167057,0.00063999963,0.00007037857,0.47197384],"study_design_scores_gemma":[0.00036856308,0.00006556129,0.00019247958,0.00010688578,0.0000042519628,0.0000022429333,0.00001950945,0.9969051,0.0019320111,0.0001000711,0.00015584023,0.00014750141],"about_ca_topic_score_codex":0.000003821551,"about_ca_topic_score_gemma":0.000045620647,"teacher_disagreement_score":0.98235786,"about_ca_system_score_codex":0.000054420245,"about_ca_system_score_gemma":0.00006018503,"threshold_uncertainty_score":0.49312088},"labels":[],"label_agreement":null},{"id":"W2137682326","doi":"10.1109/pimrc.2009.5449923","title":"Cooperative regions for decode and forward strategies over Rayleigh fading channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Rayleigh fading; Fading; Computer science; Relay; Signal-to-noise ratio (imaging); Transmission (telecommunications); Diversity gain; Multiplexing; Path loss; Outage probability; Monte Carlo method; Electronic engineering; Cooperative diversity; Telecommunications; Wireless; Channel (broadcasting); Mathematics; Engineering; Physics; Statistics","score_opus":0.04784258236586437,"score_gpt":0.31609155947317386,"score_spread":0.2682489771073095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137682326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044552693,0.00043502203,0.98151433,0.004597342,0.000094032155,0.00028105866,9.658452e-7,0.00014022885,0.00848172],"genre_scores_gemma":[0.9680522,0.0005303712,0.02877826,0.0015510473,0.00005258542,0.000027042557,0.0000029341377,0.000004478356,0.0010010677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992551,0.000048841703,0.00015457501,0.00025902,0.00007569757,0.00020674558],"domain_scores_gemma":[0.9992169,0.00017703002,0.00004127321,0.00035375307,0.0001341424,0.000076884295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017825446,0.000120714896,0.00014258853,0.00006774824,0.00038803185,0.00043289966,0.000420423,0.000038155868,0.000016860435],"category_scores_gemma":[0.0000346614,0.000100973426,0.000039503415,0.00023255454,0.000035481753,0.00079093425,0.00012232234,0.00007959767,0.000003543152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000397586,0.000017565702,0.000009313777,0.0000016618035,0.000008111977,4.8689736e-7,0.0011246824,0.0003265099,0.00070808496,0.97874826,0.003478951,0.015572396],"study_design_scores_gemma":[0.0017923515,0.00066029775,0.0019200075,0.000093748095,0.000015272992,0.0000228402,0.0006648237,0.81137383,0.005293096,0.119630106,0.057766248,0.0007673717],"about_ca_topic_score_codex":0.0000018155117,"about_ca_topic_score_gemma":0.000033264576,"teacher_disagreement_score":0.96359694,"about_ca_system_score_codex":0.00002101999,"about_ca_system_score_gemma":0.000049825907,"threshold_uncertainty_score":0.41744614},"labels":[],"label_agreement":null},{"id":"W2137858537","doi":"10.1109/tsp.2008.917390","title":"Optimized Power Allocation for Pairwise Cooperative Multiple Access","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"University of Toronto","keywords":"Resource allocation; Computer science; Mathematical optimization; Quality of service; Channel (broadcasting); Pairwise comparison; Transmission (telecommunications); Channel state information; Computer network; Mathematics; Wireless; Telecommunications","score_opus":0.07950067114866823,"score_gpt":0.31339587861972934,"score_spread":0.23389520747106113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137858537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022686468,0.00019415628,0.9954288,0.00083253183,0.00014951715,0.0004695309,0.000004261823,0.00026138392,0.00039117603],"genre_scores_gemma":[0.9552357,0.00014488368,0.043322895,0.0006501756,0.000027577402,0.00023879002,0.000003397292,0.000018417795,0.00035812616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872845,0.00011806338,0.00029696687,0.00039364124,0.00021448378,0.00024839144],"domain_scores_gemma":[0.99865717,0.00030084647,0.00010509787,0.00034419366,0.00049468526,0.000098030454],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002314638,0.00019034265,0.00019597146,0.0001556045,0.0013460111,0.0002616797,0.00076868234,0.00006881265,0.000053748965],"category_scores_gemma":[0.000012799759,0.00018000448,0.000098226716,0.00060678605,0.000088207074,0.0013997633,0.000007733469,0.00022479898,0.000016471386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003596269,0.00088641414,0.000022075923,0.00004865805,0.00008666687,0.000007460283,0.006916267,0.45653883,0.012926099,0.00065609405,0.0011061779,0.52044564],"study_design_scores_gemma":[0.0014593393,0.0001526403,0.000053309865,0.00008217404,0.00001087669,0.00001674023,0.00004783367,0.93863547,0.057873104,0.00006142172,0.0013001688,0.00030694704],"about_ca_topic_score_codex":0.0000024154126,"about_ca_topic_score_gemma":0.0000082759525,"teacher_disagreement_score":0.9529671,"about_ca_system_score_codex":0.00008084155,"about_ca_system_score_gemma":0.00022222965,"threshold_uncertainty_score":0.9999541},"labels":[],"label_agreement":null},{"id":"W2137916099","doi":"10.1109/icc.2009.5198781","title":"Beamforming in Dual-Hop Fixed Gain Relaying Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Hop (telecommunications); Moment-generating function; Relay; Beamforming; Probability density function; Computer science; Topology (electrical circuits); Array gain; Outage probability; Signal-to-noise ratio (imaging); Antenna gain; Antenna (radio); Electronic engineering; Control theory (sociology); Power (physics); Telecommunications; Mathematics; Antenna array; Electrical engineering; Engineering; Antenna measurement; Physics; Statistics; Antenna factor","score_opus":0.03886511377553505,"score_gpt":0.2809088617994984,"score_spread":0.24204374802396336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137916099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019674134,0.0013353885,0.89953434,0.0035145637,0.00028817958,0.00025242384,1.3179654e-7,0.00033157648,0.07506927],"genre_scores_gemma":[0.9845764,0.00015950325,0.0135110915,0.0007290282,0.000029319093,0.000006914164,9.3179585e-7,0.0000029868743,0.0009838142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911433,0.00013656683,0.00024030718,0.00019181495,0.00012330632,0.00019364532],"domain_scores_gemma":[0.9992239,0.00011544164,0.000044885313,0.0005231087,0.00004307354,0.00004958265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006672371,0.000084790794,0.00011952337,0.000118811324,0.00013061534,0.00016387994,0.00040797304,0.00003474573,0.000009263124],"category_scores_gemma":[0.000052213614,0.000076361044,0.000025622046,0.000541853,0.000008918705,0.00042406077,0.00016632918,0.0001469008,0.000035806395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030275446,0.00007015604,0.0005146583,0.000005481192,0.0000047678363,0.0000248687,0.0020222233,0.0054696766,0.0044194097,0.83322066,0.0018026055,0.15244244],"study_design_scores_gemma":[0.0003617613,0.000049861756,0.0015379047,0.00011574174,9.748927e-7,0.000027017039,0.00018209497,0.9877323,0.000526581,0.0006240063,0.008600506,0.00024125264],"about_ca_topic_score_codex":0.0000103745515,"about_ca_topic_score_gemma":0.00002420149,"teacher_disagreement_score":0.9822626,"about_ca_system_score_codex":0.000061121806,"about_ca_system_score_gemma":0.000026901373,"threshold_uncertainty_score":0.3113913},"labels":[],"label_agreement":null},{"id":"W2138048032","doi":"10.1109/twc.2011.012411.100005","title":"Performance and Optimization of Amplify-and-Forward Cooperative Diversity Systems in Generic Noise and Interference","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Rayleigh fading; Gaussian noise; Interference (communication); Noise power; Noise (video); Telecommunications; Wireless network; Antenna diversity; Cooperative diversity; Topology (electrical circuits); Additive white Gaussian noise; Fading; Wireless; Electronic engineering; Channel (broadcasting); Mathematics; Algorithm; Power (physics); Engineering; Physics","score_opus":0.07022319881192095,"score_gpt":0.2562051561771068,"score_spread":0.18598195736518586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138048032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19571027,0.0005549735,0.8028457,0.00015132091,0.00005477131,0.00022592694,0.0000069718144,0.00004165382,0.0004083978],"genre_scores_gemma":[0.96762526,0.02100643,0.011244941,0.000038341495,0.0000016753548,0.000047449532,0.000002034766,0.000005774315,0.000028123966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909586,0.00024313007,0.0002580108,0.00020876626,0.000081413586,0.00011281001],"domain_scores_gemma":[0.9986537,0.00017098541,0.00009394969,0.00087733095,0.0001381334,0.00006586985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002168798,0.00012156919,0.00018609784,0.00015363714,0.0005521429,0.00004737784,0.00071209413,0.000057158566,0.0000048300367],"category_scores_gemma":[0.000004291247,0.00012352825,0.000015825484,0.00040888911,0.0002728637,0.00046494917,0.00013434739,0.0002447905,9.606954e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023101375,0.0022358068,0.025630698,0.00033560183,0.0003017504,0.0000028660866,0.10606553,0.22211549,0.004100688,0.08634017,0.000051186147,0.5525892],"study_design_scores_gemma":[0.000364095,0.00011292037,0.006912152,0.00013056613,0.0000135592845,0.000008048831,0.00029678713,0.9913743,0.000589109,0.000015121869,0.00002570425,0.00015764771],"about_ca_topic_score_codex":0.00013981039,"about_ca_topic_score_gemma":0.00021678479,"teacher_disagreement_score":0.79160076,"about_ca_system_score_codex":0.0000331089,"about_ca_system_score_gemma":0.000028984023,"threshold_uncertainty_score":0.5037336},"labels":[],"label_agreement":null},{"id":"W2138088113","doi":"10.1109/tnet.2010.2043368","title":"Path Diversity Over Packet Switched Networks: Performance Analysis and Rate Allocation","year":2010,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Path (computing); Computer science; Heuristic; Asymptotically optimal algorithm; Redundancy (engineering); Network packet; Algorithm; Mathematical optimization; Discrete mathematics; Combinatorics; Mathematics; Artificial intelligence; Computer network","score_opus":0.02673900923945198,"score_gpt":0.2510959506195389,"score_spread":0.22435694138008688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138088113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23528601,0.000105680956,0.7629032,0.00034961847,0.00088286336,0.00013805357,0.00000109765,0.0001684862,0.00016496023],"genre_scores_gemma":[0.9911436,0.0019436678,0.006104209,0.00047807925,0.00018681708,0.000020027983,0.000006094464,0.000012305494,0.00010519744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850756,0.00017662148,0.00026922705,0.00048650874,0.00021424606,0.00034583927],"domain_scores_gemma":[0.9980833,0.00030951755,0.00013301021,0.0012126411,0.000115989555,0.00014553164],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00070641865,0.00022296628,0.00024770014,0.00025563402,0.0014368122,0.00024033799,0.0009449256,0.00012168387,0.000048354806],"category_scores_gemma":[0.000009516474,0.00022513844,0.00012668165,0.0017668739,0.00007777284,0.00056764437,0.00010681396,0.0006598659,0.000008627718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005096764,0.00018011498,0.024651062,0.000014590746,0.0005102871,0.0000047585067,0.0016256563,0.10524897,0.0014785446,0.0009154211,0.00017546538,0.86514413],"study_design_scores_gemma":[0.00036449748,0.00005756269,0.055413827,0.00003542678,0.00013917615,0.0000037837642,0.000012322701,0.9418456,0.00033831084,0.00013432464,0.0013425293,0.00031266818],"about_ca_topic_score_codex":0.000020453283,"about_ca_topic_score_gemma":0.00061585585,"teacher_disagreement_score":0.8648315,"about_ca_system_score_codex":0.000046423753,"about_ca_system_score_gemma":0.00002866798,"threshold_uncertainty_score":0.9998632},"labels":[],"label_agreement":null},{"id":"W2138164181","doi":"10.1109/icwc.1992.200754","title":"Switched diversity on Nakagami channels","year":2003,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nakagami distribution; Fading; Antenna (radio); Diversity combining; Bit error rate; Topology (electrical circuits); Rayleigh fading; Mathematics; Computer science; Channel (broadcasting); Telecommunications; Algorithm; Statistics; Combinatorics","score_opus":0.06306461481948664,"score_gpt":0.26827736515695916,"score_spread":0.20521275033747252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138164181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025610592,0.00013046643,0.6855423,0.0029083753,0.00054618705,0.00013589369,1.464099e-7,0.0003070043,0.28481907],"genre_scores_gemma":[0.9908779,0.000079212274,0.004613329,0.0017538136,0.000011134669,0.0000020246375,2.4906288e-7,0.0000018107845,0.0026605031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994743,0.000088008885,0.000061317674,0.00015361093,0.000106904445,0.00011587896],"domain_scores_gemma":[0.999343,0.000059876154,0.0000183325,0.0004796326,0.000046776582,0.000052415882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019101653,0.000059210965,0.000058761303,0.0000381859,0.0003212527,0.000059279282,0.0005905079,0.000019248357,0.00013461204],"category_scores_gemma":[0.000037471127,0.00005078522,0.000027283004,0.00023949512,0.00001212281,0.00014521771,0.00045521223,0.00007413474,0.00020189327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010071635,0.00004483348,0.0005240013,6.0819536e-7,0.000005266937,0.0000016588908,0.0005595951,0.00006806573,0.0001648443,0.9811805,0.00279233,0.014657276],"study_design_scores_gemma":[0.0036830807,0.0006968562,0.021987487,0.00009756314,0.000014566022,0.000029821966,0.00032940734,0.17111893,0.06797464,0.04014034,0.6918892,0.00203807],"about_ca_topic_score_codex":0.0000022326428,"about_ca_topic_score_gemma":0.000006939994,"teacher_disagreement_score":0.96526736,"about_ca_system_score_codex":0.00002251259,"about_ca_system_score_gemma":0.0000141446035,"threshold_uncertainty_score":0.2594997},"labels":[],"label_agreement":null},{"id":"W2138206251","doi":"10.1109/icassp.2012.6288472","title":"Asynchronous bidirectional relay-assisted communications","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Asynchronous communication; Transceiver; Computer science; Subcarrier; Orthogonal frequency-division multiplexing; Electronic engineering; Multiplexing; Power (physics); Interference (communication); Transmitter power output; Intersymbol interference; Computer network; Telecommunications; Transmitter; Engineering; Wireless; Decoding methods","score_opus":0.0812993324231259,"score_gpt":0.31506615029647433,"score_spread":0.23376681787334844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138206251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017827902,0.0032589184,0.80586565,0.006329804,0.0004168946,0.000112011425,5.51438e-7,0.0004969355,0.18173644],"genre_scores_gemma":[0.8317951,0.0006052277,0.1658342,0.0006545627,0.00005438549,0.000023429857,0.0000050822778,0.0000045019683,0.0010235133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927723,0.00016350836,0.00015030488,0.000105630854,0.000111010115,0.0001923238],"domain_scores_gemma":[0.9981588,0.00016651915,0.00004300453,0.0014400968,0.00009042592,0.00010115709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003235151,0.00007276739,0.00007315653,0.00006423988,0.00038927724,0.00007281308,0.0012592501,0.00003188275,0.00016608427],"category_scores_gemma":[0.000034430253,0.000066378525,0.000040367973,0.0004369423,0.00005203224,0.0005479993,0.0007498696,0.00013813622,0.00035436897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.33912e-7,0.00017784825,0.0033599164,9.2128414e-7,0.000014834649,1.0434027e-7,0.00040295365,0.000005951803,0.0006272097,0.8238265,0.006005299,0.16557786],"study_design_scores_gemma":[0.00039663698,0.000038136408,0.12655185,0.00002019197,0.000008759718,0.000079218684,0.000056145924,0.07160079,0.0010275709,0.00057443394,0.7992204,0.0004259194],"about_ca_topic_score_codex":0.0000051032434,"about_ca_topic_score_gemma":0.000026960892,"teacher_disagreement_score":0.8300123,"about_ca_system_score_codex":0.00006258925,"about_ca_system_score_gemma":0.00003839408,"threshold_uncertainty_score":0.45548144},"labels":[],"label_agreement":null},{"id":"W2138242617","doi":"10.1109/wcnc.2006.1683471","title":"On the scalability of relay based wireless networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Relay; Base station; License; Wireless; Scalability; Wireless network; Radio resource management; Component (thermodynamics); Distributed computing; Telecommunications","score_opus":0.020185835982217615,"score_gpt":0.23796216775378587,"score_spread":0.21777633177156824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138242617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059460443,0.00005210959,0.91175365,0.0044112317,0.00006883044,0.00010906393,1.6681551e-7,0.00007023878,0.02407425],"genre_scores_gemma":[0.99636596,0.000010296574,0.0025346961,0.0008168223,0.000016062799,0.000007041918,7.7567256e-7,0.00000233691,0.00024598118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993017,0.00019612565,0.00015559669,0.00013291005,0.000114977636,0.00009871853],"domain_scores_gemma":[0.9983137,0.00067386945,0.000048211787,0.0008646526,0.000082630286,0.000016899081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047239082,0.000058831785,0.000074491734,0.00001981269,0.00012328982,0.00003708367,0.00075391633,0.000024444602,0.000082034996],"category_scores_gemma":[0.000025847146,0.000035393048,0.00004099967,0.00034766525,0.00006376945,0.000057675425,0.00013747615,0.00010783078,0.00000818576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025603072,0.000063792744,0.00076894456,9.199521e-7,0.0000015810219,1.3495138e-7,0.000014402436,0.011416378,0.00011791784,0.9716993,0.0039349007,0.011979139],"study_design_scores_gemma":[0.00009501773,0.00002279914,0.008447199,0.0000123401505,7.502074e-7,1.5971607e-7,0.0000019179365,0.9877786,0.0014350954,0.0013872689,0.00076534186,0.000053527103],"about_ca_topic_score_codex":0.000013239322,"about_ca_topic_score_gemma":0.000051837633,"teacher_disagreement_score":0.9763622,"about_ca_system_score_codex":0.000016476384,"about_ca_system_score_gemma":0.000022243574,"threshold_uncertainty_score":0.14432867},"labels":[],"label_agreement":null},{"id":"W2138542287","doi":"10.1109/infcom.2011.5934898","title":"Asymptotic optimality of randomized peer-to-peer broadcast with network coding","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Upload; Computer science; Computer network; Peer-to-peer; Asymptotically optimal algorithm; Bandwidth (computing); Upper and lower bounds; Node (physics); Coding (social sciences); Download; Distributed computing; Mathematics; Algorithm; Network packet; Engineering","score_opus":0.05333346897629088,"score_gpt":0.27204884992012157,"score_spread":0.2187153809438307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138542287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004474936,0.00011932123,0.9092408,0.0013485625,0.00013058573,0.00040581851,4.0314796e-7,0.00012805202,0.08415156],"genre_scores_gemma":[0.7453048,0.000047151658,0.25201336,0.00043947747,0.00003067195,0.000024764604,0.0000012905972,0.000007175568,0.00213128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828696,0.00035510008,0.00039796144,0.00028149318,0.0004071074,0.00027137832],"domain_scores_gemma":[0.9977636,0.00033193696,0.00014087772,0.00087859615,0.0007557077,0.00012930718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002286073,0.00015033853,0.00047696137,0.00007122362,0.00014749017,0.000075167176,0.0010544932,0.000035824283,0.00024052165],"category_scores_gemma":[0.00021247778,0.0001071595,0.00009688922,0.0006406069,0.00010985678,0.00025715734,0.00049955334,0.00013132782,0.00003751623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003650091,0.00018165025,0.0019352771,0.000015616157,0.0001951504,0.000005939641,0.00713126,0.003006584,0.00016264034,0.944958,0.007010568,0.031747226],"study_design_scores_gemma":[0.13923387,0.0009960418,0.014736248,0.0007478318,0.00020612785,0.00007844266,0.0003941878,0.80106556,0.009071767,0.005990126,0.025154227,0.0023255863],"about_ca_topic_score_codex":0.000028547915,"about_ca_topic_score_gemma":0.000028537383,"teacher_disagreement_score":0.9389679,"about_ca_system_score_codex":0.000022248372,"about_ca_system_score_gemma":0.000054312033,"threshold_uncertainty_score":0.43698376},"labels":[],"label_agreement":null},{"id":"W2138745689","doi":"10.14569/ijacsa.2013.040719","title":"Performance Evaluation of Two-Hop Wireless Link under Nakagami-m Fading","year":2013,"lang":"en","type":"article","venue":"International Journal of Advanced Computer Science and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Bangladesh University of Engineering and Technology; University Grants Commission; University of Engineering and Technology, Lahore","keywords":"Fading; Nakagami distribution; Relay; Computer science; Hop (telecommunications); Space–time block code; Wireless; Phase-shift keying; Maximal-ratio combining; Bit error rate; Telecommunications; Computer network; Decoding methods; Physics","score_opus":0.03789014024459944,"score_gpt":0.33760787992960145,"score_spread":0.29971773968500204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138745689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30892572,0.00019461034,0.6880354,0.0019337852,0.00028437946,0.00020033651,4.7333614e-7,0.000014197913,0.00041105712],"genre_scores_gemma":[0.9413639,0.000466741,0.057626024,0.00030838526,0.00018895649,0.000033299755,7.511716e-7,0.0000035917433,0.000008363079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807304,0.000051975792,0.00044262013,0.00021261393,0.0010783676,0.00014139559],"domain_scores_gemma":[0.99387944,0.00010495869,0.00042342293,0.00033532624,0.0051597115,0.00009714116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011617123,0.00009509442,0.00013687811,0.00031476674,0.00020048703,0.00022562218,0.0018806006,0.000019265475,0.000011558492],"category_scores_gemma":[0.00002763104,0.00008355553,0.00003992911,0.0006780208,0.00022468477,0.002007276,0.0004133217,0.00013950559,0.000007766111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013530317,0.000033504148,0.00016470185,0.0000015626343,0.000013420386,1.3101531e-7,0.00021065031,0.018672174,0.014117062,0.024765927,0.000023893266,0.9419956],"study_design_scores_gemma":[0.00076578785,0.0000758525,0.012826014,0.00009258782,0.000009569424,0.000058888556,0.000042940246,0.97256285,0.006572202,0.005818653,0.001037003,0.00013764523],"about_ca_topic_score_codex":0.0000019943238,"about_ca_topic_score_gemma":0.0000011710856,"teacher_disagreement_score":0.9538907,"about_ca_system_score_codex":0.00013186378,"about_ca_system_score_gemma":0.00031145802,"threshold_uncertainty_score":0.3494655},"labels":[],"label_agreement":null},{"id":"W2138778209","doi":"10.1109/glocom.2010.5683336","title":"Link Loss Inference in Wireless Sensor Networks with Randomized Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless sensor network; Computer science; Packet loss; Computer network; Path loss; Linear network coding; Key distribution in wireless sensor networks; Wireless network; Lossy compression; Fading; Network packet; Sink (geography); Real-time computing; Wireless; Algorithm; Telecommunications; Artificial intelligence","score_opus":0.017933772529493363,"score_gpt":0.26417684323620266,"score_spread":0.2462430707067093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138778209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026832616,0.000093072245,0.9627481,0.002285811,0.00037088216,0.00040072488,1.0572974e-7,0.00021469522,0.007053961],"genre_scores_gemma":[0.9473116,0.0006312734,0.05075514,0.0007452491,0.00020587917,0.00005062975,0.0000024073515,0.000011191953,0.00028667436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983109,0.0003528818,0.00037452867,0.00036373956,0.0001774674,0.00042046097],"domain_scores_gemma":[0.99692655,0.0017928322,0.000121346944,0.00088567036,0.00016020978,0.00011339144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013336615,0.0001978597,0.0004436518,0.00008293153,0.0002095545,0.00026649146,0.0010718133,0.00010234254,0.000072214134],"category_scores_gemma":[0.00013888202,0.00014472943,0.00005991566,0.00088964734,0.00017955346,0.00035748037,0.00043170137,0.00074315816,0.000017826535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012827294,0.000059260226,0.0091721695,0.0000063172743,0.000036900703,0.000030995503,0.0005948669,0.04039325,0.0002598999,0.86682403,0.0002274293,0.08111214],"study_design_scores_gemma":[0.017353779,0.000019455198,0.0009701252,0.00007455033,0.000004184197,0.000009950032,0.000006967787,0.97995406,0.00007932049,0.0004448888,0.00081350154,0.00026920383],"about_ca_topic_score_codex":0.000018715213,"about_ca_topic_score_gemma":0.001111999,"teacher_disagreement_score":0.93956083,"about_ca_system_score_codex":0.000019417052,"about_ca_system_score_gemma":0.00007494585,"threshold_uncertainty_score":0.5901895},"labels":[],"label_agreement":null},{"id":"W2138797883","doi":"10.1002/cpe.1803","title":"Evaluating frame structure design in WiMAX relay networks","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"WiMAX; Frame (networking); Computer science; Frame Relay; Quality of service; Exploit; Throughput; Computer network; Relay; Telecommunications; Computer security; Wireless","score_opus":0.15174550562033925,"score_gpt":0.3940731619490897,"score_spread":0.24232765632875045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138797883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07165692,0.004518674,0.92246896,0.00025823052,0.00022331954,0.00021313758,2.3550609e-7,0.000053151787,0.0006073702],"genre_scores_gemma":[0.90854204,0.0014641824,0.08936442,0.000562313,0.000019237934,0.000034636796,0.0000013381007,0.000004040719,0.000007823681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858457,0.000456105,0.00026762593,0.00035934983,0.00013613551,0.00019619594],"domain_scores_gemma":[0.9988123,0.0005965483,0.00015603572,0.00021743115,0.00013658659,0.00008105082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058082776,0.0001289731,0.00013030815,0.00007048857,0.0002577498,0.00016664961,0.00029053335,0.000060870465,0.000015090067],"category_scores_gemma":[0.00037339138,0.0001243365,0.000011957008,0.0003941143,0.00009788927,0.0015946827,0.00022484512,0.00027102977,0.0000016984078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034677378,0.000058184592,0.0012128198,0.0000073040264,0.000008547845,0.000009601497,0.057313558,0.004208001,0.00015050558,0.03470153,0.000048528105,0.9022467],"study_design_scores_gemma":[0.00041922068,0.00015570437,0.0071834936,0.00005076099,0.0000064468977,0.0000543416,0.0012102558,0.9879243,0.000109145396,0.0021224613,0.00053458626,0.00022930403],"about_ca_topic_score_codex":0.000011615302,"about_ca_topic_score_gemma":0.00000397078,"teacher_disagreement_score":0.98371625,"about_ca_system_score_codex":0.000015764996,"about_ca_system_score_gemma":0.00004524759,"threshold_uncertainty_score":0.50702953},"labels":[],"label_agreement":null},{"id":"W2138978911","doi":"10.1109/tvt.2010.2040755","title":"Performance Analysis of Fixed-Gain Amplify-and-Forward Relaying With MRC","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Fading; Upper and lower bounds; Relay; Nakagami distribution; Maximal-ratio combining; Topology (electrical circuits); Algorithm; Computer science; Statistics; Power (physics); Channel (broadcasting); Mathematics; Combinatorics; Telecommunications; Physics; Mathematical analysis","score_opus":0.011504477149986123,"score_gpt":0.23698736681099464,"score_spread":0.22548288966100852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138978911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43389672,0.000034866654,0.56499815,0.0006786091,0.00005121668,0.00006989572,0.0000013454976,0.00014233899,0.00012683647],"genre_scores_gemma":[0.9812462,0.0003314558,0.01824057,0.00008298669,0.0000033808942,0.000035808545,0.000001078072,0.0000075201697,0.000051004517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991476,0.000039045284,0.00020658538,0.0002902915,0.00013885151,0.00017761932],"domain_scores_gemma":[0.99873674,0.000074648895,0.00008593785,0.0009397579,0.00011895988,0.00004393974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020766241,0.0001272207,0.00024609806,0.0008507105,0.0002616826,0.00002599699,0.0006083009,0.00016817599,0.000021268188],"category_scores_gemma":[0.0000062023087,0.00010884287,0.00006508989,0.0023448728,0.00020351386,0.0001612233,0.000011393832,0.00062672526,0.000006421457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042706288,0.00034820652,0.0049527474,0.000028506009,0.001363724,0.000011209836,0.0007691203,0.07270553,0.10427066,0.038015023,0.000022557917,0.77747],"study_design_scores_gemma":[0.0005176175,0.0003317246,0.0023264019,0.000040313524,0.00030913705,0.00004383249,0.000064215186,0.8907149,0.10306304,0.000101795034,0.0021573598,0.00032970484],"about_ca_topic_score_codex":0.000004879026,"about_ca_topic_score_gemma":0.00018601498,"teacher_disagreement_score":0.8180093,"about_ca_system_score_codex":0.000016389204,"about_ca_system_score_gemma":0.000030863663,"threshold_uncertainty_score":0.44384834},"labels":[],"label_agreement":null},{"id":"W2139066989","doi":"10.1109/dcc.2006.3","title":"A Practical Approach to Joint Network-Source Coding","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Linear network coding; Source code; Fidelity; Coding (social sciences); Metrics; Distributed computing; Joint (building); Multiple description coding; Network routing; Routing (electronic design automation); Computer network; Theoretical computer science; Routing protocol; Decoding methods; Static routing; Algorithm; Telecommunications; Mathematics; Engineering; Programming language","score_opus":0.08395437838990616,"score_gpt":0.3000440683521785,"score_spread":0.21608968996227235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139066989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000249601,0.000048438375,0.8182261,0.0046898224,0.00007255425,0.0001310416,5.0565486e-8,0.00023098823,0.17635143],"genre_scores_gemma":[0.5071886,0.000017171078,0.48743352,0.001984666,0.00018037924,0.000021324939,0.0000016608913,0.0000065329064,0.0031660951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989074,0.00012935378,0.00020944218,0.0002875374,0.0001747565,0.00029154602],"domain_scores_gemma":[0.9990334,0.000106556996,0.0000419039,0.0006381644,0.00008082486,0.00009915048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004607066,0.00010348079,0.00012590778,0.000051214007,0.0002429796,0.00025869254,0.00051309186,0.000033208737,0.000027712853],"category_scores_gemma":[0.000045750156,0.00009030518,0.00004317014,0.00059363566,0.00001943323,0.00025112124,0.00065201573,0.00015415589,0.00013004111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013903211,0.000073646544,0.000065193235,0.0000014628583,0.0000037331097,0.0000010013949,0.00010376752,0.004885785,0.0003136584,0.8651681,0.11740867,0.011973607],"study_design_scores_gemma":[0.00018805625,0.000033007425,0.0017251068,0.000015860232,0.0000028909874,0.000035294674,0.000020337595,0.6920955,0.00039327028,0.00091876206,0.30431357,0.00025833905],"about_ca_topic_score_codex":0.000015341164,"about_ca_topic_score_gemma":0.000017033239,"teacher_disagreement_score":0.86424935,"about_ca_system_score_codex":0.00004068125,"about_ca_system_score_gemma":0.000036487134,"threshold_uncertainty_score":0.3682538},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02987853723354601,"score_gpt":0.25694821302863624,"score_spread":0.22706967579509024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139416652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036067765,0.0000922399,0.99371535,0.0002925744,0.00034246832,0.00034448132,0.0000032435428,0.00011396988,0.0014888768],"genre_scores_gemma":[0.99030244,0.0009956417,0.007742696,0.0007286435,0.000021268346,0.000107908185,0.0000026137718,0.000005082616,0.000093694085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990949,0.00014490115,0.00033754655,0.00011214498,0.00011763601,0.00019289636],"domain_scores_gemma":[0.998881,0.00063201366,0.00008806521,0.00026266987,0.00008382021,0.00005245393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082806585,0.00011371788,0.00014704195,0.00020915912,0.0006317331,0.000081731196,0.00027300333,0.00005317134,0.000016671387],"category_scores_gemma":[0.000024500256,0.00011130225,0.000053639975,0.00036297948,0.000062865685,0.0013790834,0.000004761314,0.00017874583,0.0000131216275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005339042,0.00009762297,0.00007983009,0.000058629295,0.0000624484,0.0000016922861,0.021248497,0.1556764,0.00019081697,0.42011786,0.0014420678,0.40049025],"study_design_scores_gemma":[0.008771189,0.0002511142,0.0015983926,0.00032484005,0.000022637918,0.00008691279,0.0006806886,0.95353866,0.0051784,0.010885065,0.017813755,0.0008483347],"about_ca_topic_score_codex":0.0000017945003,"about_ca_topic_score_gemma":0.000014709123,"teacher_disagreement_score":0.98669565,"about_ca_system_score_codex":0.000047412675,"about_ca_system_score_gemma":0.000049850332,"threshold_uncertainty_score":0.4858844},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014789864502205633,"score_gpt":0.2458056913089561,"score_spread":0.23101582680675048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139727241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010834237,0.000040743133,0.98072654,0.00081259984,0.00007440333,0.00008721847,1.675589e-7,0.00013094931,0.007293136],"genre_scores_gemma":[0.9971928,0.000036922105,0.0020288536,0.000328126,0.000035864065,0.000011949331,0.000020449013,0.000002570059,0.00034243643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943596,0.000087538785,0.00013844171,0.0001521804,0.00006603827,0.00011982242],"domain_scores_gemma":[0.9996345,0.00006555864,0.000023215556,0.00020254393,0.000057251287,0.000016911095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001508956,0.000061619015,0.000058780384,0.000062095176,0.0001044246,0.00010595727,0.00023366608,0.00003177795,0.000035288125],"category_scores_gemma":[0.000014352065,0.00005593784,0.000013977799,0.0006983379,0.000008304422,0.00019973579,0.000056882123,0.00010801059,0.000021642023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028145112,0.00005957598,0.00087468745,2.9314944e-7,8.5201896e-7,5.605086e-7,0.000012087827,0.11275963,0.0001888287,0.8674904,0.0053208694,0.013289368],"study_design_scores_gemma":[0.0001977876,0.000029826548,0.012742176,0.0000072167486,3.1013946e-7,0.000001228074,8.6125834e-7,0.98359126,0.00033448666,0.000897377,0.0021200709,0.00007742513],"about_ca_topic_score_codex":0.000024534731,"about_ca_topic_score_gemma":0.0007264819,"teacher_disagreement_score":0.9863586,"about_ca_system_score_codex":0.00006563959,"about_ca_system_score_gemma":0.000015111641,"threshold_uncertainty_score":0.22810788},"labels":[],"label_agreement":null},{"id":"W2139781224","doi":"10.5339/qfarf.2012.csps14","title":"Minimum-selection maximum ratio transmission schemes in underlay cognitive radio systems","year":2012,"lang":"en","type":"article","venue":"Qatar Foundation Annual Research Forum Volume 2012 Issue 1","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Transmission (telecommunications); Cognitive radio; Spectral efficiency; Maximal-ratio combining; Bandwidth (computing); Interference (communication); Electronic engineering; Algorithm; Telecommunications; Wireless; Channel (broadcasting); Decoding methods; Fading; Engineering","score_opus":0.07529875865255012,"score_gpt":0.3770946154294622,"score_spread":0.3017958567769121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139781224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014923977,0.0059141563,0.9660133,0.0065470426,0.00086454843,0.0014893974,0.000011726425,0.00024498513,0.0039908257],"genre_scores_gemma":[0.9866435,0.0009283015,0.0027589104,0.00012127521,0.00033287745,0.00014877146,0.00010615337,0.00002830986,0.008931889],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956406,0.0013788457,0.00051458867,0.0004789127,0.0009408858,0.0010461643],"domain_scores_gemma":[0.9976004,0.00044075097,0.000118661635,0.00052776677,0.0009737139,0.00033871515],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034670036,0.00022922186,0.0002651931,0.0006722589,0.00078713003,0.0005084713,0.0008966657,0.00016467205,0.0006910264],"category_scores_gemma":[0.00038692827,0.00022979463,0.00006550276,0.001743535,0.0001746417,0.0047371527,0.0003401749,0.00072010193,0.001531996],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023163993,0.0011368203,0.010728027,0.00012789111,0.00009780562,0.00000638731,0.019194605,0.00034842087,0.004518952,0.1182719,0.07546542,0.7698721],"study_design_scores_gemma":[0.0009856087,0.00024858507,0.005172644,0.0001993864,0.0000058015994,0.000017802628,0.003028511,0.19662435,0.0007950595,0.00038772984,0.79213274,0.00040180178],"about_ca_topic_score_codex":0.0001310858,"about_ca_topic_score_gemma":0.00012979095,"teacher_disagreement_score":0.97171956,"about_ca_system_score_codex":0.00042063813,"about_ca_system_score_gemma":0.00026316717,"threshold_uncertainty_score":0.9992454},"labels":[],"label_agreement":null},{"id":"W2139805394","doi":"10.1109/jsac.2012.120915","title":"Moments Based Framework for Performance Analysis of One-Way/Two-Way CSI-Assisted AF Relaying","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":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Nakagami distribution; Fading; Rayleigh fading; Moment-generating function; Channel state information; Probability density function; Harmonic mean; Cumulative distribution function; Moment (physics); Channel (broadcasting); Algorithm; Function (biology); Telecommunications; Wireless; Mathematics; Statistics","score_opus":0.1109708704052715,"score_gpt":0.3576663757832263,"score_spread":0.24669550537795482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139805394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22874321,0.0016052618,0.76329,0.003531395,0.00039377753,0.0004800535,0.000013899848,0.00011853179,0.0018238777],"genre_scores_gemma":[0.85630745,0.0014537236,0.14166947,0.00037341233,0.000050151542,0.00007253761,0.000024191848,0.000015712021,0.000033368855],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734783,0.00078501453,0.000839459,0.00020479031,0.00037729662,0.00044563742],"domain_scores_gemma":[0.9937374,0.002130353,0.0006331963,0.002491367,0.00082037115,0.00018733375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001493492,0.00020264299,0.00044457192,0.0010778595,0.00079203583,0.00013898838,0.0030305681,0.000110412046,0.000029069122],"category_scores_gemma":[0.0005009627,0.00020217446,0.00019930485,0.005276967,0.00008805665,0.0006307425,0.00025687166,0.0009819702,0.000007956353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042769386,0.010603847,0.32284617,0.000096661985,0.004393328,0.0000024252734,0.0109773055,0.07225934,0.01598313,0.24589108,0.0018643042,0.31465474],"study_design_scores_gemma":[0.0013632999,0.00020605094,0.29889432,0.0006137098,0.00031068086,0.000010782459,0.000058376245,0.6920603,0.002235185,0.0005947425,0.0031989464,0.00045365212],"about_ca_topic_score_codex":0.0000043704335,"about_ca_topic_score_gemma":0.00006607413,"teacher_disagreement_score":0.62756425,"about_ca_system_score_codex":0.00031789998,"about_ca_system_score_gemma":0.00015730472,"threshold_uncertainty_score":0.8244435},"labels":[],"label_agreement":null},{"id":"W2139823663","doi":"10.1109/wcnc.2011.5779362","title":"Data-dependent channel estimation and superimposed training design in amplify and forward relay networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Relay; Cyclic prefix; Computer science; Channel (broadcasting); Training (meteorology); Upper and lower bounds; Mean squared error; Sequence (biology); Algorithm; Statistics; Computer network; Mathematics; Orthogonal frequency-division multiplexing","score_opus":0.22914591238950716,"score_gpt":0.3070509864860616,"score_spread":0.07790507409655445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139823663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054418957,0.0004562802,0.9926956,0.00021367182,0.000054841195,0.00017693902,7.0985766e-7,0.000071252536,0.0008888094],"genre_scores_gemma":[0.86476636,0.0006748659,0.13428858,0.00020321032,0.000010007442,0.000010787635,0.000007102731,0.0000051426887,0.000033965083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991008,0.00015859134,0.00018830934,0.00030567782,0.000075716474,0.00017092332],"domain_scores_gemma":[0.999138,0.00016205992,0.000037764472,0.00056698994,0.00002413948,0.000071041686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008738939,0.00009668813,0.00012303678,0.00007410016,0.00012097738,0.00011764153,0.00055138697,0.00005117283,0.000012415086],"category_scores_gemma":[0.000046084922,0.00008711359,0.000006135135,0.00017150913,0.000037098176,0.0007002361,0.00063874084,0.0001461905,0.0000020418804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004189995,0.000099206256,0.0009941171,0.000012053523,0.00003093757,0.000016003492,0.028178781,0.008432557,0.00029388914,0.094021164,0.00048455907,0.8673948],"study_design_scores_gemma":[0.0002969629,0.000043900047,0.0038291095,0.000019113986,0.0000024200472,0.000013333689,0.00013237752,0.9947696,0.000041276337,0.00066344265,0.000074227384,0.00011428703],"about_ca_topic_score_codex":0.000016117192,"about_ca_topic_score_gemma":0.00011441762,"teacher_disagreement_score":0.986337,"about_ca_system_score_codex":0.000013310712,"about_ca_system_score_gemma":0.000023228342,"threshold_uncertainty_score":0.3552389},"labels":[],"label_agreement":null},{"id":"W2139850286","doi":"10.1109/tvt.2009.2039814","title":"Cross-Layer Scheduling for OFDMA Amplify-and-Forward Relay Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Goodput; Computer science; Channel state information; Subcarrier; Telecommunications link; Relay; Scheduling (production processes); Orthogonal frequency-division multiple access; Diversity gain; Fading; Orthogonal frequency-division multiplexing; Frequency-division multiple access; Physical layer; Computer network; Channel (broadcasting); Wireless; Mathematical optimization; Throughput; Power (physics); Telecommunications; Mathematics","score_opus":0.022209943774428306,"score_gpt":0.2931740394411959,"score_spread":0.2709640956667676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139850286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111910395,0.00030267003,0.88258034,0.0036423246,0.00068881776,0.00029643383,0.0000032115338,0.0005317404,0.000044069937],"genre_scores_gemma":[0.93770516,0.00059442513,0.060793646,0.00037425477,0.000042258947,0.00027933106,0.0000014161343,0.000020285594,0.00018922423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987895,0.000038203652,0.00026557653,0.0004595418,0.00010725112,0.00033993396],"domain_scores_gemma":[0.99853396,0.00016501459,0.00007807498,0.00095496094,0.00018648834,0.00008150177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003182869,0.000187711,0.00021082618,0.0003055868,0.00067873497,0.0001424029,0.00087246974,0.00043833363,0.00003129231],"category_scores_gemma":[0.000023227878,0.00018278115,0.000098706485,0.0006259728,0.00021554997,0.00022776796,0.00001935188,0.0010671974,0.000016214208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032213833,0.00023354302,0.00029005078,0.000016964734,0.00013623416,0.0000060410252,0.00017221205,0.10841912,0.057847694,0.105744384,0.000078527235,0.727023],"study_design_scores_gemma":[0.0008316927,0.00014661333,0.00014710193,0.00003383675,0.000026201238,0.0000512934,0.000014536068,0.9256975,0.047364645,0.0011265612,0.024203736,0.0003562561],"about_ca_topic_score_codex":0.0000025040576,"about_ca_topic_score_gemma":0.000060646358,"teacher_disagreement_score":0.82579476,"about_ca_system_score_codex":0.000023862465,"about_ca_system_score_gemma":0.000036752335,"threshold_uncertainty_score":0.7453599},"labels":[],"label_agreement":null},{"id":"W2139868601","doi":"10.1109/pacrim.2011.6032967","title":"Performance analysis of relay-assisted mobile-to-mobile communication in double or cascaded Rayleigh fading","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Non-line-of-sight propagation; Rayleigh fading; Rayleigh scattering; Relay; Computer science; Mobile station; Channel (broadcasting); Mobile radio; Electronic engineering; Antenna (radio); Fading; Computer network; Telecommunications; Wireless; Base station; Engineering; Physics; Optics","score_opus":0.09475276314376718,"score_gpt":0.310999962656035,"score_spread":0.21624719951226784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139868601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9566142,0.00023898648,0.023956697,0.00006358512,0.000051502844,0.0006046546,7.718748e-7,0.00011584361,0.018353762],"genre_scores_gemma":[0.9675595,0.0007687784,0.030380156,0.00012076155,0.000003369358,0.0003030029,0.0000067618225,0.0000066850466,0.000850988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866927,0.0001777145,0.000500291,0.00027481042,0.00016856845,0.00020933388],"domain_scores_gemma":[0.99783796,0.00015611413,0.00015150224,0.0015923122,0.00018379196,0.00007828928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066077505,0.00012901159,0.00032234806,0.0006346685,0.00015048246,0.000042308922,0.0016530926,0.000060083734,0.0003056585],"category_scores_gemma":[0.000016063967,0.0001062388,0.000081663165,0.004314229,0.000045922665,0.00046694453,0.0006762439,0.00017029665,0.00002466242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097212836,0.0022189922,0.14516965,0.00009913895,0.0012894241,0.000012840544,0.09989383,0.057142828,0.013657845,0.074707545,0.00091307244,0.6039227],"study_design_scores_gemma":[0.0014082376,0.00043460642,0.14017716,0.00013857069,0.00011328501,0.0000056069584,0.0005862392,0.83825785,0.014836783,0.000017154944,0.003534194,0.0004903147],"about_ca_topic_score_codex":0.00014022183,"about_ca_topic_score_gemma":0.0011943431,"teacher_disagreement_score":0.781115,"about_ca_system_score_codex":0.00008312288,"about_ca_system_score_gemma":0.000050977367,"threshold_uncertainty_score":0.43322924},"labels":[],"label_agreement":null},{"id":"W2139961280","doi":"10.1109/tit.2007.901177","title":"Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Monomial; Mathematics; Block code; Diagonal; Covariance; Combinatorics; Block (permutation group theory); Diagonal matrix; Discrete mathematics; Symbol (formal); Algorithm; Decoding methods; Computer science; Statistics","score_opus":0.02328828392727936,"score_gpt":0.26116469290481564,"score_spread":0.23787640897753629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139961280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004581499,0.000048797072,0.99556977,0.00024474759,0.00070673105,0.00052226224,0.00003437205,0.00029841752,0.002116758],"genre_scores_gemma":[0.9894739,0.00009147274,0.008627106,0.0013430548,0.000042112177,0.000105353116,0.000051267827,0.000010206025,0.00025554304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987039,0.00011748947,0.0005034964,0.00016174625,0.00017765237,0.00033570832],"domain_scores_gemma":[0.99797374,0.0007698288,0.0001514787,0.0005520169,0.00043357202,0.00011938505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012059757,0.0001822058,0.00016312145,0.00021517772,0.000738004,0.00025780033,0.0005919816,0.000105384745,0.00007077142],"category_scores_gemma":[0.000035611087,0.0001738974,0.00010432034,0.0006727357,0.00006441032,0.0019418553,0.0000069145394,0.00025645935,0.00006956625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023217204,0.00020948931,0.0000017907173,0.000013801951,0.00007305278,5.212421e-7,0.002752693,0.2103574,0.00024564337,0.15769687,0.0014025007,0.62701404],"study_design_scores_gemma":[0.0021684603,0.0005232637,0.00007976806,0.00008905648,0.000033395725,0.000017574088,0.0011894075,0.8980016,0.04334289,0.0025891783,0.051261693,0.0007036743],"about_ca_topic_score_codex":8.785184e-7,"about_ca_topic_score_gemma":0.000022960528,"teacher_disagreement_score":0.98901576,"about_ca_system_score_codex":0.00015752664,"about_ca_system_score_gemma":0.00005913604,"threshold_uncertainty_score":0.709133},"labels":[],"label_agreement":null},{"id":"W2140100444","doi":"10.1109/icc.2010.5502106","title":"Jointly Optimal Power and Resource Allocation for Orthogonal NDF Relay Systems with QoS Constraints","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; Mathematical optimization; Computer science; Quality of service; Resource allocation; Power (physics); Transmission (telecommunications); Optimization problem; Block (permutation group theory); Mathematics; Computer network; Telecommunications","score_opus":0.01806620908821455,"score_gpt":0.248069478160428,"score_spread":0.23000326907221344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140100444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04990012,0.000078578356,0.93883824,0.0021683523,0.00017235632,0.00034456828,0.000001591814,0.00010174898,0.008394423],"genre_scores_gemma":[0.9408465,0.000010053459,0.05786943,0.0002764079,0.00004407962,0.000061063176,0.0000040079954,0.0000066145826,0.00088185014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928576,0.000049925384,0.00015651791,0.00024134682,0.00011817398,0.00014827955],"domain_scores_gemma":[0.99910635,0.00013427997,0.00006251793,0.00043249922,0.00018051517,0.00008385165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040061172,0.0000947565,0.00010310521,0.000047351474,0.00020164695,0.00021271635,0.00034228747,0.00004729743,0.0000379977],"category_scores_gemma":[0.000033117918,0.00007215714,0.000019067998,0.00012995202,0.000127116,0.00022300944,0.00013126271,0.00015774209,0.0000071287986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021267011,0.00003814495,0.00035268735,0.000008916833,0.00002368937,0.0000013715182,0.00060009124,0.0002372909,0.0032043671,0.96611893,0.0028218406,0.02657139],"study_design_scores_gemma":[0.001648782,0.00042976247,0.0037945914,0.00009211243,0.000013576097,0.00025236537,0.00034868362,0.80357784,0.0010102073,0.00012173651,0.18816184,0.0005484776],"about_ca_topic_score_codex":0.0000016675343,"about_ca_topic_score_gemma":0.000027778375,"teacher_disagreement_score":0.9659972,"about_ca_system_score_codex":0.000008932432,"about_ca_system_score_gemma":0.00006184381,"threshold_uncertainty_score":0.29424828},"labels":[],"label_agreement":null},{"id":"W2140124754","doi":"10.1109/glocom.2005.1578320","title":"Performance analysis of the node cooperative ARQ scheme for wireless ad-hoc networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless ad hoc network; Computer science; Computer network; Node (physics); Scheme (mathematics); Selective Repeat ARQ; Automatic repeat request; Ad hoc wireless distribution service; Mobile ad hoc network; Wireless network; Wireless; Optimized Link State Routing Protocol; Hybrid automatic repeat request; Telecommunications; Telecommunications link; Network packet; Engineering; Mathematics","score_opus":0.03751028069615478,"score_gpt":0.2919866345592695,"score_spread":0.25447635386311473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140124754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17123817,0.0061075604,0.77926934,0.019952707,0.00091827294,0.0022521794,0.00031476837,0.0005188265,0.019428197],"genre_scores_gemma":[0.93720734,0.009242385,0.05136637,0.001213617,0.000057952857,0.00023383503,0.00009665029,0.000016291528,0.00056555896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680907,0.0005129472,0.0010076571,0.00059289316,0.0003724302,0.00070501404],"domain_scores_gemma":[0.99337405,0.00037525332,0.00058415695,0.0042895763,0.0011835024,0.00019343385],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00074567285,0.0004261906,0.000702061,0.00021835281,0.001242341,0.0002905186,0.0065339413,0.00017970687,0.000097435935],"category_scores_gemma":[0.000080169644,0.00036398164,0.00042515824,0.003616246,0.0004098561,0.00071487937,0.0011817106,0.0004966991,0.00003112486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009610608,0.0012797534,0.00912581,0.00003643105,0.0022808781,5.606724e-7,0.0013563633,0.13173848,0.0007764582,0.1418906,0.03652927,0.67488927],"study_design_scores_gemma":[0.0006136397,0.000060242164,0.011854962,0.00007126478,0.00018983477,0.0000056800013,0.000052390107,0.905706,0.00031359974,0.000059224156,0.080666825,0.00040637824],"about_ca_topic_score_codex":0.000018598259,"about_ca_topic_score_gemma":0.002848239,"teacher_disagreement_score":0.77396744,"about_ca_system_score_codex":0.0003855017,"about_ca_system_score_gemma":0.00051297515,"threshold_uncertainty_score":0.9998812},"labels":[],"label_agreement":null},{"id":"W2140249632","doi":"10.1109/vtcf.2006.163","title":"A Bandwidth-Efficient Coded Cooperative Communications System","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Saskatchewan","funders":"","keywords":"Spectral efficiency; Computer science; Quadrature amplitude modulation; Bandwidth (computing); Encoder; Concatenation (mathematics); Phase-shift keying; Fading; Electronic engineering; Algorithm; Decoding methods; Telecommunications; Bit error rate; Mathematics; Arithmetic; Engineering; Channel (broadcasting)","score_opus":0.027619271285412333,"score_gpt":0.2585850865807939,"score_spread":0.23096581529538154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140249632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04555497,0.0017974286,0.93332535,0.0077728294,0.00025471262,0.00049587135,0.0000056375097,0.0016282898,0.009164907],"genre_scores_gemma":[0.9769156,0.0001776945,0.02231994,0.0001331521,0.000023128923,0.00017294247,0.000010986681,0.000012339309,0.00023421027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982238,0.00026480152,0.00042315238,0.00049450406,0.00021893295,0.00037482183],"domain_scores_gemma":[0.9959417,0.00011198368,0.00016919867,0.0030250284,0.000691045,0.000061029346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033435348,0.00024159002,0.0003120538,0.00033932654,0.0006758668,0.00019933368,0.0036817645,0.00021903214,0.000010883286],"category_scores_gemma":[0.00004038296,0.00022824234,0.00006906003,0.0014853477,0.0004897472,0.0001538739,0.0008656958,0.0004866381,0.0001677432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001816327,0.00011727836,0.00018556211,0.00000718653,0.0000203342,0.000013418901,0.000117639545,0.0015552769,0.0177139,0.9727953,0.0004020864,0.0070702042],"study_design_scores_gemma":[0.0006037933,0.00007037071,0.00031970502,0.00015121617,0.00001527722,0.0000833477,0.00015118165,0.9589873,0.025541969,0.0014816014,0.012164154,0.00043010485],"about_ca_topic_score_codex":0.000025425807,"about_ca_topic_score_gemma":0.00011866921,"teacher_disagreement_score":0.9713137,"about_ca_system_score_codex":0.00013921145,"about_ca_system_score_gemma":0.00017818827,"threshold_uncertainty_score":0.93074524},"labels":[],"label_agreement":null},{"id":"W2140279669","doi":"10.1109/pimrc.2008.4699898","title":"Synergetic cooperation in a distributed base station system","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Base station; Computer network; Emulation; Protocol (science); Context (archaeology); Wireless network; Quality of service; Resource (disambiguation); Distributed computing; Spectral efficiency; Wireless; Telecommunications","score_opus":0.036569039108022255,"score_gpt":0.25056290738626574,"score_spread":0.2139938682782435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140279669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050903175,0.00011445349,0.9458602,0.0009906898,0.000085824875,0.00013891546,0.0000015169022,0.00019583188,0.001709397],"genre_scores_gemma":[0.98914075,0.00012642544,0.010365918,0.0001318829,0.000010908725,0.000024021567,0.000028242468,0.0000029457258,0.00016888995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925596,0.00015837004,0.00019855773,0.00016498004,0.00010496767,0.00011718711],"domain_scores_gemma":[0.999389,0.0000611505,0.000033660795,0.00036082367,0.00011353598,0.00004181161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018848172,0.00006683942,0.0000847549,0.0000783463,0.00016049475,0.000048875216,0.00030824976,0.000023517267,0.000018123357],"category_scores_gemma":[0.000038157636,0.00006066377,0.000015861164,0.00061903644,0.000017290024,0.00035511242,0.00009435846,0.00007088114,0.000050381535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010497494,0.00018065936,0.004497602,0.000023999848,0.000009508634,0.00006455565,0.0023227935,0.007966549,0.0038470782,0.9578235,0.0078106513,0.015442569],"study_design_scores_gemma":[0.00035757155,0.000025087787,0.0069689495,0.00003069802,7.8607013e-7,0.000023283885,0.000051591593,0.98969436,0.0010984817,0.000023298653,0.001606079,0.000119801174],"about_ca_topic_score_codex":0.000014581475,"about_ca_topic_score_gemma":0.00009346063,"teacher_disagreement_score":0.98172784,"about_ca_system_score_codex":0.0001050423,"about_ca_system_score_gemma":0.000058223624,"threshold_uncertainty_score":0.24737968},"labels":[],"label_agreement":null},{"id":"W2140332083","doi":"10.1109/infcom.2011.5934911","title":"Scheduling in wireless ad hoc networks with successive interference cancellation","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Wireless ad hoc network; Computer network; Testbed; Wireless network; Single antenna interference cancellation; Greedy algorithm; Distributed computing; Wireless; Channel (broadcasting); Algorithm; Mathematics; Mathematical optimization; Telecommunications","score_opus":0.048270468079395785,"score_gpt":0.25813498322893597,"score_spread":0.2098645151495402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140332083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076566726,0.0006859332,0.9133908,0.00017817279,0.00007959487,0.00010210707,5.5730254e-8,0.000081710605,0.008914859],"genre_scores_gemma":[0.96778625,0.00091091014,0.030936474,0.00018187099,0.0000121917365,0.000015738013,0.0000010570852,0.0000049535442,0.00015055569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926186,0.00008062606,0.00016365715,0.00023561547,0.00007941696,0.00017885712],"domain_scores_gemma":[0.9992909,0.00006563643,0.00007033879,0.00041856818,0.00010607272,0.000048497026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015695095,0.00009817318,0.00010806963,0.00007587513,0.00008429544,0.00007246404,0.0007003314,0.00003481833,0.000060930102],"category_scores_gemma":[0.000007744465,0.00007839152,0.000013627035,0.00052198675,0.00003758398,0.00043325234,0.00023690757,0.00017948844,0.000008734281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082989434,0.00013364996,0.028121768,0.0000097446455,0.000023256305,0.000020697244,0.009214791,0.012631976,0.0003557624,0.1747751,0.00006917288,0.7745611],"study_design_scores_gemma":[0.00029251326,0.00007393667,0.008617444,0.00012669328,0.0000013857267,0.0000025382647,0.00009645615,0.98961335,0.0007392653,0.00013810796,0.00011955092,0.00017873039],"about_ca_topic_score_codex":0.0000225824,"about_ca_topic_score_gemma":0.0023788656,"teacher_disagreement_score":0.9769814,"about_ca_system_score_codex":0.000045478508,"about_ca_system_score_gemma":0.000050625695,"threshold_uncertainty_score":0.31967133},"labels":[],"label_agreement":null},{"id":"W2140505156","doi":"10.1109/bsc.2008.4563232","title":"A bandwidth-efficient cooperative relaying scheme with limited feedback information","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bandwidth (computing); Scheme (mathematics); Computer network; Mathematics","score_opus":0.030744996511461578,"score_gpt":0.23390071067071613,"score_spread":0.20315571415925454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140505156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074158855,0.00017568714,0.8823431,0.0016758974,0.00006420405,0.00026923913,5.2023637e-7,0.00033565695,0.04097682],"genre_scores_gemma":[0.93634266,0.00033750755,0.06142989,0.0013716975,0.000014854248,0.00002499244,0.0000078706535,0.000004846367,0.0004657082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990875,0.000076724034,0.00022916525,0.00017031723,0.00023538338,0.00020087152],"domain_scores_gemma":[0.99881136,0.00008002175,0.00007792549,0.00055543706,0.00039020437,0.0000850558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016545173,0.0001312217,0.00012523917,0.000116236064,0.00054972136,0.00014736774,0.00054970075,0.00003651005,0.000060269373],"category_scores_gemma":[0.000048476162,0.000097050885,0.000027429458,0.00089030556,0.000072956755,0.0009941361,0.00026052175,0.00017195665,0.00020961191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001484723,0.0005187843,0.0056189587,0.000027233522,0.00016057499,0.00003749031,0.043377697,0.040857352,0.0024010064,0.74288297,0.019862574,0.14410688],"study_design_scores_gemma":[0.0012182131,0.00018459208,0.0047883573,0.00005566699,0.0000029856624,0.00010447005,0.00020803108,0.9613622,0.0020097257,0.000014640778,0.029668704,0.0003824393],"about_ca_topic_score_codex":0.0000040495706,"about_ca_topic_score_gemma":0.000007832922,"teacher_disagreement_score":0.9205048,"about_ca_system_score_codex":0.000054879158,"about_ca_system_score_gemma":0.000111109475,"threshold_uncertainty_score":0.42280677},"labels":[],"label_agreement":null},{"id":"W2140517720","doi":"10.1109/vetecs.2005.1543919","title":"Effect of Intercell Interference on the SNIR of a Multihop Cellular Network","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cellular network; Computer network; Base station; Computer science; Interference (communication); Transmission (telecommunications); Cellular traffic; Cellular model; Telecommunications; Channel (broadcasting)","score_opus":0.025622769991461264,"score_gpt":0.2698155874557125,"score_spread":0.24419281746425123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140517720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35595468,0.00069161155,0.60299677,0.0028839235,0.00021890142,0.00042894945,4.7547e-7,0.00009034368,0.03673435],"genre_scores_gemma":[0.9961649,0.000101857564,0.0030749436,0.00028429134,0.000036345366,0.000007923425,3.6382554e-7,0.0000034335162,0.00032589908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990317,0.00037534538,0.00022525234,0.00013863388,0.00010727705,0.00012176831],"domain_scores_gemma":[0.9981127,0.0009100887,0.000096492295,0.0007873432,0.00006721062,0.000026169879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007128785,0.00009234534,0.00015277283,0.000032978525,0.00006254263,0.00002180012,0.0012430848,0.000024341842,0.00012369883],"category_scores_gemma":[0.0000589661,0.0000529154,0.00006668863,0.00027461184,0.000052109226,0.0000818544,0.00046251362,0.00013416733,0.00003603457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007374173,0.00014602527,0.00043021125,0.000024663439,0.000043201435,6.8142384e-7,0.002253772,0.0049672117,0.025897583,0.21650983,0.005438061,0.744215],"study_design_scores_gemma":[0.00035143667,0.0007182607,0.00014283034,0.00019461192,0.000005547174,8.636008e-7,0.0000142703175,0.60436004,0.38692594,0.00011916936,0.0070416196,0.0001253761],"about_ca_topic_score_codex":0.0000035820772,"about_ca_topic_score_gemma":0.000024730374,"teacher_disagreement_score":0.74408966,"about_ca_system_score_codex":0.0000148842555,"about_ca_system_score_gemma":0.000011708147,"threshold_uncertainty_score":0.23099816},"labels":[],"label_agreement":null},{"id":"W2140733940","doi":"10.1109/icc.2008.865","title":"Performance Analysis of Distributed Spatial Diversity with Selection Combining","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Medical Research Council","keywords":"Cooperative diversity; Computer science; Selection (genetic algorithm); Antenna diversity; Relay; Outage probability; Exploit; Diversity combining; Diversity (politics); Diversity gain; Maximal-ratio combining; Signal-to-noise ratio (imaging); Simple (philosophy); Communications system; Performance improvement; Distributed computing; Computer network; Algorithm; Telecommunications; Fading; Wireless; Engineering; Machine learning; Decoding methods","score_opus":0.034189266059336136,"score_gpt":0.23164483134403654,"score_spread":0.1974555652847004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140733940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48667613,0.0000048897577,0.5121581,0.00004727133,0.000008826255,0.00002016369,4.401719e-7,0.000036821057,0.0010473672],"genre_scores_gemma":[0.9956664,0.00008586041,0.0041320757,0.00003485644,0.00000324015,9.722414e-7,0.000008739619,9.598263e-7,0.00006691017],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995611,0.000038301758,0.00008842661,0.00010871801,0.00012850764,0.00007496542],"domain_scores_gemma":[0.99952203,0.00003224121,0.000055774493,0.00021745457,0.0001465209,0.000025979793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008155001,0.000046845624,0.00011179809,0.00010707504,0.00040665056,0.000009510386,0.0003290055,0.000013344364,0.000034630248],"category_scores_gemma":[0.000005191638,0.000038120153,0.000029887944,0.0015463325,0.000036460977,0.00020006554,0.00033804355,0.000053465497,0.000001761519],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013450804,0.000057657904,0.97724,0.0000017406564,0.0002059642,7.5196135e-7,0.0009488061,0.009878523,0.00015628642,0.0029893052,0.00011793167,0.008389562],"study_design_scores_gemma":[0.000106808686,0.00004705438,0.4259616,0.0000022779195,0.000023333285,0.0000015443939,0.000004969396,0.57317775,0.000569408,8.8411093e-7,0.000064355656,0.00003999228],"about_ca_topic_score_codex":0.00006354288,"about_ca_topic_score_gemma":0.00022075445,"teacher_disagreement_score":0.56329924,"about_ca_system_score_codex":0.00002185444,"about_ca_system_score_gemma":0.000022235392,"threshold_uncertainty_score":0.31276685},"labels":[],"label_agreement":null},{"id":"W2140739137","doi":"10.1109/icassp.2014.6855076","title":"Optimal spectrum leasing and network beamforming for two-way relay networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Transceiver; Computer science; Computer network; Beamforming; Scheme (mathematics); Shared resource; Spectral efficiency; Resource (disambiguation); Distributed computing; Topology (electrical circuits); Telecommunications; Wireless; Engineering; Mathematics; Electrical engineering; Power (physics)","score_opus":0.02162520577360632,"score_gpt":0.2646392205832716,"score_spread":0.24301401480966528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140739137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031027908,0.0009954908,0.987092,0.0020502177,0.0004012241,0.0001893807,1.2538408e-7,0.00024177186,0.0059269704],"genre_scores_gemma":[0.68956786,0.00022225545,0.30824876,0.00077905343,0.00052513793,0.000019276342,0.0000023270243,0.000015142763,0.0006201946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889666,0.00007802312,0.0002175066,0.00033843637,0.00008685043,0.0003824961],"domain_scores_gemma":[0.99895835,0.00034810902,0.00005398689,0.0004970971,0.000042450785,0.0001000093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080868154,0.00014513235,0.00017001657,0.000048020014,0.00044992083,0.00038233245,0.0005007348,0.00004668866,0.000010085743],"category_scores_gemma":[0.000031027248,0.00012643216,0.000056073353,0.0002876206,0.00004425745,0.00034445952,0.00048328473,0.00017940946,0.000010284249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007397332,0.000009015039,0.000111163296,0.0000059324443,0.000016474842,4.3669897e-7,0.00018843426,0.12847303,0.00004282248,0.7304529,0.0021620663,0.13853034],"study_design_scores_gemma":[0.00025870776,0.000076286924,0.00010205371,0.000045910543,0.0000063429056,0.000013179073,0.0000056531226,0.9651912,0.00006556117,0.0017858869,0.032271415,0.00017780451],"about_ca_topic_score_codex":0.000004230058,"about_ca_topic_score_gemma":0.000057305566,"teacher_disagreement_score":0.83671814,"about_ca_system_score_codex":0.000025512183,"about_ca_system_score_gemma":0.00001470376,"threshold_uncertainty_score":0.51557535},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016019958588718703,"score_gpt":0.2494040336984629,"score_spread":0.23338407510974418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140787501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014763588,0.001604814,0.9773217,0.0045524305,0.00032646742,0.0004946399,0.0000054376856,0.00076679746,0.00016411467],"genre_scores_gemma":[0.95512915,0.00092459325,0.042497158,0.00044186504,0.000035793502,0.00048726905,0.0000059718323,0.000025849953,0.00045232353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853355,0.00007874973,0.00031769244,0.0005210085,0.00014053879,0.0004084363],"domain_scores_gemma":[0.998439,0.00012237184,0.00008677704,0.0010258241,0.0002754398,0.000050588736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018123549,0.00024420442,0.00027551962,0.00035400307,0.00061497645,0.000094019044,0.0010305967,0.00030142,0.000017870398],"category_scores_gemma":[0.000005795547,0.00024168713,0.00014286711,0.0011945112,0.00016831492,0.00022250548,0.000013940898,0.0005224,0.00003957868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008141168,0.0010365498,0.0000273311,0.00002248835,0.00020804562,0.000026222508,0.00021358578,0.1482914,0.037048165,0.14856644,0.002292026,0.6621863],"study_design_scores_gemma":[0.0011961538,0.00029493993,0.000030799703,0.000062968036,0.000021296722,0.00003515592,0.00003489511,0.9080971,0.05444861,0.0011382239,0.034173414,0.00046645637],"about_ca_topic_score_codex":0.0000023879402,"about_ca_topic_score_gemma":0.00012561429,"teacher_disagreement_score":0.9403656,"about_ca_system_score_codex":0.00010043176,"about_ca_system_score_gemma":0.000060783037,"threshold_uncertainty_score":0.98557156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.06747478000990768,"score_gpt":0.3164228902814734,"score_spread":0.24894811027156571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140882775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053957696,0.00071081915,0.9896419,0.0019399613,0.00042969434,0.00045397662,0.0000042180086,0.0003338867,0.0010897481],"genre_scores_gemma":[0.9518855,0.0044081756,0.042465366,0.0006393213,0.000013748071,0.00013304132,0.000008472574,0.000029319177,0.00041706406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975095,0.0005710576,0.00072806235,0.0004572961,0.00023003912,0.0005040678],"domain_scores_gemma":[0.9947088,0.0011588137,0.00015963716,0.0035215574,0.0002828702,0.00016832107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001189063,0.0002847109,0.00031074553,0.00046928247,0.0011743364,0.00016015912,0.0031035275,0.00017425319,0.00002519886],"category_scores_gemma":[0.000023733919,0.0003011615,0.00013305286,0.0020729646,0.00023282279,0.0006334438,0.00006541965,0.0013402597,0.0000677817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014152161,0.004852989,0.0012109936,0.000021667458,0.0002482609,0.000043330354,0.014446041,0.22291373,0.015369698,0.09980557,0.00040296765,0.6405432],"study_design_scores_gemma":[0.0010384215,0.00007029622,0.0020275938,0.00016965829,0.000011346059,0.000012296202,0.0002708199,0.99270064,0.0017789607,0.000023672812,0.0014662702,0.0004300317],"about_ca_topic_score_codex":0.000048857346,"about_ca_topic_score_gemma":0.0037204777,"teacher_disagreement_score":0.9471766,"about_ca_system_score_codex":0.00026580534,"about_ca_system_score_gemma":0.00009944819,"threshold_uncertainty_score":0.99994403},"labels":[],"label_agreement":null},{"id":"W2140887445","doi":"10.1109/jsac.2012.120217","title":"Topology-Aware Modulation and Error-Correction Coding for Cooperative Networks","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":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Telecommunications Advancement Foundation; Division of Electrical, Communications and Cyber Systems; Division of Computer and Network Systems; Southeast University; University of Waterloo","keywords":"Computer science; Computer network; Telecommunications link; Network topology; Linear network coding; Topology (electrical circuits); Relay; Physical layer; Transmitter; Bit error rate; Throughput; Node (physics); Transmission (telecommunications); Channel (broadcasting); Electronic engineering; Wireless; Network packet; Telecommunications","score_opus":0.06914922741026319,"score_gpt":0.33854816698053186,"score_spread":0.26939893957026867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140887445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016491653,0.0013527547,0.975113,0.004650635,0.0011294152,0.0004247861,0.00000203708,0.00010650657,0.0007292575],"genre_scores_gemma":[0.9860648,0.0031266706,0.009947732,0.00042410422,0.000235141,0.00008049389,0.000017426431,0.000014158052,0.00008947403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825317,0.0006806207,0.00042164963,0.00017666678,0.00012398463,0.0003439327],"domain_scores_gemma":[0.997112,0.0011012657,0.00022816574,0.00087165536,0.0005444051,0.00014252159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008712159,0.00016436377,0.00020749203,0.00027323584,0.001111126,0.00018809049,0.0009703754,0.000109081186,0.000007741551],"category_scores_gemma":[0.00022558396,0.00015976638,0.000045988585,0.0009109639,0.000088031324,0.00081645936,0.00019558067,0.0007559256,0.000003553327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025503823,0.0022764427,0.040976346,0.00002259474,0.00031792154,0.0000030503973,0.015710039,0.111532375,0.005052244,0.28580207,0.025188379,0.5128635],"study_design_scores_gemma":[0.0005854554,0.00011987472,0.019940011,0.000105904466,0.000009699846,0.00009729753,0.00013149403,0.9733959,0.00017812246,0.00032749915,0.004894693,0.00021404038],"about_ca_topic_score_codex":0.0000042477445,"about_ca_topic_score_gemma":0.000109577384,"teacher_disagreement_score":0.96957314,"about_ca_system_score_codex":0.00021994169,"about_ca_system_score_gemma":0.00008075556,"threshold_uncertainty_score":0.85459954},"labels":[],"label_agreement":null},{"id":"W2141350371","doi":"10.1109/vetecf.2008.175","title":"Optimized Amplify-and-Forward Relaying for Vehicular Ad-Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise error probability; Rayleigh fading; Relay; Computer science; Fading; Wireless; MIMO; Broadcasting (networking); Cooperative diversity; Channel (broadcasting); Wireless ad hoc network; Computer network; Antenna diversity; Power (physics); Telecommunications","score_opus":0.048422949779950764,"score_gpt":0.2741639114410116,"score_spread":0.22574096166106083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141350371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026768735,0.0040690913,0.98932314,0.0014621464,0.00013676647,0.0002605178,2.7910352e-7,0.00021899916,0.0018521928],"genre_scores_gemma":[0.42785197,0.016625661,0.5510529,0.0022397863,0.00008271803,0.00011630196,0.000008963588,0.000020064164,0.0020015778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990897,0.00007560845,0.0002083598,0.0002828772,0.00010243778,0.00024100565],"domain_scores_gemma":[0.99889094,0.00027904386,0.000054629927,0.00056853186,0.00010680851,0.0001000723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032499214,0.000121045545,0.000177238,0.000050313607,0.0005589535,0.00009089082,0.00058196665,0.00006547976,0.000021441927],"category_scores_gemma":[0.000048254617,0.00010481163,0.0000673384,0.0002285421,0.0000524144,0.00027437782,0.0003833632,0.0001520726,0.000009708303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011179507,0.00014536479,0.00059846096,0.000021256228,0.0001494372,0.000021132722,0.0027900408,0.042668555,0.00042400815,0.36453658,0.034849115,0.55368423],"study_design_scores_gemma":[0.0008250716,0.00005272599,0.0003312665,0.000014293657,0.0000046132,0.00002620484,0.000013731566,0.9153333,0.00006150901,0.00022097985,0.08292819,0.00018817348],"about_ca_topic_score_codex":7.40199e-7,"about_ca_topic_score_gemma":0.000003264783,"teacher_disagreement_score":0.8726647,"about_ca_system_score_codex":0.000022815724,"about_ca_system_score_gemma":0.00003010729,"threshold_uncertainty_score":0.4299075},"labels":[],"label_agreement":null},{"id":"W2141560854","doi":"10.1002/wcm.1150","title":"Antenna subset selection at multi‐antenna relay with adaptive modulation","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Wonkwang University","keywords":"Computer science; Relay; Antenna (radio); Spectral efficiency; Transmission (telecommunications); Link adaptation; Selection (genetic algorithm); Telecommunications; Hop (telecommunications); Computer network; Diversity gain; Antenna diversity; Electronic engineering; Fading; Decoding methods; Artificial intelligence","score_opus":0.06785384826491203,"score_gpt":0.2741186257291299,"score_spread":0.2062647774642179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141560854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20598115,0.001589437,0.79074264,0.00014577326,0.00006600004,0.00042127364,0.0000019820516,0.00029043044,0.00076129497],"genre_scores_gemma":[0.8573485,0.002052197,0.14025302,0.000109562745,0.000015374304,0.00006489208,0.000016554563,0.000018515624,0.0001213547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843454,0.00034877684,0.00036075528,0.00041862522,0.00014748157,0.00028984412],"domain_scores_gemma":[0.9974333,0.00022019417,0.00025013418,0.0016181157,0.00036604644,0.000112179994],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00041335047,0.00021908696,0.0002319395,0.00014693716,0.0013814606,0.00010945339,0.0012961081,0.00007453684,0.000009660632],"category_scores_gemma":[0.000013323759,0.00020026848,0.00004704253,0.00067819795,0.00020612127,0.00045148472,0.0016739786,0.0003211478,0.000012889947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014227665,0.0013569416,0.049940247,0.000044192493,0.00028851652,0.000008645917,0.051265374,0.0019169713,0.0211825,0.14624754,0.00022438384,0.7273824],"study_design_scores_gemma":[0.00046774634,0.00017295836,0.0176767,0.00011054121,0.00001089421,0.000040608542,0.00028029355,0.97948843,0.00018517247,0.000040910785,0.0012534362,0.00027229753],"about_ca_topic_score_codex":0.000053332013,"about_ca_topic_score_gemma":0.00034730588,"teacher_disagreement_score":0.9775715,"about_ca_system_score_codex":0.00010260582,"about_ca_system_score_gemma":0.00004755002,"threshold_uncertainty_score":0.9999186},"labels":[],"label_agreement":null},{"id":"W2141683884","doi":"10.1109/infcomw.2011.5928880","title":"Data rate and throughput analysis of cooperative cognitive radio under a collision model","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cognitive radio; Throughput; Relay; Computer science; Interference (communication); Collision; Single antenna interference cancellation; Network packet; Computer network; Real-time computing; Power (physics); Wireless; Telecommunications; Computer security","score_opus":0.21640142838210588,"score_gpt":0.34257684516391207,"score_spread":0.1261754167818062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141683884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021662965,0.0003790439,0.9693933,0.0001711411,0.000018445695,0.00012850629,0.000029143099,0.00003815986,0.0081792865],"genre_scores_gemma":[0.96830666,0.0011160135,0.029747376,0.00047586593,0.0000034416296,0.000004842823,0.000036387522,0.000003771526,0.0003056478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901766,0.00019047114,0.00021492346,0.00036204918,0.000102402264,0.000112502734],"domain_scores_gemma":[0.9984271,0.00022034338,0.000082935054,0.0009278783,0.00028580343,0.00005594732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042871517,0.00010246157,0.00024141907,0.00014726575,0.0001345831,0.00005371056,0.0008779023,0.00003212417,0.00005570908],"category_scores_gemma":[0.000054034128,0.000081679995,0.000030725732,0.0011744277,0.00011079527,0.0006732391,0.001237749,0.00007877451,0.0000036467575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008411339,0.00041663615,0.0014321844,0.000009075046,0.002228839,0.000004178093,0.017914223,0.014559266,0.0016134487,0.938973,0.0016611307,0.0211039],"study_design_scores_gemma":[0.00026016642,0.000036712423,0.0031955014,0.000013456229,0.00013773101,6.488888e-7,0.00018840733,0.9944652,0.0010671223,0.0004884585,0.000037340593,0.00010926189],"about_ca_topic_score_codex":0.00002003202,"about_ca_topic_score_gemma":0.0002865266,"teacher_disagreement_score":0.9799059,"about_ca_system_score_codex":0.000011380616,"about_ca_system_score_gemma":0.000067999594,"threshold_uncertainty_score":0.33308136},"labels":[],"label_agreement":null},{"id":"W2141778784","doi":"10.1109/icc.2008.165","title":"Antenna/Relay Selection for Coded Wireless Cooperative Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Relay channel; Cooperative diversity; Antenna (radio); Node (physics); Linear network coding; Computer network; Bit error rate; Transmission (telecommunications); Diversity gain; Electronic engineering; Fading; Wireless; Telecommunications; Wireless network; Decoding methods; Engineering; Power (physics)","score_opus":0.04550374856209286,"score_gpt":0.27634525457200415,"score_spread":0.2308415060099113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141778784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010045305,0.0001682814,0.98659366,0.00086381065,0.00020562207,0.00031915342,5.0433323e-7,0.00026931215,0.0015343579],"genre_scores_gemma":[0.9698979,0.00087439944,0.024734406,0.0010557114,0.00009518915,0.00008233079,0.000007071055,0.000009940752,0.0032429988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990581,0.000108396234,0.00020212057,0.000286589,0.0001008199,0.00024392577],"domain_scores_gemma":[0.99893135,0.00018919795,0.000056996767,0.00035118635,0.0003974775,0.00007381546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020323726,0.00012822593,0.00015782569,0.000057701007,0.00070509926,0.0000801765,0.0005728132,0.000058832185,0.0000349304],"category_scores_gemma":[0.00002914959,0.0001111857,0.00005862513,0.00056709704,0.00005763835,0.00037318486,0.00015910085,0.00014512372,0.000017735403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000784636,0.00033390618,0.0030177932,0.000009196173,0.000118867705,0.000005350698,0.0027172635,0.026940098,0.009045825,0.8394356,0.05037647,0.06792116],"study_design_scores_gemma":[0.0004371251,0.00009723596,0.0005253404,0.000009456176,0.0000021607814,0.000027086497,0.000013550148,0.9918623,0.0012307363,0.000029370462,0.0056018443,0.00016378683],"about_ca_topic_score_codex":0.0000050800395,"about_ca_topic_score_gemma":0.00009269789,"teacher_disagreement_score":0.9649222,"about_ca_system_score_codex":0.00004556879,"about_ca_system_score_gemma":0.000070922964,"threshold_uncertainty_score":0.54231244},"labels":[],"label_agreement":null},{"id":"W2141799746","doi":"10.1109/wiopt.2009.5291610","title":"Cognitive networks achieve throughput scaling of a homogeneous network","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer network; Computer science; Cognitive network; Throughput; Wireless ad hoc network; Distributed computing; Mobile ad hoc network; Protocol (science); Cognitive radio; Telecommunications; Network packet; Wireless","score_opus":0.030223935522163667,"score_gpt":0.28570265464204153,"score_spread":0.25547871911987785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141799746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032237854,0.0025529375,0.96753305,0.0007209704,0.00014593889,0.0001610046,3.4451512e-7,0.00015807612,0.025503892],"genre_scores_gemma":[0.96432304,0.0011081315,0.032310266,0.0018948618,0.000138328,0.000004311566,0.000003382201,0.000005357671,0.00021234437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988313,0.00015209946,0.0002946933,0.00026713387,0.00015499123,0.00029979702],"domain_scores_gemma":[0.9988306,0.00024908638,0.0001126738,0.00053262914,0.00019989912,0.00007510265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033435697,0.00013785798,0.00021537869,0.000041907395,0.00020696866,0.00007755866,0.0008056128,0.000059775615,0.00003503048],"category_scores_gemma":[0.000035162786,0.00012318336,0.0000841582,0.00072350574,0.00005089893,0.00022326107,0.00027895812,0.0001766062,0.000012284364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022493678,0.00011448582,0.00025101574,0.0000017242473,0.00003513681,0.0000068595195,0.00056191237,0.030282611,0.0001277743,0.20586175,0.0013069542,0.7614273],"study_design_scores_gemma":[0.0005568638,0.00030869935,0.004864365,0.00015997623,0.000015165146,0.00002615073,0.00004151924,0.9854655,0.00066055177,0.0059538987,0.0015888263,0.0003584565],"about_ca_topic_score_codex":0.000002476958,"about_ca_topic_score_gemma":0.0000120099885,"teacher_disagreement_score":0.9610992,"about_ca_system_score_codex":0.00001746949,"about_ca_system_score_gemma":0.00003735325,"threshold_uncertainty_score":0.5023272},"labels":[],"label_agreement":null},{"id":"W2141852597","doi":"10.1109/cwit.2007.375708","title":"Throughput Performance of Generation-Based Network Coding","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Computer science; Throughput; Decoding methods; Multicast; Computer network; Network packet; Network topology; Scalability; Coding (social sciences); Maximum throughput scheduling; Distributed computing; Algorithm; Wireless; Telecommunications; Quality of service; Mathematics; Dynamic priority scheduling","score_opus":0.05714584415339539,"score_gpt":0.28755123914321684,"score_spread":0.23040539498982146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141852597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038015693,0.00020874475,0.9359498,0.00032721527,0.00020244808,0.00007128114,7.806258e-8,0.00008017131,0.025144562],"genre_scores_gemma":[0.8960847,0.00012070625,0.10263993,0.0007182258,0.000114341485,0.0000020997704,0.0000019836286,0.0000033436345,0.00031463662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999264,0.000037748738,0.00023631954,0.00014205917,0.00013852092,0.00018135713],"domain_scores_gemma":[0.999121,0.0001371405,0.00007369925,0.0004924504,0.0001358417,0.00003988663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007176743,0.000070572256,0.00009498838,0.00004344255,0.00018382588,0.00003674019,0.0005404909,0.000027335984,0.000052605854],"category_scores_gemma":[0.000016095519,0.00006290885,0.000032055887,0.00048382598,0.000031684085,0.00021475181,0.000128235,0.00007384052,0.000012758313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011533579,0.00008435839,0.01639995,0.000016473066,0.000018681014,0.0000016249762,0.0003646327,0.03821345,0.011859825,0.5355153,0.0072822426,0.39023194],"study_design_scores_gemma":[0.00016708653,0.000048226488,0.004376157,0.00001989136,0.0000013633389,9.429702e-7,0.000003807528,0.9634903,0.025739878,0.000026204898,0.0060246983,0.00010144963],"about_ca_topic_score_codex":0.0000013977822,"about_ca_topic_score_gemma":0.00003943302,"teacher_disagreement_score":0.9252768,"about_ca_system_score_codex":0.000022633863,"about_ca_system_score_gemma":0.000046763904,"threshold_uncertainty_score":0.25653484},"labels":[],"label_agreement":null},{"id":"W2141948165","doi":"10.1109/vetecs.2011.5956651","title":"A Resource Block Assignment Scheme for OFDMA-Based Cellular Networks with Self-Organizing Terminal Relays","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Relay; Scheme (mathematics); Computer network; Terminal (telecommunication); Block (permutation group theory); Wireless; Resource allocation; Resource management (computing); Distributed computing; Telecommunications; Mathematics; Power (physics)","score_opus":0.038995386531425036,"score_gpt":0.22560235025061176,"score_spread":0.18660696371918672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141948165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046243123,0.00025815875,0.98785895,0.00069314294,0.000053101154,0.00047971355,3.707162e-7,0.00035683063,0.005675447],"genre_scores_gemma":[0.6420012,0.000022315953,0.3563604,0.0008716036,0.000056061905,0.00012154059,0.000002707049,0.000018989493,0.00054517546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881065,0.00009675809,0.00022576295,0.0003712229,0.00017199128,0.00032359303],"domain_scores_gemma":[0.9986857,0.00012439216,0.00010929781,0.0008240397,0.00013641703,0.00012015976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037666797,0.00017655482,0.0001617812,0.00006664471,0.0003407959,0.00010952982,0.00097328087,0.00006212004,0.000058827398],"category_scores_gemma":[0.000010923416,0.00014075729,0.000053611526,0.00038162168,0.00003476625,0.00017002613,0.0002736183,0.00017402931,0.000008762565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010432792,0.006149901,0.034570094,0.00035546144,0.0012797468,0.00031147437,0.029406993,0.02627676,0.047667656,0.5594891,0.06506619,0.22838339],"study_design_scores_gemma":[0.0009789616,0.0003309395,0.00029793533,0.00009107721,0.000022750139,0.000009629032,0.00005774608,0.94424075,0.017569521,0.000036694153,0.035989426,0.00037459],"about_ca_topic_score_codex":0.0000031029779,"about_ca_topic_score_gemma":0.0000100851985,"teacher_disagreement_score":0.917964,"about_ca_system_score_codex":0.00005929193,"about_ca_system_score_gemma":0.00007936143,"threshold_uncertainty_score":0.5739916},"labels":[],"label_agreement":null},{"id":"W2142122604","doi":"10.1109/ciss.2006.286386","title":"Joint Optimization of Relay Strategies and Resource Allocations in Cooperative Cellular Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer network; Computer science; Wireless network; Relay channel; Bandwidth (computing); Node (physics); Wireless; Resource allocation; Physical layer; Engineering; Telecommunications; Power (physics)","score_opus":0.021866217598585508,"score_gpt":0.23328290250791592,"score_spread":0.2114166849093304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142122604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00610361,0.0008451368,0.9799488,0.0008413419,0.00001880181,0.00012857189,1.7195501e-7,0.000044036904,0.01206953],"genre_scores_gemma":[0.9634409,0.00027855174,0.035872128,0.00007802777,0.000014177904,0.000010123191,0.000009581618,0.0000040117798,0.00029247924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992354,0.00014643677,0.0002652963,0.00017035322,0.00007626239,0.00010623355],"domain_scores_gemma":[0.9994056,0.00007786641,0.000066273424,0.00031495775,0.00011258381,0.000022669788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002450822,0.000078058285,0.00011582769,0.00009148599,0.0000966345,0.00012938133,0.00023211911,0.00003904382,0.000018082243],"category_scores_gemma":[0.000013881898,0.000071570255,0.000015064602,0.00050034915,0.00006305939,0.0004334407,0.0001628305,0.000099424295,7.7822824e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.185313e-7,0.00002531875,0.000095480194,0.0000013976357,0.000001719185,4.0261344e-7,0.0001944585,0.7306596,0.00042217437,0.26762858,0.0002156338,0.0007542908],"study_design_scores_gemma":[0.00018616019,0.000024960105,0.0014484661,0.000023113562,0.0000014123406,0.0000010845611,0.00019483405,0.99671966,0.0007057852,0.0001911689,0.00041825045,0.000085115484],"about_ca_topic_score_codex":0.00005174915,"about_ca_topic_score_gemma":0.00027106964,"teacher_disagreement_score":0.9573373,"about_ca_system_score_codex":0.000019324678,"about_ca_system_score_gemma":0.000044732966,"threshold_uncertainty_score":0.29185504},"labels":[],"label_agreement":null},{"id":"W2142264809","doi":"10.1109/icc.2009.5199558","title":"Using Limited Feedback in Power Allocation Design for a Two-Hop Relay OFDM System","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"","keywords":"Codebook; Relay; Subcarrier; Computer science; Hop (telecommunications); Orthogonal frequency-division multiplexing; Path loss; Relay channel; Telecommunications link; Mathematical optimization; Path (computing); Power (physics); Channel (broadcasting); Control theory (sociology); Algorithm; Mathematics; Telecommunications; Computer network; Wireless","score_opus":0.10690144538659546,"score_gpt":0.32171951990282643,"score_spread":0.21481807451623097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142264809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005989416,0.00019467382,0.9891237,0.0015898183,0.00009877063,0.00044804643,1.4026266e-7,0.00015794355,0.0023975114],"genre_scores_gemma":[0.7384735,0.000014294681,0.26084882,0.0004890707,0.000014612636,0.000012392894,0.0000011877485,0.0000042384822,0.000141923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990191,0.00018261201,0.0002597775,0.00024006456,0.00010473515,0.00019373588],"domain_scores_gemma":[0.9990252,0.00016604259,0.00006998455,0.0005293336,0.00016230905,0.00004707569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005999971,0.0001025846,0.00013175422,0.00013168502,0.00013313389,0.00012859546,0.0005503944,0.00004157474,0.000005923523],"category_scores_gemma":[0.000046454952,0.000094343966,0.00003697577,0.0006133525,0.000010404381,0.00034463248,0.000076837336,0.00008175043,0.000012487164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007503089,0.00026834488,0.00013134339,0.000020811034,0.000023178185,0.000005422394,0.0034654867,0.07014851,0.047507547,0.7942173,0.0030761422,0.081060894],"study_design_scores_gemma":[0.0005706836,0.000075250806,0.0003996285,0.00008467389,0.0000023220662,0.0000065059735,0.000067934525,0.99582124,0.0020641417,0.00017047078,0.0005989966,0.00013817326],"about_ca_topic_score_codex":0.0000049210976,"about_ca_topic_score_gemma":0.000016292697,"teacher_disagreement_score":0.9256727,"about_ca_system_score_codex":0.00015552925,"about_ca_system_score_gemma":0.000060845367,"threshold_uncertainty_score":0.3847235},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03759268491733248,"score_gpt":0.29302784390485803,"score_spread":0.25543515898752556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142383973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072528846,0.00041861858,0.9816795,0.00811523,0.0002731052,0.0004591276,0.0000033643234,0.00039703006,0.0014011519],"genre_scores_gemma":[0.97380584,0.005093584,0.018916687,0.0013323907,0.000012589274,0.00015736629,0.000011600291,0.000023075054,0.00064683973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976297,0.000596206,0.0006266037,0.00047468746,0.0002559694,0.0004168575],"domain_scores_gemma":[0.99484664,0.0003827807,0.00016039285,0.004226428,0.00023339453,0.00015036887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051097263,0.00029460428,0.0003007982,0.00040523964,0.0008072726,0.00019975306,0.0034844987,0.00018485887,0.000034493354],"category_scores_gemma":[0.000008684236,0.00032087305,0.00013981453,0.0016987666,0.00014326145,0.00077324983,0.000034396442,0.0010248858,0.00007862987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051719606,0.0046522017,0.00020161753,0.0000078746225,0.00008539926,0.0000073527685,0.004286262,0.12531298,0.006296297,0.2635931,0.00067272334,0.5948325],"study_design_scores_gemma":[0.0012226413,0.0001424153,0.0044721365,0.00017755508,0.000012546399,0.000011831477,0.00009354028,0.9870802,0.0019159475,0.00014104407,0.0041521625,0.00057798316],"about_ca_topic_score_codex":0.000019613226,"about_ca_topic_score_gemma":0.00061432435,"teacher_disagreement_score":0.966553,"about_ca_system_score_codex":0.00022939596,"about_ca_system_score_gemma":0.00010388312,"threshold_uncertainty_score":0.99992436},"labels":[],"label_agreement":null},{"id":"W2142402258","doi":"10.1109/lcomm.2013.090213.131493","title":"Opportunistic Cooperative Communication in the Presence of Co-Channel Interferences and Outdated Channel Information","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Channel state information; Computer science; Channel (broadcasting); Interference (communication); Co-channel interference; Cooperative diversity; Signal-to-noise ratio (imaging); Energy (signal processing); Coding (social sciences); Fading; Diversity scheme; Telecommunications; Probability of error; Maximal-ratio combining; Topology (electrical circuits); Algorithm; Mathematics; Wireless; Statistics","score_opus":0.0674425059535089,"score_gpt":0.29579081058897616,"score_spread":0.22834830463546726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142402258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17153502,0.0028093152,0.5945027,0.21458508,0.00032946674,0.004016912,0.000047831894,0.00031524533,0.011858443],"genre_scores_gemma":[0.99082196,0.0030357712,0.002969116,0.0027873958,0.0000058027586,0.00028804096,0.000073576666,0.00000478482,0.000013543571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790233,0.0010250715,0.0005471169,0.00014881074,0.0001944795,0.00018218499],"domain_scores_gemma":[0.9956356,0.00096305774,0.00027679754,0.0027687058,0.00030593728,0.00004987779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080107717,0.00015285771,0.00019078731,0.00022275862,0.00040733506,0.00031609423,0.004207048,0.00004907221,0.000010145111],"category_scores_gemma":[0.00016196963,0.00012271143,0.0000316287,0.0006568188,0.0004971954,0.0019075561,0.00066273747,0.00037236832,0.000029944757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005119023,0.0013797203,0.0027890059,0.00020630198,0.0002802132,0.0000028822735,0.31430563,0.0049742577,0.02909471,0.41147685,0.08236666,0.15307255],"study_design_scores_gemma":[0.0015912427,0.00023508935,0.025089014,0.00064547244,0.000030471727,0.00004121602,0.009446643,0.94715995,0.0016302221,0.0037702394,0.009416442,0.0009439803],"about_ca_topic_score_codex":0.00018946259,"about_ca_topic_score_gemma":0.00015167383,"teacher_disagreement_score":0.9421857,"about_ca_system_score_codex":0.000034505883,"about_ca_system_score_gemma":0.00004859778,"threshold_uncertainty_score":0.7817812},"labels":[],"label_agreement":null},{"id":"W2142445231","doi":"10.1109/twc.2010.080210.091343","title":"Transparent Amplify-and-Forward Relaying in MIMO Relay Channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Pairwise error probability; Computer science; MIMO; Relay channel; Transmission (telecommunications); Channel state information; Cooperative diversity; Throughput; Channel (broadcasting); Efficient energy use; Computer network; Wireless; Topology (electrical circuits); Telecommunications; Fading; Engineering; Electrical engineering","score_opus":0.06096970934698296,"score_gpt":0.3054919986718748,"score_spread":0.24452228932489187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142445231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046401974,0.00034118636,0.94036806,0.0097677,0.00063705514,0.0004183026,0.0000099843855,0.000309094,0.0017466485],"genre_scores_gemma":[0.97599775,0.006089983,0.017084181,0.00035937698,0.00001588153,0.0002640317,0.0000061704836,0.000022476259,0.00016015177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982817,0.0003214164,0.00048125052,0.0003949805,0.00020256553,0.00031807952],"domain_scores_gemma":[0.99591446,0.00060124754,0.00009831175,0.0031217409,0.00010469992,0.00015953805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005253887,0.00022651412,0.00025911693,0.00035440832,0.0008764381,0.00019684715,0.0023894082,0.00015939274,0.000033477656],"category_scores_gemma":[0.000011284762,0.00023978806,0.000090110974,0.00086709094,0.00022673032,0.00066700514,0.00003940415,0.0015519963,0.00004654714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035888672,0.0016978483,0.00040156796,0.00003447075,0.00010657284,0.000005973606,0.012263692,0.014664363,0.026664238,0.25476798,0.00018882737,0.6891686],"study_design_scores_gemma":[0.0025461968,0.00020789668,0.0032136685,0.00038375708,0.000054829197,0.000079517085,0.00040435916,0.9406978,0.0124535905,0.0014814581,0.037018623,0.0014583151],"about_ca_topic_score_codex":0.000054904118,"about_ca_topic_score_gemma":0.0021441537,"teacher_disagreement_score":0.92959577,"about_ca_system_score_codex":0.000061168306,"about_ca_system_score_gemma":0.00007647234,"threshold_uncertainty_score":0.9778273},"labels":[],"label_agreement":null},{"id":"W2142476080","doi":"10.1109/t-wc.2008.070737","title":"On the Ergodic Capacity of Wireless Relaying Systems over Rayleigh Fading Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ergodic theory; Rayleigh fading; Relay; Fading; Wireless; Computer science; Topology (electrical circuits); Control theory (sociology); Signal-to-noise ratio (imaging); Mathematics; Electronic engineering; Telecommunications; Decoding methods; Power (physics); Engineering; Physics; Mathematical analysis","score_opus":0.08454225381014073,"score_gpt":0.2747015057360368,"score_spread":0.19015925192589606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142476080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25558275,0.00029791772,0.7392559,0.0020153075,0.0005481965,0.00048604814,0.000015584652,0.00022841567,0.0015698675],"genre_scores_gemma":[0.9941711,0.0038992958,0.0010412564,0.00030936187,0.000021851924,0.00025911548,0.0000033088468,0.000027341399,0.0002673577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973478,0.00093865226,0.0006035205,0.00035411312,0.00043506455,0.0003208489],"domain_scores_gemma":[0.9926381,0.0021256648,0.00028491495,0.0045614084,0.0002788325,0.000111095906],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005988399,0.00027100285,0.00035237017,0.00028275955,0.0024740293,0.00011000037,0.0037790907,0.0001225075,0.000029458146],"category_scores_gemma":[0.000020965987,0.00022677076,0.0001984024,0.001223807,0.0004893615,0.00040587832,0.000057026144,0.00091212767,0.000049139293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047475733,0.0017826259,0.000113019145,0.000055765395,0.00033756855,0.000005027199,0.015422622,0.102739766,0.01742298,0.8396194,0.0015004668,0.020953255],"study_design_scores_gemma":[0.0009228844,0.00020186562,0.0004539133,0.0006822109,0.000042940603,0.00006562077,0.0003104589,0.97305673,0.020857006,0.00054135884,0.0021691648,0.00069585384],"about_ca_topic_score_codex":0.000092898386,"about_ca_topic_score_gemma":0.000066817185,"teacher_disagreement_score":0.870317,"about_ca_system_score_codex":0.0001616906,"about_ca_system_score_gemma":0.00011192888,"threshold_uncertainty_score":0.9988246},"labels":[],"label_agreement":null},{"id":"W2142599107","doi":"10.1109/isit.2009.5205607","title":"A new achievable rate for the Gaussian parallel relay channel","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Bandwidth (computing); Gaussian; Channel (broadcasting); Computer science; Topology (electrical circuits); Algorithm; Scheme (mathematics); Mathematics; Computer network; Physics; Combinatorics; Mathematical analysis","score_opus":0.04859089152894651,"score_gpt":0.2912164462725273,"score_spread":0.24262555474358077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142599107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025699226,0.0006998902,0.9228218,0.062315952,0.00008782486,0.00023091983,8.2415376e-8,0.00011217891,0.013705657],"genre_scores_gemma":[0.64140373,0.0018925765,0.26349488,0.020831848,0.0003041144,0.00005966661,0.0000033650326,0.00001184864,0.07199796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940544,0.000054123117,0.0001194328,0.00016802271,0.00006559705,0.0001874076],"domain_scores_gemma":[0.99897766,0.00019235627,0.000035684116,0.0006837287,0.000043722765,0.00006685529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034435806,0.000080778744,0.00007820025,0.000025304407,0.0003627939,0.0001807775,0.0010767124,0.000023886725,0.000038221177],"category_scores_gemma":[0.000030731087,0.000049170656,0.00005171898,0.00024996224,0.000010117574,0.00022110804,0.00012047068,0.00008864594,0.000039957707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010044778,0.000021209056,0.0000029637274,7.0917577e-7,0.000009532036,3.6995363e-7,0.0006898182,0.0015369749,0.00015616932,0.70445514,0.102282755,0.19083434],"study_design_scores_gemma":[0.00060936884,0.00014090171,0.0016527745,0.000013264391,0.000005001552,0.0000038934036,0.000029024595,0.693203,0.00030229797,0.012420856,0.29144174,0.00017791934],"about_ca_topic_score_codex":0.0000049860423,"about_ca_topic_score_gemma":0.00003189351,"teacher_disagreement_score":0.69203424,"about_ca_system_score_codex":0.000013064366,"about_ca_system_score_gemma":0.000051223324,"threshold_uncertainty_score":0.2790354},"labels":[],"label_agreement":null},{"id":"W2143380810","doi":"10.1109/cwit.2011.5872156","title":"Resource allocation to achieve cross-layer metrics in cooperative networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Resource allocation; Queue; Mathematical optimization; Relay; Scheme (mathematics); Maximization; Resource management (computing); Selection (genetic algorithm); Power (physics); Computer network; Distributed computing; Mathematics","score_opus":0.09044967283199111,"score_gpt":0.31496721833786745,"score_spread":0.22451754550587633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143380810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010217331,0.00016123276,0.9402307,0.0008816732,0.00011318533,0.00026215988,2.1293985e-7,0.0001254866,0.04800796],"genre_scores_gemma":[0.972532,0.00012243194,0.023141572,0.002660687,0.000031124022,0.00003807093,0.0000026918763,0.000008423141,0.0014630005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987499,0.00021375464,0.0002833904,0.00034279595,0.00015076062,0.00025941143],"domain_scores_gemma":[0.9987246,0.00014053956,0.00004825932,0.00075566024,0.00021272474,0.00011825385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065580476,0.00013025427,0.00014005454,0.00024165507,0.00015852173,0.00017169473,0.0011588495,0.000063432286,0.00010130768],"category_scores_gemma":[0.000119038814,0.00011719586,0.000029696273,0.0022072417,0.00003283808,0.00043403514,0.0006303638,0.00021463244,0.0000963747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009118206,0.00029200313,0.00830625,0.0000029852458,0.000023394292,0.000008835722,0.009031694,0.026077714,0.0003714418,0.80600256,0.0056133447,0.14417857],"study_design_scores_gemma":[0.00068867055,0.00033128404,0.05902428,0.000039122435,0.0000031609327,0.000005332433,0.00015043095,0.9105059,0.0027183602,0.00034062876,0.025633603,0.0005592202],"about_ca_topic_score_codex":0.000029115763,"about_ca_topic_score_gemma":0.00028378845,"teacher_disagreement_score":0.96231467,"about_ca_system_score_codex":0.00007715235,"about_ca_system_score_gemma":0.000039035145,"threshold_uncertainty_score":0.47791085},"labels":[],"label_agreement":null},{"id":"W2143480613","doi":"10.1109/tmc.2006.17","title":"Cellular CDMA capacity with out-of-band multihop relaying","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer network; Computer science; Telecommunications link; Base station; Wireless ad hoc network; Soft handover; Relay; Near-far problem; Code division multiple access; Cellular network; Wireless; Telecommunications","score_opus":0.029343390558348233,"score_gpt":0.24747544139963834,"score_spread":0.21813205084129011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143480613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23397598,0.00009842995,0.7642515,0.000047862755,0.0003410809,0.00020397588,0.000001512142,0.00016889634,0.0009108164],"genre_scores_gemma":[0.9715037,0.000025342057,0.028220724,0.000051322702,0.000047306694,0.000017845132,0.0000011031331,0.000015517417,0.00011715481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986356,0.00015238632,0.00035461172,0.0003579403,0.0002369285,0.00026251917],"domain_scores_gemma":[0.99866045,0.00027207902,0.00014958327,0.0006932136,0.00016501392,0.000059650905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875702,0.00018591153,0.0002228741,0.00014304621,0.0005101557,0.000086501874,0.0005747829,0.000060011276,0.0000142161725],"category_scores_gemma":[0.0000025950617,0.00017141597,0.00009218432,0.0005034036,0.00009087373,0.00021845147,0.000007670686,0.00034437855,0.000017145438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020631285,0.0004804566,0.00024885358,0.000034256147,0.000049774826,0.000009193216,0.0022294316,0.79239833,0.047538776,0.0016372865,0.00008494735,0.15526804],"study_design_scores_gemma":[0.0010416413,0.0002941497,0.00033219476,0.00024986145,0.000023292527,0.000011904714,0.00009391833,0.72741705,0.26845506,0.00007366654,0.0015328609,0.0004744061],"about_ca_topic_score_codex":0.00003596625,"about_ca_topic_score_gemma":0.00007817963,"teacher_disagreement_score":0.7375277,"about_ca_system_score_codex":0.00006348785,"about_ca_system_score_gemma":0.000041629904,"threshold_uncertainty_score":0.69901407},"labels":[],"label_agreement":null},{"id":"W2143564208","doi":"10.1109/euc.2010.82","title":"Trust Management in Wireless Mobile Networks with Cooperative Communications","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Carleton University","funders":"","keywords":"Computer network; Computer science; Wireless; Relay; Wireless network; Node (physics); Channel (broadcasting); Computer security; Telecommunications; Engineering","score_opus":0.020926576559733834,"score_gpt":0.27772211518340334,"score_spread":0.2567955386236695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143564208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04146571,0.00024445986,0.82443976,0.00230775,0.00021682867,0.00093903637,5.902282e-7,0.00029755174,0.13008831],"genre_scores_gemma":[0.948485,0.0009847454,0.04881065,0.00048479452,0.000016075152,0.00024894282,0.0000060654756,0.000007742587,0.00095596095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999131,0.00011509889,0.00019266322,0.00024511106,0.000111085865,0.00020500373],"domain_scores_gemma":[0.9976905,0.00010378325,0.000044859025,0.0019875297,0.00010801243,0.00006531721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000275515,0.00012189511,0.00012730931,0.0000960531,0.00024580554,0.00016789258,0.0020942504,0.000041479812,0.000072154944],"category_scores_gemma":[0.0000033265585,0.00009676706,0.000019557658,0.00082008657,0.0001263912,0.0003249057,0.00094971014,0.0004261311,0.000024983005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058308456,0.00019666245,0.0022518858,0.0000021444973,0.000022757691,0.0000053846475,0.0005581619,0.002498088,0.00015661589,0.84598726,0.00045092835,0.14786427],"study_design_scores_gemma":[0.0006881088,0.000070543465,0.0055344007,0.000027005926,0.0000038577173,0.000008740433,0.00018933478,0.96578586,0.00017409543,0.000103290164,0.027137183,0.00027758445],"about_ca_topic_score_codex":0.000010050332,"about_ca_topic_score_gemma":0.001960242,"teacher_disagreement_score":0.9632878,"about_ca_system_score_codex":0.000025328825,"about_ca_system_score_gemma":0.000027885935,"threshold_uncertainty_score":0.3946046},"labels":[],"label_agreement":null},{"id":"W2143667636","doi":"10.1109/primeasia.2009.5397449","title":"Cooperative schemes for two-way relaying protocol","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Telecommunications link; Computer science; Maximization; Channel (broadcasting); Cumulative distribution function; Transmitter power output; Computer network; Constraint (computer-aided design); Relay channel; Electronic engineering; Power (physics); Topology (electrical circuits); Mathematical optimization; Mathematics; Engineering; Probability density function; Electrical engineering; Statistics; Transmitter","score_opus":0.057010755270866915,"score_gpt":0.35874367523286554,"score_spread":0.30173291996199864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143667636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000960644,0.000023841887,0.9409139,0.0037405135,0.000038275546,0.024500787,2.5632224e-7,0.00023499178,0.030451354],"genre_scores_gemma":[0.47635195,0.0000133984095,0.43734342,0.0074206274,0.00016136027,0.072589844,0.0000040967084,0.0000135128785,0.0061017824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992276,0.000064148095,0.0001827536,0.0002409227,0.00009577438,0.00018884684],"domain_scores_gemma":[0.99905753,0.00010558473,0.000047242982,0.00050946337,0.00022233378,0.000057858244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026823513,0.000105139836,0.000112303496,0.000047830832,0.00033248658,0.00019337928,0.0007041391,0.000025215213,0.000044833156],"category_scores_gemma":[0.00007050798,0.00008425883,0.000045617733,0.00030666642,0.000019300322,0.00043862843,0.00013296766,0.00009684842,0.000027349623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007975276,0.00004711199,0.000014994795,0.000002136119,0.0000048229995,4.1006055e-7,0.00026850318,0.00005414032,0.0031054916,0.74578285,0.0041209306,0.24659064],"study_design_scores_gemma":[0.0025113437,0.0004953336,0.0002728587,0.000053961692,0.0000034798877,0.000006923537,0.00004091753,0.37117156,0.038494054,0.0043516606,0.5821372,0.00046065194],"about_ca_topic_score_codex":4.8193453e-7,"about_ca_topic_score_gemma":0.0000053049243,"teacher_disagreement_score":0.7414312,"about_ca_system_score_codex":0.000029097851,"about_ca_system_score_gemma":0.000049162285,"threshold_uncertainty_score":0.34359753},"labels":[],"label_agreement":null},{"id":"W2143849964","doi":"10.1109/twc.2013.13.120151","title":"Optimal-Switching Adaptive Modulation for Multiuser Relay Networks with Feedback Delays","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; Nakagami distribution; Computer science; Link adaptation; Spectral efficiency; Fading; Quadrature amplitude modulation; Bit error rate; Control theory (sociology); Topology (electrical circuits); Cumulative distribution function; Upper and lower bounds; QAM; Channel state information; Mathematics; Channel (broadcasting); Probability density function; Telecommunications; Power (physics); Wireless; Statistics; Physics","score_opus":0.04124335255221889,"score_gpt":0.2687711435659568,"score_spread":0.22752779101373793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143849964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009610589,0.00017075166,0.98503065,0.0030018005,0.0001580983,0.0012408664,0.0000069984117,0.00037866356,0.0004015527],"genre_scores_gemma":[0.7565815,0.0007156493,0.24097729,0.00030640565,0.000020022808,0.0011299711,0.000012648443,0.000034812154,0.00022172678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819875,0.00030448832,0.00044865673,0.00044623876,0.00021893086,0.00038293615],"domain_scores_gemma":[0.99497885,0.0008778553,0.00020153199,0.0031802896,0.0006034274,0.00015802775],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00028351584,0.00029405762,0.00026775379,0.0002093539,0.0016625923,0.00031407824,0.002310652,0.00013312553,0.000030230194],"category_scores_gemma":[0.000006640117,0.00027346524,0.00013799139,0.0008022991,0.00013281098,0.0011681763,0.000039974053,0.0006364334,0.000064185115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003226438,0.0003565005,0.000018214529,0.000004909586,0.00010536262,2.2279605e-7,0.0011950925,0.7806692,0.0006871123,0.011484245,0.00023594733,0.20521092],"study_design_scores_gemma":[0.000763446,0.0001695668,0.00042941538,0.00009614675,0.000025043186,0.000007039203,0.00013437669,0.9967408,0.0005596594,0.0000919806,0.00063232967,0.00035019027],"about_ca_topic_score_codex":0.00006196077,"about_ca_topic_score_gemma":0.00048148594,"teacher_disagreement_score":0.7469709,"about_ca_system_score_codex":0.00015331952,"about_ca_system_score_gemma":0.00008345584,"threshold_uncertainty_score":0.99997175},"labels":[],"label_agreement":null},{"id":"W2143994701","doi":"10.1109/icc.2008.623","title":"Improved OFDMA uplink Frequency offset Estimation via Cooperative Relaying: AF or DcF?","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Telecommunications link; Computer network; Node (physics); Cooperative diversity; Fading; Transmission (telecommunications); Offset (computer science); Diversity gain; Orthogonal frequency-division multiplexing; Carrier frequency offset; Transmitter power output; Frequency offset; Electronic engineering; Interference (communication); Channel (broadcasting); Transmitter; Telecommunications; Power (physics); Engineering","score_opus":0.05498614870717492,"score_gpt":0.2901034045039874,"score_spread":0.2351172557968125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143994701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077316556,0.0003260984,0.98188543,0.0033876284,0.00022990201,0.00031275852,0.0000012174563,0.00037349685,0.0057518086],"genre_scores_gemma":[0.8432723,0.0008162041,0.15106317,0.00117599,0.000046172645,0.00006782887,0.000011610329,0.000012074287,0.003534639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986644,0.00015008157,0.0003674312,0.00038551103,0.00017846633,0.00025413418],"domain_scores_gemma":[0.99839044,0.00018221859,0.0001164593,0.00083880476,0.00035562806,0.00011646444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024560778,0.00019102583,0.00020505555,0.00010250047,0.0006850355,0.00011577613,0.0009510727,0.00008013731,0.00040819123],"category_scores_gemma":[0.00017569886,0.00014535495,0.00005541957,0.0007350548,0.00009089039,0.0008628648,0.00035757406,0.00024556162,0.00013895956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009845986,0.0007839851,0.0027467932,0.00003826544,0.00019451423,0.00008563518,0.013491697,0.003093478,0.060131084,0.3232217,0.032550927,0.56356347],"study_design_scores_gemma":[0.00038827784,0.00013044885,0.0008140856,0.000028811215,0.000004370814,0.00004802015,0.000016649858,0.99325025,0.003747288,0.00032330016,0.0009828607,0.000265663],"about_ca_topic_score_codex":0.000022535622,"about_ca_topic_score_gemma":0.00008620972,"teacher_disagreement_score":0.99015677,"about_ca_system_score_codex":0.00007736525,"about_ca_system_score_gemma":0.0001958898,"threshold_uncertainty_score":0.5927403},"labels":[],"label_agreement":null},{"id":"W2144001349","doi":"10.1109/icc.2006.255752","title":"On the Optimal Phase Control in MIMO Systems with Phase Quantization","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MIMO; Quantization (signal processing); Phase control; Wireless; Phase (matter); Computer science; Constant (computer programming); Optimal control; Control theory (sociology); Mathematics; Mathematical optimization; Topology (electrical circuits); Control (management); Algorithm; Telecommunications; Physics; Combinatorics; Antenna (radio)","score_opus":0.10809659300969633,"score_gpt":0.3638260656193581,"score_spread":0.2557294726096618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144001349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03011751,0.0002883057,0.85441476,0.042890914,0.0004714815,0.0010110578,0.0001016993,0.0002087197,0.07049555],"genre_scores_gemma":[0.99632424,0.00029922696,0.0016338218,0.00083381985,0.000052243493,0.0002547309,0.000103157596,0.000012346304,0.00048643243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981727,0.00049072865,0.00043949785,0.0002940233,0.0003955453,0.00020748227],"domain_scores_gemma":[0.9965951,0.0007042496,0.00023381787,0.0019288986,0.00049185136,0.000046077752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493353,0.00019477279,0.00017653577,0.00024056766,0.00038271231,0.00046032693,0.0033972254,0.00005413516,0.000074698175],"category_scores_gemma":[0.000056944948,0.00014558305,0.000046858673,0.0004883798,0.00016658567,0.00034939678,0.00015592482,0.00040808658,0.000089960595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058760004,0.0009946184,0.000071617294,0.000001127035,0.000021678627,0.0000022837344,0.00012995588,0.00992306,0.000865903,0.98287123,0.002517655,0.0025421092],"study_design_scores_gemma":[0.0028700116,0.00023269709,0.00017410988,0.00015224596,0.0000056758054,0.0000069698904,0.00006944944,0.9851705,0.00016482097,0.0012140496,0.009736645,0.0002028451],"about_ca_topic_score_codex":0.00011680082,"about_ca_topic_score_gemma":0.00045796885,"teacher_disagreement_score":0.9816572,"about_ca_system_score_codex":0.00013644941,"about_ca_system_score_gemma":0.00013230483,"threshold_uncertainty_score":0.63129467},"labels":[],"label_agreement":null},{"id":"W2144168874","doi":"10.1109/glocom.2008.ecp.111","title":"Rate-Adaptive Coding-Aware Multiple Path Routing for Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Linear network coding; Computer science; Wireless mesh network; Computer network; Network packet; Coding (social sciences); Distributed computing; Network performance; Routing protocol; Order One Network Protocol; Dynamic Source Routing; Wireless network; Wireless; Telecommunications","score_opus":0.06435580999304585,"score_gpt":0.26954934526357843,"score_spread":0.20519353527053258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144168874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046720253,0.000052874042,0.9925113,0.0004351855,0.0002885842,0.00036154332,0.0000016345327,0.00030572852,0.0013711342],"genre_scores_gemma":[0.98070425,0.00049699075,0.016949564,0.000772819,0.00011854965,0.00006900293,0.0000091209995,0.000014284921,0.0008654393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987153,0.00014976294,0.00027252908,0.0003744791,0.00012387095,0.0003641003],"domain_scores_gemma":[0.9982138,0.0006782418,0.000105656494,0.0006147656,0.00028357503,0.000103928694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043318054,0.00017268569,0.00021369076,0.000049632625,0.0008318825,0.00009971507,0.0009334556,0.000076846554,0.000018127974],"category_scores_gemma":[0.000068762485,0.00015532107,0.00009445616,0.00038403235,0.000059781814,0.0003746729,0.0004445518,0.00019717192,0.000013154122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048025242,0.00014255471,0.003864693,0.0000065807426,0.000060942086,0.000014784493,0.0027197183,0.0017626901,0.0005678185,0.9002184,0.018649304,0.07194445],"study_design_scores_gemma":[0.00055781426,0.00006309149,0.0011602207,0.000029759787,0.0000026166658,0.000008267283,0.00007099404,0.9961838,0.00053446443,0.000077756136,0.0010845788,0.00022662402],"about_ca_topic_score_codex":0.0000110769215,"about_ca_topic_score_gemma":0.00006750121,"teacher_disagreement_score":0.9944211,"about_ca_system_score_codex":0.0000577308,"about_ca_system_score_gemma":0.00006945564,"threshold_uncertainty_score":0.6398252},"labels":[],"label_agreement":null},{"id":"W2144295065","doi":"10.1109/jsac.2012.120919","title":"Two-Way Amplify-and-Forward Multiple-Input Multiple-Output Relay Networks with Antenna 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":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Fading; Diversity gain; Antenna (radio); Cooperative diversity; Relay channel; MIMO; Selection (genetic algorithm); Computer network; Channel state information; Telecommunications; Channel (broadcasting); Topology (electrical circuits); Wireless; Electrical engineering; Engineering; Artificial intelligence; Power (physics)","score_opus":0.04527269415622559,"score_gpt":0.29719683974577427,"score_spread":0.2519241455895487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144295065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12650098,0.004768744,0.86018556,0.00468816,0.00062439207,0.0007495155,0.000004726272,0.00045056254,0.0020273244],"genre_scores_gemma":[0.9504992,0.0053003016,0.043173976,0.00057503756,0.00022399946,0.00006912285,0.000015695092,0.00003716182,0.000105507104],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965955,0.0013169461,0.00068845355,0.00032838792,0.00036634534,0.0007043597],"domain_scores_gemma":[0.99480146,0.001918199,0.00042924072,0.0017966905,0.0006708993,0.00038350874],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012784934,0.00034437884,0.0003752956,0.0004962957,0.001352379,0.0003811172,0.0022239387,0.00015181725,0.000009866578],"category_scores_gemma":[0.0004203063,0.00029508528,0.000074708034,0.0021938288,0.00016950621,0.0011127982,0.00043770755,0.0022355993,0.000021129092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005301316,0.0035212308,0.71782607,0.00002263204,0.0005959135,0.000018901532,0.0094299,0.058742244,0.005943024,0.037714824,0.0037325732,0.16192257],"study_design_scores_gemma":[0.0026010515,0.00029392372,0.12661129,0.00037280482,0.000035655437,0.00078950735,0.00011361116,0.8569123,0.00022752023,0.000081714665,0.011316265,0.00064432214],"about_ca_topic_score_codex":0.00002803818,"about_ca_topic_score_gemma":0.0011050906,"teacher_disagreement_score":0.8239982,"about_ca_system_score_codex":0.00032607102,"about_ca_system_score_gemma":0.00015062206,"threshold_uncertainty_score":0.9999501},"labels":[],"label_agreement":null},{"id":"W2144431033","doi":"10.1109/tmc.2013.2296502","title":"Maximum Stable Throughput of Network-Coded Multiple Broadcast Sessions for WirelessTandem Random Access Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"Iran Telecommunication Research Center","keywords":"Computer science; Linear network coding; Computer network; Network packet; Random access; Aloha; Throughput; Distributed computing; Wireless network; Wireless","score_opus":0.03701657566618761,"score_gpt":0.3012260340177361,"score_spread":0.2642094583515485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144431033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050849803,0.0003302319,0.9916913,0.0001757653,0.0011719009,0.000939337,0.000007464705,0.00029518548,0.00030384137],"genre_scores_gemma":[0.9641445,0.00034092824,0.034819726,0.00025536108,0.00018687107,0.00013991114,0.0000061927453,0.000033769516,0.00007269411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758875,0.0003752314,0.0006662424,0.0005530447,0.00024825745,0.00056845206],"domain_scores_gemma":[0.9959653,0.0023011647,0.00030992524,0.001007824,0.00027880646,0.00013695256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094492343,0.00029113283,0.0005197187,0.00012539513,0.0011405991,0.00023684234,0.0014134411,0.00012903377,0.000022946395],"category_scores_gemma":[0.000025177666,0.00028187048,0.0002485246,0.00086653087,0.00009057788,0.0004787633,0.000040668758,0.00040734845,0.000003986061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004941246,0.0001253336,0.00004552812,0.000016340331,0.000034396213,2.301867e-7,0.00023473213,0.74944496,0.00022254833,0.0009833161,0.0002621093,0.2485811],"study_design_scores_gemma":[0.002321447,0.00016512796,0.000050206007,0.00022198817,0.000022750017,0.0000029743014,0.000031500233,0.98946524,0.0033886796,0.00039209292,0.0036442361,0.00029376076],"about_ca_topic_score_codex":0.000014330735,"about_ca_topic_score_gemma":0.00007157495,"teacher_disagreement_score":0.9590596,"about_ca_system_score_codex":0.00007304027,"about_ca_system_score_gemma":0.00007530532,"threshold_uncertainty_score":0.99996334},"labels":[],"label_agreement":null},{"id":"W2144433150","doi":"10.1109/glocom.2005.1578390","title":"On distributed space-time filtering","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Node (physics); Computer science; Channel (broadcasting); Relation (database); Filter (signal processing); Algorithm; Grassmannian; Upper and lower bounds; Optimization problem; Wireless; Topology (electrical circuits); Mathematical optimization; Control theory (sociology); Mathematics; Artificial intelligence; Telecommunications; Engineering; Data mining","score_opus":0.03322163927317642,"score_gpt":0.28439093554073036,"score_spread":0.2511692962675539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144433150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02410904,0.001617483,0.69458294,0.076220155,0.001318899,0.0014315498,0.0005047379,0.0025331532,0.19768205],"genre_scores_gemma":[0.9340465,0.001995859,0.05969044,0.0019622853,0.0001697466,0.00012314848,0.000237722,0.000024741401,0.0017495265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966537,0.00055452815,0.00076714804,0.00070037955,0.0004368823,0.0008873916],"domain_scores_gemma":[0.9940204,0.00034019907,0.00031656507,0.004494846,0.0004393476,0.0003886495],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000543355,0.0005020528,0.00049604854,0.00017989732,0.0010429632,0.0006925479,0.0057185395,0.00017214713,0.0005335763],"category_scores_gemma":[0.00015371526,0.0005263648,0.00020554572,0.0012590449,0.00021142953,0.00087120757,0.0012860593,0.0006168733,0.002478251],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003143532,0.0009657928,0.00016254814,0.00001040657,0.00015376054,0.000007828577,0.00032021845,0.0055619716,0.0013279394,0.41789722,0.3137752,0.25978568],"study_design_scores_gemma":[0.0012749464,0.00017534735,0.003094707,0.00017653189,0.000031053543,0.00008645906,0.000031658074,0.29285884,0.0010681326,0.0042500324,0.6958149,0.0011373593],"about_ca_topic_score_codex":0.00003775183,"about_ca_topic_score_gemma":0.0005175264,"teacher_disagreement_score":0.9099375,"about_ca_system_score_codex":0.00068641757,"about_ca_system_score_gemma":0.00035436702,"threshold_uncertainty_score":0.9997188},"labels":[],"label_agreement":null},{"id":"W2144476100","doi":"10.1049/iet-com.2013.0099","title":"Signal‐to‐noise ratio optimisation for multi‐input multi‐output relay systems with direct source–destination path","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Iran Telecommunication Research Center","keywords":"Relay; Computer science; Path (computing); Signal-to-noise ratio (imaging); SIGNAL (programming language); Noise (video); Telecommunications; Computer network; Physics; Artificial intelligence; Power (physics)","score_opus":0.08504776748951984,"score_gpt":0.30240850700862626,"score_spread":0.21736073951910642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144476100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017022042,0.0007643426,0.98808444,0.00528694,0.00011806537,0.002406069,0.000009724548,0.00045912096,0.001169071],"genre_scores_gemma":[0.5890456,0.00023318983,0.4064051,0.00039333088,0.000031311523,0.0018481519,0.000080975864,0.000027842383,0.0019345257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978503,0.0005718845,0.0005281909,0.0004461896,0.00026400638,0.00033943617],"domain_scores_gemma":[0.99420464,0.00079909107,0.0002900355,0.0033437533,0.0011600894,0.00020236269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007037448,0.00026440606,0.00027804764,0.00021714176,0.0011755641,0.0006564994,0.0027252426,0.00009591058,0.000012920227],"category_scores_gemma":[0.00025090133,0.00024197205,0.000082930965,0.00080978987,0.00011091742,0.00090653315,0.0007292866,0.0002749326,0.00014945745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000685326,0.0031125369,0.00417318,0.00017671468,0.00042959047,0.0000018205963,0.037413407,0.38700372,0.02185142,0.09149926,0.033181522,0.42108828],"study_design_scores_gemma":[0.00077226583,0.00011766364,0.0027777327,0.00013583935,0.000018520486,0.0000050559975,0.00020741484,0.96577007,0.00021672662,0.000017842176,0.029621752,0.0003391065],"about_ca_topic_score_codex":0.00014366658,"about_ca_topic_score_gemma":0.00012851431,"teacher_disagreement_score":0.5873434,"about_ca_system_score_codex":0.00017723847,"about_ca_system_score_gemma":0.00013845606,"threshold_uncertainty_score":0.9867334},"labels":[],"label_agreement":null},{"id":"W2144575370","doi":"10.1109/glocom.2005.1577837","title":"Cooperative diversity using message passing in wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Decodes; Relay; Computer science; Fading; Cooperative diversity; Relay channel; Channel (broadcasting); Computer network; Parity bit; Wireless; Node (physics); Algorithm; Telecommunications; Engineering","score_opus":0.05801066960294587,"score_gpt":0.29995637230889116,"score_spread":0.2419457027059453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144575370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15233289,0.0015824194,0.8119294,0.0088808965,0.0006659274,0.0009913695,0.000058271806,0.00061789976,0.022940919],"genre_scores_gemma":[0.9443505,0.0029201426,0.051097136,0.0011712904,0.00010617146,0.00003722632,0.000043834858,0.000018386014,0.0002553512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576277,0.0011725738,0.0008961551,0.0007713165,0.00040908527,0.0009880865],"domain_scores_gemma":[0.9955698,0.0002838172,0.00037189713,0.0028824876,0.00057043025,0.00032153272],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00087278784,0.0005172084,0.00061972305,0.00024342361,0.0019883513,0.0006446816,0.0046786354,0.00023825534,0.00013007643],"category_scores_gemma":[0.00006481004,0.0005675078,0.0001653664,0.0019147315,0.0003394008,0.0014785682,0.0032320493,0.000875786,0.00008146493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000892986,0.002362123,0.021294687,0.000030984695,0.00036748798,0.000059978127,0.0034335426,0.15721084,0.0012737478,0.2258683,0.020907605,0.5671014],"study_design_scores_gemma":[0.0011169518,0.000042280033,0.00777103,0.00016416454,0.000027688535,0.00006318561,0.00016935535,0.97418815,0.00021740742,0.0002737422,0.015173646,0.00079241814],"about_ca_topic_score_codex":0.00033906646,"about_ca_topic_score_gemma":0.00695991,"teacher_disagreement_score":0.81697726,"about_ca_system_score_codex":0.0011555263,"about_ca_system_score_gemma":0.00049367564,"threshold_uncertainty_score":0.99967766},"labels":[],"label_agreement":null},{"id":"W2144624975","doi":"10.1109/tcomm.2009.10.080090","title":"Strict suboptimality of selection amplify-and-forward relaying under global channel information","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Selection (genetic algorithm); Channel (broadcasting); Upper and lower bounds; Outage probability; Constant (computer programming); Relay channel; Mathematical optimization; Power (physics); Computer science; Mathematics; Control theory (sociology); Telecommunications; Fading; Physics","score_opus":0.047567399892368856,"score_gpt":0.30338906514648195,"score_spread":0.2558216652541131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144624975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024623284,0.00020137391,0.98913646,0.0043896036,0.00009255437,0.00022831035,0.000015973377,0.00019937067,0.0032740193],"genre_scores_gemma":[0.97545934,0.002526669,0.021402162,0.0005368156,0.000006054553,0.000028056387,0.000009980974,0.000003537921,0.000027411135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987429,0.00029836877,0.00042795867,0.00016135552,0.00019473197,0.00017469843],"domain_scores_gemma":[0.99784166,0.00022624074,0.00017457716,0.0014074297,0.00026453086,0.00008554506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043527767,0.00014394843,0.00016910121,0.00017014914,0.0007147416,0.000116987285,0.0010934365,0.00009198723,0.000011533343],"category_scores_gemma":[0.000016654336,0.00015331,0.00007493557,0.0010733953,0.00009101342,0.001140074,0.000021362572,0.00035147107,0.000016932478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007043952,0.0010668403,0.00010709083,0.000022438377,0.00013381585,1.6177366e-7,0.0029420294,0.06386897,0.0010678549,0.3380117,0.0004023506,0.5923063],"study_design_scores_gemma":[0.0016395868,0.0007467901,0.024882754,0.00015771254,0.00009677894,0.000052817755,0.00052180997,0.9462966,0.004237354,0.013747888,0.0068010488,0.0008188801],"about_ca_topic_score_codex":0.00003485472,"about_ca_topic_score_gemma":0.00008277119,"teacher_disagreement_score":0.972997,"about_ca_system_score_codex":0.0001421414,"about_ca_system_score_gemma":0.00008150171,"threshold_uncertainty_score":0.62518007},"labels":[],"label_agreement":null},{"id":"W2144718947","doi":"10.1109/glocom.2007.834","title":"Selective Decode-and-Forward Relaying Scheme for Multi-Hop Diversity Transmission Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Decodes; Computer science; Hop (telecommunications); Diversity gain; Transmission (telecommunications); Cooperative diversity; Signal-to-noise ratio (imaging); Fading; Decoding methods; Algorithm; Topology (electrical circuits); Computer network; Telecommunications; Mathematics; Physics","score_opus":0.0778287224184591,"score_gpt":0.3151014346013276,"score_spread":0.2372727121828685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144718947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008955675,0.0007222376,0.98787034,0.00025566798,0.00010979563,0.00031399223,4.1990867e-7,0.00015160665,0.001620288],"genre_scores_gemma":[0.76438254,0.00023071517,0.2345203,0.00015982283,0.000018812929,0.0000075377957,0.0000011453182,0.000004667083,0.00067446695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991925,0.00004957282,0.00016977034,0.00025679724,0.00011380419,0.00021755123],"domain_scores_gemma":[0.99917847,0.00021952392,0.000049024817,0.0002580815,0.00018351669,0.000111367495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007985408,0.000097345066,0.00012491207,0.00007668774,0.0007820284,0.00008186614,0.00045744237,0.000056109686,0.000003688673],"category_scores_gemma":[0.000036717745,0.00008473575,0.000046545814,0.0002588369,0.000022888908,0.00031838546,0.00044399948,0.00011308058,0.0000044898015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012823466,0.00026944157,0.02121257,0.00012131067,0.00014545838,0.0000059832832,0.014349842,0.00030296823,0.014952026,0.33774734,0.0036672277,0.6070976],"study_design_scores_gemma":[0.0009867578,0.00007107348,0.0053597335,0.000054781896,0.000006638015,0.0000060609686,0.00020273062,0.9774213,0.0025854702,0.000108294065,0.012956396,0.00024075751],"about_ca_topic_score_codex":0.000016522481,"about_ca_topic_score_gemma":0.00003588215,"teacher_disagreement_score":0.9771183,"about_ca_system_score_codex":0.0000608715,"about_ca_system_score_gemma":0.000021945581,"threshold_uncertainty_score":0.60148096},"labels":[],"label_agreement":null},{"id":"W2144802563","doi":"10.1109/twc.2007.060180","title":"Non-Coherent and Mismatched-Coherent Receivers for Distributed STBCs with Amplify-and-Forward Relaying","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Relay; Decoding methods; Cooperative diversity; Fading; Antenna diversity; Robustness (evolution); Transmission (telecommunications); Channel (broadcasting); Algorithm; Channel state information; Electronic engineering; Relay channel; Topology (electrical circuits); Computer network; Telecommunications; Wireless; Engineering; Electrical engineering; Physics","score_opus":0.038336404087022484,"score_gpt":0.2884711492392714,"score_spread":0.2501347451522489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144802563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029030092,0.0003003886,0.96640384,0.0029030906,0.000100337944,0.0007110714,0.000035654248,0.0001799003,0.00033559412],"genre_scores_gemma":[0.9544213,0.0030030615,0.041955173,0.00021252279,0.00001038316,0.00023490109,0.000027574835,0.00002259943,0.0001125058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986389,0.000107032225,0.00037633753,0.00037285057,0.00018163602,0.00032323602],"domain_scores_gemma":[0.99669284,0.00085833576,0.00014778209,0.0018800471,0.00022487514,0.00019610989],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00051585364,0.00023538084,0.00026180537,0.00016666505,0.0013757211,0.00018202869,0.0011612101,0.000104412655,0.000006384524],"category_scores_gemma":[0.000006913718,0.00022042204,0.00006417831,0.00052575034,0.00024735183,0.00035172852,0.000042553904,0.0004864632,0.000005375392],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000271336,0.0012295039,0.00055066054,0.000100911835,0.00041724945,0.0000032375574,0.0080104675,0.0032667553,0.007358336,0.040910844,0.0005974166,0.9372833],"study_design_scores_gemma":[0.01112974,0.001895238,0.011052777,0.0014225797,0.00048740895,0.00016544752,0.0050316965,0.85971177,0.034541234,0.0015586107,0.06964494,0.0033585408],"about_ca_topic_score_codex":0.000029957346,"about_ca_topic_score_gemma":0.00073866063,"teacher_disagreement_score":0.93392473,"about_ca_system_score_codex":0.000121519115,"about_ca_system_score_gemma":0.000067548295,"threshold_uncertainty_score":0.99992436},"labels":[],"label_agreement":null},{"id":"W2144857775","doi":"10.1109/tcomm.2012.100512.110649","title":"Power Allocation in Two-Dimensional Superposition Modulation Based Cooperative Wireless Communication System","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rayleigh fading; Spectral efficiency; Superposition principle; Link adaptation; Computer science; Transmission (telecommunications); Modulation (music); Relay; Electronic engineering; Wireless; Bit error rate; Symbol rate; Node (physics); Fading; Quadrature amplitude modulation; Communications system; Power (physics); Topology (electrical circuits); Computer network; Telecommunications; Channel (broadcasting); Mathematics; Engineering; Electrical engineering; Physics","score_opus":0.037498846544489345,"score_gpt":0.2950147410092691,"score_spread":0.25751589446477974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144857775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028560136,0.0006593132,0.9621249,0.0035581337,0.00035304774,0.00079877925,0.000016287639,0.00044823784,0.0034812037],"genre_scores_gemma":[0.9758742,0.00023055026,0.022732567,0.0004538936,0.000016992426,0.0004909218,0.00008493115,0.000028935388,0.00008700417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967249,0.0015000252,0.000658918,0.00034306227,0.00037648572,0.0003966203],"domain_scores_gemma":[0.9947896,0.00073387846,0.00018817234,0.0036786697,0.0004404973,0.00016917309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010496861,0.00028751694,0.0002731569,0.0005022706,0.0011043333,0.0001424861,0.0019197153,0.00011289808,0.00005244053],"category_scores_gemma":[0.000013407875,0.00031464954,0.00011591976,0.0014168435,0.00016868822,0.001634088,0.000046703604,0.0006678723,0.00015070228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011222604,0.004816389,0.0006400631,0.00004410728,0.00013746116,0.0000014402335,0.0076885037,0.44631603,0.023656081,0.43426058,0.00033655556,0.081990555],"study_design_scores_gemma":[0.001117287,0.00005830362,0.0032829149,0.00024096084,0.000016572332,0.0000124787375,0.00018437045,0.9880631,0.0061834953,0.000079936675,0.00036227214,0.00039829005],"about_ca_topic_score_codex":0.00006732481,"about_ca_topic_score_gemma":0.00036896142,"teacher_disagreement_score":0.9473141,"about_ca_system_score_codex":0.00063961995,"about_ca_system_score_gemma":0.00014898945,"threshold_uncertainty_score":0.99993056},"labels":[],"label_agreement":null},{"id":"W2145007806","doi":"10.1109/msn.2009.48","title":"A Distributed Relay Selection Algorithm for Cooperative Multicast in Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Communications Research Centre Canada","funders":"","keywords":"Multicast; Computer science; Computer network; Protocol Independent Multicast; Source-specific multicast; Xcast; Pragmatic General Multicast; IP multicast; Distributed computing; Wireless mesh network; Distance Vector Multicast Routing Protocol; Relay; Reliable multicast; Wireless network; Wireless; Telecommunications","score_opus":0.024254678001429542,"score_gpt":0.28644268048968624,"score_spread":0.2621880024882567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145007806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013427121,0.000046003624,0.99611807,0.0014739449,0.0000921107,0.00041114714,0.000002475128,0.00016360593,0.0003499327],"genre_scores_gemma":[0.90618557,0.00016383165,0.09252138,0.00070829305,0.000055092565,0.000059456772,0.000038713377,0.0000056023,0.00026207147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989224,0.00013580098,0.00025686042,0.00031148308,0.000093553645,0.0002798744],"domain_scores_gemma":[0.999155,0.00017800626,0.000052215295,0.00030429653,0.00024060604,0.00006990183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031226262,0.00013630687,0.00017614246,0.00007736584,0.00022006639,0.00015018672,0.00048507698,0.00007118281,0.000013079373],"category_scores_gemma":[0.000038039372,0.00012318973,0.00004490154,0.0009109262,0.000022791424,0.0003588659,0.00009000855,0.00019753152,0.000004798984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011095206,0.00018028244,0.00009868726,9.758893e-7,0.000010811106,0.0000018771051,0.00033149432,0.0040646023,0.0003371756,0.18794988,0.0021498743,0.8048632],"study_design_scores_gemma":[0.0006735223,0.00014046366,0.0016006966,0.000020232103,0.0000020498887,0.000004649115,0.000019388066,0.9958351,0.00052482384,0.00008536851,0.0009280816,0.00016562671],"about_ca_topic_score_codex":0.000004521721,"about_ca_topic_score_gemma":0.000110709174,"teacher_disagreement_score":0.9917705,"about_ca_system_score_codex":0.0001028825,"about_ca_system_score_gemma":0.00004403807,"threshold_uncertainty_score":0.5023532},"labels":[],"label_agreement":null},{"id":"W2145057693","doi":"10.1109/glocom.2008.ecp.813","title":"Improved OFDMA Uplink Transmission via Cooperation in the Presence of Frequency Offsets","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Alberta","funders":"","keywords":"Relay; Computer science; Telecommunications link; Node (physics); Diversity gain; Transmission (telecommunications); Orthogonal frequency-division multiple access; Computer network; Transmitter power output; Interference (communication); Orthogonal frequency-division multiplexing; Power (physics); Diversity scheme; Cooperative diversity; Electronic engineering; Fading; Telecommunications; Transmitter; Engineering; Channel (broadcasting)","score_opus":0.03780600336158862,"score_gpt":0.27084667531831175,"score_spread":0.23304067195672312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145057693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037591964,0.0006542195,0.9552938,0.003867543,0.00005213708,0.00025432222,1.6964397e-7,0.000039025377,0.0022468653],"genre_scores_gemma":[0.979221,0.0014460665,0.018789345,0.00035784405,0.000010878861,0.000023956154,0.0000019332324,0.0000026096857,0.00014635622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991494,0.0001929609,0.0002518727,0.00016256317,0.00013136324,0.000111858404],"domain_scores_gemma":[0.9991386,0.00014060679,0.00005281383,0.0005190376,0.00012242557,0.000026526819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003349124,0.00007482824,0.00009744705,0.000055035867,0.00015879911,0.000023698902,0.00095787126,0.00003593839,0.00005041585],"category_scores_gemma":[0.000026220656,0.000048234433,0.000030416802,0.00053728826,0.000051239993,0.0003411814,0.00007866061,0.0001313479,0.0000038284284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014477669,0.0004099877,0.002642305,0.000018767862,0.00001076354,0.0000070501133,0.014860912,0.00031935557,0.36247945,0.09377546,0.0013337138,0.5241278],"study_design_scores_gemma":[0.00037156677,0.00008007221,0.00845412,0.000034789005,0.0000015709506,0.000014227787,0.000017469141,0.96952987,0.020125642,0.00043124706,0.0008175446,0.00012189875],"about_ca_topic_score_codex":0.000056345645,"about_ca_topic_score_gemma":0.000048934508,"teacher_disagreement_score":0.9692105,"about_ca_system_score_codex":0.000011851525,"about_ca_system_score_gemma":0.00006120612,"threshold_uncertainty_score":0.19669431},"labels":[],"label_agreement":null},{"id":"W2145071722","doi":"10.1109/pacrim.2005.1517287","title":"Cooperator switch diversity in cooperative networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cooperative diversity; Diversity gain; Computer science; Rayleigh fading; Relay; Computer network; Diversity (politics); Telecommunications link; Transmit diversity; Antenna diversity; Diversity scheme; Fading; Telecommunications; Antenna (radio); Channel (broadcasting)","score_opus":0.040707046012573925,"score_gpt":0.27099076968621255,"score_spread":0.23028372367363864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145071722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037599202,0.0006203206,0.9266127,0.0059139053,0.00017026674,0.0002518333,3.977505e-7,0.00024580074,0.028585577],"genre_scores_gemma":[0.9893407,0.00050952256,0.0060892995,0.0029051218,0.000064697255,0.000008962638,0.0000016454123,0.000004178675,0.0010758511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990237,0.0001447249,0.00018847027,0.0002749988,0.00012687838,0.00024126164],"domain_scores_gemma":[0.9991421,0.000089279965,0.000029928247,0.00051613286,0.00013705144,0.00008552102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003188417,0.000118641656,0.00014198861,0.00008043104,0.00036259159,0.00012131914,0.0010564562,0.00004949317,0.00020743397],"category_scores_gemma":[0.000026971165,0.00010589818,0.000029521752,0.0007380941,0.000034279812,0.0006507527,0.0016675845,0.0002228935,0.00011546737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016036272,0.0003191573,0.014640247,0.000002158029,0.000025054198,0.000012982378,0.0029481454,0.06261044,0.00035955862,0.70180815,0.01591956,0.20133853],"study_design_scores_gemma":[0.0005968918,0.000034416604,0.006068678,0.000013778707,0.0000012830207,0.000003514082,0.000036650337,0.9735078,0.00043950128,0.00003841963,0.019021818,0.00023723781],"about_ca_topic_score_codex":0.00001428719,"about_ca_topic_score_gemma":0.0007564882,"teacher_disagreement_score":0.9517415,"about_ca_system_score_codex":0.00009311603,"about_ca_system_score_gemma":0.00004383132,"threshold_uncertainty_score":0.43184024},"labels":[],"label_agreement":null},{"id":"W2145105277","doi":"10.1109/glocom.2009.5426169","title":"Cooperative Transmission with Continuous Phase Frequency Shift Keying and Phase-Forward Relays","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Fading; Computer science; Transmission (telecommunications); Phase-shift keying; Signal-to-noise ratio (imaging); Decoding methods; Keying; Electronic engineering; Diversity scheme; Discriminator; Channel (broadcasting); Cooperative diversity; Frequency-shift keying; Node (physics); Modulation (music); Telecommunications; Relay channel; Topology (electrical circuits); Bit error rate; Demodulation; Engineering; Electrical engineering; Physics; Detector; Power (physics); Acoustics","score_opus":0.024015074870707916,"score_gpt":0.2965928155054719,"score_spread":0.272577740634764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145105277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06057757,0.0011806765,0.92129904,0.003944143,0.000026423422,0.00036043895,0.0000010304448,0.00022870391,0.0123819765],"genre_scores_gemma":[0.9525334,0.0004910217,0.045521908,0.0011522867,0.000021273543,0.000013137454,0.000004806004,0.000006543516,0.000255625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888927,0.00012192457,0.00023112066,0.0003598552,0.00016275686,0.00023507398],"domain_scores_gemma":[0.9991198,0.00008394013,0.0000605548,0.0004522999,0.000119716344,0.0001636748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022682533,0.00018131743,0.00021805405,0.00007800095,0.00038913244,0.00028427222,0.00047851857,0.000047148158,0.00008332113],"category_scores_gemma":[0.000014920691,0.0001301619,0.000029840854,0.0004000167,0.00006169486,0.0006612988,0.000058145917,0.00020618623,0.000009032382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006473996,0.00045485483,0.0000805404,0.0000040741725,0.00002299305,0.00003038409,0.00631036,0.000029675866,0.016698709,0.19055761,0.0005234193,0.78522265],"study_design_scores_gemma":[0.06280647,0.023426851,0.004662554,0.0013558005,0.00014724651,0.0004330353,0.0009979687,0.7248368,0.06882339,0.013557601,0.0944836,0.004468655],"about_ca_topic_score_codex":0.000004247481,"about_ca_topic_score_gemma":0.000012219015,"teacher_disagreement_score":0.89195585,"about_ca_system_score_codex":0.0000238875,"about_ca_system_score_gemma":0.000062433886,"threshold_uncertainty_score":0.53078485},"labels":[],"label_agreement":null},{"id":"W2145126830","doi":"10.1109/glocom.2008.ecp.766","title":"Multi-Hop Relaying and MIMO Techniques in Cellular Systems - Throughput Achievable on Rayleigh/Ricean Channels","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Computer science; Path loss; Rayleigh fading; Wireless; Computer network; Throughput; Reuse; Wireless network; Channel (broadcasting); Electronic engineering; Cooperative MIMO; 3G MIMO; Fading; Telecommunications; Engineering","score_opus":0.06933584519363438,"score_gpt":0.27908305385745297,"score_spread":0.20974720866381857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145126830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14348236,0.0040408964,0.8280885,0.0016254338,0.00046499723,0.00091592583,7.2238277e-7,0.00083878957,0.020542359],"genre_scores_gemma":[0.9610275,0.0021991374,0.034624986,0.00037108889,0.000042754855,0.000035092748,0.0000015138972,0.00001086993,0.0016870435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878335,0.00020128425,0.00026025326,0.0003597988,0.00015229768,0.0002430063],"domain_scores_gemma":[0.9990245,0.00013746748,0.00006450784,0.00064453646,0.00006217677,0.00006681018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043815683,0.00015266525,0.00020046574,0.00016081988,0.0003282846,0.00012394981,0.0006055599,0.000070258146,0.0000069111666],"category_scores_gemma":[0.000028735769,0.00013174288,0.000028413697,0.0004555543,0.000051800318,0.00041191463,0.00038632465,0.00023148445,0.000022304743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109671375,0.002806587,0.024987118,0.0003177414,0.00017602544,0.0005244098,0.047413826,0.0069097546,0.19178355,0.5880084,0.025622124,0.1113408],"study_design_scores_gemma":[0.0014643329,0.00036809646,0.0020525297,0.000516643,0.000005463275,0.00007916885,0.00029790262,0.89672834,0.054558344,0.00017400777,0.04274993,0.0010052685],"about_ca_topic_score_codex":0.00005100889,"about_ca_topic_score_gemma":0.00001754345,"teacher_disagreement_score":0.88981855,"about_ca_system_score_codex":0.000055612996,"about_ca_system_score_gemma":0.000025102012,"threshold_uncertainty_score":0.5372319},"labels":[],"label_agreement":null},{"id":"W2145187895","doi":"10.1007/s11277-014-1877-x","title":"On the Throughput Capacity of Cooperative Multi-hop Wireless Ad hoc Networks with Multi-flow","year":2014,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Cooperative diversity; Wireless network; Hop (telecommunications); Throughput; Wireless; Fading; Distributed computing; Channel (broadcasting); Telecommunications","score_opus":0.07909090618943124,"score_gpt":0.291085352163801,"score_spread":0.21199444597436976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145187895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08022143,0.0015646657,0.9073547,0.008621024,0.00010345914,0.0006138363,0.000019642834,0.00018995143,0.0013112623],"genre_scores_gemma":[0.9292473,0.0027634075,0.06628048,0.0012726492,0.000024282848,0.00016655745,0.000027149385,0.000028128146,0.00019003707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969544,0.0014234906,0.00043516306,0.00044224964,0.00037411833,0.00037062113],"domain_scores_gemma":[0.9931205,0.0019994893,0.00031144335,0.0037329332,0.0007092302,0.00012643238],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00087606313,0.00033391037,0.00040323238,0.00009141407,0.001491765,0.00017463492,0.004463781,0.00011302564,0.000028045677],"category_scores_gemma":[0.00012621054,0.0002336143,0.00012913991,0.00091118907,0.00095906405,0.00034574352,0.0011205071,0.000920036,0.000025044745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101762984,0.0020813416,0.0008018403,0.000031169486,0.00034914928,0.0000015632883,0.02995889,0.010326544,0.0022918435,0.74151194,0.0014702441,0.21107374],"study_design_scores_gemma":[0.0008532577,0.00018272824,0.0018988781,0.00019011737,0.00001656984,0.0000067225137,0.00054021185,0.9927094,0.00022240866,0.00005209998,0.0030073267,0.0003202909],"about_ca_topic_score_codex":0.00002519801,"about_ca_topic_score_gemma":0.0013588475,"teacher_disagreement_score":0.98238283,"about_ca_system_score_codex":0.00009567113,"about_ca_system_score_gemma":0.00012467949,"threshold_uncertainty_score":0.99980813},"labels":[],"label_agreement":null},{"id":"W2145192591","doi":"10.1109/tvt.2010.2051046","title":"Distortion Exponents for Multi-Relay Cooperative Networks with Limited Feedback","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Distortion (music); Computer science; Gaussian; Exponent; Signal-to-noise ratio (imaging); Topology (electrical circuits); Transmission (telecommunications); Channel state information; Relay channel; Decoding methods; Bandwidth (computing); Control theory (sociology); Electronic engineering; Algorithm; Mathematics; Telecommunications; Wireless; Engineering; Physics; Power (physics)","score_opus":0.026260127188138215,"score_gpt":0.26432571609907973,"score_spread":0.2380655889109415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145192591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050376814,0.000079282734,0.94624394,0.0016094724,0.000523574,0.0005788304,0.000004028777,0.000556414,0.00002763275],"genre_scores_gemma":[0.93025434,0.00013082675,0.068681225,0.00022101958,0.00002130251,0.0004247347,0.0000062730874,0.000022495342,0.0002377882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987984,0.000063144995,0.00023995827,0.00046153986,0.0001272318,0.00030978446],"domain_scores_gemma":[0.99847203,0.00008281909,0.00009373706,0.0009582206,0.0003171467,0.00007605174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015880485,0.00021751493,0.00021247893,0.00030094763,0.00059267215,0.000073028685,0.0007862366,0.00029240732,0.000016572285],"category_scores_gemma":[0.000013736755,0.00018768689,0.00008046884,0.0009394701,0.00019617876,0.00024205544,0.000009431723,0.0007922392,0.00002257203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025915794,0.0021693807,0.00022180741,0.000020968224,0.00042887882,0.000025499547,0.00076590426,0.3136102,0.08609178,0.03412911,0.00045942052,0.5618179],"study_design_scores_gemma":[0.0017974034,0.0004890036,0.00022065242,0.00004414276,0.000029555202,0.00004132581,0.000039557613,0.9368085,0.054804955,0.000037980182,0.005307794,0.0003790757],"about_ca_topic_score_codex":0.0000024926608,"about_ca_topic_score_gemma":0.00034213607,"teacher_disagreement_score":0.8798775,"about_ca_system_score_codex":0.000056575213,"about_ca_system_score_gemma":0.000046855068,"threshold_uncertainty_score":0.7653649},"labels":[],"label_agreement":null},{"id":"W2145575282","doi":"10.1109/isit.2008.4595395","title":"Power and resource allocation for orthogonal multiple access relay systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Resource allocation; Relay; Computer science; Channel (broadcasting); Mathematical optimization; Power (physics); Signal-to-noise ratio (imaging); Resource management (computing); Computer network; Mathematics; Telecommunications","score_opus":0.06719368332266397,"score_gpt":0.29634135210645435,"score_spread":0.2291476687837904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145575282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04919752,0.0007156353,0.942836,0.0017764658,0.00011109833,0.00029932626,8.0462263e-7,0.00012427146,0.004938883],"genre_scores_gemma":[0.99137217,0.00018620363,0.0063298205,0.00038195806,0.000024651721,0.00004640159,0.0000040163486,0.0000046984583,0.0016500802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994015,0.000061316845,0.00014108495,0.00019230727,0.00009259574,0.00011120764],"domain_scores_gemma":[0.99922705,0.0001905021,0.000044288056,0.00036763956,0.000118091244,0.000052417523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020822432,0.000065761145,0.00007946665,0.000044339296,0.0003081419,0.00012957156,0.0005056471,0.000029453484,0.000007069636],"category_scores_gemma":[0.00006169951,0.000056403867,0.000020941095,0.00014021971,0.000031727453,0.00037642286,0.00027493777,0.000053793796,0.0000052666624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004620779,0.00016691357,0.014680697,0.000036484413,0.00005445966,0.000004816446,0.003963891,0.0035937298,0.0021364277,0.8867794,0.05097968,0.037557255],"study_design_scores_gemma":[0.0005365524,0.00005123532,0.0145497685,0.000021232974,0.0000016281421,0.000038407175,0.000030816136,0.75791067,0.00023287549,0.00006550559,0.22638428,0.00017703732],"about_ca_topic_score_codex":0.0000039655665,"about_ca_topic_score_gemma":0.000010086768,"teacher_disagreement_score":0.9421747,"about_ca_system_score_codex":0.000014941276,"about_ca_system_score_gemma":0.000027771712,"threshold_uncertainty_score":0.23700094},"labels":[],"label_agreement":null},{"id":"W2145623425","doi":"10.1109/icc.2009.5199285","title":"Optimal Relay Assignment and Power Allocation in Selection Based Cooperative Cellular Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Overhead (engineering); Heuristic; Base station; Mathematical optimization; Metric (unit); Upper and lower bounds; Relay channel; Channel allocation schemes; Channel (broadcasting); Optimization problem; Assignment problem; Quadratic assignment problem; Power (physics); Algorithm; Computer network; Mathematics; Wireless; Telecommunications; Engineering","score_opus":0.01617125581405911,"score_gpt":0.24757279413067693,"score_spread":0.2314015383166178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145623425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01765789,0.00024531168,0.97617394,0.003371582,0.000048418085,0.00018134191,5.0409767e-8,0.00008007929,0.002241399],"genre_scores_gemma":[0.9679167,0.00011171886,0.030506408,0.0012169235,0.000013629607,0.00001121963,0.000003263652,0.0000031788195,0.00021692472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991173,0.00018339902,0.00017896504,0.00025355493,0.0001076152,0.00015913085],"domain_scores_gemma":[0.9995165,0.000062778236,0.000039629063,0.00023977598,0.00008675222,0.000054592016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035346247,0.00010290629,0.000099557474,0.000084257095,0.00013895798,0.00013296689,0.00023079068,0.00005171832,0.000045571247],"category_scores_gemma":[0.000017048304,0.00009414409,0.000016108519,0.0004816903,0.000018714982,0.00031444532,0.00006056538,0.00016343042,0.0000049196415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003072968,0.00031710273,0.0010620034,0.00000175953,0.000011507797,0.0000053798462,0.0012011633,0.7372553,0.014224827,0.18541466,0.0016931469,0.058782466],"study_design_scores_gemma":[0.00033825907,0.00016612948,0.0064620045,0.000015352382,0.0000012046739,0.0000014232592,0.000016385298,0.9891908,0.0029532698,0.000021919437,0.0007089306,0.00012429575],"about_ca_topic_score_codex":0.0000027646074,"about_ca_topic_score_gemma":0.00002331809,"teacher_disagreement_score":0.95025885,"about_ca_system_score_codex":0.000079340534,"about_ca_system_score_gemma":0.000039949857,"threshold_uncertainty_score":0.38390845},"labels":[],"label_agreement":null},{"id":"W2145625711","doi":"10.1109/glocom.2010.5683505","title":"Amplify-and-Forward Selection Cooperation with Channel Estimation Error","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Channel (broadcasting); Selection (genetic algorithm); Computer science; Imperfect; Fading; Signal-to-noise ratio (imaging); Upper and lower bounds; Algorithm; Relay channel; Bit error rate; Telecommunications; Mathematics; Power (physics); Artificial intelligence","score_opus":0.02305526452760339,"score_gpt":0.2720881865750066,"score_spread":0.2490329220474032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145625711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033036545,0.000015324667,0.9617293,0.0020066814,0.00010395024,0.00014522905,1.6821105e-7,0.00020572261,0.0027570992],"genre_scores_gemma":[0.9164021,0.000028243638,0.08269992,0.00036673888,0.00003076896,0.000023388982,0.0000055511873,0.000004808424,0.00043850846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945676,0.00003834185,0.00010669808,0.0001917676,0.00009676967,0.00010963562],"domain_scores_gemma":[0.99945563,0.000040304625,0.000039645438,0.00025870584,0.00014873862,0.000056966786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002004282,0.00008322897,0.00007091375,0.0000638204,0.00028672483,0.00020748604,0.00021340215,0.000043456454,0.00004033848],"category_scores_gemma":[0.000028838747,0.0000640661,0.000009011026,0.00031118587,0.000030529478,0.0005942517,0.000085131636,0.00018521225,0.000025947256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015539224,0.00007678266,0.000653775,0.000008244426,0.00001958403,6.3378104e-7,0.0012787606,0.0032896947,0.018535433,0.7752905,0.0013760168,0.19945507],"study_design_scores_gemma":[0.0002065795,0.00007079645,0.0016633357,0.0000058504993,0.0000026957962,0.000024404482,0.000008763153,0.99228936,0.0025470324,0.00033003138,0.0027351526,0.00011599433],"about_ca_topic_score_codex":0.000008189132,"about_ca_topic_score_gemma":0.00038802656,"teacher_disagreement_score":0.98899966,"about_ca_system_score_codex":0.000011391887,"about_ca_system_score_gemma":0.000036545538,"threshold_uncertainty_score":0.26125398},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020269394365844212,"score_gpt":0.2708845776144249,"score_spread":0.2506151832485807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145630771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022959165,0.00003466116,0.9747583,0.00041628827,0.00042714644,0.00035706555,0.0000053812128,0.00012491982,0.00091704197],"genre_scores_gemma":[0.99038833,0.00021617154,0.008071115,0.0010953791,0.000016363425,0.000055373734,0.0000041007556,0.000005624775,0.00014755578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896324,0.00009904148,0.00042203316,0.00014154572,0.00014233179,0.00023183196],"domain_scores_gemma":[0.9987079,0.0005639244,0.00010039109,0.00039359092,0.00015130773,0.000082917904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019155954,0.00013118885,0.00014935527,0.0003444892,0.00034325285,0.00013110472,0.0003377509,0.00009435708,0.000019449923],"category_scores_gemma":[0.000031533662,0.00012688777,0.00006697465,0.0003936064,0.000056409663,0.0014460132,0.000007748404,0.000244881,0.000046229055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002962455,0.00017802758,0.00004684549,0.0000610344,0.000044525812,9.875237e-7,0.011911455,0.021115812,0.0003918012,0.24432208,0.00024369157,0.7213875],"study_design_scores_gemma":[0.005171908,0.00047370858,0.0032493514,0.00036565596,0.000043086347,0.000050457424,0.0018198119,0.77985454,0.15391217,0.032431863,0.021208907,0.0014185568],"about_ca_topic_score_codex":0.000004167631,"about_ca_topic_score_gemma":0.00007606457,"teacher_disagreement_score":0.96742916,"about_ca_system_score_codex":0.00008178765,"about_ca_system_score_gemma":0.00003993618,"threshold_uncertainty_score":0.51743335},"labels":[],"label_agreement":null},{"id":"W2145730969","doi":"10.1109/vetecs.2009.5073777","title":"Performance Analysis of Decode-and-Forward Incremental Relaying Cooperative-Diversity Networks over Rayleigh Fading Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Cooperative diversity; Relay; Rayleigh fading; Computer science; Antenna diversity; Computer network; Fading; Channel (broadcasting); Diversity gain; Channel state information; Diversity scheme; Transmission (telecommunications); Exploit; Throughput; Signal-to-noise ratio (imaging); Telecommunications; Antenna (radio); Wireless; Computer security","score_opus":0.030728212132216434,"score_gpt":0.2654401322967626,"score_spread":0.23471192016454617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145730969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66861,0.000262484,0.3272127,0.00020834219,0.00007127077,0.00010655501,6.3599776e-7,0.00007324633,0.0034548393],"genre_scores_gemma":[0.9941334,0.0012285226,0.0038223036,0.0006269718,0.000019932733,0.0000019847846,0.0000058508094,0.0000030366175,0.00015801322],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885947,0.00011331515,0.00028265727,0.0003067555,0.00020729461,0.0002305038],"domain_scores_gemma":[0.99910057,0.00010410443,0.00011773061,0.00045479985,0.00013303813,0.00008978708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050042337,0.00014888588,0.00031094629,0.00028170907,0.00063053484,0.00009446952,0.00069274125,0.000053591033,0.0000939845],"category_scores_gemma":[0.00001828887,0.00013542015,0.00009587495,0.0015566875,0.000051021267,0.0007114745,0.0009816964,0.00016166124,0.000002104245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008345268,0.00028774494,0.34849375,0.000016009324,0.001490884,0.000007475772,0.0102183735,0.33938584,0.0028223966,0.08841235,0.0012737357,0.207508],"study_design_scores_gemma":[0.00026587243,0.00008155875,0.08298191,0.00001923365,0.00007182879,0.0000011994981,0.000034133853,0.91568035,0.0005928531,0.00001455861,0.000095813324,0.00016071173],"about_ca_topic_score_codex":0.000014344778,"about_ca_topic_score_gemma":0.00002759831,"teacher_disagreement_score":0.5762945,"about_ca_system_score_codex":0.000058390408,"about_ca_system_score_gemma":0.000016453836,"threshold_uncertainty_score":0.5522274},"labels":[],"label_agreement":null},{"id":"W2145736495","doi":"10.1109/secon.2012.6275813","title":"On the performance of successive interference cancellation in random access networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Single antenna interference cancellation; Computer science; Interference (communication); Random access; Computer network; Telecommunications; Decoding methods","score_opus":0.04872005260820541,"score_gpt":0.30041633284826064,"score_spread":0.25169628024005525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145736495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52047056,0.00037272664,0.46354884,0.0010398771,0.0002508639,0.00020475198,1.0652719e-7,0.000027138798,0.014085145],"genre_scores_gemma":[0.99884796,0.00047983133,0.00016155542,0.00035716305,0.000024601462,0.000017009785,5.0511534e-7,0.0000020715904,0.0001093002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937147,0.0001436082,0.00016746642,0.00008814803,0.0000855041,0.00014382198],"domain_scores_gemma":[0.9988841,0.00056096923,0.00008210219,0.00038952782,0.000058593814,0.0000247096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046321715,0.00006301138,0.00008901374,0.000048440026,0.00007405401,0.00005298754,0.0009830506,0.000020924623,0.00007947483],"category_scores_gemma":[0.00004295878,0.00003889975,0.000017757742,0.00041363508,0.00003154985,0.0005632464,0.00030635472,0.00013275999,0.000005509334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010117802,0.00014746556,0.09040994,0.000012021632,0.000014694977,2.1609321e-7,0.0030574016,0.043449126,0.00028666607,0.7406776,0.0013921506,0.12045153],"study_design_scores_gemma":[0.00031290378,0.000027819831,0.025230203,0.00007299391,8.611893e-7,3.4576692e-7,0.000013547306,0.97153944,0.0025124117,0.000066758184,0.00014759882,0.00007512152],"about_ca_topic_score_codex":0.000013437479,"about_ca_topic_score_gemma":0.00008134648,"teacher_disagreement_score":0.92809033,"about_ca_system_score_codex":0.000026584898,"about_ca_system_score_gemma":0.000021935646,"threshold_uncertainty_score":0.18267688},"labels":[],"label_agreement":null},{"id":"W2145747676","doi":"10.1109/tvt.2011.2128357","title":"Performance Analysis of Selection Combining of Signals With Different Modulation Levels in Cooperative Communications","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bit error rate; Decodes; Modulation (music); Signal-to-noise ratio (imaging); Link adaptation; Relay; Maximal-ratio combining; Algorithm; Diversity combining; Computer science; Electronic engineering; Mathematics; Telecommunications; Fading; Decoding methods; Engineering; Physics","score_opus":0.05477281146699942,"score_gpt":0.2691915993821316,"score_spread":0.2144187879151322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145747676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47320402,0.000029039194,0.5263912,0.000105278195,0.000012363948,0.000117592375,0.0000019323547,0.00004845018,0.0000901447],"genre_scores_gemma":[0.99172497,0.00021979971,0.007952066,0.000015970516,6.6970455e-7,0.000064392196,0.000002328698,0.0000063664843,0.000013416731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897635,0.0001633566,0.00037875987,0.00021496069,0.00013403849,0.0001325337],"domain_scores_gemma":[0.99853337,0.00007046241,0.00018459864,0.00089651695,0.0002934632,0.000021591326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017980151,0.00012512149,0.00033077938,0.0012993496,0.00014344521,0.0000074076156,0.0007415324,0.00010712643,0.000028456663],"category_scores_gemma":[0.0000047407243,0.00011091044,0.00006394357,0.0038520694,0.00019325789,0.00020179282,0.000014262366,0.0002911443,0.0000010266767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001055411,0.0024590623,0.027604837,0.000036464684,0.001670106,0.0000018070925,0.0059648696,0.6729387,0.11149423,0.034599382,0.0000021666199,0.14312287],"study_design_scores_gemma":[0.0003294952,0.0003469095,0.030342076,0.00006250068,0.00008687198,0.0000022194547,0.00007612268,0.7795044,0.18907386,0.000061443585,0.0000042878046,0.00010979371],"about_ca_topic_score_codex":0.000017803099,"about_ca_topic_score_gemma":0.00045939154,"teacher_disagreement_score":0.518521,"about_ca_system_score_codex":0.000057109162,"about_ca_system_score_gemma":0.000037722104,"threshold_uncertainty_score":0.45227966},"labels":[],"label_agreement":null},{"id":"W2145845506","doi":"10.1109/tcomm.2012.051412.110343","title":"Exact Analysis of Multihop Amplify-and-Forward Relaying Systems over General Fading Links","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Probability density function; Ergodic theory; Signal-to-noise ratio (imaging); Topology (electrical circuits); Channel (broadcasting); Outage probability; Computer science; Spread spectrum; Probability of error; Communications system; Fading distribution; Mathematics; Telecommunications; Algorithm; Rayleigh fading; Statistics; Mathematical analysis; Combinatorics","score_opus":0.06770129181002757,"score_gpt":0.32344586955251564,"score_spread":0.25574457774248804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145845506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024660131,0.0021587033,0.9705214,0.00051570096,0.0002890674,0.00022451293,0.000021983244,0.0001498098,0.0014587204],"genre_scores_gemma":[0.9771134,0.0043903627,0.018009476,0.00012970749,0.00002018892,0.00008723216,0.000012138509,0.00001406134,0.00022338411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830943,0.00048208327,0.00049504905,0.00022253592,0.00021382402,0.00027705083],"domain_scores_gemma":[0.99585456,0.0008059197,0.0001964334,0.0028357448,0.00015007138,0.00015728088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006423371,0.00017567455,0.00033742544,0.0006077002,0.00077097985,0.00011472227,0.0014398922,0.0001482939,0.000027986362],"category_scores_gemma":[0.000015679574,0.00017759424,0.00018042655,0.0017239546,0.00011000558,0.00062908867,0.00005310785,0.0006593588,0.000013694996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045739744,0.0030447003,0.009515535,0.000101852944,0.0063235,0.0000010907195,0.030445652,0.33400488,0.022516638,0.32876816,0.0005683909,0.26466388],"study_design_scores_gemma":[0.00030669343,0.000032102533,0.0052898284,0.00005564882,0.00039254996,0.000004723853,0.00015789157,0.9862638,0.00067334104,0.000023750765,0.0065186233,0.00028102694],"about_ca_topic_score_codex":0.00010932315,"about_ca_topic_score_gemma":0.0001285155,"teacher_disagreement_score":0.9525119,"about_ca_system_score_codex":0.000094275514,"about_ca_system_score_gemma":0.000034296514,"threshold_uncertainty_score":0.7242083},"labels":[],"label_agreement":null},{"id":"W2145891098","doi":"10.1109/tvt.2009.2037642","title":"A General Framework for Symbol Error Probability Analysis of Wireless Systems and Its Application in Amplify-and-Forward Multihop Relaying","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Moment-generating function; Reciprocal; Fading; Wireless; Signal-to-noise ratio (imaging); Expression (computer science); Computer science; Communications system; Electronic engineering; Topology (electrical circuits); Probability density function; Modulation (music); Probability of error; Mathematics; Algorithm; Telecommunications; Engineering; Channel (broadcasting); Statistics; Physics","score_opus":0.03027642550620546,"score_gpt":0.29742882757758626,"score_spread":0.2671524020713808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145891098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37853828,0.00033534077,0.6196994,0.0008475092,0.000025908344,0.00046058002,0.0000037674788,0.00008650869,0.0000027067563],"genre_scores_gemma":[0.979958,0.00030765642,0.019366037,0.000057900033,0.0000041085223,0.00029281134,0.000002040301,0.00000525221,0.000006205709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989146,0.00008437759,0.0003372489,0.000395809,0.000094651856,0.00017331832],"domain_scores_gemma":[0.9989922,0.00014114777,0.000111667665,0.000590991,0.00012607132,0.000037923808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003120713,0.00012671993,0.0003363551,0.0006548983,0.00015739971,0.000026109112,0.00035422598,0.00025352094,5.9074085e-7],"category_scores_gemma":[0.000019698095,0.0001264667,0.00006603187,0.0017160601,0.00006279287,0.000114047936,0.0000074632003,0.00030798186,5.214262e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052946456,0.0005361071,0.00091932085,0.000088420944,0.00036738082,0.0000017827974,0.0010003507,0.1215328,0.035788998,0.4677468,0.0000019816578,0.3719631],"study_design_scores_gemma":[0.00029297295,0.00010975817,0.0010663719,0.00004837252,0.000085160274,0.000004095881,0.00004911808,0.9902228,0.0053557577,0.002572494,0.00005621977,0.00013686591],"about_ca_topic_score_codex":0.0000095157475,"about_ca_topic_score_gemma":0.00006264373,"teacher_disagreement_score":0.86869,"about_ca_system_score_codex":0.000056942554,"about_ca_system_score_gemma":0.000019518078,"threshold_uncertainty_score":0.51571625},"labels":[],"label_agreement":null},{"id":"W2145959343","doi":"10.1109/icc.2009.5198816","title":"Channel Estimation and Performance of Mismatched Decoding in Wireless Relay Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decoding methods; Relay; Computer science; Algorithm; Channel (broadcasting); Wireless; Minimum mean square error; Bit error rate; Space–time code; Maximal-ratio combining; Real-time computing; Telecommunications; Power (physics); Statistics; Mathematics; Fading","score_opus":0.021711255855951208,"score_gpt":0.2570865840515966,"score_spread":0.2353753281956454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145959343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5210753,0.0001584779,0.4772909,0.00056773296,0.000027900613,0.000060100727,2.1096959e-8,0.000032308508,0.000787261],"genre_scores_gemma":[0.98389643,0.0009588966,0.014895329,0.00019370829,0.0000069712296,0.0000025095724,7.733033e-7,0.000001753975,0.000043638083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994787,0.00004065756,0.00018336916,0.00012489161,0.00006282493,0.000109581335],"domain_scores_gemma":[0.99958146,0.000057011257,0.000054545842,0.00024056928,0.000037740654,0.000028698902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027553967,0.00006185616,0.00010506678,0.00007156155,0.000060072776,0.000033109493,0.0002699027,0.00003149813,0.000002785659],"category_scores_gemma":[0.000010859306,0.000057196456,0.000011268737,0.0003277226,0.000015936328,0.0003276107,0.00008616018,0.000087471526,9.837754e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012709915,0.000056179782,0.002665153,0.000010507016,0.0000032824946,9.037582e-7,0.0015427981,0.038691495,0.000713174,0.050766073,0.00008030182,0.90545744],"study_design_scores_gemma":[0.00017225133,0.00005031322,0.020523423,0.00005803383,6.102318e-7,0.000002481459,0.000009234239,0.9781696,0.00081188686,0.00013106628,0.000005509766,0.00006559408],"about_ca_topic_score_codex":0.0000018899634,"about_ca_topic_score_gemma":0.000011045916,"teacher_disagreement_score":0.9394781,"about_ca_system_score_codex":0.000015212468,"about_ca_system_score_gemma":0.0000107174465,"threshold_uncertainty_score":0.23324038},"labels":[],"label_agreement":null},{"id":"W2146033716","doi":"10.1109/isit.2008.4595034","title":"An achievable rate region for the two-way two-relay channel","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Relay channel; Computer science; Channel (broadcasting); Deadlock; Computer network; Decoding methods; Constraint (computer-aided design); Coding (social sciences); Block (permutation group theory); Topology (electrical circuits); Algorithm; Distributed computing; Mathematics; Engineering; Electrical engineering","score_opus":0.08881703475877845,"score_gpt":0.3099541103962624,"score_spread":0.22113707563748397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146033716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046666595,0.00041135168,0.98285735,0.0065060663,0.00024885972,0.00030595012,2.5503277e-7,0.00018532186,0.004818174],"genre_scores_gemma":[0.98114365,0.0007665282,0.011021951,0.0025333927,0.00013924959,0.00006994234,0.0000028184286,0.000009045362,0.004313401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912924,0.00016153292,0.00015130425,0.00024567093,0.0000916036,0.00022064833],"domain_scores_gemma":[0.9983338,0.00031472777,0.000054366486,0.0010936161,0.00013650158,0.00006699568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047125513,0.00010477101,0.00009891638,0.000039456572,0.0009548197,0.0001119725,0.0013265364,0.000022035043,0.000016462822],"category_scores_gemma":[0.00002817845,0.0000678186,0.000055344008,0.00030823474,0.000060125607,0.00045357624,0.00021257355,0.0001136015,0.00003468144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005876956,0.00029313198,0.00030703653,0.000006642487,0.00006435873,0.0000108849845,0.0071250126,0.031734526,0.0037414883,0.7678427,0.055585984,0.13322943],"study_design_scores_gemma":[0.00063196267,0.000089124536,0.0005437687,0.0000073631604,0.0000033663068,0.000025587857,0.000037237518,0.96168,0.0014519133,0.00064631127,0.03473149,0.00015189435],"about_ca_topic_score_codex":0.000018798803,"about_ca_topic_score_gemma":0.00010175877,"teacher_disagreement_score":0.976477,"about_ca_system_score_codex":0.000021064983,"about_ca_system_score_gemma":0.000039489183,"threshold_uncertainty_score":0.7343798},"labels":[],"label_agreement":null},{"id":"W2146081549","doi":"10.1109/wcnc.2007.154","title":"Power and Weight Distribution Design Criteria for Cooperative Diversity Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise error probability; Relay; Diversity gain; Computer science; Coding gain; Fading; Cooperative diversity; Coding (social sciences); Electronic engineering; Power (physics); Convolutional code; Transmission (telecommunications); Channel (broadcasting); Telecommunications; Algorithm; Mathematics; Decoding methods; Engineering; Statistics","score_opus":0.062483791800871616,"score_gpt":0.3051589424782242,"score_spread":0.24267515067735262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146081549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043254727,0.00015335053,0.99297076,0.0010344232,0.00019731848,0.0002483333,0.0000033449307,0.000073319985,0.0009936813],"genre_scores_gemma":[0.9729445,0.00009273794,0.026085336,0.00043099094,0.000029125926,0.0000064411315,0.000008289396,0.0000024059223,0.00040014923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994039,0.00006687413,0.000104111,0.00018949634,0.00007037695,0.0001652726],"domain_scores_gemma":[0.9992537,0.00023130042,0.000027379272,0.00021755532,0.00019936307,0.00007072033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068682164,0.00007860963,0.000083930216,0.000027879367,0.000593181,0.000110965135,0.00032567064,0.0000325829,0.00004316164],"category_scores_gemma":[0.000048783684,0.000067541536,0.00002125162,0.00017285095,0.000040233983,0.00034238683,0.0006402653,0.00004879849,0.0000043148184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109529676,0.00015400193,0.00066282926,0.00000846136,0.000050123523,0.0000053288027,0.0059754266,0.000055060984,0.0031509784,0.89352477,0.044739947,0.051563546],"study_design_scores_gemma":[0.0043570637,0.0014001402,0.02530842,0.00009198895,0.000028684717,0.000037820493,0.0004972811,0.66802055,0.08458168,0.01150126,0.2025675,0.0016076006],"about_ca_topic_score_codex":0.0000014855498,"about_ca_topic_score_gemma":0.000005134804,"teacher_disagreement_score":0.96861905,"about_ca_system_score_codex":0.00003336755,"about_ca_system_score_gemma":0.000013883394,"threshold_uncertainty_score":0.45623288},"labels":[],"label_agreement":null},{"id":"W2146277578","doi":"10.1109/icc.2011.5963237","title":"QoS Guaranteed Resource Allocation in Cooperative Cellular Network with MIMO-Based Relays","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Computer science; Spectral efficiency; Base station; Cellular network; Transmitter power output; Relay; Transmission (telecommunications); Computer network; Throughput; Quality of service; Wireless; Power (physics); Telecommunications; Transmitter; Channel (broadcasting)","score_opus":0.040122372666000966,"score_gpt":0.23115857902937634,"score_spread":0.19103620636337537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146277578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012163083,0.00036954196,0.93715036,0.0009517486,0.00008639004,0.0005246381,2.7381367e-7,0.00021198227,0.048541974],"genre_scores_gemma":[0.9462391,0.000029351979,0.051255774,0.0018045974,0.000045643123,0.00007384471,0.0000067490146,0.000012576245,0.00053235155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858403,0.00032782886,0.00027216345,0.00036064078,0.00016839291,0.00028694596],"domain_scores_gemma":[0.99872804,0.00011898879,0.000082190956,0.0008622047,0.00013986774,0.00006868624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050550967,0.00016475652,0.00017308646,0.00009966384,0.00019333824,0.00007613383,0.0009012261,0.00005755156,0.00011341431],"category_scores_gemma":[0.000022405779,0.00013153789,0.000029722702,0.0010590078,0.00007244574,0.00026346964,0.00016621524,0.00022332673,0.000049843307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036598547,0.00074541906,0.015411547,0.000021448734,0.00007385458,0.00008268561,0.014041464,0.058736555,0.0035194894,0.8698994,0.011944201,0.025157958],"study_design_scores_gemma":[0.0023486794,0.0005567336,0.0070267925,0.00026492507,0.000011609259,0.000008458903,0.00028193463,0.93145764,0.016389167,0.00035563397,0.04052107,0.00077735225],"about_ca_topic_score_codex":0.000030710537,"about_ca_topic_score_gemma":0.00047499713,"teacher_disagreement_score":0.934076,"about_ca_system_score_codex":0.0000515485,"about_ca_system_score_gemma":0.00010042812,"threshold_uncertainty_score":0.53639597},"labels":[],"label_agreement":null},{"id":"W2146405098","doi":"10.1109/twc.2009.080987","title":"Power-optimized amplify-and-forward multi-hop 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":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Rayleigh fading; Diversity gain; Hop (telecommunications); Power (physics); Power gain; Power budget; Signal-to-noise ratio (imaging); Mathematical optimization; Fading; Power control; Control theory (sociology); Telecommunications; Mathematics; Decoding methods; Bandwidth (computing)","score_opus":0.05159451862372821,"score_gpt":0.3008365855760442,"score_spread":0.249242066952316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146405098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020013745,0.001216605,0.98781884,0.005189416,0.0002889951,0.0004451258,0.000010177625,0.00056371413,0.002465753],"genre_scores_gemma":[0.9420058,0.006313353,0.05050798,0.00058131013,0.000009658653,0.00012774709,0.0000060321768,0.000018814239,0.0004292805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797535,0.00053222675,0.0005169606,0.0004081751,0.00023794491,0.00032936316],"domain_scores_gemma":[0.99517196,0.0005352334,0.00016134843,0.003718812,0.000219313,0.00019334386],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045973918,0.00026658078,0.0003293375,0.0002798181,0.0015511476,0.00037383396,0.0025444797,0.0001391328,0.000017230397],"category_scores_gemma":[0.000013277198,0.00027391387,0.00011907109,0.00076120766,0.00015915898,0.0005963021,0.00003923293,0.0007814022,0.0000681218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007619763,0.0028018223,0.000036744575,0.000030413514,0.00030110966,0.0000055386254,0.009116456,0.05321123,0.011928484,0.32216066,0.0009154169,0.59941596],"study_design_scores_gemma":[0.001939555,0.00021657613,0.00044726743,0.00023382345,0.000041177038,0.00004101641,0.00039591096,0.98326385,0.0011024001,0.00019939138,0.011368511,0.00075051835],"about_ca_topic_score_codex":0.000017362396,"about_ca_topic_score_gemma":0.0000365856,"teacher_disagreement_score":0.94000447,"about_ca_system_score_codex":0.0001149062,"about_ca_system_score_gemma":0.00007350142,"threshold_uncertainty_score":0.99997133},"labels":[],"label_agreement":null},{"id":"W2146818257","doi":"10.1109/tit.2008.2011518","title":"Capacity of a Class of Modulo-Sum Relay Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay channel; Relay; Transmitter; Channel capacity; Modulo; Topology (electrical circuits); Channel (broadcasting); Mathematics; Noise (video); Computer science; Telecommunications; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.024531877540790243,"score_gpt":0.24454734895392333,"score_spread":0.22001547141313307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146818257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011083865,0.00001918008,0.9832116,0.0004418642,0.00026260177,0.00013557258,0.0000070603423,0.000073332994,0.004764931],"genre_scores_gemma":[0.99540055,0.00011209244,0.0039653205,0.00041553774,0.0000064630367,0.000008860019,0.0000013622689,0.000002014763,0.00008778995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990921,0.0001354494,0.00040845198,0.00007317272,0.00018404274,0.00010681025],"domain_scores_gemma":[0.9988993,0.00012272953,0.0001931686,0.00052580284,0.00021715298,0.000041843923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004860745,0.00009012502,0.0001406482,0.0002338164,0.00012249443,0.000027903528,0.00047047742,0.000055940764,0.00004121605],"category_scores_gemma":[0.000012249311,0.000085169995,0.000084697625,0.00044447815,0.000059832728,0.0012294883,0.0000026800055,0.0001652595,0.000026188944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057541805,0.00017172663,0.0000011049339,0.000022457327,0.000029477138,8.6264876e-8,0.00823986,0.075784355,0.0026488262,0.46372938,0.00013493514,0.44918025],"study_design_scores_gemma":[0.0015959295,0.00078226125,0.0005741188,0.00024051446,0.00002846735,0.000014630135,0.00039008024,0.5527851,0.41278395,0.025465837,0.004837916,0.0005012222],"about_ca_topic_score_codex":0.0000014782817,"about_ca_topic_score_gemma":0.0000012115518,"teacher_disagreement_score":0.9843167,"about_ca_system_score_codex":0.00003218036,"about_ca_system_score_gemma":0.000035883233,"threshold_uncertainty_score":0.34731317},"labels":[],"label_agreement":null},{"id":"W2147317567","doi":"10.1109/tcomm.2009.09.070577","title":"Antenna/relay selection for coded cooperative networks with AF relaying","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Bit error rate; Selection (genetic algorithm); Transmission (telecommunications); Antenna (radio); Phase-shift keying; Relay channel; Electronic engineering; Reliability (semiconductor); Cooperative diversity; Telecommunications; Decoding methods; Topology (electrical circuits); Fading; Engineering; Power (physics); Electrical engineering","score_opus":0.04437427375651506,"score_gpt":0.2944433003551277,"score_spread":0.2500690265986127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147317567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039747954,0.00036688117,0.9890597,0.007602559,0.00014346968,0.00072603655,0.000007149379,0.0004436859,0.0012530744],"genre_scores_gemma":[0.89493805,0.0017989626,0.101135455,0.0011552863,0.000025493324,0.00029711222,0.000013606275,0.000019367977,0.0006166508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843276,0.00031686804,0.00036401453,0.00038514627,0.00017057099,0.0003306567],"domain_scores_gemma":[0.99648315,0.0005989099,0.00013700349,0.0021233244,0.0005372404,0.00012038793],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003520463,0.00024464919,0.0002393658,0.00020523241,0.002107071,0.00023810325,0.0017887772,0.00010604291,0.000016027128],"category_scores_gemma":[0.000013467703,0.00022617858,0.000112920505,0.0012591738,0.00012445751,0.0006144091,0.000012414306,0.0006253601,0.000017191542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024393626,0.0017081612,0.000036380323,0.000008670937,0.00025605332,0.0000011457179,0.0026943516,0.6536305,0.00575945,0.11590405,0.0015445639,0.21821275],"study_design_scores_gemma":[0.0009003004,0.00058649003,0.00013953583,0.00008616949,0.000034936744,0.000022269463,0.000070082635,0.991521,0.0014392625,0.00013772206,0.004737275,0.00032494953],"about_ca_topic_score_codex":0.000006723074,"about_ca_topic_score_gemma":0.0003502433,"teacher_disagreement_score":0.8945406,"about_ca_system_score_codex":0.00014298296,"about_ca_system_score_gemma":0.00012037577,"threshold_uncertainty_score":0.99919206},"labels":[],"label_agreement":null},{"id":"W2147318399","doi":"10.1109/milcom.2009.5380083","title":"Optimum power loading for non-coherent frequency-selective relay channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orthogonal frequency-division multiplexing; Rayleigh fading; Computer science; Relay; Channel (broadcasting); Monte Carlo method; Transmission (telecommunications); Upper and lower bounds; Estimator; Fading; Multiplexing; Electronic engineering; Power (physics); Computer network; Telecommunications; Engineering; Mathematics; Statistics; Physics","score_opus":0.030106141563568303,"score_gpt":0.2891864679814888,"score_spread":0.2590803264179205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147318399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019487666,0.00020547782,0.9463172,0.004701141,0.00033547255,0.0004307634,4.6711872e-7,0.00018416996,0.04587656],"genre_scores_gemma":[0.90843326,0.00007381528,0.08777707,0.0021125348,0.00005702251,0.00004187542,0.0000019876056,0.000006323307,0.0014961411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990206,0.00004572997,0.0001997814,0.00032036676,0.00011883505,0.00029473662],"domain_scores_gemma":[0.9989571,0.000117863434,0.00006115785,0.0005605534,0.00021560956,0.00008774456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027160736,0.00013775784,0.00015167442,0.00008590725,0.00027516653,0.0001701901,0.0008738348,0.000051537096,0.000058943635],"category_scores_gemma":[0.00004520969,0.000120359546,0.000079296406,0.00040170728,0.000016992828,0.00041179368,0.000120163284,0.00013723642,0.000043824853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002093374,0.00029114116,0.00010608385,0.0000057166835,0.00005965011,0.000004716451,0.004926157,0.0008442601,0.025897345,0.8208101,0.051579658,0.09545423],"study_design_scores_gemma":[0.0026256375,0.0021648319,0.0036180853,0.00019901295,0.000018712633,0.0000298585,0.00015758169,0.8580955,0.05732451,0.037307702,0.036878366,0.0015801501],"about_ca_topic_score_codex":0.0000014671735,"about_ca_topic_score_gemma":0.000004176233,"teacher_disagreement_score":0.9064845,"about_ca_system_score_codex":0.0000819632,"about_ca_system_score_gemma":0.00005371185,"threshold_uncertainty_score":0.49081197},"labels":[],"label_agreement":null},{"id":"W2147323021","doi":"10.1109/wcnc.2011.5779136","title":"Cross-layer design of joint relay selection and power control scheme in relay-based multi-cell networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; Computer science; Power control; Selection (genetic algorithm); Scheme (mathematics); Power (physics); Path (computing); Joint (building); Interference (communication); Control (management); Computer network; Engineering; Mathematics; Artificial intelligence; Channel (broadcasting)","score_opus":0.08359898995511221,"score_gpt":0.2785570395135221,"score_spread":0.1949580495584099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147323021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028437765,0.0004049947,0.9699425,0.000078992816,0.000067240864,0.00024446775,1.4598507e-7,0.0000654913,0.0007583929],"genre_scores_gemma":[0.8164711,0.00007699127,0.18296175,0.000275098,0.000005012323,0.000010581792,3.2404364e-7,0.000006484939,0.00019269524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988885,0.0002506239,0.000319719,0.00025616723,0.00009253163,0.00019246044],"domain_scores_gemma":[0.9991451,0.0001323965,0.00011025755,0.00038333875,0.00016821208,0.000060727238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072810845,0.000117563504,0.00017205345,0.00011046408,0.000094152856,0.0000528655,0.00032165623,0.00008484917,0.000098711986],"category_scores_gemma":[0.000041834028,0.00010406907,0.000033807675,0.00038047964,0.000052939682,0.00025546932,0.00011374258,0.00021532735,0.0000068576733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007633709,0.0035609603,0.2712801,0.00006478325,0.00013235898,0.000026373642,0.009526138,0.5238716,0.10888113,0.052399717,0.0017716358,0.027721785],"study_design_scores_gemma":[0.0016548905,0.000117459786,0.020814061,0.000021715448,0.0000019700233,0.0000015717051,0.0000074912105,0.9714835,0.00570421,0.000010713213,0.00005843365,0.00012392549],"about_ca_topic_score_codex":0.000024447829,"about_ca_topic_score_gemma":0.00004457249,"teacher_disagreement_score":0.7880333,"about_ca_system_score_codex":0.000031890282,"about_ca_system_score_gemma":0.000052338437,"threshold_uncertainty_score":0.42438135},"labels":[],"label_agreement":null},{"id":"W2147395772","doi":"10.1109/infcom.2009.5062036","title":"Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Theoretical computer science; Null (SQL); Subspace topology; Hash function; Redundancy (engineering); Algorithm; Computer network; Data mining; Computer security; Artificial intelligence","score_opus":0.046432848058069694,"score_gpt":0.26080449571476133,"score_spread":0.21437164765669164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147395772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052528463,0.0036024211,0.8862567,0.00915386,0.00032898376,0.00040856563,2.8627662e-7,0.0005545055,0.04716622],"genre_scores_gemma":[0.96955085,0.0005249787,0.027412118,0.001442917,0.00013255025,0.0000056229333,8.418764e-7,0.000008467187,0.0009216386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985822,0.00016078417,0.00037264015,0.0002956756,0.0002162722,0.000372435],"domain_scores_gemma":[0.99866575,0.00009018909,0.00015863887,0.00079611846,0.00020327339,0.00008603566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046013205,0.00017353852,0.00025301834,0.00006837567,0.00029180196,0.00014025175,0.0010749792,0.000057685393,0.0000371904],"category_scores_gemma":[0.000054199547,0.00014614266,0.00007844025,0.0005692564,0.000053658907,0.0003669405,0.00037252347,0.0001955122,0.000033852455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003455299,0.00030551775,0.0029777703,0.00005290083,0.00007053629,0.000013961276,0.0057054893,0.008444146,0.07893267,0.53209263,0.014219827,0.35715],"study_design_scores_gemma":[0.00094286207,0.00042725285,0.004823941,0.0008349372,0.000021921192,0.00005572217,0.00022303931,0.9006173,0.0675619,0.0023370422,0.021127302,0.0010267472],"about_ca_topic_score_codex":0.000010315549,"about_ca_topic_score_gemma":0.000029309645,"teacher_disagreement_score":0.9170224,"about_ca_system_score_codex":0.000040900966,"about_ca_system_score_gemma":0.000041610063,"threshold_uncertainty_score":0.59595245},"labels":[],"label_agreement":null},{"id":"W2147440066","doi":"10.1109/glocom.2009.5425275","title":"Cooperative Peer-to-Peer Information Exchange via Wireless Network Coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Linear network coding; Computer network; Wireless network; Wireless; Coding (social sciences); Scheduling (production processes); Peer-to-peer; Exploit; Information exchange; Distributed computing; Wireless WAN; Wi-Fi array; Telecommunications; Engineering; Computer security; Network packet","score_opus":0.027223448640907984,"score_gpt":0.2759936609827984,"score_spread":0.24877021234189045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147440066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011768397,0.00007190215,0.93475413,0.022683624,0.00029143435,0.00029792925,8.325236e-7,0.00029829945,0.04042503],"genre_scores_gemma":[0.9539372,0.00012629169,0.026851388,0.015250224,0.00017252272,0.000024450319,0.000022322929,0.0000052780015,0.003610347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856216,0.00012352144,0.0003117891,0.00021056269,0.00044245948,0.00034953342],"domain_scores_gemma":[0.998119,0.000086579115,0.00007743874,0.00063245127,0.0009240618,0.00016049134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007328337,0.00017050287,0.00017963926,0.00011415449,0.0004408136,0.00046992084,0.0009796,0.000058041984,0.00012979175],"category_scores_gemma":[0.00006317034,0.00015275912,0.000043705237,0.001037756,0.00001913322,0.001631067,0.00034190225,0.00019157704,0.00039908133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008462376,0.00003167562,0.0000490572,0.0000028275472,0.00001009892,0.0000013717432,0.0044201864,0.001819581,0.00032123335,0.21218291,0.10769112,0.6734615],"study_design_scores_gemma":[0.0005183064,0.0002448425,0.0027360818,0.000059745475,0.0000044938074,0.000011226039,0.000090075635,0.5993156,0.0011987272,0.0007879947,0.394514,0.00051896524],"about_ca_topic_score_codex":0.000004863647,"about_ca_topic_score_gemma":0.000035213012,"teacher_disagreement_score":0.95276034,"about_ca_system_score_codex":0.000077189325,"about_ca_system_score_gemma":0.00004350743,"threshold_uncertainty_score":0.6229336},"labels":[],"label_agreement":null},{"id":"W2147631966","doi":"10.1109/tvt.2010.2052117","title":"Optimization of Wireless Multicast Systems Employing Hybrid-ARQ with Chase Combining","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Hybrid automatic repeat request; Source-specific multicast; Computer science; Xcast; Computer network; Pragmatic General Multicast; Throughput; Protocol Independent Multicast; Automatic repeat request; IP multicast; Channel (broadcasting); Distributed computing; Reliable multicast; Distance Vector Multicast Routing Protocol; Wireless; Telecommunications link; Telecommunications","score_opus":0.01613169755399985,"score_gpt":0.24427300182980577,"score_spread":0.22814130427580592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147631966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.167067,0.000046368536,0.8313483,0.0006105465,0.00028409713,0.0002237499,0.000002286265,0.00036386395,0.000053764066],"genre_scores_gemma":[0.9694461,0.00008266737,0.030309865,0.000035621677,0.000007941651,0.00007518583,0.0000015929446,0.000017080582,0.00002390211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989672,0.00006690393,0.00027408687,0.000309294,0.00017281507,0.00020971798],"domain_scores_gemma":[0.998523,0.00007798722,0.00013227119,0.00096283684,0.0002509395,0.000052972417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018210185,0.00015579656,0.0002315862,0.00042062328,0.00029610406,0.00005475756,0.00073220546,0.00013254848,0.0000101703545],"category_scores_gemma":[0.000007915517,0.00014262373,0.000046304645,0.00083404634,0.00018646287,0.00020464743,0.000010845256,0.0005868834,0.0000075679773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028242397,0.0005118898,0.00009032397,0.00003362445,0.00011106256,0.000029525198,0.0003373117,0.80419785,0.0763844,0.031674944,0.000011367717,0.08658947],"study_design_scores_gemma":[0.0006015555,0.00017344559,0.000009029494,0.000086692584,0.000015368541,0.000103845065,0.000060708517,0.9114614,0.087103486,0.000023010716,0.00018731433,0.00017414182],"about_ca_topic_score_codex":0.000009237752,"about_ca_topic_score_gemma":0.00003295725,"teacher_disagreement_score":0.80237913,"about_ca_system_score_codex":0.000025747982,"about_ca_system_score_gemma":0.00004998866,"threshold_uncertainty_score":0.5816027},"labels":[],"label_agreement":null},{"id":"W2147658472","doi":"10.1109/twc.2010.03.090802","title":"Scheduling for long term proportional fairness in a cognitive wireless network with spectrum underlay","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Underlay; Maximum throughput scheduling; Scheduling (production processes); Cognitive radio; Computer network; Wireless network; Cognitive network; Wireless ad hoc network; Wireless; Proportionally fair; Round-robin scheduling; Dynamic priority scheduling; Mathematical optimization; Telecommunications; Quality of service; Mathematics; Signal-to-noise ratio (imaging)","score_opus":0.04561321280894489,"score_gpt":0.3059900828103054,"score_spread":0.2603768700013605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147658472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103930295,0.00008514486,0.8904443,0.0036953585,0.00027427924,0.0009533952,0.000014404947,0.00022795363,0.00037491685],"genre_scores_gemma":[0.96915835,0.00046074484,0.0288819,0.00024454214,0.000058308553,0.0009971848,0.000033019845,0.00003651126,0.00012941322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980335,0.00022262786,0.0004998975,0.0005011079,0.00026963282,0.00047323763],"domain_scores_gemma":[0.9962285,0.0009796165,0.00020297352,0.0021264376,0.00032255915,0.00013988765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053036056,0.00029065704,0.0003125825,0.00026882772,0.0012740397,0.0002362489,0.0021751805,0.00014197727,0.000031672003],"category_scores_gemma":[0.000010416611,0.00028295218,0.000118931486,0.0012439499,0.00035984826,0.00061354466,0.000042245156,0.0011669102,0.000014137464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000407404,0.0045375065,0.009930379,0.00009863062,0.00044703644,0.000015242152,0.00434847,0.041562002,0.004850126,0.36797175,0.000070604234,0.56576085],"study_design_scores_gemma":[0.0055595594,0.00053464,0.027054776,0.001334193,0.00012444796,0.00011935938,0.0003878656,0.9479865,0.0110358,0.003528535,0.0005216111,0.0018127483],"about_ca_topic_score_codex":0.000017959315,"about_ca_topic_score_gemma":0.009620036,"teacher_disagreement_score":0.90642446,"about_ca_system_score_codex":0.00010117981,"about_ca_system_score_gemma":0.00032911144,"threshold_uncertainty_score":0.9999623},"labels":[],"label_agreement":null},{"id":"W2147676325","doi":"10.1109/wiopt.2009.5291613","title":"Bandwidth and routing optimization in wireless cellular networks with relays","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Base station; Orthogonal frequency-division multiplexing; Relay; Cellular network; Throughput; Bandwidth (computing); Telecommunications link; Wireless; Space-division multiple access; Frequency divider; Wireless network; Power (physics); Telecommunications","score_opus":0.01322797444346862,"score_gpt":0.21996018451327684,"score_spread":0.20673221006980821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147676325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102978265,0.00023456676,0.9830099,0.001030743,0.000019140987,0.00011418693,1.782418e-8,0.00007548959,0.005218134],"genre_scores_gemma":[0.9427271,0.00041960672,0.056259353,0.00047072815,0.000014407955,0.0000033473527,0.0000016023935,0.000002945413,0.000100932084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941653,0.00006623673,0.00012535568,0.00018417182,0.000068519344,0.00013917324],"domain_scores_gemma":[0.999565,0.000043383083,0.000036311325,0.00027698156,0.00003817755,0.000040170766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021084666,0.00007546736,0.00008861876,0.00005085427,0.00010936259,0.00012198295,0.00025332137,0.000030723397,0.000007536212],"category_scores_gemma":[0.0000055928704,0.00006106037,0.000007963845,0.00041683184,0.00001552065,0.00029375765,0.000085797874,0.00011649493,7.3497097e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011051767,0.000058064805,0.004764531,0.0000017105855,0.0000046180508,0.0000105764475,0.0008044983,0.5995221,0.00021904247,0.19570391,0.00010062305,0.19879925],"study_design_scores_gemma":[0.00026400253,0.000047602152,0.002266424,0.000032460575,9.141135e-7,0.0000034528243,0.000012619368,0.9970526,0.00010862933,0.000049646493,0.00006580189,0.000095812444],"about_ca_topic_score_codex":0.0000027657343,"about_ca_topic_score_gemma":0.000026262345,"teacher_disagreement_score":0.93242925,"about_ca_system_score_codex":0.000018423116,"about_ca_system_score_gemma":0.0000135076925,"threshold_uncertainty_score":0.24899696},"labels":[],"label_agreement":null},{"id":"W2147692531","doi":"10.1109/cwit.2011.5872130","title":"Soliton-like network coding for a single relay","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Computer science; Linear network coding; Luby transform code; Decoding methods; Binary erasure channel; Computer network; Coding (social sciences); Theoretical computer science; Relay; Binary number; Algorithm; Block code; Channel (broadcasting); Linear code; Channel capacity; Mathematics; Network packet; Arithmetic","score_opus":0.12749797274439495,"score_gpt":0.27954084372834365,"score_spread":0.1520428709839487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147692531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023347262,0.00026077934,0.8983124,0.00033449125,0.00047565636,0.00017169396,1.9710296e-7,0.00022449867,0.099986844],"genre_scores_gemma":[0.6920772,0.00010492014,0.30441853,0.0013396451,0.0001216376,0.00004169559,0.0000016178933,0.00000904185,0.0018857188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920976,0.00005446009,0.00017281913,0.00022167804,0.00007331067,0.0002679528],"domain_scores_gemma":[0.9990253,0.00014398283,0.000051947267,0.0006054985,0.000103963794,0.00006934633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032975158,0.000090038295,0.000105997744,0.000032193853,0.00027493265,0.00008218757,0.0008106205,0.000035922625,0.000073592324],"category_scores_gemma":[0.000027839713,0.00008019309,0.00005834712,0.0002632755,0.00002607606,0.00027139654,0.0003377062,0.0000735621,0.000037426165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091645325,0.00008324913,0.00022925566,0.000004917095,0.000018730154,0.0000014415195,0.0016481421,0.000087355074,0.0011928949,0.9209276,0.025881402,0.049915858],"study_design_scores_gemma":[0.0013733817,0.00055948645,0.0011380449,0.00013447712,0.000019845244,0.000037764385,0.00009863393,0.57110846,0.012023467,0.019843232,0.392658,0.0010052101],"about_ca_topic_score_codex":0.0000029352523,"about_ca_topic_score_gemma":0.00001974064,"teacher_disagreement_score":0.90108436,"about_ca_system_score_codex":0.000026289483,"about_ca_system_score_gemma":0.000025320503,"threshold_uncertainty_score":0.32701793},"labels":[],"label_agreement":null},{"id":"W2147723211","doi":"10.1109/vetecf.2004.1400487","title":"Maximum-likelihood detection for distributed space-time block coding","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm; Fading; Viterbi algorithm; Channel (broadcasting); Block (permutation group theory); Coding (social sciences); Maximum likelihood; Channel code; Block code; Decoding methods; Maximum likelihood sequence estimation; Quadratic equation; Estimation theory; Mathematics; Telecommunications; Statistics","score_opus":0.02124959406197535,"score_gpt":0.2580054594115522,"score_spread":0.23675586534957682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147723211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031807425,0.00011796252,0.9883151,0.0053869565,0.00010496993,0.00023631832,0.000003115493,0.00034989437,0.0023049314],"genre_scores_gemma":[0.94043064,0.00008616715,0.058263704,0.00038579098,0.00012710801,0.00003737954,0.000008765314,0.00000782509,0.0006526324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991871,0.000048791262,0.00017560297,0.00023774209,0.000104241,0.00024648564],"domain_scores_gemma":[0.9991034,0.00013622154,0.00005503513,0.00048267387,0.00014213228,0.00008050231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025949968,0.00010741535,0.000114451985,0.00006019287,0.0003132965,0.00016095946,0.0005485684,0.000043354103,0.000053626918],"category_scores_gemma":[0.000053064978,0.00010042958,0.000064939384,0.00032607088,0.000016335674,0.00034239952,0.0002134993,0.000087787994,0.00014285767],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013157374,0.00010163374,0.00003249623,0.000006629918,0.000028778057,4.954989e-7,0.00028540415,0.000632159,0.042855605,0.028929474,0.00908136,0.9180328],"study_design_scores_gemma":[0.0005057848,0.00006134564,0.00018241124,0.000011973724,0.00000512767,0.000007926717,0.000009570685,0.81278366,0.039063625,0.00091733795,0.14625709,0.00019416354],"about_ca_topic_score_codex":0.000001548379,"about_ca_topic_score_gemma":0.000051438623,"teacher_disagreement_score":0.9372499,"about_ca_system_score_codex":0.000082483246,"about_ca_system_score_gemma":0.000026007743,"threshold_uncertainty_score":0.40953994},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.042511453987379835,"score_gpt":0.2898647024568767,"score_spread":0.24735324846949686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147730843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033150014,0.0027843511,0.95715064,0.0028294898,0.000083682906,0.00029271792,9.423341e-7,0.000050056937,0.0036580807],"genre_scores_gemma":[0.9612973,0.005458898,0.03297414,0.00017555867,0.000027616417,0.000013276676,0.00001224285,0.000012007378,0.000028977338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977291,0.00079395226,0.0008153667,0.00020071701,0.00019937346,0.00026148045],"domain_scores_gemma":[0.99700475,0.000816589,0.00033113203,0.0011747202,0.00057009194,0.0001027237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016300555,0.0001587841,0.0002518706,0.00058830203,0.00039584117,0.00021474954,0.0013135888,0.00010303471,0.000007845084],"category_scores_gemma":[0.00022778014,0.0001578669,0.000035827085,0.002274961,0.00016292586,0.0006356115,0.0002447254,0.0010136802,0.0000011356918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024283163,0.00037732502,0.00088278536,0.0000035836385,0.000023669072,0.0000058290975,0.0025883499,0.9309969,0.0018395494,0.056232207,0.00018697041,0.0068385657],"study_design_scores_gemma":[0.0008604464,0.00016848296,0.014055353,0.0003685874,0.000008148773,0.000049244078,0.00085972284,0.98085845,0.000963067,0.00036237427,0.0011813812,0.0002647286],"about_ca_topic_score_codex":0.000015953021,"about_ca_topic_score_gemma":0.0008076815,"teacher_disagreement_score":0.92814726,"about_ca_system_score_codex":0.00017040469,"about_ca_system_score_gemma":0.00023480633,"threshold_uncertainty_score":0.6437625},"labels":[],"label_agreement":null},{"id":"W2148142964","doi":"10.1109/iwcmc.2011.5982640","title":"Performance of power allocation schemes in a two-hop AF relay system with faded direct link","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Rayleigh fading; Hop (telecommunications); Wireless; Transmitter power output; Computer science; Transceiver; Computer network; Power (physics); Bit error rate; Efficient energy use; Fading; Electronic engineering; Telecommunications; Electrical engineering; Engineering; Physics; Channel (broadcasting); Transmitter","score_opus":0.03568509546175597,"score_gpt":0.2521804319806372,"score_spread":0.21649533651888125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148142964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6945857,0.00037567518,0.11983773,0.0003193033,0.00011183702,0.0003282793,2.1245135e-7,0.00024253617,0.18419877],"genre_scores_gemma":[0.971955,0.00008373359,0.027591582,0.000052217238,0.0000065376216,0.00001853499,6.208531e-7,0.0000041777503,0.00028761983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992669,0.00008504644,0.0002135117,0.0001772443,0.00013458417,0.00012268225],"domain_scores_gemma":[0.9991059,0.00003796025,0.000084203806,0.00058530504,0.00015525316,0.000031385818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003380222,0.000084937456,0.00013283224,0.00009670603,0.000053373406,0.000019913736,0.0005514312,0.000024462395,0.00002410294],"category_scores_gemma":[0.000010826685,0.00006332555,0.000018053757,0.0005093071,0.00003271931,0.00033660996,0.00015350553,0.000103703285,0.000016522845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002196595,0.00042934873,0.11314076,0.00019050231,0.00010369041,0.000010254399,0.02853751,0.0022450192,0.010107697,0.7308837,0.00026972927,0.11386214],"study_design_scores_gemma":[0.0013739836,0.00038949377,0.04701385,0.0006752082,0.000006664315,0.00001488877,0.00035386882,0.9036668,0.044616196,0.000009906262,0.0014612585,0.00041786933],"about_ca_topic_score_codex":0.000027933813,"about_ca_topic_score_gemma":0.00011257327,"teacher_disagreement_score":0.9014218,"about_ca_system_score_codex":0.000038476806,"about_ca_system_score_gemma":0.000050598337,"threshold_uncertainty_score":0.25823408},"labels":[],"label_agreement":null},{"id":"W2148319331","doi":"10.1109/glocom.2009.5425891","title":"Exact Capacity Analysis of Rate Adaptive Power Nonadaptive Multibranch Multihop Decode-and-Forward Relaying Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Rayleigh fading; Ergodic theory; Topology (electrical circuits); Computer science; Fading; Channel capacity; Hop (telecommunications); Outage probability; Transmission (telecommunications); Channel (broadcasting); Coding (social sciences); Linear network coding; Link adaptation; Power (physics); Algorithm; Mathematics; Telecommunications; Computer network; Network packet; Physics; Combinatorics; Statistics","score_opus":0.03402420250025185,"score_gpt":0.2678358612516618,"score_spread":0.23381165875140997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148319331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08006843,0.00038731095,0.9139635,0.000441491,0.00006858884,0.00018378379,0.0000023848131,0.00010699759,0.0047775405],"genre_scores_gemma":[0.95183897,0.00048380898,0.046873994,0.0006252964,0.00001223412,0.000005787151,0.0000035468881,0.0000060691295,0.00015030908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826545,0.00033685943,0.00043181126,0.00046340076,0.00019445545,0.00030802257],"domain_scores_gemma":[0.99803376,0.000505555,0.0002082022,0.0008045121,0.00030376032,0.0001441844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069369865,0.00022061147,0.00047224032,0.0003200036,0.00025216409,0.000088960995,0.000705794,0.00009147305,0.00005890239],"category_scores_gemma":[0.00008096889,0.00019193125,0.0001838385,0.0018481719,0.00008965881,0.0005658835,0.00028323403,0.00027642117,0.00000416909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022498514,0.000595823,0.012776534,0.0000072242797,0.0027658916,0.000016230859,0.014999364,0.15723874,0.0057884105,0.44077376,0.000750225,0.36406282],"study_design_scores_gemma":[0.00034506732,0.00010896188,0.08320764,0.000020488123,0.00008221456,0.000001161529,0.00007643925,0.91513836,0.0004820237,0.00016936233,0.0001419437,0.00022633774],"about_ca_topic_score_codex":0.000048136382,"about_ca_topic_score_gemma":0.00022965661,"teacher_disagreement_score":0.8717705,"about_ca_system_score_codex":0.000056202232,"about_ca_system_score_gemma":0.00003312191,"threshold_uncertainty_score":0.78267294},"labels":[],"label_agreement":null},{"id":"W2148325081","doi":"10.1109/siu.2009.5136545","title":"Performance analysis of relay systems under cascaded Nakagami channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nakagami distribution; Pairwise error probability; Relay; Computer science; Pairwise comparison; Topology (electrical circuits); Probability of error; Outage probability; Algorithm; Relay channel; Probability distribution; Electronic engineering; Telecommunications; Fading; Mathematics; Statistics; Power (physics); Engineering; Decoding methods; Physics; Artificial intelligence; Combinatorics","score_opus":0.04334153265930245,"score_gpt":0.2791319344207889,"score_spread":0.2357904017614864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148325081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31302452,0.0011164364,0.66006577,0.0018235409,0.00026839436,0.00016914216,5.762106e-7,0.00018991777,0.023341713],"genre_scores_gemma":[0.99602896,0.00044256542,0.0015956784,0.00036347096,0.000015830648,0.000003018267,0.000002202554,0.0000018806714,0.0015463858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992084,0.00008153402,0.00023935483,0.00017271088,0.00016235118,0.00013564812],"domain_scores_gemma":[0.99898154,0.000057167763,0.000083892,0.00069594744,0.0001341048,0.000047344733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002802151,0.00007916041,0.00020587872,0.00024252187,0.00009701383,0.000064878535,0.0007065109,0.000034710734,0.000024187118],"category_scores_gemma":[0.000008427663,0.00006468913,0.00007366616,0.0018070732,0.000018149807,0.00025769282,0.000103444894,0.00007592067,0.000012371373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000827642,0.00017540353,0.0020689177,0.000014001515,0.00057482,0.0000020422578,0.0022757698,0.40499175,0.0038624045,0.5223744,0.0017800794,0.061872132],"study_design_scores_gemma":[0.0000903537,0.00004684662,0.016765852,0.000014440643,0.000033781613,0.0000015465916,0.000025921318,0.98159873,0.0006300298,0.000018361325,0.00068196165,0.00009215752],"about_ca_topic_score_codex":0.000006159434,"about_ca_topic_score_gemma":0.0000063611124,"teacher_disagreement_score":0.68300444,"about_ca_system_score_codex":0.000027619459,"about_ca_system_score_gemma":0.000021200512,"threshold_uncertainty_score":0.2637946},"labels":[],"label_agreement":null},{"id":"W2148399796","doi":"10.1109/icassp.2012.6288520","title":"Polynomial-time DC (POTDC) for sum-rate maximization in two-way AF MIMO relaying","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Maximization; Mathematical optimization; Linearization; MIMO; Mathematics; Relaxation (psychology); Polynomial; Time complexity; Convex optimization; Regular polygon; Algorithm","score_opus":0.04301937147864004,"score_gpt":0.295465347318396,"score_spread":0.252445975839756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148399796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04096214,0.000767537,0.9284039,0.0036856174,0.0005366391,0.0005873304,0.0000014468802,0.00027536848,0.024779985],"genre_scores_gemma":[0.93925685,0.00012192246,0.05709541,0.00081825495,0.000113098664,0.000048226648,0.000009358111,0.000012317351,0.0025245817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892867,0.00017606458,0.0002607667,0.00020985873,0.000084231295,0.00034043918],"domain_scores_gemma":[0.9989597,0.000264833,0.000073632225,0.0005316317,0.00008231191,0.00008789184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008937475,0.000118177515,0.00014296282,0.0001285051,0.00018340933,0.0001250764,0.00059476786,0.00003755559,0.000098107645],"category_scores_gemma":[0.00009543969,0.00011098421,0.000046362948,0.00045397985,0.000019817593,0.0008536623,0.00029359665,0.00010307891,0.00012606336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012302607,0.0007965268,0.032051694,0.00005076899,0.00007990147,0.0000034014613,0.010719008,0.007354286,0.09238616,0.28621402,0.08055786,0.48966333],"study_design_scores_gemma":[0.0019884484,0.000057972993,0.011494018,0.00006497892,0.00000847149,0.000006755443,0.00006351683,0.8985781,0.011568643,0.0003020888,0.07527073,0.0005962682],"about_ca_topic_score_codex":0.000014702631,"about_ca_topic_score_gemma":0.000066392124,"teacher_disagreement_score":0.8982947,"about_ca_system_score_codex":0.00007333693,"about_ca_system_score_gemma":0.000036181944,"threshold_uncertainty_score":0.45258048},"labels":[],"label_agreement":null},{"id":"W2148489950","doi":"10.1109/vetecf.2004.1400489","title":"Super-orthogonal space-time trellis coded cooperative diversity systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise error probability; Space–time trellis code; Trellis (graph); Computer science; Code (set theory); Antenna diversity; Theoretical computer science; Algorithm; Diversity gain; Spectral efficiency; Wireless; Cooperative diversity; Block code; Monte Carlo method; Wireless network; Fading; Mathematics; Telecommunications; Error floor; Decoding methods; Channel (broadcasting); Statistics","score_opus":0.03244459074918129,"score_gpt":0.24662232941336762,"score_spread":0.21417773866418632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148489950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076983675,0.0019413616,0.77841824,0.012660068,0.0004516674,0.0006386859,0.000011920917,0.00090441253,0.12798998],"genre_scores_gemma":[0.97456706,0.00033460854,0.0070220144,0.00067003345,0.000115258365,0.00000948962,0.000008341605,0.0000067674177,0.017266445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987282,0.0002319222,0.00020166952,0.00032895725,0.00025841326,0.00025083797],"domain_scores_gemma":[0.99873257,0.00017569556,0.000048753784,0.0006606635,0.00024504066,0.00013727385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031663608,0.0001586091,0.00020151857,0.000077793615,0.00070453726,0.00023824177,0.0011064366,0.00005419191,0.00043706706],"category_scores_gemma":[0.000030442625,0.00013720438,0.000063445405,0.00042474334,0.00006277243,0.0006925855,0.0014340865,0.00016233584,0.00073871954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020565023,0.0003033218,0.002178325,0.0000078646235,0.00010541116,0.000011459089,0.006251371,0.009521947,0.0027634068,0.8749641,0.068823576,0.03504862],"study_design_scores_gemma":[0.0006353752,0.00007605613,0.0010362662,0.000024277444,0.000007980949,0.00001624072,0.00009772154,0.88170063,0.0012633037,0.000038258404,0.114718184,0.00038567538],"about_ca_topic_score_codex":0.000019224697,"about_ca_topic_score_gemma":0.00009456158,"teacher_disagreement_score":0.89758337,"about_ca_system_score_codex":0.00009015509,"about_ca_system_score_gemma":0.000058805803,"threshold_uncertainty_score":0.9494992},"labels":[],"label_agreement":null},{"id":"W2148633200","doi":"10.1109/glocom.2009.5425248","title":"Performance of Orthogonal Wireless Relay Networks with Multiple SNR-Thresholds and Multiple Hard-Decision Detections","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Computer science; Cooperative diversity; Erasure; Diversity combining; Wireless; Wireless network; Computer network; Signal-to-noise ratio (imaging); Antenna diversity; Relay channel; Algorithm; Telecommunications; Decoding methods; Fading; Power (physics)","score_opus":0.020177985985444735,"score_gpt":0.23808807930228698,"score_spread":0.21791009331684225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148633200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6185708,0.0002799317,0.3801932,0.00016705642,0.000049907296,0.000113344715,4.047054e-7,0.00007987396,0.00054547115],"genre_scores_gemma":[0.95155734,0.001238248,0.046843566,0.00018145677,0.000024691406,0.000005293711,0.0000018763841,0.000006007574,0.00014149814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990146,0.000052395317,0.00025225052,0.00028934356,0.00019106064,0.00020031635],"domain_scores_gemma":[0.9987737,0.0002583922,0.0000881652,0.00061529904,0.00017330999,0.000091137954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024930015,0.00013776805,0.00017496123,0.000090415546,0.00033365467,0.000073380244,0.00047756085,0.00005910748,0.000013442573],"category_scores_gemma":[0.000027508311,0.00010590096,0.00003409668,0.0005206845,0.00007202845,0.00043206188,0.00018966867,0.00019930901,0.0000030993824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014456444,0.00016410416,0.17108534,0.000006159893,0.000021685295,0.0000025157058,0.0003547691,0.05100681,0.0024467204,0.0048561217,0.00033679442,0.7695744],"study_design_scores_gemma":[0.00056538515,0.00025434163,0.17006485,0.000058752423,0.000003227464,0.000019811032,0.000010109188,0.8276879,0.000650463,0.000011737445,0.0005411307,0.00013230616],"about_ca_topic_score_codex":0.0000039207926,"about_ca_topic_score_gemma":0.00015983752,"teacher_disagreement_score":0.77668107,"about_ca_system_score_codex":0.000020353335,"about_ca_system_score_gemma":0.000032604356,"threshold_uncertainty_score":0.4318516},"labels":[],"label_agreement":null},{"id":"W2148741658","doi":"10.1109/twc.2009.12.090684","title":"Resource Allocation and Relay Selection for Collaborative Communications","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Resource (disambiguation); Computer network; Channel (broadcasting); Protocol (science); Bandwidth (computing); Artificial intelligence","score_opus":0.04743901978146337,"score_gpt":0.3026921015179036,"score_spread":0.25525308173644023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148741658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010797017,0.0008606923,0.9567896,0.037743792,0.0000794725,0.0009088174,0.000021379987,0.00042698524,0.0020895274],"genre_scores_gemma":[0.880722,0.0066648484,0.110563464,0.0011715357,0.000017306904,0.00045241902,0.000032843593,0.000018856132,0.00035674602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980794,0.00055297633,0.00047634932,0.00041772498,0.00019340675,0.00028013208],"domain_scores_gemma":[0.9942698,0.0009729762,0.00020039084,0.0038689666,0.0005448762,0.00014301248],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005269902,0.00024735098,0.00025353578,0.00030057447,0.002422361,0.00026538593,0.0027609766,0.00013566513,0.000005564633],"category_scores_gemma":[0.000025577136,0.0002733481,0.000096906086,0.0013719522,0.0002611052,0.0006556897,0.00004134178,0.0005227603,0.000015157312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038028174,0.0007591909,0.000012098214,0.000008474921,0.00007055027,9.4752224e-8,0.0026381363,0.0026743736,0.0060977456,0.43519247,0.0010634047,0.5514454],"study_design_scores_gemma":[0.001313501,0.0005581897,0.00041608184,0.0001374938,0.00006884481,0.000020066926,0.00038531196,0.8883583,0.007200856,0.0018846089,0.099006236,0.0006505365],"about_ca_topic_score_codex":0.000007807421,"about_ca_topic_score_gemma":0.00028903666,"teacher_disagreement_score":0.8856839,"about_ca_system_score_codex":0.00015624751,"about_ca_system_score_gemma":0.00014553995,"threshold_uncertainty_score":0.99997187},"labels":[],"label_agreement":null},{"id":"W2148969447","doi":"10.1109/glocom.2009.5426200","title":"MMSE Relaying and Power Allocation over Frequency-Selective Rayleigh Fading Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Rayleigh fading; Relay; Fading; Channel state information; Transmitter power output; Multipath propagation; Telecommunications link; Interference (communication); Computer network; Wireless; Channel (broadcasting); Signal-to-noise ratio (imaging); Electronic engineering; Telecommunications; Power (physics); Transmitter; Engineering","score_opus":0.02419433267567352,"score_gpt":0.2714732752994791,"score_spread":0.2472789426238056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148969447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10681856,0.0014501014,0.8168823,0.0061669615,0.00029203529,0.00031543794,2.3781712e-7,0.0004021595,0.067672186],"genre_scores_gemma":[0.9836695,0.0003214702,0.013895033,0.0016729196,0.000030104704,0.000006088039,0.0000010840482,0.000004269421,0.0003995365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915975,0.0000850673,0.00016060691,0.0002815629,0.00012377986,0.00018923676],"domain_scores_gemma":[0.9992886,0.00008358828,0.000053642147,0.00039089748,0.000112992944,0.00007025793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026399604,0.000111567075,0.000107126856,0.000097256954,0.00027645985,0.00019095742,0.00039357226,0.000045341043,0.000041470845],"category_scores_gemma":[0.000051531202,0.00010185871,0.00002594575,0.000428569,0.000021769518,0.0007134099,0.0001239331,0.00014601779,0.000015712687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056586578,0.000072826144,0.001017734,0.0000023859186,0.00002259061,0.0000045023853,0.0065964325,0.00019262907,0.029132286,0.8537905,0.002184077,0.10697838],"study_design_scores_gemma":[0.0034849881,0.0012943886,0.18826412,0.00039306073,0.00003427232,0.00013627172,0.00041818427,0.63058186,0.041454162,0.11674434,0.014425781,0.0027685682],"about_ca_topic_score_codex":0.0000055162577,"about_ca_topic_score_gemma":0.0000068786267,"teacher_disagreement_score":0.87685096,"about_ca_system_score_codex":0.000056230565,"about_ca_system_score_gemma":0.000028633105,"threshold_uncertainty_score":0.41536778},"labels":[],"label_agreement":null},{"id":"W2149024062","doi":"10.1109/tcomm.2013.022713.120129","title":"Relay Beamforming Designs in Multi-User Wireless Relay Networks Based on Throughput Maximin Optimization","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Beamforming; Relay; Mathematical optimization; Computer science; Optimization problem; Wireless; Computational complexity theory; Convex optimization; Minimax; Wireless network; Algorithm; Mathematics; Regular polygon; Telecommunications","score_opus":0.08093831440962014,"score_gpt":0.2975022704308457,"score_spread":0.21656395602122558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149024062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041770856,0.0001562437,0.99158335,0.005071633,0.0002566014,0.0008297016,0.0000038074033,0.00032727496,0.0013536658],"genre_scores_gemma":[0.69408727,0.0015987651,0.30220953,0.000997351,0.0000102172135,0.0005907227,0.000016296222,0.00003301083,0.00045684143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974898,0.0007426229,0.0006243554,0.00046734567,0.00026257226,0.00041330853],"domain_scores_gemma":[0.9944469,0.0009919067,0.0001773378,0.0039936393,0.0002481677,0.00014206606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050808967,0.0003057033,0.00027381652,0.00044152688,0.0010899322,0.0002711071,0.0027578464,0.00019077261,0.00012947772],"category_scores_gemma":[0.00002121394,0.0003173599,0.00013575531,0.0015379323,0.00015640854,0.0009532352,0.000044368768,0.0010242639,0.00013143751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073558786,0.0006320447,0.000033987046,0.0000030961621,0.000014141507,5.887329e-7,0.00047328937,0.96165276,0.00009701541,0.0022344552,0.00014869479,0.03470256],"study_design_scores_gemma":[0.0007995874,0.00009140409,0.00026827832,0.00016197779,0.00001119271,0.000002927738,0.000067306304,0.99666035,0.00039937109,0.000025799643,0.0011784788,0.00033332457],"about_ca_topic_score_codex":0.00008364786,"about_ca_topic_score_gemma":0.0005022457,"teacher_disagreement_score":0.69366956,"about_ca_system_score_codex":0.00028824375,"about_ca_system_score_gemma":0.00011689848,"threshold_uncertainty_score":0.9999278},"labels":[],"label_agreement":null},{"id":"W2149242672","doi":"10.1109/icc.2009.5198765","title":"Asymptotic Analysis and Design of Multiuser Cooperative DS-CDMA Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Institut National de la Recherche Scientifique","funders":"","keywords":"Code division multiple access; Relay; Computer science; Interference (communication); Expression (computer science); Asymptotic analysis; Signal-to-noise ratio (imaging); Noise (video); Signal-to-interference-plus-noise ratio; Noise power; Code (set theory); Simple (philosophy); Power (physics); Computer network; Topology (electrical circuits); Telecommunications; Mathematics; Combinatorics; Channel (broadcasting); Physics","score_opus":0.04172020164450252,"score_gpt":0.2790152967852925,"score_spread":0.23729509514079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149242672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005725316,0.0007529229,0.9912134,0.00040229526,0.000032077893,0.00017017136,3.411148e-7,0.00005929765,0.0016441948],"genre_scores_gemma":[0.9695882,0.00035209255,0.029381085,0.00017917962,0.000008151718,0.000004563154,9.630357e-7,0.0000019483482,0.00048380264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990921,0.00024753204,0.00022097222,0.00020446932,0.00011900796,0.00011592493],"domain_scores_gemma":[0.99898475,0.00018859355,0.00006788778,0.0004926203,0.00020809943,0.00005801738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032488903,0.00009349694,0.00022576642,0.00016668819,0.00010480908,0.000118577336,0.0004263186,0.000029632236,0.00001759701],"category_scores_gemma":[0.000037455076,0.00007320004,0.000036930876,0.0010689117,0.00003462812,0.0002489581,0.00010416978,0.00006199224,0.000005637656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029767087,0.00041883346,0.005082533,0.000018393228,0.0009689194,0.0000086201035,0.006430121,0.14570045,0.026714839,0.686663,0.002095425,0.12586911],"study_design_scores_gemma":[0.0002070105,0.00010564817,0.00953037,0.0000135581195,0.000037103655,0.0000019919544,0.00003809919,0.98806065,0.0016592472,0.000051469353,0.00017907663,0.0001157592],"about_ca_topic_score_codex":0.000010125387,"about_ca_topic_score_gemma":0.000010944746,"teacher_disagreement_score":0.9638629,"about_ca_system_score_codex":0.000015275044,"about_ca_system_score_gemma":0.000025208421,"threshold_uncertainty_score":0.2985011},"labels":[],"label_agreement":null},{"id":"W2149307513","doi":"10.1109/glocom.2009.5425486","title":"Performance Analysis and Enhancement of Cooperative Retransmission Strategy for Delay-Sensitive Real-Time Services","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"","keywords":"Retransmission; Computer science; Computer network; Performance metric; Quality of service; Relay; Network packet; Transmission delay; Broadcasting (networking); Transmission (telecommunications); Wireless network; Wireless; Power (physics); Telecommunications","score_opus":0.021817728060372403,"score_gpt":0.2824924696521051,"score_spread":0.2606747415917327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149307513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4312989,0.00015123002,0.55945337,0.00050778507,0.000012233254,0.00026753702,0.0000021867882,0.00004775713,0.008258988],"genre_scores_gemma":[0.9717335,0.0022196455,0.025331166,0.00017069632,0.0000076359975,0.000005686303,0.0000117499085,0.0000021158162,0.0005178109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992085,0.000067460314,0.00023972456,0.00023882189,0.000113157665,0.00013231185],"domain_scores_gemma":[0.9991276,0.000086350636,0.000086316104,0.00031961876,0.00032368032,0.000056381825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002632977,0.00010593991,0.00022400988,0.000110606066,0.00016498864,0.000054272106,0.00027383736,0.000033639164,0.000031920696],"category_scores_gemma":[0.0000034436805,0.00008480883,0.000048349502,0.0006521154,0.000027027649,0.0003199166,0.000057659083,0.000047070716,0.0000021072997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015863414,0.0002883666,0.00075118325,0.00006924125,0.00049570604,0.0000017793035,0.0072360043,0.0030413033,0.34140328,0.034902733,0.000249061,0.6114027],"study_design_scores_gemma":[0.00027232408,0.00049499003,0.009129657,0.000038741175,0.000047399644,9.3542883e-7,0.000057256428,0.8902337,0.09942762,0.00005772805,0.000107723914,0.00013194678],"about_ca_topic_score_codex":0.000010074322,"about_ca_topic_score_gemma":0.000025104315,"teacher_disagreement_score":0.88719237,"about_ca_system_score_codex":0.000015867916,"about_ca_system_score_gemma":0.000029479459,"threshold_uncertainty_score":0.3458404},"labels":[],"label_agreement":null},{"id":"W2149501120","doi":"10.1109/iccw.2013.6649300","title":"Optimized packet size for energy efficient cooperative wireless ad-hoc networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless ad hoc network; Network packet; Efficient energy use; Energy consumption; Optimization problem; Mathematical optimization; Performance metric; Wireless sensor network; Metric (unit); Wireless; Convergence (economics); Wireless network; Computer network; Distributed computing; Algorithm; Mathematics; Telecommunications; Engineering","score_opus":0.020153834360337294,"score_gpt":0.25183540057247983,"score_spread":0.23168156621214253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149501120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019491914,0.0010889249,0.9894046,0.0027551155,0.00030135308,0.000496442,0.0000010335218,0.0002600263,0.0037432925],"genre_scores_gemma":[0.8806465,0.0020393129,0.107249744,0.0037428138,0.00009269793,0.0006226597,0.000011298211,0.000024415911,0.005570511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985046,0.00019704887,0.00031879192,0.0004227994,0.00015565715,0.00040109688],"domain_scores_gemma":[0.99746174,0.0009179153,0.00009048213,0.0008379606,0.0005320226,0.00015991216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002748889,0.0002136629,0.00027084938,0.000048055397,0.00039800708,0.00039816886,0.0011293533,0.00007803123,0.0003698693],"category_scores_gemma":[0.00007088076,0.00017088033,0.00010280541,0.00046080706,0.00007035315,0.00028208757,0.00050351984,0.00012527338,0.00004409408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004243549,0.00024872643,0.000007627735,0.0000056910208,0.000077206285,0.000001355186,0.00085819577,0.1133096,0.0008664608,0.41617456,0.05291834,0.4154898],"study_design_scores_gemma":[0.0009229849,0.0000924261,0.00005259511,0.000017781193,0.0000035969442,0.000002041232,0.000045051875,0.9796256,0.00064906565,0.00016369374,0.018171828,0.00025335918],"about_ca_topic_score_codex":0.000006260418,"about_ca_topic_score_gemma":0.000022984977,"teacher_disagreement_score":0.8821549,"about_ca_system_score_codex":0.00005557102,"about_ca_system_score_gemma":0.00006479284,"threshold_uncertainty_score":0.6968298},"labels":[],"label_agreement":null},{"id":"W2149768747","doi":"10.1109/cwit.2007.375713","title":"Decomposition of the MIMO X Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transmitter; MIMO; Computer science; Channel (broadcasting); Multiplexing; Antenna (radio); Topology (electrical circuits); Electronic engineering; Interference (communication); Computer network; Telecommunications; Engineering; Electrical engineering","score_opus":0.03385045994699455,"score_gpt":0.30658378174938533,"score_spread":0.2727333218023908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149768747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02729268,0.00010193319,0.9428179,0.0017852501,0.00022420748,0.000058040692,4.6759514e-8,0.000033677807,0.027686235],"genre_scores_gemma":[0.99034446,0.00002332519,0.008776627,0.0004657364,0.000015955675,6.8715747e-7,1.296638e-7,9.868656e-7,0.00037211017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968857,0.000030151452,0.00009111879,0.00005676354,0.000069209185,0.00006421021],"domain_scores_gemma":[0.99948096,0.00005620661,0.00003071997,0.00036169976,0.000054520504,0.000015886355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026726836,0.000027010326,0.000033346707,0.000020859095,0.00007726217,0.000016846783,0.0005757666,0.000011223327,0.000019614665],"category_scores_gemma":[0.000008345702,0.0000171775,0.000025202135,0.0002521554,0.000018246385,0.00008363936,0.00022317572,0.000037579735,0.0000070684214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020661143,0.000046654997,0.0007617927,0.0000021225906,0.000005808024,2.8880157e-7,0.0007804444,0.00009012337,0.019571014,0.8290429,0.0016397845,0.14805701],"study_design_scores_gemma":[0.00066649093,0.00009715342,0.09407278,0.000094056486,0.0000056125814,0.000020786443,0.00009042148,0.1498833,0.6947367,0.008134516,0.051859245,0.0003389221],"about_ca_topic_score_codex":0.0000017566498,"about_ca_topic_score_gemma":0.000019822866,"teacher_disagreement_score":0.96305174,"about_ca_system_score_codex":0.0000085012725,"about_ca_system_score_gemma":0.000008485941,"threshold_uncertainty_score":0.10699272},"labels":[],"label_agreement":null},{"id":"W2149847268","doi":"10.1109/spawc.2009.5161785","title":"An SNR balancing approach to two-way relaying","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"","keywords":"Transceiver; Relay; Beamforming; Computer science; Transmitter power output; Bandwidth (computing); Power (physics); Channel (broadcasting); Topology (electrical circuits); Computer network; Wireless; Telecommunications; Electrical engineering; Transmitter; Engineering","score_opus":0.03977387314675308,"score_gpt":0.30005445197888975,"score_spread":0.2602805788321367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149847268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068589374,0.00007060298,0.8358854,0.0014885507,0.000058943933,0.00009587541,5.4482e-8,0.00025853614,0.15528312],"genre_scores_gemma":[0.77047336,0.0000151268305,0.22515634,0.0039620334,0.00004423234,0.000004178448,0.0000011339578,0.0000029211305,0.00034067937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914926,0.00009373821,0.00014330159,0.00028000187,0.00013092763,0.00020275846],"domain_scores_gemma":[0.9988566,0.000030683444,0.0000239787,0.0008853184,0.00006453764,0.00013889157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003592034,0.00008907224,0.00009647881,0.000074561314,0.00022602345,0.00022006706,0.0010806854,0.000020741258,0.000014847427],"category_scores_gemma":[0.000019868025,0.00007836166,0.000025447078,0.00050649844,0.000006814921,0.00045931927,0.0001571288,0.00011571448,0.000060344344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019126949,0.00010517232,0.00020658059,9.1595024e-7,0.0000029892826,0.000001075469,0.0018633314,0.0028419106,0.008182054,0.58527094,0.0019185008,0.39960465],"study_design_scores_gemma":[0.00033849443,0.0001509484,0.008901586,0.000021125488,0.000002028392,0.000014674081,0.00010241535,0.97646743,0.0019358288,0.001177963,0.010521088,0.00036640154],"about_ca_topic_score_codex":0.000003375857,"about_ca_topic_score_gemma":0.000006099432,"teacher_disagreement_score":0.97362554,"about_ca_system_score_codex":0.000033985823,"about_ca_system_score_gemma":0.000018820661,"threshold_uncertainty_score":0.3195496},"labels":[],"label_agreement":null},{"id":"W2150060124","doi":"10.1109/twc.2010.07.081669","title":"Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Node (physics); Resource allocation; Mathematical optimization; Transmission (telecommunications); Decoding methods; Selection (genetic algorithm); Algorithm; Computer network; Mathematics; Telecommunications","score_opus":0.02100030405739163,"score_gpt":0.2708555445789591,"score_spread":0.2498552405215675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150060124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1011034,0.0002272597,0.89409596,0.0033810174,0.00015380983,0.00039532437,0.000005118335,0.0001966451,0.00044148517],"genre_scores_gemma":[0.9606853,0.004328219,0.034269255,0.0002739034,0.000016200556,0.00021246102,0.000012560182,0.000020029162,0.0001820708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983589,0.00042281928,0.000403322,0.00040713494,0.00014677868,0.00026103924],"domain_scores_gemma":[0.99750316,0.000557484,0.00010779999,0.0014767016,0.00021668874,0.00013818975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005584371,0.00022545196,0.00023712743,0.00029323797,0.0009873532,0.00023266704,0.0010688398,0.0001722672,0.000030064752],"category_scores_gemma":[0.000017031492,0.00024243443,0.000047634392,0.00096755556,0.00022383306,0.00067320873,0.000053225474,0.0011849361,0.000025252295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008886874,0.0013326945,0.00070542627,0.00001951143,0.00015357882,0.000002212925,0.0052167163,0.31190652,0.028993271,0.11831904,0.0004004001,0.53286177],"study_design_scores_gemma":[0.0004933974,0.00007968258,0.0011344781,0.000043246677,0.00001385505,0.000026663547,0.000044013355,0.995271,0.0015457105,0.000057000107,0.0010258341,0.00026511544],"about_ca_topic_score_codex":0.000036702568,"about_ca_topic_score_gemma":0.0025171842,"teacher_disagreement_score":0.8598267,"about_ca_system_score_codex":0.000069265494,"about_ca_system_score_gemma":0.00008740229,"threshold_uncertainty_score":0.9886189},"labels":[],"label_agreement":null},{"id":"W2150141845","doi":"10.1109/t-wc.2008.070748","title":"Joint Power and Channel Resource Allocation for Two-User Orthogonal Amplify-and-Forward Cooperation","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quasiconvex function; Resource allocation; Computer science; Channel (broadcasting); Relay; Mathematical optimization; Transmitter power output; Channel allocation schemes; Power (physics); Wireless; Computer network; Telecommunications; Convex optimization; Mathematics; Transmitter; Regular polygon","score_opus":0.05685337115767721,"score_gpt":0.2842363971773097,"score_spread":0.22738302601963248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150141845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016195465,0.00047131954,0.9740216,0.007850318,0.00010898774,0.0006175986,0.00002214333,0.00021709688,0.0004954371],"genre_scores_gemma":[0.97844446,0.0037369372,0.01596435,0.0008987596,0.000018911507,0.00045110518,0.00003338291,0.00002502431,0.0004270825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984807,0.0002870882,0.0004132742,0.00039556724,0.00017970281,0.00024368428],"domain_scores_gemma":[0.9971315,0.000477729,0.00012370496,0.0018150687,0.0003024909,0.00014950962],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00040045302,0.00022016576,0.00023647056,0.00021694746,0.0021543,0.00014436693,0.0008896111,0.00009849368,0.0000104511155],"category_scores_gemma":[0.000016699454,0.0002296512,0.00007797321,0.0004390431,0.00029790177,0.000521405,0.0000484179,0.00039540455,0.000012926646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016441649,0.001914897,0.0000823482,0.000065304506,0.00037242673,0.000002790542,0.018838327,0.017851545,0.023351884,0.6701058,0.0034153294,0.26383492],"study_design_scores_gemma":[0.0036737833,0.00051458273,0.0016701462,0.00020471658,0.00008147269,0.0002012367,0.0004022616,0.92464286,0.011232947,0.00084119034,0.055308264,0.0012265488],"about_ca_topic_score_codex":0.000012282595,"about_ca_topic_score_gemma":0.00018045593,"teacher_disagreement_score":0.962249,"about_ca_system_score_codex":0.00006579288,"about_ca_system_score_gemma":0.00009619278,"threshold_uncertainty_score":0.99914473},"labels":[],"label_agreement":null},{"id":"W2150317201","doi":"10.1109/ccece.2011.6030495","title":"MIMO two-way relay communication based on Alamouti code","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; MIMO; Computer science; Transmitter; Node (physics); Single antenna interference cancellation; Demodulation; Space–time code; Code (set theory); Minimum mean square error; Channel state information; Interference (communication); Antenna (radio); Channel (broadcasting); Topology (electrical circuits); Electronic engineering; Computer network; Telecommunications; Wireless; Mathematics; Engineering; Electrical engineering; Physics","score_opus":0.08738776530677397,"score_gpt":0.28991994758901085,"score_spread":0.20253218228223688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150317201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025093996,0.00018309997,0.57669795,0.0028628802,0.000120071185,0.00018295634,7.447736e-7,0.00039610296,0.4170468],"genre_scores_gemma":[0.89499986,0.00012138595,0.10087576,0.002788214,0.000010720731,0.000020663047,0.0000051150632,0.000007781119,0.0011705176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891245,0.00031266408,0.00020661467,0.0002375173,0.00015735313,0.00017341986],"domain_scores_gemma":[0.99740523,0.00018282089,0.00007293794,0.0021416794,0.000119262346,0.00007806001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048394583,0.00011695582,0.000108371605,0.000087363296,0.00027643464,0.000077619225,0.0017660656,0.00003813917,0.00038425392],"category_scores_gemma":[0.00004058681,0.00010138159,0.000050388877,0.00034873647,0.000056314693,0.0002563588,0.0003747645,0.00019916956,0.00029402107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017701457,0.0002948736,0.0013218818,0.0000028461789,0.00001260398,0.000002249695,0.0020587526,0.00056216127,0.00039504157,0.9140049,0.008568721,0.07275823],"study_design_scores_gemma":[0.0008356063,0.00012952824,0.008645057,0.00005835722,0.0000050303547,0.0000025902057,0.000029560579,0.95024616,0.005475716,0.0012818852,0.03296307,0.00032745936],"about_ca_topic_score_codex":0.00002729306,"about_ca_topic_score_gemma":0.0001883113,"teacher_disagreement_score":0.94968396,"about_ca_system_score_codex":0.00004051128,"about_ca_system_score_gemma":0.00003652899,"threshold_uncertainty_score":0.42073107},"labels":[],"label_agreement":null},{"id":"W2150407271","doi":"10.1007/s11036-011-0343-1","title":"Editorial for WICON 2010 on “Recent advances in wireless internet”","year":2011,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Cheng Kung University; Shanghai Jiao Tong University; Zhejiang University; University of Tehran; Sun Yat-sen University; Oulun Yliopisto; Sharif University of Technology; York University; Beijing University of Posts and Telecommunications; National Sun Yat-sen University","keywords":"Computer science; The Internet; Cognitive radio; Wireless network; Wireless; Computer network; Municipal wireless network; Telecommunications; Internet access; Wireless WAN; Wi-Fi array; World Wide Web","score_opus":0.025752848768045206,"score_gpt":0.27673993101943983,"score_spread":0.25098708225139466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150407271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005923181,0.0028751304,0.9887902,0.00012637209,0.0044461517,0.00096631586,0.0000019262257,0.00007432052,0.002127231],"genre_scores_gemma":[0.9506333,0.032296684,0.002033341,0.00037682094,0.008737192,0.0056515723,0.000023648803,0.000016746068,0.00023069621],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993146,0.000030871128,0.0001720493,0.00026327444,0.000061041355,0.00015817923],"domain_scores_gemma":[0.999324,0.00012035254,0.000059265043,0.0003639834,0.000077193916,0.00005515588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001625198,0.00009332224,0.000106593405,0.000043541124,0.00011536511,0.000050817154,0.00042581794,0.00005695329,0.000013388468],"category_scores_gemma":[0.0000040302875,0.00008620869,0.000022888828,0.00024573886,0.000042457104,0.00017408733,0.00013055136,0.000138908,0.0000052820355],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016304894,0.00015238803,0.00021182004,0.000003848859,0.0000037511584,6.8229454e-8,0.00015129938,0.001469001,0.000018934901,0.16869481,0.013316803,0.81596094],"study_design_scores_gemma":[0.0003141156,0.00010140019,0.00034037812,0.000021987411,0.0000021054482,4.1035446e-7,0.000015363621,0.1032725,0.00008405133,0.001337025,0.89438426,0.00012641303],"about_ca_topic_score_codex":0.000003201115,"about_ca_topic_score_gemma":0.00007388524,"teacher_disagreement_score":0.9867569,"about_ca_system_score_codex":0.000021280614,"about_ca_system_score_gemma":0.000013841056,"threshold_uncertainty_score":0.35154882},"labels":[],"label_agreement":null},{"id":"W2150513644","doi":"10.1109/tcomm.2012.051012.100594","title":"Performance Analysis of Hop-by-Hop Beamforming for Dual-Hop MIMO AF Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hop (telecommunications); Beamforming; Relay; Moment-generating function; MIMO; Fading; Cumulative distribution function; Computer science; Bit error rate; Diversity gain; Electronic engineering; Probability density function; Control theory (sociology); Topology (electrical circuits); Algorithm; Channel (broadcasting); Telecommunications; Mathematics; Engineering; Statistics; Electrical engineering","score_opus":0.050222495464122385,"score_gpt":0.30027585539856294,"score_spread":0.25005335993444056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150513644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072539477,0.0015211455,0.9875236,0.0013849472,0.0003019044,0.00039740544,0.000041032876,0.00016032082,0.0014156748],"genre_scores_gemma":[0.9421089,0.0073061064,0.04941545,0.00025198332,0.00002549379,0.00029423714,0.000051096424,0.000021222604,0.0005254971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998212,0.00026943913,0.00061079295,0.0002641677,0.0002206401,0.00042299667],"domain_scores_gemma":[0.994577,0.0010619037,0.0002613546,0.0036334095,0.00030482613,0.00016151369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008137524,0.00022561439,0.00037446962,0.00047748932,0.001223021,0.00007589609,0.0021076258,0.00012244357,0.000043718523],"category_scores_gemma":[0.000017046406,0.00023454698,0.00032759443,0.0025364903,0.00017528012,0.0008765489,0.00005219972,0.0004558135,0.000014931588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009465564,0.0036384102,0.0012773366,0.00006385035,0.0031986444,1.8186108e-7,0.0114250695,0.53143966,0.007610806,0.022164876,0.0057395063,0.413347],"study_design_scores_gemma":[0.00037036347,0.00008677829,0.00043365936,0.000049261802,0.00038941164,0.000002606157,0.0001162412,0.9741441,0.002454912,0.000012280312,0.02163966,0.00030071568],"about_ca_topic_score_codex":0.000016476282,"about_ca_topic_score_gemma":0.00015008597,"teacher_disagreement_score":0.93810815,"about_ca_system_score_codex":0.00011346787,"about_ca_system_score_gemma":0.000056528435,"threshold_uncertainty_score":0.9564549},"labels":[],"label_agreement":null},{"id":"W2150647207","doi":"10.1109/icc.2011.5963212","title":"Throughput-Optimal Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Additive white Gaussian noise; Computer science; Decodes; Channel (broadcasting); Throughput; Decoding methods; Computer network; Gaussian; Wireless; Telecommunications","score_opus":0.07317722868828552,"score_gpt":0.27912852862227755,"score_spread":0.20595129993399203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150647207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02214404,0.0002036821,0.9200721,0.00080032187,0.00014477997,0.00022462381,4.823238e-7,0.00037279894,0.05603717],"genre_scores_gemma":[0.6643706,0.0001282421,0.33365455,0.00070444,0.000040254457,0.000035532106,0.0000025550935,0.000013035991,0.0010507626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985101,0.00014447237,0.0002779228,0.00046415257,0.00022727194,0.00037608136],"domain_scores_gemma":[0.99849313,0.0000698616,0.00008907684,0.00094558013,0.0002580215,0.00014433601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003001416,0.00021944969,0.00021781797,0.000066630826,0.00045276582,0.00017799581,0.0011108668,0.000061024453,0.00054359244],"category_scores_gemma":[0.000035255092,0.0001637801,0.000055246128,0.0005503297,0.00012647016,0.0009758913,0.00059274805,0.00026229216,0.00021258846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077683224,0.00022684543,0.0032890595,0.0000061220735,0.00012415016,0.000032578537,0.010351893,0.0006051264,0.00079237705,0.9529627,0.0034668713,0.02806458],"study_design_scores_gemma":[0.002004855,0.0008682392,0.0022658708,0.000108290784,0.000025628966,0.00008528991,0.0006551085,0.9050517,0.024992973,0.0002585013,0.062450457,0.0012331029],"about_ca_topic_score_codex":0.00002810353,"about_ca_topic_score_gemma":0.00012217788,"teacher_disagreement_score":0.9527042,"about_ca_system_score_codex":0.000045928216,"about_ca_system_score_gemma":0.00012434846,"threshold_uncertainty_score":0.6678759},"labels":[],"label_agreement":null},{"id":"W2150714640","doi":"10.1109/icc.2008.238","title":"The Impact of Noise Correlation on the Single-Symbol ML Decodable Distributed STBCs","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Monomial; Upper and lower bounds; Uncorrelated; Bandwidth (computing); Mathematics; Block code; Block (permutation group theory); Algorithm; Computer science; Discrete mathematics; Combinatorics; Telecommunications; Statistics; Decoding methods; Mathematical analysis","score_opus":0.06278960456617697,"score_gpt":0.2837079914161042,"score_spread":0.22091838684992723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150714640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27560124,0.0003471525,0.7023643,0.0039498983,0.00017327821,0.00035005098,0.00000450927,0.00013102988,0.017078506],"genre_scores_gemma":[0.9986478,0.0002807061,0.00039899338,0.000109532375,0.00001539485,0.000007497073,0.000004477893,0.000003551474,0.00053206406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922675,0.0001684704,0.00018557992,0.0001168824,0.00015606385,0.00014624839],"domain_scores_gemma":[0.99809086,0.0008067952,0.000095547446,0.00081384974,0.00015626026,0.00003667818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030513867,0.00008402483,0.00008238932,0.000022813398,0.00065306737,0.00007083719,0.0008569597,0.00002463928,0.00004869137],"category_scores_gemma":[0.00016176667,0.00003939713,0.00007547655,0.00045239972,0.00008033699,0.00015382566,0.00018720464,0.00012420527,0.000034673576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012398558,0.0010114502,0.019689366,0.0000042178845,0.00020967852,0.0000062057375,0.006117362,0.06129486,0.009244811,0.54554474,0.1726766,0.18407674],"study_design_scores_gemma":[0.00032255473,0.0002737945,0.06693074,0.00002504731,0.0000035912183,0.000012543789,0.00007778457,0.9238612,0.0034224081,0.00086744176,0.004036618,0.00016626134],"about_ca_topic_score_codex":0.0000142247545,"about_ca_topic_score_gemma":0.000024804549,"teacher_disagreement_score":0.86256635,"about_ca_system_score_codex":0.00006470738,"about_ca_system_score_gemma":0.000064672975,"threshold_uncertainty_score":0.5022932},"labels":[],"label_agreement":null},{"id":"W2150872090","doi":"10.1109/glocom.2010.5683118","title":"Amplify-and-Forward Relay Selection with Outdated Channel State Information","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Selection (genetic algorithm); Relay channel; Channel (broadcasting); Outage probability; Computer science; Channel state information; Set (abstract data type); Telecommunications; Fading; Power (physics); Wireless; Artificial intelligence","score_opus":0.011766198113038286,"score_gpt":0.2313805584647883,"score_spread":0.21961436035175003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150872090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0652507,0.000013428592,0.9291765,0.0014825274,0.000109531764,0.0001437584,5.742133e-7,0.00027941796,0.0035435574],"genre_scores_gemma":[0.9768217,0.00015794371,0.021971544,0.00063013606,0.000015568816,0.000013494908,0.000008372379,0.0000032188107,0.00037801825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995235,0.000029376231,0.00012604156,0.00010259057,0.00009980476,0.000118642005],"domain_scores_gemma":[0.99944174,0.000030277786,0.000055464046,0.00025684058,0.0001564245,0.000059265334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020837165,0.00007303832,0.00006321532,0.00008042056,0.00018995158,0.00021618772,0.00025013846,0.000031504867,0.000024381012],"category_scores_gemma":[0.000018919263,0.000054432334,0.000008435732,0.00032995408,0.000024732608,0.0012854154,0.00013136814,0.00021917663,0.00005019727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004897349,0.00007172087,0.0030457228,0.00001655741,0.000056436602,8.871933e-7,0.007911242,0.0021513437,0.0062224055,0.2325322,0.0055080354,0.74243444],"study_design_scores_gemma":[0.0005798332,0.00013362472,0.007854722,0.00001115846,0.0000036108863,0.00003397943,0.000041451593,0.91220134,0.003479618,0.0003856746,0.075016394,0.00025855872],"about_ca_topic_score_codex":0.000013931441,"about_ca_topic_score_gemma":0.00023891698,"teacher_disagreement_score":0.911571,"about_ca_system_score_codex":0.000009949935,"about_ca_system_score_gemma":0.000030835952,"threshold_uncertainty_score":0.22196862},"labels":[],"label_agreement":null},{"id":"W2150968484","doi":"10.1109/icassp.2011.5947073","title":"Blind channel estimation for MPSK-based amplify-and-forward two-way relaying","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Phase-shift keying; Computer science; Channel (broadcasting); Algorithm; Benchmark (surveying); Keying; Mean squared error; Overhead (engineering); Relay; Sample (material); Bit error rate; Statistics; Telecommunications; Mathematics","score_opus":0.12259769797583574,"score_gpt":0.31419316180536283,"score_spread":0.19159546382952708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150968484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023597036,0.00011526606,0.9895424,0.0007636178,0.00011886547,0.00027001588,6.890244e-7,0.00016715635,0.006662233],"genre_scores_gemma":[0.74274254,0.000030439029,0.25623584,0.0006988884,0.000019402645,0.000057821206,0.000005030427,0.0000063830903,0.0002036686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927664,0.000051516035,0.00017956912,0.0002332444,0.00008743513,0.00017161052],"domain_scores_gemma":[0.9991233,0.00017078416,0.000066436354,0.00045478588,0.000111274,0.00007341739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040441123,0.000100327146,0.00010703619,0.00009023256,0.00027568627,0.00009974391,0.00045078844,0.000038035236,0.000034933237],"category_scores_gemma":[0.000061846644,0.00008851667,0.000036635036,0.00020263338,0.000030083036,0.0003361841,0.00016774275,0.00008588143,0.00002203577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054163283,0.000116007825,0.00023488833,0.000025816124,0.000026646283,0.0000010151775,0.0030777089,0.0015200627,0.00049355096,0.6474625,0.0013891895,0.34559846],"study_design_scores_gemma":[0.00086043053,0.00006835539,0.00045846365,0.000020247604,0.000005221833,0.000001890707,0.000019860796,0.9910953,0.0020447467,0.003913765,0.0013638007,0.00014789733],"about_ca_topic_score_codex":0.000008604327,"about_ca_topic_score_gemma":0.000023553644,"teacher_disagreement_score":0.98957527,"about_ca_system_score_codex":0.000020027612,"about_ca_system_score_gemma":0.000031096653,"threshold_uncertainty_score":0.36096048},"labels":[],"label_agreement":null},{"id":"W2150997530","doi":"10.1109/jproc.2010.2091930","title":"Random Network Coding in Peer-to-Peer Networks: From Theory to Practice","year":2011,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Network topology; Computer science; Computer network; Random graph; Network packet; Peer-to-peer; Distributed computing; Overlay network; Theoretical computer science; The Internet; Graph","score_opus":0.03628395382818574,"score_gpt":0.27178223176051747,"score_spread":0.23549827793233172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150997530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07159444,0.0009529087,0.8427319,0.025671704,0.0036639113,0.0018373438,0.0000031117102,0.00030085817,0.05324385],"genre_scores_gemma":[0.89084667,0.00010463722,0.10403586,0.0036242986,0.00026900534,0.00005773886,3.388179e-7,0.000018172164,0.00104325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983924,0.000091524715,0.00037638764,0.00035232885,0.0004338899,0.0003534944],"domain_scores_gemma":[0.9977964,0.00058247824,0.00021459784,0.00044031336,0.00084588706,0.00012032651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029693109,0.00016808824,0.0002564933,0.00008750253,0.00019540692,0.00013977074,0.0025420103,0.000063041065,0.000022398677],"category_scores_gemma":[0.0014849225,0.00013077358,0.000075194956,0.0012461309,0.000042624994,0.0005988581,0.0009489503,0.0003262504,0.000025409694],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021989797,0.00061297556,0.013851938,0.00003814136,0.00027876816,0.000006083327,0.09417828,0.013697927,0.0090013305,0.45442495,0.2504592,0.16125141],"study_design_scores_gemma":[0.009391214,0.0008443663,0.05449354,0.0038231327,0.00026232185,0.000053559204,0.004561982,0.28380102,0.0459691,0.092812024,0.5004634,0.003524273],"about_ca_topic_score_codex":0.00003524015,"about_ca_topic_score_gemma":0.000030541294,"teacher_disagreement_score":0.81925225,"about_ca_system_score_codex":0.00005843995,"about_ca_system_score_gemma":0.00003124859,"threshold_uncertainty_score":0.5332792},"labels":[],"label_agreement":null},{"id":"W2151013122","doi":"","title":"Sum rate maximization in multi-operator two-way relay networks with a MIMO AF relay via POTDC","year":2013,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Beamforming; Maximization; Computer science; Mathematical optimization; Transmitter power output; Optimization problem; Operator (biology); Relay channel; Convex optimization; Power (physics); Algorithm; Mathematics; Regular polygon; Computer network; Telecommunications; Transmitter","score_opus":0.039184532839324576,"score_gpt":0.2532808421147827,"score_spread":0.2140963092754581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151013122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021131763,0.00064022717,0.97242457,0.0006609943,0.000071500006,0.00036720856,3.9295966e-7,0.00026028772,0.0044430527],"genre_scores_gemma":[0.96060103,0.00012732632,0.037558753,0.0008131337,0.000059210717,0.0000330818,0.000010094342,0.000042388303,0.00075496925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970656,0.0010627375,0.00049525243,0.0006728048,0.00023116596,0.00047246163],"domain_scores_gemma":[0.99823177,0.00009867513,0.00025005566,0.0006414524,0.0006026181,0.0001754038],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008969344,0.00032156048,0.00026758082,0.00015995245,0.0004093132,0.0010791586,0.0013601427,0.000051016203,0.00012968529],"category_scores_gemma":[0.000044654007,0.00026806822,0.00003511307,0.0009770073,0.00013672403,0.0013912874,0.00045574942,0.0005741244,0.0002113919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008721064,0.0004863093,0.008512939,0.00007580345,0.000045013327,0.00016768236,0.008466375,0.14836921,0.020609781,0.0039272937,0.00083020044,0.8084222],"study_design_scores_gemma":[0.0010267901,0.00009180897,0.011292487,0.00040667102,0.000005457341,0.000017504888,0.000039180555,0.98571074,0.00034023504,0.00003271314,0.0006097616,0.0004266681],"about_ca_topic_score_codex":0.000025758041,"about_ca_topic_score_gemma":0.000091268725,"teacher_disagreement_score":0.9394693,"about_ca_system_score_codex":0.00006352255,"about_ca_system_score_gemma":0.00016938597,"threshold_uncertainty_score":0.9999772},"labels":[],"label_agreement":null},{"id":"W2151393883","doi":"10.1109/cwit.2009.5069533","title":"AEP of output when rate is above capacity","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Codebook; Equipartition theorem; Relay; Mathematics; Computer science; Mathematical optimization; Algorithm; Physics","score_opus":0.06659359787531882,"score_gpt":0.2747427404816221,"score_spread":0.2081491426063033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151393883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03270887,0.00031888293,0.83462775,0.016680663,0.00013121052,0.00013101175,0.0000011094891,0.00015707784,0.11524343],"genre_scores_gemma":[0.9633068,0.00014025805,0.030164326,0.004274088,0.000015689766,9.966571e-7,3.6116992e-7,0.0000015181902,0.0020959943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943507,0.00007530638,0.00015120859,0.00014012233,0.00009000392,0.00010827378],"domain_scores_gemma":[0.99911934,0.00004758766,0.00005068702,0.00061804283,0.00012111613,0.00004322985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022891742,0.000064181906,0.000102176535,0.000039781487,0.00006547681,0.000046100296,0.00071314623,0.000022865614,0.00011925244],"category_scores_gemma":[0.000021029595,0.000053947664,0.000038617953,0.00018273004,0.000023578139,0.0001717175,0.0001277649,0.00007278455,0.00004389843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033234603,0.00007200224,0.00024752898,0.0000027572105,0.000011484504,7.481804e-7,0.0047159744,0.00002639053,0.005668408,0.62111914,0.026402244,0.34172997],"study_design_scores_gemma":[0.0016580595,0.00056612125,0.07085691,0.0001175624,0.000014727585,0.0000120173845,0.00010220225,0.3894687,0.15934098,0.119243965,0.25758412,0.0010346386],"about_ca_topic_score_codex":0.000008215787,"about_ca_topic_score_gemma":0.00001320413,"teacher_disagreement_score":0.9305979,"about_ca_system_score_codex":0.0000129585615,"about_ca_system_score_gemma":0.000020831172,"threshold_uncertainty_score":0.21999219},"labels":[],"label_agreement":null},{"id":"W2151430944","doi":"10.1109/jsac.2012.121109","title":"Distributed Robust Scheduling and Power Control For Cognitive Spatial-Reuse TDMA Networks","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":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Time division multiple access; Quality of service; Cognitive radio; Power control; Scheduling (production processes); Computer network; Wireless ad hoc network; Distributed computing; Mathematical optimization; Telecommunications link; Wireless; Power (physics); Telecommunications; Mathematics","score_opus":0.051169342244062964,"score_gpt":0.30629756983110895,"score_spread":0.255128227587046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151430944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01840432,0.0036000288,0.9724768,0.0044465517,0.00028869484,0.00044757113,0.000019318635,0.000082365485,0.00023438537],"genre_scores_gemma":[0.9746073,0.0029062429,0.021499394,0.00073184853,0.00012954531,0.00006238958,0.000033120203,0.000018716206,0.0000114607265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978976,0.0007660241,0.0005081577,0.00019403316,0.00016238022,0.00047179047],"domain_scores_gemma":[0.99480754,0.0024684633,0.00029722706,0.0013667698,0.0008126707,0.0002473547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010844363,0.00020537247,0.00027934302,0.00022187579,0.00093362265,0.0002923917,0.0019795534,0.00010961322,0.000010143704],"category_scores_gemma":[0.0011365698,0.00019648766,0.000069765214,0.0008702178,0.00011508243,0.00061493344,0.00036069762,0.00096195686,0.000005068912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015563518,0.010952348,0.1780236,0.000058519483,0.0020666388,0.000024989433,0.024400441,0.16017166,0.0039096624,0.2258438,0.014247261,0.37874472],"study_design_scores_gemma":[0.0036346884,0.00025117112,0.055523477,0.00044144582,0.000053165888,0.00013034778,0.00016980896,0.934548,0.0001371073,0.00059410004,0.003996846,0.0005198306],"about_ca_topic_score_codex":0.0000051884012,"about_ca_topic_score_gemma":0.00008810663,"teacher_disagreement_score":0.956203,"about_ca_system_score_codex":0.00014981031,"about_ca_system_score_gemma":0.000115428404,"threshold_uncertainty_score":0.8012534},"labels":[],"label_agreement":null},{"id":"W2151455264","doi":"10.1109/icdcs.2008.74","title":"Circumventing Server Bottlenecks: Indirect Large-Scale P2P Data Collection","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Scalability; Peer-to-peer; Data collection; Resilience (materials science); Computer network; Distributed computing; Database; Statistics","score_opus":0.09829948386584772,"score_gpt":0.29491200690209685,"score_spread":0.19661252303624913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151455264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07621547,0.00094568357,0.8773884,0.0016897984,0.000554224,0.00023581504,0.0000030649144,0.0006603143,0.04230719],"genre_scores_gemma":[0.9549055,0.001078005,0.03707397,0.00077583984,0.000078168356,0.0000101365085,0.000034448018,0.000009923402,0.006033981],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889225,0.00013786156,0.00019389682,0.0003632343,0.00018677115,0.00022597384],"domain_scores_gemma":[0.9981055,0.00007561964,0.000061809165,0.0016045732,0.00009067303,0.00006181344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005050944,0.000094517825,0.000120741905,0.000081552884,0.0006881209,0.000095078096,0.0016639886,0.00003924736,0.00017757223],"category_scores_gemma":[0.000053283744,0.00009076154,0.000032506956,0.000794627,0.00002362657,0.0008226547,0.0015207332,0.00013781637,0.00010468759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002498888,0.001448283,0.15603341,0.00004197203,0.00024576747,0.000071281334,0.018765358,0.00034151642,0.004323051,0.047861733,0.5246697,0.24617292],"study_design_scores_gemma":[0.0007824217,0.00004373647,0.04741604,0.000041575866,0.00000689638,0.00008626196,0.000091864866,0.77402896,0.0022705032,0.00016754401,0.17463882,0.0004253963],"about_ca_topic_score_codex":0.000010292896,"about_ca_topic_score_gemma":0.00025754262,"teacher_disagreement_score":0.87869006,"about_ca_system_score_codex":0.00003852106,"about_ca_system_score_gemma":0.0000794398,"threshold_uncertainty_score":0.5292539},"labels":[],"label_agreement":null},{"id":"W2151503546","doi":"10.1109/glocom.2009.5425888","title":"Exact Closed-Form Expressions for the Outage Probability and Ergodic Capacity of Decode-and-Forward Opportunistic Relaying","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ergodic theory; Rayleigh fading; Relay; Fading; Mathematics; Topology (electrical circuits); Outage probability; Statistics; Telecommunications; Multiplexing; Signal-to-noise ratio (imaging); Computer science; Power (physics); Decoding methods; Combinatorics; Physics; Mathematical analysis","score_opus":0.08879692258098498,"score_gpt":0.3017724653582691,"score_spread":0.21297554277728414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151503546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09507783,0.0004075209,0.89763796,0.0036661061,0.000059665046,0.0005799982,0.000004785273,0.0000808045,0.0024853165],"genre_scores_gemma":[0.9607092,0.00042610313,0.038306966,0.00038423485,0.000011254983,0.000023093306,0.0000012198776,0.0000029057194,0.00013502207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999187,0.00007556002,0.00025306945,0.00022616536,0.00010697004,0.00015121336],"domain_scores_gemma":[0.99841845,0.00065695215,0.00009027985,0.00064924086,0.000097868884,0.00008719339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007212767,0.000102087404,0.00015567004,0.0000331789,0.0004242124,0.000077008306,0.00047676096,0.000039357266,0.000010279348],"category_scores_gemma":[0.00023532343,0.00006435706,0.000046036228,0.00012761647,0.0001112794,0.00024299102,0.00024764534,0.00012078934,4.9103386e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001612566,0.00008664696,0.0010744801,0.000028037959,0.000017330389,3.9294716e-7,0.0018953198,0.00002968611,0.0037329071,0.6981252,0.00046797778,0.29452592],"study_design_scores_gemma":[0.0017237851,0.000635652,0.11543757,0.0002453314,0.000071035254,0.00003238065,0.00037671582,0.732668,0.0031457185,0.1320117,0.0129201645,0.00073199585],"about_ca_topic_score_codex":0.0000054446823,"about_ca_topic_score_gemma":0.000034714245,"teacher_disagreement_score":0.86563134,"about_ca_system_score_codex":0.000018753892,"about_ca_system_score_gemma":0.000042801777,"threshold_uncertainty_score":0.32627416},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0814055833073757,"score_gpt":0.2917448779703903,"score_spread":0.2103392946630146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151544711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047008388,0.0003817779,0.94321007,0.006878572,0.0002994565,0.0005205452,0.00001533455,0.0002636475,0.0014222254],"genre_scores_gemma":[0.9930725,0.0023035372,0.0036561075,0.0006146254,0.000010853285,0.00013009003,0.0000029254613,0.00001602689,0.00019333644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975861,0.00090278895,0.00056761125,0.00032144279,0.00034246637,0.0002796428],"domain_scores_gemma":[0.99291915,0.0014044779,0.00025062842,0.0050128615,0.0003103156,0.00010254323],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00064018375,0.00024495428,0.00030413124,0.00022767205,0.0014828782,0.00015366114,0.004077965,0.00011206352,0.000013899608],"category_scores_gemma":[0.000021778433,0.00020062056,0.0001733327,0.0010849736,0.00027906464,0.00031815848,0.000029113991,0.000878292,0.00005073175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025598549,0.002048573,0.000012756524,0.000018816721,0.000116696145,0.0000011157814,0.004157697,0.029322818,0.017732156,0.78977334,0.00048608455,0.15630434],"study_design_scores_gemma":[0.00071397057,0.00023238656,0.00045041,0.0004409919,0.000033572738,0.0000139811045,0.00028847586,0.984527,0.011209692,0.00050552853,0.001136778,0.00044719726],"about_ca_topic_score_codex":0.00004579766,"about_ca_topic_score_gemma":0.00012141148,"teacher_disagreement_score":0.9552042,"about_ca_system_score_codex":0.00013017298,"about_ca_system_score_gemma":0.000087365726,"threshold_uncertainty_score":0.9998171},"labels":[],"label_agreement":null},{"id":"W2151551625","doi":"10.1109/icc.2008.1048","title":"Topology Affects the Efficiency of Network Coding in Peer-to-Peer Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Computer network; Multicast; Network topology; Coding (social sciences); Redundancy (engineering); Distributed computing; Theoretical computer science; Topology (electrical circuits); Mathematics; Network packet","score_opus":0.03671365016003877,"score_gpt":0.2842286682505988,"score_spread":0.24751501809056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151551625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04475959,0.000484878,0.9187288,0.016555661,0.00052362523,0.00031936867,1.3706e-7,0.000089165456,0.018538771],"genre_scores_gemma":[0.990649,0.00022091315,0.0059609907,0.0015668368,0.000113001086,0.000015989131,8.5263787e-7,0.000005505646,0.0014669397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860346,0.00028523678,0.0002456604,0.0002396317,0.0002723642,0.0003536734],"domain_scores_gemma":[0.9983123,0.00058616675,0.000067845736,0.00076995563,0.00020039346,0.00006331668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011285151,0.000113852206,0.00019422616,0.00007908602,0.00029205246,0.00003151887,0.0014174968,0.000054220553,0.000042960306],"category_scores_gemma":[0.000138723,0.000080624406,0.000048994658,0.0013388672,0.000113184426,0.000113171685,0.0006837628,0.00023560297,0.000015783655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019348428,0.00016181584,0.018183198,0.0000054172733,0.0000202046,0.000021922913,0.006085865,0.14712141,0.00030533716,0.69485605,0.09582496,0.03739449],"study_design_scores_gemma":[0.0005060458,0.000180651,0.032584265,0.00005660587,0.000003165073,0.000043529908,0.00007773736,0.93851423,0.0005363579,0.00043283464,0.02675603,0.0003085316],"about_ca_topic_score_codex":0.00001714211,"about_ca_topic_score_gemma":0.00015754074,"teacher_disagreement_score":0.94588935,"about_ca_system_score_codex":0.00003163252,"about_ca_system_score_gemma":0.000049362952,"threshold_uncertainty_score":0.3287768},"labels":[],"label_agreement":null},{"id":"W2151578621","doi":"10.1109/glocom.2010.5684243","title":"Relay Selection with Physical-Layer Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Linear network coding; Relay channel; Computer science; Selection (genetic algorithm); Computer network; Encoding (memory); Coding (social sciences); Channel (broadcasting); Topology (electrical circuits); Outage probability; Physical layer; Telecommunications; Mathematics; Wireless; Power (physics); Statistics; Artificial intelligence; Fading; Physics","score_opus":0.02312100142645895,"score_gpt":0.26828483250688245,"score_spread":0.2451638310804235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151578621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099078946,0.000017569912,0.86619794,0.0014501894,0.00024099108,0.000111341564,4.6567262e-8,0.00037523525,0.032527737],"genre_scores_gemma":[0.93627346,0.000021725451,0.061878297,0.00043111958,0.00024646954,0.0000109794155,5.593234e-7,0.000006086946,0.0011313007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993676,0.000047054273,0.00008126559,0.0002013373,0.00011678235,0.0001859738],"domain_scores_gemma":[0.99928313,0.000091423135,0.000039020328,0.00042384,0.00010303001,0.000059522186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017412833,0.00008590005,0.00008514759,0.000027376767,0.00029834255,0.00014213182,0.00047511846,0.00002707624,0.000058233538],"category_scores_gemma":[0.0000125110255,0.00006302347,0.000023876371,0.00056339987,0.000027711643,0.0003267616,0.00016143313,0.0003037716,0.00006168893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054734965,0.000048121,0.0031315207,0.0000016421324,0.00001643626,0.0000011264148,0.00043219587,0.0026804549,0.021264166,0.91080153,0.00653882,0.05507851],"study_design_scores_gemma":[0.00028228894,0.00009431305,0.006116755,0.000016671333,0.0000049165665,0.000022837807,0.0000065251784,0.94540006,0.006302364,0.000721688,0.04077186,0.00025970986],"about_ca_topic_score_codex":0.0000026486318,"about_ca_topic_score_gemma":0.00017110715,"teacher_disagreement_score":0.94271964,"about_ca_system_score_codex":0.000011484741,"about_ca_system_score_gemma":0.000031189073,"threshold_uncertainty_score":0.25700226},"labels":[],"label_agreement":null},{"id":"W2151579585","doi":"10.1109/icspcs.2010.5709695","title":"Network and erasure coding for improved packet delivery","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Computer network; Network packet; End-to-end delay; Packet generator; Packet loss; Linear network coding; Erasure; Processing delay; Packet analyzer; Erasure code; Transmission delay; Packet forwarding; Redundancy (engineering); Real-time computing; Decoding methods; Algorithm; Operating system","score_opus":0.03147628743390211,"score_gpt":0.2637481399747631,"score_spread":0.232271852540861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151579585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017461251,0.0003947014,0.97072196,0.005480049,0.00059858547,0.0003374028,0.0000012401213,0.00021711738,0.0047876774],"genre_scores_gemma":[0.82432175,0.00024708672,0.17287189,0.0018786464,0.00016558474,0.000023691275,0.0000023911653,0.0000059511895,0.0004830233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994623,0.000026392898,0.00010908837,0.00018660541,0.00003899547,0.00017663334],"domain_scores_gemma":[0.9991764,0.00021892633,0.000033235265,0.0003965777,0.00011069186,0.00006421072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033958725,0.00007653327,0.00008883959,0.000021399452,0.0002841074,0.00017264968,0.00040701503,0.000042300737,0.000017100798],"category_scores_gemma":[0.000041928844,0.00006561578,0.000024660721,0.00013612356,0.000029181714,0.00022877491,0.00027463443,0.0001406474,0.0000027755782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006457547,0.000015188608,0.00048117936,0.00000472128,0.00001088375,2.344542e-7,0.00019186782,0.000010008719,0.02228184,0.64759916,0.018946296,0.3104522],"study_design_scores_gemma":[0.000841739,0.000096244316,0.0033000368,0.00001991164,0.000007294265,0.000012216574,0.000018045781,0.81153977,0.0012411883,0.0141211,0.16842426,0.0003782229],"about_ca_topic_score_codex":0.0000017286902,"about_ca_topic_score_gemma":0.00014365635,"teacher_disagreement_score":0.81152976,"about_ca_system_score_codex":0.000004889535,"about_ca_system_score_gemma":0.000023759354,"threshold_uncertainty_score":0.2675734},"labels":[],"label_agreement":null},{"id":"W2151609990","doi":"10.1109/icon.2002.1033322","title":"Protection and restoration in ad hoc wireless networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Wireless ad hoc network; Mobile ad hoc network; Computer science; Quality of service; Ad hoc wireless distribution service; Vehicular ad hoc network; Reliability (semiconductor); Wireless network; Adaptive quality of service multi-hop routing; Wireless; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.04011931661872897,"score_gpt":0.2605707271049777,"score_spread":0.22045141048624872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151609990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05426158,0.00082606263,0.94065946,0.0006669719,0.000088252986,0.00017165039,1.4089867e-8,0.000064896194,0.003261103],"genre_scores_gemma":[0.9939336,0.0011129462,0.004536033,0.00014712426,0.0000067293317,0.000022839793,3.1819718e-7,0.0000021991927,0.00023820074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994978,0.0001574563,0.000097952114,0.00011310129,0.00004980478,0.00008392529],"domain_scores_gemma":[0.99966776,0.00002326914,0.00002410848,0.00022615917,0.00003379432,0.000024928728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028490828,0.000047219062,0.0000507556,0.00005112768,0.00008875286,0.00008152484,0.00012523445,0.000029888623,0.0000075043245],"category_scores_gemma":[0.000020406693,0.000043855063,0.000006855605,0.00034663684,0.0000135052005,0.0002843242,0.000053598258,0.00009787387,0.0000032817181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004051201,0.000033519213,0.0007881975,0.0000025997388,0.000002067793,9.1094176e-7,0.0007229161,0.0005931341,0.00076063885,0.41024938,0.00021434888,0.5866282],"study_design_scores_gemma":[0.00038886198,0.000062041676,0.0079017645,0.000027209448,6.843604e-7,0.000008404598,0.000053432163,0.9729938,0.00052458595,0.0010751191,0.01680415,0.00015995557],"about_ca_topic_score_codex":0.000002293466,"about_ca_topic_score_gemma":0.00025448707,"teacher_disagreement_score":0.97240067,"about_ca_system_score_codex":0.00002620686,"about_ca_system_score_gemma":0.000015825668,"threshold_uncertainty_score":0.17883575},"labels":[],"label_agreement":null},{"id":"W2151614040","doi":"10.1109/cwit.2007.375706","title":"Rank-Metric Codes for Priority Encoding Transmission with Network Coding","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Network packet; Coding (social sciences); Encoding (memory); Computer network; Theoretical computer science; Broadcasting (networking); Packet loss; Distributed computing; Forward error correction; Algorithm; Decoding methods; Mathematics; Artificial intelligence","score_opus":0.0359961827801999,"score_gpt":0.29680047475001065,"score_spread":0.26080429196981075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151614040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015777391,0.0007058201,0.98473495,0.00063163316,0.00012789041,0.00035735412,2.6056742e-7,0.00024151581,0.011622859],"genre_scores_gemma":[0.70583004,0.00039029075,0.29298803,0.0003336216,0.00010028725,0.000010374722,0.0000021139397,0.000008089274,0.00033718403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875,0.00006242768,0.00026317206,0.00030812633,0.00020185346,0.00041445607],"domain_scores_gemma":[0.9983902,0.00077316095,0.00007797143,0.00045075174,0.00017591153,0.0001320115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016154035,0.00014407162,0.00018635647,0.00013730457,0.00057155965,0.00015521578,0.0007332631,0.000052946416,0.00002303822],"category_scores_gemma":[0.00004146101,0.00010952473,0.00006084561,0.0012975209,0.000034315548,0.00035322134,0.00011984075,0.00014935473,0.0000043373475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076017524,0.000063076695,0.0020353561,0.00002324654,0.000027835658,0.000004218229,0.00073810335,0.00089760765,0.0018567337,0.32701778,0.0015186422,0.6657414],"study_design_scores_gemma":[0.004315128,0.00073342293,0.013486039,0.00044801808,0.000045008142,0.000052414034,0.00016908345,0.69503266,0.020857872,0.0036199782,0.25986817,0.001372215],"about_ca_topic_score_codex":0.0000030450674,"about_ca_topic_score_gemma":0.000047396043,"teacher_disagreement_score":0.7042523,"about_ca_system_score_codex":0.00005346349,"about_ca_system_score_gemma":0.00005355515,"threshold_uncertainty_score":0.44662887},"labels":[],"label_agreement":null},{"id":"W2151614248","doi":"10.1002/ett.2571","title":"Optimisation study of power allocation and relay location for amplify‐and‐forward systems over Nakagami‐<i>m</i>fading channels","year":2012,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Relay; Fading; Coding gain; Computer science; Diversity gain; Transmitter power output; Outage probability; Coding (social sciences); Power (physics); Mathematical optimization; Telecommunications; Mathematics; Statistics; Decoding methods; Channel (broadcasting); Transmitter; Physics","score_opus":0.03924540363289075,"score_gpt":0.2996112276294681,"score_spread":0.2603658239965774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151614248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13244474,0.0027290098,0.8609114,0.001824055,0.0001942552,0.0011013136,0.0000033036329,0.0006908908,0.00010103007],"genre_scores_gemma":[0.96738523,0.0029458522,0.028919373,0.000024335279,0.0000071641543,0.0006403774,0.000007995092,0.00001788951,0.000051804847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866164,0.00017399684,0.00046679506,0.00028019166,0.00016213371,0.00025524007],"domain_scores_gemma":[0.99749607,0.00048592238,0.00024323713,0.0014764323,0.00025320664,0.00004515138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071720936,0.00019202844,0.0002369918,0.0005043361,0.0007931297,0.00010553819,0.00082096487,0.00013141973,0.000002926567],"category_scores_gemma":[0.00011235245,0.00019616053,0.00003604399,0.0008710987,0.00012136681,0.0007946744,0.00010082819,0.00030096385,0.0000019913957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000735046,0.0038734316,0.0021830343,0.00023030562,0.0005738763,2.2543466e-7,0.04278742,0.12795001,0.0061268155,0.28396544,0.000368577,0.5318674],"study_design_scores_gemma":[0.004498009,0.002226743,0.012441922,0.00070836063,0.00035285085,0.000054901288,0.04727364,0.8983412,0.010458883,0.0018286027,0.019789651,0.002025231],"about_ca_topic_score_codex":0.000026033094,"about_ca_topic_score_gemma":0.000020360701,"teacher_disagreement_score":0.8349405,"about_ca_system_score_codex":0.00008593819,"about_ca_system_score_gemma":0.000024728144,"threshold_uncertainty_score":0.7999194},"labels":[],"label_agreement":null},{"id":"W2151738743","doi":"10.1109/twc.2007.05742","title":"Cooperative Connectivity Models for Wireless 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":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer science; Cooperative diversity; Computer network; Wireless; Channel (broadcasting); Constraint (computer-aided design); Wireless network; Interference (communication); Antenna diversity; Distributed computing; Telecommunications; Mathematics","score_opus":0.06117728620976251,"score_gpt":0.30746814487364393,"score_spread":0.24629085866388142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151738743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031222762,0.0004121376,0.9899568,0.0024955876,0.00046779952,0.0009366641,0.000023714018,0.0005030005,0.0020820478],"genre_scores_gemma":[0.96410507,0.002644192,0.03156276,0.00073983625,0.000040809035,0.00043929365,0.000018445391,0.000041055773,0.00040854374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976247,0.00041620573,0.00061720214,0.00054284063,0.0002532927,0.00054574764],"domain_scores_gemma":[0.9924411,0.002580314,0.00019749966,0.0039003904,0.0006601232,0.0002205412],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012671509,0.00033417274,0.0003753572,0.0002781426,0.0022117842,0.00021895376,0.0032576236,0.00019811618,0.000013763039],"category_scores_gemma":[0.000014833487,0.00035202457,0.0002270254,0.0011998074,0.00030031786,0.00091413077,0.000056190005,0.0008267086,0.000021306565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083241765,0.0010471158,0.000009364692,0.0000111466625,0.00015347988,0.0000014766682,0.0019706176,0.2313714,0.0015292484,0.39668846,0.00047479788,0.36665964],"study_design_scores_gemma":[0.0008072184,0.00013937126,0.000049800354,0.000072459334,0.000025656234,0.000009390038,0.00012188666,0.9900017,0.005125963,0.0006692409,0.0025484578,0.00042887885],"about_ca_topic_score_codex":0.000022437789,"about_ca_topic_score_gemma":0.0012168178,"teacher_disagreement_score":0.9609828,"about_ca_system_score_codex":0.00023246958,"about_ca_system_score_gemma":0.00014469963,"threshold_uncertainty_score":0.9998932},"labels":[],"label_agreement":null},{"id":"W2151938443","doi":"10.1109/sis.2011.5952589","title":"Biogeography-based optimization for joint relay assignment and power allocation in cognitive radio systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Integer programming; Cognitive radio; Mathematical optimization; Optimization problem; Weapon target assignment problem; Generalized assignment problem; Assignment problem; Linear programming; Node (physics); Integer (computer science); Interference (communication); Power (physics); Algorithm; Computer network; Mathematics; Wireless; Engineering; Telecommunications","score_opus":0.06824009268408437,"score_gpt":0.2632805527527342,"score_spread":0.19504046006864983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151938443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002288517,0.00042934413,0.9943772,0.00026572632,0.00009818499,0.00053071004,0.0000011169496,0.000058738693,0.0019504399],"genre_scores_gemma":[0.92137593,0.00012859463,0.078107975,0.00020017357,0.00000503943,0.00013138578,0.00000920187,0.0000045089573,0.000037186015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929905,0.00010361079,0.0001950683,0.00021053509,0.00007819371,0.00011354516],"domain_scores_gemma":[0.99944186,0.00009098983,0.00006740946,0.00021392734,0.00014263348,0.000043204735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039633902,0.00008034172,0.00009662344,0.00016120115,0.00008777291,0.00007329122,0.0001633577,0.000036274683,0.000022392014],"category_scores_gemma":[0.000031877866,0.00007178063,0.000024529414,0.00028946807,0.000029066976,0.00021749016,0.000058547797,0.00004611535,0.0000014766171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026431316,0.0018036359,0.029968206,0.0001412131,0.00022022983,0.0000085682495,0.018166525,0.09872783,0.002523929,0.7395913,0.0023616182,0.10622265],"study_design_scores_gemma":[0.00069207716,0.00012361686,0.0035103417,0.000077654746,0.0000039006836,0.0000010348747,0.000117948206,0.99418753,0.0009438731,0.000058933776,0.00015910415,0.0001240049],"about_ca_topic_score_codex":0.00001538237,"about_ca_topic_score_gemma":0.0000127466865,"teacher_disagreement_score":0.9190874,"about_ca_system_score_codex":0.000029367739,"about_ca_system_score_gemma":0.000029626775,"threshold_uncertainty_score":0.29271293},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.0851291242515848,"score_gpt":0.32340873612711685,"score_spread":0.23827961187553204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151953578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11976713,0.003827278,0.8481763,0.020285042,0.0006021878,0.0009529183,0.000008947065,0.00036135022,0.0060188416],"genre_scores_gemma":[0.88283044,0.011320482,0.10480573,0.0007317366,0.00007149917,0.00007341118,0.000009183967,0.000018646977,0.00013888945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833417,0.0003621408,0.0005362111,0.00022464085,0.00020370632,0.0003391258],"domain_scores_gemma":[0.99657494,0.0010898259,0.00024508368,0.0014910013,0.0004361399,0.0001629815],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000712026,0.00017680388,0.00024358723,0.00039371892,0.0018575839,0.00017445761,0.0023538696,0.00008890724,0.000003981146],"category_scores_gemma":[0.00034949818,0.00017165043,0.00007350337,0.0010382211,0.00011934148,0.0005431384,0.00032004243,0.00097384944,0.00000702185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000245261,0.0026932242,0.03234098,0.000061027906,0.000520063,0.00006718557,0.03180525,0.00784276,0.015241597,0.41987947,0.031435784,0.4578674],"study_design_scores_gemma":[0.0055344007,0.0009356324,0.04643867,0.0010647447,0.000057040168,0.0030684401,0.0004175986,0.51175404,0.0015051903,0.012562681,0.41482216,0.0018393783],"about_ca_topic_score_codex":0.000005623141,"about_ca_topic_score_gemma":0.00010782439,"teacher_disagreement_score":0.7630633,"about_ca_system_score_codex":0.00017394009,"about_ca_system_score_gemma":0.000200684,"threshold_uncertainty_score":0.99944186},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.058431341688053036,"score_gpt":0.26648860455035905,"score_spread":0.20805726286230602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152076414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.500511,0.0011594164,0.29993567,0.18236527,0.00020692917,0.00116206,0.00001673337,0.0008457326,0.013797213],"genre_scores_gemma":[0.90845245,0.00039409622,0.08239065,0.008335596,0.000042739313,0.00006492113,0.000017666007,0.0000113973265,0.00029046004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982959,0.00051228877,0.0002728556,0.00038398348,0.0002507521,0.0002842304],"domain_scores_gemma":[0.9948577,0.00030253205,0.00012776825,0.0043952377,0.00019304547,0.00012368718],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003929405,0.00020641112,0.00019969065,0.00009614492,0.0019523307,0.00014425407,0.004377146,0.000047268695,0.000044507146],"category_scores_gemma":[0.000027029559,0.00018572659,0.00006979236,0.00059695914,0.0004349018,0.0008793636,0.0037082473,0.00041386142,0.00014562477],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003093981,0.00465647,0.11289336,0.00009988537,0.0010874105,0.000046347945,0.087267205,0.022685735,0.05749501,0.35579202,0.14208294,0.21558422],"study_design_scores_gemma":[0.0056507527,0.0004890713,0.06816094,0.0003506796,0.00014141423,0.00017506383,0.00030611694,0.25321314,0.018851101,0.0010622669,0.6477823,0.003817095],"about_ca_topic_score_codex":0.000016099597,"about_ca_topic_score_gemma":0.00077374605,"teacher_disagreement_score":0.5056994,"about_ca_system_score_codex":0.00033721613,"about_ca_system_score_gemma":0.000062940395,"threshold_uncertainty_score":0.999347},"labels":[],"label_agreement":null},{"id":"W2152273572","doi":"10.1109/isit.1997.613155","title":"Error exponents for two-dimensional time correlated flat fading channels with space diversity and channel estimation","year":2002,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fading; Channel state information; Channel (broadcasting); Algorithm; Diversity scheme; Channel code; Mathematics; Computer science; Coding (social sciences); Telecommunications; Statistical physics; Topology (electrical circuits); Statistics; Decoding methods; Physics; Combinatorics; Wireless","score_opus":0.05621092393038333,"score_gpt":0.2535742943026547,"score_spread":0.1973633703722714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152273572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23024848,0.0002281269,0.764852,0.0025630307,0.00018663722,0.0005120688,0.0000018989323,0.00025407827,0.0011536874],"genre_scores_gemma":[0.9780082,0.00001438511,0.01895129,0.00024398234,0.000016386368,0.000011049123,0.0000071895583,0.0000060064813,0.002741491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927926,0.00004643608,0.000102352176,0.00025312265,0.00014344748,0.00017537744],"domain_scores_gemma":[0.9993684,0.00013525969,0.000059049242,0.00024873097,0.00010506653,0.00008349246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016259118,0.00011512596,0.000119063596,0.00007464644,0.0009553446,0.000069695496,0.0002819638,0.000035733396,0.00006928915],"category_scores_gemma":[0.000020078727,0.0000967513,0.000019851268,0.00021215349,0.000035363853,0.00047959515,0.00077857816,0.000082632,0.000044350098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043441972,0.0009945617,0.002847107,0.000118556345,0.00063272635,0.00006321406,0.0785229,0.58250344,0.015485078,0.097340934,0.057011828,0.16404526],"study_design_scores_gemma":[0.00080506963,0.000081709324,0.00018282664,0.000034569865,0.000006701431,0.000015052111,0.000010033985,0.9980414,0.00043349274,0.00014495011,0.00009956818,0.00014466414],"about_ca_topic_score_codex":0.000005115254,"about_ca_topic_score_gemma":0.000004564447,"teacher_disagreement_score":0.74775976,"about_ca_system_score_codex":0.000031099495,"about_ca_system_score_gemma":0.0000052126848,"threshold_uncertainty_score":0.7347835},"labels":[],"label_agreement":null},{"id":"W2152398135","doi":"10.1109/tvt.2010.2046431","title":"A Cooperative Multicast Strategy in Wireless Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Computer network; Computer science; Xcast; Source-specific multicast; Pragmatic General Multicast; Protocol Independent Multicast; Relay; Fading; Wireless; Wireless network; Network packet; Reliable multicast; Reliability (semiconductor); Distributed computing; Channel (broadcasting); Telecommunications","score_opus":0.01733771149572142,"score_gpt":0.2647272802637146,"score_spread":0.2473895687679932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152398135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13847569,0.000057515863,0.85851574,0.0017323911,0.00030008474,0.00023437988,0.0000011621104,0.00035868702,0.0003243335],"genre_scores_gemma":[0.9961173,0.0002281731,0.0031998798,0.0002007707,0.000015304888,0.00012714928,9.748902e-7,0.000013496583,0.00009693769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987654,0.00010281292,0.00026827358,0.00041668225,0.00011708367,0.00032974017],"domain_scores_gemma":[0.9986922,0.00009256062,0.000050409046,0.0009624511,0.0001371857,0.00006518966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020082155,0.00018765462,0.00021609648,0.0004561547,0.00025531335,0.00007749622,0.0010085319,0.0003143062,0.000047076577],"category_scores_gemma":[0.000008471148,0.0001832243,0.00005846812,0.0015250217,0.00019884293,0.00022126325,0.000013035184,0.0014716578,0.000049326834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001939945,0.00071217795,0.00010887763,0.00000463705,0.000051344847,0.00007913885,0.00025485497,0.12966952,0.064168416,0.1380116,0.000058690126,0.66686136],"study_design_scores_gemma":[0.0006616868,0.00014094826,0.00018523073,0.000028056302,0.000004978515,0.000050811224,0.000048935177,0.9633912,0.034102596,0.00026604853,0.0008490737,0.00027047592],"about_ca_topic_score_codex":0.000008060506,"about_ca_topic_score_gemma":0.0010491268,"teacher_disagreement_score":0.85764164,"about_ca_system_score_codex":0.00004274466,"about_ca_system_score_gemma":0.00006382212,"threshold_uncertainty_score":0.747167},"labels":[],"label_agreement":null},{"id":"W2152512030","doi":"10.1109/glocom.2001.965537","title":"A theoretical characterization of the multihop wireless communications channel with diversity","year":2002,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decodes; Computer science; Relay; Channel (broadcasting); Wireless; Computer network; Terminal (telecommunication); Antenna diversity; Relay channel; Spread spectrum; Decoding methods; Telecommunications","score_opus":0.04493663507437644,"score_gpt":0.23586555055685726,"score_spread":0.1909289154824808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152512030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21078476,0.00010234614,0.7362202,0.025066053,0.000115695795,0.00048742737,0.000004284878,0.00018404999,0.027035194],"genre_scores_gemma":[0.99729747,0.0003367654,0.0017516089,0.00039825507,0.0000053510416,0.0000059476365,0.0000015091916,0.0000025760169,0.00020052608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994222,0.00015837201,0.00010247932,0.000102584505,0.00013121119,0.00008316515],"domain_scores_gemma":[0.9983768,0.00007409202,0.000066045046,0.0013258591,0.00012897557,0.00002821534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011057881,0.000058398356,0.00007373598,0.000024927638,0.00046480668,0.000029980783,0.0019068804,0.000021169672,0.000095108335],"category_scores_gemma":[0.000011596423,0.000035559995,0.000027812639,0.0003977104,0.00027687344,0.00018109908,0.0022468695,0.000097539705,0.000007890135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015985305,0.000101258396,0.0010349524,0.0000019250217,0.000008702221,9.5820056e-8,0.0025186585,0.0000043989908,0.0020476643,0.98128915,0.000035415265,0.012956174],"study_design_scores_gemma":[0.0003110061,0.000033905577,0.019199401,0.000038394115,0.0000066302305,0.0000038536673,0.000043853448,0.97659063,0.002527547,0.0005948054,0.00053185876,0.00011813031],"about_ca_topic_score_codex":0.0000026338314,"about_ca_topic_score_gemma":0.00001918459,"teacher_disagreement_score":0.98069435,"about_ca_system_score_codex":0.000013123659,"about_ca_system_score_gemma":0.00000726211,"threshold_uncertainty_score":0.3574964},"labels":[],"label_agreement":null},{"id":"W2152530727","doi":"10.1109/wcnc.2008.71","title":"Performance Analysis of Amplify-and-Forward Relaying with Mismatched-Coherent and Partially-Coherent Receivers","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise error probability; Computer science; Relay; Channel (broadcasting); Imperfect; Monte Carlo method; Pairwise comparison; Bit error rate; Signal-to-noise ratio (imaging); Algorithm; Electronic engineering; Outage probability; Statistical physics; Topology (electrical circuits); Telecommunications; Mathematics; Statistics; Fading; Physics; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.03606044420663779,"score_gpt":0.2442519365372604,"score_spread":0.20819149233062262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152530727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9303439,0.0003239663,0.06585704,0.0003793469,0.000020587002,0.00011196545,4.954175e-7,0.00005465764,0.0029080468],"genre_scores_gemma":[0.9842434,0.0035786177,0.011766401,0.0001242296,0.0000052321243,0.000009990109,0.000002328159,0.0000039607453,0.00026583855],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914604,0.00006568538,0.00021788725,0.00024919017,0.00017193003,0.00014926255],"domain_scores_gemma":[0.99917287,0.000094002826,0.00010067982,0.0004478834,0.00009604504,0.00008851488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018946426,0.00011225052,0.0002528597,0.00013775419,0.00022662841,0.000036319252,0.00030505174,0.000031755324,0.000042918557],"category_scores_gemma":[0.000009648764,0.000083938605,0.00003531758,0.0007260065,0.00010993468,0.00025980436,0.00022726589,0.00010662869,0.0000024363708],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102408405,0.00022205016,0.70517105,0.000062906234,0.0014862479,0.000010576919,0.015068653,0.008285085,0.0027642266,0.018473765,0.0006572541,0.24769574],"study_design_scores_gemma":[0.0007247774,0.00024695438,0.29556355,0.00006111854,0.00019479045,0.000020599133,0.00020207372,0.6979566,0.002136002,0.00001830722,0.0025202415,0.0003550022],"about_ca_topic_score_codex":0.000020771971,"about_ca_topic_score_gemma":0.000116764364,"teacher_disagreement_score":0.6896715,"about_ca_system_score_codex":0.000019478506,"about_ca_system_score_gemma":0.000032178246,"threshold_uncertainty_score":0.3422917},"labels":[],"label_agreement":null},{"id":"W2152610779","doi":"10.1109/tcomm.2011.012711.090592","title":"Asymptotically-Exact Performance Bounds of AF Multi-Hop Relaying over Nakagami Fading","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Independent and identically distributed random variables; Nakagami distribution; Fading; Rayleigh fading; Moment-generating function; Mathematics; Hop (telecommunications); Relay; Upper and lower bounds; Harmonic mean; Topology (electrical circuits); Cumulative distribution function; Maximal-ratio combining; Asymptotically optimal algorithm; Algorithm; Statistics; Probability density function; Computer science; Telecommunications; Combinatorics; Random variable; Mathematical analysis; Physics; Decoding methods","score_opus":0.0978336611917214,"score_gpt":0.30068319812078037,"score_spread":0.20284953692905897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152610779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013243245,0.00027036414,0.9750374,0.0005501782,0.00026067373,0.00025076413,0.0000065554163,0.00025472694,0.010126068],"genre_scores_gemma":[0.9085746,0.0031633843,0.08759511,0.00018644128,0.00000745103,0.000074658514,0.0000027332812,0.000020697833,0.0003749518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983124,0.0003171659,0.0005416178,0.00030274692,0.00023696294,0.00028908777],"domain_scores_gemma":[0.99529135,0.00040857185,0.00018312552,0.0037232165,0.00027129208,0.00012243217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004678343,0.00021060012,0.00024446304,0.0002890409,0.0010169112,0.00007507312,0.0031293936,0.00010385353,0.00012881166],"category_scores_gemma":[0.000021016682,0.00021963014,0.00015522768,0.00093329797,0.00027807194,0.0007565584,0.00006930656,0.0006477773,0.000074138945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013366714,0.00733564,0.0032800997,0.00011948065,0.00073326076,0.000003722988,0.03835876,0.0073173293,0.026895404,0.15750006,0.00046164694,0.75786096],"study_design_scores_gemma":[0.0018785099,0.00043228033,0.01905824,0.0004935311,0.00010003396,0.000024042349,0.0002868645,0.92658395,0.04436298,0.0004060621,0.0053776344,0.0009958582],"about_ca_topic_score_codex":0.000026736716,"about_ca_topic_score_gemma":0.000120662524,"teacher_disagreement_score":0.91926664,"about_ca_system_score_codex":0.000106349056,"about_ca_system_score_gemma":0.00010994694,"threshold_uncertainty_score":0.8956257},"labels":[],"label_agreement":null},{"id":"W2152741228","doi":"10.1109/icc.2010.5502540","title":"On the System Parameters of Peer-to-Peer Video Streaming with Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Linear network coding; Peer-to-peer; Coding (social sciences); Computer network; Video streaming; The Internet; Scheduling (production processes); Server; Distributed computing; Network packet","score_opus":0.027579629102221715,"score_gpt":0.253919346684009,"score_spread":0.22633971758178728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152741228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2920424,0.000016251915,0.66012657,0.012372059,0.0005054486,0.00042372113,8.7248213e-7,0.00022192604,0.03429074],"genre_scores_gemma":[0.9473237,0.0000029303412,0.051197078,0.000702049,0.000036194546,0.000018342493,6.531919e-7,0.000006960978,0.00071211014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988959,0.00011177522,0.0001868349,0.00021303177,0.00038534836,0.00020714552],"domain_scores_gemma":[0.9976699,0.0008074721,0.00008514156,0.0010247079,0.00034008862,0.000072737734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009657073,0.00011261282,0.00013977053,0.000046903187,0.00028232252,0.00015188513,0.0011116016,0.00003070054,0.000023243041],"category_scores_gemma":[0.00015527422,0.000064651416,0.000035111025,0.00052395766,0.000045936737,0.00011567256,0.00028077004,0.00025582878,0.000025471685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010074606,0.00001745556,0.00046570753,0.0000053567796,0.000021157572,0.0000013395623,0.00074183935,0.003243418,0.0010423168,0.970632,0.006308668,0.017510636],"study_design_scores_gemma":[0.0009168684,0.0006280045,0.0055475817,0.0008523032,0.000027908989,0.00003973341,0.001124061,0.95372266,0.0137847895,0.00082271564,0.021685764,0.0008476074],"about_ca_topic_score_codex":0.000014465033,"about_ca_topic_score_gemma":0.0001827205,"teacher_disagreement_score":0.9698093,"about_ca_system_score_codex":0.000021256257,"about_ca_system_score_gemma":0.00003217565,"threshold_uncertainty_score":0.26364085},"labels":[],"label_agreement":null},{"id":"W2152749206","doi":"10.1109/icc.2011.5962567","title":"Hop-by-Hop Beamforming for Dual-Hop MIMO AF Relay Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hop (telecommunications); Relay; Cumulative distribution function; Moment-generating function; Beamforming; Computer science; Fading; Monte Carlo method; Diversity gain; MIMO; Nakagami distribution; Outage probability; Probability density function; Bit error rate; Control theory (sociology); Array gain; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics; Channel (broadcasting); Statistics; Antenna array","score_opus":0.057293748327309046,"score_gpt":0.2718727427285486,"score_spread":0.21457899440123956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152749206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014343018,0.0007722411,0.96890396,0.0008670018,0.00043305825,0.00031879256,0.0000011907265,0.0002867776,0.026982669],"genre_scores_gemma":[0.69260997,0.0014201645,0.29162902,0.0031769658,0.00021626164,0.00014724299,0.000018711835,0.000036521265,0.010745161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998654,0.00008373912,0.0003237137,0.00038101902,0.00014083675,0.00041670736],"domain_scores_gemma":[0.9983854,0.0002297533,0.0001053198,0.0009770582,0.00016405874,0.00013836293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005474647,0.00018506455,0.00019279053,0.00007216219,0.0004207328,0.00013986204,0.0010967912,0.00009367302,0.00016429019],"category_scores_gemma":[0.0000504097,0.00016248612,0.00010391319,0.00040886903,0.000051666364,0.0005691769,0.0006030059,0.00020282784,0.00005170944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043989043,0.00026891832,0.0004445228,0.00001730589,0.00009209405,0.000005319912,0.005617543,0.0006366985,0.0016803223,0.4455854,0.22085412,0.3247538],"study_design_scores_gemma":[0.0008285278,0.00020131405,0.0001685408,0.00005675277,0.000013518525,0.000014609667,0.00013843186,0.75231886,0.0029123651,0.0009877719,0.24177781,0.00058146653],"about_ca_topic_score_codex":0.000013628297,"about_ca_topic_score_gemma":0.000065251406,"teacher_disagreement_score":0.75168216,"about_ca_system_score_codex":0.00004147074,"about_ca_system_score_gemma":0.000039089813,"threshold_uncertainty_score":0.6625992},"labels":[],"label_agreement":null},{"id":"W2153016179","doi":"10.1109/twc.2013.032113.120652","title":"Relay Selection and Resource Allocation for Multi-User Cooperative OFDMA Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Relay; Subcarrier; Resource allocation; Subgradient method; Orthogonal frequency-division multiple access; Quality of service; Throughput; Frequency-division multiple access; Computer network; Telecommunications link; Mathematical optimization; Optimization problem; Orthogonal frequency-division multiplexing; Power (physics); Wireless; Telecommunications; Algorithm; Mathematics; Channel (broadcasting)","score_opus":0.049956920587625055,"score_gpt":0.29357210378221205,"score_spread":0.243615183194587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153016179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041290284,0.0005554256,0.98597026,0.0076170447,0.00012888531,0.0011375652,0.0000074387704,0.00031934725,0.00013500072],"genre_scores_gemma":[0.9198711,0.0044747083,0.0711139,0.0007649601,0.00002513229,0.0021543824,0.000017761118,0.00003120389,0.0015468783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832344,0.00043719512,0.0004048103,0.00040987786,0.00013845989,0.00028623902],"domain_scores_gemma":[0.9968558,0.0006558992,0.0001437976,0.0016552149,0.00055028195,0.00013898218],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00031311723,0.00023557853,0.00022325607,0.00019552765,0.0017251283,0.00032569552,0.0013863682,0.00014177593,0.000031553085],"category_scores_gemma":[0.000015436335,0.00024002123,0.00008788611,0.0007645876,0.0001597469,0.0007858154,0.000038429567,0.00050591043,0.000028347602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034311703,0.001281612,0.00010502953,0.000026367106,0.00024316122,1.6029472e-7,0.0031549502,0.16341436,0.009129513,0.11436386,0.003140084,0.7051066],"study_design_scores_gemma":[0.0006587518,0.00009520868,0.00040182864,0.000064895095,0.00002353869,0.0000049266896,0.00010197067,0.98523915,0.002387073,0.000033827113,0.010712896,0.00027594593],"about_ca_topic_score_codex":0.00004650362,"about_ca_topic_score_gemma":0.00053107337,"teacher_disagreement_score":0.91574204,"about_ca_system_score_codex":0.0001060895,"about_ca_system_score_gemma":0.000065818764,"threshold_uncertainty_score":0.9995745},"labels":[],"label_agreement":null},{"id":"W2153224303","doi":"10.1109/twc.2007.060142","title":"Decentralized distributed space-time trellis coding","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Node (physics); Computer science; Trellis (graph); Space–time code; Code (set theory); Algorithm; Matrix (chemical analysis); Theoretical computer science; Topology (electrical circuits); Mathematics; Decoding methods; Combinatorics; Set (abstract data type); Block code; Physics","score_opus":0.03872565748074441,"score_gpt":0.2933394242668877,"score_spread":0.2546137667861433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153224303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027194272,0.00034628637,0.98808026,0.005138179,0.0002400005,0.0003296234,0.000031450134,0.00062388735,0.0024909056],"genre_scores_gemma":[0.96740466,0.0050958097,0.026535464,0.00034398003,0.00001553445,0.000057695266,0.00003469993,0.000025459065,0.0004866796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796367,0.00034720878,0.00053620344,0.0003707872,0.00029821348,0.00048392397],"domain_scores_gemma":[0.9944478,0.0010397041,0.00016085272,0.0038575614,0.00025315696,0.00024088686],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00071043515,0.0002615924,0.00028607977,0.00028873445,0.0014254904,0.00021600799,0.0033189761,0.00012206488,0.00011026632],"category_scores_gemma":[0.000015786767,0.00027901458,0.00018435082,0.0015449444,0.00021924163,0.0004903202,0.000047368474,0.00061902846,0.0002929293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009617319,0.002384646,0.00008352272,0.000020423257,0.00030183213,0.000011597384,0.0035578683,0.00523434,0.04357926,0.23743542,0.0028699234,0.704425],"study_design_scores_gemma":[0.0031363876,0.00022971706,0.0014293685,0.00034389092,0.00011504392,0.00006136651,0.00026999885,0.7793336,0.100297004,0.0009866528,0.11211048,0.0016865201],"about_ca_topic_score_codex":0.000019588668,"about_ca_topic_score_gemma":0.00025542593,"teacher_disagreement_score":0.96468526,"about_ca_system_score_codex":0.00022875257,"about_ca_system_score_gemma":0.000089843976,"threshold_uncertainty_score":0.9999662},"labels":[],"label_agreement":null},{"id":"W2153287708","doi":"10.1109/icc.2012.6364528","title":"Capacity maximization in cooperative CRNs: Joint relay assignment and channel allocation","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Relay; Computer network; Channel (broadcasting); Linear network coding; Heuristic; Channel allocation schemes; Maximization; Exploit; Interference (communication); Relay channel; Coding (social sciences); Cognitive radio; Distributed computing; Mathematical optimization; Wireless; Telecommunications; Mathematics","score_opus":0.07709855250930553,"score_gpt":0.2636572290967413,"score_spread":0.18655867658743575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153287708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02712497,0.0005052956,0.96448433,0.0031411508,0.00013752941,0.00023845691,2.8554257e-7,0.0000700448,0.0042979144],"genre_scores_gemma":[0.9879602,0.0005573466,0.010589814,0.0005693336,0.000026989586,0.000035809884,0.0000033237316,0.0000039663987,0.00025320207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916536,0.00019655655,0.00018742266,0.0001650799,0.00010943504,0.00017617198],"domain_scores_gemma":[0.9994566,0.000047086836,0.000048509428,0.00029148263,0.000081257414,0.00007507521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005411448,0.00008967181,0.00009885986,0.00008220474,0.00012396017,0.000077890065,0.00018118107,0.000037740374,0.000028480588],"category_scores_gemma":[0.000057152192,0.00007831279,0.000011853034,0.00030237666,0.000029939909,0.00079519715,0.0002077556,0.000107636864,0.000017390741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008789242,0.00051618763,0.008544546,0.000017248309,0.00002680075,9.194669e-7,0.02265184,0.008476484,0.008752043,0.8858192,0.001850792,0.063335136],"study_design_scores_gemma":[0.0007717365,0.00008528698,0.089698926,0.00006954436,0.0000042505712,0.00001142497,0.0002741217,0.89328176,0.011995827,0.00061368564,0.0027888017,0.0004046183],"about_ca_topic_score_codex":0.000012374857,"about_ca_topic_score_gemma":0.00006509033,"teacher_disagreement_score":0.9608352,"about_ca_system_score_codex":0.00008790009,"about_ca_system_score_gemma":0.000017931894,"threshold_uncertainty_score":0.3193503},"labels":[],"label_agreement":null},{"id":"W2153469977","doi":"10.1109/cwit.2009.5069511","title":"BER and diversity order analysis of distributed Alamouti's code with CSI-assisted relays","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Code (set theory); Computer science; Bit error rate; Cooperative diversity; Diversity (politics); Order (exchange); Channel state information; Maximal-ratio combining; Channel (broadcasting); Algorithm; Telecommunications; Topology (electrical circuits); Electronic engineering; Mathematics; Wireless; Engineering; Fading; Combinatorics","score_opus":0.02888743994997711,"score_gpt":0.2559195534164172,"score_spread":0.2270321134664401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153469977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16335289,0.00011666685,0.830667,0.0020687494,0.000011097073,0.000097076525,0.000007497172,0.00008255257,0.0035964453],"genre_scores_gemma":[0.9866237,0.000085730935,0.012779175,0.00028072062,0.000002117412,9.0329314e-7,0.000016965752,0.0000011574276,0.00020951402],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99938804,0.00006269345,0.00012328905,0.00018805337,0.0001337387,0.00010417901],"domain_scores_gemma":[0.99913114,0.00006385203,0.00006487243,0.0004774743,0.00020579103,0.000056881614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001327885,0.00007625756,0.00017815689,0.000107567656,0.0002167993,0.000043894946,0.00041144018,0.00002635871,0.000040270872],"category_scores_gemma":[0.000016801021,0.000057707228,0.000033877943,0.001813386,0.000048360016,0.0001794443,0.0004217607,0.00006703995,0.0000010655293],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009901834,0.0006786938,0.51251423,0.000009461568,0.0019027698,0.000018518123,0.0043702363,0.0035684025,0.0019016529,0.31693453,0.0043712114,0.15363127],"study_design_scores_gemma":[0.00033792,0.00007525665,0.8539642,0.000007665537,0.0001475529,0.0000018006026,0.00002845006,0.14445244,0.00011071418,0.00009193262,0.0006608432,0.00012120401],"about_ca_topic_score_codex":0.000013457691,"about_ca_topic_score_gemma":0.0002984348,"teacher_disagreement_score":0.8232708,"about_ca_system_score_codex":0.000017876888,"about_ca_system_score_gemma":0.0000145252325,"threshold_uncertainty_score":0.23532325},"labels":[],"label_agreement":null},{"id":"W2153586402","doi":"10.1109/wcnc.2008.236","title":"Performance Analysis of Incremental Relaying Cooperative Diversity Networks over Rayleigh Fading Channels","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Cooperative diversity; Relay; Computer science; Rayleigh fading; Antenna diversity; Computer network; Channel (broadcasting); Fading; Channel state information; Diversity gain; Exploit; Diversity scheme; Transmission (telecommunications); Telecommunications; Antenna (radio); Wireless; Computer security","score_opus":0.05069616422092998,"score_gpt":0.25862389849429585,"score_spread":0.20792773427336586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153586402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7207563,0.00013904061,0.27430338,0.00005465088,0.00010560931,0.000088577064,6.481205e-7,0.0000663875,0.0044854404],"genre_scores_gemma":[0.9959877,0.0012129695,0.0021475689,0.00026449,0.000023499151,0.0000038996336,0.0000074332447,0.0000038404046,0.00034858426],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988973,0.00012533292,0.00025855284,0.0002683739,0.00023940192,0.0002110053],"domain_scores_gemma":[0.9990168,0.000119514996,0.00011740034,0.00050639466,0.00017110573,0.00006875432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031948191,0.00012976394,0.00027827226,0.00026269752,0.000995071,0.000034077875,0.00085850095,0.000044741137,0.0001764337],"category_scores_gemma":[0.000016585836,0.000118546755,0.000114161114,0.0021094084,0.00008910895,0.0006692595,0.0017556066,0.00015754046,0.0000046532055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030934745,0.00017558353,0.58503485,0.000007410157,0.0012157176,0.0000109794555,0.012649032,0.37313432,0.0010551482,0.01633651,0.001388287,0.008961211],"study_design_scores_gemma":[0.00022958346,0.000041804582,0.080993,0.00001237465,0.000045897923,0.0000023369853,0.00003749107,0.9175499,0.00084592943,0.000001932301,0.000094597024,0.00014517317],"about_ca_topic_score_codex":0.000032905114,"about_ca_topic_score_gemma":0.000027585691,"teacher_disagreement_score":0.5444156,"about_ca_system_score_codex":0.0000727662,"about_ca_system_score_gemma":0.000025210376,"threshold_uncertainty_score":0.76533824},"labels":[],"label_agreement":null},{"id":"W2153614597","doi":"10.1016/j.comcom.2009.02.001","title":"Multiple frequency reuse schemes in the two-hop IEEE 802.16j wireless relay networks with asymmetrical topology","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"Beijing Jiaotong University; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Relay; RSS; Base station; Reuse; Throughput; IEEE 802; Wireless; Telecommunications; Power (physics); Engineering; Quality of service; Operating system","score_opus":0.04718666208462432,"score_gpt":0.3014459932283545,"score_spread":0.2542593311437302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153614597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012051805,0.0024965524,0.95221925,0.02999332,0.00018648387,0.00047110283,0.0000010978655,0.0002498674,0.0023305146],"genre_scores_gemma":[0.7434389,0.0012960421,0.2516772,0.0033941912,0.00008859195,0.00005801342,0.000016270415,0.000010151392,0.0000206684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709696,0.0012479795,0.00051569234,0.00044277913,0.0002511495,0.00044544812],"domain_scores_gemma":[0.99009115,0.0016141325,0.00018099394,0.00777187,0.00023831178,0.00010354983],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007905066,0.00026280625,0.00031249557,0.00026988992,0.00076076866,0.00030557733,0.010929718,0.00010863993,0.0000052868263],"category_scores_gemma":[0.00008751447,0.00019821964,0.00008731158,0.0023375133,0.0002800768,0.00046398226,0.0014122709,0.0010245813,0.000024068686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020170517,0.0012588323,0.008572794,0.000004779455,0.000062411695,0.000026535261,0.005525541,0.012943821,0.00017404463,0.6490493,0.0062728203,0.31608894],"study_design_scores_gemma":[0.001065179,0.00022835692,0.014384955,0.00007835089,0.0000109092025,0.00006454605,0.000049893675,0.9692038,0.000029172976,0.0016103098,0.012897693,0.00037682737],"about_ca_topic_score_codex":0.000033228356,"about_ca_topic_score_gemma":0.0004301159,"teacher_disagreement_score":0.95625997,"about_ca_system_score_codex":0.00009932179,"about_ca_system_score_gemma":0.00009858544,"threshold_uncertainty_score":0.9944216},"labels":[],"label_agreement":null},{"id":"W2153722101","doi":"10.1109/lcomm.2007.070097","title":"Outage Probability of Selection Cooperation in the Low to Medium SNR Regime","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Outage probability; Signal-to-noise ratio (imaging); Selection (genetic algorithm); Computer science; Diversity combining; Maximal-ratio combining; Channel (broadcasting); Diversity gain; Diversity (politics); Mathematical optimization; Algorithm; Statistics; Applied mathematics; Mathematics; Telecommunications; Fading; Artificial intelligence","score_opus":0.052521437649329726,"score_gpt":0.3080261926892231,"score_spread":0.2555047550398934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153722101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23087983,0.00013509514,0.6800568,0.086604625,0.00016551785,0.00080320763,0.0000012649336,0.00009085275,0.0012628037],"genre_scores_gemma":[0.9617646,0.00009864618,0.032879047,0.005126334,0.000029222747,0.00006781288,0.000006866009,0.0000061392584,0.000021357664],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99827147,0.0006220816,0.00046042257,0.0002146828,0.00022141178,0.00020996502],"domain_scores_gemma":[0.9962917,0.00059325,0.00012394227,0.0027318588,0.00021125059,0.00004800491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025437858,0.00011228198,0.00013978459,0.00020303225,0.0002961577,0.000086015345,0.0033482823,0.000043682347,0.0000060054335],"category_scores_gemma":[0.00016886598,0.00009555943,0.000045814864,0.001643101,0.00013079833,0.00033373846,0.00033814652,0.0003239457,0.00001967247],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006651294,0.001580949,0.011111556,0.00005914335,0.000060982155,0.000003871793,0.049744356,0.008042253,0.6400486,0.17255916,0.023726437,0.09299615],"study_design_scores_gemma":[0.004032204,0.000800369,0.41784325,0.000875323,0.00007140633,0.000107394,0.0015460057,0.20378426,0.19109805,0.003190131,0.17389195,0.0027596653],"about_ca_topic_score_codex":0.000038086997,"about_ca_topic_score_gemma":0.0016534711,"teacher_disagreement_score":0.73088473,"about_ca_system_score_codex":0.00012352917,"about_ca_system_score_gemma":0.000058957125,"threshold_uncertainty_score":0.6221997},"labels":[],"label_agreement":null},{"id":"W2153854069","doi":"10.1109/wimob.2008.24","title":"Throughput and Performance Optimization Using an Adaptive Coded Cooperation Protocol","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Throughput; Computer network; Automatic repeat request; Channel (broadcasting); Redundancy (engineering); Coding (social sciences); Decoding methods; Spectral efficiency; MIMO; Convolutional code; Hybrid automatic repeat request; Algorithm; Wireless; Telecommunications; Telecommunications link","score_opus":0.12195030439376384,"score_gpt":0.3173284920965901,"score_spread":0.19537818770282625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153854069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013412309,0.000010889412,0.97610545,0.000091012545,0.000024525221,0.007700311,1.551501e-7,0.00012528388,0.0025300868],"genre_scores_gemma":[0.63550943,0.00008871597,0.36135274,0.00029076257,0.000030289573,0.002572442,0.0000026746445,0.0000064717906,0.00014649473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993001,0.00010882467,0.0001538823,0.0002196765,0.00010363536,0.000113851114],"domain_scores_gemma":[0.9993349,0.000019106848,0.00005192765,0.00034325098,0.00019762588,0.00005321983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013829352,0.00009201617,0.00008632921,0.000044927696,0.00056918466,0.000092864706,0.00026263742,0.00003230014,0.000030156842],"category_scores_gemma":[0.000009318429,0.000080651196,0.000009812805,0.00028230099,0.000057693287,0.001549056,0.00016331136,0.00007417864,0.0000035785404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009310465,0.00032517064,0.0028151632,0.000017932864,0.000020836333,0.000004651776,0.0052343537,0.8600229,0.0016422442,0.07027602,0.00034170542,0.05920589],"study_design_scores_gemma":[0.0003353996,0.00018674936,0.0006756348,0.0000116199635,9.802488e-7,0.000029625013,0.000012379002,0.9973556,0.0009299827,0.000010277812,0.00033427446,0.00011748186],"about_ca_topic_score_codex":0.000004998565,"about_ca_topic_score_gemma":0.000009455087,"teacher_disagreement_score":0.62209713,"about_ca_system_score_codex":0.000031429405,"about_ca_system_score_gemma":0.00006999466,"threshold_uncertainty_score":0.4377766},"labels":[],"label_agreement":null},{"id":"W2153875024","doi":"10.1109/cwit.2011.5872139","title":"Complexity-efficient detection for MIMO relay networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Relay; Computer science; Computational complexity theory; Decoding methods; Focus (optics); Detector; Algorithm; 3G MIMO; Computer engineering; Computer network; Telecommunications; Channel (broadcasting)","score_opus":0.13152514085324724,"score_gpt":0.28511116027176675,"score_spread":0.15358601941851951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153875024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017417482,0.00011538329,0.9835055,0.00020049592,0.0003309655,0.00022100857,1.9447575e-7,0.00021527155,0.013669441],"genre_scores_gemma":[0.9060491,0.000043859323,0.093050785,0.00039110862,0.000039923412,0.000040005303,0.0000012172874,0.0000052107334,0.0003788141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993238,0.00007038044,0.00015413619,0.00020425441,0.00006763871,0.00017983091],"domain_scores_gemma":[0.9991709,0.00008207074,0.00004714929,0.0005235747,0.00011883731,0.00005749807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031380684,0.00007948677,0.00008336411,0.000048941336,0.00030279066,0.000053868323,0.0006015023,0.00003597557,0.000050025053],"category_scores_gemma":[0.000022450826,0.000069744565,0.000054147073,0.0002670667,0.000038969087,0.00010482418,0.00022226828,0.00009425904,0.0000239294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014689609,0.00012921142,0.00005666039,0.000003151391,0.000014170986,4.911322e-7,0.00099315,0.0014372136,0.0004242931,0.79297775,0.0012012093,0.20274799],"study_design_scores_gemma":[0.00019394007,0.00006625166,0.0015139757,0.0000055791465,0.000002177492,0.0000029863163,0.00001510969,0.98902947,0.0013411721,0.0007657025,0.0069532725,0.000110340836],"about_ca_topic_score_codex":0.0000065872705,"about_ca_topic_score_gemma":0.00008596893,"teacher_disagreement_score":0.9875923,"about_ca_system_score_codex":0.000026947344,"about_ca_system_score_gemma":0.0000118329945,"threshold_uncertainty_score":0.2844101},"labels":[],"label_agreement":null},{"id":"W2153887363","doi":"10.1109/icc.2009.5198855","title":"Controlling Error Propagation in Network-Coded Cooperative Wireless Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Thresholding; Bit error rate; Channel (broadcasting); Diversity combining; Reliability (semiconductor); Error detection and correction; Wireless; Relay channel; Diversity gain; Wireless network; Algorithm; Electronic engineering; Real-time computing; Telecommunications; Fading; Artificial intelligence; Engineering; Physics","score_opus":0.03548551814390408,"score_gpt":0.27952424507036827,"score_spread":0.2440387269264642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153887363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013851166,0.00092699745,0.97090673,0.0029972338,0.00025439123,0.00062208594,2.4314892e-7,0.00023331269,0.01020781],"genre_scores_gemma":[0.9946965,0.00015387009,0.0036204853,0.0009577128,0.000082528706,0.00003287369,0.0000035201272,0.000004507812,0.00044802745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986294,0.00030711113,0.00034749007,0.00028026686,0.0001605026,0.00027526714],"domain_scores_gemma":[0.99909186,0.000110867746,0.00008615892,0.00045776527,0.00019343632,0.00005990783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000588968,0.0001336437,0.00022797078,0.000078107056,0.00018785938,0.00026104177,0.0006180542,0.000051402025,0.00000923426],"category_scores_gemma":[0.000028999259,0.00011269269,0.000029730658,0.00071817776,0.000020203457,0.0005074028,0.00008596905,0.00017798496,0.000024555771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001839418,0.000088480534,0.00033609162,0.0000036626602,0.000009432587,0.0000069321554,0.00093629846,0.10547566,0.0022609408,0.8469867,0.0011359437,0.042741448],"study_design_scores_gemma":[0.0006249696,0.00007132085,0.0010626911,0.0000734871,0.0000013827095,0.000003526451,0.000039509156,0.99644345,0.00028287212,0.00026977385,0.0009648348,0.00016220612],"about_ca_topic_score_codex":0.0000097172715,"about_ca_topic_score_gemma":0.000104450366,"teacher_disagreement_score":0.98084533,"about_ca_system_score_codex":0.00007602974,"about_ca_system_score_gemma":0.0000625126,"threshold_uncertainty_score":0.45954743},"labels":[],"label_agreement":null},{"id":"W2153911851","doi":"10.1109/infcom.2011.5935258","title":"GestureFlow: Streaming gestures to an audience","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Gesture; Computer science; Multimedia; Human–computer interaction; Artificial intelligence","score_opus":0.09120506675578932,"score_gpt":0.2991975668171293,"score_spread":0.20799250006133996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153911851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06636693,0.00015650703,0.81191903,0.0010931734,0.00024314152,0.00017125388,2.2052589e-7,0.00048004152,0.119569674],"genre_scores_gemma":[0.8202405,0.00004732484,0.17748602,0.0016117388,0.000025588712,0.000010494627,3.3808413e-7,0.000003744968,0.0005742373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992684,0.00006592203,0.00011165554,0.0002620974,0.000109032924,0.00018286763],"domain_scores_gemma":[0.998876,0.000028930997,0.000022472033,0.0008453856,0.000081496095,0.00014575264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018087986,0.00008723716,0.00007574065,0.000064591615,0.00017511396,0.0000835212,0.0013459616,0.000023779316,0.000088967274],"category_scores_gemma":[0.000030461308,0.000071318194,0.00001955891,0.00033546853,0.000018858296,0.00045644754,0.00048314422,0.00008474641,0.00010233098],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037771347,0.00012069979,0.0018179643,0.0000015659452,0.0000075940625,0.000006558382,0.015740933,0.00003844591,0.0033336654,0.49477658,0.0023187958,0.48183343],"study_design_scores_gemma":[0.0007986837,0.0014441074,0.72993195,0.00011920539,0.000014024704,0.00005627705,0.001073271,0.088981375,0.039457764,0.009894271,0.12618156,0.002047481],"about_ca_topic_score_codex":0.000021518315,"about_ca_topic_score_gemma":0.00021711961,"teacher_disagreement_score":0.7538736,"about_ca_system_score_codex":0.000015939164,"about_ca_system_score_gemma":0.000020879463,"threshold_uncertainty_score":0.29082716},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Base (topology); Algorithm; Artificial intelligence; Information retrieval; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.06225531140053813,"score_gpt":0.3129612854689553,"score_spread":0.25070597406841716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153946652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17369968,0.0020229516,0.82304174,0.00014999842,0.00010616127,0.00020319446,0.0000012753247,0.000098669465,0.00067634846],"genre_scores_gemma":[0.9763197,0.00010857288,0.023111086,0.000064450156,0.000014026117,0.00001022136,0.000003952369,0.0000051332036,0.0003629038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919534,0.00010456453,0.00025758165,0.00019967076,0.00012760608,0.00011524465],"domain_scores_gemma":[0.9992194,0.00010417768,0.000112805144,0.00034036135,0.00018784004,0.0000354054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023863063,0.00009503016,0.00013622259,0.000093270966,0.00012569499,0.00021632506,0.0004757046,0.000033872147,0.000013072459],"category_scores_gemma":[0.0000232529,0.00008575644,0.000025409354,0.00027836303,0.00004678226,0.0005212015,0.00033419885,0.00006672873,0.0000027536882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014715579,0.0013297157,0.07383756,0.00023499255,0.00006028854,0.0000073189394,0.000965384,0.005759441,0.1363065,0.7108162,0.0015736885,0.06909421],"study_design_scores_gemma":[0.0009325956,0.000018932955,0.012343601,0.0000723083,0.000003179057,0.0000021296503,0.000027369633,0.9762175,0.009176439,0.00003704649,0.0010342043,0.00013470733],"about_ca_topic_score_codex":0.00013349012,"about_ca_topic_score_gemma":0.000050493916,"teacher_disagreement_score":0.97045803,"about_ca_system_score_codex":0.000020653917,"about_ca_system_score_gemma":0.000021491182,"threshold_uncertainty_score":0.3497046},"labels":[],"label_agreement":null},{"id":"W2154288485","doi":"10.1186/1687-1499-2013-173","title":"User pairing in cooperative wireless network coding with network performance optimization","year":2013,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairing; Computer science; Linear network coding; Wireless network; Transmitter power output; Computer network; Wireless; Mathematical optimization; Network performance; Heuristic; Transmission (telecommunications); Optimization problem; Algorithm; Telecommunications; Channel (broadcasting); Mathematics; Network packet; Artificial intelligence","score_opus":0.03235820625293343,"score_gpt":0.25512802999447026,"score_spread":0.22276982374153684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154288485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20914601,0.01084941,0.7591632,0.007850316,0.00090787385,0.0014655805,8.347235e-7,0.00038320062,0.010233589],"genre_scores_gemma":[0.92465776,0.045164194,0.028696992,0.00087833276,0.0003778348,0.000090088215,0.000007814507,0.000038920854,0.00008808933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969188,0.0009140869,0.0007296771,0.000404515,0.00031653405,0.0007164171],"domain_scores_gemma":[0.9967749,0.0007633529,0.00043937378,0.0014291106,0.0003732525,0.00021998277],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012887135,0.00036312285,0.00043925617,0.00019027121,0.0021714359,0.0010525746,0.0019527242,0.00010647317,0.000025443833],"category_scores_gemma":[0.000012264479,0.00030906987,0.00005809604,0.0015778732,0.00018898486,0.0014462816,0.00090347393,0.001140521,0.000010446498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031625783,0.00011012355,0.032335207,0.0000107561,0.00006252657,0.0000080989585,0.00081905705,0.6979029,0.000028359365,0.019564288,0.0008746166,0.2482524],"study_design_scores_gemma":[0.00073767937,0.0002041976,0.0073100817,0.0013213651,0.00000969822,0.00009927676,0.00007797723,0.98388755,0.0000093351155,0.00010019359,0.005815579,0.00042707782],"about_ca_topic_score_codex":0.0000073609763,"about_ca_topic_score_gemma":0.00011190428,"teacher_disagreement_score":0.7304662,"about_ca_system_score_codex":0.00015281425,"about_ca_system_score_gemma":0.000098613506,"threshold_uncertainty_score":0.99998444},"labels":[],"label_agreement":null},{"id":"W2154408368","doi":"10.1109/glocom.2009.5426100","title":"DMT Analysis of Asynchronous OFDM Decode-and-Forward Cooperative Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Asynchronous communication; Orthogonal frequency-division multiplexing; Multiplexing; Computer science; Relay; Synchronization (alternating current); Computer network; Diversity gain; Cooperative diversity; Selection (genetic algorithm); Telecommunications; MIMO; Fading; Channel (broadcasting)","score_opus":0.018610510043497716,"score_gpt":0.2765904780846148,"score_spread":0.25797996804111706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154408368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102912625,0.00084129634,0.97620386,0.0010762033,0.00003851812,0.00009717929,6.476319e-7,0.000081173996,0.01136985],"genre_scores_gemma":[0.98204553,0.0011897963,0.015409565,0.001118687,0.000015603166,0.0000034799207,0.000005423194,0.0000027091874,0.0002091801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990135,0.00012525661,0.0002876671,0.000265576,0.00012783907,0.00018016071],"domain_scores_gemma":[0.9988287,0.00014695934,0.00008917719,0.00064668356,0.00020106249,0.000087406894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002913748,0.00012287725,0.0003169359,0.00021069539,0.00014884105,0.00009259916,0.0006252809,0.000047600563,0.00011611674],"category_scores_gemma":[0.000030610736,0.00010261809,0.00009449337,0.0017063277,0.00005331647,0.00026439293,0.00021455716,0.00011625928,0.0000044566214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010003961,0.00012632756,0.0022038391,0.0000016296749,0.0004941469,0.000002492092,0.0010626274,0.044838347,0.0003271327,0.54294896,0.0012256616,0.40675882],"study_design_scores_gemma":[0.00017243095,0.00011247864,0.022386303,0.0000075733456,0.000075342425,0.0000014821563,0.00002474041,0.97616243,0.000295715,0.00016606206,0.0004545725,0.00014085746],"about_ca_topic_score_codex":0.0000065225518,"about_ca_topic_score_gemma":0.00011747643,"teacher_disagreement_score":0.9717543,"about_ca_system_score_codex":0.000020516134,"about_ca_system_score_gemma":0.000034301574,"threshold_uncertainty_score":0.41846442},"labels":[],"label_agreement":null},{"id":"W2154432616","doi":"10.1109/ccece.2003.1226238","title":"An optimal receiver for transmission diversity over uncertain channels","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Detector; Upper and lower bounds; Probability density function; Channel (broadcasting); Algorithm; Maximum a posteriori estimation; Computer science; Transmission (telecommunications); Quadratic equation; Mathematics; Gaussian; Diversity scheme; Statistics; Telecommunications; Maximum likelihood; Physics; Fading; Mathematical analysis","score_opus":0.05854198305495728,"score_gpt":0.30778004601873515,"score_spread":0.24923806296377787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154432616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018685764,0.00007942197,0.9780575,0.0017704866,0.00010158146,0.00016911916,7.0030626e-7,0.00012785029,0.0010075807],"genre_scores_gemma":[0.8586552,0.00014319425,0.14008856,0.0007258505,0.000035628836,0.0000074279064,0.0000043884434,0.0000036433921,0.0003360833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994045,0.000039248727,0.00008440162,0.00021702146,0.00010367377,0.00015116164],"domain_scores_gemma":[0.99940234,0.000035568482,0.000021768468,0.00037098888,0.00007605365,0.00009327666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018612645,0.0000769549,0.00007642902,0.00004018188,0.00048558705,0.000079634825,0.0007874603,0.000035318182,0.00009233149],"category_scores_gemma":[0.000005612897,0.000066142115,0.00004659715,0.0001747458,0.000020428453,0.00054085045,0.0002391288,0.000059733622,0.000007923825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107600994,0.00044722893,0.00020061898,0.000014620661,0.000032763226,0.000005718709,0.013127325,0.06535964,0.005602565,0.33625567,0.0032072961,0.57563895],"study_design_scores_gemma":[0.0030882033,0.00056770636,0.0022396955,0.000056714984,0.000010176013,0.000005233237,0.000105410545,0.9080198,0.014899069,0.007641068,0.06279137,0.0005755512],"about_ca_topic_score_codex":0.000013959568,"about_ca_topic_score_gemma":0.00000910754,"teacher_disagreement_score":0.8426602,"about_ca_system_score_codex":0.000049633236,"about_ca_system_score_gemma":0.000034396373,"threshold_uncertainty_score":0.37347922},"labels":[],"label_agreement":null},{"id":"W2154477729","doi":"10.1109/isit.2009.5205796","title":"Opportunistic scheduling in large-scale wireless networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Transmitter; Rayleigh fading; Scheduling (production processes); Computer science; Fading; Computer network; Wireless network; Maximum throughput scheduling; Wireless; Topology (electrical circuits); Radio networks; Stochastic geometry models of wireless networks; Asymptotically optimal algorithm; Throughput; Hop (telecommunications); Channel (broadcasting); Radio resource management; Mathematics; Mathematical optimization; Dynamic priority scheduling; Round-robin scheduling; Telecommunications; Algorithm; Combinatorics; Quality of service","score_opus":0.03458510057997188,"score_gpt":0.28338774654508075,"score_spread":0.24880264596510887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154477729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011743137,0.00019988726,0.9716223,0.0023200463,0.0000952486,0.00007947564,1.225662e-7,0.00014583807,0.013793966],"genre_scores_gemma":[0.972802,0.00044724063,0.02414646,0.002178981,0.00003652942,0.000003723258,0.0000030124575,0.0000031357715,0.00037893362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999147,0.000078148085,0.00020047768,0.00021683953,0.000096833806,0.0002606825],"domain_scores_gemma":[0.9992414,0.000055538996,0.000035880665,0.0005391475,0.000047741334,0.00008025765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037930647,0.00008877106,0.00012170143,0.00007367508,0.00012155056,0.00011174319,0.0007500346,0.000041942996,0.00004375222],"category_scores_gemma":[0.000013423829,0.00008371827,0.000029118892,0.000512617,0.000012422831,0.00025050688,0.000186038,0.00018976262,0.0000179415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030840217,0.00014974092,0.001579835,0.0000013588964,0.0000027115684,0.000013876258,0.00052566145,0.0053124605,0.00029914576,0.6839487,0.0004226596,0.30774078],"study_design_scores_gemma":[0.0002143381,0.000021828228,0.00582812,0.000024253452,6.443828e-7,0.0000028855884,0.000027679163,0.99188083,0.00003392161,0.0006047937,0.0012420398,0.000118682045],"about_ca_topic_score_codex":0.0000012202536,"about_ca_topic_score_gemma":0.00008053958,"teacher_disagreement_score":0.98656833,"about_ca_system_score_codex":0.000030202447,"about_ca_system_score_gemma":0.000034166686,"threshold_uncertainty_score":0.34139317},"labels":[],"label_agreement":null},{"id":"W2154494710","doi":"10.1109/iwcmc.2011.5982811","title":"Cooperative joint precoding for relay enhanced cellular system: Design and performance evaluation","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Precoding; Base station; Relay; Zero-forcing precoding; Computer science; Interference (communication); Telecommunications link; Joint (building); Cellular network; Computer network; Telecommunications; Engineering; Beamforming; MIMO; Channel (broadcasting)","score_opus":0.1520441180004681,"score_gpt":0.2826025295901942,"score_spread":0.13055841158972611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154494710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03356185,0.00035614052,0.9574362,0.0000603324,0.00015299804,0.0009718151,1.9412987e-7,0.00012478698,0.0073356987],"genre_scores_gemma":[0.81448084,0.00015380244,0.18480512,0.0000547644,0.000017359233,0.00022881267,0.0000015849711,0.000005919747,0.00025181827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890053,0.00027026734,0.00023538874,0.00028840656,0.00013898913,0.00016641433],"domain_scores_gemma":[0.9989317,0.000112939044,0.000085332125,0.00040347307,0.00040972218,0.000056836263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015386445,0.000115124916,0.00013881797,0.00006436178,0.00035901341,0.00009067565,0.0003273893,0.000039512735,0.00003506081],"category_scores_gemma":[0.000059184735,0.00009696731,0.000025044712,0.0001832707,0.000029082275,0.00052720215,0.0001568138,0.00007293367,0.000014799241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010675023,0.00013685181,0.000112628295,0.00014450548,0.00010062343,9.249467e-7,0.025455434,0.0039643236,0.116407946,0.2872565,0.0010303457,0.5652832],"study_design_scores_gemma":[0.00033213315,0.00016851023,0.00023447513,0.00006140217,0.000008742322,0.0000019612246,0.00008291808,0.7933346,0.20554554,0.00004507033,0.00006331861,0.00012134035],"about_ca_topic_score_codex":0.0000015067345,"about_ca_topic_score_gemma":0.0000026649745,"teacher_disagreement_score":0.78937024,"about_ca_system_score_codex":0.000073987765,"about_ca_system_score_gemma":0.00006856907,"threshold_uncertainty_score":0.3954212},"labels":[],"label_agreement":null},{"id":"W2154578572","doi":"10.1109/glocom.2010.5683370","title":"Transmit Antenna Selection Strategies for Cooperative MIMO AF Relay Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Relay; Moment-generating function; MIMO; Cumulative distribution function; Computer science; Monte Carlo method; Upper and lower bounds; Selection (genetic algorithm); Signal-to-noise ratio (imaging); Topology (electrical circuits); Control theory (sociology); Channel (broadcasting); Probability density function; Mathematical optimization; Fading; Telecommunications; Mathematics; Statistics; Physics","score_opus":0.026290291864630652,"score_gpt":0.2790834224642578,"score_spread":0.25279313059962716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154578572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00428314,0.00011701445,0.9869079,0.0017398507,0.00042456717,0.0003299477,6.959956e-7,0.00026539742,0.0059314687],"genre_scores_gemma":[0.9393883,0.00018797418,0.058257483,0.00064684387,0.00013129412,0.00007762217,0.000005232523,0.000010094115,0.0012951836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990659,0.00007836344,0.00020665175,0.00030416713,0.000091927555,0.00025302256],"domain_scores_gemma":[0.9989324,0.00019515053,0.00004877393,0.00040618842,0.0003425475,0.00007491817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003354743,0.00014222364,0.00014140205,0.000060500224,0.0004357515,0.00039447172,0.00067687535,0.00009019298,0.00009772339],"category_scores_gemma":[0.000026674268,0.00011913691,0.00006683816,0.00046216932,0.000057185807,0.00074785744,0.00007675812,0.0003429695,0.000012111198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015462021,0.000060095783,0.00008427965,0.0000038050043,0.00002424164,4.7484937e-7,0.0008465627,0.0019417913,0.0201009,0.93766415,0.0036991125,0.03555911],"study_design_scores_gemma":[0.0003804452,0.000118542725,0.00037353754,0.000009274196,0.000004618386,0.0000086814625,0.00008984469,0.97642034,0.001059613,0.00081125763,0.020521995,0.00020183573],"about_ca_topic_score_codex":0.00000637521,"about_ca_topic_score_gemma":0.00095999974,"teacher_disagreement_score":0.97447854,"about_ca_system_score_codex":0.000015118339,"about_ca_system_score_gemma":0.000110706715,"threshold_uncertainty_score":0.4858262},"labels":[],"label_agreement":null},{"id":"W2154711628","doi":"10.1109/vetecf.2010.5594491","title":"On the Performance of Network Coding for Multicast Data Delivery in Large Scale Mobile Ad Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer network; Computer science; Geocast; Mobile ad hoc network; Linear network coding; Wireless ad hoc network; Scalability; Network packet; Vehicular ad hoc network; Overhead (engineering); Routing protocol; Multicast; Distributed computing; Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; Wireless; Telecommunications","score_opus":0.04298153942328671,"score_gpt":0.29023466397447784,"score_spread":0.24725312455119114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154711628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66006154,0.0009575813,0.33590212,0.00066085573,0.00056340627,0.00081341405,0.000008772692,0.000075148855,0.00095714134],"genre_scores_gemma":[0.9781364,0.0017678235,0.019299475,0.00054137286,0.00006886317,0.00006154862,0.00001419343,0.000007391774,0.000102894905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989735,0.000079999336,0.00025408226,0.00028079282,0.00011428031,0.00029734394],"domain_scores_gemma":[0.9971058,0.0009506952,0.00008150156,0.0017243186,0.00009693089,0.00004079011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012918751,0.00010545509,0.00014539015,0.000038134367,0.000263923,0.000068878464,0.002246599,0.000052854335,0.000053454365],"category_scores_gemma":[0.000057172787,0.00007408548,0.00003225523,0.00039235456,0.00005535662,0.0003192354,0.0011455994,0.0003236623,0.000006822348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016981953,0.0007204328,0.012624719,0.00004405547,0.000050710558,0.0000015154221,0.0023058518,0.04509478,0.0019504892,0.27633595,0.027279519,0.63342214],"study_design_scores_gemma":[0.00031443997,0.000071466646,0.001612511,0.000048092134,0.000001981836,8.1257804e-7,0.000030732324,0.98643845,0.0001406708,0.000036927824,0.011206408,0.000097515745],"about_ca_topic_score_codex":8.190047e-7,"about_ca_topic_score_gemma":0.00049022137,"teacher_disagreement_score":0.94134367,"about_ca_system_score_codex":0.000011224436,"about_ca_system_score_gemma":0.00003080901,"threshold_uncertainty_score":0.4174777},"labels":[],"label_agreement":null},{"id":"W2154735997","doi":"10.1109/icc.2011.5962850","title":"A Joint Design for Topology and Security in MANETs with Cooperative Communications","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of British Columbia","funders":"","keywords":"Throughput; Computer network; Computer science; Mobile ad hoc network; Overhead (engineering); Network topology; Scheme (mathematics); Relay; Physical layer; Wireless ad hoc network; Distributed computing; Topology (electrical circuits); Wireless; Network packet; Engineering; Telecommunications","score_opus":0.1565408895555032,"score_gpt":0.30596552428930224,"score_spread":0.14942463473379905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154735997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044572535,0.00036243952,0.9838294,0.0021961357,0.000020453528,0.00048763104,5.879955e-7,0.00005622903,0.008589874],"genre_scores_gemma":[0.75470555,0.00038036736,0.24433526,0.00039909722,0.0000027833792,0.00009564798,0.0000011553979,0.0000028268375,0.00007729119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993305,0.00021042218,0.00013271895,0.00016693973,0.000033377804,0.00012601854],"domain_scores_gemma":[0.9989378,0.00018422861,0.000033536788,0.00069928635,0.000104783976,0.00004039442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031076805,0.00007443644,0.00011398515,0.00006198615,0.00015314779,0.00003529397,0.00058303186,0.000027940421,0.000021819536],"category_scores_gemma":[0.000025015219,0.000057939997,0.000009683621,0.00018805709,0.00012851231,0.00019164149,0.0003765715,0.000096408374,0.000002872806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021591919,0.00011521576,0.0005738738,0.0000034747607,0.000012083051,0.0000013421692,0.011581715,0.0000126273835,0.000114457056,0.9784324,0.0003322136,0.0087989755],"study_design_scores_gemma":[0.0033288647,0.0015937341,0.022675576,0.00009963164,0.000014106536,0.00008344197,0.0011750588,0.91547066,0.0054927757,0.040395584,0.008896689,0.00077386975],"about_ca_topic_score_codex":0.000028153701,"about_ca_topic_score_gemma":0.001070883,"teacher_disagreement_score":0.93803686,"about_ca_system_score_codex":0.000016923059,"about_ca_system_score_gemma":0.000042873122,"threshold_uncertainty_score":0.23627244},"labels":[],"label_agreement":null},{"id":"W2154740911","doi":"10.1049/iet-com.2012.0739","title":"Survey on cooperative medium access control protocols","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Access control; Control (management); Computer network; Artificial intelligence","score_opus":0.14868713545750337,"score_gpt":0.3923372197399414,"score_spread":0.24365008428243803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154740911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030077503,0.0013112222,0.66234416,0.17397241,0.0005554352,0.05137886,0.000114148665,0.00181009,0.1055059],"genre_scores_gemma":[0.9756729,0.00033651388,0.004367554,0.0039660954,0.000029046738,0.015005898,0.00005594178,0.000016055177,0.0005500178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.997323,0.0014803627,0.0003851026,0.00030089164,0.0002383797,0.00027229503],"domain_scores_gemma":[0.9921856,0.0014980274,0.0001552574,0.005157943,0.0008565913,0.000146608],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00073864433,0.0001898746,0.00023758053,0.0001147231,0.0007813476,0.0008474965,0.00829133,0.00006722549,0.00020489858],"category_scores_gemma":[0.0004072525,0.00016739874,0.00005771714,0.00083147397,0.00019388858,0.0010356312,0.0017615177,0.0004428637,0.0007497725],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003810432,0.0022966866,0.026636241,0.000018344575,0.00027344018,0.0000018611072,0.0037529413,0.0010419155,0.0024251554,0.48049444,0.32009444,0.16292642],"study_design_scores_gemma":[0.002258899,0.00033127525,0.6243046,0.00019719219,0.0000096486565,0.0000037409527,0.000045241835,0.22980654,0.0009243694,0.0023165215,0.13894093,0.00086102023],"about_ca_topic_score_codex":0.00014251028,"about_ca_topic_score_gemma":0.00071552437,"teacher_disagreement_score":0.97266513,"about_ca_system_score_codex":0.000069729664,"about_ca_system_score_gemma":0.00016922208,"threshold_uncertainty_score":0.9970743},"labels":[],"label_agreement":null},{"id":"W2154753732","doi":"10.1109/twc.2009.080568","title":"Two-fold pricing to guarantee individual profits and maximum social welfare in multi-hop wireless access networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Relay; Network packet; Wireless network; Wireless; Profit (economics); Microeconomics; Telecommunications; Economics","score_opus":0.07339530283265304,"score_gpt":0.3336596134562076,"score_spread":0.26026431062355454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154753732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06828498,0.00032556098,0.90335417,0.026160572,0.00018697185,0.0008705819,0.00001534764,0.00031211803,0.0004897162],"genre_scores_gemma":[0.9850546,0.0013596662,0.011692947,0.001528175,0.000024092724,0.00023545758,0.000012127453,0.00002608913,0.00006683554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747634,0.00054795656,0.00060453895,0.0005582113,0.00030598376,0.00050697965],"domain_scores_gemma":[0.9971293,0.00026131433,0.00015591455,0.0020892476,0.0002159304,0.00014829247],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00052989443,0.0003391466,0.00039305614,0.0005363332,0.0015073437,0.0005419247,0.00410359,0.00015163845,0.000008342526],"category_scores_gemma":[0.000008309966,0.00037304926,0.000100179095,0.0020500477,0.00014348258,0.000916663,0.0001490565,0.0009896704,0.000009569304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035559,0.0010079311,0.00015075832,0.0000099254485,0.000052983727,0.0000040614154,0.0058334074,0.019935464,0.00089731097,0.044563673,0.000093579256,0.9274154],"study_design_scores_gemma":[0.0029335774,0.00021375935,0.027823603,0.00030616435,0.000049316608,0.000023686465,0.0005136091,0.9639924,0.0012731173,0.00032716195,0.001418944,0.0011246157],"about_ca_topic_score_codex":0.000056803758,"about_ca_topic_score_gemma":0.0018521921,"teacher_disagreement_score":0.944057,"about_ca_system_score_codex":0.00015130838,"about_ca_system_score_gemma":0.000078394114,"threshold_uncertainty_score":0.99987215},"labels":[],"label_agreement":null},{"id":"W2155019949","doi":"10.1109/iwcmc.2011.5982636","title":"Threshold-based Adaptive Decode-Amplify-Forward relaying protocol for cooperative systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Protocol (science); Signal-to-noise ratio (imaging); Fading; SIGNAL (programming language); Computer network; Real-time computing; Telecommunications; Channel (broadcasting); Power (physics); Physics","score_opus":0.17711509285983493,"score_gpt":0.3388890884790933,"score_spread":0.1617739956192584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155019949","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034856726,0.000022872293,0.8925606,0.00013605635,0.00011762566,0.07245557,0.0000025697077,0.00027895469,0.034390878],"genre_scores_gemma":[0.28035757,0.0000047330964,0.1872026,0.0010210355,0.00008033426,0.52979654,0.0000060385964,0.000033720247,0.0014974031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985013,0.00015903646,0.00038010988,0.00044258827,0.0001818666,0.00033507688],"domain_scores_gemma":[0.99811125,0.00023492567,0.0001392966,0.0008882099,0.00049982703,0.00012650654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057309796,0.00021586326,0.00024218849,0.00010204745,0.0004630488,0.00020132933,0.0011776582,0.00008588524,0.00008826062],"category_scores_gemma":[0.000053514654,0.00017162922,0.00008224596,0.0003747793,0.00006103078,0.0005004922,0.00027140538,0.0001836814,0.00005535647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012492966,0.00018898243,0.00030480567,0.000033901473,0.000045591412,0.0000028650757,0.001654256,0.0014925721,0.0002129289,0.98209715,0.0063686394,0.0074734003],"study_design_scores_gemma":[0.0017260661,0.0005146708,0.00015577185,0.0001288459,0.000006110832,0.0000042137603,0.00016927706,0.96065074,0.003376524,0.0006561742,0.03219709,0.0004145326],"about_ca_topic_score_codex":0.00001590364,"about_ca_topic_score_gemma":0.000043083415,"teacher_disagreement_score":0.98144096,"about_ca_system_score_codex":0.000079906524,"about_ca_system_score_gemma":0.00018578548,"threshold_uncertainty_score":0.6998836},"labels":[],"label_agreement":null},{"id":"W2155165039","doi":"10.1109/tcomm.2012.081012.100156","title":"Performance Analysis for Multihop Relaying Channels with Nakagami-m Fading: Ergodic Capacity Upper-Bounds and Outage Probability","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Ergodic theory; Upper and lower bounds; Topology (electrical circuits); Independent and identically distributed random variables; Moment-generating function; Computer science; Signal-to-noise ratio (imaging); Channel state information; Context (archaeology); Mathematics; Channel capacity; Channel (broadcasting); Telecommunications; Probability density function; Wireless; Random variable; Statistics; Combinatorics; Mathematical analysis","score_opus":0.09869369265298683,"score_gpt":0.292406410548786,"score_spread":0.1937127178957992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155165039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1410024,0.00032318028,0.85582054,0.0014668399,0.00013001391,0.00053579477,0.000015904274,0.0001947695,0.0005105558],"genre_scores_gemma":[0.91734695,0.0010288854,0.08077539,0.00014353673,0.000016740622,0.000468983,0.000009147291,0.000015315203,0.00019505272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998483,0.00028181207,0.000341898,0.00033263568,0.00018360114,0.00037706524],"domain_scores_gemma":[0.99604416,0.00064124184,0.0001306784,0.0027572939,0.00024185069,0.00018478154],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007580525,0.00022218755,0.00028039535,0.00032838518,0.0019419289,0.0001799924,0.0013435793,0.00008481805,0.000011986208],"category_scores_gemma":[0.000019270732,0.00020391315,0.00014172928,0.0013665518,0.00028292483,0.0010037845,0.0000386445,0.00043001657,0.000008779985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003810818,0.009477263,0.10016654,0.0004644305,0.0053501693,8.2183095e-7,0.10083855,0.18220857,0.005779043,0.10624718,0.00026520866,0.48882115],"study_design_scores_gemma":[0.00090567366,0.00023240547,0.014694008,0.00008604258,0.00036823563,0.000014691794,0.00019796155,0.9750926,0.0021007021,0.00016137751,0.005540494,0.00060579774],"about_ca_topic_score_codex":0.000018809733,"about_ca_topic_score_gemma":0.00021838502,"teacher_disagreement_score":0.79288405,"about_ca_system_score_codex":0.0001398879,"about_ca_system_score_gemma":0.000053253294,"threshold_uncertainty_score":0.9993574},"labels":[],"label_agreement":null},{"id":"W2155171138","doi":"10.1109/wcnc.2011.5779395","title":"Multiuser Amplify-and-Forward relaying with delayed feedback in Nakagami-m fading","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Nakagami distribution; Channel state information; Bit error rate; Channel (broadcasting); Computer science; Relay; Signal-to-noise ratio (imaging); Algorithm; Degradation (telecommunications); Mathematics; Statistics; Topology (electrical circuits); Electronic engineering; Telecommunications; Wireless; Engineering; Physics; Power (physics)","score_opus":0.05466569255260754,"score_gpt":0.25572261603447394,"score_spread":0.2010569234818664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155171138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25995544,0.00031659967,0.69172055,0.0004939471,0.000089170324,0.00026897193,3.5563718e-7,0.0002719098,0.04688306],"genre_scores_gemma":[0.9031486,0.00022285843,0.0957638,0.0004515528,0.000007640643,0.000014097216,0.0000010002982,0.000008197971,0.00038223408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991171,0.000081215105,0.00018967965,0.00027974916,0.000105779254,0.00022647985],"domain_scores_gemma":[0.9992256,0.00008720303,0.000048358255,0.0005017093,0.000057029403,0.00008009061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024701428,0.00012088359,0.00013395434,0.00011376677,0.00013939408,0.00008376925,0.0005569186,0.00004395982,0.000075277065],"category_scores_gemma":[0.00001906789,0.00009400377,0.000017403803,0.00041457702,0.00004237445,0.0004929095,0.00038536885,0.00020017324,0.00006055194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016883199,0.00029964276,0.096816055,0.000025705214,0.00011302693,0.00006728328,0.04394407,0.00035804472,0.0019911276,0.5373677,0.0012772062,0.31757128],"study_design_scores_gemma":[0.0062653753,0.00070769066,0.24665038,0.00048499697,0.000029712262,0.00015676726,0.0019508279,0.7125949,0.006098961,0.0031395152,0.019643167,0.0022776697],"about_ca_topic_score_codex":0.000067446206,"about_ca_topic_score_gemma":0.000474352,"teacher_disagreement_score":0.7122369,"about_ca_system_score_codex":0.000032369517,"about_ca_system_score_gemma":0.000024559966,"threshold_uncertainty_score":0.38333625},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05416347955178205,"score_gpt":0.31138571373785895,"score_spread":0.2572222341860769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155174176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073881805,0.0043557975,0.89191264,0.0153795155,0.002128967,0.00092809024,0.0000064650603,0.00045681733,0.010949917],"genre_scores_gemma":[0.9381525,0.00499432,0.054222148,0.0009877525,0.00013852077,0.000032017266,0.0000106981315,0.000023115177,0.0014389171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974983,0.00082013797,0.00066428847,0.00034564245,0.00023722739,0.00043443148],"domain_scores_gemma":[0.99478096,0.0009121278,0.0003331001,0.0028921755,0.00074418756,0.00033742655],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006365591,0.00028271438,0.00030234232,0.00033980282,0.0010153344,0.0004398938,0.005441857,0.00014945974,0.000114422844],"category_scores_gemma":[0.00032759595,0.0002621402,0.000090619644,0.0017234412,0.0001649986,0.0005594423,0.000979519,0.002806224,0.00012574415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049545185,0.012142081,0.027578672,0.000027990149,0.0005309355,0.00013968874,0.02799222,0.05962831,0.28680333,0.08930136,0.15583265,0.3395273],"study_design_scores_gemma":[0.0028359045,0.00031104792,0.009107274,0.00029555015,0.000017501041,0.00030333654,0.000077501754,0.94280267,0.0036143884,0.00028217878,0.039579093,0.0007735798],"about_ca_topic_score_codex":0.000016980981,"about_ca_topic_score_gemma":0.0038158924,"teacher_disagreement_score":0.88317436,"about_ca_system_score_codex":0.00025321875,"about_ca_system_score_gemma":0.0005065497,"threshold_uncertainty_score":0.9999831},"labels":[],"label_agreement":null},{"id":"W2155482353","doi":"10.1109/icdcs.2009.68","title":"Pushing the Envelope: Extreme Network Coding on the GPU","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Parallel computing; SIMD; CUDA; Coding (social sciences); Decoding methods; Network packet; Algorithm; Computer network","score_opus":0.09867823545862354,"score_gpt":0.2763514234653145,"score_spread":0.17767318800669096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155482353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018422676,0.0007905539,0.5929268,0.196353,0.00040617344,0.00032872366,1.11401214e-7,0.00032566476,0.20702672],"genre_scores_gemma":[0.9697445,0.00051822,0.0042291116,0.024042418,0.00017876836,0.000008276278,4.1222103e-7,0.000003854546,0.0012744355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989419,0.00025550553,0.00016275734,0.00019326064,0.00019378537,0.0002527814],"domain_scores_gemma":[0.9981714,0.00063740375,0.00005468903,0.0010446045,0.000053264128,0.00003865333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097523915,0.000108519125,0.000082253704,0.000019692867,0.0010162084,0.00043671092,0.0019962378,0.000024127874,0.00010446048],"category_scores_gemma":[0.000075938035,0.00005265164,0.00004789189,0.0005317453,0.000034513985,0.00020206362,0.000307402,0.00027355904,0.00009860777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011623449,0.0000095886,0.000034753244,1.4968668e-7,0.0000038110004,7.033562e-7,0.00047869122,0.00045945408,0.000100232355,0.85368073,0.03035201,0.114878714],"study_design_scores_gemma":[0.0003104958,0.00013109895,0.017950349,0.00013484893,0.0000067731185,0.000016976031,0.00017696484,0.35349786,0.0008730609,0.024779152,0.6016225,0.00049986143],"about_ca_topic_score_codex":0.0000015675802,"about_ca_topic_score_gemma":0.000020991898,"teacher_disagreement_score":0.96790224,"about_ca_system_score_codex":0.000027650709,"about_ca_system_score_gemma":0.00002512319,"threshold_uncertainty_score":0.78159565},"labels":[],"label_agreement":null},{"id":"W2155681377","doi":"10.1109/tcomm.2011.072011.100067","title":"A Spectrally Efficient Detect-and-Forward Scheme with Two-Tier Adaptive Cooperation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Relay; Computer science; Fading; Maximization; Scheme (mathematics); Signal-to-noise ratio (imaging); Electronic engineering; Spectral efficiency; Decoding methods; Computer network; Telecommunications; Mathematics; Channel (broadcasting); Mathematical optimization; Engineering","score_opus":0.0627042138644134,"score_gpt":0.2679042200404214,"score_spread":0.20520000617600803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155681377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019844808,0.00037726297,0.9841016,0.0010950352,0.00008791,0.0004045078,0.0000057646894,0.00028486707,0.011658587],"genre_scores_gemma":[0.7889767,0.0007791562,0.20954661,0.00031096942,0.0000074626423,0.00015943185,0.000001968844,0.000015990843,0.00020166562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986162,0.0002910729,0.00029355477,0.00035259893,0.00019533181,0.00025122528],"domain_scores_gemma":[0.9967997,0.00018890311,0.00009850864,0.0025026593,0.00028657416,0.00012364889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027178097,0.00021804002,0.00018553562,0.00021189831,0.0010538772,0.00012348658,0.0015255796,0.00005723661,0.00006378857],"category_scores_gemma":[0.000005979444,0.00019624585,0.00006500865,0.0007934979,0.0002644188,0.00035593435,0.000037586015,0.00049207296,0.00007719467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004612878,0.002382174,0.00005408573,0.000020210007,0.0006091817,0.000010582826,0.029242782,0.01734661,0.0060399305,0.47156933,0.00037047506,0.47189334],"study_design_scores_gemma":[0.002027288,0.000902353,0.0005028283,0.00015932438,0.00007871191,0.00006942351,0.0002499505,0.9689327,0.02107918,0.0008212187,0.004306767,0.0008702726],"about_ca_topic_score_codex":0.00003378796,"about_ca_topic_score_gemma":0.00061517383,"teacher_disagreement_score":0.95158607,"about_ca_system_score_codex":0.0000893663,"about_ca_system_score_gemma":0.000117600495,"threshold_uncertainty_score":0.81056774},"labels":[],"label_agreement":null},{"id":"W2155705529","doi":"10.1109/glocom.2006.702","title":"WLC15-5: QoS Provisioning in the Absence of ARQ in Cellular Fixed Relay Networks through Inter-Cell Coordination","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Automatic repeat request; Network packet; Quality of service; Overhead (engineering); Throughput; Scheduling (production processes); Selective Repeat ARQ; Relay; Hybrid automatic repeat request; Wireless; Telecommunications link; Engineering; Telecommunications","score_opus":0.01656261650233108,"score_gpt":0.24803011527130744,"score_spread":0.23146749876897638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155705529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16860014,0.0017796691,0.81386113,0.0022357148,0.00033777748,0.0004655798,7.1332323e-7,0.000056309174,0.012662944],"genre_scores_gemma":[0.99364054,0.00010318972,0.005788673,0.00022333194,0.000045641355,0.000020342843,0.000006909942,0.0000050144986,0.00016636297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986686,0.0003243918,0.00039725855,0.00023875652,0.00016270319,0.00020829246],"domain_scores_gemma":[0.9988923,0.00025522854,0.00015062834,0.0006178274,0.000070203234,0.00001382579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000698898,0.00011266413,0.00015339136,0.000077799545,0.000093690025,0.00008739453,0.0011284205,0.000057482954,0.000012230234],"category_scores_gemma":[0.000035158166,0.00009092322,0.0000423926,0.00090292725,0.00004588061,0.000351415,0.00030211385,0.00027291078,0.000007899603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006647958,0.002198813,0.10894481,0.000110359,0.000020582249,0.000104506726,0.022740765,0.22836207,0.014036494,0.4110111,0.03809765,0.17430638],"study_design_scores_gemma":[0.00092820276,0.00008516592,0.025826704,0.00024069003,0.000002439422,0.000004511738,0.0002491989,0.95627147,0.0018611024,0.0020009372,0.0122533925,0.0002762015],"about_ca_topic_score_codex":0.00024161003,"about_ca_topic_score_gemma":0.0006953573,"teacher_disagreement_score":0.8250404,"about_ca_system_score_codex":0.000064218046,"about_ca_system_score_gemma":0.000033105283,"threshold_uncertainty_score":0.37077412},"labels":[],"label_agreement":null},{"id":"W2155837219","doi":"10.1109/vetecs.2008.521","title":"Multiple-Antenna Multiple-Relay Cooperative Communication System with Beamforming","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Medical Research Council","keywords":"Relay; Beamforming; Rayleigh fading; Maximal-ratio combining; Computer science; Constraint (computer-aided design); Antenna (radio); Electronic engineering; Power (physics); Topology (electrical circuits); Fading; Computer network; Telecommunications; Mathematics; Electrical engineering; Engineering; Physics; Channel (broadcasting)","score_opus":0.03876015219576799,"score_gpt":0.24522765578663047,"score_spread":0.20646750359086247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155837219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033110417,0.0006195279,0.9547529,0.000768722,0.00008014534,0.00045358436,0.0000015362119,0.0006609734,0.009552189],"genre_scores_gemma":[0.90366435,0.00050004566,0.09454357,0.00031612514,0.000021973683,0.00007397548,0.000012974907,0.000015880936,0.0008511001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983758,0.00029703646,0.00036802707,0.00037114712,0.00027934543,0.0003086557],"domain_scores_gemma":[0.99705446,0.0005570305,0.00014726433,0.0016361685,0.00047559603,0.00012948991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033663365,0.00023068913,0.00026284534,0.00011734929,0.0012376022,0.00012819526,0.0015879904,0.00006298321,0.0000149507905],"category_scores_gemma":[0.00009232312,0.0001731959,0.000056915,0.0006992252,0.00017167695,0.00091514154,0.000603163,0.0002970738,0.00009292804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028275565,0.0010229662,0.080661885,0.0001167633,0.0005321619,0.00015104738,0.04373795,0.022121517,0.016760325,0.778759,0.005507432,0.050346192],"study_design_scores_gemma":[0.0013017097,0.00011500775,0.0034517737,0.00016858205,0.000005556352,0.00022545263,0.00061573647,0.98781884,0.0015648705,0.000003185696,0.004346957,0.00038235166],"about_ca_topic_score_codex":0.000062270425,"about_ca_topic_score_gemma":0.00047630718,"teacher_disagreement_score":0.9656973,"about_ca_system_score_codex":0.00013499688,"about_ca_system_score_gemma":0.00010953311,"threshold_uncertainty_score":0.9518761},"labels":[],"label_agreement":null},{"id":"W2155861592","doi":"10.1109/pimrc.2009.5449889","title":"A network coded ARQ protocol for broadcast streaming over hybrid satellite systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Retransmission; Computer network; Computer science; Selective Repeat ARQ; Go-Back-N ARQ; Network packet; Transmission delay; Goodput; Automatic repeat request; Hybrid automatic repeat request; Sliding window protocol; Real-time computing; Throughput; Wireless; Telecommunications; Telecommunications link","score_opus":0.05632195456086531,"score_gpt":0.32501020728100705,"score_spread":0.26868825272014174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155861592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001246216,0.00020897335,0.90709984,0.0007615032,0.0001553939,0.07765916,0.000001268155,0.00037890868,0.013610323],"genre_scores_gemma":[0.49297765,0.00011585019,0.16676468,0.007296238,0.0014884725,0.32085416,0.000026622674,0.00005695575,0.0104193725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872464,0.00011034235,0.00032311832,0.00032562902,0.00015994234,0.00035632885],"domain_scores_gemma":[0.9987149,0.00015782476,0.00011312658,0.0007746376,0.00014621206,0.00009326849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038419853,0.00016223674,0.00019488504,0.00004683697,0.000292525,0.00041818613,0.0008213575,0.000033024982,0.000018739385],"category_scores_gemma":[0.000021721075,0.00013699612,0.0000657377,0.0003126851,0.00001780595,0.00034629132,0.00015653533,0.00010551778,0.000017676914],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050163035,0.0001466302,0.00021391941,0.000034597495,0.000021395399,0.0000048089096,0.00027441813,0.0030820614,0.00071609695,0.33635783,0.030950718,0.62814736],"study_design_scores_gemma":[0.0012493526,0.00023418218,0.0010275014,0.00017969616,0.0000033656013,0.000014282559,0.000010922837,0.5367089,0.00045119016,0.0015774018,0.45821357,0.0003296117],"about_ca_topic_score_codex":0.0000034045827,"about_ca_topic_score_gemma":0.000006628592,"teacher_disagreement_score":0.74033517,"about_ca_system_score_codex":0.000049706712,"about_ca_system_score_gemma":0.00004790615,"threshold_uncertainty_score":0.558654},"labels":[],"label_agreement":null},{"id":"W2155930199","doi":"10.1109/glocom.2010.5683379","title":"Zero-Forcing Based Decode-and-Forward Cooperative Relaying Scheme over Doubly Selective Fading Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fading; Orthogonal frequency-division multiplexing; Relay; Computer science; Transmission (telecommunications); Signal-to-noise ratio (imaging); Bandwidth (computing); Diversity scheme; Electronic engineering; Interference (communication); Decoding methods; Telecommunications; Algorithm; Power (physics); Engineering; Channel (broadcasting); Physics","score_opus":0.02694210092469804,"score_gpt":0.28111834284706466,"score_spread":0.2541762419223666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155930199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12896392,0.000116292744,0.85644835,0.0013030004,0.00046234173,0.00031539483,9.4945347e-7,0.00034059281,0.012049155],"genre_scores_gemma":[0.92420095,0.00005431513,0.0734553,0.0014183566,0.000067883026,0.00004002726,0.0000027862804,0.000017573197,0.0007428252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984093,0.00012579575,0.00029787072,0.00053935533,0.00022472376,0.00040298337],"domain_scores_gemma":[0.9983551,0.00037028844,0.00010444836,0.0006679523,0.00032166846,0.0001805494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006522962,0.00024606838,0.00025087866,0.00018325656,0.00077215343,0.0004501621,0.00078110065,0.000111868234,0.00013285532],"category_scores_gemma":[0.00018303886,0.0002187381,0.000067662746,0.00074047444,0.00008583921,0.000976987,0.00055811007,0.0006472887,0.000034758137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057228706,0.00017905998,0.01025196,0.000033881326,0.0001606794,0.000016108424,0.009039726,0.008474638,0.18308441,0.71380234,0.004577443,0.07032251],"study_design_scores_gemma":[0.0009246653,0.00007522329,0.0012560543,0.000050753824,0.0000060666734,0.000012986852,0.000031949887,0.960213,0.030123638,0.00062535115,0.0062260213,0.00045431434],"about_ca_topic_score_codex":0.000018302555,"about_ca_topic_score_gemma":0.000112631395,"teacher_disagreement_score":0.95173836,"about_ca_system_score_codex":0.000060257757,"about_ca_system_score_gemma":0.00013019465,"threshold_uncertainty_score":0.8919881},"labels":[],"label_agreement":null},{"id":"W2155950678","doi":"10.1109/glocom.2009.5425456","title":"Optimum/Sub-Optimum Detection for Multi-Branch Cooperative Diversity Networks with Limited CSI","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Channel state information; Relay; Computer science; Cooperative diversity; Independent and identically distributed random variables; Overhead (engineering); Signal-to-noise ratio (imaging); Algorithm; Maximal-ratio combining; Path (computing); Mathematical optimization; Mathematics; Telecommunications; Wireless; Statistics; Random variable; Decoding methods; Fading; Computer network; Power (physics)","score_opus":0.04916008592958765,"score_gpt":0.2697308120402354,"score_spread":0.22057072611064776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155950678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014033086,0.00016236729,0.983311,0.0007615716,0.00015787997,0.0005431569,9.046787e-7,0.00031845056,0.00071157905],"genre_scores_gemma":[0.9296139,0.00023934543,0.06823904,0.0014046294,0.00006375767,0.000024862666,0.0000060161933,0.0000075787366,0.00040086152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882424,0.00011606088,0.00018473115,0.000412439,0.00014879822,0.0003137574],"domain_scores_gemma":[0.99863404,0.00013236585,0.000081978396,0.00057732593,0.00045720412,0.00011711042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025296438,0.0001997801,0.00019864707,0.000090894966,0.001071354,0.00020203751,0.0007678359,0.00008231708,0.000009782299],"category_scores_gemma":[0.000025965755,0.00016336399,0.00006635057,0.0006741451,0.00004942547,0.0006196646,0.00029195027,0.00020871025,0.000007694874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039378586,0.00074665016,0.00068640604,0.000009538057,0.000153851,0.000007708379,0.003093812,0.2055089,0.00837078,0.019157397,0.0032067264,0.7586644],"study_design_scores_gemma":[0.0013082346,0.0005553117,0.0028304197,0.000020665766,0.000010464378,0.0000057954703,0.000022387967,0.9875277,0.006625602,0.000035855424,0.00077744765,0.0002801024],"about_ca_topic_score_codex":0.0000039202178,"about_ca_topic_score_gemma":0.00015149385,"teacher_disagreement_score":0.9155808,"about_ca_system_score_codex":0.00007521465,"about_ca_system_score_gemma":0.00003331736,"threshold_uncertainty_score":0.8240097},"labels":[],"label_agreement":null},{"id":"W2155964628","doi":"10.1109/vetecs.2010.5493696","title":"Phase Forward Cooperative Communications with Antenna Selection and Continuous Phase Modulation","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Minimum-shift keying; Continuous phase modulation; Relay; Fading; Computer science; Electronic engineering; Modulation (music); Frequency-shift keying; Selection (genetic algorithm); Phase-shift keying; Bit error rate; Bandwidth (computing); Antenna (radio); Telecommunications; Topology (electrical circuits); Demodulation; Engineering; Physics; Electrical engineering; Acoustics; Channel (broadcasting)","score_opus":0.030330957758530244,"score_gpt":0.3184521588631228,"score_spread":0.28812120110459255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155964628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1872103,0.000084970554,0.8072493,0.0024517286,0.00005686196,0.00030131132,0.0000018728848,0.00019719992,0.0024464524],"genre_scores_gemma":[0.93522835,0.00021502323,0.06388067,0.0002932279,0.000024007082,0.000039854505,0.000016019158,0.000007626604,0.00029525132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918103,0.000116555646,0.00018758494,0.0002498766,0.0001115548,0.00015339382],"domain_scores_gemma":[0.9984346,0.000120652854,0.00008171999,0.00086286716,0.00040422118,0.00009590761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024999504,0.00012790973,0.00014285702,0.00009060374,0.0005493191,0.0002510636,0.0006012121,0.000046015124,0.000037702546],"category_scores_gemma":[0.000035448444,0.000102235,0.000019046855,0.00047606727,0.00012148477,0.0007174158,0.00026990476,0.00029516124,0.000009351617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005771365,0.0011977525,0.0005463031,0.0000038760613,0.00004968681,0.0000013682378,0.001956875,0.000024625402,0.181917,0.31046712,0.0004846426,0.50329304],"study_design_scores_gemma":[0.0031753585,0.0005298579,0.00032000238,0.0000112360385,0.000007747638,0.000037891707,0.00005574532,0.9844129,0.0024611405,0.00020535047,0.008597444,0.00018534082],"about_ca_topic_score_codex":0.000010902246,"about_ca_topic_score_gemma":0.00078091206,"teacher_disagreement_score":0.98438823,"about_ca_system_score_codex":0.000015647145,"about_ca_system_score_gemma":0.00005553286,"threshold_uncertainty_score":0.4224974},"labels":[],"label_agreement":null},{"id":"W2156092280","doi":"10.1109/twc.2008.070226","title":"Optimal precoder for amplify-and-forward half-duplex relay system","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Relay; Quadrature amplitude modulation; QAM; Relay channel; Farey sequence; Coding gain; Computer science; Phase-shift keying; Ergodic theory; Control theory (sociology); Bit error rate; Topology (electrical circuits); Mathematics; Decoding methods; Algorithm; Discrete mathematics; Physics; Combinatorics; Mathematical analysis","score_opus":0.06608944252225998,"score_gpt":0.2917054332065233,"score_spread":0.22561599068426333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156092280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007509232,0.0005263708,0.98694026,0.0027459369,0.0002403308,0.0006388379,0.000027554774,0.0005352457,0.0008362415],"genre_scores_gemma":[0.87128586,0.003846727,0.12313947,0.0002071065,0.000019926525,0.000663343,0.000014422681,0.000027768692,0.000795393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833435,0.0002994147,0.0004554403,0.000402849,0.00019620871,0.00031175438],"domain_scores_gemma":[0.99546885,0.00081360247,0.00013631911,0.0031530932,0.00026380233,0.0001643333],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00029924043,0.00023788947,0.0002894509,0.00020750813,0.0024100167,0.00012480993,0.0022456092,0.00012867783,0.000009477732],"category_scores_gemma":[0.0000078488465,0.00024607376,0.0001467905,0.00051013555,0.00026865175,0.00047086598,0.00004957388,0.0004884622,0.000046377776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014310617,0.0020582397,0.0000908261,0.00018920802,0.00061319006,0.000006486135,0.013175447,0.14550194,0.00350061,0.43093616,0.0052143144,0.39857045],"study_design_scores_gemma":[0.00077984325,0.00011976482,0.00011851059,0.00010074862,0.00003313388,0.000094565636,0.00016198147,0.9668859,0.0016383459,0.00001898454,0.029668516,0.00037968258],"about_ca_topic_score_codex":0.000022757813,"about_ca_topic_score_gemma":0.00011614557,"teacher_disagreement_score":0.86380076,"about_ca_system_score_codex":0.0001369755,"about_ca_system_score_gemma":0.00011854271,"threshold_uncertainty_score":0.99999917},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03754363206759547,"score_gpt":0.3099601509320104,"score_spread":0.2724165188644149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156260722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14963631,0.0022947686,0.8025865,0.025497193,0.0010421844,0.0016530505,0.0000054761595,0.0003527469,0.016931761],"genre_scores_gemma":[0.95083445,0.0016258551,0.04604372,0.0009172978,0.00020838309,0.00004492649,0.000011709069,0.000028017754,0.00028566484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962128,0.0011152183,0.0009221036,0.0003430236,0.00070689176,0.00069997],"domain_scores_gemma":[0.99206895,0.0032405243,0.00035043305,0.002010276,0.0020436367,0.0002861602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004663292,0.00029216264,0.00046851297,0.00071774947,0.00090618624,0.00043162343,0.003508864,0.00011218745,0.000022386372],"category_scores_gemma":[0.0013632311,0.00026098837,0.00008118727,0.0038494715,0.00009671128,0.00052983896,0.0004318384,0.0018905756,0.000032826043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058302986,0.0048474763,0.11992697,0.000036478315,0.000732387,0.00046305443,0.05237641,0.22815314,0.003919975,0.079084754,0.046249613,0.45837945],"study_design_scores_gemma":[0.05799516,0.0019606948,0.31149858,0.007961773,0.00013363057,0.001130716,0.0026374399,0.4260962,0.0022143135,0.0045801327,0.17958808,0.0042032553],"about_ca_topic_score_codex":0.000033934724,"about_ca_topic_score_gemma":0.0052658347,"teacher_disagreement_score":0.8011981,"about_ca_system_score_codex":0.0004752456,"about_ca_system_score_gemma":0.00029237807,"threshold_uncertainty_score":0.9999842},"labels":[],"label_agreement":null},{"id":"W2156340327","doi":"10.1109/glocom.2008.ecp.955","title":"Cross-Layer Cooperative Triple Busy Tone Multiple Access for Wireless Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Throughput; Physical layer; Wireless; Hop (telecommunications); Scheme (mathematics); Wireless network; Node (physics); Diversity gain; Cooperative diversity; Channel (broadcasting); Fading; Telecommunications; Engineering","score_opus":0.10444547696914365,"score_gpt":0.36809295563745387,"score_spread":0.26364747866831023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156340327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041731562,0.00030417045,0.95323175,0.00065585395,0.0004393576,0.00057932205,0.00000416073,0.00026383408,0.0027899886],"genre_scores_gemma":[0.97715837,0.0008075781,0.014748057,0.0014837211,0.00015648532,0.00019175558,0.000022156806,0.000017330043,0.005414527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985197,0.000117082905,0.0003448303,0.00045982006,0.00017024604,0.00038831314],"domain_scores_gemma":[0.9978846,0.0004747164,0.00009434509,0.00085527694,0.0005577766,0.00013330561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031423644,0.00020400186,0.00026297526,0.00007305993,0.0009889936,0.00043222017,0.0018743481,0.00008733808,0.00011210507],"category_scores_gemma":[0.00009966165,0.00017561408,0.00009930511,0.0006665905,0.00013070679,0.0011364811,0.0007832439,0.00018775175,0.000022695991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038376905,0.0013068415,0.06655239,0.000043063235,0.00031182292,0.000040240862,0.0057345517,0.060611665,0.005693536,0.4042272,0.22051978,0.23457512],"study_design_scores_gemma":[0.0014613513,0.00007457435,0.006306528,0.000013468646,0.000002699743,0.000013412415,0.000015702424,0.96507657,0.0040888023,0.00006237188,0.022568265,0.00031625625],"about_ca_topic_score_codex":0.000025551848,"about_ca_topic_score_gemma":0.00026625473,"teacher_disagreement_score":0.9384837,"about_ca_system_score_codex":0.00005335546,"about_ca_system_score_gemma":0.000101771104,"threshold_uncertainty_score":0.7606639},"labels":[],"label_agreement":null},{"id":"W2156419975","doi":"10.1109/wcnc.2007.338","title":"Diversity Order Bounds for Wireless Relay Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Codebook; Relay; Computer science; Outage probability; Diversity gain; Wireless; Encoding (memory); Coding (social sciences); Linear network coding; Upper and lower bounds; Wireless network; Algorithm; Computer network; Telecommunications; Mathematics; Decoding methods; Fading; Artificial intelligence; Statistics","score_opus":0.0382499728672371,"score_gpt":0.2825049202106363,"score_spread":0.24425494734339917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156419975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011920927,0.000110444416,0.97837156,0.00067159836,0.00026787096,0.00012694235,1.215464e-7,0.0001509624,0.008379585],"genre_scores_gemma":[0.9580504,0.00010445513,0.03827482,0.001204397,0.000066423185,0.0000036205086,0.0000018280709,0.000003904333,0.0022901604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934113,0.000026911093,0.00012325306,0.00018297811,0.000095094634,0.0002306149],"domain_scores_gemma":[0.9990217,0.00022267806,0.00003623116,0.00045674964,0.00019153327,0.00007112819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065215625,0.00007299397,0.00008164856,0.000042039217,0.0011344537,0.00006756784,0.00085478765,0.000045295143,0.000026241474],"category_scores_gemma":[0.00002121651,0.000066119275,0.00004009818,0.00040679917,0.00003101108,0.00023097085,0.0016362127,0.000096167736,0.000007865262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001464043,0.000057294303,0.006034724,0.0000027304807,0.000019261508,0.0000020006253,0.0010592674,0.00048419173,0.00007978753,0.7974079,0.009902726,0.18493547],"study_design_scores_gemma":[0.00062641205,0.00006955351,0.0114148045,0.000012269235,0.0000051866546,0.0000038629196,0.000045875717,0.93332773,0.00019592028,0.0010177952,0.052994903,0.00028567459],"about_ca_topic_score_codex":0.0000052678197,"about_ca_topic_score_gemma":0.00016535578,"teacher_disagreement_score":0.94612944,"about_ca_system_score_codex":0.000036513313,"about_ca_system_score_gemma":0.000016553073,"threshold_uncertainty_score":0.87254155},"labels":[],"label_agreement":null},{"id":"W2156486698","doi":"10.1109/twc.2011.072011.101665","title":"Relay and Power Allocation Schemes for OFDM-Based Cognitive Radio Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Mitacs","keywords":"Cognitive radio; Relay; Orthogonal frequency-division multiplexing; Computer science; Interference (communication); Mathematical optimization; Transmission (telecommunications); Power (physics); Power budget; Optimization problem; Integer programming; Integer (computer science); Wireless; Computer network; Telecommunications; Algorithm; Power control; Mathematics; Channel (broadcasting)","score_opus":0.07289016802376902,"score_gpt":0.2896526392205807,"score_spread":0.2167624711968117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156486698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004174971,0.0009398691,0.99136734,0.0011780612,0.0002269641,0.000757299,0.000025107569,0.00026202376,0.0010683894],"genre_scores_gemma":[0.96568745,0.0012956812,0.03174219,0.00026379962,0.000007730407,0.00078422256,0.000014192922,0.000022792396,0.00018192302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861586,0.00031966413,0.00035984762,0.0003346235,0.0001487911,0.0002212003],"domain_scores_gemma":[0.9965688,0.00080593885,0.0001447937,0.001932664,0.00043116984,0.00011664363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037423274,0.00019667804,0.00021074778,0.0002209551,0.0010174877,0.00013452377,0.0013665584,0.00010061337,0.000014789812],"category_scores_gemma":[0.000017538212,0.0002058111,0.00009164235,0.00048036873,0.00023690992,0.00043110465,0.000021101894,0.00031280375,0.000019803727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024485477,0.0034167338,0.00019900559,0.00012413503,0.0005511438,0.0000019428564,0.014771642,0.0024028595,0.005219163,0.5743716,0.0006368429,0.39806008],"study_design_scores_gemma":[0.0023314378,0.0004491429,0.00065286225,0.00046328257,0.000107220774,0.000016794767,0.0006287583,0.96771246,0.01645842,0.0002897141,0.010109781,0.00078014465],"about_ca_topic_score_codex":0.000021495496,"about_ca_topic_score_gemma":0.00007450196,"teacher_disagreement_score":0.96530956,"about_ca_system_score_codex":0.00006884037,"about_ca_system_score_gemma":0.00011610244,"threshold_uncertainty_score":0.8392733},"labels":[],"label_agreement":null},{"id":"W2156526449","doi":"10.1109/twc.2011.080311.102267","title":"Exact Performance Analysis of Dual-Hop Semi-Blind AF Relaying over Arbitrary Nakagami-m Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Relay; Rayleigh fading; Moment-generating function; Computer science; Diversity gain; Probability density function; Fading distribution; Wireless; Maximal-ratio combining; Algorithm; Telecommunications; Topology (electrical circuits); Mathematics; Statistics; Channel (broadcasting); Physics","score_opus":0.0767343211503182,"score_gpt":0.292687784334668,"score_spread":0.21595346318434983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156526449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25853294,0.00041197345,0.73482805,0.00033629235,0.00026832943,0.0002967747,0.000018761133,0.00025738106,0.005049463],"genre_scores_gemma":[0.98206496,0.0061708675,0.011140676,0.00020324747,0.000012256581,0.00012948188,0.00001545225,0.000026142798,0.00023691505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776196,0.00043161074,0.00071305735,0.00042371496,0.00032594203,0.00034370832],"domain_scores_gemma":[0.9944321,0.0005231358,0.00031927985,0.0043099364,0.0002707291,0.0001448009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055584946,0.00028096305,0.00046443084,0.0010504856,0.0010362914,0.00009184167,0.0027258703,0.0001354923,0.00015345903],"category_scores_gemma":[0.000008520819,0.00029923551,0.00033026197,0.003795762,0.0002464399,0.00095103524,0.00008097715,0.0007271511,0.000030271627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042723434,0.008294534,0.005123955,0.00022136833,0.009623528,0.000015863314,0.10674466,0.16661203,0.033833995,0.106736,0.0004430823,0.56192374],"study_design_scores_gemma":[0.00074618903,0.00012785806,0.0050675212,0.00020221499,0.00042255694,0.00000775565,0.00021346433,0.97402906,0.017933382,0.00010358364,0.0006023314,0.00054410606],"about_ca_topic_score_codex":0.000054633125,"about_ca_topic_score_gemma":0.00016356522,"teacher_disagreement_score":0.807417,"about_ca_system_score_codex":0.000110956425,"about_ca_system_score_gemma":0.00010464219,"threshold_uncertainty_score":0.999946},"labels":[],"label_agreement":null},{"id":"W2156634154","doi":"10.1109/isit.2005.1523449","title":"Rateless coding for wireless relay channels","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fountain code; Computer science; Relay; Wireless; Coding (social sciences); Computer network; Decoding methods; Channel state information; Relay channel; Channel (broadcasting); Online codes; Telecommunications; Block code; Concatenated error correction code; Mathematics","score_opus":0.052714725780883744,"score_gpt":0.29998051073878634,"score_spread":0.2472657849579026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156634154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061695185,0.00018507804,0.9797209,0.006572804,0.00022897213,0.00019043036,3.5936654e-7,0.00020583118,0.00672609],"genre_scores_gemma":[0.9407321,0.00027361678,0.05388924,0.0013060088,0.00016227817,0.000048007565,0.0000019756114,0.0000067732667,0.003579949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931514,0.00004403413,0.00015742076,0.00020414214,0.00008216112,0.00019707858],"domain_scores_gemma":[0.9991807,0.00015047858,0.00004053109,0.00045313357,0.00011597937,0.00005920995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003035748,0.00008429395,0.000105631516,0.000050102204,0.0002439277,0.00016036147,0.0007911301,0.00003155634,0.000039811046],"category_scores_gemma":[0.000018222705,0.00007449627,0.000044618846,0.0002236021,0.000017649838,0.00038093908,0.00022693773,0.00007307871,0.00005523991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026412206,0.000027963511,0.00001643197,0.000003391611,0.0000067739356,2.9392456e-7,0.000528794,0.0005658806,0.0018285336,0.6291341,0.006279131,0.36160603],"study_design_scores_gemma":[0.00035498835,0.000026339725,0.00003747958,0.000017597587,0.000001462534,0.000003543595,0.000020826577,0.8317466,0.016069055,0.000241739,0.15131746,0.00016293129],"about_ca_topic_score_codex":6.8521075e-7,"about_ca_topic_score_gemma":0.000018139242,"teacher_disagreement_score":0.9345626,"about_ca_system_score_codex":0.000034520806,"about_ca_system_score_gemma":0.000026666563,"threshold_uncertainty_score":0.30378696},"labels":[],"label_agreement":null},{"id":"W2156662959","doi":"10.1109/tvt.2011.2138176","title":"Bandwidth-Efficient Bit-Interleaved Coded Modulation Over NAF Relay Channels: Error Performance and Precoder Design","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Algorithm; Bandwidth (computing); Computer science; Upper and lower bounds; Cramér–Rao bound; Modulation (music); Bit error rate; Euclidean distance; Superposition principle; Channel (broadcasting); Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics; Decoding methods; Estimation theory; Artificial intelligence; Physics; Mathematical analysis","score_opus":0.0505269807513634,"score_gpt":0.24961554517677462,"score_spread":0.19908856442541123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156662959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22941159,0.0001370553,0.76892513,0.00041053802,0.00029664935,0.0003070788,8.9891444e-7,0.00039098735,0.00012008262],"genre_scores_gemma":[0.9731023,0.00033688336,0.02610065,0.00012879426,0.000008670375,0.000121727964,7.2540104e-7,0.00001706815,0.00018322666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869984,0.00013759565,0.00027465317,0.00045494636,0.00015070553,0.00028224124],"domain_scores_gemma":[0.9988603,0.00005295296,0.00008979554,0.0008095895,0.00012272783,0.000064627704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028235844,0.0002039709,0.00019954835,0.00046476113,0.00039748402,0.000047163634,0.00059184805,0.00022181886,0.000059829552],"category_scores_gemma":[0.000007503165,0.0001933535,0.00005775687,0.000712079,0.00014825283,0.00023288181,0.00001854816,0.0004175657,0.00003897348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017331194,0.0009830224,0.00017238925,0.00004090571,0.00020936473,0.000019565212,0.0050342274,0.36465678,0.020748032,0.008004723,0.00019515645,0.5997625],"study_design_scores_gemma":[0.00050094066,0.00027227539,0.0003955568,0.00006131463,0.00001367505,0.000033698558,0.00002521806,0.941094,0.056718852,0.00024333458,0.00041802973,0.00022309246],"about_ca_topic_score_codex":0.0000036651213,"about_ca_topic_score_gemma":0.000012823289,"teacher_disagreement_score":0.74369067,"about_ca_system_score_codex":0.00006733123,"about_ca_system_score_gemma":0.00003079263,"threshold_uncertainty_score":0.78847265},"labels":[],"label_agreement":null},{"id":"W2156676841","doi":"10.1109/ausctw.2009.4805609","title":"Energy Efficient Cooperative Communications using Location based Relaying","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Partenariat Canadien Contre Le Cancer; Australian Research Council; University of New South Wales","keywords":"Computer science; Computer network; Network packet; Latency (audio); Efficient energy use; Automatic repeat request; Routing protocol; Node (physics); Hybrid automatic repeat request; Wireless; Wireless sensor network; Distributed computing; Telecommunications; Telecommunications link","score_opus":0.0673293341618071,"score_gpt":0.30958002584984146,"score_spread":0.24225069168803437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156676841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011969402,0.00075297075,0.9811453,0.004973873,0.000063088955,0.000096436044,2.4717804e-7,0.00021588751,0.011555216],"genre_scores_gemma":[0.8796451,0.000105127336,0.1169915,0.0030925386,0.000015413021,0.0000072983275,0.0000066712373,0.000004494943,0.00013186883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988843,0.00027452174,0.00025120017,0.00024285438,0.00016170833,0.00018537829],"domain_scores_gemma":[0.9975879,0.00015202837,0.00008154472,0.0017087649,0.0003943584,0.000075377044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029218217,0.00012297333,0.00011935502,0.00012666672,0.00064576603,0.00018296638,0.0014497468,0.000041671185,0.00002170485],"category_scores_gemma":[0.000043294185,0.000115436436,0.0000384156,0.0010850172,0.00005600368,0.0002447131,0.00027641133,0.00012948755,0.000015297648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026620457,0.00017638298,0.000025073157,0.0000011125621,0.000006316119,7.003903e-7,0.00039722244,0.09233058,0.004991992,0.81505644,0.00031612278,0.086695395],"study_design_scores_gemma":[0.00019809126,0.00003645216,0.00023120272,0.000031437707,0.0000031750894,0.0000028383513,0.000023748944,0.9932173,0.0020349731,0.00019725159,0.0038722658,0.00015125585],"about_ca_topic_score_codex":0.000012452098,"about_ca_topic_score_gemma":0.000023475315,"teacher_disagreement_score":0.9008867,"about_ca_system_score_codex":0.00011505942,"about_ca_system_score_gemma":0.00015212274,"threshold_uncertainty_score":0.49667755},"labels":[],"label_agreement":null},{"id":"W2156681981","doi":"10.1109/tvt.2009.2021180","title":"System Design and Throughput Analysis for Multihop Relaying in Cellular Systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Throughput; Computer network; Relay; Computer science; Overhead (engineering); Cellular network; Physical layer; Reuse; Path loss; Spectral efficiency; Wireless; Distributed computing; Engineering; Channel (broadcasting); Telecommunications","score_opus":0.03234872205798616,"score_gpt":0.2617179702477937,"score_spread":0.22936924818980753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156681981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013162016,0.001267081,0.9833616,0.0010754672,0.00012713019,0.0005687015,0.0000012069349,0.00040882293,0.000027968243],"genre_scores_gemma":[0.95441204,0.00025141842,0.045087636,0.0000595192,0.0000060763487,0.0001448359,7.929258e-7,0.0000070789233,0.000030618412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987773,0.00016044575,0.00030336907,0.0004119964,0.000103881976,0.0002430223],"domain_scores_gemma":[0.99891233,0.00014509606,0.00007522935,0.0007361766,0.0000915063,0.000039667135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294628,0.00015250024,0.00030979185,0.0009072779,0.00028686307,0.0000751872,0.0005201501,0.00020158208,7.175392e-7],"category_scores_gemma":[0.000007189925,0.00015086117,0.000090259935,0.0020044153,0.000046774498,0.00015956695,0.0000048181505,0.00027391818,0.000004134589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026875774,0.0002302475,0.00007420892,0.00003859734,0.00029155964,0.000033832654,0.00049256725,0.8027973,0.020956965,0.07492067,0.000019046813,0.10011811],"study_design_scores_gemma":[0.0004712908,0.00015144987,0.000048782353,0.00006212217,0.00006543049,0.000015282725,0.00011617924,0.98567283,0.012780932,0.00014533428,0.00030081067,0.00016955101],"about_ca_topic_score_codex":0.0000060741913,"about_ca_topic_score_gemma":0.0000127493695,"teacher_disagreement_score":0.94125,"about_ca_system_score_codex":0.000116922936,"about_ca_system_score_gemma":0.000022993778,"threshold_uncertainty_score":0.61519396},"labels":[],"label_agreement":null},{"id":"W2156812364","doi":"10.1109/twc.2009.080453","title":"Scaling laws of single-hop cognitive networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Army Research Office; Multidisciplinary University Research Initiative","keywords":"Cognitive radio; Transmitter; Transmitter power output; Computer science; Cognitive network; Throughput; Transmission (telecommunications); Computer network; Scaling; Cognition; Topology (electrical circuits); Telecommunications; Wireless; Mathematics; Channel (broadcasting)","score_opus":0.05695928875388434,"score_gpt":0.2964009590498511,"score_spread":0.23944167029596675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156812364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049381265,0.0006666266,0.987517,0.0025194867,0.0001550364,0.00026347963,0.000007848801,0.000250675,0.0036817295],"genre_scores_gemma":[0.9829435,0.0031721992,0.013041267,0.00065786135,0.000016217524,0.000042026102,0.000008259581,0.000013095145,0.00010559654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983776,0.00038638455,0.0004842564,0.00028201888,0.00021287157,0.00025685903],"domain_scores_gemma":[0.9959746,0.0008878635,0.00018849877,0.0024741697,0.00036598922,0.000108895954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029355782,0.00019608591,0.0002670291,0.00021670207,0.00072101137,0.00010140817,0.0023521069,0.000102006845,0.000021506976],"category_scores_gemma":[0.000014846299,0.00021020848,0.00015446437,0.0011106766,0.00021080051,0.00041502205,0.000025927367,0.0005132307,0.000020901658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021295707,0.0013158527,0.000008209351,0.0000044324825,0.00006030018,8.1361856e-7,0.0013762445,0.013025817,0.006319055,0.03811223,0.000074895375,0.9396809],"study_design_scores_gemma":[0.001282627,0.0004527921,0.0005330564,0.00059516943,0.0000745668,0.000018140081,0.00029137844,0.9589822,0.034466226,0.0009287101,0.0016782641,0.0006968526],"about_ca_topic_score_codex":0.000007329517,"about_ca_topic_score_gemma":0.00007726473,"teacher_disagreement_score":0.97800535,"about_ca_system_score_codex":0.000067344015,"about_ca_system_score_gemma":0.000059742833,"threshold_uncertainty_score":0.85720533},"labels":[],"label_agreement":null},{"id":"W2156917478","doi":"10.1109/glocom.2008.ecp.859","title":"Ergodic Capacity of Multi-Hop Wireless Relaying Systems in Rayleigh Fading","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ergodic theory; Upper and lower bounds; Rayleigh fading; Fading; Hop (telecommunications); Computer science; Topology (electrical circuits); Channel state information; Harmonic mean; Wireless; Ergodicity; Transmission (telecommunications); Telecommunications; Channel capacity; Mathematics; Channel (broadcasting); Mathematical analysis; Statistics; Combinatorics","score_opus":0.10077256158059339,"score_gpt":0.2777086055283463,"score_spread":0.17693604394775292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156917478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66830504,0.0006372418,0.3282119,0.00009263956,0.00017306292,0.00013332284,2.687722e-7,0.000088761066,0.0023577302],"genre_scores_gemma":[0.9889405,0.00060461916,0.0100959595,0.000059631555,0.00001320541,0.000011726057,4.6119462e-7,0.000005309737,0.0002686166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989047,0.00019813502,0.00033992968,0.00021452215,0.0001571005,0.0001856042],"domain_scores_gemma":[0.99903494,0.00015772812,0.00008668149,0.0005631343,0.00010550938,0.000051998162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000388343,0.00009802172,0.00020825557,0.00014668879,0.00016324548,0.000030093428,0.0007469952,0.000048334605,0.000008455798],"category_scores_gemma":[0.000042095966,0.000089951536,0.000039694085,0.000608846,0.00006413558,0.00032288692,0.00027499313,0.00017789514,0.000012618803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021830863,0.0008211781,0.16208279,0.00017525085,0.000075997916,0.00008785318,0.03841068,0.020799078,0.13587233,0.58440804,0.0015151257,0.05572983],"study_design_scores_gemma":[0.0007150811,0.000026178948,0.016231544,0.00016720961,0.0000014293994,0.000039766583,0.00015634342,0.97723013,0.004508649,0.000017352007,0.0006736958,0.00023260352],"about_ca_topic_score_codex":0.00015965581,"about_ca_topic_score_gemma":0.0001112773,"teacher_disagreement_score":0.9564311,"about_ca_system_score_codex":0.00006609917,"about_ca_system_score_gemma":0.00004342379,"threshold_uncertainty_score":0.36681172},"labels":[],"label_agreement":null},{"id":"W2157133510","doi":"10.1109/twc.2011.120911.102240","title":"Performance of Amplify-and-Forward Systems with Partial Relay Selection under Spectrum-Sharing Constraints","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Computer science; Transmitter; Moment-generating function; Node (physics); Context (archaeology); Interference (communication); Signal-to-noise ratio (imaging); Relay channel; Bit error rate; Computer network; Selection (genetic algorithm); Wireless; Topology (electrical circuits); Telecommunications; Probability density function; Mathematics; Statistics; Channel (broadcasting)","score_opus":0.06224736732521674,"score_gpt":0.26523537476266634,"score_spread":0.2029880074374496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157133510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13367893,0.00011632674,0.8633632,0.00027251913,0.00012216794,0.00028680265,0.000005520723,0.0001778036,0.0019767417],"genre_scores_gemma":[0.9871753,0.0020883067,0.010436562,0.00004857604,0.000008244262,0.00011744822,0.0000026795358,0.000016835853,0.00010606646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871606,0.00019331943,0.00039133744,0.0002916934,0.00018567643,0.00022190371],"domain_scores_gemma":[0.99764305,0.00016889653,0.00018313831,0.0017507831,0.00015621772,0.00009788352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030292972,0.00017833262,0.00022864639,0.00019581162,0.0007157533,0.000073830975,0.0013467814,0.000082944105,0.00003075667],"category_scores_gemma":[0.0000020424302,0.0001673604,0.000047564485,0.00062333624,0.00041562517,0.00046076335,0.000034339646,0.00047193826,0.000014927864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003174125,0.002609925,0.007879556,0.00019897378,0.0008932091,0.0000025383185,0.014667968,0.11154839,0.007521068,0.677777,0.000059209775,0.17652476],"study_design_scores_gemma":[0.00073155353,0.00042649196,0.0025375725,0.0003085363,0.000059738093,0.00007964747,0.000279008,0.9808199,0.013983006,0.00007405877,0.00029265822,0.0004078547],"about_ca_topic_score_codex":0.00006753671,"about_ca_topic_score_gemma":0.00018655711,"teacher_disagreement_score":0.8692715,"about_ca_system_score_codex":0.00007194788,"about_ca_system_score_gemma":0.00008681629,"threshold_uncertainty_score":0.6824759},"labels":[],"label_agreement":null},{"id":"W2157138726","doi":"10.1109/icc.2012.6364439","title":"Dual-hop amplify-and-forward transmission with imperfect channel estimates at the relay","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Relay channel; Fading; Nakagami distribution; Channel state information; Computer science; Channel (broadcasting); Transmission (telecommunications); Terminal (telecommunication); Node (physics); Topology (electrical circuits); Electronic engineering; Computer network; Telecommunications; Wireless; Electrical engineering; Engineering; Power (physics); Physics","score_opus":0.027952749570559876,"score_gpt":0.26867354597570775,"score_spread":0.24072079640514787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157138726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06450311,0.0064820987,0.90474385,0.011031606,0.00014905655,0.00035192663,6.7784276e-7,0.00031101357,0.012426639],"genre_scores_gemma":[0.9855447,0.0011030587,0.010933727,0.0007158117,0.00003966307,0.000022957072,0.0000023804093,0.000008742215,0.0016289717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924135,0.00009335436,0.000112047586,0.00016760075,0.00013498875,0.0002506852],"domain_scores_gemma":[0.9990331,0.00026037733,0.00003488753,0.000512391,0.00003856004,0.000120679084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043563763,0.000120147626,0.00010363172,0.000029093906,0.00050671434,0.00009458071,0.0003495745,0.000034214376,0.00009977672],"category_scores_gemma":[0.000013027146,0.00006027444,0.000025694404,0.00021527857,0.00006812425,0.00035835453,0.00033785636,0.00013387285,0.000052208554],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012243057,0.0003303529,0.010536994,0.00005350057,0.00018149454,0.0000067800815,0.034541596,0.0012428694,0.01664903,0.2300357,0.028927537,0.67737174],"study_design_scores_gemma":[0.0021656177,0.00061327877,0.02852909,0.00023757952,0.0000767335,0.0005258399,0.00041167322,0.5841362,0.040810972,0.0007362117,0.34034544,0.0014113543],"about_ca_topic_score_codex":0.0000061500236,"about_ca_topic_score_gemma":0.000017576735,"teacher_disagreement_score":0.92104155,"about_ca_system_score_codex":0.000023623974,"about_ca_system_score_gemma":0.000014941237,"threshold_uncertainty_score":0.3897288},"labels":[],"label_agreement":null},{"id":"W2157535897","doi":"10.1109/icc.2008.860","title":"Distributed coded Cooperation for Relay Channels Operating in the Decode-and-Forward Mode","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Node (physics); Computer science; Decoding methods; Fading; Relay channel; Transmission (telecommunications); Phase-shift keying; Linear network coding; Keying; Computer network; Expression (computer science); Topology (electrical circuits); Bit error rate; Telecommunications; Mathematics; Power (physics); Engineering; Physics; Network packet","score_opus":0.05976675753933289,"score_gpt":0.30581716557835814,"score_spread":0.24605040803902525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157535897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056695484,0.00019158721,0.9367132,0.005254801,0.00007646326,0.0004418836,0.0000035267628,0.00006902037,0.00055401516],"genre_scores_gemma":[0.9746624,0.00041020586,0.023148432,0.0013708143,0.00003438943,0.00013716702,0.000030333855,0.0000051693446,0.00020105863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990569,0.00016723473,0.00024380031,0.00023106634,0.00010874193,0.00019228892],"domain_scores_gemma":[0.9990638,0.0003060169,0.000039172453,0.00041956312,0.00013249514,0.000038975268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005282201,0.00010472367,0.00012723249,0.000046681685,0.0005878859,0.00017067557,0.000624367,0.00004040278,0.000006143866],"category_scores_gemma":[0.00014385945,0.00007215942,0.000029717412,0.0003718818,0.000039671413,0.00038650655,0.00016750945,0.0001240183,0.0000045138036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021817477,0.00026437684,0.0025224388,0.000018786963,0.000034861634,0.000011112246,0.024955414,0.06009631,0.0035976812,0.8623373,0.017981853,0.02815803],"study_design_scores_gemma":[0.00049148145,0.000048396392,0.0007313051,0.000012017002,0.0000015833008,0.000021417944,0.00006325817,0.9939386,0.00076162413,0.00019782769,0.0036106068,0.00012185497],"about_ca_topic_score_codex":0.000012824541,"about_ca_topic_score_gemma":0.00012592014,"teacher_disagreement_score":0.9338423,"about_ca_system_score_codex":0.000029286151,"about_ca_system_score_gemma":0.000047479803,"threshold_uncertainty_score":0.45216027},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.048744185668960945,"score_gpt":0.2632591302108401,"score_spread":0.21451494454187914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157661883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08082145,0.0001802536,0.9171991,0.0007407163,0.00011457621,0.00019189672,0.000010929362,0.0001928825,0.0005482072],"genre_scores_gemma":[0.9689818,0.013940743,0.016413445,0.0002759918,0.000010615761,0.000056933783,0.000014284626,0.000010590082,0.0002955797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859184,0.00032089272,0.0002926589,0.00033719052,0.00022622065,0.00023121666],"domain_scores_gemma":[0.99740595,0.00028174536,0.0001148407,0.0018217502,0.00025242186,0.0001232769],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00023056088,0.0001996614,0.0002572838,0.00046644785,0.004211997,0.00011127737,0.0015848768,0.00008265655,0.000054057535],"category_scores_gemma":[0.000005496441,0.0002130941,0.000111746886,0.0020664274,0.00030630143,0.0010112061,0.00015040193,0.00042565964,0.000011891621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017705193,0.00037898822,0.0022595148,0.0000072094003,0.0004041838,0.0000017959616,0.007519659,0.95584124,0.00014576511,0.002802134,0.00006681429,0.030554961],"study_design_scores_gemma":[0.000354653,0.00006183289,0.0031679638,0.000022318329,0.00008434438,0.000011863088,0.00004945548,0.9947248,0.0010699313,0.0000061153637,0.00019197947,0.0002547189],"about_ca_topic_score_codex":0.000047509802,"about_ca_topic_score_gemma":0.00017528849,"teacher_disagreement_score":0.9007856,"about_ca_system_score_codex":0.00009706865,"about_ca_system_score_gemma":0.000057151457,"threshold_uncertainty_score":0.9970844},"labels":[],"label_agreement":null},{"id":"W2157830639","doi":"10.1109/twc.2009.081496","title":"Cooperative subcarrier and power allocation for a two-hop decode-and-forward OFCMD based relay network","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Subcarrier; Relay; Computer science; Base station; Hop (telecommunications); Computer network; Algorithm; Topology (electrical circuits); Power (physics); Channel (broadcasting); Mathematics; Combinatorics; Orthogonal frequency-division multiplexing; Physics","score_opus":0.0311976488701588,"score_gpt":0.29491140311851943,"score_spread":0.26371375424836063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157830639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047025387,0.00084156514,0.9789581,0.013679008,0.00014415287,0.0007458561,0.000017448147,0.0002333332,0.0006780532],"genre_scores_gemma":[0.9327571,0.001701489,0.062738694,0.0022679714,0.0000222316,0.00030311733,0.000017635179,0.000020100697,0.00017169259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821323,0.00040195225,0.0004350173,0.00044654854,0.0001749966,0.0003282245],"domain_scores_gemma":[0.99612945,0.000928034,0.00013770447,0.0022248644,0.00039931355,0.00018062742],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00054824055,0.00026963375,0.00029395663,0.00017448577,0.0017076044,0.00026038545,0.0012464878,0.00010942204,0.000014140083],"category_scores_gemma":[0.000021096288,0.000274517,0.00010103983,0.00072568416,0.00021837615,0.0005147416,0.000026674545,0.00043785226,0.000008068057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001595654,0.000968172,0.00007028152,0.000019413119,0.00018751777,0.000001129201,0.004370382,0.078685835,0.0047905357,0.3093271,0.0014800283,0.59994006],"study_design_scores_gemma":[0.0017977449,0.00042679667,0.0005777142,0.00013864037,0.000057786332,0.000011290805,0.000098863304,0.9831068,0.0027499157,0.0009781631,0.009512923,0.00054336415],"about_ca_topic_score_codex":0.0000082210745,"about_ca_topic_score_gemma":0.00029518755,"teacher_disagreement_score":0.9280545,"about_ca_system_score_codex":0.00008614321,"about_ca_system_score_gemma":0.00013863874,"threshold_uncertainty_score":0.9999707},"labels":[],"label_agreement":null},{"id":"W2157929942","doi":"10.1109/dsp-spe.2013.6642597","title":"Non-adaptive distributed compression in networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Encoder; Packet forwarding; Network packet; Distributed source coding; Computer network; Linear network coding; Coding (social sciences); Distributed computing; Algorithm; Decoding methods; Mathematics; Channel code","score_opus":0.027627835013405388,"score_gpt":0.25798102156149044,"score_spread":0.23035318654808506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157929942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006787528,0.00010794596,0.9834798,0.0010905756,0.00008882446,0.00019079569,1.6465579e-7,0.000085645515,0.0081687085],"genre_scores_gemma":[0.99015623,0.00011393334,0.009036282,0.00041988355,0.000017486223,0.000034743854,0.0000050276,0.0000028499458,0.00021353891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999363,0.000065218424,0.00015137704,0.00017008324,0.00007671397,0.00017361312],"domain_scores_gemma":[0.9993099,0.00007635428,0.000032358563,0.0004454785,0.000077761964,0.000058132555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010577945,0.00007696721,0.00009601345,0.000044972094,0.000084302,0.00010938491,0.0006843196,0.00003508378,0.00013927817],"category_scores_gemma":[0.000007518881,0.00006187378,0.000020973977,0.00044064719,0.00002101115,0.00040907573,0.0004823865,0.00014988003,0.000102116326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011256139,0.0003712287,0.017377732,0.0000043803125,0.000022350629,0.000009169502,0.0012333213,0.025593275,0.0017236342,0.31089827,0.08761174,0.55514365],"study_design_scores_gemma":[0.00018470733,0.000016557133,0.050187156,0.000021317075,2.6340734e-7,7.1764134e-7,0.000016782193,0.948065,0.00010927734,0.00039431563,0.00091648096,0.00008744602],"about_ca_topic_score_codex":0.0000405208,"about_ca_topic_score_gemma":0.00005247802,"teacher_disagreement_score":0.98336875,"about_ca_system_score_codex":0.000031685744,"about_ca_system_score_gemma":0.000013002893,"threshold_uncertainty_score":0.25231397},"labels":[],"label_agreement":null},{"id":"W2158027895","doi":"10.1109/acssc.2010.5757835","title":"Admission control-based joint bandwidth and power allocation in multi-user DF relay networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Greedy algorithm; Relay; Computer science; Benchmark (surveying); Bandwidth (computing); Greedy randomized adaptive search procedure; Mathematical optimization; Wireless; Power control; Bandwidth allocation; Power (physics); Algorithm; Computer network; Mathematics; Telecommunications","score_opus":0.02568420318312955,"score_gpt":0.26968965267659784,"score_spread":0.24400544949346828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158027895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026073223,0.0002033036,0.96779233,0.0043904805,0.00022909591,0.00021503703,1.4745345e-7,0.00010247182,0.0009939162],"genre_scores_gemma":[0.9650289,0.00009299301,0.032583285,0.0017638418,0.000015310165,0.000016361828,0.0000021727774,0.0000063701505,0.00049075927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991124,0.00013165,0.00022212726,0.0002595398,0.00010061483,0.00017362017],"domain_scores_gemma":[0.99904287,0.00013301003,0.000057132926,0.0005559393,0.00009719513,0.00011383355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005615164,0.00010965341,0.00012848283,0.000090504414,0.00012531359,0.00012214648,0.00035087037,0.00008469333,0.000104455146],"category_scores_gemma":[0.00009582386,0.00008914429,0.000025915846,0.0002516039,0.0000363029,0.00026267173,0.00014198782,0.00032962754,0.000009990665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001686434,0.0014817351,0.07071886,0.000027066219,0.000055102937,0.000027394508,0.002836679,0.036139224,0.11753181,0.44303903,0.01135987,0.31661457],"study_design_scores_gemma":[0.0012959588,0.000033564316,0.04749953,0.000024208684,0.0000014082988,0.000001939998,0.000005762836,0.9437128,0.00060149014,0.000027438737,0.0066608554,0.00013510046],"about_ca_topic_score_codex":0.00001023084,"about_ca_topic_score_gemma":0.0004005468,"teacher_disagreement_score":0.93895566,"about_ca_system_score_codex":0.00001779692,"about_ca_system_score_gemma":0.000051541952,"threshold_uncertainty_score":0.36351988},"labels":[],"label_agreement":null},{"id":"W2158223124","doi":"10.1109/infcom.2009.5062146","title":"An Efficient Privacy-Preserving Scheme against Traffic Analysis Attacks in Network Coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear network coding; Computer science; Homomorphic encryption; Network packet; Computer network; Traffic analysis; Coding (social sciences); Security analysis; Encryption; Computer security; Mathematics","score_opus":0.03127791796280333,"score_gpt":0.3042366616767051,"score_spread":0.2729587437139018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158223124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5610463,0.0004400514,0.43068212,0.0017302083,0.000075456956,0.00017283588,1.9395914e-7,0.00031036578,0.0055424836],"genre_scores_gemma":[0.9455815,0.00018932552,0.052924957,0.0011566549,0.000056474077,0.0000056065596,0.000007742554,0.0000052309256,0.000072505005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981906,0.0002616301,0.00038639663,0.00047674502,0.00024357293,0.00044107012],"domain_scores_gemma":[0.99796426,0.00011630938,0.00008676533,0.0015970765,0.000093533665,0.00014203052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008561936,0.00017144554,0.0002785818,0.00031676725,0.00027633627,0.00032329775,0.0023260224,0.00005888276,0.000052233976],"category_scores_gemma":[0.00005201327,0.00016269006,0.00010960368,0.0037095184,0.000021602988,0.00037969425,0.00046005327,0.00024315128,0.00001482269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033490414,0.00014036927,0.0019261589,0.0000013344263,0.000028501283,0.000005239019,0.0008585289,0.92778015,0.00039520263,0.0127437925,0.00037966573,0.05573772],"study_design_scores_gemma":[0.00021708907,0.00003501171,0.023681687,0.000026383323,0.000008608121,5.569704e-7,0.000028769753,0.97511506,0.00005176745,0.000038728787,0.0005879068,0.0002084134],"about_ca_topic_score_codex":0.0000022657587,"about_ca_topic_score_gemma":0.00014372927,"teacher_disagreement_score":0.38453522,"about_ca_system_score_codex":0.00008747687,"about_ca_system_score_gemma":0.00004016618,"threshold_uncertainty_score":0.6634308},"labels":[],"label_agreement":null},{"id":"W2158271785","doi":"10.1109/icc.2004.1313183","title":"Equalization for WLAN IEEE 802.11b","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Equalization (audio); Computer science; Algorithm; Channel (broadcasting); Transmission (telecommunications); Electronic engineering; Pairwise error probability; Telecommunications; Engineering","score_opus":0.07914745449609387,"score_gpt":0.3252020781718576,"score_spread":0.24605462367576372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158271785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011327054,0.000076000026,0.99246943,0.0025744224,0.00017120967,0.00013252093,2.8233782e-7,0.0001492972,0.003294151],"genre_scores_gemma":[0.9158215,0.000102669976,0.08170139,0.001449499,0.00005237044,0.000024630579,0.0000042640136,0.000004245389,0.000839424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957585,0.000021975604,0.000103642975,0.00012866624,0.00006586256,0.00010402602],"domain_scores_gemma":[0.9994384,0.00006448924,0.000026384598,0.00034804386,0.00008870723,0.000033946584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014641536,0.000050097202,0.000053137243,0.000035025147,0.00014232022,0.00008532548,0.00045530088,0.000019916932,0.000016353251],"category_scores_gemma":[0.00003201532,0.000044194163,0.0000267771,0.00020469268,0.0000104541205,0.00021662611,0.00007211991,0.000029843286,0.000035894496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.262336e-7,0.000019323908,0.000016671944,0.0000018607726,0.0000026953678,1.2273655e-7,0.00035103122,0.00032289585,0.0031120554,0.97951967,0.00067046384,0.015982276],"study_design_scores_gemma":[0.0035698656,0.00036748426,0.0011879934,0.00008618885,0.000009969657,0.000012170275,0.00008628372,0.67941374,0.043754265,0.08480021,0.18584955,0.00086225424],"about_ca_topic_score_codex":0.0000026523649,"about_ca_topic_score_gemma":0.000038430626,"teacher_disagreement_score":0.9146888,"about_ca_system_score_codex":0.00003033551,"about_ca_system_score_gemma":0.000036107045,"threshold_uncertainty_score":0.18021856},"labels":[],"label_agreement":null},{"id":"W2158382665","doi":"10.1109/wcnc.2010.5506295","title":"Interference Cancellation at the Relay in Two User Wireless Relay Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Single antenna interference cancellation; Time division multiple access; Computer network; Interference (communication); Relay channel; Symbol rate; Antenna (radio); Electronic engineering; Decoding methods; Telecommunications; Bit error rate; Engineering; Channel (broadcasting); Physics","score_opus":0.022836074213822534,"score_gpt":0.28801444353689803,"score_spread":0.2651783693230755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158382665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44886783,0.00024565728,0.5210298,0.0062554223,0.0010541615,0.0002715652,2.2900588e-7,0.00014768797,0.022127666],"genre_scores_gemma":[0.9914635,0.000299346,0.0023269986,0.00071238197,0.000059700124,0.000020485055,0.0000019105498,0.000006002744,0.005109687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990658,0.00015569653,0.0002165796,0.00025167875,0.0001101702,0.00020005902],"domain_scores_gemma":[0.9985972,0.0002647709,0.00006764904,0.0009476373,0.00007638037,0.000046351634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052089506,0.00010306376,0.00009553332,0.000044413326,0.0002311322,0.00012955093,0.0011126818,0.000042841533,0.00021637694],"category_scores_gemma":[0.000025726511,0.00007003324,0.00002909114,0.00046763354,0.000069101654,0.000258248,0.0007372174,0.0005062769,0.000058552472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023401206,0.000075307566,0.048145417,0.0000031381248,0.000014595538,0.0000054735683,0.0030036657,0.032503422,0.008107922,0.54993266,0.012631053,0.34555393],"study_design_scores_gemma":[0.00026148508,0.000010639275,0.014587251,0.000021908414,0.0000012401307,0.000006282409,0.000014781826,0.96647084,0.0008316791,0.00010998941,0.017535906,0.00014802968],"about_ca_topic_score_codex":0.0000781268,"about_ca_topic_score_gemma":0.027551843,"teacher_disagreement_score":0.9339674,"about_ca_system_score_codex":0.00005902621,"about_ca_system_score_gemma":0.000035944697,"threshold_uncertainty_score":0.9901928},"labels":[],"label_agreement":null},{"id":"W2158688706","doi":"10.1109/glocom.2007.656","title":"Beamforming with Limited Feedback in Amplify-and-Forward Cooperative Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Beamforming; Codebook; Computer science; Relay; Selection (genetic algorithm); Signal-to-noise ratio (imaging); Algorithm; Control theory (sociology); Telecommunications; Artificial intelligence; Power (physics)","score_opus":0.0219784783462773,"score_gpt":0.2607744995101915,"score_spread":0.23879602116391418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158688706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027448038,0.00025494653,0.9567895,0.0006392672,0.000048878876,0.0001879452,1.2379981e-7,0.0001122903,0.014519018],"genre_scores_gemma":[0.9631199,0.00040196645,0.034745824,0.0012189762,0.000030094869,0.000008633689,0.0000031828222,0.0000080777545,0.00046331936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989827,0.000060661067,0.00023644377,0.0002754715,0.00012365254,0.00032103172],"domain_scores_gemma":[0.999067,0.00025920037,0.000049717237,0.00040966424,0.00010790837,0.00010652453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006391679,0.00013980734,0.00016205048,0.00013216384,0.0001778012,0.00014856156,0.0004602188,0.000057649486,0.000020088799],"category_scores_gemma":[0.000024202502,0.00010584937,0.000015255843,0.00088225596,0.00006542395,0.00044799325,0.00032464345,0.00027363963,0.000008742981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010029379,0.00015416916,0.01618845,0.000008005111,0.000047564943,0.00003562849,0.0040343436,0.010870975,0.00037211718,0.54652536,0.0006727702,0.42099032],"study_design_scores_gemma":[0.0019154587,0.00031800594,0.041696437,0.00014763203,0.000006142766,0.000057694724,0.00059454056,0.93854696,0.0008937015,0.00018019193,0.014957197,0.0006860332],"about_ca_topic_score_codex":0.000014563797,"about_ca_topic_score_gemma":0.0011088206,"teacher_disagreement_score":0.93567187,"about_ca_system_score_codex":0.000047258978,"about_ca_system_score_gemma":0.000031283147,"threshold_uncertainty_score":0.43164122},"labels":[],"label_agreement":null},{"id":"W2158859726","doi":"10.1109/glocom.2010.5683677","title":"Minimum Broadcast Decoding Delay for Generalized Instantly Decodable Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Linear network coding; Clique problem; Coding (social sciences); Heuristic; Graph; Mathematics; Wireless; Algorithm; Computer science; Mathematical optimization; Theoretical computer science; Computer network; Telecommunications; Network packet","score_opus":0.037944505413176136,"score_gpt":0.29441586644618917,"score_spread":0.25647136103301305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158859726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025417404,0.0003528356,0.95541275,0.0012570517,0.0013367109,0.00040458573,0.0000016757325,0.0003428461,0.015474123],"genre_scores_gemma":[0.5381092,0.00036652846,0.45808515,0.0014835392,0.00033639456,0.00007634591,0.000007731861,0.000019857267,0.0015152273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837697,0.00008259729,0.00039237677,0.00043254573,0.000162014,0.0005535154],"domain_scores_gemma":[0.9980715,0.00044452967,0.00012212346,0.0009514663,0.00023836768,0.00017204744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008392234,0.0002045434,0.00024595027,0.00008999487,0.00078169204,0.00043050604,0.0014334535,0.00010000698,0.00016337342],"category_scores_gemma":[0.00013063088,0.00018774754,0.000117866606,0.00055380556,0.000048508642,0.0005631752,0.00053627935,0.00027382813,0.000037618916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001683479,0.00004324715,0.00040830896,0.000008826963,0.000028438317,0.0000026244752,0.00031152036,0.0004996682,0.021115694,0.7924742,0.021246618,0.16384402],"study_design_scores_gemma":[0.0010328445,0.00006328091,0.000111667774,0.000027069827,0.000010472277,0.000024944318,0.000015952886,0.7575141,0.0031705687,0.0031502603,0.23446818,0.00041064396],"about_ca_topic_score_codex":0.0000060075668,"about_ca_topic_score_gemma":0.0003334681,"teacher_disagreement_score":0.7893239,"about_ca_system_score_codex":0.000034172084,"about_ca_system_score_gemma":0.00010098133,"threshold_uncertainty_score":0.76561224},"labels":[],"label_agreement":null},{"id":"W2159086101","doi":"10.1109/t-wc.2008.070726","title":"Distributed Space-Time Continuous Phase Modulation Code Design","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Node (physics); Decoding methods; Relay; Code (set theory); Algorithm; Fading; Topology (electrical circuits); Set (abstract data type); Mathematics; Combinatorics; Power (physics); Physics","score_opus":0.0733774002326606,"score_gpt":0.30068137087788127,"score_spread":0.22730397064522068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159086101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005261834,0.00019652401,0.9883426,0.0042263465,0.0001511233,0.0005235254,0.00006626609,0.0006636919,0.0005681012],"genre_scores_gemma":[0.94806635,0.0028160333,0.04797293,0.00021711782,0.000015857053,0.00020825099,0.0000533357,0.00002628494,0.00062386744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977616,0.00075139443,0.0004810913,0.0003884428,0.0002928835,0.00032458158],"domain_scores_gemma":[0.99469286,0.00072797027,0.00017926807,0.0038820088,0.00034579178,0.00017212512],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003330412,0.00026347296,0.00031401214,0.00023656212,0.0020113345,0.00012411785,0.0026913215,0.00011439832,0.00006596518],"category_scores_gemma":[0.000016474276,0.00028562947,0.00014790487,0.0011500173,0.00029837055,0.0006327123,0.000038309223,0.00052704196,0.00028191393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021819003,0.009637363,0.00005333841,0.000020376008,0.0004915572,0.000028411852,0.007709108,0.1937833,0.085131235,0.052187435,0.011926507,0.6388132],"study_design_scores_gemma":[0.0013505556,0.00016307579,0.0001421502,0.00004507695,0.000020421507,0.000044408407,0.000021917143,0.9815632,0.010163484,0.00018984934,0.0059222,0.00037364365],"about_ca_topic_score_codex":0.000011684938,"about_ca_topic_score_gemma":0.000032215376,"teacher_disagreement_score":0.9428045,"about_ca_system_score_codex":0.00016389026,"about_ca_system_score_gemma":0.00015532995,"threshold_uncertainty_score":0.9999596},"labels":[],"label_agreement":null},{"id":"W2159214526","doi":"10.1109/wcnc.2006.1696523","title":"Single-carrier frequency domain equalization for broadband cooperative communications","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Relay; Fading; Channel (broadcasting); Topology (electrical circuits); Algorithm; Interference (communication); Decoding methods; Telecommunications; Mathematics; Combinatorics; Physics; Power (physics)","score_opus":0.06226304394846523,"score_gpt":0.3005777697602787,"score_spread":0.2383147258118135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159214526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012315213,0.0010001146,0.94297695,0.0041472153,0.000103961465,0.00043461847,0.000007300487,0.00022050264,0.04987781],"genre_scores_gemma":[0.68290883,0.00016309605,0.31434497,0.00082012947,0.00006760243,0.00014373769,0.00013117095,0.000013261136,0.0014072052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988674,0.00021720644,0.00032379673,0.00025734436,0.00012574276,0.00020850728],"domain_scores_gemma":[0.9976638,0.0004009649,0.00009431762,0.0013720979,0.00041793482,0.000050894756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032338608,0.00013358201,0.00014058323,0.00008315439,0.0006127538,0.00026856858,0.0013600534,0.000054491284,0.0000422647],"category_scores_gemma":[0.00006235177,0.00012371228,0.000057881767,0.0005290466,0.00010169485,0.00052500307,0.00034732692,0.000087571934,0.00001557183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014810566,0.00008728633,0.00021628787,0.000002644649,0.0000073305287,1.3266116e-7,0.00039401627,0.000029772991,0.009860248,0.98144317,0.0025288512,0.0054287817],"study_design_scores_gemma":[0.0035448421,0.00048779027,0.0021534895,0.0001326201,0.000029684912,0.000018297285,0.00032788416,0.14690082,0.016940894,0.23525147,0.5926822,0.0015300115],"about_ca_topic_score_codex":0.000023954737,"about_ca_topic_score_gemma":0.00056361966,"teacher_disagreement_score":0.7461917,"about_ca_system_score_codex":0.00007852095,"about_ca_system_score_gemma":0.00006627032,"threshold_uncertainty_score":0.504484},"labels":[],"label_agreement":null},{"id":"W2159224270","doi":"10.1145/1143549.1143831","title":"A local search heuristic for the global planning of UMTS networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; UMTS frequency bands; Heuristic; Computer science; Mathematical optimization; Local search (optimization); Network planning and design; Core (optical fiber); Cellular network; Order (exchange); Distributed computing; Mathematics; Artificial intelligence; Computer network; Telecommunications","score_opus":0.04860987274623109,"score_gpt":0.32139048338550025,"score_spread":0.27278061063926917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159224270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006134352,0.0011817882,0.9922978,0.0008436048,0.000080112266,0.00013912833,6.546615e-7,0.000043900884,0.004799569],"genre_scores_gemma":[0.9895117,0.000033971668,0.010013205,0.0001955984,0.000049399903,0.000010499895,0.0000016733578,0.00000223867,0.00018168354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994253,0.000053091535,0.00014340694,0.000117388154,0.00010340426,0.0001574121],"domain_scores_gemma":[0.99904686,0.00041101148,0.000029592673,0.00038417522,0.00010629963,0.000022069731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029253616,0.000056357032,0.00007608084,0.000013038995,0.00017779123,0.000059298232,0.0007509747,0.000022006676,0.00000814608],"category_scores_gemma":[0.000013480031,0.00003750041,0.000039430113,0.00029861688,0.00006507222,0.00006462657,0.00026255986,0.0000644576,0.0000022253885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008813975,0.000029424671,0.0013455389,0.0000040133696,0.000010115084,7.1280255e-7,0.000088193985,0.1861941,0.000008487682,0.7227638,0.0055341367,0.08401268],"study_design_scores_gemma":[0.00014942446,0.000026487982,0.0052851182,0.000012228643,0.0000022604086,0.0000026667026,0.000023228939,0.9903272,0.00004988235,0.0010465066,0.0030260836,0.000048905855],"about_ca_topic_score_codex":0.000032248532,"about_ca_topic_score_gemma":0.0000557387,"teacher_disagreement_score":0.9888983,"about_ca_system_score_codex":0.00002630627,"about_ca_system_score_gemma":0.000032424752,"threshold_uncertainty_score":0.15292223},"labels":[],"label_agreement":null},{"id":"W2159319539","doi":"10.1109/twc.2011.060811.100970","title":"An Orthogonal Relay Protocol with Improved Diversity-Multiplexing Tradeoff","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiplexing; Relay; Protocol (science); Computer science; Frame (networking); Orthogonal frequency-division multiplexing; Algorithm; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Combinatorics; Channel (broadcasting); Physics","score_opus":0.08363493631737338,"score_gpt":0.29572066875234854,"score_spread":0.21208573243497514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159319539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002790098,0.0000110984965,0.9846602,0.00055067294,0.00006992198,0.008779981,0.000011763814,0.00053199066,0.002594272],"genre_scores_gemma":[0.8976784,0.00007972117,0.08787645,0.00025663938,0.0000099692425,0.0139486,0.0000061579535,0.00002423833,0.00011986267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981698,0.000490907,0.00034906634,0.0004286991,0.0002478423,0.00031370914],"domain_scores_gemma":[0.99502355,0.00018573004,0.00015999665,0.004175424,0.00024840864,0.0002068724],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00032350927,0.00025510826,0.00021426006,0.00022460139,0.002529212,0.00013068753,0.0041955127,0.000098575525,0.000094922696],"category_scores_gemma":[0.0000027940896,0.0002360485,0.000100366684,0.0008233252,0.00027390535,0.0010907773,0.00008467867,0.0007065585,0.00003162838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006330167,0.010587116,0.0016117456,0.00006417697,0.0005333229,0.000016017279,0.04433375,0.007935106,0.01812395,0.13917573,0.0001744217,0.77681166],"study_design_scores_gemma":[0.0036509107,0.0014257843,0.004536356,0.00023585612,0.000068569774,0.000056455614,0.00053953787,0.9590892,0.023790894,0.00039759034,0.004851128,0.00135772],"about_ca_topic_score_codex":0.00006438202,"about_ca_topic_score_gemma":0.0010024788,"teacher_disagreement_score":0.9511541,"about_ca_system_score_codex":0.00009090124,"about_ca_system_score_gemma":0.00012718249,"threshold_uncertainty_score":0.99876934},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12324918141297982,"score_gpt":0.3613660418809393,"score_spread":0.2381168604679595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159339877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028495272,0.011275315,0.9644369,0.012706955,0.0016727019,0.0032409313,0.0005024368,0.0016250227,0.0016902324],"genre_scores_gemma":[0.86130595,0.014744153,0.12087881,0.0010453996,0.00022944984,0.0005173628,0.0009700958,0.000039019284,0.00026976617],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98901993,0.008265262,0.001135617,0.00065263425,0.00035290213,0.0005736678],"domain_scores_gemma":[0.97472745,0.008364344,0.00054731726,0.013143276,0.0030065097,0.00021113006],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0062363488,0.0004837187,0.00075691834,0.0003620811,0.001801316,0.00081691024,0.012563143,0.0002840249,0.0000047794506],"category_scores_gemma":[0.0011995184,0.0004936269,0.00027394484,0.0020488824,0.00046436273,0.0010512738,0.0015555233,0.00071887736,0.000031384705],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110704466,0.0027552068,0.0034027004,0.000063341795,0.00038543675,0.0000035570479,0.007289936,0.00002654062,0.098512314,0.29412624,0.030673884,0.56265014],"study_design_scores_gemma":[0.004395011,0.00093315815,0.114656575,0.0012174975,0.00011983597,0.00006162472,0.0002029309,0.16878225,0.009704059,0.012590293,0.6835897,0.0037470616],"about_ca_topic_score_codex":0.00010463762,"about_ca_topic_score_gemma":0.0011273882,"teacher_disagreement_score":0.85845643,"about_ca_system_score_codex":0.0001852455,"about_ca_system_score_gemma":0.0002641205,"threshold_uncertainty_score":0.9997515},"labels":[],"label_agreement":null},{"id":"W2159593759","doi":"10.1109/vetecf.2007.252","title":"Decode-and-Forward Cooperative Networks with Relay Selection","year":2007,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Maximal-ratio combining; Selection (genetic algorithm); Upper and lower bounds; Overhead (engineering); Computer science; Cooperative diversity; Detector; Bit error rate; Diversity combining; Algorithm; Mathematics; Telecommunications; Topology (electrical circuits); Decoding methods; Combinatorics; Artificial intelligence; Power (physics); Fading; Physics","score_opus":0.015794107744421235,"score_gpt":0.25179960702835164,"score_spread":0.2360054992839304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159593759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15659636,0.00040987803,0.8403247,0.0013985112,0.00008281819,0.0001321941,1.5916223e-7,0.00038587043,0.00066953606],"genre_scores_gemma":[0.97241014,0.00052808056,0.026600892,0.00029526427,0.000022504626,0.000025631942,0.0000013803049,0.000009546707,0.00010657045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886876,0.00006488358,0.00020440442,0.00040346736,0.00012862775,0.00032982614],"domain_scores_gemma":[0.99886274,0.000087272776,0.00009382794,0.0005155023,0.00036457396,0.0000760573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004290077,0.00016583601,0.00017171305,0.00023200101,0.00034871785,0.00010552679,0.0006782065,0.0002200564,0.000012200624],"category_scores_gemma":[0.00004056108,0.0001441635,0.00002196453,0.00114054,0.0002588373,0.00024953502,0.00020119405,0.00050542323,0.000014273202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036978934,0.00007610263,0.007449476,0.0000063081734,0.000106661544,0.00006159906,0.0003963172,0.00949335,0.009462635,0.74575704,0.00033016116,0.22682333],"study_design_scores_gemma":[0.0008514831,0.0005616001,0.0031815397,0.0001259262,0.000023175864,0.00035165745,0.000116485084,0.934467,0.051170785,0.0007803846,0.007776755,0.0005932188],"about_ca_topic_score_codex":0.0000037897294,"about_ca_topic_score_gemma":0.00030429254,"teacher_disagreement_score":0.92497367,"about_ca_system_score_codex":0.00003729323,"about_ca_system_score_gemma":0.000082229926,"threshold_uncertainty_score":0.5878816},"labels":[],"label_agreement":null},{"id":"W2159680528","doi":"10.1109/icc.2011.5963520","title":"Power-Optimized Routing with Bandwidth Guarantee in Multihop Relaying Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Multipath routing; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Static routing; Link-state routing protocol; Time division multiple access; Routing (electronic design automation); Geographic routing; Distributed computing; Bandwidth (computing); Routing protocol","score_opus":0.03632910076010904,"score_gpt":0.24366059421332506,"score_spread":0.20733149345321603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159680528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015219056,0.0002118925,0.9263395,0.0002072666,0.00009888702,0.00017568306,5.5378894e-8,0.00019960832,0.057548054],"genre_scores_gemma":[0.84870625,0.00020068951,0.15038763,0.00041929324,0.000010255269,0.000013511274,5.786083e-7,0.000009103309,0.00025267393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988244,0.00015598646,0.00026961343,0.0003124018,0.00012170924,0.00031586515],"domain_scores_gemma":[0.99896425,0.00012935016,0.000080244026,0.0006985114,0.000078568504,0.00004906455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050704094,0.00014634647,0.00018502092,0.00010192013,0.00016761661,0.00008955377,0.0008659433,0.00005108276,0.000118560696],"category_scores_gemma":[0.000030856452,0.000112771166,0.00003617719,0.00062470185,0.00003824868,0.00045353817,0.00036387565,0.00027514852,0.000017199345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037361265,0.00062019733,0.048989803,0.000009242763,0.00011617627,0.00016571583,0.035914488,0.033393685,0.00032302528,0.67475736,0.0009479716,0.20438872],"study_design_scores_gemma":[0.0013447133,0.00007521187,0.0070459475,0.00008650983,0.0000021295316,0.0000124362605,0.0001384646,0.9905117,0.00014198896,0.00010813935,0.0002751827,0.00025757015],"about_ca_topic_score_codex":0.000030133999,"about_ca_topic_score_gemma":0.000116306925,"teacher_disagreement_score":0.95711803,"about_ca_system_score_codex":0.000037274127,"about_ca_system_score_gemma":0.000032883272,"threshold_uncertainty_score":0.45986748},"labels":[],"label_agreement":null},{"id":"W2159690431","doi":"10.1109/tcomm.2009.12.080231","title":"Approximate BER Expressions of Distributed Alamouti's Code in Dissimilar Cooperative Networks with Blind Relays","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bit error rate; Code (set theory); Algorithm; Signal-to-noise ratio (imaging); Computer science; Transmission (telecommunications); Channel (broadcasting); Range (aeronautics); Expression (computer science); Topology (electrical circuits); Mathematics; Theoretical computer science; Telecommunications; Decoding methods; Combinatorics; Engineering","score_opus":0.04440532180878933,"score_gpt":0.2974751012675554,"score_spread":0.2530697794587661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159690431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015934152,0.00043969936,0.9901555,0.005154091,0.00006006543,0.00062926474,0.00005559783,0.00015331617,0.0017590345],"genre_scores_gemma":[0.9713841,0.0027023419,0.02527817,0.00025276642,0.0000066704893,0.00020068325,0.000043099993,0.0000143479,0.000117818956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981097,0.00048414132,0.000540809,0.00034754002,0.00021825606,0.00029957265],"domain_scores_gemma":[0.9956727,0.00047816697,0.00017981438,0.0032693183,0.0002744194,0.0001255484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000314214,0.00024250647,0.0003226161,0.00023913891,0.00067699864,0.00009151552,0.0022814602,0.00011165492,0.000029593157],"category_scores_gemma":[0.000014361383,0.00021308292,0.00008783947,0.0016693071,0.00024138368,0.00049250096,0.00003352184,0.00076946226,0.000005707772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028226277,0.0045275623,0.00016651604,0.000013001202,0.000151308,0.000007025112,0.004950625,0.8626249,0.0036096282,0.06257272,0.00073386665,0.060360573],"study_design_scores_gemma":[0.0022886803,0.00039465036,0.0022052473,0.00048532474,0.000042498858,0.000014103945,0.00024779784,0.9859822,0.004781605,0.0003790546,0.0026522302,0.000526629],"about_ca_topic_score_codex":0.000008742806,"about_ca_topic_score_gemma":0.0005255847,"teacher_disagreement_score":0.9697907,"about_ca_system_score_codex":0.00010331513,"about_ca_system_score_gemma":0.00011949832,"threshold_uncertainty_score":0.86892694},"labels":[],"label_agreement":null},{"id":"W2159695079","doi":"10.1109/glocom.2007.837","title":"Performance of Adaptive Relaying Schemes in Cooperative Diversity Systems with ARQ","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Medical Research Council","keywords":"Automatic repeat request; Computer science; Hybrid automatic repeat request; Selective Repeat ARQ; Computer network; Network packet; Selection (genetic algorithm); Go-Back-N ARQ; Jitter; Relay; Sliding window protocol; Real-time computing; Telecommunications; Telecommunications link; Window (computing)","score_opus":0.042805949505163865,"score_gpt":0.24974993050699712,"score_spread":0.20694398100183325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159695079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6398473,0.00023519441,0.3456892,0.000052835967,0.000044980527,0.00015056798,2.0504102e-7,0.000041319887,0.013938394],"genre_scores_gemma":[0.9907158,0.00012946794,0.008837809,0.000047223955,0.0000070942547,0.0000026754149,4.0542696e-7,0.0000025209283,0.0002570022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992748,0.00006102237,0.00017862741,0.00016661373,0.00016279846,0.00015617744],"domain_scores_gemma":[0.99923956,0.00012193899,0.000072623225,0.00031883206,0.00020813527,0.00003889007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055859756,0.00008211815,0.00013870336,0.00010707706,0.00019230979,0.000023609477,0.0005269928,0.000027076763,0.000006245447],"category_scores_gemma":[0.000012674041,0.000063504725,0.000013513829,0.0006341972,0.000059966107,0.00044820385,0.00059881795,0.00013319332,0.0000041359544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028366112,0.00027215632,0.44862628,0.00004866118,0.00008360438,0.000026332966,0.012901026,0.022566114,0.0014086855,0.47792917,0.00019813208,0.035656173],"study_design_scores_gemma":[0.0011243911,0.0005554248,0.084530696,0.00035586368,0.000004896436,0.000012667583,0.0015737374,0.9040118,0.006890247,0.000010310599,0.0005667385,0.00036323813],"about_ca_topic_score_codex":0.00003472276,"about_ca_topic_score_gemma":0.00015636753,"teacher_disagreement_score":0.88144565,"about_ca_system_score_codex":0.000058310496,"about_ca_system_score_gemma":0.000040063132,"threshold_uncertainty_score":0.25896475},"labels":[],"label_agreement":null},{"id":"W2159728727","doi":"10.1109/icccn.2009.5235392","title":"On Maximizing IP Multicast Throughput in Multi-Source Applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; Protocol Independent Multicast; Source-specific multicast; Distributed computing; Throughput; Pragmatic General Multicast; Steiner tree problem; Greedy algorithm; Distance Vector Multicast Routing Protocol; Heuristic; Linear network coding; Tree (set theory); Algorithm; Mathematical optimization; Network packet; Mathematics; Wireless","score_opus":0.07323540381293712,"score_gpt":0.3274695351966958,"score_spread":0.25423413138375867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159728727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001208475,0.00013426953,0.9806027,0.0036011192,0.000025075109,0.0002318236,1.4847512e-7,0.00019370305,0.014002682],"genre_scores_gemma":[0.86469823,0.00011489988,0.13159765,0.002852879,0.000014554307,0.000030458415,0.0000013529793,0.0000040201116,0.0006859709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991727,0.000071445094,0.00018633003,0.00027448015,0.00010626542,0.00018879025],"domain_scores_gemma":[0.99896693,0.00013278816,0.000035950434,0.00076259277,0.00004650764,0.00005522934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001770792,0.00009974749,0.000102660866,0.00009833873,0.00015260336,0.00010235044,0.00080772117,0.000033849614,0.000024656449],"category_scores_gemma":[0.000031035877,0.00009073898,0.00003190656,0.00053323514,0.000019757568,0.00020571589,0.00015136639,0.0001715891,0.00014494803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002094539,0.00024689315,0.000093168404,9.702873e-7,0.0000020356758,0.0000011748584,0.000641801,0.0015913115,0.0005553434,0.39223585,0.0002878182,0.60434157],"study_design_scores_gemma":[0.00084743893,0.000068994304,0.011471986,0.00003941789,0.0000014126654,0.0000048066736,0.000057217774,0.95401365,0.00075779605,0.0020888445,0.030364051,0.0002843857],"about_ca_topic_score_codex":0.0000044841363,"about_ca_topic_score_gemma":0.00004325294,"teacher_disagreement_score":0.9524223,"about_ca_system_score_codex":0.000056372013,"about_ca_system_score_gemma":0.00001709,"threshold_uncertainty_score":0.3700228},"labels":[],"label_agreement":null},{"id":"W2160169865","doi":"10.1109/ccece.2011.6030550","title":"Performance of 2–1–1 coded cooperative relaying scheme","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decodes; Relay; Decoding methods; Computer science; Bandwidth (computing); Energy consumption; Scheme (mathematics); Computer network; Efficient energy use; Telecommunications; Mathematics; Engineering; Electrical engineering; Power (physics)","score_opus":0.08124287321034691,"score_gpt":0.2691108285602438,"score_spread":0.18786795534989692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160169865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5034664,0.00024310799,0.23422974,0.00018289406,0.00013541736,0.0001592647,3.1379366e-7,0.0001809694,0.26140186],"genre_scores_gemma":[0.9009278,0.00026968686,0.097897954,0.00016491783,0.000005891454,0.0000062989325,4.461039e-7,0.0000030885824,0.00072396465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994143,0.000056254165,0.00018100927,0.00014105301,0.000092695016,0.00011467681],"domain_scores_gemma":[0.99916315,0.000036821628,0.000058296773,0.00051328685,0.00019021715,0.000038226444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020304057,0.00007067632,0.00010438297,0.000048879167,0.00011448208,0.000016201482,0.0007153794,0.000023622397,0.0001901553],"category_scores_gemma":[0.000022932803,0.00005864636,0.000024762252,0.00034487946,0.000050680184,0.00039567737,0.00032065512,0.00008934531,0.00004635676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022732382,0.00016303652,0.017547429,0.000015876236,0.00003995037,0.0000017224263,0.00908838,0.000045141707,0.02115229,0.892068,0.0010257502,0.058829684],"study_design_scores_gemma":[0.00062387815,0.00033650498,0.020425273,0.00008629946,0.0000042240063,0.000009284389,0.00013882476,0.8048735,0.1703194,0.00015556467,0.0026632254,0.00036402055],"about_ca_topic_score_codex":0.0000034518623,"about_ca_topic_score_gemma":0.0000053747076,"teacher_disagreement_score":0.89191246,"about_ca_system_score_codex":0.000011860788,"about_ca_system_score_gemma":0.00003765162,"threshold_uncertainty_score":0.23915292},"labels":[],"label_agreement":null},{"id":"W2160348245","doi":"10.1109/tit.2008.2011516","title":"A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Calgary","funders":"","keywords":"Linear network coding; Multicast; Computer science; Coding (social sciences); Computer network; Upper and lower bounds; Bounded function; Throughput; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.017006967950831335,"score_gpt":0.2562433237211498,"score_spread":0.23923635577031843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160348245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032039625,0.000043807042,0.9893751,0.00031942155,0.0003991972,0.00034623494,0.0000036662975,0.00012402958,0.0061845765],"genre_scores_gemma":[0.9959317,0.00034533552,0.0021365893,0.0014982745,0.000018248213,0.000025206647,0.0000039152087,0.0000041924573,0.000036538582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866325,0.00016116675,0.00057437527,0.00014136407,0.00020543876,0.0002544139],"domain_scores_gemma":[0.9987446,0.00035655772,0.00019292417,0.0005236183,0.00012438228,0.00005793445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007157405,0.00015702384,0.00019498888,0.00023056047,0.00025441186,0.00010522118,0.00042633884,0.0000734706,0.000042480235],"category_scores_gemma":[0.000013642108,0.00014960115,0.00007221462,0.0007738812,0.000065277934,0.0008745457,0.0000050872986,0.0003198923,0.000022278324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012053325,0.0001596555,0.0000029173352,0.000006260165,0.000020825284,6.2592795e-7,0.0016902538,0.29572472,0.00021827914,0.23133272,0.00011150399,0.47061172],"study_design_scores_gemma":[0.0020892178,0.0007990248,0.0006563803,0.0004164503,0.000015395657,0.000006213216,0.0002975421,0.9788372,0.007867838,0.0074587385,0.0011098073,0.0004462147],"about_ca_topic_score_codex":0.0000027783624,"about_ca_topic_score_gemma":0.000016099128,"teacher_disagreement_score":0.99272776,"about_ca_system_score_codex":0.00013464603,"about_ca_system_score_gemma":0.00005667395,"threshold_uncertainty_score":0.6100558},"labels":[],"label_agreement":null},{"id":"W2160378521","doi":"10.1109/tsp.2010.2046636","title":"Adaptive Relaying in Noncoherent Cooperative Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Computer science; Cooperative diversity; Frequency-shift keying; Channel (broadcasting); Power (physics); Algorithm; Control theory (sociology); Mathematics; Computer network; Fading; Demodulation; Artificial intelligence","score_opus":0.035249549404815374,"score_gpt":0.27979846033082606,"score_spread":0.2445489109260107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160378521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051531964,0.00016423107,0.9917717,0.00033598597,0.00029127486,0.00020390365,6.633202e-7,0.0001481051,0.0019309508],"genre_scores_gemma":[0.9888569,0.000065340275,0.0104539,0.00035666834,0.00005114997,0.00006841769,5.41978e-7,0.0000150760025,0.00013200588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986709,0.00014069607,0.00030465197,0.00038910427,0.00020112954,0.0002935334],"domain_scores_gemma":[0.9991254,0.00017373862,0.00008499451,0.00034277624,0.00017456416,0.000098494995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035447223,0.00019063786,0.00018424456,0.00019156303,0.00054633676,0.00023640716,0.0006127786,0.00010481305,0.00007818243],"category_scores_gemma":[0.000003817928,0.00018127575,0.00005769461,0.0009364273,0.00008063693,0.0007578402,0.000008290744,0.0011781332,0.00002372913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030766172,0.00019065708,0.000020984384,0.000004455396,0.000010541331,0.0000082545685,0.0012726542,0.20322677,0.004734201,0.0014227265,0.000025615562,0.78905237],"study_design_scores_gemma":[0.00043240425,0.000095061696,0.00011500993,0.00012423092,0.0000046552004,0.000011337394,0.00008860611,0.99219954,0.0063320287,0.00009658067,0.00025549292,0.00024506362],"about_ca_topic_score_codex":0.0000061602427,"about_ca_topic_score_gemma":0.0003068143,"teacher_disagreement_score":0.98370373,"about_ca_system_score_codex":0.000071489296,"about_ca_system_score_gemma":0.00014479534,"threshold_uncertainty_score":0.7392211},"labels":[],"label_agreement":null},{"id":"W2160396587","doi":"10.1109/icc.2006.255342","title":"Optimal Power and Resource Allocation For Half-Duplex Cooperative Multiple Access","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computer network; Resource allocation; Quality of service; Channel state information; Pairwise comparison; Channel (broadcasting); Wireless; Transmission (telecommunications); Resource management (computing); Key (lock); Telecommunications; Computer security","score_opus":0.1268459888610935,"score_gpt":0.36832971769364,"score_spread":0.24148372883254648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160396587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014357583,0.0004874626,0.8472509,0.06483689,0.00043214433,0.0011162219,0.00010342254,0.00034420379,0.07107119],"genre_scores_gemma":[0.96585685,0.00050537096,0.030577652,0.00085949356,0.0000678906,0.0003126088,0.00023028937,0.000015670028,0.0015741477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985391,0.00019890143,0.00040143385,0.00039459506,0.0002499342,0.00021601547],"domain_scores_gemma":[0.9967378,0.00062385027,0.00019456631,0.0014976689,0.00087356503,0.00007257523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033924644,0.00020337087,0.0001737015,0.00019466263,0.00063389796,0.000732535,0.0035405904,0.00007691079,0.000055070726],"category_scores_gemma":[0.00013074114,0.00020810592,0.00006446967,0.00027650103,0.00020271998,0.000747044,0.0007455172,0.00025585733,0.00002795897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026806634,0.00025856256,0.00029660348,0.000002842118,0.00003729657,3.9561715e-7,0.00032959942,0.0033615564,0.0025494106,0.9754474,0.010027987,0.007661516],"study_design_scores_gemma":[0.00089234737,0.00010245427,0.00276074,0.00007261074,0.0000085603115,0.0000073240763,0.00009456207,0.84596467,0.0016017071,0.00171021,0.14643332,0.00035147247],"about_ca_topic_score_codex":0.0000735947,"about_ca_topic_score_gemma":0.0005519851,"teacher_disagreement_score":0.97373724,"about_ca_system_score_codex":0.00010143483,"about_ca_system_score_gemma":0.00011499204,"threshold_uncertainty_score":0.84863126},"labels":[],"label_agreement":null},{"id":"W2160427235","doi":"10.1109/wd.2009.5449677","title":"Adaptive transmission in cooperative wireless communications","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Transmission (telecommunications); Wireless; Bit error rate; Antenna diversity; Channel (broadcasting); Orthogonal frequency-division multiplexing; Electronic engineering; Computer network; Exploit; Multiplexing; Cooperative diversity; Fading; Telecommunications; Engineering","score_opus":0.05803253078267689,"score_gpt":0.3068707994641679,"score_spread":0.248838268681491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160427235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015227235,0.00096932723,0.9185761,0.0155054275,0.000025237698,0.00021326555,2.9025296e-7,0.00015678369,0.0630308],"genre_scores_gemma":[0.95314175,0.0016485377,0.043378897,0.0014187396,0.0000062316226,0.000011619285,0.0000025903219,0.0000026318187,0.00038900282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991071,0.00023855016,0.00020404386,0.00019376613,0.000101567624,0.00015493721],"domain_scores_gemma":[0.9986474,0.000116931435,0.00003170267,0.0010375287,0.0001036516,0.0000627878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002229905,0.000096895186,0.00012460089,0.00009719221,0.00019234577,0.00007420554,0.0015872353,0.00003705289,0.000031040272],"category_scores_gemma":[0.000009024832,0.00008409089,0.00002948897,0.0007159225,0.000044067103,0.00043155972,0.0001842139,0.00020984317,0.000028220478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035187657,0.00011095366,0.000028313583,2.8059662e-7,0.0000022147078,0.000001121582,0.00121892,0.00009443898,0.0012146841,0.54133666,0.0003203587,0.45566854],"study_design_scores_gemma":[0.00062139763,0.00017684994,0.006039605,0.00007027171,0.0000018385044,0.0000046355008,0.00013859493,0.97374207,0.0019806507,0.003300398,0.013650512,0.00027317693],"about_ca_topic_score_codex":0.000005588623,"about_ca_topic_score_gemma":0.00008153219,"teacher_disagreement_score":0.97364765,"about_ca_system_score_codex":0.00004802459,"about_ca_system_score_gemma":0.000057576297,"threshold_uncertainty_score":0.3429127},"labels":[],"label_agreement":null},{"id":"W2160570982","doi":"10.1049/iet-com.2009.0508","title":"Performance analysis of cooperative diversity with relay selection over non-identically distributed links","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Independent and identically distributed random variables; Rayleigh fading; Moment-generating function; Relay; Fading; Probability density function; Cumulative distribution function; Expression (computer science); Cooperative diversity; Diversity combining; Selection (genetic algorithm); Upper and lower bounds; Mathematics; Computer science; Signal-to-noise ratio (imaging); Closed-form expression; Statistics; Function (biology); Maximal-ratio combining; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Random variable; Mathematical analysis; Combinatorics; Physics; Artificial intelligence","score_opus":0.022339129069348415,"score_gpt":0.27441112882777974,"score_spread":0.2520719997584313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160570982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7355172,0.00003524109,0.26041606,0.0012275715,0.00005048412,0.0001379821,0.000014445771,0.00008321882,0.002517815],"genre_scores_gemma":[0.9789965,0.00037669225,0.020323174,0.00011218751,0.000007427832,0.000018850764,0.000077497694,0.0000046066134,0.00008306476],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991128,0.00013659165,0.00023305064,0.00018779236,0.00019248074,0.00013730691],"domain_scores_gemma":[0.99687517,0.00025095383,0.00015300949,0.0020744996,0.0005782481,0.00006813814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032475294,0.000102172184,0.00018209181,0.00018613586,0.00094313116,0.00008903925,0.0021563813,0.00009388554,0.000064509586],"category_scores_gemma":[0.000060320832,0.00009500715,0.000073663236,0.00255843,0.00023400655,0.00049887336,0.0018533976,0.0006452617,0.000007277614],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006807333,0.0012323923,0.68599546,0.000021786558,0.0024932213,0.0000017487317,0.010377865,0.022363108,0.018089967,0.2418339,0.0016858241,0.015836636],"study_design_scores_gemma":[0.00019182314,0.00005956182,0.3190626,0.000013024021,0.00014482885,0.0000020768528,0.00002088572,0.67866206,0.0006099122,0.0000136772005,0.0011028803,0.000116660485],"about_ca_topic_score_codex":0.000051561994,"about_ca_topic_score_gemma":0.0023108057,"teacher_disagreement_score":0.65629894,"about_ca_system_score_codex":0.000028547265,"about_ca_system_score_gemma":0.00008488253,"threshold_uncertainty_score":0.7253898},"labels":[],"label_agreement":null},{"id":"W2160718003","doi":"10.1109/tvt.2014.2329880","title":"Enabling Cooperative Relaying VANET Clouds Over LTE-A Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Fading; Transmission (telecommunications); Relay; Vehicular ad hoc network; Multipath propagation; Telecommunications link; Benchmark (surveying); Diversity gain; Antenna diversity; Wireless; Base station; Cooperative diversity; Wireless ad hoc network; Channel (broadcasting); Power (physics); Telecommunications","score_opus":0.01593927826205288,"score_gpt":0.25010016018345893,"score_spread":0.23416088192140605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160718003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017072322,0.0004052697,0.97828126,0.001995623,0.0005668179,0.00021696046,9.762654e-7,0.0008706488,0.00059012824],"genre_scores_gemma":[0.9901566,0.0007027875,0.007829853,0.0009230263,0.000047792677,0.00007862074,0.0000019916863,0.000023743183,0.00023559983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827266,0.00024542343,0.00032986212,0.000542906,0.0001906634,0.00041847493],"domain_scores_gemma":[0.9981453,0.0002037531,0.000095782765,0.001298194,0.00017099932,0.0000860066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003994983,0.000251162,0.00028374925,0.0004131468,0.00071951747,0.00012118788,0.0011615771,0.000318168,0.00005472761],"category_scores_gemma":[0.000026037435,0.0002457941,0.000104557446,0.0015055053,0.00015373617,0.00028539807,0.00002500345,0.0009535644,0.000078362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020549061,0.00027883812,0.00007708142,0.000008576773,0.00013682625,0.000018397777,0.00035807496,0.45676276,0.007043533,0.12753144,0.0004415249,0.40732238],"study_design_scores_gemma":[0.0006590874,0.00024923228,0.00004638829,0.00006785802,0.00001969987,0.000040296247,0.00003622132,0.95627296,0.015329168,0.0006744293,0.026208032,0.00039661748],"about_ca_topic_score_codex":0.000004637422,"about_ca_topic_score_gemma":0.000041605585,"teacher_disagreement_score":0.9730843,"about_ca_system_score_codex":0.00009254145,"about_ca_system_score_gemma":0.000039217317,"threshold_uncertainty_score":0.9999994},"labels":[],"label_agreement":null},{"id":"W2160803609","doi":"10.1109/ciss.2006.286519","title":"Power Allocation and Asymptotic Achievable Sum-Rates in Single-Hop Wireless Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rayleigh fading; Computer science; Relay; Maximization; Power control; Transmitter; Wireless network; Throughput; Wireless; Power (physics); Single antenna interference cancellation; Fading; Interference (communication); Mathematical optimization; Channel (broadcasting); Channel allocation schemes; Computer network; Mathematics; Telecommunications","score_opus":0.018059131986844026,"score_gpt":0.24264076740085533,"score_spread":0.2245816354140113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160803609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36424452,0.0013024135,0.60635865,0.0025868749,0.00015408627,0.00020204006,1.3476605e-7,0.0001764307,0.024974829],"genre_scores_gemma":[0.99513346,0.0002091318,0.003567937,0.00034491924,0.000025027603,0.000008897837,0.00000412342,0.00000621562,0.00070028956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999152,0.00010557398,0.00020498171,0.0002405868,0.00009245427,0.0002043746],"domain_scores_gemma":[0.99933946,0.00012895279,0.000044846292,0.00038207066,0.0000670971,0.000037572365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026471488,0.000104301485,0.000113778806,0.00008366714,0.000119167635,0.00022315097,0.00038233385,0.000049729064,0.00002661966],"category_scores_gemma":[0.000010482596,0.00009646297,0.000016538806,0.0004739223,0.000039025774,0.00040097348,0.00023771037,0.000119643846,0.0000103504535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012224725,0.0004260477,0.032901928,0.000009474179,0.000013189187,0.0000064232545,0.0005814722,0.011355701,0.009104747,0.8551122,0.003315996,0.08716063],"study_design_scores_gemma":[0.00043265437,0.000059823564,0.045571182,0.000046354002,0.0000017420983,0.0000059931217,0.00003141671,0.94921696,0.0012164471,0.00092919695,0.002232144,0.0002561058],"about_ca_topic_score_codex":0.000041370044,"about_ca_topic_score_gemma":0.00046055258,"teacher_disagreement_score":0.93786126,"about_ca_system_score_codex":0.000042268926,"about_ca_system_score_gemma":0.000018744755,"threshold_uncertainty_score":0.3933646},"labels":[],"label_agreement":null},{"id":"W2161062743","doi":"10.1109/tmc.2011.58","title":"Distributed Throughput Maximization in Wireless Networks via Random Power Allocation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Throughput; Distributed algorithm; Distributed computing; Wireless network; Mathematical optimization; Gossip; Wireless; Utility maximization; Maximization; Power (physics); Resource allocation; Power control; Computer network; Mathematics; Telecommunications","score_opus":0.026319829353325254,"score_gpt":0.25076834847825086,"score_spread":0.2244485191249256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161062743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017328762,0.000103872975,0.98063844,0.00006564786,0.0007340739,0.00046204226,0.0000014931966,0.0002822465,0.00038341153],"genre_scores_gemma":[0.99105674,0.00022310688,0.008435328,0.00015119929,0.000024607969,0.00006337756,0.000009449063,0.000017787112,0.000018378256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830467,0.00030057257,0.00046522194,0.00042983235,0.00017718693,0.00032250897],"domain_scores_gemma":[0.99872804,0.00022567903,0.00013796393,0.00067686377,0.0001538267,0.00007762636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044595546,0.00020752149,0.00023457076,0.0001772828,0.00037452907,0.00009284416,0.00069430546,0.00010413193,0.000054182947],"category_scores_gemma":[0.0000053369554,0.00021839901,0.00008950897,0.0010843041,0.0000513982,0.00041801968,0.000016453234,0.0003931898,0.000023006185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004937634,0.0004181503,0.00014415299,0.000005663761,0.00002726866,0.0000051293055,0.0023545774,0.73949295,0.00037478513,0.0014373409,0.00004260967,0.255648],"study_design_scores_gemma":[0.0009973521,0.000091519025,0.0009185929,0.000079579484,0.0000063601096,0.000008350994,0.00004571739,0.9948793,0.0025628174,0.00008123016,0.00008978781,0.00023941709],"about_ca_topic_score_codex":0.000024016246,"about_ca_topic_score_gemma":0.00006594612,"teacher_disagreement_score":0.973728,"about_ca_system_score_codex":0.00013140433,"about_ca_system_score_gemma":0.000038241975,"threshold_uncertainty_score":0.89060533},"labels":[],"label_agreement":null},{"id":"W2161238678","doi":"10.1109/tcomm.2013.052013.120256","title":"Asynchronous Compute-and-Forward","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Asynchronous communication; Computer science; Electronic engineering; Telecommunications; Engineering","score_opus":0.038793094402356475,"score_gpt":0.27601687934020247,"score_spread":0.237223784937846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161238678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008377467,0.0005384935,0.9790643,0.011971459,0.00016949844,0.00032800742,0.0000026641544,0.0003442033,0.0067436476],"genre_scores_gemma":[0.9077961,0.0034336038,0.087257914,0.00094503234,0.000011064561,0.00022018664,0.0000025496986,0.000012045996,0.0003214929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988856,0.00023924265,0.00027095282,0.00025122156,0.00014089851,0.00021212338],"domain_scores_gemma":[0.9962595,0.00041005373,0.00006557565,0.0029481277,0.0001739475,0.00014277305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016429042,0.00015623581,0.00015548836,0.00015990034,0.0009678502,0.0002675535,0.0021545086,0.000060490613,0.00011850428],"category_scores_gemma":[0.0000055703545,0.00015639019,0.00007317882,0.0004860025,0.00017624488,0.00058516854,0.000052441374,0.0004053159,0.00052344904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001757518,0.0004017644,0.000022996808,0.0000058723012,0.00006511722,3.8811856e-7,0.001216624,0.0012053084,0.00086071424,0.101882376,0.0017560916,0.892581],"study_design_scores_gemma":[0.0008333096,0.00020712898,0.0022802697,0.00008547593,0.000029087805,0.00004588299,0.00012859605,0.9458944,0.0023134483,0.006196464,0.0412961,0.0006898182],"about_ca_topic_score_codex":0.00003874787,"about_ca_topic_score_gemma":0.00009214402,"teacher_disagreement_score":0.9446891,"about_ca_system_score_codex":0.00006133179,"about_ca_system_score_gemma":0.00005217689,"threshold_uncertainty_score":0.74440193},"labels":[],"label_agreement":null},{"id":"W2161452897","doi":"10.1109/icc.2008.828","title":"OFDMA Based Two-Hop Cooperative Relay Network Resources Allocation","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Computer network; Base station; Quality of service; Computational complexity theory; Synchronization (alternating current); Link Access Procedure for Frame Relay; Resource allocation; Integer programming; Relay channel; Distributed computing; Algorithm; Channel (broadcasting)","score_opus":0.042195922481719356,"score_gpt":0.27014934039749305,"score_spread":0.2279534179157737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161452897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031143723,0.0013386448,0.93003756,0.00829529,0.00027811248,0.00028732928,5.897033e-7,0.00051777397,0.028100986],"genre_scores_gemma":[0.9450919,0.00063231343,0.046894025,0.0038667165,0.00016259159,0.00005112181,0.0000063223015,0.000011072128,0.0032839254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985657,0.00033573605,0.00026266804,0.00034227394,0.00022729496,0.00026632816],"domain_scores_gemma":[0.9984565,0.00025155218,0.00008435107,0.000818439,0.00028817815,0.000100994796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036077114,0.00015511845,0.00016298213,0.00006799827,0.0007435829,0.000108421285,0.0009788382,0.00004592735,0.00021998431],"category_scores_gemma":[0.000053452397,0.00013255326,0.000054646756,0.000888986,0.00009475648,0.00038046503,0.0002867512,0.0001884254,0.00011793839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052689637,0.00038833436,0.008988193,0.000010142564,0.000099878445,0.000033631888,0.007857949,0.37828854,0.0037669577,0.37630108,0.13561197,0.088600636],"study_design_scores_gemma":[0.00068985706,0.00007790394,0.004069817,0.000042163105,0.000004401693,0.000011192608,0.000025066154,0.9090576,0.0016979622,0.000107949716,0.08389959,0.00031646193],"about_ca_topic_score_codex":0.000014800826,"about_ca_topic_score_gemma":0.00009839793,"teacher_disagreement_score":0.9139482,"about_ca_system_score_codex":0.000045883586,"about_ca_system_score_gemma":0.000108223816,"threshold_uncertainty_score":0.57191133},"labels":[],"label_agreement":null},{"id":"W2161637634","doi":"10.1109/vetecf.2008.176","title":"Training Power Optimization for Amplify-and-Forward Cooperative Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rayleigh fading; Computer science; Relay; Broadcasting (networking); Channel state information; MIMO; Channel (broadcasting); Node (physics); Transmission (telecommunications); Signal-to-noise ratio (imaging); Fading; Antenna (radio); Computer network; Wireless; Power (physics); Electronic engineering; Telecommunications; Engineering","score_opus":0.09632075367665358,"score_gpt":0.29445694816614115,"score_spread":0.19813619448948758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161637634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010899873,0.00042714144,0.9905569,0.0005232554,0.00016254766,0.00030368794,0.0000013289133,0.00014116429,0.0067939893],"genre_scores_gemma":[0.89794344,0.0004933242,0.09976012,0.0004830951,0.000029986502,0.00007189148,0.000006917683,0.0000075479493,0.0012036645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992979,0.00007100831,0.00017434185,0.00021464282,0.000088360495,0.0001537435],"domain_scores_gemma":[0.9992284,0.00017280005,0.00004567277,0.0002873738,0.00019882317,0.00006691647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021493698,0.000094165734,0.00013795219,0.000053928317,0.00044160165,0.00012372406,0.00031489972,0.000038879218,0.000026139582],"category_scores_gemma":[0.00005823422,0.00008001935,0.000024351128,0.00020221186,0.00004432224,0.00036380894,0.00012398911,0.00006754434,0.000005652587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008423024,0.000033668308,0.00006753607,0.0000071945337,0.000032292704,0.0000017141966,0.00934003,0.060312126,0.00016739068,0.9122949,0.0038709613,0.013863767],"study_design_scores_gemma":[0.00034300922,0.000078218705,0.000071680566,0.000014037826,0.0000019115578,0.00002926413,0.00021781611,0.9775279,0.00006023942,0.000040391045,0.021468172,0.00014734968],"about_ca_topic_score_codex":0.0000020623772,"about_ca_topic_score_gemma":0.000002528671,"teacher_disagreement_score":0.91721576,"about_ca_system_score_codex":0.000021124657,"about_ca_system_score_gemma":0.000055229746,"threshold_uncertainty_score":0.33964872},"labels":[],"label_agreement":null},{"id":"W2161737785","doi":"10.1049/iet-com.2012.0415","title":"Relay selection in cognitive radio networks with interference constraints","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Cognitive radio; Selection (genetic algorithm); Computer science; Interference (communication); Outage probability; Underlay; Expression (computer science); Secondary source; Relay channel; Computer network; Telecommunications; Power (physics); Signal-to-noise ratio (imaging); Fading; Artificial intelligence; Wireless; Decoding methods","score_opus":0.048266785875980794,"score_gpt":0.2928984349157018,"score_spread":0.24463164903972098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161737785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015435015,0.00107782,0.95517397,0.004711405,0.000054606076,0.00064610445,0.0000012098747,0.00023727956,0.02266258],"genre_scores_gemma":[0.96628416,0.0012707263,0.031558998,0.00040550574,0.000011719718,0.0002586685,0.000012635981,0.00000870044,0.00018886811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875706,0.0004047969,0.00027050482,0.0002387867,0.00009772343,0.00023113345],"domain_scores_gemma":[0.9978279,0.0005367098,0.000106296684,0.0011347457,0.0003164294,0.00007792782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026579064,0.00013464493,0.00014951143,0.00013364802,0.00031612307,0.00021423944,0.001912522,0.00005909275,0.00015470573],"category_scores_gemma":[0.00006969833,0.00012383123,0.000027998496,0.0009865223,0.00031875147,0.0006676718,0.00065684103,0.00052959006,0.00007666081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000286424,0.00093254994,0.041036427,0.000010062919,0.00015285409,0.000003904787,0.00943305,0.006148664,0.0010001847,0.20620193,0.0061038365,0.7289479],"study_design_scores_gemma":[0.0009015731,0.00014868099,0.07058309,0.0003416088,0.000009759806,0.000048632322,0.0004581109,0.9247697,0.00010425608,0.00047059392,0.0017602376,0.0004037333],"about_ca_topic_score_codex":0.000053788935,"about_ca_topic_score_gemma":0.00085916667,"teacher_disagreement_score":0.9508492,"about_ca_system_score_codex":0.0000798758,"about_ca_system_score_gemma":0.00008921201,"threshold_uncertainty_score":0.50496906},"labels":[],"label_agreement":null},{"id":"W2161747939","doi":"10.1109/cnsr.2009.50","title":"QoS Protection in Cognitive Wireless Mesh Networks: Issues and Solutions","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; École de Technologie Supérieure","funders":"","keywords":"Computer network; Quality of service; Computer science; Wireless mesh network; Call Admission Control; Wireless; Scheduling (production processes); Multiprotocol Label Switching; Wireless network; Telecommunications; Engineering","score_opus":0.061823802622885,"score_gpt":0.3054355398802725,"score_spread":0.2436117372573875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161747939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013120989,0.00080700446,0.97557276,0.006010676,0.00007608257,0.00030336433,1.3694945e-7,0.00014415415,0.003964802],"genre_scores_gemma":[0.99605423,0.0014053488,0.0016033092,0.00053403515,0.000045256238,0.000021697666,9.723171e-7,0.000001784906,0.00033334742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993885,0.000105519415,0.000116956195,0.00017563713,0.0000623435,0.00015103603],"domain_scores_gemma":[0.9996503,0.000043254306,0.000025856285,0.00017539308,0.00006895431,0.00003622527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022312025,0.00006825625,0.000081788705,0.00006922311,0.00017822521,0.00010500241,0.00019050001,0.000032754775,0.000013269375],"category_scores_gemma":[0.000021508898,0.00006317171,0.00001316083,0.00040694766,0.000027679764,0.00034235424,0.00012064258,0.00012864846,0.000004889243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005755618,0.000077798926,0.0002636271,0.0000011449844,0.0000045944025,0.0000017845936,0.0008340798,0.00008217922,0.00031977156,0.23295069,0.0006608555,0.76479775],"study_design_scores_gemma":[0.00036753388,0.00010034631,0.0215868,0.00007875546,0.0000019477586,0.000007405709,0.00008430032,0.97499233,0.00028588003,0.0015373899,0.00079576316,0.00016153716],"about_ca_topic_score_codex":0.000016268854,"about_ca_topic_score_gemma":0.00017307208,"teacher_disagreement_score":0.9829333,"about_ca_system_score_codex":0.00001976656,"about_ca_system_score_gemma":0.000013801687,"threshold_uncertainty_score":0.25760677},"labels":[],"label_agreement":null},{"id":"W2161961023","doi":"10.1109/icc.2011.5962780","title":"Cooperative Strategies and Fairness-Aware Resource Allocation in Selection-Based OFDM Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Subcarrier; Orthogonal frequency-division multiplexing; Resource allocation; Transmission (telecommunications); Computer network; Heuristic; Block (permutation group theory); Multiplexing; Selection (genetic algorithm); Channel (broadcasting); Power (physics); Telecommunications; Mathematics","score_opus":0.04538105690454457,"score_gpt":0.262300368395183,"score_spread":0.21691931149063842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161961023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075192642,0.00019205223,0.9814243,0.00061982276,0.000036669473,0.00017579418,1.5714801e-7,0.00014835925,0.0098836385],"genre_scores_gemma":[0.99300206,0.00008561392,0.006211123,0.0004788651,0.000016332997,0.000032527347,0.0000047572767,0.0000058399633,0.00016288047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990916,0.00020389383,0.00018802735,0.00026589798,0.000084517575,0.00016603622],"domain_scores_gemma":[0.9993556,0.000105853884,0.000047191377,0.00029594,0.0001431972,0.0000521759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002677386,0.00011527028,0.00011408395,0.000103889855,0.0001751539,0.00020526264,0.00037736938,0.000055123015,0.00007357306],"category_scores_gemma":[0.000015887204,0.00010421848,0.0000156697,0.0006402704,0.00005891112,0.0006499937,0.00012578563,0.00016743623,0.000004735599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029178136,0.00015573736,0.0062033325,0.000009254104,0.00001568638,0.0000033126798,0.0046027633,0.02257566,0.00021146612,0.9155315,0.00074829726,0.04991382],"study_design_scores_gemma":[0.00031067745,0.000070548704,0.01728834,0.000027477223,0.0000016506923,0.00000225841,0.00053697434,0.9800506,0.0005354288,0.0003108911,0.0006998149,0.0001652888],"about_ca_topic_score_codex":0.00006235266,"about_ca_topic_score_gemma":0.0013140864,"teacher_disagreement_score":0.9854828,"about_ca_system_score_codex":0.00003570941,"about_ca_system_score_gemma":0.000107489206,"threshold_uncertainty_score":0.42499062},"labels":[],"label_agreement":null},{"id":"W2162156798","doi":"10.1109/iwqos.2009.5201384","title":"Cooperative multicast scheduling with random network coding in WiMAX","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer network; Computer science; Xcast; Source-specific multicast; Pragmatic General Multicast; Protocol Independent Multicast; IP multicast; Distributed computing; WiMAX; Distance Vector Multicast Routing Protocol; Linear network coding; Wireless; Network packet; Telecommunications","score_opus":0.028004898787886114,"score_gpt":0.2760680873738901,"score_spread":0.24806318858600399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162156798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010014486,0.00041836093,0.9699045,0.0023955633,0.00008798712,0.0002787401,1.1164235e-7,0.00017412264,0.016726121],"genre_scores_gemma":[0.8605753,0.00021345603,0.13745032,0.0014997337,0.00006800171,0.00000982902,0.0000013062951,0.000004648818,0.00017738175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988257,0.00017202678,0.00023723209,0.00030061245,0.00014519964,0.00031922394],"domain_scores_gemma":[0.9989706,0.00021097624,0.00005041589,0.0004770011,0.00021243404,0.000078559984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044972287,0.00014825883,0.00021642259,0.00007475132,0.00023712445,0.00020850406,0.00061990344,0.000035625144,0.000033215318],"category_scores_gemma":[0.00008921792,0.0001128205,0.000026842941,0.0009128585,0.000038799993,0.00048555963,0.00013655845,0.0002411465,0.000022877799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001796514,0.0002388374,0.0026658315,0.000004313592,0.000031373842,0.000041431114,0.002710799,0.14049982,0.0010461911,0.68824756,0.0011033075,0.16323087],"study_design_scores_gemma":[0.0030146092,0.00016531347,0.0051298914,0.0001607238,0.0000030274343,0.00000872682,0.000074384785,0.9884697,0.0005178942,0.0003705278,0.0017687295,0.00031647217],"about_ca_topic_score_codex":0.0000032797996,"about_ca_topic_score_gemma":0.00012759631,"teacher_disagreement_score":0.85056084,"about_ca_system_score_codex":0.00004718893,"about_ca_system_score_gemma":0.000058132988,"threshold_uncertainty_score":0.4600686},"labels":[],"label_agreement":null},{"id":"W2162184199","doi":"10.1109/tcomm.2010.072710.090036","title":"A Low Complexity Receiver for Noncoherent Amplify-and-Forward Cooperative Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Frequency-shift keying; Diversity gain; Computer science; Keying; Signal-to-noise ratio (imaging); Time diversity; Antenna diversity; Channel (broadcasting); Electronic engineering; Bit error rate; Diversity combining; Diversity scheme; Energy (signal processing); Telecommunications; Mathematics; MIMO; Orthogonal frequency-division multiplexing; Wireless; Fading; Engineering; Demodulation; Power (physics); Statistics; Physics","score_opus":0.08433162697910217,"score_gpt":0.32220483267574895,"score_spread":0.23787320569664677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162184199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014440663,0.00019703699,0.98986095,0.0044727377,0.0007096384,0.00096226175,0.00007361861,0.00025366043,0.0020260164],"genre_scores_gemma":[0.9525448,0.0013381963,0.044240933,0.00038722574,0.000032402262,0.0008154066,0.000019690608,0.000019710295,0.0006016436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857616,0.00028863613,0.00037157384,0.00035143926,0.00016047982,0.00025171705],"domain_scores_gemma":[0.99545574,0.0009127482,0.000116596166,0.0029299597,0.00042093097,0.00016404098],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004308,0.00021163186,0.00024885262,0.00014902798,0.0016092639,0.0003166007,0.0020444724,0.00011604272,0.00003649856],"category_scores_gemma":[0.000024185583,0.0002063346,0.0000954474,0.00043166956,0.00036665832,0.00039934885,0.000043037042,0.0007749048,0.00005033511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006176614,0.0018058347,0.00002165776,0.00006810117,0.0002220513,6.9542165e-7,0.004463518,0.0041992953,0.017046925,0.74628365,0.0034106602,0.22241588],"study_design_scores_gemma":[0.0019928843,0.0003850813,0.0003539616,0.00015179327,0.00006811274,0.00004088624,0.0003041452,0.84074706,0.007002292,0.0018832642,0.14618406,0.0008864901],"about_ca_topic_score_codex":0.000035044668,"about_ca_topic_score_gemma":0.0012050091,"teacher_disagreement_score":0.9511007,"about_ca_system_score_codex":0.000061155144,"about_ca_system_score_gemma":0.00011028138,"threshold_uncertainty_score":0.99969053},"labels":[],"label_agreement":null},{"id":"W2162263242","doi":"10.1109/isit.2009.5205615","title":"Distortion exponents for decode-and-forward multi-relay cooperative networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Multiplexing; Relay channel; Transmission (telecommunications); Distortion (music); Fading; Gaussian; Topology (electrical circuits); Signal-to-noise ratio (imaging); Bandwidth (computing); Cooperative diversity; Telecommunications; Decoding methods; Electronic engineering; Computer network; Mathematics; Engineering; Physics; Power (physics)","score_opus":0.040808409973769603,"score_gpt":0.3013496460186613,"score_spread":0.2605412360448917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162263242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033549427,0.00056077424,0.9932738,0.0014801781,0.00015933352,0.0003232933,6.27811e-7,0.0001450825,0.0007019465],"genre_scores_gemma":[0.92516613,0.00061899057,0.07152697,0.0015168297,0.000043140077,0.000039133174,0.000009343274,0.000005192196,0.001074265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913716,0.00007358597,0.00021193404,0.0002864232,0.00008389402,0.00020700667],"domain_scores_gemma":[0.9992012,0.000104382685,0.000057519195,0.00039171148,0.00014863469,0.00009658635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024618927,0.00012643279,0.00014181808,0.000047506757,0.00034218928,0.00014401204,0.0004325442,0.00005182236,0.000013769419],"category_scores_gemma":[0.00004874979,0.000107164225,0.000047771056,0.0001983072,0.00002756733,0.00039747028,0.00013108065,0.00010081671,0.000007809844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031390085,0.00022909464,0.00054620224,0.0000033498748,0.000031613676,0.0000013123403,0.0011824884,0.0065010665,0.0007450727,0.2444016,0.0061568674,0.74016994],"study_design_scores_gemma":[0.00068189536,0.00013385416,0.006150315,0.000015829579,0.0000043503433,0.0000025835577,0.000017460006,0.98734796,0.0003503401,0.00015305156,0.0049597616,0.0001825869],"about_ca_topic_score_codex":0.000001575233,"about_ca_topic_score_gemma":0.000039551058,"teacher_disagreement_score":0.9808469,"about_ca_system_score_codex":0.00004312728,"about_ca_system_score_gemma":0.000018926767,"threshold_uncertainty_score":0.43700302},"labels":[],"label_agreement":null},{"id":"W2162325058","doi":"10.1109/twc.2008.070082","title":"BER-Optimized Power Allocation for Fading Relay Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Transmitter power output; Broadcasting (networking); Transmission (telecommunications); Fading; Relay channel; Power (physics); Computer network; Bit error rate; Telecommunications; Electronic engineering; Channel (broadcasting); Engineering; Transmitter; Physics","score_opus":0.06694786217610825,"score_gpt":0.2964459997868173,"score_spread":0.22949813761070903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162325058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023283844,0.00030709905,0.9857313,0.008815593,0.00050508324,0.0006940863,0.000012805814,0.0004589781,0.0011466906],"genre_scores_gemma":[0.899448,0.0040602344,0.09410617,0.00055527425,0.000020582458,0.0007380172,0.00001769052,0.00003073148,0.0010232979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982323,0.00031440324,0.0004855274,0.00040205717,0.00023138981,0.00033434705],"domain_scores_gemma":[0.9949179,0.0008623196,0.00016250988,0.0035068633,0.0004108108,0.0001395742],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00038473986,0.0002438469,0.00027689568,0.00028793918,0.0024183232,0.000119316996,0.0028067785,0.00012284401,0.000029359204],"category_scores_gemma":[0.000019455496,0.00026387133,0.00021304491,0.00084588287,0.00021360422,0.0006498213,0.00003594159,0.00045278767,0.00007653513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020177949,0.0041959966,0.000028040922,0.000049162732,0.0006248112,0.000005543322,0.02607759,0.24777687,0.020153698,0.32955,0.0071017207,0.3642348],"study_design_scores_gemma":[0.002117667,0.00023437274,0.000060996987,0.0001322544,0.000040204985,0.000053732496,0.00011994312,0.9486934,0.015502191,0.0005154416,0.031765614,0.0007641979],"about_ca_topic_score_codex":0.000009862888,"about_ca_topic_score_gemma":0.000037645426,"teacher_disagreement_score":0.89711964,"about_ca_system_score_codex":0.00015011679,"about_ca_system_score_gemma":0.00013948852,"threshold_uncertainty_score":0.99998134},"labels":[],"label_agreement":null},{"id":"W2162334818","doi":"10.1109/pimrc.2003.1259261","title":"Cellular CDMA capacity in hotspots with limited ad hoc relaying","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hotspot (geology); Telecommunications link; Wireless ad hoc network; Computer network; Computer science; Vehicular ad hoc network; Code division multiple access; Wireless; Telecommunications","score_opus":0.06327365127206722,"score_gpt":0.23919112859248748,"score_spread":0.17591747732042026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162334818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62245643,0.00058028515,0.3664335,0.0025024593,0.000057283512,0.00013760164,1.420457e-7,0.00017801856,0.0076542674],"genre_scores_gemma":[0.9385961,0.0003027166,0.06029369,0.0005995252,0.000008587277,0.000009373875,8.21116e-7,0.0000056536715,0.00018349793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.00007307494,0.00015356785,0.0002447148,0.00014309784,0.00020228057],"domain_scores_gemma":[0.99913716,0.000049672344,0.00003969133,0.0006403446,0.00006841337,0.000064693166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021971788,0.00010395167,0.00011278991,0.00011304543,0.00012985509,0.00009305048,0.0006477138,0.000037603986,0.000020753932],"category_scores_gemma":[0.000020312325,0.00008399419,0.000022447743,0.0008331362,0.000038473423,0.0003583809,0.00020487972,0.0002064541,0.000041140374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071089504,0.0007364587,0.0105714705,0.000029378203,0.00005630325,0.0001887684,0.019821122,0.014367878,0.039587494,0.7004671,0.0004753061,0.21362765],"study_design_scores_gemma":[0.023899367,0.0023072183,0.3357856,0.0021642658,0.00004190311,0.00026237394,0.0016399873,0.38970718,0.14636537,0.019739708,0.07224555,0.0058414764],"about_ca_topic_score_codex":0.00001630946,"about_ca_topic_score_gemma":0.00046224002,"teacher_disagreement_score":0.68072736,"about_ca_system_score_codex":0.00008915804,"about_ca_system_score_gemma":0.000055241464,"threshold_uncertainty_score":0.3425184},"labels":[],"label_agreement":null},{"id":"W2162371509","doi":"10.1109/glocom.2009.5425304","title":"Pilot Power Protocol for Autonomous Infrastructure Based Multihop Cellular Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Base station; Computer network; Bottleneck; Cellular network; Computer science; Transmission (telecommunications); Protocol (science); Transmitter power output; Power (physics); Telecommunications; Embedded system; Channel (broadcasting)","score_opus":0.03273567203713124,"score_gpt":0.3006239144509237,"score_spread":0.26788824241379244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162371509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003111038,0.00001025076,0.9480556,0.0015812953,0.00009169905,0.044865485,3.866611e-7,0.00029376947,0.0050703557],"genre_scores_gemma":[0.6778446,0.000001527867,0.25165513,0.007138704,0.0001127725,0.062381014,0.0000066204625,0.000014780244,0.0008448789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989766,0.000077459335,0.00023920099,0.00031015355,0.00011344906,0.0002831213],"domain_scores_gemma":[0.9987201,0.000116476425,0.000079072866,0.00082598865,0.0001601246,0.0000982437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023024352,0.00016531136,0.00014419417,0.00006253473,0.00024953383,0.0002003088,0.0010330556,0.00004585335,0.00015997457],"category_scores_gemma":[0.000032584532,0.00013631603,0.00006962055,0.00029670738,0.000023111028,0.00023676983,0.00012391731,0.00016807743,0.000009090686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018784706,0.00068410963,0.0002679432,0.000021493044,0.000027582482,0.0000068437566,0.00044221838,0.05464546,0.008298778,0.39591247,0.093480885,0.44602436],"study_design_scores_gemma":[0.0012694119,0.0004625241,0.0010648726,0.000018670968,0.0000012632439,9.4315885e-7,0.0000020231082,0.9010456,0.0013816031,0.0006292043,0.09392383,0.00020002246],"about_ca_topic_score_codex":8.393502e-7,"about_ca_topic_score_gemma":0.00000491252,"teacher_disagreement_score":0.8464002,"about_ca_system_score_codex":0.000048597267,"about_ca_system_score_gemma":0.00008998703,"threshold_uncertainty_score":0.5558806},"labels":[],"label_agreement":null},{"id":"W2162421771","doi":"10.1109/tit.2009.2039167","title":"Communication Over Finite-Field Matrix Channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Finite field; Computer science; Matrix (chemical analysis); Field (mathematics); Mathematics; Discrete mathematics; Pure mathematics; Materials science","score_opus":0.014475936530199839,"score_gpt":0.26941802016374566,"score_spread":0.2549420836335458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162421771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022308058,0.000026099151,0.9867651,0.0012461374,0.00096995913,0.00018618291,0.0000041240605,0.00027895134,0.008292657],"genre_scores_gemma":[0.9905892,0.00029060617,0.0064919037,0.0020475516,0.00002354904,0.00006651916,0.0000064462924,0.0000060507277,0.00047816496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905604,0.00015650023,0.00032867322,0.00010589932,0.00019194436,0.00016096038],"domain_scores_gemma":[0.99782574,0.00068592845,0.0001242027,0.00113146,0.0001571255,0.00007554459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006601867,0.00012900979,0.00010159768,0.00025792656,0.0005251069,0.0002810367,0.00096697273,0.00010537048,0.0005564111],"category_scores_gemma":[0.0000414111,0.00012584831,0.00007827906,0.00042461779,0.000049417395,0.0023677954,0.000011805247,0.00058416516,0.0005168687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036829377,0.00009697485,0.0000028450634,0.000007954464,0.000024326064,1.8893773e-7,0.0037266796,0.007998416,0.0006951199,0.5431417,0.0012386363,0.44303033],"study_design_scores_gemma":[0.0021324267,0.00030647032,0.00021798418,0.00011845245,0.000025296633,0.000030449903,0.00041831867,0.67259365,0.08153885,0.036407143,0.20513067,0.0010803124],"about_ca_topic_score_codex":0.0000038246753,"about_ca_topic_score_gemma":0.000014074917,"teacher_disagreement_score":0.9883584,"about_ca_system_score_codex":0.000025971909,"about_ca_system_score_gemma":0.00004682427,"threshold_uncertainty_score":0.66434735},"labels":[],"label_agreement":null},{"id":"W2162541108","doi":"10.1109/tsp.2013.2263501","title":"Sum-Rate Maximization With Minimum Power Consumption for MIMO DF Two-Way Relaying— Part II: Network Optimization","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Computer science; Maximization; Mathematical optimization; Power (physics); Optimization problem; Regular polygon; Mathematics; Beamforming; Telecommunications","score_opus":0.036023700090631855,"score_gpt":0.263275674031382,"score_spread":0.22725197394075017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162541108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005488106,0.00022103268,0.9917585,0.00090383523,0.00025137095,0.0007196674,0.0000027257997,0.00029499742,0.0003597185],"genre_scores_gemma":[0.90621984,0.000117721305,0.09210956,0.0006425592,0.0000732084,0.00031470374,0.000012939472,0.00003405096,0.0004754438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831176,0.00017257138,0.00040632652,0.00048866915,0.00023388781,0.00038680912],"domain_scores_gemma":[0.99849653,0.00019766473,0.00023128117,0.0004002126,0.00055374426,0.00012055056],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00039332412,0.00025743985,0.00021672735,0.0001509884,0.0015977204,0.0005003196,0.0004248389,0.000095119154,0.00023323378],"category_scores_gemma":[0.000005666817,0.000234084,0.00007182777,0.0006863197,0.00008451818,0.0015279539,0.0000084265375,0.00025920858,0.000032997003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005834051,0.00011969065,0.000027354676,0.000023232613,0.000026353262,5.4716196e-7,0.00047809217,0.9297579,0.0006885177,0.0003350113,0.00045783125,0.068027124],"study_design_scores_gemma":[0.0009848243,0.00027162698,0.000051919225,0.00027949872,0.000031277,0.000009364257,0.000033282482,0.9943703,0.0026632657,0.00019469488,0.0007590568,0.00035092715],"about_ca_topic_score_codex":0.0000031751267,"about_ca_topic_score_gemma":0.000017787095,"teacher_disagreement_score":0.9007317,"about_ca_system_score_codex":0.00008729329,"about_ca_system_score_gemma":0.0001084663,"threshold_uncertainty_score":0.99970204},"labels":[],"label_agreement":null},{"id":"W2162587570","doi":"10.1109/icassp.2011.5946953","title":"Incentive mechanism in wireless multicast","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Stackelberg competition; Computer science; Computer network; Source-specific multicast; Nash equilibrium; Game theory; Wireless; Protocol Independent Multicast; Relay; Xcast; Network packet; Pragmatic General Multicast; Incentive; Microeconomics; Telecommunications; Economics","score_opus":0.0753820420810055,"score_gpt":0.2690798596058179,"score_spread":0.19369781752481235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162587570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039822873,0.000030266909,0.89543027,0.00026059806,0.00012024275,0.000109415654,1.1176453e-7,0.000110927176,0.06411528],"genre_scores_gemma":[0.96588475,0.00009169905,0.033443443,0.00029789587,0.0000049204086,0.000009072418,2.3490806e-7,0.000002376452,0.0002655893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994957,0.0000694422,0.000106935084,0.00014571617,0.0000611881,0.00012102369],"domain_scores_gemma":[0.99951214,0.000028521843,0.00002047161,0.00036039331,0.000043168235,0.00003528555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014184708,0.000054215983,0.00006466336,0.0000590974,0.00004783237,0.00002584572,0.00063588575,0.000020198728,0.000121991405],"category_scores_gemma":[0.000008404498,0.00004771731,0.000015563266,0.00027225478,0.000017038165,0.00023697192,0.00038909446,0.0000813452,0.000084330524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011047464,0.00004972255,0.00043244037,4.8919026e-7,0.0000016741835,0.0000032472208,0.0020141923,2.9032537e-7,0.00063611014,0.9603971,0.000029623376,0.03643401],"study_design_scores_gemma":[0.0014570316,0.00012583382,0.047606144,0.000085549684,0.0000029230303,0.000008438397,0.0004632902,0.83917874,0.07040934,0.038392745,0.0015968218,0.00067315233],"about_ca_topic_score_codex":0.000019638503,"about_ca_topic_score_gemma":0.0001746686,"teacher_disagreement_score":0.92606187,"about_ca_system_score_codex":0.000021982405,"about_ca_system_score_gemma":0.000015115294,"threshold_uncertainty_score":0.19458555},"labels":[],"label_agreement":null},{"id":"W2162787176","doi":"10.1109/infcom.2005.1498444","title":"Efficient and distributed computation of maximum multicast rates","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Subgradient method; Computer science; Unicast; Mathematical optimization; Lagrangian relaxation; Maximum flow problem; Routing (electronic design automation); Distributed computing; Computer network; Mathematics","score_opus":0.03005772383521372,"score_gpt":0.29459758391729784,"score_spread":0.26453986008208413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162787176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11316735,0.00024457907,0.8841678,0.0016385431,0.000020926333,0.000060668113,8.433623e-7,0.000044874963,0.00065440027],"genre_scores_gemma":[0.9503466,0.00003683851,0.049493138,0.0000897365,0.000007665666,0.0000016800097,0.000002556655,0.000001430113,0.00002036926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995875,0.000041823056,0.00012878935,0.00010391687,0.00006703902,0.000070963455],"domain_scores_gemma":[0.99960595,0.0000710491,0.000036890393,0.00016241187,0.00009059772,0.00003311357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011677522,0.000046398385,0.00006731474,0.000031829226,0.00006414634,0.00003636508,0.0001745306,0.000012982481,0.000009892542],"category_scores_gemma":[0.000019127505,0.000039107184,0.000012514528,0.00018018439,0.00003564015,0.000054436576,0.00017896314,0.00003539472,0.000007867905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068851427,0.00023934695,0.0013268945,0.000012492931,0.000016854965,6.693635e-7,0.0014827119,0.08859047,0.005392051,0.11737309,0.00069333304,0.7848652],"study_design_scores_gemma":[0.0002001118,0.000015020521,0.007224878,0.000009044834,0.0000010477463,0.0000018414909,0.000018137258,0.9900247,0.0016894739,0.00008877763,0.00067839667,0.000048584265],"about_ca_topic_score_codex":0.0000014375574,"about_ca_topic_score_gemma":0.000006974922,"teacher_disagreement_score":0.90143424,"about_ca_system_score_codex":0.000011208773,"about_ca_system_score_gemma":0.000009291496,"threshold_uncertainty_score":0.15947446},"labels":[],"label_agreement":null},{"id":"W2162827997","doi":"10.1109/vetecs.2009.5073778","title":"Performance Analysis of Dual Hop Relaying over Non-Identical Weibull Fading Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Weibull fading; Weibull distribution; Probability density function; Fading distribution; Cumulative distribution function; Mathematics; Closed-form expression; Expression (computer science); Outage probability; Computer science; Statistics; Topology (electrical circuits); Rayleigh fading; Combinatorics; Mathematical analysis; Decoding methods","score_opus":0.02912108958912707,"score_gpt":0.28725900523625386,"score_spread":0.2581379156471268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162827997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6599337,0.000075608594,0.32909963,0.00069142255,0.00011190352,0.00006598729,2.4734e-7,0.000071824164,0.009949722],"genre_scores_gemma":[0.9922653,0.00026699505,0.0064672055,0.00044938142,0.000029642311,0.0000020613124,0.0000021666901,0.0000027432302,0.0005144988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898136,0.00005213021,0.0003128778,0.00022903505,0.00022083246,0.00020379617],"domain_scores_gemma":[0.99904364,0.00008816985,0.000086317465,0.00060874864,0.00010663146,0.000066484536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040614893,0.00010142014,0.00023224788,0.00031126477,0.00015865959,0.00009373557,0.00060892216,0.000039186445,0.0001149518],"category_scores_gemma":[0.00003052554,0.00009058012,0.0001122094,0.0017700421,0.00002761421,0.000459108,0.00025884798,0.00012644948,0.000017651437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052868483,0.000813221,0.06807231,0.0000429016,0.00164622,0.00002760395,0.01712029,0.08306116,0.045011748,0.3283727,0.006166023,0.44961298],"study_design_scores_gemma":[0.00014105844,0.00005488479,0.05508182,0.000021134438,0.000047585556,0.0000015803495,0.000014475051,0.94224364,0.001922957,0.0000440651,0.00030338383,0.0001234194],"about_ca_topic_score_codex":0.0000033776014,"about_ca_topic_score_gemma":0.0000054185434,"teacher_disagreement_score":0.8591825,"about_ca_system_score_codex":0.00002993213,"about_ca_system_score_gemma":0.000020840924,"threshold_uncertainty_score":0.36937502},"labels":[],"label_agreement":null},{"id":"W2163096389","doi":"10.1109/icc.2006.255035","title":"Bilayer LDPC Codes for the Relay Channel","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Relay; Computer science; Relay channel; Channel (broadcasting); Algorithm; Channel capacity; Decoding methods; EXIT chart; Electronic engineering; Block code; Concatenated error correction code; Computer network; Physics; Engineering","score_opus":0.16886344957668867,"score_gpt":0.36618647841265456,"score_spread":0.1973230288359659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163096389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006467367,0.00075077335,0.80117923,0.09909323,0.00080362445,0.00059321907,0.00006628709,0.00023501962,0.09663185],"genre_scores_gemma":[0.97859335,0.0019488449,0.013935751,0.001252851,0.00013808311,0.00041755792,0.000072944014,0.00001297652,0.0036276313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876845,0.0001515908,0.0003466191,0.00026215665,0.0002662845,0.00020487109],"domain_scores_gemma":[0.9958803,0.00095499685,0.00017043375,0.002348804,0.0006041176,0.000041327985],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00044332765,0.000160695,0.00012884752,0.00012560644,0.00081763085,0.0003822972,0.0055471123,0.000050329752,0.000060883813],"category_scores_gemma":[0.00007357289,0.00012586916,0.00010650857,0.00028295585,0.00017570636,0.00029803076,0.0004962078,0.00027136705,0.00010700799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006466021,0.00013405495,0.00004672095,0.0000010321282,0.000029299053,1.7626857e-7,0.00011360499,0.0015960281,0.0017060727,0.9760464,0.01480287,0.0055172825],"study_design_scores_gemma":[0.00043794067,0.00004038264,0.0016809481,0.000053624673,0.000011232535,0.000006023632,0.00005124119,0.7874427,0.0010471031,0.012170314,0.19680052,0.00025801038],"about_ca_topic_score_codex":0.000067312445,"about_ca_topic_score_gemma":0.00064160244,"teacher_disagreement_score":0.97794664,"about_ca_system_score_codex":0.0000837047,"about_ca_system_score_gemma":0.00009063155,"threshold_uncertainty_score":0.99983335},"labels":[],"label_agreement":null},{"id":"W2163127038","doi":"10.1109/tvt.2010.2046661","title":"Joint Relay Selection and Opportunistic Source Selection in Bidirectional Cooperative Diversity Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Cooperative diversity; Selection (genetic algorithm); Computer science; Maximal-ratio combining; Outage probability; Bit error rate; Computer network; Transmission (telecommunications); Mutual information; Diversity gain; Transmitter power output; Joint (building); Quadrature amplitude modulation; Diversity combining; Channel (broadcasting); Power (physics); Telecommunications; Engineering; Fading; Artificial intelligence","score_opus":0.02119797398901355,"score_gpt":0.23580082117241974,"score_spread":0.2146028471834062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163127038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22693999,0.000038074366,0.7710049,0.0011660486,0.0002635006,0.00017384364,7.9361894e-7,0.00035622684,0.000056611385],"genre_scores_gemma":[0.9949701,0.00032299297,0.004268259,0.00014673838,0.000023054477,0.00005191708,0.0000013383025,0.0000105750205,0.00020503992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988264,0.00013112999,0.00022429404,0.00043805724,0.00013683621,0.00024326956],"domain_scores_gemma":[0.9993549,0.00007244981,0.00007121772,0.000262995,0.00016750387,0.000070949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003141298,0.00016942827,0.00018577847,0.0006068256,0.00093714835,0.000060804796,0.00032024866,0.0003006969,0.00004089599],"category_scores_gemma":[0.00002124512,0.00018007249,0.000046457724,0.0014832378,0.00013918542,0.00024779266,0.00003299518,0.0012724735,0.000009092583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070491515,0.00089647464,0.0044746576,0.000014179512,0.00016348521,0.000020346117,0.00083596737,0.38941568,0.1018028,0.046562895,0.00024393408,0.45549908],"study_design_scores_gemma":[0.0004958606,0.00019333953,0.0018395879,0.000023243803,0.00001401048,0.00017693847,0.000032223063,0.9838902,0.010938681,0.00021357118,0.0019271326,0.00025520762],"about_ca_topic_score_codex":0.00003180102,"about_ca_topic_score_gemma":0.0015538421,"teacher_disagreement_score":0.7680301,"about_ca_system_score_codex":0.00010124293,"about_ca_system_score_gemma":0.000061141276,"threshold_uncertainty_score":0.73431426},"labels":[],"label_agreement":null},{"id":"W2163246329","doi":"10.1109/sis.2011.5952590","title":"Resource allocation in bidirectional cooperative cognitive radio networks using swarm intelligence","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subcarrier; Computer science; Mathematical optimization; Relay; Particle swarm optimization; Cognitive radio; Maximization; Optimization problem; Resource allocation; Integer programming; Swarm intelligence; Transmitter power output; Nonlinear programming; Orthogonal frequency-division multiplexing; Power (physics); Nonlinear system; Algorithm; Wireless; Mathematics; Computer network; Telecommunications; Transmitter","score_opus":0.10730110418080832,"score_gpt":0.30239317386037357,"score_spread":0.19509206967956524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163246329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011783328,0.0004603733,0.9680279,0.000138967,0.00013150017,0.00020474292,2.9414528e-7,0.00011180897,0.019141098],"genre_scores_gemma":[0.97881633,0.0003028326,0.01998487,0.00048079918,0.00004491436,0.000021684727,0.000004717525,0.000008067312,0.0003357563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987209,0.00030028934,0.00028418226,0.00033840284,0.00013430208,0.00022191762],"domain_scores_gemma":[0.9991013,0.00020728706,0.00007361069,0.00031584583,0.00023192147,0.000070027716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046311962,0.00013672876,0.00013787224,0.00016254898,0.00020382118,0.00007694089,0.0005647642,0.00005967526,0.00014151036],"category_scores_gemma":[0.00007816668,0.00013156122,0.000033705815,0.001053703,0.000084705156,0.0004811557,0.00028262928,0.00024105629,0.000024542114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012465676,0.00071990024,0.0075249425,0.00000822793,0.00010169595,0.000027394388,0.023508849,0.05743254,0.00070420676,0.5613317,0.00084913324,0.34766677],"study_design_scores_gemma":[0.00018145543,0.000055610788,0.0040322617,0.00008025084,0.0000038864528,0.000016908336,0.00035924514,0.9890763,0.0049850256,0.00031403155,0.0006558103,0.0002392014],"about_ca_topic_score_codex":0.000054508128,"about_ca_topic_score_gemma":0.00019817112,"teacher_disagreement_score":0.967033,"about_ca_system_score_codex":0.00009949898,"about_ca_system_score_gemma":0.000081482765,"threshold_uncertainty_score":0.5364911},"labels":[],"label_agreement":null},{"id":"W2163291063","doi":"10.1109/lcomm.2007.070065","title":"Performance Analysis of Decode-and-Forward Relaying with Selection Combining","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Selection (genetic algorithm); Relay; Outage probability; Diversity combining; Maximal-ratio combining; Signal-to-noise ratio (imaging); Expression (computer science); Antenna diversity; Cooperative diversity; Performance improvement; Algorithm; Telecommunications; Decoding methods; Fading; Wireless; Artificial intelligence; Power (physics); Engineering","score_opus":0.03319653540750594,"score_gpt":0.2830231413289397,"score_spread":0.24982660592143374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163291063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5339061,0.00017795633,0.46289027,0.0018152192,0.000027430193,0.00008121746,3.8401666e-7,0.000074549425,0.0010268423],"genre_scores_gemma":[0.9193729,0.0007408258,0.07916945,0.0006709873,0.0000058045375,0.000011084548,0.000006209202,0.0000068039485,0.00001591144],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900734,0.00013362335,0.00032635164,0.00018807329,0.00016052753,0.0001840727],"domain_scores_gemma":[0.99759394,0.00040804336,0.00019599132,0.0015863945,0.00015794444,0.00005767326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348817,0.00010851637,0.00020327154,0.00049628323,0.00047958293,0.000058717105,0.0013489953,0.000032444437,0.0000032985288],"category_scores_gemma":[0.000019208579,0.00010335846,0.000052892876,0.0024273428,0.00016558658,0.00039591372,0.00031512164,0.0002383755,0.0000025137745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007026634,0.00033823622,0.5320838,0.00004293487,0.0021514297,0.000002248537,0.012424439,0.028037269,0.087899715,0.0511343,0.00065292354,0.28516245],"study_design_scores_gemma":[0.00042854212,0.00008412274,0.18383346,0.000079234196,0.00024587507,0.000012547692,0.00010924874,0.8092628,0.0036165358,0.000012835408,0.0020082893,0.00030650845],"about_ca_topic_score_codex":0.000015619074,"about_ca_topic_score_gemma":0.0002537679,"teacher_disagreement_score":0.7812255,"about_ca_system_score_codex":0.0000577781,"about_ca_system_score_gemma":0.00002440556,"threshold_uncertainty_score":0.4214836},"labels":[],"label_agreement":null},{"id":"W2163304767","doi":"10.1109/isit.2007.4557322","title":"Using Rank-Metric Codes for Error Correction in Random Network Coding","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Algorithm; Metric (unit); Coding (social sciences); Error detection and correction; Computer science; Linear network coding; Rank (graph theory); List decoding; Random error; Code (set theory); Mathematics; Theoretical computer science; Concatenated error correction code; Block code; Combinatorics; Statistics","score_opus":0.08964337529992798,"score_gpt":0.3466599499990363,"score_spread":0.2570165746991083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163304767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005357188,0.0005004531,0.9879778,0.00014961374,0.0010416287,0.0003484342,1.4153412e-7,0.000112349284,0.0045124046],"genre_scores_gemma":[0.8707887,0.00013583813,0.12825578,0.0003298688,0.00013158185,0.000010704349,0.0000018487044,0.0000070399865,0.0003386587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989309,0.0000986638,0.00031108028,0.00022441518,0.00011277307,0.000322202],"domain_scores_gemma":[0.9984043,0.0010318864,0.00008109644,0.0003129524,0.00011608201,0.00005364793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020465967,0.000101973295,0.00017957861,0.00025761488,0.00027871603,0.000105824096,0.0004308474,0.000049518338,0.000015849408],"category_scores_gemma":[0.0001835888,0.00009613502,0.000058400547,0.0017071055,0.00002066016,0.00029403565,0.00014782738,0.00012387027,0.000003988384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043466376,0.00021009748,0.013486953,0.00002566382,0.00004974513,0.000008349082,0.0017645088,0.0870764,0.0034119003,0.17662245,0.009641597,0.7072677],"study_design_scores_gemma":[0.0015817065,0.00002802517,0.0023316145,0.000046573186,0.000003581159,0.0000069165294,0.0000432906,0.98977154,0.00078261754,0.0002979946,0.0049530407,0.00015311669],"about_ca_topic_score_codex":0.000019229348,"about_ca_topic_score_gemma":0.0005001908,"teacher_disagreement_score":0.9026951,"about_ca_system_score_codex":0.00010834469,"about_ca_system_score_gemma":0.000043929642,"threshold_uncertainty_score":0.39202723},"labels":[],"label_agreement":null},{"id":"W2163348036","doi":"10.1109/twc.2014.2314713","title":"Performance of Selection Combining for Differential Amplify-and-Forward Relaying Over Time-Varying Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Maximal-ratio combining; Fading; Bit error rate; Rayleigh fading; Computer science; Signal-to-noise ratio (imaging); Channel state information; Algorithm; Channel (broadcasting); Selection (genetic algorithm); Modulation (music); Topology (electrical circuits); Telecommunications; Mathematics; Electronic engineering; Statistics; Wireless; Physics; Engineering; Artificial intelligence; Acoustics","score_opus":0.034405296229975735,"score_gpt":0.2769795107357919,"score_spread":0.24257421450581618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163348036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13331766,0.00004959115,0.86512804,0.00049826404,0.00018468827,0.00030454775,0.000005521364,0.00015794994,0.00035374297],"genre_scores_gemma":[0.9836718,0.000983166,0.0148414895,0.00010663897,0.00002069925,0.00018725419,0.000010267461,0.00002120255,0.00015752729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986752,0.00025885337,0.00040318485,0.00027214098,0.00016330912,0.00022728465],"domain_scores_gemma":[0.99736863,0.00084312237,0.00018571137,0.0013330873,0.00019017672,0.000079252175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038152473,0.00017823238,0.00026758318,0.00022391239,0.0012018782,0.00010272513,0.0011877242,0.0000940287,0.000020655198],"category_scores_gemma":[0.000012927054,0.00019043457,0.0000968086,0.00045703884,0.0001323328,0.0004274858,0.00004222608,0.00036693376,0.000008790629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013636614,0.0010138111,0.00043281302,0.00016039635,0.00027569785,6.8765765e-8,0.0042350194,0.03315996,0.097099625,0.068564594,0.00019578917,0.79472584],"study_design_scores_gemma":[0.0006434865,0.00018518184,0.00024966453,0.00013116498,0.000028080174,0.000003625688,0.000009988793,0.9862602,0.01147498,0.00010532604,0.00069906726,0.00020923746],"about_ca_topic_score_codex":0.000008754997,"about_ca_topic_score_gemma":0.00001356859,"teacher_disagreement_score":0.95310026,"about_ca_system_score_codex":0.000053154876,"about_ca_system_score_gemma":0.000038595514,"threshold_uncertainty_score":0.92439973},"labels":[],"label_agreement":null},{"id":"W2163387794","doi":"10.1109/icdcsw.2009.26","title":"ML Performance Analysis of the Decode-and-Forward Protocol in Multi-hop Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quadrature amplitude modulation; QAM; Computer science; Relay; Amplitude; Pulse-amplitude modulation; Protocol (science); Algorithm; Hop (telecommunications); Topology (electrical circuits); Mathematics; Telecommunications; Pulse (music); Decoding methods; Physics; Bit error rate; Combinatorics; Optics","score_opus":0.03997602523936104,"score_gpt":0.3160113034262542,"score_spread":0.27603527818689316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163387794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054092977,0.0000805096,0.92327464,0.0020677864,0.000047988517,0.015624606,2.5862155e-7,0.00008391157,0.004727325],"genre_scores_gemma":[0.9894845,0.00006985528,0.0083224345,0.0005519446,0.0000044292565,0.0013601551,2.9085905e-7,0.0000015815617,0.00020481771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992819,0.000097745884,0.00023261414,0.0001593158,0.00009868378,0.00012974428],"domain_scores_gemma":[0.9991628,0.00005031197,0.00007413713,0.00062065606,0.000062864565,0.000029242468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003405969,0.000074099415,0.00015377582,0.00012318791,0.00009466954,0.000042269472,0.0007675827,0.000029976693,0.000017589802],"category_scores_gemma":[0.000018178784,0.00004750997,0.000058125293,0.0017703908,0.000030972482,0.00018554911,0.00026151518,0.00012235314,9.637229e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001842377,0.00024150546,0.18076225,0.000008466948,0.0000994953,5.370053e-7,0.0014831424,0.07903641,0.00022257233,0.03506125,0.00027539599,0.70279056],"study_design_scores_gemma":[0.00017933772,0.000017129647,0.28845242,0.000011653609,0.0000065498157,2.4388757e-7,0.0000039953966,0.71071035,0.00012028268,0.000012407703,0.0004389858,0.00004663273],"about_ca_topic_score_codex":0.000004789417,"about_ca_topic_score_gemma":0.0002605901,"teacher_disagreement_score":0.9353915,"about_ca_system_score_codex":0.000018262306,"about_ca_system_score_gemma":0.00001964999,"threshold_uncertainty_score":0.19374003},"labels":[],"label_agreement":null},{"id":"W2163708326","doi":"10.1109/tsp.2006.885761","title":"The Amplify-and-Forward Half-Duplex Cooperative System: Pairwise Error Probability and Precoder Design","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pairwise error probability; Diversity gain; Coding gain; MIMO; Control theory (sociology); Mathematics; Algorithm; Computer science; Quadrature amplitude modulation; Topology (electrical circuits); Bit error rate; Statistics; Decoding methods; Beamforming","score_opus":0.06548811704567381,"score_gpt":0.29228271950254886,"score_spread":0.22679460245687505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163708326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032738338,0.00097019016,0.9939073,0.000707027,0.00009522216,0.0005175764,0.0000012338709,0.00021948587,0.0003081736],"genre_scores_gemma":[0.97695655,0.00012844821,0.022473937,0.00015813741,0.00002496187,0.00006908761,3.4967962e-7,0.000013318461,0.0001751938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983087,0.00033655678,0.0003650394,0.00042993776,0.00023655377,0.0003231886],"domain_scores_gemma":[0.998376,0.0007468149,0.00010645685,0.0003647731,0.00026079675,0.00014513821],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017675495,0.00020810076,0.00018777947,0.00008202962,0.0020520797,0.0005354795,0.00041786992,0.000080598686,0.00000797393],"category_scores_gemma":[0.0000125608485,0.00014970906,0.000039802308,0.00044195002,0.00023571649,0.0005735105,0.000012735117,0.00039268995,0.000006267195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001273904,0.00011936517,0.000016809117,0.00009345807,0.00004316865,0.0000036224503,0.0038306848,0.0138288755,0.0020711196,0.0030367698,0.000053476924,0.9767753],"study_design_scores_gemma":[0.000617825,0.00024612705,0.00019401277,0.00027468894,0.00003570224,0.00006380954,0.0006631821,0.98189616,0.013772948,0.00029349708,0.0015348267,0.00040723372],"about_ca_topic_score_codex":0.000006159103,"about_ca_topic_score_gemma":0.000088201756,"teacher_disagreement_score":0.976368,"about_ca_system_score_codex":0.000103766455,"about_ca_system_score_gemma":0.00013224444,"threshold_uncertainty_score":0.99924713},"labels":[],"label_agreement":null},{"id":"W2163728156","doi":"10.1109/tvt.2011.2136391","title":"End-to-End Performance of Cooperative Relaying in Spectrum-Sharing Systems With Quality of Service Requirements","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Cognitive radio; Quality of service; Computer network; Computer science; Transmission (telecommunications); Bandwidth (computing); Wireless; Telecommunications; Power (physics)","score_opus":0.07246634989257639,"score_gpt":0.2870253129175802,"score_spread":0.21455896302500382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163728156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5913553,0.000063908614,0.40762994,0.00025649933,0.00007068093,0.00023679253,0.0000018489593,0.00007537653,0.00030961586],"genre_scores_gemma":[0.9940379,0.000106873835,0.005680641,0.000064514184,0.0000024322087,0.00007152298,4.886582e-7,0.000009580495,0.000026040285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986593,0.00011273458,0.0004842335,0.0003330423,0.0001994666,0.00021119814],"domain_scores_gemma":[0.9985805,0.000043528315,0.0001718255,0.00094240287,0.0002246291,0.000037079088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044943584,0.00014393408,0.00031015545,0.0005320436,0.00012037885,0.000012181035,0.00094241573,0.00010960688,0.0000183962],"category_scores_gemma":[0.0000062862914,0.00013212516,0.000031543612,0.0019409902,0.00009305986,0.00025564287,0.000024775016,0.00034072017,0.000008815746],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009129281,0.003108416,0.031378273,0.0008322378,0.0007779771,0.000048273952,0.02309849,0.34235916,0.29576597,0.21629192,0.000009258428,0.08541709],"study_design_scores_gemma":[0.0017085603,0.0015014894,0.007565646,0.0011713421,0.00002765813,0.00003803243,0.0008054225,0.22506532,0.76129675,0.00016645108,0.00008418072,0.0005691701],"about_ca_topic_score_codex":0.00016901061,"about_ca_topic_score_gemma":0.00062212767,"teacher_disagreement_score":0.46553075,"about_ca_system_score_codex":0.00008478331,"about_ca_system_score_gemma":0.00005549842,"threshold_uncertainty_score":0.5387908},"labels":[],"label_agreement":null},{"id":"W2163756625","doi":"10.1109/tvt.2007.907082","title":"Optimizing Truncated ARQ Scheme Over Wireless Fading Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Korea Advanced Institute of Science and Technology; Korea Institute of Science and Technology","keywords":"Retransmission; Fading; Automatic repeat request; Selective Repeat ARQ; Hybrid automatic repeat request; Computer science; Network packet; Computer network; Wireless; Algorithm; Transmission (telecommunications); Channel (broadcasting); Telecommunications; Telecommunications link","score_opus":0.031622801660563554,"score_gpt":0.25612490117231274,"score_spread":0.22450209951174918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163756625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18659556,0.00024815154,0.80988497,0.0016321149,0.00036188445,0.00017025444,0.0000010357918,0.0009274523,0.00017855478],"genre_scores_gemma":[0.9783879,0.0009404848,0.019994957,0.00030454062,0.000020331081,0.00008498443,0.0000012840744,0.000021064485,0.0002444738],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985842,0.000080647595,0.00028187223,0.0004712394,0.00020161197,0.00038039987],"domain_scores_gemma":[0.99859476,0.000060116276,0.0000828403,0.0010516844,0.00013425843,0.00007631643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014168033,0.00022253956,0.00025784213,0.000604588,0.00078079326,0.000048640566,0.0011082633,0.0002537148,0.00004535787],"category_scores_gemma":[0.00000675379,0.00022978516,0.0001161954,0.0016492333,0.00018657718,0.0003190057,0.000019367197,0.00064051664,0.000088295055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006187325,0.0014726876,0.00018905444,0.00004462998,0.00056175666,0.00044140822,0.004944197,0.15102188,0.3977805,0.067829065,0.000886115,0.37476683],"study_design_scores_gemma":[0.000972681,0.00016564954,0.00005021457,0.00008913728,0.000013243487,0.00025408613,0.00004853851,0.7127941,0.27903906,0.00031518025,0.0057283873,0.0005296763],"about_ca_topic_score_codex":0.0000040538316,"about_ca_topic_score_gemma":0.000008603928,"teacher_disagreement_score":0.79179233,"about_ca_system_score_codex":0.00010603264,"about_ca_system_score_gemma":0.000060210732,"threshold_uncertainty_score":0.9370367},"labels":[],"label_agreement":null},{"id":"W2163807216","doi":"10.1109/twc.2007.05092","title":"A cooperative diversity scheme based on quadrature signaling","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Phase-shift keying; Cooperative diversity; Diversity gain; Computer science; Quadrature (astronomy); Bit error rate; Quadrature amplitude modulation; Diversity scheme; Electronic engineering; Channel (broadcasting); Bandwidth (computing); Telecommunications; Algorithm; Fading; Engineering","score_opus":0.05051653296346701,"score_gpt":0.29182584809115064,"score_spread":0.24130931512768364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163807216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006354939,0.00011717065,0.9847443,0.0039025997,0.00022733587,0.00033019617,0.00001375607,0.00039021258,0.0039194934],"genre_scores_gemma":[0.96697444,0.00031568954,0.030459698,0.0019177588,0.00001906231,0.000045559216,0.000010645678,0.000018149502,0.0002389973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811655,0.00040091362,0.00036080144,0.00039971713,0.00037717045,0.00034481997],"domain_scores_gemma":[0.9947694,0.0011538969,0.00012472612,0.0033970748,0.0003739389,0.00018096002],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007466697,0.00025874499,0.00022865275,0.00034951267,0.0031224098,0.00016643891,0.0032453262,0.00013798999,0.00005703604],"category_scores_gemma":[0.000015651345,0.0002652732,0.00015560689,0.0013895464,0.0002106371,0.00040116097,0.00008393204,0.0009989305,0.00008394737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041172747,0.007656758,0.00048335368,0.00004797129,0.00042583814,0.000031705924,0.015192447,0.13772437,0.037446152,0.3503465,0.0018287005,0.44840446],"study_design_scores_gemma":[0.0015376009,0.00035583953,0.0006080228,0.0002828467,0.000034047618,0.0000069347975,0.00033130153,0.946735,0.042884536,0.00019887213,0.006167295,0.0008576908],"about_ca_topic_score_codex":0.000017830238,"about_ca_topic_score_gemma":0.00038020764,"teacher_disagreement_score":0.9606195,"about_ca_system_score_codex":0.00020563912,"about_ca_system_score_gemma":0.0001236099,"threshold_uncertainty_score":0.99998},"labels":[],"label_agreement":null},{"id":"W2163965950","doi":"10.1109/vetecs.2008.262","title":"Distributed Generalized Cyclic Delay Diversity for Cooperative OFDM Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Relay; Node (physics); Channel (broadcasting); Diversity gain; Wireless; Bit error rate; A priori and a posteriori; Algorithm; Wireless network; Cooperative diversity; Diversity scheme; Set (abstract data type); Topology (electrical circuits); Computer network; Fading; Telecommunications; Mathematics; Engineering","score_opus":0.07936495254193164,"score_gpt":0.2783735422857882,"score_spread":0.19900858974385655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163965950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03565242,0.00045493836,0.96075165,0.0006895774,0.00024799036,0.0004057113,0.000016178261,0.0002216983,0.0015598089],"genre_scores_gemma":[0.9858919,0.0004906276,0.010976312,0.00043327184,0.000048543152,0.00005171617,0.000042895394,0.00000531248,0.002059436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901724,0.00015180594,0.00019510121,0.00027123874,0.00014711202,0.00021750924],"domain_scores_gemma":[0.99879193,0.00015963482,0.00006179757,0.00055169675,0.00033773654,0.00009718439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019284556,0.00012491821,0.00019035435,0.00004623218,0.0012901946,0.00008597564,0.0009371575,0.00004473653,0.000021744843],"category_scores_gemma":[0.000048964113,0.00010574941,0.000069021895,0.00036503107,0.00005977373,0.0003309175,0.00091413106,0.0000796456,0.000027246544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004938334,0.0002569756,0.004330394,0.000017511073,0.00016328927,0.000023902843,0.0035908315,0.0071642175,0.0018994764,0.8612413,0.116722584,0.0045401473],"study_design_scores_gemma":[0.0021443013,0.00015233237,0.003191202,0.00002172748,0.000012376374,0.00006139851,0.0000741132,0.89889807,0.0014566316,0.00018105473,0.093288146,0.00051866134],"about_ca_topic_score_codex":0.00003373853,"about_ca_topic_score_gemma":0.00003163179,"teacher_disagreement_score":0.9502395,"about_ca_system_score_codex":0.000068391346,"about_ca_system_score_gemma":0.000052498344,"threshold_uncertainty_score":0.9923264},"labels":[],"label_agreement":null},{"id":"W2164020926","doi":"10.1109/twc.2008.060488","title":"Tradeoff Analysis of Performance and Complexity on GSECps Diversity Combining Scheme","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scheme (mathematics); Selection (genetic algorithm); Diversity combining; Diversity (politics); Computational complexity theory; Cooperative diversity; Diversity scheme; Channel (broadcasting); Algorithm; Mathematics; Telecommunications; Orthogonal frequency-division multiplexing; Fading; Artificial intelligence","score_opus":0.126344894612545,"score_gpt":0.2881593389849175,"score_spread":0.16181444437237252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164020926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4711253,0.00010846044,0.5257951,0.0011309743,0.00005612296,0.00015343308,0.00002008454,0.0001360899,0.001474462],"genre_scores_gemma":[0.9844549,0.005230605,0.010013216,0.00018354181,0.0000028031377,0.000021904703,0.000009389195,0.000007217903,0.00007648051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987186,0.0002680863,0.0003232514,0.00026586704,0.0002504898,0.0001736851],"domain_scores_gemma":[0.9968424,0.0004544832,0.00014128983,0.0023062115,0.00015888216,0.0000967234],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00023610712,0.00015991092,0.0003240872,0.00046235512,0.0022996168,0.00003064513,0.0018663241,0.00006144783,0.00002576393],"category_scores_gemma":[0.000003452277,0.00017145599,0.00013989181,0.0017422478,0.0005413619,0.00032489735,0.00010431567,0.00043609328,0.000008417665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022242982,0.009311241,0.023001326,0.00009798843,0.004444907,0.0000067213577,0.046373162,0.043989476,0.0050175325,0.34999594,0.0004495908,0.51708966],"study_design_scores_gemma":[0.0007011817,0.00014797253,0.04940103,0.00006419743,0.0001409434,0.000007288228,0.000093347124,0.94621915,0.002293718,0.000057956517,0.00057322835,0.00029998177],"about_ca_topic_score_codex":0.000034013126,"about_ca_topic_score_gemma":0.00018273882,"teacher_disagreement_score":0.90222967,"about_ca_system_score_codex":0.00005935277,"about_ca_system_score_gemma":0.000043211287,"threshold_uncertainty_score":0.99899924},"labels":[],"label_agreement":null},{"id":"W2164040786","doi":"10.1109/wcnc.2011.5779421","title":"Variable-rate based relay selection scheme for decode-and-forward cooperative networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Spectral efficiency; Transmission (telecommunications); Computer science; Variable (mathematics); Bit error rate; Signal-to-noise ratio (imaging); Link adaptation; Expression (computer science); Cumulative distribution function; Selection (genetic algorithm); Algorithm; Path (computing); Control theory (sociology); Decoding methods; Mathematics; Telecommunications; Statistics; Channel (broadcasting); Probability density function; Computer network; Fading; Power (physics); Artificial intelligence","score_opus":0.05005447480293504,"score_gpt":0.2639176706126725,"score_spread":0.21386319580973748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164040786","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000562811,0.000103275495,0.990343,0.0003501891,0.00014833202,0.0003213285,6.5352685e-7,0.00020611992,0.007964321],"genre_scores_gemma":[0.4353587,0.000108401335,0.56200045,0.0014489865,0.000041571846,0.00011025961,0.000005633685,0.000011298868,0.0009146693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896157,0.00016638794,0.00021673033,0.00033897997,0.000066371525,0.00024996238],"domain_scores_gemma":[0.99885905,0.0002557769,0.00006907599,0.00037824703,0.00033910942,0.000098751174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067321863,0.00014562762,0.00015440954,0.00006953297,0.000406323,0.00013039191,0.0004522613,0.00007707472,0.0001526375],"category_scores_gemma":[0.00008314875,0.00012639411,0.00003813594,0.00040414225,0.00003239248,0.00041775597,0.00017534626,0.00015563036,0.000010042906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004325632,0.00007144892,0.0006609191,0.0000061493743,0.00003851921,3.9036567e-7,0.0004270653,0.0057792123,0.000544415,0.9730136,0.002760959,0.016654069],"study_design_scores_gemma":[0.00048626756,0.00013717038,0.00064746896,0.000013137317,0.0000061974642,0.0000022159784,0.000009489999,0.99119395,0.0012383244,0.00058873993,0.0054935752,0.00018343757],"about_ca_topic_score_codex":0.0000133419935,"about_ca_topic_score_gemma":0.00011655809,"teacher_disagreement_score":0.98541474,"about_ca_system_score_codex":0.000036662383,"about_ca_system_score_gemma":0.00008727042,"threshold_uncertainty_score":0.5154202},"labels":[],"label_agreement":null},{"id":"W2164053576","doi":"10.1109/pimrc.2008.4699886","title":"Performance of variable time-fraction collaborative communication","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Fraction (chemistry); Upper and lower bounds; Variable (mathematics); Computer science; Pairwise error probability; Pairwise comparison; Scheme (mathematics); MIMO; Protocol (science); Computer network; Mathematics","score_opus":0.024221649668357367,"score_gpt":0.251259948473469,"score_spread":0.22703829880511162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164053576","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33306178,0.0009779652,0.31353474,0.0012835021,0.00010567748,0.00037979643,0.0000015297529,0.00032864572,0.35032636],"genre_scores_gemma":[0.88614696,0.0024344302,0.10920353,0.00013407966,0.000007101837,0.000010268505,0.000004636518,0.0000030212777,0.0020559896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993884,0.00013155259,0.00017517674,0.00010597309,0.00011694426,0.000081959704],"domain_scores_gemma":[0.9986611,0.00011218784,0.00010037136,0.0007359115,0.0003633978,0.000027014174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022802682,0.000059913826,0.000104564315,0.000054285392,0.0002744522,0.000015992848,0.0006416155,0.000027430162,0.00013594195],"category_scores_gemma":[0.000027708269,0.000055535664,0.0000151125305,0.00072950654,0.00006174932,0.00062983215,0.00022685649,0.00008337349,0.00007861667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009758958,0.0009405784,0.022528766,0.00004716964,0.0001453636,0.0000019746376,0.008539279,0.0058379476,0.09423373,0.6455975,0.058617815,0.1634123],"study_design_scores_gemma":[0.00045154622,0.00016209968,0.012710417,0.000047352165,0.000003997491,0.00001716619,0.00003704132,0.93152213,0.020617967,0.0002553868,0.033954874,0.00022003961],"about_ca_topic_score_codex":0.0000053892954,"about_ca_topic_score_gemma":0.0000018028742,"teacher_disagreement_score":0.92568415,"about_ca_system_score_codex":0.000030685176,"about_ca_system_score_gemma":0.00009094723,"threshold_uncertainty_score":0.22646786},"labels":[],"label_agreement":null},{"id":"W2164206932","doi":"10.1109/ccece.2011.6030627","title":"Experimental evaluation of collaborative data dissemination in WSNS using network coding and store and forward techniques","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Linear network coding; Computer science; Dissemination; Wireless sensor network; Computer network; Coding (social sciences); Network packet; Communications protocol; Data transmission; Wireless; Wireless network; Distributed computing; Telecommunications","score_opus":0.18324592662460695,"score_gpt":0.39826161907580954,"score_spread":0.21501569245120258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164206932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55882555,0.0045613786,0.42954966,0.00013433894,0.00008667082,0.0008378646,0.000004403269,0.00007575837,0.0059243697],"genre_scores_gemma":[0.90369636,0.00019376542,0.09605956,0.00001639902,0.000009359749,0.000010366245,0.0000055165337,0.0000027855344,0.000005896073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992264,0.00018835442,0.00016329058,0.00019938039,0.00014190204,0.00008068044],"domain_scores_gemma":[0.9992995,0.00006770022,0.00008034752,0.0003648865,0.0001631333,0.000024381725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011292743,0.00006527198,0.00009868792,0.00006672222,0.00008619747,0.000037276543,0.00029158266,0.000027122873,0.0000125932265],"category_scores_gemma":[0.000041433592,0.00006143177,0.00000449961,0.0003376722,0.000050563325,0.00067955814,0.0006097161,0.000046071247,8.202588e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049832237,0.0003141862,0.026628323,0.00002985972,0.0000507941,0.0000019160698,0.051057547,0.00010753046,0.07551545,0.17714484,0.00109707,0.66800267],"study_design_scores_gemma":[0.00020550136,0.00005489879,0.006653735,0.00011717422,0.000008392516,0.000002457826,0.00088395114,0.95706594,0.0343651,0.0004660559,0.00006500283,0.00011177906],"about_ca_topic_score_codex":0.000013991071,"about_ca_topic_score_gemma":0.000071341514,"teacher_disagreement_score":0.9569584,"about_ca_system_score_codex":0.00004218678,"about_ca_system_score_gemma":0.000040553634,"threshold_uncertainty_score":0.2505115},"labels":[],"label_agreement":null},{"id":"W2164310757","doi":"10.1109/mc-ss.2011.5910728","title":"Optimal power allocation for secure multi-carrier relay systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Subcarrier; Computer science; Transmission (telecommunications); Power (physics); Computer network; Secure transmission; Electronic engineering; Telecommunications; Orthogonal frequency-division multiplexing; Engineering","score_opus":0.08187259647080453,"score_gpt":0.28750356629569834,"score_spread":0.20563096982489382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164310757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022931274,0.00039738553,0.9895332,0.000257938,0.00037404776,0.00031679578,0.0000011757246,0.0001593284,0.006667029],"genre_scores_gemma":[0.8006855,0.000047567577,0.19611247,0.00021685315,0.000021045724,0.00007682949,0.000003075721,0.0000070295023,0.0028296064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932027,0.000064238564,0.00016960471,0.00021082803,0.00008239612,0.0001526506],"domain_scores_gemma":[0.9990276,0.000049527083,0.000053303116,0.0005845631,0.00022159262,0.00006339822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028638588,0.000086814696,0.00008949911,0.000044044282,0.00015715799,0.00008640386,0.00066947326,0.00004874016,0.000055020497],"category_scores_gemma":[0.000031500298,0.00007318065,0.000042302614,0.00016137311,0.000019570589,0.0003269846,0.00017148948,0.000071718314,0.000034262008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013568097,0.00014938421,0.00027743925,0.00001238853,0.00004305218,0.0000011514888,0.009290743,0.001041424,0.0010568413,0.97132015,0.009730856,0.0070630056],"study_design_scores_gemma":[0.00054466585,0.0001043284,0.0009823095,0.000024284302,0.0000048735405,0.0000064368105,0.00020874987,0.9370424,0.0012693465,0.000044991066,0.059532948,0.00023464562],"about_ca_topic_score_codex":0.0000064424685,"about_ca_topic_score_gemma":0.000012157116,"teacher_disagreement_score":0.97127515,"about_ca_system_score_codex":0.00002530487,"about_ca_system_score_gemma":0.00003404072,"threshold_uncertainty_score":0.29842204},"labels":[],"label_agreement":null},{"id":"W2164347731","doi":"10.1109/twc.2010.04.090059","title":"Signal space cooperative communication","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Constellation; Computer science; Constellation diagram; SIGNAL (programming language); Cooperative diversity; Antenna diversity; Telecommunications; Modulation (music); Relay channel; Topology (electrical circuits); Electronic engineering; Decoding methods; Wireless; Bit error rate; Fading; Electrical engineering; Engineering; Acoustics","score_opus":0.03571598302675493,"score_gpt":0.2883662476174097,"score_spread":0.25265026459065476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164347731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003995603,0.00027028777,0.9732751,0.012321654,0.00032861085,0.00041020766,0.000014847426,0.00056829717,0.00881539],"genre_scores_gemma":[0.9485715,0.0022194702,0.04743558,0.0006437214,0.000021129616,0.0002882301,0.000015659172,0.000028703967,0.0007759992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978866,0.0006180479,0.00045880812,0.00040590117,0.0003009116,0.00032971258],"domain_scores_gemma":[0.9915639,0.00088981545,0.00016826141,0.0066906866,0.00049211853,0.0001952023],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005360462,0.00028611592,0.00026179166,0.00027111996,0.0021257957,0.00034604542,0.0054925196,0.00016119948,0.00021478465],"category_scores_gemma":[0.000015080431,0.00029759778,0.0001472868,0.0011615017,0.00047101933,0.00084450387,0.00008593701,0.0017047127,0.00030745662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014571289,0.0010068272,0.000022563361,0.000005733929,0.00008749048,0.0000011266579,0.002164682,0.001305289,0.033422258,0.67838115,0.0010270654,0.28256127],"study_design_scores_gemma":[0.0019827813,0.00028929923,0.00057114486,0.00019035928,0.00006985662,0.00007693101,0.00037261425,0.8010306,0.11353249,0.003813823,0.076431744,0.0016383777],"about_ca_topic_score_codex":0.000029401084,"about_ca_topic_score_gemma":0.0011918447,"teacher_disagreement_score":0.9445759,"about_ca_system_score_codex":0.00007767905,"about_ca_system_score_gemma":0.00018591204,"threshold_uncertainty_score":0.9999476},"labels":[],"label_agreement":null},{"id":"W2164399652","doi":"10.1109/tnet.2010.2091652","title":"An Adaptive Network Coded Retransmission Scheme for Single-Hop Wireless Multicast Broadcast Services","year":2010,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Retransmission; Multicast; Computer network; Wireless network; Spectral efficiency; Performance metric; Multiple description coding; Network packet; Distributed computing; Wireless; Telecommunications","score_opus":0.05062227745882194,"score_gpt":0.2949330877752368,"score_spread":0.24431081031641486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164399652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019338593,0.00022284457,0.975256,0.00058988197,0.0029368973,0.0006682057,0.000009177789,0.00055905053,0.00041931894],"genre_scores_gemma":[0.82541454,0.00023894235,0.17271568,0.00051864714,0.0008615669,0.00011544575,0.000013612919,0.00005231089,0.00006922832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730515,0.00023545811,0.00052505,0.00083377707,0.00034998005,0.0007506057],"domain_scores_gemma":[0.9965824,0.00061598816,0.00020244102,0.0019434509,0.00032723357,0.00032851097],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006418741,0.0004124381,0.00037629364,0.00015486885,0.0015458516,0.00044863787,0.0021690885,0.00027404292,0.000041664574],"category_scores_gemma":[0.000006657726,0.00041690623,0.00020344817,0.00097139366,0.00011118246,0.00080998894,0.000033646105,0.000977089,0.000017424982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022844899,0.0004961124,0.000058457543,0.000029572378,0.00007959543,0.0000054419775,0.0014064724,0.032900024,0.0731019,0.0020872734,0.0001300609,0.88947666],"study_design_scores_gemma":[0.0009830747,0.0004299131,0.00007052135,0.00033037207,0.000031510488,0.000021612896,0.00008021538,0.972473,0.0071736993,0.0005043685,0.017324392,0.0005773113],"about_ca_topic_score_codex":0.000012632611,"about_ca_topic_score_gemma":0.00047991096,"teacher_disagreement_score":0.939573,"about_ca_system_score_codex":0.00007434643,"about_ca_system_score_gemma":0.000070990216,"threshold_uncertainty_score":0.9998283},"labels":[],"label_agreement":null},{"id":"W2164439054","doi":"10.1109/ccece.2008.4564556","title":"Hardware aspects of fixed relay station design for OFDM(A) based wireless relay networks","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Baseband; Computer science; Relay; Orthogonal frequency-division multiplexing; Field-programmable gate array; Computer hardware; Wireless; Embedded system; Computer architecture; Power (physics); Channel (broadcasting); Computer network; Bandwidth (computing); Telecommunications","score_opus":0.040929868753854695,"score_gpt":0.22165970724850884,"score_spread":0.18072983849465413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164439054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010994643,0.000148737,0.98688096,0.00080165925,0.00013315027,0.00047936238,0.0000044692083,0.00014797175,0.00040902675],"genre_scores_gemma":[0.9639655,0.00029711777,0.035195086,0.00030899208,0.00007240336,0.00008893732,0.000010692714,0.000020990532,0.00004031618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982333,0.000032181695,0.00037750386,0.00054469996,0.00022463438,0.0005876692],"domain_scores_gemma":[0.99816865,0.00025523084,0.000140075,0.0002534773,0.00074079115,0.0004417766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002620357,0.00030877802,0.00038884513,0.00039035984,0.0003093148,0.00020867983,0.0007839967,0.00015368123,0.000010682582],"category_scores_gemma":[0.00007764179,0.00031758903,0.000068272915,0.0007122728,0.000065328946,0.0003357831,0.000077495446,0.0003853986,0.0000020831906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005595172,0.00008554824,0.0005697908,0.000091598384,0.00006569593,0.000017200751,0.0011789008,0.03526128,0.001495046,0.84608537,0.0016453736,0.11344825],"study_design_scores_gemma":[0.0004865332,0.0004478641,0.0019198388,0.00017382682,0.000008308497,0.000016788892,0.000005461193,0.9946193,0.0010585235,0.00024688672,0.00064918917,0.00036747806],"about_ca_topic_score_codex":0.000130954,"about_ca_topic_score_gemma":0.00017029338,"teacher_disagreement_score":0.95935804,"about_ca_system_score_codex":0.00014464988,"about_ca_system_score_gemma":0.00071910303,"threshold_uncertainty_score":0.99992764},"labels":[],"label_agreement":null},{"id":"W2164634285","doi":"10.1109/cnsr.2011.40","title":"Random Network Coding Effects on CDMA/TDD Mesh Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Code division multiple access; Duplex (building); Computer science; Computer network; Linear network coding; Division (mathematics); Coding (social sciences); Distributed computing; Mathematics; Arithmetic","score_opus":0.04072582247083264,"score_gpt":0.25455867406607996,"score_spread":0.21383285159524731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164634285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071883865,0.0003606626,0.8894029,0.0003299058,0.0008680791,0.00028721566,6.329051e-8,0.000411097,0.10762119],"genre_scores_gemma":[0.9670786,0.0008794862,0.027341919,0.0033264267,0.0003267969,0.00004243347,0.0000018618871,0.000015046351,0.0009874247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984353,0.00034646178,0.0002502238,0.00036444902,0.00017423891,0.000429307],"domain_scores_gemma":[0.99805313,0.0006224417,0.000083841216,0.0010209082,0.00007850457,0.00014114563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006529014,0.00019818636,0.00024538,0.00006239331,0.00039264152,0.0001361242,0.0012705909,0.00007484055,0.00016187367],"category_scores_gemma":[0.000053118863,0.00016361418,0.000097597156,0.0005710634,0.00003561958,0.00027725898,0.0005117925,0.00028128925,0.00014330665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051226634,0.00005966953,0.0004970463,0.0000053525137,0.00003984714,0.0000132098485,0.0006038478,0.00063844875,0.000038677532,0.7882945,0.022773268,0.1869849],"study_design_scores_gemma":[0.0030244784,0.00035935268,0.0061965147,0.0002657741,0.000019128272,0.000012935418,0.0000143329635,0.9688872,0.0022376704,0.0033741014,0.014855161,0.00075331563],"about_ca_topic_score_codex":0.00000468742,"about_ca_topic_score_gemma":0.00002191076,"teacher_disagreement_score":0.9682488,"about_ca_system_score_codex":0.000034307086,"about_ca_system_score_gemma":0.000022971637,"threshold_uncertainty_score":0.66719925},"labels":[],"label_agreement":null},{"id":"W2164647721","doi":"10.1109/ccece.2011.6030682","title":"Optimal edge nodes selection and power allocation in relay enabled network","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Computer network; Throughput; Relay channel; Enhanced Data Rates for GSM Evolution; Node (physics); Optimization problem; Resource allocation; Bandwidth (computing); Greedy algorithm; Mathematical optimization; Power (physics); Wireless; Telecommunications; Engineering; Mathematics; Algorithm","score_opus":0.03677695124448808,"score_gpt":0.2515574172963568,"score_spread":0.2147804660518687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164647721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17227212,0.000600665,0.789575,0.0005147033,0.00016166335,0.00017809441,4.1387764e-8,0.00017405851,0.036523663],"genre_scores_gemma":[0.9115157,0.00027402485,0.08753389,0.00022307898,0.000017857748,0.00001184308,5.964479e-7,0.000003594741,0.0004193868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936813,0.00010126804,0.00013886932,0.00018437809,0.00005675532,0.00015058678],"domain_scores_gemma":[0.9995944,0.000041718813,0.00003286659,0.00022929357,0.00006416452,0.000037572605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034184597,0.00006929979,0.000073729265,0.000058251568,0.00011286714,0.000057120382,0.00025898428,0.000037578717,0.0000872383],"category_scores_gemma":[0.000017055347,0.00006342474,0.000012005735,0.00043513437,0.000016380496,0.00038631447,0.00018228048,0.00010446569,0.0000163267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047092373,0.00024570682,0.043773532,0.0000069896278,0.000030255953,0.0000040963,0.011022399,0.008196687,0.0025272048,0.8451503,0.004617288,0.08437843],"study_design_scores_gemma":[0.00063000777,0.00014117663,0.15200606,0.00004674878,0.0000036964611,0.000017221771,0.00007743829,0.8370686,0.0021272358,0.0011404422,0.006393872,0.00034746344],"about_ca_topic_score_codex":0.000017499176,"about_ca_topic_score_gemma":0.0001729494,"teacher_disagreement_score":0.8440099,"about_ca_system_score_codex":0.000026349078,"about_ca_system_score_gemma":0.000023723778,"threshold_uncertainty_score":0.2586386},"labels":[],"label_agreement":null},{"id":"W2164767081","doi":"10.1109/glocom.2008.ecp.884","title":"Physical Layer Differential Network Coding for Two-Way Relay Channels","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Differential coding; Computer science; Linear network coding; Coding (social sciences); Physical layer; Channel state information; Detector; Differential (mechanical device); Modulation (music); Decoding methods; Channel (broadcasting); Unitary state; Topology (electrical circuits); Electronic engineering; Algorithm; Telecommunications; Computer network; Mathematics; Wireless; Physics; Engineering","score_opus":0.07223328676928743,"score_gpt":0.3043866700734088,"score_spread":0.23215338330412139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164767081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049860917,0.00008828672,0.9437917,0.0010268165,0.00062603643,0.00023456017,5.275301e-7,0.00023196005,0.004139205],"genre_scores_gemma":[0.98142695,0.00010587529,0.014804561,0.00051861024,0.0008437843,0.000053838598,0.0000043774103,0.000011035972,0.00223094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896,0.00008594307,0.00017047377,0.00029929887,0.0001479625,0.00033629072],"domain_scores_gemma":[0.99892753,0.00025624668,0.000053818607,0.00056411454,0.00010732323,0.00009098105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013808889,0.00013926288,0.00019002001,0.0000360439,0.0006080557,0.000094437506,0.00078922836,0.000031827803,0.000043715347],"category_scores_gemma":[0.000023962228,0.00011687627,0.00011352828,0.00029221384,0.00004651015,0.00026133927,0.0004172054,0.00013798903,0.00004509726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020420772,0.00019064717,0.00024224326,0.000006451945,0.00004853529,0.000005084906,0.002156789,0.005657985,0.005423331,0.91547936,0.039058547,0.03171059],"study_design_scores_gemma":[0.00077509496,0.00007968371,0.0004443557,0.000021064992,0.000005317994,0.000012917397,0.0000055028963,0.97897005,0.0041829064,0.0011621132,0.014071947,0.00026902193],"about_ca_topic_score_codex":0.0000023342793,"about_ca_topic_score_gemma":0.00000927967,"teacher_disagreement_score":0.9733121,"about_ca_system_score_codex":0.000025892563,"about_ca_system_score_gemma":0.000026023554,"threshold_uncertainty_score":0.4766076},"labels":[],"label_agreement":null},{"id":"W2164839311","doi":"10.1109/twc.2009.12.090502","title":"QoS-driven MAC-layer resource allocation for wireless mesh networks with non-altruistic node cooperation and service differentiation","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Quality of service; Resource allocation; Network packet; Node (physics); Wireless mesh network; Wireless; Wireless network; Distributed computing; Telecommunications","score_opus":0.03258955329153554,"score_gpt":0.2715023417749078,"score_spread":0.23891278848337225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164839311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012199746,0.000102445156,0.97210604,0.013880937,0.0001396252,0.0009737069,0.000014528961,0.00028168355,0.0003012714],"genre_scores_gemma":[0.97485983,0.0016570005,0.020506794,0.0022099249,0.00005425439,0.000424945,0.00011452547,0.00003297743,0.00013972072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805915,0.00032545225,0.0004934393,0.0005252858,0.0002473485,0.0003493221],"domain_scores_gemma":[0.9959694,0.0005434418,0.00022745473,0.0024852138,0.0006104836,0.00016400723],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00029055978,0.000332424,0.00032143953,0.00023220915,0.001720976,0.0003719743,0.0016016874,0.00015537365,0.000008092148],"category_scores_gemma":[0.0000075115927,0.00032525798,0.000075840944,0.0009982446,0.00011458086,0.0006089557,0.0000288523,0.00049698236,0.000009222578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003720865,0.0023850086,0.00011858457,0.00010160151,0.00034234332,0.0000016669242,0.0069833454,0.21057747,0.026767062,0.18017408,0.0012338022,0.57094294],"study_design_scores_gemma":[0.0011336419,0.00022262076,0.0009280145,0.000173176,0.00007337157,0.000010109176,0.000073529154,0.993667,0.0023569698,0.00008546855,0.0008734406,0.00040264876],"about_ca_topic_score_codex":0.000019266708,"about_ca_topic_score_gemma":0.00072400464,"teacher_disagreement_score":0.96266013,"about_ca_system_score_codex":0.00014039876,"about_ca_system_score_gemma":0.000104353334,"threshold_uncertainty_score":0.99991995},"labels":[],"label_agreement":null},{"id":"W2164873614","doi":"10.1109/wcnc.2010.5506391","title":"Joint Routing and Power Allocation Optimization for Multi-Hop Wireless Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hop (telecommunications); Computer science; Channel state information; Fading; Computer network; Wireless network; Power control; Wireless; Routing protocol; Routing (electronic design automation); Power (physics); Mathematical optimization; Channel (broadcasting); Mathematics; Telecommunications","score_opus":0.044826986166690515,"score_gpt":0.2845559011433575,"score_spread":0.23972891497666698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164873614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007062411,0.000045773904,0.9907035,0.0010854808,0.00026360241,0.00023080246,1.581633e-7,0.00012435952,0.00048387024],"genre_scores_gemma":[0.68864757,0.00008529961,0.31074932,0.00032604588,0.000029023937,0.000020736868,0.0000041235276,0.0000052653786,0.00013258605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993903,0.000035553814,0.0001664425,0.00020968037,0.00005776097,0.00014024446],"domain_scores_gemma":[0.9992571,0.000075811644,0.00006475998,0.00035552698,0.00019193905,0.00005486945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037152276,0.000081595164,0.00008423118,0.00003972451,0.00025977255,0.00019315546,0.0002765969,0.000054973887,0.00002408796],"category_scores_gemma":[0.000060538438,0.00007425255,0.000023182187,0.00015791476,0.000026492118,0.00032796123,0.00020227389,0.00012844354,0.0000015925579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005906875,0.00009710428,0.00053297763,0.000006614757,0.000017596762,2.7630804e-7,0.0013277499,0.034063775,0.007903315,0.6211266,0.0006708144,0.33424726],"study_design_scores_gemma":[0.00028239767,0.000016357802,0.000886069,0.000008218319,0.0000016485759,0.0000021412684,0.000019215602,0.9977701,0.00044754808,0.000025813144,0.00043705312,0.000103474966],"about_ca_topic_score_codex":0.0000028921077,"about_ca_topic_score_gemma":0.000059816717,"teacher_disagreement_score":0.9637063,"about_ca_system_score_codex":0.000010295294,"about_ca_system_score_gemma":0.00001888537,"threshold_uncertainty_score":0.30279312},"labels":[],"label_agreement":null},{"id":"W2164881538","doi":"10.1109/tit.2010.2054650","title":"Robust Network Coding in the Presence of Untrusted Nodes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Linear network coding; Multicast; Network packet; Disjoint sets; Transformation (genetics); Adversary; Distributed computing; Computer security; Mathematics","score_opus":0.026553637394490848,"score_gpt":0.24598326984372462,"score_spread":0.21942963244923377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164881538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053736805,0.00001364718,0.987617,0.0004486863,0.00050280656,0.00018792051,0.0000022261947,0.000056390345,0.0057976474],"genre_scores_gemma":[0.9940321,0.00011376525,0.00522657,0.0005324382,0.000018064247,0.000036635123,0.0000014158661,0.0000024876813,0.000036547826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904233,0.00023693623,0.0003197073,0.00007587288,0.00018269803,0.00014245862],"domain_scores_gemma":[0.99855185,0.0006138069,0.00011436205,0.0005912767,0.00010368734,0.000025040436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012918233,0.00008411395,0.000088808316,0.00014027678,0.00024916176,0.00010210289,0.0008967734,0.000051781128,0.000068555644],"category_scores_gemma":[0.00002870352,0.00006413463,0.000044290922,0.0007117144,0.00007833902,0.001218877,0.000005789506,0.0004092522,0.00002898419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029470784,0.00006328612,0.00003157554,0.0000126627665,0.000010684622,2.0751895e-7,0.0076248394,0.18875073,0.00038741625,0.6089068,0.00026191364,0.19392042],"study_design_scores_gemma":[0.0010965349,0.00009561509,0.002749148,0.00016119094,0.0000153644,0.00003068735,0.0012277596,0.96376294,0.010024593,0.011969662,0.008450091,0.00041639432],"about_ca_topic_score_codex":0.0000036713789,"about_ca_topic_score_gemma":0.000049138,"teacher_disagreement_score":0.98865837,"about_ca_system_score_codex":0.000013520961,"about_ca_system_score_gemma":0.00003948085,"threshold_uncertainty_score":0.2615334},"labels":[],"label_agreement":null},{"id":"W2165234084","doi":"10.1109/icc.2009.5199309","title":"Performance Analysis of Generalized Selection Combining for Amplify-and-Forward Cooperative-Diversity Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Moment-generating function; Node (physics); Expression (computer science); Outage probability; Relay; Probability density function; Computer science; Fading; Cooperative diversity; Signal-to-noise ratio (imaging); Channel (broadcasting); Maximal-ratio combining; Selection (genetic algorithm); Closed-form expression; Algorithm; Probability of error; Diversity combining; Topology (electrical circuits); Function (biology); Mathematics; Statistics; Telecommunications; Engineering; Power (physics); Combinatorics; Physics","score_opus":0.03933209167295635,"score_gpt":0.27986227305222455,"score_spread":0.2405301813792682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165234084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17583796,0.00009394754,0.8227512,0.00028704468,0.000036217643,0.00014064959,7.007863e-7,0.00006903698,0.00078321376],"genre_scores_gemma":[0.9797687,0.0006282921,0.018862253,0.0005122622,0.000013460039,0.000005385189,0.000011307923,0.0000020526904,0.00019629108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925095,0.00008096342,0.00020082046,0.00021540959,0.000098637334,0.00015324973],"domain_scores_gemma":[0.9992509,0.00010816468,0.000090679816,0.00025239462,0.0002454469,0.000052410254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036385056,0.00009706446,0.0002526938,0.00017671997,0.00052441936,0.000059933234,0.00038741648,0.000045027817,0.000020612137],"category_scores_gemma":[0.00001769639,0.00008822596,0.000073016396,0.0012043166,0.000029148872,0.0003081784,0.0002474275,0.00008483717,4.3080976e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011824772,0.00020313633,0.052119326,0.000012359805,0.00093780615,2.7883897e-7,0.0026463473,0.21389697,0.00198239,0.4744349,0.0019452373,0.25170296],"study_design_scores_gemma":[0.00039033857,0.00015366398,0.03106147,0.00000543289,0.00008157461,5.4840547e-7,0.000010587853,0.96744096,0.00035643645,0.00004721716,0.00034454287,0.00010719401],"about_ca_topic_score_codex":0.00000733409,"about_ca_topic_score_gemma":0.0000393176,"teacher_disagreement_score":0.80393076,"about_ca_system_score_codex":0.000025369607,"about_ca_system_score_gemma":0.000017334592,"threshold_uncertainty_score":0.4033463},"labels":[],"label_agreement":null},{"id":"W2165245616","doi":"10.1109/icc.2010.5502769","title":"Synchronization in Cooperative Networks: Estimation of Multiple Carrier Frequency Offsets","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cramér–Rao bound; Estimator; Synchronization (alternating current); Computer science; Upper and lower bounds; Signal-to-noise ratio (imaging); Channel (broadcasting); Algorithm; Noise (video); Estimation theory; Real-time computing; Telecommunications; Mathematics; Statistics; Artificial intelligence","score_opus":0.015930937733871487,"score_gpt":0.2643607276118041,"score_spread":0.24842978987793263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165245616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052614395,0.00010447649,0.9442491,0.0003809331,0.00022388152,0.00018896056,8.830318e-7,0.000061848994,0.0021755134],"genre_scores_gemma":[0.96520597,0.000075143114,0.03451347,0.00010546722,0.000019727115,0.000016962662,0.0000111716345,0.0000048468246,0.00004724517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991933,0.000102360435,0.00027818183,0.0001860988,0.00011086003,0.00012918544],"domain_scores_gemma":[0.9990205,0.0001601887,0.0000822277,0.00048623123,0.00020884031,0.0000419968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002792084,0.00008934312,0.000124833,0.00010066951,0.00008584041,0.00005068667,0.0004763115,0.00006232782,0.00008456757],"category_scores_gemma":[0.00022081521,0.0000815739,0.000021509732,0.00067555363,0.000050805953,0.0005267856,0.00014462353,0.00020204142,0.000006066234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006529817,0.00016569233,0.035465423,0.00001194406,0.000015597176,0.0000024486635,0.0017228443,0.24772906,0.012251584,0.51609814,0.00046991152,0.1860608],"study_design_scores_gemma":[0.00027246206,0.000021762387,0.012338091,0.000018750055,0.0000010184954,0.0000016776203,0.000010650419,0.9849505,0.0019249519,0.0002724752,0.00009356223,0.000094111914],"about_ca_topic_score_codex":0.000046778154,"about_ca_topic_score_gemma":0.0016384346,"teacher_disagreement_score":0.9125916,"about_ca_system_score_codex":0.000027827175,"about_ca_system_score_gemma":0.00007454707,"threshold_uncertainty_score":0.3326487},"labels":[],"label_agreement":null},{"id":"W2165387706","doi":"10.1109/glocom.2009.5425347","title":"Quantization of Channel State Information for Detect-and-Forward Relaying Schemes","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Relay; Channel state information; Fading; Quantization (signal processing); Computer science; Relay channel; Decoding methods; Channel (broadcasting); Transmission (telecommunications); Throughput; Signal-to-noise ratio (imaging); Overhead (engineering); Computer network; Electronic engineering; Algorithm; Wireless; Telecommunications; Engineering; Physics","score_opus":0.027759583144029428,"score_gpt":0.2746330013786891,"score_spread":0.2468734182346597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165387706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076374128,0.00013121734,0.98997176,0.00091335166,0.000032746477,0.00014970687,5.0138095e-7,0.00006416497,0.001099136],"genre_scores_gemma":[0.937117,0.00042682642,0.061950285,0.00044489396,0.0000049761766,0.000005760941,0.0000035551434,0.0000012364351,0.0000454713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995817,0.00001898831,0.00018616514,0.00006553534,0.00006781425,0.00007977289],"domain_scores_gemma":[0.999495,0.000050239156,0.00008419729,0.0001825088,0.00016385161,0.000024182758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021716715,0.000048762722,0.00007167372,0.000080100086,0.0000977179,0.000059414804,0.00019636985,0.000017766839,0.0000017645904],"category_scores_gemma":[0.0000620987,0.00004349626,0.000019464647,0.00020341834,0.000010079242,0.0008858934,0.000058434012,0.00003211032,0.000002110612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007959793,0.0000068272025,0.00003821484,0.000010896723,0.000005009397,1.9830342e-8,0.0012934252,0.00029196404,0.0014840589,0.23943219,0.00024827357,0.75718117],"study_design_scores_gemma":[0.00043631304,0.00014625293,0.0024399522,0.00003028193,0.0000025198503,0.0000011794132,0.000053099404,0.96940774,0.012708562,0.007185457,0.007465167,0.00012345935],"about_ca_topic_score_codex":7.696522e-7,"about_ca_topic_score_gemma":0.0000022376082,"teacher_disagreement_score":0.9691158,"about_ca_system_score_codex":0.000008631777,"about_ca_system_score_gemma":0.000015581587,"threshold_uncertainty_score":0.17737259},"labels":[],"label_agreement":null},{"id":"W2165441308","doi":"10.1109/tcomm.2010.12.100002","title":"Two-Way MIMO Relay Precoder Design with Channel State Information","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Precoding; Relay; Relay channel; Channel state information; MIMO; Optimization problem; Computer science; Channel (broadcasting); Convex optimization; Control theory (sociology); Mathematical optimization; Wireless; Mathematics; Algorithm; Regular polygon; Computer network; Telecommunications","score_opus":0.04479262687496076,"score_gpt":0.27523187501586266,"score_spread":0.2304392481409019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165441308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058583997,0.00005748516,0.9884584,0.004401376,0.0003159458,0.00049609307,0.000011659341,0.0003942808,0.0052789263],"genre_scores_gemma":[0.818002,0.0008158502,0.17978494,0.00055120734,0.000010680551,0.00030104132,0.000009746724,0.00001558861,0.00050898024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985643,0.0003332224,0.00037666346,0.00021879692,0.00024019818,0.0002667908],"domain_scores_gemma":[0.9950329,0.0005011744,0.00015647348,0.0037888724,0.00038027906,0.00014031169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050888583,0.0002089536,0.00016108778,0.0002786873,0.0011932726,0.0003087253,0.002574228,0.00006976628,0.00006304176],"category_scores_gemma":[0.00001344835,0.00018980644,0.000068698355,0.0008590348,0.00018169585,0.0017575198,0.00003238875,0.00096609996,0.00024927178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013355013,0.0015258649,0.000023107197,0.000021695088,0.00028599755,0.000001903593,0.016887352,0.25819448,0.0060105845,0.04667111,0.002529419,0.66771495],"study_design_scores_gemma":[0.0016208522,0.00029616916,0.0002976133,0.00008514001,0.000038692346,0.00005437919,0.00014156575,0.94063646,0.015070438,0.0012507623,0.039789964,0.0007179913],"about_ca_topic_score_codex":0.00002607696,"about_ca_topic_score_gemma":0.00089877116,"teacher_disagreement_score":0.81741613,"about_ca_system_score_codex":0.000053554526,"about_ca_system_score_gemma":0.00015014406,"threshold_uncertainty_score":0.91778094},"labels":[],"label_agreement":null},{"id":"W2165461663","doi":"10.1109/cwit.2011.5872131","title":"Optimal rates for decode-and-forward cooperative networks with partial CSI","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Channel state information; Channel (broadcasting); Computer network; Selection (genetic algorithm); Power (physics); Relay channel; State (computer science); Distributed computing; Wireless; Telecommunications; Algorithm; Artificial intelligence","score_opus":0.05404808836877685,"score_gpt":0.29313147117228827,"score_spread":0.23908338280351144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165461663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006875952,0.00029654987,0.98791456,0.00037902212,0.00007365826,0.0002894783,6.018467e-7,0.0001168902,0.004053259],"genre_scores_gemma":[0.76196927,0.00029530362,0.2365222,0.00057263847,0.000044015997,0.000097955875,0.00000314326,0.000008964777,0.0004864968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991712,0.0000705972,0.00016103638,0.00028541638,0.00007041616,0.0002413187],"domain_scores_gemma":[0.9991272,0.00013870675,0.000048360842,0.0003844466,0.00019870153,0.000102571044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023375303,0.0001366799,0.0001533723,0.000034918787,0.00029266678,0.00014071297,0.00048676707,0.00003977528,0.000067288274],"category_scores_gemma":[0.000019874657,0.000096717886,0.000029543073,0.0002050917,0.000084450585,0.000393729,0.00025439358,0.00009861547,0.0000070359633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025364748,0.0001787168,0.003678137,0.000008254388,0.00015826043,0.000005848077,0.004691242,0.010899007,0.00011095263,0.88986695,0.005856262,0.08429274],"study_design_scores_gemma":[0.0006881505,0.00040519846,0.0008528879,0.000016758979,0.000009691736,0.000009572228,0.000074768315,0.9870546,0.0027791334,0.000081703496,0.0077808364,0.00024670796],"about_ca_topic_score_codex":0.000004985415,"about_ca_topic_score_gemma":0.00006784389,"teacher_disagreement_score":0.9761556,"about_ca_system_score_codex":0.000011807618,"about_ca_system_score_gemma":0.000044488406,"threshold_uncertainty_score":0.39440408},"labels":[],"label_agreement":null},{"id":"W2165508120","doi":"10.1109/pimrc.2009.5450005","title":"Cooperative vs multihop relaying in cellular systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Path loss; Computer science; Fading; Rayleigh fading; Computer network; Relay; Wireless; Shadow mapping; Multipath propagation; Transmission (telecommunications); Channel (broadcasting); Non-line-of-sight propagation; Throughput; Telecommunications","score_opus":0.03386536272415862,"score_gpt":0.27080561558581684,"score_spread":0.2369402528616582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165508120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031265892,0.002133286,0.9122984,0.0039753392,0.00031277945,0.000392251,2.4888453e-7,0.00030431992,0.049317528],"genre_scores_gemma":[0.99118286,0.00022549053,0.0064195846,0.00082604,0.00002506095,0.000009239018,0.0000013360154,0.0000031343425,0.0013072327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990327,0.00018989269,0.00023029873,0.00023714363,0.00011986374,0.0001901476],"domain_scores_gemma":[0.99918526,0.000085545034,0.00003833411,0.0005425919,0.00009307439,0.000055202927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034014916,0.000100872916,0.00014384715,0.00009984618,0.00013496593,0.00018519287,0.0006932775,0.000039319668,0.00001720703],"category_scores_gemma":[0.000039423052,0.000087358065,0.00002439883,0.00056781067,0.0000147952815,0.00039057384,0.00013904562,0.00017056987,0.0000696653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085831225,0.00015522791,0.00076598197,0.000004557189,0.000007669869,0.0000318128,0.0032358535,0.00818042,0.014001025,0.91778,0.0022659912,0.05356287],"study_design_scores_gemma":[0.0005332351,0.000100166035,0.0023921698,0.00007079399,0.0000010307272,0.0000053994418,0.0001171762,0.98360264,0.002360706,0.00015264709,0.01041455,0.0002494863],"about_ca_topic_score_codex":0.000012115741,"about_ca_topic_score_gemma":0.000021790553,"teacher_disagreement_score":0.9754222,"about_ca_system_score_codex":0.00005837061,"about_ca_system_score_gemma":0.000033151184,"threshold_uncertainty_score":0.35623586},"labels":[],"label_agreement":null},{"id":"W2165568771","doi":"10.1109/wcl.2013.070113.130406","title":"EM-Based Semi-Blind Channel Estimation in Amplify-and-Forward Two-Way Relay Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Estimator; Computer science; Expectation–maximization algorithm; Channel (broadcasting); Maximization; Algorithm; Least-squares function approximation; Cramér–Rao bound; Reciprocal; Estimation theory; Maximum likelihood; Mathematical optimization; Mathematics; Statistics; Telecommunications","score_opus":0.03452578479422909,"score_gpt":0.2812812217511334,"score_spread":0.24675543695690433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165568771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15247262,0.00064922887,0.8184823,0.02699856,0.00019060972,0.0006568083,0.0000017166035,0.00024166012,0.00030653586],"genre_scores_gemma":[0.96198344,0.00078430615,0.031442393,0.005195351,0.000030623138,0.0004585881,0.00004918354,0.00002533661,0.000030775722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977433,0.000647993,0.00056307996,0.00041490296,0.00022076936,0.0004099532],"domain_scores_gemma":[0.99545926,0.0006863131,0.00022292398,0.0033371563,0.00015026226,0.00014406536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006290671,0.00026415204,0.00029197504,0.00034219585,0.00056317187,0.00045651232,0.0029098566,0.000110914865,0.000014316638],"category_scores_gemma":[0.00004136372,0.00027821225,0.000067398025,0.0010336259,0.00022269733,0.00088041596,0.0006932877,0.00072876224,0.00007846428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024644878,0.0004960773,0.0020618772,0.000035364785,0.000081907754,0.0000049177734,0.0048730527,0.66958755,0.0072959894,0.027876744,0.0077466797,0.27991515],"study_design_scores_gemma":[0.0009609121,0.000017242908,0.0029991234,0.00011408628,0.000006504577,0.0000050440026,0.000045115587,0.99461395,0.00015978978,0.00015167981,0.00061195454,0.00031458994],"about_ca_topic_score_codex":0.00013843493,"about_ca_topic_score_gemma":0.000415208,"teacher_disagreement_score":0.8095108,"about_ca_system_score_codex":0.00014144543,"about_ca_system_score_gemma":0.000048901555,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W2165583801","doi":"10.1109/icc.2009.5198946","title":"Downlink Power Distribution in a Wireless CDMA Network with Cooperative Relaying","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Telecommunications link; Code division multiple access; Computer science; Computer network; Power (physics); Wireless; Wireless network; Telecommunications; Physics","score_opus":0.015202763125747865,"score_gpt":0.25040955121072583,"score_spread":0.23520678808497797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165583801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063263305,0.00024249211,0.91668034,0.0052140234,0.00009210721,0.00026079753,8.599463e-7,0.00020575376,0.014040346],"genre_scores_gemma":[0.9919321,0.00015126019,0.006401929,0.0012512993,0.00003235074,0.000010889526,0.000014000814,0.0000036967472,0.00020248634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891424,0.00015291704,0.00021193082,0.00028778956,0.00014653751,0.00028660733],"domain_scores_gemma":[0.99915105,0.00008310962,0.000053701096,0.0005095396,0.00013633365,0.00006623596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003135658,0.00013494205,0.00015919039,0.000037290316,0.00021962596,0.00016260026,0.00056032493,0.00004729773,0.000030999778],"category_scores_gemma":[0.000017287588,0.000102941376,0.000023743849,0.0010520631,0.000032767162,0.00046163122,0.00013074667,0.0002441626,0.00002246397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003786778,0.00014280334,0.004153724,0.0000012670695,0.000011620593,0.000023117136,0.0009422572,0.0046114842,0.0003132526,0.92084086,0.0031322837,0.065789476],"study_design_scores_gemma":[0.003920124,0.0015367354,0.23210274,0.0006281633,0.000011161709,0.00008065029,0.00023287127,0.73010737,0.0015681572,0.0035686034,0.024534283,0.0017091386],"about_ca_topic_score_codex":0.0000045594325,"about_ca_topic_score_gemma":0.00010121185,"teacher_disagreement_score":0.9286688,"about_ca_system_score_codex":0.00008720376,"about_ca_system_score_gemma":0.000061789404,"threshold_uncertainty_score":0.41978276},"labels":[],"label_agreement":null},{"id":"W2165633273","doi":"10.1109/cwit.2009.5069513","title":"Collaborative communications: Joint relay and protocol selection","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Channel (broadcasting); Protocol (science); Selection (genetic algorithm); Computer network; Signal-to-noise ratio (imaging); Constraint (computer-aided design); Resource (disambiguation); Energy (signal processing); Exponent; Telecommunications; Mathematics; Statistics; Physics; Power (physics)","score_opus":0.042357420885732695,"score_gpt":0.32954095137306566,"score_spread":0.28718353048733297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165633273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041944959,0.00038033695,0.7830417,0.041721407,0.000047376616,0.052082613,5.248403e-7,0.0007776794,0.1215289],"genre_scores_gemma":[0.4915761,0.0006158169,0.47576323,0.00407819,0.000037844387,0.026412455,0.000002758621,0.00000755684,0.0015060382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993043,0.00018753778,0.00016585148,0.00016190884,0.00008177673,0.000098648314],"domain_scores_gemma":[0.99891955,0.000050525592,0.000060026196,0.00070654025,0.00021441776,0.000048917405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025944595,0.000075372176,0.000084527455,0.000061160295,0.00034103688,0.00017059421,0.00053839124,0.000029009416,0.000017627952],"category_scores_gemma":[0.000040836105,0.000064612956,0.000013479204,0.00062509853,0.000040714516,0.0004066242,0.00025447545,0.00012777197,0.0000150933265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046144423,0.00009084495,0.00012231829,0.0000020782925,0.0000060175917,2.390397e-7,0.00088354095,0.000020867144,0.0027638525,0.7519992,0.0039787265,0.24012773],"study_design_scores_gemma":[0.001393161,0.00063078525,0.02174751,0.00007856454,0.000004973069,0.00003088727,0.00013224554,0.5363554,0.007132244,0.01009955,0.42188695,0.000507768],"about_ca_topic_score_codex":0.0000014721444,"about_ca_topic_score_gemma":0.000027473714,"teacher_disagreement_score":0.7418996,"about_ca_system_score_codex":0.000032558568,"about_ca_system_score_gemma":0.00005338576,"threshold_uncertainty_score":0.263484},"labels":[],"label_agreement":null},{"id":"W2165893968","doi":"10.1002/wcm.1225","title":"A game‐theoretic approach for relay assignment over distributed wireless networks","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Hong Kong Polytechnic University; Chinese University of Hong Kong; University of Hong Kong","keywords":"Relay; Computer science; Nash equilibrium; Network packet; Computer network; Throughput; Game theory; Regret; Wireless; Fading; Mathematical optimization; Cooperative diversity; Wireless network; Distributed computing; Channel (broadcasting); Telecommunications; Mathematical economics; Power (physics); Mathematics","score_opus":0.04419872048023298,"score_gpt":0.27730726968278563,"score_spread":0.23310854920255264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165893968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02271894,0.0026844405,0.9719503,0.000096372896,0.000094245814,0.0008221517,0.000007791963,0.00025007143,0.0013756786],"genre_scores_gemma":[0.90530384,0.0028797332,0.09109848,0.00016484468,0.000037348746,0.00035232116,0.00010836661,0.000024598698,0.000030484993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804825,0.0003845094,0.0005152081,0.00048514895,0.00014481327,0.0004220806],"domain_scores_gemma":[0.99620235,0.00052148866,0.00026444215,0.0026411575,0.00021310002,0.00015748083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082033564,0.00026067407,0.00033194863,0.000096077325,0.0009605844,0.00021448944,0.002548638,0.00011335315,0.0000067937895],"category_scores_gemma":[0.000016941989,0.0002546993,0.000107758846,0.00050353195,0.00031120956,0.0002453127,0.0023751815,0.00037105536,0.0000016994654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000186902,0.00064638566,0.0015656037,0.000053726402,0.00009437291,9.068463e-7,0.005963942,0.0035989594,0.00020564259,0.52323717,0.00025511533,0.4643595],"study_design_scores_gemma":[0.0005520892,0.00010451397,0.0009486264,0.000090262256,0.00001912749,0.000010155233,0.00020713233,0.9934018,0.00007081168,0.00038931644,0.0038851658,0.00032099173],"about_ca_topic_score_codex":0.000012283337,"about_ca_topic_score_gemma":0.0000063996936,"teacher_disagreement_score":0.98980284,"about_ca_system_score_codex":0.00007720572,"about_ca_system_score_gemma":0.000049980106,"threshold_uncertainty_score":0.9999905},"labels":[],"label_agreement":null},{"id":"W2166210478","doi":"10.1109/icc.2010.5501861","title":"Resource Allocation via Linear Programming for Multi-Source, Multi-Relay Wireless Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Relay; Resource allocation; Computer network; Linear programming; Wireless; Wireless network; Optimization problem; Resource management (computing); Mathematical optimization; Distributed computing; Telecommunications; Algorithm; Mathematics","score_opus":0.048361372603900686,"score_gpt":0.3089085232240967,"score_spread":0.260547150620196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166210478","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003388318,0.00009603937,0.99400264,0.00092029665,0.00031126142,0.0006555057,2.883513e-7,0.0004678737,0.0001577614],"genre_scores_gemma":[0.41973412,0.00003398674,0.5774499,0.00051848654,0.00015822695,0.00013380416,0.00001668873,0.000021245463,0.0019335512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986107,0.00009928691,0.00033049146,0.00043584174,0.00014520834,0.00037848265],"domain_scores_gemma":[0.99824214,0.00021263232,0.00012813059,0.0009893224,0.00028241423,0.00014534057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006951187,0.0001898887,0.00017451741,0.000086408814,0.00051061483,0.00021250866,0.0012619918,0.00014317244,0.0000140792545],"category_scores_gemma":[0.00008414391,0.00017247855,0.00009454461,0.00045039313,0.000072979674,0.00030128474,0.0004216416,0.00042654743,0.000022078351],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008424322,0.00022214242,0.00041045732,0.000007757203,0.000020184703,4.768065e-7,0.00072990265,0.0037858454,0.0038615922,0.018389255,0.0005713358,0.9719926],"study_design_scores_gemma":[0.00061692414,0.000034315373,0.00031097874,0.000013843603,0.000004474277,0.0000041595354,0.000021323815,0.85975707,0.00076697156,0.00000394043,0.1382586,0.00020741309],"about_ca_topic_score_codex":0.000011659776,"about_ca_topic_score_gemma":0.0004889386,"teacher_disagreement_score":0.9717852,"about_ca_system_score_codex":0.000024617626,"about_ca_system_score_gemma":0.00003566636,"threshold_uncertainty_score":0.70334715},"labels":[],"label_agreement":null},{"id":"W2166240152","doi":"10.1109/wcnc.2011.5779220","title":"Error recovery with soft value combining for wireless cooperative systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Decodes; Bit error rate; Relay; Demodulation; Network packet; Wireless; Transmission (telecommunications); Spectral efficiency; Data transmission; Computer network; Channel (broadcasting); Electronic engineering; Decoding methods; Algorithm; Telecommunications; Engineering","score_opus":0.08064950204705965,"score_gpt":0.27337959096434267,"score_spread":0.19273008891728302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166240152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057612956,0.00018544254,0.9740606,0.00017836932,0.00028119303,0.00045932835,0.0000017394694,0.00020928119,0.018862769],"genre_scores_gemma":[0.95721835,0.00005694859,0.039986014,0.00045335188,0.00002922278,0.00014505154,0.0000050274084,0.000013801807,0.0020922204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902713,0.00013739124,0.00020369672,0.00029055527,0.00011758833,0.0002236123],"domain_scores_gemma":[0.998748,0.00022930274,0.00008431702,0.00058720924,0.00027500401,0.00007617106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034714982,0.00013981627,0.00019265298,0.00005737559,0.00031203884,0.00016293129,0.0007803304,0.00004441481,0.000023578948],"category_scores_gemma":[0.000022643022,0.000103787366,0.000032477103,0.000274372,0.000049192786,0.0004960477,0.00019329385,0.00011458577,0.000022915376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005107538,0.00010004524,0.00020463901,0.000016084045,0.00006466818,0.0000026929147,0.0039439327,0.00084863044,0.00029217816,0.9773533,0.0023607616,0.014762018],"study_design_scores_gemma":[0.0013819947,0.0009901924,0.00038066017,0.00018858323,0.000015529084,0.00002848182,0.0009098701,0.983413,0.002006531,0.00048317946,0.009626072,0.0005759117],"about_ca_topic_score_codex":0.000025122099,"about_ca_topic_score_gemma":0.00004731486,"teacher_disagreement_score":0.9825644,"about_ca_system_score_codex":0.000034894754,"about_ca_system_score_gemma":0.00009475616,"threshold_uncertainty_score":0.42323261},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06866355332286894,"score_gpt":0.2970925186943968,"score_spread":0.22842896537152785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166246268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078095854,0.00027330534,0.988743,0.0014964622,0.00020193348,0.00048764428,0.0000031485124,0.00039287808,0.00059206417],"genre_scores_gemma":[0.97268677,0.007193604,0.018271884,0.0005644147,0.000016947622,0.00033036328,0.000011839204,0.000027678198,0.0008964757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766773,0.0007963431,0.00054313935,0.00044087216,0.0002076185,0.00034427483],"domain_scores_gemma":[0.9968907,0.0004163692,0.00012276176,0.0020868834,0.00035981036,0.0001234226],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00033805871,0.0002697341,0.00028145823,0.00038378697,0.0017919582,0.0001257077,0.0019752823,0.00014988398,0.000034503788],"category_scores_gemma":[0.000014618454,0.0002924704,0.00009979674,0.002103061,0.00024648328,0.00080633094,0.000036855574,0.00094805314,0.00007841846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041021645,0.0024488324,0.000402158,0.0000067199157,0.00008234951,0.0000050693407,0.0051116603,0.8331636,0.004152146,0.019978136,0.0005401209,0.13406815],"study_design_scores_gemma":[0.00085264555,0.00008461927,0.0007472508,0.0000533348,0.000006457316,0.000038146944,0.00004763397,0.9929791,0.0026756283,0.000007103726,0.0021863396,0.00032173676],"about_ca_topic_score_codex":0.000059574257,"about_ca_topic_score_gemma":0.0023672804,"teacher_disagreement_score":0.9704711,"about_ca_system_score_codex":0.0002545261,"about_ca_system_score_gemma":0.00016986925,"threshold_uncertainty_score":0.99995273},"labels":[],"label_agreement":null},{"id":"W2166527600","doi":"10.1109/cwit.2007.375691","title":"Diversity-Multiplexing Trade-off in Z-channel","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplexing; Channel (broadcasting); Diversity (politics); Computer science; Interference (communication); Signal-to-noise ratio (imaging); Electronic engineering; Telecommunications; Computer network; Engineering; Political science","score_opus":0.059332455209515196,"score_gpt":0.2832937691839071,"score_spread":0.2239613139743919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166527600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0350673,0.00035893056,0.933477,0.0021175102,0.00015799423,0.000092418115,1.0801423e-7,0.00015761326,0.028571136],"genre_scores_gemma":[0.99133176,0.00014168773,0.007512669,0.00077941944,0.000019013118,4.6521566e-7,4.583421e-7,0.0000020829657,0.00021244997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939394,0.000039031707,0.00012517521,0.00015200986,0.00010448155,0.00018537333],"domain_scores_gemma":[0.99947655,0.00012544631,0.000021208809,0.00030708537,0.000016731663,0.00005296585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055250386,0.000059197973,0.000068180176,0.00011313874,0.00035340217,0.000029997993,0.0007137927,0.000026350986,0.000018169661],"category_scores_gemma":[0.000021434213,0.00005697611,0.00002459493,0.00043404015,0.000016827902,0.00027523932,0.0015077776,0.00011478151,0.000016076887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012015828,0.00018603756,0.019529922,0.000004845809,0.000011716853,0.000046814108,0.025670975,0.0007698839,0.0011054296,0.35922772,0.001372935,0.5920617],"study_design_scores_gemma":[0.0018799718,0.00008771254,0.3306425,0.000073548166,0.0000023934292,0.000017459417,0.0008530955,0.6225432,0.004768791,0.004015748,0.034377996,0.0007375472],"about_ca_topic_score_codex":0.000011358374,"about_ca_topic_score_gemma":0.0005318317,"teacher_disagreement_score":0.95626444,"about_ca_system_score_codex":0.000041605243,"about_ca_system_score_gemma":0.000009497347,"threshold_uncertainty_score":0.27181193},"labels":[],"label_agreement":null},{"id":"W2166576467","doi":"10.1109/infcom.2009.5062138","title":"XOR-Assisted Cooperative Diversity in OFDMA Wireless Networks: Optimization Framework and Approximation Algorithms","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cooperative diversity; Computer science; Relay; Linear network coding; Wireless network; Computer network; Wireless; Diversity gain; Throughput; Coding (social sciences); Channel (broadcasting); Optimization problem; Algorithm; Distributed computing; Fading; Power (physics); Telecommunications; Mathematics","score_opus":0.03656900421626564,"score_gpt":0.271443026376122,"score_spread":0.23487402215985637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166576467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007801658,0.00039445233,0.9877995,0.002610323,0.00007822031,0.0002239651,3.791455e-7,0.00013092379,0.00096056366],"genre_scores_gemma":[0.87122655,0.0016855202,0.12602766,0.0009431285,0.000028863415,0.000009011297,0.000007157887,0.0000033728488,0.00006872259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989783,0.00019140326,0.00020599322,0.0003033934,0.00014170367,0.00017917996],"domain_scores_gemma":[0.99925476,0.00012435851,0.00007227645,0.00033428596,0.00014698271,0.000067353714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028439387,0.0001295984,0.00016396039,0.00010596996,0.00039804043,0.00019288213,0.0004683435,0.00009282644,0.000025701536],"category_scores_gemma":[0.00003520998,0.000121893034,0.000021225895,0.00086219836,0.00003834904,0.00067935867,0.0004979231,0.00021244642,0.0000015629158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014811737,0.0002109387,0.0026451657,0.000004038208,0.000014229329,0.000004039302,0.002701601,0.19270915,0.000048292888,0.19126771,0.00026838208,0.61011165],"study_design_scores_gemma":[0.0002978643,0.000046907116,0.017634768,0.000054833792,0.0000026245993,0.0000021474668,0.00004821827,0.98107255,0.000049663096,0.0006039557,0.000030848107,0.00015563382],"about_ca_topic_score_codex":0.000009280577,"about_ca_topic_score_gemma":0.000027659533,"teacher_disagreement_score":0.8634249,"about_ca_system_score_codex":0.00005921506,"about_ca_system_score_gemma":0.000020695757,"threshold_uncertainty_score":0.49706537},"labels":[],"label_agreement":null},{"id":"W2166719680","doi":"10.1002/wcm.1246","title":"On the performance of multi‐hop wireless relay networks","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Relay; Computer science; Space–time block code; Pairwise error probability; Bit error rate; Hop (telecommunications); Computer network; Linear network coding; Cooperative diversity; Wireless; Wireless network; Relay channel; Channel state information; Diversity gain; Antenna diversity; Channel (broadcasting); Telecommunications; MIMO; Power (physics)","score_opus":0.05662418136240808,"score_gpt":0.2754837161663732,"score_spread":0.2188595348039651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166719680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8157843,0.0021819363,0.17927626,0.0002797882,0.00010879073,0.0003853199,9.054152e-7,0.00012594348,0.0018567945],"genre_scores_gemma":[0.9813327,0.006122348,0.012173879,0.00024159983,0.000013499068,0.000055961205,0.0000033857748,0.000013074114,0.00004350523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985931,0.00038587983,0.0004103417,0.0002505575,0.00012683588,0.00023331934],"domain_scores_gemma":[0.99590266,0.00079909473,0.00025344134,0.0027777452,0.00020227679,0.000064779335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007527663,0.00016789977,0.00021548766,0.00007898469,0.0009468908,0.00006816218,0.0028494278,0.00006241878,0.000009644259],"category_scores_gemma":[0.000019555704,0.00012904918,0.000059021182,0.00050051045,0.00031920988,0.0001705271,0.0020525162,0.00042826554,0.0000057965585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090142985,0.000360692,0.0024912818,0.000017676246,0.000044660293,5.1051046e-7,0.007906132,0.0024474678,0.0005232233,0.3325439,0.0001090557,0.6535464],"study_design_scores_gemma":[0.00020561239,0.00011420572,0.0028171216,0.00016402699,0.000005509466,0.000005339086,0.00016229751,0.99515295,0.00046870435,0.000031205433,0.000715821,0.00015723416],"about_ca_topic_score_codex":0.000017013632,"about_ca_topic_score_gemma":0.000016762973,"teacher_disagreement_score":0.99270546,"about_ca_system_score_codex":0.000022627546,"about_ca_system_score_gemma":0.000034301207,"threshold_uncertainty_score":0.72828144},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.034647051076152055,"score_gpt":0.25618566852892566,"score_spread":0.2215386174527736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166757187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18336202,0.00007767109,0.80017054,0.013228483,0.00019985526,0.00048352024,0.0000044933013,0.000121282465,0.0023521371],"genre_scores_gemma":[0.99308693,0.0009227099,0.0048472397,0.00058139814,0.000014296771,0.0001009937,0.0000017326566,0.000010257931,0.00043441684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880606,0.00037684033,0.00019928324,0.00020266273,0.00023637246,0.00017878128],"domain_scores_gemma":[0.9956089,0.0011088297,0.00013023663,0.0027285432,0.00037217338,0.00005129058],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005133623,0.00016070715,0.00013067087,0.000085398045,0.0037320391,0.00009521621,0.003088156,0.000068989706,0.00007463556],"category_scores_gemma":[0.000011529489,0.00009659596,0.000069961075,0.0010610445,0.00046773563,0.00029450035,0.00007514474,0.0013044262,0.000029156012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018454633,0.0026473906,0.00070757663,0.000012970086,0.00043789143,4.8132176e-7,0.0068897577,0.5772837,0.008646047,0.33121067,0.003315056,0.068663925],"study_design_scores_gemma":[0.00033178885,0.00040528874,0.0006042416,0.00005344386,0.000029494086,0.00000910662,0.000111977475,0.98893607,0.0058232746,0.000023130355,0.0034741622,0.0001980453],"about_ca_topic_score_codex":0.000024741317,"about_ca_topic_score_gemma":0.0012055164,"teacher_disagreement_score":0.8097249,"about_ca_system_score_codex":0.000038643433,"about_ca_system_score_gemma":0.000087686814,"threshold_uncertainty_score":0.997565},"labels":[],"label_agreement":null},{"id":"W2166830713","doi":"10.1109/tmm.2010.2095833","title":"Layered Multicast With Inter-Layer Network Coding for Multimedia Streaming","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Linear network coding; Pragmatic General Multicast; Xcast; Protocol Independent Multicast; Multicast address; Distributed computing; Distance Vector Multicast Routing Protocol; IP multicast; Reliable multicast","score_opus":0.03783306449584478,"score_gpt":0.28836830745662956,"score_spread":0.2505352429607848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166830713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011473528,0.000023615132,0.984964,0.00053679995,0.0017311093,0.00067343184,0.000017489365,0.0003536184,0.00022640509],"genre_scores_gemma":[0.7177279,0.000044938115,0.28135568,0.00021157697,0.00017481013,0.00019862251,0.0000046188234,0.000030649237,0.00025119365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820083,0.00009374587,0.00036875557,0.000555345,0.00024299874,0.00053830544],"domain_scores_gemma":[0.9972348,0.0011320503,0.00012664642,0.0009947744,0.0002626381,0.0002490889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036816226,0.00031470577,0.00029707915,0.00016680668,0.00062660093,0.00019811041,0.0009359759,0.00014389529,0.00010617347],"category_scores_gemma":[0.000038608294,0.00027476778,0.00013425002,0.00048859575,0.00013562937,0.0004599591,0.000012815403,0.0007374169,0.0000726609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014082025,0.00037928027,0.0002515257,0.00002000185,0.00012614699,0.000008362612,0.0025559873,0.0134898275,0.030345324,0.00059324416,0.0006646599,0.95142484],"study_design_scores_gemma":[0.0018286405,0.00017541889,0.00041835004,0.0000934624,0.000026133457,0.000014520924,0.000052869917,0.97013247,0.023622192,0.000024764071,0.003204979,0.00040617154],"about_ca_topic_score_codex":0.000013395199,"about_ca_topic_score_gemma":0.0010702648,"teacher_disagreement_score":0.9566427,"about_ca_system_score_codex":0.000050215673,"about_ca_system_score_gemma":0.000085189866,"threshold_uncertainty_score":0.99997044},"labels":[],"label_agreement":null},{"id":"W2166837886","doi":"10.1109/icc.2008.486","title":"Cooperative Multicast Scheduling Scheme for IPTV Service over IEEE 802.16 Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Multicast; Computer science; Protocol Independent Multicast; Xcast; IP multicast; Source-specific multicast; Pragmatic General Multicast; IPTV; Multimedia Broadcast Multicast Service; Distance Vector Multicast Routing Protocol; Distributed computing","score_opus":0.07373425123205915,"score_gpt":0.30437721629071685,"score_spread":0.2306429650586577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166837886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022988157,0.00035198542,0.9709169,0.0019031031,0.000354225,0.00042136578,0.0000014010321,0.00026891034,0.002793927],"genre_scores_gemma":[0.8117217,0.00046258458,0.18068776,0.0055219266,0.00021554173,0.00008520428,0.000009991541,0.000019478497,0.0012758216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985617,0.00010628869,0.00031448924,0.00044491433,0.00017619361,0.00039644417],"domain_scores_gemma":[0.9979814,0.00035956083,0.000082107814,0.0008304475,0.0005989926,0.00014747708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028314727,0.00021739284,0.00023543135,0.00006969286,0.00077089603,0.00015224352,0.0010954151,0.000090816495,0.000113844246],"category_scores_gemma":[0.0000696333,0.0001938588,0.00008322865,0.0007286669,0.00006302112,0.00063170417,0.00038389274,0.0002485584,0.000063418825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002008597,0.0011721619,0.0037886444,0.00008687593,0.0004770076,0.000034735862,0.010712092,0.17761505,0.01831413,0.63229287,0.06585973,0.08944585],"study_design_scores_gemma":[0.000809863,0.00004802854,0.00034447215,0.00003148885,0.0000035567377,0.0000139666345,0.000036072608,0.98629105,0.0011594044,0.00003955554,0.010939297,0.00028323365],"about_ca_topic_score_codex":0.0000133956455,"about_ca_topic_score_gemma":0.00014726564,"teacher_disagreement_score":0.808676,"about_ca_system_score_codex":0.00007879866,"about_ca_system_score_gemma":0.000104769635,"threshold_uncertainty_score":0.79053324},"labels":[],"label_agreement":null},{"id":"W2166885742","doi":"10.1109/tvt.2009.2038784","title":"Unified Exact Performance Analysis of Two-Hop Amplify-and-Forward Relaying in Nakagami Fading","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Fading; Cumulative distribution function; Relay; Moment-generating function; Probability density function; Topology (electrical circuits); Channel (broadcasting); Computer science; Signal-to-noise ratio (imaging); Algorithm; Hop (telecommunications); Noise power; Mathematics; Electronic engineering; Statistics; Power (physics); Telecommunications; Engineering; Physics; Combinatorics","score_opus":0.021017461362297693,"score_gpt":0.27229056478371416,"score_spread":0.25127310342141645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166885742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44811344,0.00015432065,0.55055165,0.0007691864,0.000037851765,0.00008560638,7.634514e-7,0.00013521078,0.0001519556],"genre_scores_gemma":[0.9928484,0.0010214524,0.0059206607,0.00015516591,0.0000027968129,0.000015882766,0.0000011964473,0.0000056103263,0.000028839242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886334,0.000085024025,0.0003429,0.00033622893,0.00013810303,0.00023439643],"domain_scores_gemma":[0.99893546,0.00008361696,0.00009782556,0.0007693806,0.000073718955,0.000039975035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003021286,0.00014753533,0.00033257017,0.0017364378,0.00019017729,0.000028478922,0.00062697113,0.00015220646,0.000009626517],"category_scores_gemma":[0.000008498753,0.0001492521,0.00008900523,0.003951135,0.00008658648,0.00022322798,0.0000096816375,0.0004967362,0.0000044678404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022874923,0.00026568756,0.0013597436,0.000011354136,0.00031129742,0.000013268775,0.00083122903,0.24843301,0.034774195,0.02938945,0.0000047014673,0.6845832],"study_design_scores_gemma":[0.0007766246,0.0002552063,0.004886708,0.000086079985,0.00014019402,0.000016574995,0.0000863977,0.9511902,0.04138626,0.0005816272,0.000285202,0.0003089362],"about_ca_topic_score_codex":0.0000071677496,"about_ca_topic_score_gemma":0.000065680375,"teacher_disagreement_score":0.7027572,"about_ca_system_score_codex":0.00007074055,"about_ca_system_score_gemma":0.000025940326,"threshold_uncertainty_score":0.6086324},"labels":[],"label_agreement":null},{"id":"W2166972143","doi":"10.1109/tit.2010.2046213","title":"Relay Scheduling in the Half-Duplex Gaussian Parallel Relay Channel","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Emphasis (telecommunications); Relay; Computer science; Scheduling (production processes); Telecommunications; Computer network; Mathematics; Mathematical optimization; Physics","score_opus":0.019772793341809557,"score_gpt":0.2550017752339384,"score_spread":0.23522898189212885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166972143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068212585,0.00002469924,0.98199534,0.0031136703,0.0005789373,0.00026701533,0.0000015337504,0.00015035202,0.007047204],"genre_scores_gemma":[0.9882628,0.00014551074,0.009162456,0.002111703,0.000028741604,0.00011004918,0.0000039952897,0.0000060228326,0.00016872326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873656,0.00026965985,0.00039713958,0.0001347568,0.00024158656,0.0002202889],"domain_scores_gemma":[0.99853075,0.00034849104,0.0001165349,0.0008610145,0.00008508119,0.00005812083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014728501,0.0001451274,0.000110007575,0.00028449198,0.0005413549,0.00025526262,0.0010829963,0.00010157942,0.00009089645],"category_scores_gemma":[0.000028988012,0.00011082437,0.00007848798,0.0006504871,0.00007438905,0.0019217073,0.0000070809506,0.0008962714,0.00030471798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045257344,0.00013945314,0.0000040942646,0.000011288383,0.000020006844,0.0000014740733,0.02229509,0.28189018,0.0002215391,0.5404608,0.00024523388,0.15466553],"study_design_scores_gemma":[0.0011790112,0.00010200588,0.0005891281,0.00007325525,0.0000113518245,0.000054830973,0.0015770252,0.96855927,0.0016142542,0.0049447054,0.020840757,0.000454387],"about_ca_topic_score_codex":0.0000056872277,"about_ca_topic_score_gemma":0.00008137901,"teacher_disagreement_score":0.98144156,"about_ca_system_score_codex":0.000033749682,"about_ca_system_score_gemma":0.000060092178,"threshold_uncertainty_score":0.45192865},"labels":[],"label_agreement":null},{"id":"W2167040808","doi":"10.1109/tcomm.2009.09.070595","title":"Relay ordering in a multi-hop cooperative diversity network","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Hop (telecommunications); Expression (computer science); Algorithm; Computer science; Computational complexity theory; Signal-to-noise ratio (imaging); Bit error rate; Diversity combining; Outage probability; Cooperative diversity; Probability of error; Selection (genetic algorithm); Mathematics; Mathematical optimization; Telecommunications; Decoding methods; Fading; Artificial intelligence","score_opus":0.0871327742830498,"score_gpt":0.3105994923613186,"score_spread":0.22346671807826882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167040808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016477256,0.000545882,0.98750544,0.006701718,0.00017881849,0.0003259251,0.0000033309198,0.00026992025,0.002821271],"genre_scores_gemma":[0.9377321,0.0032561356,0.057492845,0.0010617257,0.0000103830525,0.000046479858,0.0000032645285,0.000008047878,0.00038900634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840844,0.0004698905,0.00033503026,0.0003146538,0.00016507087,0.00030694465],"domain_scores_gemma":[0.99669176,0.00034168139,0.00007851661,0.00261752,0.00016993021,0.000100587546],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00040281797,0.0001864045,0.00020738815,0.0001986654,0.0018235532,0.000118688964,0.0027792712,0.0000828824,0.000029768782],"category_scores_gemma":[0.000015782305,0.00020273941,0.00008888786,0.0015097484,0.00010004475,0.0005625175,0.000092906834,0.0007248698,0.000057727702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055097807,0.0034063663,0.00047163074,0.0000068230715,0.000109895445,0.000011510328,0.015725737,0.52936083,0.0012534331,0.082124375,0.0013716443,0.36610267],"study_design_scores_gemma":[0.0017413633,0.0002446513,0.0073689413,0.00019456791,0.000020636124,0.000013119457,0.00019979579,0.9797278,0.00071705104,0.0008094799,0.008287709,0.00067485264],"about_ca_topic_score_codex":0.000031421416,"about_ca_topic_score_gemma":0.0016216149,"teacher_disagreement_score":0.9360844,"about_ca_system_score_codex":0.00016369126,"about_ca_system_score_gemma":0.00007326561,"threshold_uncertainty_score":0.99947596},"labels":[],"label_agreement":null},{"id":"W2167192348","doi":"10.1109/icc.2008.899","title":"Optimum Power Distribution for Uplink Channel in a Cooperative Wireless CDMA Network","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer network; Telecommunications link; Computer science; Base station; Relay; Network packet; Transmission (telecommunications); Wireless; Transmitter power output; RSS; Channel (broadcasting); Interference (communication); Power (physics); Telecommunications; Transmitter","score_opus":0.041418873049236166,"score_gpt":0.2747868274382747,"score_spread":0.23336795438903854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167192348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010732891,0.00026405504,0.98371774,0.00252834,0.00022455875,0.00041640052,0.0000029761238,0.00012042378,0.0019925884],"genre_scores_gemma":[0.9892095,0.00046942977,0.0085276505,0.0008834524,0.00006684508,0.00012501012,0.000038640217,0.000007783039,0.00067173445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892443,0.000092129005,0.00025190576,0.00030422874,0.00009980773,0.00032747508],"domain_scores_gemma":[0.9990065,0.000184023,0.00005389593,0.00046427065,0.00022011131,0.000071195886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031411173,0.00013714179,0.0001855306,0.000038286194,0.00038596807,0.0000642442,0.0006406793,0.000061662264,0.00002537091],"category_scores_gemma":[0.000038378297,0.00012337025,0.000054018776,0.0006606508,0.000056647925,0.00034495696,0.00028431814,0.00014529662,0.000020612471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007897209,0.0003848889,0.0009616518,0.0000077461,0.000041610372,0.000018927714,0.003590617,0.025959367,0.00029391635,0.8691852,0.07799309,0.021484012],"study_design_scores_gemma":[0.0008676595,0.00013449142,0.0027851479,0.00003778372,0.0000014611908,0.000013384199,0.000032286836,0.9806127,0.00042375867,0.00058407884,0.014225334,0.0002819033],"about_ca_topic_score_codex":0.00000358782,"about_ca_topic_score_gemma":0.000038503364,"teacher_disagreement_score":0.9784766,"about_ca_system_score_codex":0.000077934026,"about_ca_system_score_gemma":0.00008093017,"threshold_uncertainty_score":0.50308925},"labels":[],"label_agreement":null},{"id":"W2167352949","doi":"10.1109/ccece.2011.6030670","title":"Delay optimization of wireless networks with network coding","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Linear network coding; Computer science; Computer network; Wireless network; Queuing delay; Network packet; Network delay; Queueing theory; End-to-end delay; Network traffic control; Network performance; Wireless ad hoc network; Processing delay; Wireless WAN; Wireless; Distributed computing; Transmission delay; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.039760607687769074,"score_gpt":0.23493966902773591,"score_spread":0.19517906133996685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167352949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093247177,0.00016063888,0.9738599,0.000054406464,0.000083287305,0.000096970376,6.151376e-8,0.00010980119,0.024702482],"genre_scores_gemma":[0.7366033,0.00036653064,0.2627365,0.00015382099,0.0000256588,0.0000061483343,0.0000013901246,0.000005853801,0.00010080535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992663,0.000084511856,0.00019422006,0.00017103642,0.00010382888,0.00018006604],"domain_scores_gemma":[0.9990897,0.000060591265,0.000108110595,0.0005233516,0.00016594598,0.000052279338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023727141,0.00009240099,0.0001309816,0.000037664366,0.00012953335,0.00003350138,0.00065487996,0.0000361446,0.00010107512],"category_scores_gemma":[0.000004382229,0.00007212924,0.000024738723,0.00058647577,0.000047037232,0.00029385037,0.00023065873,0.000091735215,0.000002462199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016376447,0.00004619087,0.0027594962,0.0000032353375,0.000026225014,0.0000023816312,0.00064635876,0.63021773,0.0000129065165,0.34141186,0.00055966974,0.02429756],"study_design_scores_gemma":[0.00016781651,0.00006577086,0.0007231254,0.00004081997,0.0000040774,0.0000056031968,0.000012905904,0.99848026,0.00018342138,0.000064706604,0.00014058835,0.00011092851],"about_ca_topic_score_codex":0.000006509824,"about_ca_topic_score_gemma":0.00003342336,"teacher_disagreement_score":0.7356708,"about_ca_system_score_codex":0.000012598701,"about_ca_system_score_gemma":0.000027012356,"threshold_uncertainty_score":0.2941345},"labels":[],"label_agreement":null},{"id":"W2167427632","doi":"10.1109/icc.2013.6655497","title":"Opportunistic relaying for cognitive network with multiple primary users over Nakagami-m fading","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Fading; Relay; Computer science; Transmitter; Cognitive radio; Computer network; Transmitter power output; Interference (communication); Coding (social sciences); Linear network coding; Topology (electrical circuits); Power (physics); Telecommunications; Mathematics; Statistics; Wireless; Channel (broadcasting); Combinatorics; Physics","score_opus":0.04619641086660233,"score_gpt":0.26472278850312086,"score_spread":0.21852637763651853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167427632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014097365,0.00013770787,0.9709634,0.00052377,0.00012928263,0.0007620987,0.0000015867205,0.00022964978,0.013155117],"genre_scores_gemma":[0.90863675,0.00009117818,0.08699443,0.0025605548,0.000075125754,0.00020596349,0.000021119915,0.000017793081,0.0013970608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988621,0.00007656725,0.00021339717,0.00033591132,0.000151392,0.0003606467],"domain_scores_gemma":[0.9981075,0.00096642354,0.000099401266,0.0004353747,0.00026072987,0.0001305933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025140712,0.00016008198,0.00017828555,0.000052784217,0.00044369476,0.00026506718,0.00055574666,0.00004308385,0.00009102601],"category_scores_gemma":[0.00008688856,0.00012869132,0.000050263876,0.00033549347,0.000056732588,0.0007162637,0.00031601198,0.0001399819,0.00003744661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001416521,0.0002946305,0.065151386,0.00010888508,0.0003978618,0.000020029185,0.003366029,0.0031913582,0.0027851027,0.2987732,0.058669515,0.56710035],"study_design_scores_gemma":[0.00249331,0.00028442728,0.042406652,0.0003579923,0.000032071603,0.000016119151,0.00022901308,0.9397956,0.00016130348,0.0013039153,0.012131629,0.0007879734],"about_ca_topic_score_codex":0.00001168805,"about_ca_topic_score_gemma":0.000033724078,"teacher_disagreement_score":0.93660426,"about_ca_system_score_codex":0.000057703546,"about_ca_system_score_gemma":0.00008218852,"threshold_uncertainty_score":0.52478796},"labels":[],"label_agreement":null},{"id":"W2167638421","doi":"10.1109/itwnit.2009.5158587","title":"Universal weakly secure network coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Secure coding; Coding (social sciences); Theoretical computer science; Scheme (mathematics); Field size; Network security; Computer security; Computer network; Information security; Mathematics; Software security assurance; Security service; Engineering","score_opus":0.023272498460599065,"score_gpt":0.2556688295352266,"score_spread":0.23239633107462757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167638421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008102516,0.00035804333,0.83518213,0.007987323,0.00018606415,0.00007409468,9.366043e-8,0.00035773218,0.15504429],"genre_scores_gemma":[0.95873964,0.00034298454,0.036070645,0.002901919,0.00010923492,7.4901294e-7,0.0000011571238,0.0000025469187,0.0018311396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993515,0.00006683429,0.00010490182,0.00017281003,0.00010102919,0.00020292834],"domain_scores_gemma":[0.9993109,0.00005175257,0.000031207597,0.00047885053,0.000059422146,0.00006786297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017122627,0.00007966102,0.00008370471,0.00003341699,0.00023382442,0.00012446391,0.00081939076,0.000030063633,0.00008663581],"category_scores_gemma":[0.00000962464,0.000072576986,0.00003522255,0.00046571455,0.000014192604,0.000338283,0.00018058032,0.00012283362,0.00006219087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011235553,0.000011465973,0.00005037501,2.8151237e-7,0.0000029925252,0.000002702393,0.0001901075,0.00036180665,0.00024139174,0.9107611,0.020705318,0.0676713],"study_design_scores_gemma":[0.00060749904,0.0002120683,0.008966682,0.00006959346,0.0000065236104,0.000023596964,0.00007521775,0.57818323,0.00068144285,0.017471543,0.39309475,0.00060787355],"about_ca_topic_score_codex":8.774622e-7,"about_ca_topic_score_gemma":0.000011101073,"teacher_disagreement_score":0.9579294,"about_ca_system_score_codex":0.000029822504,"about_ca_system_score_gemma":0.000029833973,"threshold_uncertainty_score":0.29596037},"labels":[],"label_agreement":null},{"id":"W2167639215","doi":"10.1109/tsp.2008.2011829","title":"Large-System-Based Performance Analysis and Design of Multiuser Cooperative Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Computer science; Interference (communication); Signal-to-noise ratio (imaging); Noise (video); Channel (broadcasting); Code division multiple access; Computer network; Signal-to-interference-plus-noise ratio; Noise power; Relay channel; Channel state information; Multiuser detection; Power (physics); Telecommunications; Wireless; Artificial intelligence","score_opus":0.030638733691734713,"score_gpt":0.2673074275788639,"score_spread":0.2366686938871292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167639215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004893234,0.00031121806,0.99429005,0.00011279176,0.000028979419,0.00016533877,0.0000014080446,0.00011258311,0.0000843736],"genre_scores_gemma":[0.97925425,0.000086335305,0.020389087,0.00020795634,0.000011148952,0.00001483733,9.72685e-7,0.00000602662,0.000029380793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988276,0.00019571856,0.00029439531,0.00028895916,0.00018730822,0.0002060514],"domain_scores_gemma":[0.9991202,0.00013903104,0.0001224666,0.00028903797,0.0002560639,0.00007321635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041571172,0.0001578703,0.0002581114,0.00028800793,0.00053795276,0.00012755579,0.00033748805,0.0000609229,0.000012432265],"category_scores_gemma":[0.0000017999183,0.00014208083,0.000067961664,0.0016175315,0.000049274135,0.0004565394,0.0000026296107,0.00022156748,0.000001704742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000347789,0.00010701615,0.00002628944,0.000013769862,0.00004322191,8.769709e-7,0.00043560626,0.83960515,0.0012761289,0.0000952895,0.0000034584373,0.15835841],"study_design_scores_gemma":[0.00041461052,0.0001804965,0.00036391287,0.00011877169,0.000072286595,0.0000018173378,0.000042696553,0.981191,0.017448582,0.0000026486782,0.000012766447,0.00015042257],"about_ca_topic_score_codex":0.0000010093988,"about_ca_topic_score_gemma":0.0000056672675,"teacher_disagreement_score":0.974361,"about_ca_system_score_codex":0.000042102558,"about_ca_system_score_gemma":0.00008019404,"threshold_uncertainty_score":0.5793888},"labels":[],"label_agreement":null},{"id":"W2167643388","doi":"10.1109/vetec.1988.195337","title":"Performance analyses of a packetized data communication system on mobile radio channels","year":2003,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Retransmission; Computer science; Throughput; Network packet; Signal-to-noise ratio (imaging); Packet radio; Computer network; Keying; Transmission (telecommunications); Data transmission; Real-time computing; Telecommunications; Wireless","score_opus":0.1563625835198276,"score_gpt":0.35398545788726754,"score_spread":0.19762287436743994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167643388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27089974,0.005806019,0.5863481,0.00065418525,0.0005404821,0.0012908354,0.000010253498,0.00072624465,0.13372412],"genre_scores_gemma":[0.98000515,0.0013589306,0.018269911,0.00006384442,0.0000074469845,0.000023838335,0.00001561967,0.0000047684825,0.00025050505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987916,0.00042177783,0.00027052892,0.00022703114,0.00016632974,0.00012274343],"domain_scores_gemma":[0.99593663,0.00019877277,0.00012677565,0.003566289,0.0001286963,0.000042824915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079115655,0.000095236006,0.00018266258,0.00008946148,0.00014459515,0.00006157183,0.0022950843,0.000028418544,0.00003103462],"category_scores_gemma":[0.000051025243,0.00007759872,0.000029511768,0.000527294,0.000041834846,0.00039238652,0.0004906889,0.00009641865,0.00003056468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047301608,0.0006653193,0.0012295945,0.00019631059,0.00022845926,0.0000019941879,0.003698702,0.013639992,0.010351949,0.81963915,0.008690792,0.14161046],"study_design_scores_gemma":[0.00051171915,0.00011545817,0.0002838184,0.00016958526,0.000010524745,0.000007619556,0.00017530032,0.9667555,0.020472033,0.00002371912,0.011298343,0.0001763643],"about_ca_topic_score_codex":0.000004809687,"about_ca_topic_score_gemma":0.0000039764977,"teacher_disagreement_score":0.9531155,"about_ca_system_score_codex":0.00003467358,"about_ca_system_score_gemma":0.000043551987,"threshold_uncertainty_score":0.4264876},"labels":[],"label_agreement":null},{"id":"W2167659531","doi":"10.1049/iet-com.2013.0466","title":"Probabilistic relay assignment strategy for cooperation networks with random relays","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Relay; Computer science; Probabilistic logic; Computer network; Relay channel; Telecommunications; Artificial intelligence","score_opus":0.053079198073174655,"score_gpt":0.29242900875895705,"score_spread":0.2393498106857824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167659531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015763892,0.00065136474,0.98485416,0.005661045,0.00010301382,0.0011677548,0.0000024084588,0.00022052549,0.0071820607],"genre_scores_gemma":[0.90782344,0.0008199268,0.08911728,0.00051848067,0.00006905359,0.0011327749,0.00010017197,0.000019866653,0.00039898988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833024,0.0005819119,0.00036974938,0.00031135342,0.00014844973,0.00025829804],"domain_scores_gemma":[0.9944483,0.0011849869,0.0001643235,0.0034601912,0.00064077,0.000101411824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095906644,0.0001768175,0.00021679646,0.0000641044,0.0009770861,0.00030315682,0.0023538687,0.000074122,0.000012925612],"category_scores_gemma":[0.00028690472,0.00014965373,0.000060774302,0.0004651941,0.00015386344,0.00037866077,0.00047960083,0.00028927167,0.000015584837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003372136,0.00018979634,0.00006208905,0.000008314332,0.000040446685,1.0939225e-7,0.00036572214,0.17319357,0.000075953954,0.7744025,0.004081396,0.047546394],"study_design_scores_gemma":[0.0012842261,0.0002287175,0.00022853928,0.00005283193,0.000019833353,0.0000033310137,0.00001847913,0.9131103,0.000027875963,0.0015042549,0.08330401,0.00021760628],"about_ca_topic_score_codex":0.0000045233564,"about_ca_topic_score_gemma":0.00024960216,"teacher_disagreement_score":0.9076658,"about_ca_system_score_codex":0.00008283756,"about_ca_system_score_gemma":0.0000996043,"threshold_uncertainty_score":0.75150555},"labels":[],"label_agreement":null},{"id":"W2167712468","doi":"10.1109/iwcmc.2011.5982604","title":"Multiple-frame precoding scheme for BICM over AF relay channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Relay; Computer science; Algorithm; Topology (electrical circuits); Mathematics; Channel (broadcasting); Telecommunications; MIMO; Power (physics); Combinatorics; Physics","score_opus":0.11564136571598765,"score_gpt":0.2965625844425538,"score_spread":0.18092121872656614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167712468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01051008,0.00021900937,0.97460127,0.0004840526,0.0004708505,0.00034391132,8.793542e-7,0.00029102922,0.013078938],"genre_scores_gemma":[0.7376578,0.000116903975,0.258842,0.0006522867,0.000066888184,0.00007284106,0.0000019290364,0.000010159805,0.0025792273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990926,0.00005052215,0.00020310712,0.00029599757,0.00009901935,0.00025877668],"domain_scores_gemma":[0.99872535,0.00022559351,0.00008672118,0.0007559141,0.00012156597,0.00008482606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003260805,0.00012123045,0.00012650836,0.00007979298,0.00022060516,0.00010328913,0.0010226134,0.00005706232,0.00021078586],"category_scores_gemma":[0.0001758157,0.00010588509,0.00007526698,0.00026091433,0.0000270423,0.0004807162,0.00048511237,0.000117790965,0.00006252189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045228302,0.00029488956,0.006874909,0.000030268611,0.00008847652,0.0000021066608,0.009465243,0.00007763559,0.012383263,0.7944142,0.017870702,0.15845305],"study_design_scores_gemma":[0.0009932646,0.00012295452,0.0022833315,0.00005501242,0.000004609385,0.000004196414,0.000042313102,0.89755905,0.016703304,0.0018849425,0.07992384,0.0004231586],"about_ca_topic_score_codex":0.000007687102,"about_ca_topic_score_gemma":0.000024854102,"teacher_disagreement_score":0.89748144,"about_ca_system_score_codex":0.000028259938,"about_ca_system_score_gemma":0.000026708341,"threshold_uncertainty_score":0.43178686},"labels":[],"label_agreement":null},{"id":"W2167721244","doi":"10.1109/twc.2012.12.120364","title":"Lifetime Analysis of a Two-Hop Amplify-and-Forward Opportunistic Wireless Relay Network","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Transmitter power output; Computer science; Wireless; Relay channel; Markov chain; Computer network; Wireless network; Energy (signal processing); Hop (telecommunications); Expression (computer science); Power (physics); Telecommunications; Topology (electrical circuits); Mathematics; Electrical engineering; Statistics; Engineering; Physics; Channel (broadcasting); Transmitter","score_opus":0.04432216400186197,"score_gpt":0.29427812418413396,"score_spread":0.24995596018227198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167721244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016672261,0.00038817036,0.97748375,0.0030454167,0.00014923533,0.00047092256,0.000030759747,0.00025265204,0.0015068281],"genre_scores_gemma":[0.9712117,0.0055117714,0.02201506,0.0004942932,0.000016184847,0.00031645448,0.00003442862,0.000025177224,0.00037493402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974481,0.0006427006,0.0007726399,0.00044291443,0.00031173712,0.0003819392],"domain_scores_gemma":[0.9933001,0.001249554,0.00031805283,0.004464792,0.00040966578,0.00025784696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005109513,0.00029088903,0.0005869025,0.0005484425,0.0010023006,0.00020373438,0.0028600555,0.00012562014,0.0001721688],"category_scores_gemma":[0.000010966084,0.00029615787,0.0002557716,0.0030320988,0.00040474278,0.0005138287,0.000100497455,0.0006454482,0.000071078604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025665,0.001531877,0.00074013363,0.000039521354,0.0031957505,0.0000022958122,0.0037436055,0.1023426,0.005342258,0.32042527,0.0013683988,0.56124264],"study_design_scores_gemma":[0.000457124,0.00007771189,0.0013681691,0.00008631983,0.00045222897,0.000005537955,0.00008465352,0.99489164,0.0003045605,0.00050106033,0.0013731667,0.0003978487],"about_ca_topic_score_codex":0.00018361381,"about_ca_topic_score_gemma":0.0006050661,"teacher_disagreement_score":0.9554687,"about_ca_system_score_codex":0.00007959651,"about_ca_system_score_gemma":0.000119952165,"threshold_uncertainty_score":0.99994904},"labels":[],"label_agreement":null},{"id":"W2168166719","doi":"10.1109/bsc.2006.1644573","title":"Cooperative Networks with Multiuser Diversity","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cooperative diversity; Computer science; Diversity (politics); Diversity scheme; Protocol (science); Scheme (mathematics); Expression (computer science); Power (physics); Diversity combining; Order (exchange); Diversity gain; Algorithm; Telecommunications; Mathematics; Wireless network; Fading; Wireless; Decoding methods","score_opus":0.020884197535734228,"score_gpt":0.22637560072213214,"score_spread":0.20549140318639791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168166719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072847633,0.00012946043,0.9602372,0.0006973401,0.000048550253,0.000096962416,1.6386237e-7,0.00019144063,0.031314123],"genre_scores_gemma":[0.9751896,0.000048329293,0.021602329,0.0005826638,0.000037207883,0.0000046042123,0.0000025685845,0.0000033590743,0.002529325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993917,0.00006795406,0.00008364426,0.00019281308,0.00011135064,0.00015253869],"domain_scores_gemma":[0.99930847,0.000059299455,0.000028321752,0.0004192267,0.00014604378,0.000038666298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010090292,0.000088117136,0.0000828198,0.000030490393,0.00051261927,0.00010804232,0.00063008437,0.000024275778,0.000061909486],"category_scores_gemma":[0.0000034248594,0.000063578715,0.000019199282,0.00036053598,0.000045583853,0.0003413186,0.0008762099,0.000101426675,0.000027414875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019177372,0.0002000568,0.03390279,0.0000017772921,0.000034130222,0.000018903867,0.00062491774,0.088127136,0.00012969055,0.83171207,0.022611307,0.022618044],"study_design_scores_gemma":[0.00080223125,0.00009072563,0.04087057,0.0000148143135,0.0000047188882,0.0000079984575,0.000030378349,0.9440033,0.00043990015,0.00016279204,0.013244495,0.00032809842],"about_ca_topic_score_codex":0.000053799893,"about_ca_topic_score_gemma":0.00063886185,"teacher_disagreement_score":0.96790487,"about_ca_system_score_codex":0.000024721836,"about_ca_system_score_gemma":0.000016985538,"threshold_uncertainty_score":0.39427045},"labels":[],"label_agreement":null},{"id":"W2168193419","doi":"10.1109/ciss.2007.4298315","title":"A New Decentralized Power Allocation Strategy in Single-Hop Wireless Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hop (telecommunications); Rayleigh fading; Power control; Wireless; Wireless network; Channel (broadcasting); Power (physics); Computer network; Fading; Telecommunications","score_opus":0.0376862628831546,"score_gpt":0.2870585338618771,"score_spread":0.24937227097872247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168193419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01970349,0.00046407618,0.9637089,0.00082205154,0.00014369802,0.00014157835,3.0309906e-8,0.00013697855,0.014879191],"genre_scores_gemma":[0.9843384,0.00031540226,0.014035819,0.0006477474,0.000029158302,0.0000024773515,0.0000026407083,0.000006730156,0.00062160933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988976,0.00008403859,0.00030074036,0.00024453894,0.00014148673,0.0003315738],"domain_scores_gemma":[0.99909115,0.00012672567,0.000058925794,0.00051257253,0.00007923923,0.00013140088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051294226,0.00011453592,0.00012352885,0.00010442497,0.000072034214,0.00016150453,0.00071757915,0.0000672215,0.00013366611],"category_scores_gemma":[0.000015968875,0.00010871174,0.000032759588,0.0008302227,0.000017199503,0.0003724548,0.00017547216,0.00016282959,0.000021169126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016423679,0.00009912019,0.0008984301,0.0000010541089,0.0000069695416,0.0000069599914,0.0005082442,0.0020780135,0.002187391,0.29939714,0.0021174154,0.69268286],"study_design_scores_gemma":[0.0027330786,0.00020850069,0.046301093,0.00011597847,0.0000049502987,0.000019570885,0.00024664475,0.92212117,0.005124772,0.0014983842,0.020797163,0.00082869],"about_ca_topic_score_codex":0.000042706346,"about_ca_topic_score_gemma":0.0015638669,"teacher_disagreement_score":0.96463495,"about_ca_system_score_codex":0.000090908456,"about_ca_system_score_gemma":0.000072214694,"threshold_uncertainty_score":0.44331363},"labels":[],"label_agreement":null},{"id":"W2168241011","doi":"10.1109/iscc.2006.46","title":"Capacity Enhancement in CDMA Cellular Networks using Multi-hop Communication","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cellular network; Telecommunications link; Computer science; Interference (communication); Base station; Computer network; Code division multiple access; Near-far problem; Hop (telecommunications); Spread spectrum; Electronic engineering; Engineering; Channel (broadcasting)","score_opus":0.06948685118996231,"score_gpt":0.28169905492759245,"score_spread":0.21221220373763014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168241011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08272345,0.0010386932,0.9124216,0.0004365741,0.00007812977,0.00016301475,1.0907939e-7,0.00007836986,0.003060045],"genre_scores_gemma":[0.8443147,0.00024577786,0.15492098,0.00021180836,0.000021515021,0.000011975673,0.000005471598,0.000005121866,0.00026264833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988474,0.0002702082,0.00031058252,0.00022293099,0.00012127557,0.00022756154],"domain_scores_gemma":[0.9987005,0.00007638092,0.00008405352,0.0010122145,0.00009165564,0.000035186014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048268453,0.000115456765,0.00012965272,0.00008512999,0.0002196346,0.00012416854,0.0009474503,0.000051722145,0.000044347235],"category_scores_gemma":[0.000010227631,0.00011489021,0.000035373054,0.0005152427,0.000046744997,0.00034919687,0.00049002556,0.00019844229,0.000014071417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013708826,0.0017487423,0.023307674,0.000021313572,0.00003403996,0.000010077409,0.0024646362,0.16419806,0.10819301,0.59466493,0.0018609257,0.103482895],"study_design_scores_gemma":[0.00031886442,0.000007945757,0.0030877832,0.00003069588,0.0000013620195,9.90155e-7,0.000011644589,0.98929685,0.005228997,0.00026443184,0.0016002422,0.00015018757],"about_ca_topic_score_codex":0.00032994163,"about_ca_topic_score_gemma":0.0012448147,"teacher_disagreement_score":0.8250988,"about_ca_system_score_codex":0.0001332236,"about_ca_system_score_gemma":0.000023154249,"threshold_uncertainty_score":0.46850866},"labels":[],"label_agreement":null},{"id":"W2168429764","doi":"10.1109/tvt.2009.2013631","title":"Power Allocation and Error Performance of Distributed Unitary Space–Time Modulation in Wireless Relay Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Fading; Computer science; Channel state information; Wireless; Wireless network; Electronic engineering; Modulation (music); Signal-to-noise ratio (imaging); Transmitter power output; Channel (broadcasting); Relay channel; Computer network; Power (physics); Topology (electrical circuits); Engineering; Telecommunications; Electrical engineering","score_opus":0.009674966551947769,"score_gpt":0.22713312615644668,"score_spread":0.2174581596044989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168429764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48199636,0.00008663662,0.5156618,0.0019901616,0.0000351432,0.000111079,8.935051e-7,0.00009801617,0.000019926008],"genre_scores_gemma":[0.99701315,0.00047193954,0.0023959726,0.00006812805,0.000003060512,0.000015347681,0.0000057783177,0.0000055887167,0.000021050211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991547,0.0000776518,0.00025120247,0.00024466662,0.000102189304,0.00016957389],"domain_scores_gemma":[0.9992139,0.00003875,0.000078660974,0.00053487334,0.0001033346,0.000030494048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018040805,0.00012249949,0.00017343914,0.0003730608,0.00013112664,0.000015304006,0.00035239264,0.00018657447,0.0000064958663],"category_scores_gemma":[0.0000045830216,0.0001274784,0.000029997884,0.0012206463,0.000085060776,0.000247827,0.000006430309,0.0003480009,0.0000040712175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054931417,0.00042125885,0.0005288551,0.000009363101,0.00003333973,0.000006580027,0.00028542776,0.69494545,0.031410262,0.014169129,0.000029250656,0.25810617],"study_design_scores_gemma":[0.00034559018,0.00024239297,0.0063661872,0.000065088694,0.0000047459275,0.00001231183,0.000014100005,0.98325276,0.009363339,0.00014058789,0.00006312728,0.00012975787],"about_ca_topic_score_codex":0.0000020540099,"about_ca_topic_score_gemma":0.000011690028,"teacher_disagreement_score":0.5150168,"about_ca_system_score_codex":0.00005837236,"about_ca_system_score_gemma":0.000022560245,"threshold_uncertainty_score":0.51984185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.01947587009554669,"score_gpt":0.2522520498328435,"score_spread":0.2327761797372968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168435726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030195832,0.0003069034,0.9635566,0.0052858004,0.000038779814,0.00028288955,0.0000030018184,0.0002745348,0.000055645596],"genre_scores_gemma":[0.9326169,0.0014479148,0.06541893,0.00039452125,0.0000035602784,0.000045845307,0.000005745412,0.0000042553197,0.00006235551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912477,0.00009054689,0.00019703004,0.0003179898,0.000104105966,0.00016553562],"domain_scores_gemma":[0.9987034,0.000065788845,0.00007366761,0.000844481,0.00026739843,0.000045237193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021795911,0.00014163293,0.00021608757,0.00055304,0.0010894489,0.00007016221,0.00078005524,0.00013831635,0.000012441873],"category_scores_gemma":[0.000008665055,0.00014227683,0.00009845752,0.0016984403,0.00011411443,0.0003323763,0.000029223102,0.00025541417,0.000002671382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028967987,0.0002732212,0.00018081494,0.000007971935,0.00040200193,0.0000017371322,0.00063434546,0.7098375,0.00052245,0.015472622,0.00004652583,0.27259186],"study_design_scores_gemma":[0.0004686461,0.00032354036,0.0004039232,0.000023082617,0.00012109889,0.000007413408,0.000036649806,0.98661524,0.011200828,0.0002471149,0.00036161067,0.00019087031],"about_ca_topic_score_codex":0.000001930799,"about_ca_topic_score_gemma":0.000023803681,"teacher_disagreement_score":0.90242106,"about_ca_system_score_codex":0.00005576125,"about_ca_system_score_gemma":0.000017350289,"threshold_uncertainty_score":0.8379271},"labels":[],"label_agreement":null},{"id":"W2168444669","doi":"10.1109/glocom.2010.5684175","title":"Optimal Precoder and Symbol Grouping for Bandwidth-Efficient Bit-Interleaved Coded Modulation over NAF Single-Relay Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Precoding; Relay; Computer science; Coding gain; Algorithm; Diversity gain; Phase-shift keying; Upper and lower bounds; Bit error rate; Mathematics; MIMO; Telecommunications; Decoding methods; Fading; Power (physics); Channel (broadcasting)","score_opus":0.03197275770847122,"score_gpt":0.27041031707486096,"score_spread":0.23843755936638975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168444669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34777495,0.000057555393,0.64995337,0.0005983409,0.00049153686,0.00034336007,9.946247e-7,0.00012307739,0.0006568076],"genre_scores_gemma":[0.93646294,0.000016229393,0.062588304,0.00028752495,0.000097667486,0.00005052968,0.000006670889,0.00001288888,0.00047724857],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888706,0.000057246398,0.00026235954,0.00039184102,0.00014086362,0.00026063086],"domain_scores_gemma":[0.9989076,0.00021636495,0.00008740465,0.0005197925,0.00016947009,0.000099320896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003905411,0.00015967373,0.00016548255,0.00010841352,0.00030876484,0.0003482777,0.00046207084,0.00008148253,0.000049464503],"category_scores_gemma":[0.00006782507,0.00014172545,0.000059611317,0.00020282167,0.0000517989,0.0003303962,0.00034135752,0.00017749864,0.000006437964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009998931,0.00064518966,0.0006505296,0.00006250873,0.00010919232,0.0000020509365,0.009838529,0.078912064,0.4307052,0.15019776,0.0023235148,0.32645348],"study_design_scores_gemma":[0.0006155115,0.0000808482,0.0009088964,0.000030248639,0.0000045132892,0.00000587863,0.000019708626,0.9899144,0.0067335423,0.00015352256,0.001331066,0.00020186797],"about_ca_topic_score_codex":0.000003640142,"about_ca_topic_score_gemma":0.000039886843,"teacher_disagreement_score":0.91100234,"about_ca_system_score_codex":0.000027508702,"about_ca_system_score_gemma":0.00002052772,"threshold_uncertainty_score":0.5779396},"labels":[],"label_agreement":null},{"id":"W2168470351","doi":"10.1186/1687-1499-2011-106","title":"Selection combining for noncoherent decode-and-forward relay networks","year":2011,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Keying; Power (physics); Selection (genetic algorithm); Bit error rate; Binary number; Algorithm; Scheme (mathematics); Expression (computer science); Computer network; Decoding methods; Telecommunications; Mathematics; Arithmetic; Artificial intelligence","score_opus":0.08582716851606358,"score_gpt":0.3002731078122381,"score_spread":0.2144459392961745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168470351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018537154,0.010023506,0.9651187,0.001675324,0.0006606722,0.0004288112,7.488154e-7,0.00016832637,0.0033867373],"genre_scores_gemma":[0.91563183,0.042317733,0.04121847,0.00052070105,0.00017846994,0.000051050665,0.000003915667,0.00002395718,0.00005386291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982604,0.00044374843,0.0005103304,0.00028364675,0.00014307063,0.00035882328],"domain_scores_gemma":[0.99762595,0.0006916566,0.00036660366,0.00089287676,0.00022066792,0.00020222987],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012281359,0.00022039555,0.00027625525,0.00016010305,0.002077142,0.0003784896,0.0013005913,0.000094885545,0.0000067041356],"category_scores_gemma":[0.000020712883,0.00020434949,0.00008941838,0.00041756622,0.00012002061,0.0004201985,0.0006793227,0.0007570763,0.0000020138616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045542092,0.00013846417,0.0049477224,0.0000064932083,0.00008758853,0.0000017193457,0.001936105,0.00035589904,0.00006965674,0.09776936,0.0005022797,0.8941392],"study_design_scores_gemma":[0.0008447538,0.0003955035,0.0030054445,0.00033586612,0.000029907604,0.00016756341,0.00008305918,0.95475036,0.00004390613,0.0014426521,0.038548555,0.000352415],"about_ca_topic_score_codex":0.0000031676689,"about_ca_topic_score_gemma":0.000048779675,"teacher_disagreement_score":0.95439446,"about_ca_system_score_codex":0.000066543995,"about_ca_system_score_gemma":0.000042354284,"threshold_uncertainty_score":0.99922204},"labels":[],"label_agreement":null},{"id":"W2168557634","doi":"10.1109/acssc.2009.5470114","title":"Spectrum efficient cooperative relaying based on outage-multiplexing tradeoff analysis","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Multiplexing; Relay channel; Computer network; Computer science; Outage probability; Hop (telecommunications); Power (physics); Topology (electrical circuits); Fading; Telecommunications; Engineering; Electrical engineering; Channel (broadcasting)","score_opus":0.031250958312700375,"score_gpt":0.2810428184978102,"score_spread":0.24979186018510985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168557634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069946274,0.000076565724,0.9592855,0.008428591,0.000080539845,0.0001752233,0.0000010074073,0.00031352308,0.024644434],"genre_scores_gemma":[0.97723126,0.000019747731,0.018757906,0.0035839817,0.000029033059,0.0000059920276,0.0000067131664,0.000005227852,0.0003601175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984006,0.00023101312,0.0002895465,0.00046910188,0.00030018418,0.00030952544],"domain_scores_gemma":[0.99848497,0.00025048622,0.000077866935,0.0009914057,0.00007816631,0.000117115385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044054713,0.00019175318,0.0002554936,0.00038963408,0.00045621302,0.00027791454,0.0008870154,0.000045928355,0.00013760569],"category_scores_gemma":[0.00006939749,0.0001607034,0.00016984165,0.0023605388,0.00002920291,0.00015220449,0.00009519004,0.00024973333,0.000057372927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016288672,0.00036415982,0.00032385837,0.000001203187,0.00007769731,0.000011082769,0.0010761344,0.8085849,0.0008656916,0.15325008,0.00036571425,0.03506319],"study_design_scores_gemma":[0.0004282666,0.000111592686,0.0066039576,0.000015477994,0.000019924055,6.915661e-7,0.000024317445,0.98968863,0.0021121143,0.00006724419,0.00071069336,0.0002170569],"about_ca_topic_score_codex":0.000002689617,"about_ca_topic_score_gemma":0.00002935985,"teacher_disagreement_score":0.97023666,"about_ca_system_score_codex":0.00010125131,"about_ca_system_score_gemma":0.000049920258,"threshold_uncertainty_score":0.65532947},"labels":[],"label_agreement":null},{"id":"W2168648017","doi":"10.1109/tvt.2010.2048767","title":"Output-Threshold Multiple-Relay-Selection Scheme for Cooperative Wireless Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Selection (genetic algorithm); Wireless; Computer science; Bandwidth (computing); Scheme (mathematics); Wireless network; Flexibility (engineering); Path (computing); Algorithm; Topology (electrical circuits); Computer network; Mathematics; Artificial intelligence; Telecommunications; Statistics; Combinatorics; Physics","score_opus":0.02030238715081825,"score_gpt":0.26031687704416956,"score_spread":0.2400144898933513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168648017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08223649,0.00009275934,0.91266745,0.0025493375,0.00092815637,0.00061871915,0.000003867612,0.0008385563,0.00006463996],"genre_scores_gemma":[0.9661853,0.00017517737,0.032388523,0.00034225616,0.000060585106,0.0005220298,0.0000041548524,0.00002874833,0.0002932611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844193,0.000059015874,0.00033056072,0.0005866069,0.00015480335,0.00042709167],"domain_scores_gemma":[0.99825865,0.00018409645,0.00010070872,0.0009529552,0.00041329223,0.00009027456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027354367,0.00026733245,0.00027541455,0.00043424673,0.0008445551,0.00011103611,0.0010717098,0.00048420098,0.000021655647],"category_scores_gemma":[0.000025083364,0.00026657776,0.00014630969,0.0012592799,0.00020137217,0.00028954077,0.000015649493,0.0012982661,0.000031149015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009956973,0.00091847987,0.0002740013,0.000017332972,0.00027608877,0.0000091751945,0.0003006579,0.17655641,0.22204122,0.12860201,0.00096263544,0.46994242],"study_design_scores_gemma":[0.00082576607,0.00022201544,0.000028541755,0.000021282467,0.0000136162,0.00003222363,0.000019209336,0.9038892,0.086848214,0.00014178191,0.0076663597,0.00029177775],"about_ca_topic_score_codex":0.0000034831771,"about_ca_topic_score_gemma":0.00038288842,"teacher_disagreement_score":0.88394874,"about_ca_system_score_codex":0.00006627678,"about_ca_system_score_gemma":0.00007568871,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W2168723448","doi":"10.4236/ijcns.2014.710042","title":"Network Coding and Quality of Service for Mobile &amp;lt;i&amp;gt;Ad Hoc&amp;lt;/i&amp;gt; Networks","year":2014,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada); Carleton University","funders":"","keywords":"Computer network; Computer science; Linear network coding; Mobile ad hoc network; Bottleneck; Network packet; Wireless ad hoc network; Routing protocol; Packet forwarding; Distributed computing; Wireless; Telecommunications","score_opus":0.12126478296474787,"score_gpt":0.36687537512770735,"score_spread":0.2456105921629595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168723448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034803744,0.039358843,0.9148906,0.0057464256,0.0015960983,0.0005183428,0.000011450181,0.00007795821,0.0029965742],"genre_scores_gemma":[0.85140514,0.0080459025,0.13924459,0.0005688477,0.00051396864,0.00004430718,0.00002107951,0.000014076449,0.00014209482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99553144,0.0012747409,0.0016060204,0.00038486242,0.00077310146,0.00042984684],"domain_scores_gemma":[0.99119556,0.0034754407,0.0017301948,0.0014373552,0.0019491544,0.00021227899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008056923,0.00028022128,0.00065518514,0.0002394435,0.0012539858,0.0006498,0.0049943603,0.00012671783,0.000012502864],"category_scores_gemma":[0.0002540501,0.00024451563,0.00017394849,0.0010306243,0.0005292218,0.0008266553,0.0015150794,0.000362236,0.000005317488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017766838,0.00026238424,0.008119064,0.00013825284,0.0004300193,4.983874e-7,0.003913793,0.11535956,0.0009536376,0.73951536,0.008949329,0.12218044],"study_design_scores_gemma":[0.002087739,0.00032421979,0.0078026736,0.002737502,0.00011708005,0.00026354668,0.00033586612,0.3231631,0.000009464909,0.0066342354,0.6556328,0.00089178653],"about_ca_topic_score_codex":0.000012840645,"about_ca_topic_score_gemma":0.0010686978,"teacher_disagreement_score":0.8166014,"about_ca_system_score_codex":0.00009643471,"about_ca_system_score_gemma":0.00014869803,"threshold_uncertainty_score":0.9971057},"labels":[],"label_agreement":null},{"id":"W2168733025","doi":"10.1145/1280940.1280947","title":"Optimal relay station placement in IEEE 802.16j networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; IEEE 802; WiMAX; Computer network; Throughput; IEEE 802.11s; Resource allocation; Wireless network; Wireless; Wireless mesh network; Telecommunications; Quality of service","score_opus":0.033892566221578525,"score_gpt":0.2988667905640815,"score_spread":0.26497422434250295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168733025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025899416,0.00013480106,0.9612551,0.0005033929,0.0002220326,0.00012603795,7.7431835e-8,0.00008909497,0.011770098],"genre_scores_gemma":[0.9169615,0.0002468038,0.0810202,0.0006390314,0.00004327089,0.0000074505124,0.000003079824,0.0000044996827,0.0010741575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991088,0.00007394401,0.00024804214,0.00019536048,0.00013713795,0.00023675154],"domain_scores_gemma":[0.99927723,0.0001537161,0.000047167177,0.00040274294,0.000059972874,0.000059167865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009486421,0.000081192295,0.00008036763,0.00010117084,0.000093058785,0.000076959106,0.0004827208,0.00003873915,0.000067913206],"category_scores_gemma":[0.000014599245,0.00007620958,0.000021052052,0.00048959994,0.000016935131,0.0002702186,0.00016114273,0.00016271086,0.000031009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038820894,0.00018390203,0.0029010824,0.0000035203502,0.00001419634,0.000018500863,0.0025425917,0.62707686,0.00065141934,0.16316079,0.0107655525,0.19264275],"study_design_scores_gemma":[0.00038477936,0.00004726057,0.0063384366,0.000015882195,8.1229524e-7,0.0000022114416,0.00006836267,0.9859714,0.0006167583,0.000027942258,0.00639003,0.00013610396],"about_ca_topic_score_codex":0.000008618901,"about_ca_topic_score_gemma":0.00033664415,"teacher_disagreement_score":0.8910621,"about_ca_system_score_codex":0.00008848606,"about_ca_system_score_gemma":0.000025302768,"threshold_uncertainty_score":0.31077364},"labels":[],"label_agreement":null},{"id":"W2168766390","doi":"10.1109/isit.2011.6033878","title":"A half-duplex cooperative scheme with partial decode-forward relaying","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Decodes; Channel (broadcasting); Transmission (telecommunications); Gaussian; Encoding (memory); Computer network; Duplex (building); Scheme (mathematics); ENCODE; Algorithm; Topology (electrical circuits); Telecommunications; Mathematics; Physics; Artificial intelligence","score_opus":0.07126738565441675,"score_gpt":0.27119390956126144,"score_spread":0.19992652390684468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168766390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016087357,0.0001742789,0.9031056,0.0007985496,0.000108219974,0.00020085876,2.934315e-7,0.00033774716,0.079187065],"genre_scores_gemma":[0.7856475,0.0000967154,0.21210602,0.0007513048,0.000026711712,0.000037008263,0.0000015628972,0.00000977437,0.0013233868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998883,0.00011762935,0.00020908745,0.00034280654,0.00017028507,0.00027719964],"domain_scores_gemma":[0.99876136,0.000053352327,0.000064579246,0.0007858749,0.00020837264,0.00012643723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025450924,0.00015789062,0.00016011223,0.00006545733,0.00033150695,0.00013267223,0.00090630713,0.0000418333,0.0004275446],"category_scores_gemma":[0.00003337861,0.00011571979,0.000038541693,0.0004949845,0.00007922233,0.0006454276,0.0004250084,0.00018932782,0.00017746654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004267703,0.000142219,0.0038338075,0.000003975026,0.00007025495,0.00002050577,0.0065360735,0.000086330736,0.00075480744,0.9561088,0.0022287706,0.030171797],"study_design_scores_gemma":[0.002292129,0.0008446901,0.00414802,0.00013932292,0.000023191598,0.000092082366,0.000530217,0.8750574,0.029068464,0.00057915476,0.08589773,0.0013276138],"about_ca_topic_score_codex":0.000022975379,"about_ca_topic_score_gemma":0.0001660286,"teacher_disagreement_score":0.95552963,"about_ca_system_score_codex":0.000032548433,"about_ca_system_score_gemma":0.00009739673,"threshold_uncertainty_score":0.4718916},"labels":[],"label_agreement":null},{"id":"W2168915420","doi":"10.1109/icc.2009.5199446","title":"Selection Cooperation with Transparent Amplify-and-Forward Relaying in MIMO Relay Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Pairwise error probability; Computer science; Relay channel; MIMO; Channel state information; Computer network; Transmission (telecommunications); Channel (broadcasting); Selection (genetic algorithm); Throughput; Cooperative diversity; Hop (telecommunications); Topology (electrical circuits); Cooperative MIMO; Synchronization (alternating current); Telecommunications; Wireless; 3G MIMO; Fading; Engineering; Electrical engineering; Physics","score_opus":0.03853042425340122,"score_gpt":0.27635893818075546,"score_spread":0.23782851392735424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168915420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058242716,0.00023111372,0.93177503,0.005214618,0.00006122295,0.00023639026,1.1830223e-7,0.00016928295,0.004069511],"genre_scores_gemma":[0.9848077,0.0005968043,0.013562368,0.00075762207,0.00002000006,0.000013623774,0.0000028508086,0.000003872409,0.00023512135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992005,0.00009713838,0.00018067932,0.00025020182,0.00010859834,0.00016285614],"domain_scores_gemma":[0.999587,0.000040163857,0.00003381881,0.00021854672,0.00006730082,0.000053182375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025923626,0.00010263105,0.00011600974,0.00010854285,0.00017733482,0.00015885559,0.00022115617,0.000043514516,0.000013871444],"category_scores_gemma":[0.000010585659,0.00008251333,0.000012822913,0.0005640632,0.0000145878585,0.000646555,0.000027947215,0.00017729437,0.000006461867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008278296,0.000284396,0.00474858,0.000012188571,0.000024815621,0.000008631311,0.008059387,0.04284058,0.009033583,0.5647323,0.0008077691,0.36936498],"study_design_scores_gemma":[0.0014301456,0.0006725168,0.020722684,0.00013990181,0.000007474787,0.000048361428,0.0000753047,0.9652129,0.004262718,0.0004420265,0.0064944704,0.00049151946],"about_ca_topic_score_codex":0.00000903657,"about_ca_topic_score_gemma":0.00022151857,"teacher_disagreement_score":0.926565,"about_ca_system_score_codex":0.000048185197,"about_ca_system_score_gemma":0.000029160508,"threshold_uncertainty_score":0.3364796},"labels":[],"label_agreement":null},{"id":"W2168954868","doi":"10.1109/tmc.2005.42","title":"Information raining and optimal link-layer design for mobile hotspots","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Heuristics; Bipartite graph; Network packet; Repeater (horology); Computer network; Theoretical computer science; Artificial intelligence; Graph","score_opus":0.044549062107336765,"score_gpt":0.29518761822612294,"score_spread":0.25063855611878616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168954868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016675916,0.00023991574,0.9813622,0.0002697594,0.00027136505,0.0007859441,0.0000026786481,0.00026999568,0.00012222797],"genre_scores_gemma":[0.7908808,0.00014025386,0.20828891,0.00037930548,0.0000809452,0.00017246006,0.0000015219068,0.000009793884,0.000046031208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988741,0.00010842605,0.00036260794,0.00022601086,0.00014586629,0.00028293967],"domain_scores_gemma":[0.99866587,0.0005655486,0.00011216938,0.0003986093,0.00016262844,0.00009518455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005718813,0.0001753772,0.0001739179,0.0001946162,0.00073576905,0.00027813786,0.0004268306,0.0000741513,0.000014382484],"category_scores_gemma":[0.000009037101,0.00018259905,0.000074754375,0.0003397254,0.000039119193,0.00095198036,0.00001405789,0.00024842433,0.000026712272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007832412,0.00002222068,8.7262276e-7,0.0000046467235,0.000008438977,8.6637705e-8,0.0020278536,0.4569329,0.000236962,0.00013316615,0.000060588198,0.5405644],"study_design_scores_gemma":[0.0006147506,0.00024819962,0.000027116968,0.000048689886,0.000007979358,0.00001192557,0.00014530844,0.9820607,0.0055633336,0.000013968808,0.011048681,0.00020939198],"about_ca_topic_score_codex":0.0000011125513,"about_ca_topic_score_gemma":0.0000019264169,"teacher_disagreement_score":0.77420485,"about_ca_system_score_codex":0.000071310635,"about_ca_system_score_gemma":0.00005442263,"threshold_uncertainty_score":0.7446173},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.044294522990025995,"score_gpt":0.29305835294254845,"score_spread":0.24876382995252244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169103030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0088315075,0.0001154356,0.98139995,0.0073125334,0.0004344301,0.00073381216,0.000014585081,0.00027729257,0.00088042044],"genre_scores_gemma":[0.8674789,0.0007995541,0.13069151,0.00044649583,0.000023663608,0.0004091003,0.000010638171,0.000017259594,0.00012287727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985593,0.00022125799,0.00038520643,0.0003919194,0.00014622946,0.0002960841],"domain_scores_gemma":[0.99546075,0.00086012407,0.00013033718,0.0031001926,0.00031137123,0.00013719797],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000724319,0.00019968025,0.000214836,0.00012133152,0.001572036,0.00023456119,0.0018536525,0.00012429316,0.000021308731],"category_scores_gemma":[0.000025160027,0.00020972858,0.00010332923,0.00056031835,0.00026727066,0.0004900047,0.000047827503,0.0006525584,0.000011534827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034047593,0.0008122447,0.00012821604,0.000030153777,0.00011045249,3.3417632e-7,0.0022418394,0.007560499,0.015764829,0.7250157,0.0007669031,0.2475348],"study_design_scores_gemma":[0.0011932442,0.00023055,0.0014305534,0.00010778446,0.000056113495,0.000019685029,0.00009074864,0.9575456,0.0041795657,0.0083766095,0.025978088,0.00079149293],"about_ca_topic_score_codex":0.000008598093,"about_ca_topic_score_gemma":0.00073307304,"teacher_disagreement_score":0.9499851,"about_ca_system_score_codex":0.000050858802,"about_ca_system_score_gemma":0.00009147606,"threshold_uncertainty_score":0.9997278},"labels":[],"label_agreement":null},{"id":"W2169154778","doi":"10.48550/arxiv.0805.4440","title":"Optimal Coding for the Erasure Channel with Arbitrary Alphabet Size","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erasure; Binary erasure channel; Erasure code; Mathematics; Alphabet; Decoding methods; Separable space; Discrete mathematics; Block code; Channel (broadcasting); Algorithm; Combinatorics; Coding (social sciences); Channel capacity; Computer science; Statistics; Telecommunications","score_opus":0.08768192245977054,"score_gpt":0.28575366129732876,"score_spread":0.19807173883755824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169154778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15959527,0.005097988,0.81726116,0.012553755,0.0011936527,0.0016121011,0.000018499817,0.00049168954,0.002175896],"genre_scores_gemma":[0.96775794,0.0054481565,0.023399698,0.00190025,0.00039906165,0.00036899722,0.000017559216,0.00003796067,0.0006703699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823934,0.00014453557,0.0003120272,0.00064806174,0.00025879187,0.00039724566],"domain_scores_gemma":[0.99653643,0.0010392776,0.00023124318,0.0018148696,0.00027974753,0.00009842071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046145558,0.00035234433,0.00035027135,0.00005618371,0.00077028846,0.00020214765,0.0027389298,0.00016008022,0.000014279777],"category_scores_gemma":[0.00011961134,0.00024471374,0.00016852982,0.0002774627,0.00014074617,0.00022587884,0.001859497,0.00087986374,0.000019827668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012766942,0.0026871725,0.1482832,0.0015676096,0.0068042525,0.00045913484,0.07876413,0.3106602,0.0046677445,0.082777545,0.17550163,0.18655069],"study_design_scores_gemma":[0.0026664536,0.00046577756,0.11292258,0.0011360636,0.00016089456,0.00013710285,0.00020954762,0.79873604,0.0032908393,0.00072536664,0.07716445,0.0023848824],"about_ca_topic_score_codex":0.0000068779864,"about_ca_topic_score_gemma":0.000017036633,"teacher_disagreement_score":0.8081627,"about_ca_system_score_codex":0.000060452865,"about_ca_system_score_gemma":0.00026376583,"threshold_uncertainty_score":0.99791366},"labels":[],"label_agreement":null},{"id":"W2169167200","doi":"10.1109/icc.2011.5963232","title":"New Performance Approximations for Multi-Hop Fixed-Gain AF Relay Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Relay; Moment-generating function; Coding gain; Diversity gain; Cumulative distribution function; Fading; Hop (telecommunications); Mathematics; Independent and identically distributed random variables; Applied mathematics; Computer science; Probability density function; Outage probability; Signal-to-noise ratio (imaging); Algorithm; Topology (electrical circuits); Control theory (sociology); Mathematical optimization; Statistics; Random variable; Telecommunications; Decoding methods; Combinatorics","score_opus":0.1141409281628101,"score_gpt":0.29177634621478193,"score_spread":0.17763541805197183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169167200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033071506,0.00021157123,0.9875313,0.00039134917,0.0002206379,0.0003121128,3.7924227e-7,0.00023444703,0.010767486],"genre_scores_gemma":[0.24659774,0.00031874102,0.74387926,0.0005175766,0.0000623101,0.00006445895,0.0000044235067,0.0000092543005,0.008546224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991482,0.00006332125,0.00022123393,0.00024326413,0.00008015154,0.00024383176],"domain_scores_gemma":[0.9988604,0.00010449155,0.000067009096,0.00073393417,0.000125231,0.000108938904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038009926,0.00011764661,0.00011383948,0.00006200867,0.00032669393,0.00008332137,0.0010049385,0.00005471413,0.00013114147],"category_scores_gemma":[0.000040493134,0.00010309504,0.000059079666,0.00035862136,0.000023112503,0.0005108276,0.0002967881,0.00013286422,0.000049805058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010672538,0.00010746544,0.00070925895,0.00001032483,0.00002375599,3.716376e-7,0.0030222642,0.0020233998,0.00009879589,0.4226429,0.021427723,0.54992306],"study_design_scores_gemma":[0.00031539373,0.000044398683,0.0010099041,0.000015673164,0.000002787165,0.0000019342065,0.000019733736,0.98561823,0.00057023496,0.00012321488,0.012123386,0.00015512652],"about_ca_topic_score_codex":0.0000071260383,"about_ca_topic_score_gemma":0.000055121985,"teacher_disagreement_score":0.98359483,"about_ca_system_score_codex":0.00002585108,"about_ca_system_score_gemma":0.0000583184,"threshold_uncertainty_score":0.42040938},"labels":[],"label_agreement":null},{"id":"W2169435309","doi":"10.1109/tcomm.2009.08.070324","title":"Exact BER analysis of distributed alamouti's code for cooperative diversity networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bit error rate; Rayleigh fading; QAM; Quadrature amplitude modulation; Mathematics; Diversity combining; Expression (computer science); Maximal-ratio combining; Gray code; Modulation (music); Algorithm; Topology (electrical circuits); Computer science; Fading; Physics; Decoding methods; Combinatorics","score_opus":0.0583457954210946,"score_gpt":0.30976082451972825,"score_spread":0.25141502909863367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169435309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009101148,0.00025919286,0.9937009,0.0036368067,0.00009065304,0.00038610055,0.00026046688,0.00014444302,0.00061132695],"genre_scores_gemma":[0.98530054,0.0015955702,0.012369077,0.00041050618,0.000007246104,0.000057054625,0.00010915844,0.0000062718136,0.00014458789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861485,0.0003041168,0.00039866415,0.00028738976,0.00017188214,0.00022308753],"domain_scores_gemma":[0.9955727,0.000818919,0.0001702799,0.0028275081,0.0005104913,0.00010014363],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00035076722,0.00017629033,0.0003526533,0.00032956334,0.0015479663,0.000076207565,0.0025280549,0.000086959226,0.000034205106],"category_scores_gemma":[0.000018345141,0.00018180396,0.00031219862,0.0024673513,0.00015077635,0.00033975707,0.000054819804,0.00031206422,0.0000033000829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009745721,0.0024644495,0.00024065677,0.0000064616543,0.0022091111,6.319893e-7,0.0037972282,0.768325,0.0007393887,0.09185523,0.0019437493,0.12832065],"study_design_scores_gemma":[0.0004961839,0.00016806548,0.003976093,0.000022045184,0.00044255125,7.4462963e-7,0.000060949147,0.99063766,0.0009048141,0.0002391077,0.0028174508,0.00023430593],"about_ca_topic_score_codex":0.000013349648,"about_ca_topic_score_gemma":0.00066861394,"teacher_disagreement_score":0.98439044,"about_ca_system_score_codex":0.00010134996,"about_ca_system_score_gemma":0.0000545543,"threshold_uncertainty_score":0.99975187},"labels":[],"label_agreement":null},{"id":"W2169600795","doi":"10.1109/glocom.2009.5426225","title":"Downlink Distributed Beamforming through Relay Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Beamforming; Relay; Telecommunications link; Computer science; Transmitter power output; Transmitter; Antenna (radio); Precoding; Relaxation (psychology); Power (physics); Electronic engineering; Computer network; Telecommunications; MIMO; Engineering","score_opus":0.028491532700270564,"score_gpt":0.2786294221146024,"score_spread":0.25013788941433185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169600795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004563423,0.0004454902,0.9728729,0.005900262,0.00013668077,0.00008926094,4.0448043e-7,0.000352284,0.019746382],"genre_scores_gemma":[0.89379215,0.00085218064,0.10087004,0.003872814,0.00008724588,0.0000043765353,0.000018607,0.0000036958952,0.0004988873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913293,0.000058533264,0.00020859348,0.00022725371,0.000119456345,0.0002532108],"domain_scores_gemma":[0.9989803,0.0000751609,0.000052543033,0.000749886,0.00007994937,0.00006215731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001932056,0.000111608344,0.00011903557,0.000024826832,0.00028677814,0.0001605518,0.00095695927,0.000052501575,0.000046631878],"category_scores_gemma":[0.000026898542,0.00009314868,0.000052765845,0.00056314596,0.00002092823,0.0006182373,0.00022732996,0.00019876877,0.000038213373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025971458,0.000054302618,0.000074354204,6.1622524e-7,0.0000078966195,0.0000035458643,0.00034972306,0.0062098745,0.00013361807,0.75191665,0.0100536635,0.23119314],"study_design_scores_gemma":[0.000311972,0.000085564214,0.0020026627,0.000026264383,0.0000033379322,0.0000139213,0.000017509203,0.8841663,0.00035929037,0.0034654082,0.109265916,0.00028185314],"about_ca_topic_score_codex":0.000001884975,"about_ca_topic_score_gemma":0.0000064237843,"teacher_disagreement_score":0.8933358,"about_ca_system_score_codex":0.00003859172,"about_ca_system_score_gemma":0.000021377986,"threshold_uncertainty_score":0.37984928},"labels":[],"label_agreement":null},{"id":"W2169636820","doi":"10.1109/twc.2006.04598","title":"Cooperative transmission in poisson distributed wireless sensor networks: protocol and outage probability","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Cooperative diversity; Wireless sensor network; Node (physics); Upper and lower bounds; Relay; Transmission (telecommunications); Wireless network; Topology (electrical circuits); Poisson distribution; Wireless; Key distribution in wireless sensor networks; Power (physics); Telecommunications; Mathematics; Engineering; Statistics; Physics","score_opus":0.033303873279264144,"score_gpt":0.2906542319179386,"score_spread":0.25735035863867445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169636820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074862684,0.000105013394,0.9737368,0.0036849142,0.00005533753,0.014200041,0.000026961221,0.00030501807,0.0003996377],"genre_scores_gemma":[0.96605724,0.0004534859,0.012296667,0.00012696531,0.000014683507,0.02088107,0.000029986439,0.000024290483,0.0001155976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715346,0.0009796963,0.0006905861,0.0005525668,0.00023518105,0.00038847976],"domain_scores_gemma":[0.9964784,0.00056903687,0.00015264972,0.0024180757,0.0002453429,0.0001365024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005188103,0.00032860492,0.00036436378,0.00021233986,0.0010056439,0.00024913446,0.0016321562,0.0001645765,0.000019403638],"category_scores_gemma":[0.000005196701,0.00031982022,0.000097100856,0.001310563,0.00032990312,0.0005776382,0.00004699155,0.00082804944,0.000008734088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033185387,0.008429356,0.0014375236,0.00015788105,0.00016367415,0.000016585562,0.004410655,0.25600305,0.011883978,0.10324332,0.00042680968,0.6134953],"study_design_scores_gemma":[0.0017756004,0.00013774597,0.0026856621,0.00025693385,0.00001896362,0.0000129789205,0.000078717654,0.98657197,0.0035418028,0.0006416306,0.0037402466,0.00053773675],"about_ca_topic_score_codex":0.00015862839,"about_ca_topic_score_gemma":0.0015286057,"teacher_disagreement_score":0.96144015,"about_ca_system_score_codex":0.00020664299,"about_ca_system_score_gemma":0.000113324466,"threshold_uncertainty_score":0.9999254},"labels":[],"label_agreement":null},{"id":"W2169706420","doi":"10.1109/glocom.2007.145","title":"Distributed Space-Time Transmission with CPM","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Node (physics); Computer science; Decoding methods; Relay; Transmission (telecommunications); Code (set theory); Algorithm; Wireless sensor network; Set (abstract data type); Topology (electrical circuits); Mathematics; Power (physics); Computer network; Telecommunications; Combinatorics; Engineering","score_opus":0.016649379206682594,"score_gpt":0.25132068121052076,"score_spread":0.23467130200383818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169706420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002374338,0.00011083277,0.9698094,0.002998993,0.000017392347,0.000069523885,2.571822e-7,0.00020227158,0.02441698],"genre_scores_gemma":[0.88533163,0.00008271337,0.11142456,0.00038159924,0.00002190081,0.0000020269174,0.0000075356884,0.000005377186,0.0027426474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942946,0.00003057142,0.0000996232,0.00015073747,0.00012412977,0.00016548006],"domain_scores_gemma":[0.99933684,0.00007529842,0.000023088838,0.0004032272,0.00006837499,0.000093190174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027379798,0.000072072085,0.00007285336,0.000038444126,0.00013620028,0.000063957676,0.00047432585,0.000023052213,0.00014710566],"category_scores_gemma":[0.000005290659,0.000049429957,0.00001992261,0.0004452234,0.000023229151,0.00018948757,0.000083775245,0.00008009659,0.00007504533],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000410976,0.00014929296,0.0006908589,0.00000491601,0.000023642408,0.000022733027,0.00084762723,0.00016393833,0.017882718,0.21664377,0.010191991,0.75333744],"study_design_scores_gemma":[0.0014193244,0.00031487062,0.021297328,0.000095332165,0.000008669324,0.00004677855,0.000046709298,0.26439533,0.045334842,0.0006421077,0.6657447,0.000654002],"about_ca_topic_score_codex":0.0000017229054,"about_ca_topic_score_gemma":0.000010101648,"teacher_disagreement_score":0.8829573,"about_ca_system_score_codex":0.000021288595,"about_ca_system_score_gemma":0.000023357377,"threshold_uncertainty_score":0.20156951},"labels":[],"label_agreement":null},{"id":"W2169742769","doi":"10.1109/glocom.2008.ecp.724","title":"Performance Analysis for a Fully Decentralized Transmit Power Allocation Scheme for Relay-Assisted Cognitive-Radio Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Medical Research Council","keywords":"Cognitive radio; Relay; Computer science; Transmitter power output; Interference (communication); Node (physics); Computer network; Narrowband; Signal-to-noise ratio (imaging); Transmission (telecommunications); Scheme (mathematics); Limiting; Frequency allocation; Transmitter; Power (physics); Electronic engineering; Telecommunications; Engineering; Wireless; Mathematics","score_opus":0.0644702378835599,"score_gpt":0.28582647164352737,"score_spread":0.22135623375996746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169742769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090245314,0.0007309499,0.9063582,0.0006394706,0.00012201783,0.00089460955,0.0000060468155,0.00016788192,0.0008355397],"genre_scores_gemma":[0.9420785,0.00079360505,0.055255275,0.00021992087,0.000019866224,0.00041997645,0.000055834007,0.00001091408,0.0011461455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866027,0.00009411734,0.00038756675,0.00037454462,0.00018269627,0.0003008088],"domain_scores_gemma":[0.9983051,0.0003408226,0.00012228593,0.00048903807,0.0006425915,0.00010019184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040488993,0.00016174781,0.00030045595,0.00019341499,0.0005293562,0.00010898425,0.0006026742,0.00006742515,0.000031231524],"category_scores_gemma":[0.00006467941,0.00014628979,0.00022138063,0.0010985144,0.000047972113,0.00043673505,0.000046590696,0.000075544835,0.000008871152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028623457,0.0037678278,0.111286186,0.0009251861,0.013380212,0.000017108245,0.029323222,0.02210408,0.026934179,0.46543995,0.026037354,0.29792234],"study_design_scores_gemma":[0.0017320603,0.00014892602,0.021586655,0.00003978002,0.000105592044,0.0000119081105,0.000050766586,0.96646184,0.0006008803,0.000005446827,0.00899571,0.00026045906],"about_ca_topic_score_codex":0.000005378765,"about_ca_topic_score_gemma":0.000027530634,"teacher_disagreement_score":0.94435775,"about_ca_system_score_codex":0.00006778934,"about_ca_system_score_gemma":0.00010074759,"threshold_uncertainty_score":0.5965525},"labels":[],"label_agreement":null},{"id":"W2169836946","doi":"10.1109/tsp.2011.2123890","title":"Multisource Transmission for Wireless Relay Networks With Linear Complexity","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Decoding methods; Computer science; Wireless; Transmission (telecommunications); Theoretical computer science; Algorithm; Single antenna interference cancellation; Space–time code; Computer network; Topology (electrical circuits); Telecommunications; Mathematics; Fading; Combinatorics","score_opus":0.09574970530837748,"score_gpt":0.2862665232509038,"score_spread":0.1905168179425263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169836946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018084771,0.0001752519,0.9967745,0.00018394915,0.000062673615,0.00031893383,0.0000016844541,0.00027173682,0.00040279297],"genre_scores_gemma":[0.8267665,0.000060455244,0.17270435,0.00022017931,0.000028957058,0.00006191659,0.000001465757,0.00002119896,0.00013496431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878174,0.00009712561,0.00025888588,0.00038733953,0.0001842172,0.0002907027],"domain_scores_gemma":[0.9991103,0.000110900226,0.00010172306,0.00033645166,0.0002107198,0.00012994894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024273271,0.00020134692,0.00019483683,0.00010102245,0.00091947493,0.0000943577,0.00059930945,0.00008309199,0.000040901985],"category_scores_gemma":[7.4804296e-7,0.0001668709,0.0000820931,0.0004845443,0.000118967764,0.00047879622,0.0000034495426,0.00035443658,0.0000050982912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001992747,0.00026902807,0.000008796401,0.000032186155,0.000023436874,0.0000024661501,0.00260505,0.044294536,0.0007811358,0.00044049034,0.000019655776,0.9513239],"study_design_scores_gemma":[0.000700968,0.00026429544,0.000052630236,0.00021789264,0.000018770348,0.000012706434,0.00004402822,0.98440933,0.0131679615,0.00007270798,0.00078391377,0.00025476704],"about_ca_topic_score_codex":0.00000629513,"about_ca_topic_score_gemma":0.000024595805,"teacher_disagreement_score":0.9510692,"about_ca_system_score_codex":0.00003955901,"about_ca_system_score_gemma":0.000076086915,"threshold_uncertainty_score":0.7071951},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04499486000545759,"score_gpt":0.2818834896058828,"score_spread":0.23688862960042517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169948709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44042385,0.00027492663,0.55677074,0.0012028352,0.0001428637,0.00014240525,0.0000030079525,0.00009002885,0.0009493103],"genre_scores_gemma":[0.99313056,0.0016960573,0.0034327107,0.0016273529,0.000026342539,0.000011076175,0.000027188238,0.000009343209,0.000039348663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983747,0.00027534194,0.000461108,0.00029415436,0.0002633007,0.00033137042],"domain_scores_gemma":[0.99570787,0.0005756082,0.00027304498,0.0030572913,0.00028593856,0.00010027543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044019,0.00018676989,0.00034661012,0.00055845006,0.001167061,0.00007336534,0.0040934915,0.000068900896,0.000013219584],"category_scores_gemma":[0.000021995857,0.0001974701,0.0001690062,0.0034355423,0.0003001747,0.0005953256,0.0023491026,0.0003757625,0.0000053656513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011894776,0.0013175479,0.20678735,0.00005828311,0.0057757637,0.000015272859,0.044641674,0.4775948,0.040290017,0.058282983,0.007243758,0.15787362],"study_design_scores_gemma":[0.00025089772,0.0000227509,0.07811908,0.00003740239,0.00012815227,0.0000012637313,0.00007043206,0.9197542,0.0008198137,0.0000044994654,0.00054217974,0.0002493429],"about_ca_topic_score_codex":0.000037443468,"about_ca_topic_score_gemma":0.00031365326,"teacher_disagreement_score":0.55333805,"about_ca_system_score_codex":0.00013720902,"about_ca_system_score_gemma":0.00002646893,"threshold_uncertainty_score":0.89762086},"labels":[],"label_agreement":null},{"id":"W2170056754","doi":"10.1109/tit.2007.904783","title":"Multisource, Multidestination, Multirelay Wireless Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Computer network; Computer science; Relay; Multicast; Wireless sensor network; Fading; Transmitter; Linear network coding; Coding (social sciences); Node (physics); Algorithm; Mathematics; Engineering; Network packet; Channel (broadcasting)","score_opus":0.013172078739805838,"score_gpt":0.2488425138796668,"score_spread":0.23567043513986097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170056754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002452519,0.000033296605,0.9918019,0.00016386836,0.0007280157,0.0002783618,0.0000027014555,0.00047357637,0.004065723],"genre_scores_gemma":[0.98583686,0.00013375022,0.012432593,0.0011360273,0.000032146258,0.00003528633,0.0000069244015,0.000009733426,0.00037665383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856895,0.00016375213,0.0005393679,0.00016474207,0.00026416813,0.00029900824],"domain_scores_gemma":[0.9980819,0.00065133016,0.00018194855,0.00064676546,0.00030792522,0.00013012825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471332,0.00018339761,0.00013510253,0.00037290898,0.00064274087,0.00017652729,0.0006893802,0.00011039645,0.00006859348],"category_scores_gemma":[0.000026206711,0.00018053988,0.00009137892,0.000736528,0.000077844554,0.0019874105,0.0000080644,0.0003919729,0.00025810875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034704855,0.00007630852,0.000009585139,0.0000048427873,0.000018649704,7.688115e-7,0.002281332,0.07199533,0.00008134669,0.053869374,0.00012932224,0.8714984],"study_design_scores_gemma":[0.000996683,0.00006957112,0.0009329521,0.000052565305,0.000009123626,0.00001744757,0.00025696354,0.982858,0.0064950697,0.00039226114,0.0075597935,0.00035958752],"about_ca_topic_score_codex":0.0000036537253,"about_ca_topic_score_gemma":0.000019187852,"teacher_disagreement_score":0.9833844,"about_ca_system_score_codex":0.000111228976,"about_ca_system_score_gemma":0.000034262615,"threshold_uncertainty_score":0.73622024},"labels":[],"label_agreement":null},{"id":"W2170237803","doi":"10.1109/glocom.2012.6503773","title":"Performance analysis of AF cooperative systems with HPA nonlinearity in semi-blind relays","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; QAM; Quadrature amplitude modulation; Nonlinear system; Nonlinear distortion; Amplifier; Interference (communication); Control theory (sociology); Modulation (music); Moment-generating function; Computer science; Topology (electrical circuits); Signal-to-noise ratio (imaging); Electronic engineering; Mathematics; Telecommunications; Bit error rate; Probability density function; Physics; Statistics; Engineering; Channel (broadcasting); Acoustics; Bandwidth (computing)","score_opus":0.044533045253829194,"score_gpt":0.2853118703917566,"score_spread":0.2407788251379274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170237803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8366405,0.0007271749,0.14983717,0.00020830876,0.00008937308,0.00029861796,0.0000021096025,0.000052466225,0.012144307],"genre_scores_gemma":[0.9942545,0.00028737422,0.0049858545,0.000053071806,0.00001861365,0.000023560086,0.0000067088,0.000003681953,0.0003666204],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900186,0.00016399016,0.00027922864,0.00017054201,0.00017700321,0.0002073632],"domain_scores_gemma":[0.99887496,0.00012360764,0.00009626209,0.00062236335,0.00021305992,0.000069724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006064618,0.000105141604,0.00027666005,0.00027871868,0.0000851719,0.000048976173,0.0005245188,0.000039897008,0.000030917894],"category_scores_gemma":[0.000019189449,0.00007664468,0.00003551976,0.0027587356,0.000047641304,0.000636507,0.00020767418,0.00015882624,0.000009492495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059764596,0.00045737153,0.84897906,0.000030073496,0.00043604826,0.0000013804919,0.005845862,0.082683854,0.00048336145,0.05360586,0.000129579,0.00728778],"study_design_scores_gemma":[0.00033143436,0.000053223062,0.08159688,0.000033244803,0.000032736065,0.0000018876336,0.000098865465,0.9167889,0.000383054,4.149312e-7,0.0005587621,0.00012060004],"about_ca_topic_score_codex":0.000034069642,"about_ca_topic_score_gemma":0.00028746412,"teacher_disagreement_score":0.834105,"about_ca_system_score_codex":0.000046068562,"about_ca_system_score_gemma":0.000050477873,"threshold_uncertainty_score":0.31254795},"labels":[],"label_agreement":null},{"id":"W2170544219","doi":"10.1109/wcnc.2009.4917644","title":"Cooperative Diversity over Fading Channels with Impulsive Noise","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise error probability; Additive white Gaussian noise; Fading; Rayleigh fading; Computer science; Noise (video); Gaussian noise; Interference (communication); Noise power; Electronic engineering; Diversity combining; Telecommunications; Diversity gain; Power (physics); Algorithm; Topology (electrical circuits); White noise; Channel (broadcasting); Engineering; Electrical engineering; Physics; Artificial intelligence","score_opus":0.026700570094698683,"score_gpt":0.26034155712845014,"score_spread":0.23364098703375147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170544219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08438709,0.00016337888,0.87716633,0.0038603297,0.00013574849,0.0002708513,8.0862895e-7,0.00029630886,0.033719186],"genre_scores_gemma":[0.9907963,0.00009976866,0.005202031,0.002679739,0.0000356582,0.0000026646503,0.0000015775158,0.0000028321547,0.0011794141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918795,0.000072691044,0.00009937923,0.00026657828,0.00016876057,0.00020466068],"domain_scores_gemma":[0.9991613,0.00005534019,0.000044452747,0.00046695408,0.00017928127,0.00009266383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012313228,0.00012593408,0.00012975329,0.000066116685,0.0006217917,0.00015944857,0.00079699856,0.000027947917,0.00009482456],"category_scores_gemma":[0.000013903756,0.00009468914,0.00003077775,0.000479788,0.000035041412,0.000664876,0.00064817246,0.00013058519,0.000029590123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000726679,0.0003576836,0.004493099,0.000004767398,0.00010352634,0.00006918086,0.024198124,0.0065450855,0.0037439181,0.76911074,0.013209405,0.1780918],"study_design_scores_gemma":[0.0062274174,0.0028829768,0.123860255,0.00028114376,0.00004777974,0.00009706132,0.0007448738,0.81076163,0.024794832,0.00541435,0.02199506,0.0028926306],"about_ca_topic_score_codex":0.0000075842763,"about_ca_topic_score_gemma":0.000022005715,"teacher_disagreement_score":0.9064092,"about_ca_system_score_codex":0.00005024201,"about_ca_system_score_gemma":0.00003222661,"threshold_uncertainty_score":0.4782382},"labels":[],"label_agreement":null},{"id":"W2170624715","doi":"10.1109/icc.2007.883","title":"Performance Analysis of Cooperative Diversity Using Equal Gain Combining (EGC) Technique Over Rayleigh Fading Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Rayleigh fading; Fading; Channel state information; Computer science; Channel (broadcasting); Algorithm; Topology (electrical circuits); Wireless; Mathematics; Telecommunications; Combinatorics","score_opus":0.07232893349267595,"score_gpt":0.3111541843292828,"score_spread":0.23882525083660688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170624715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36517757,0.000035807356,0.6320417,0.000020266134,0.00005941546,0.00011954781,7.225708e-7,0.00006571195,0.0024792354],"genre_scores_gemma":[0.9798239,0.00007217006,0.01979124,0.00017685047,0.000017110602,0.0000028975362,0.00000396675,0.0000053724557,0.00010650374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986361,0.00014038234,0.00035688907,0.0002987247,0.00027326282,0.00029464363],"domain_scores_gemma":[0.99864525,0.00025838628,0.00017191768,0.00055727497,0.000283492,0.00008366529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015130799,0.00015547487,0.00033222744,0.0005551225,0.0006525671,0.00006480652,0.00093152263,0.0000674707,0.00009296535],"category_scores_gemma":[0.000039279254,0.00014728062,0.00011335712,0.0028551046,0.000084051964,0.00060706167,0.0016745703,0.00019077428,0.0000021007277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013603334,0.00066431065,0.18622662,0.00006784777,0.0024974763,0.00003289745,0.042903297,0.27257282,0.18691109,0.25693017,0.00032213936,0.0507353],"study_design_scores_gemma":[0.0002362185,0.00006172243,0.0065582716,0.000041066593,0.0000663555,0.0000019428053,0.0001100058,0.9421664,0.05044944,0.00002830299,0.00005888442,0.00022139464],"about_ca_topic_score_codex":0.00004753412,"about_ca_topic_score_gemma":0.00005113953,"teacher_disagreement_score":0.6695936,"about_ca_system_score_codex":0.00011560809,"about_ca_system_score_gemma":0.000041285784,"threshold_uncertainty_score":0.600593},"labels":[],"label_agreement":null},{"id":"W2170635816","doi":"10.1109/tvt.2007.905606","title":"Evaluations of Achievable Rate and Power Consumption in Cooperative Cellular Networks With Two Classes of Nodes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer network; Base station; Power consumption; Computer science; Transmitter power output; Homogeneous; Power (physics); Cellular network; Transmitter; Mathematics; Channel (broadcasting)","score_opus":0.02812692240828748,"score_gpt":0.2759654547461557,"score_spread":0.2478385323378682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170635816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42625743,0.00042783603,0.5727327,0.0003111609,0.000028051922,0.00015718551,0.0000012175972,0.00004601508,0.000038414197],"genre_scores_gemma":[0.99152416,0.0017851734,0.006561582,0.000039912986,0.0000018088434,0.000048182075,0.0000012588698,0.000007924382,0.000029993766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898386,0.00020379445,0.0002860534,0.00025301016,0.00011916453,0.00015412092],"domain_scores_gemma":[0.99897945,0.00014717512,0.00011123451,0.0005094383,0.0002250004,0.000027716738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002461695,0.00012981099,0.00025110514,0.0004196552,0.00018571869,0.00001020701,0.00031147874,0.00010948406,0.000017915188],"category_scores_gemma":[0.000009860878,0.00011631271,0.00003138114,0.0009708781,0.00043365665,0.00018649515,0.000009630966,0.00030409382,0.0000025048041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001185691,0.00084860506,0.004453026,0.000028009925,0.00017088861,0.000027352246,0.0013663243,0.80274934,0.14289466,0.03143192,0.000019075223,0.015892256],"study_design_scores_gemma":[0.002587019,0.00076895696,0.004208806,0.00023481196,0.000040228395,0.00008143499,0.00015209398,0.5989422,0.39227256,0.00021812387,0.00014633464,0.00034743594],"about_ca_topic_score_codex":0.000008359848,"about_ca_topic_score_gemma":0.00012324296,"teacher_disagreement_score":0.5661711,"about_ca_system_score_codex":0.000031522257,"about_ca_system_score_gemma":0.000066171066,"threshold_uncertainty_score":0.47430944},"labels":[],"label_agreement":null},{"id":"W2170678650","doi":"10.1109/tcomm.2012.12.100671","title":"Partial and Opportunistic Relay Selection with Outdated Channel Estimates","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Channel state information; Channel (broadcasting); Selection (genetic algorithm); Computer science; Signal-to-noise ratio (imaging); Scheduling (production processes); Outage probability; Bit error rate; Control theory (sociology); Telecommunications; Mathematics; Fading; Wireless; Mathematical optimization; Power (physics); Physics","score_opus":0.07913082268188901,"score_gpt":0.30184955950842934,"score_spread":0.22271873682654034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170678650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015781494,0.00036676985,0.9932412,0.0030523075,0.00014053045,0.00021651892,0.000006367463,0.00031649778,0.0010816621],"genre_scores_gemma":[0.9637747,0.0015545224,0.034031104,0.00022385639,0.000019636258,0.00014094768,0.000009766559,0.0000149035095,0.00023055867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900126,0.0001996026,0.0002141045,0.00019130569,0.00013392958,0.00025981065],"domain_scores_gemma":[0.9978641,0.00032012188,0.000080781174,0.0014281964,0.0001302469,0.00017650833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027599497,0.00015760065,0.00013918855,0.00014307813,0.0010847852,0.000119411685,0.00081233575,0.000057430516,0.000026802345],"category_scores_gemma":[0.000010212705,0.00014370108,0.00003313461,0.00057145534,0.00015884123,0.00065564795,0.00002327531,0.0003575872,0.00003984569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022179914,0.0071764085,0.0024080453,0.0000832374,0.000988822,0.0000044298176,0.022307498,0.033190183,0.0124796145,0.36429718,0.0029831305,0.55385965],"study_design_scores_gemma":[0.0007693853,0.00027625298,0.0017090924,0.00010444635,0.00009761227,0.00011665378,0.00013920192,0.9771263,0.005333165,0.00019368564,0.01357616,0.00055802596],"about_ca_topic_score_codex":0.000013485042,"about_ca_topic_score_gemma":0.00009246302,"teacher_disagreement_score":0.9621965,"about_ca_system_score_codex":0.000054062726,"about_ca_system_score_gemma":0.000056262215,"threshold_uncertainty_score":0.8343401},"labels":[],"label_agreement":null},{"id":"W2170731591","doi":"10.1109/iwcmc.2008.155","title":"Adaptive Coded Cooperation in Wireless Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Antenna diversity; Cooperative diversity; Channel (broadcasting); Coding (social sciences); Redundancy (engineering); Decoding methods; Wireless; Linear network coding; Automatic repeat request; Spectral efficiency; Fading; Hybrid automatic repeat request; Telecommunications; Telecommunications link; Mathematics","score_opus":0.05238085000644146,"score_gpt":0.2605335262630122,"score_spread":0.20815267625657072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170731591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021823134,0.00014172815,0.9658545,0.00057890627,0.00009668371,0.00012415655,8.631913e-8,0.00011920496,0.011261579],"genre_scores_gemma":[0.98982877,0.0008751871,0.007886066,0.0006950418,0.000027261116,0.000017236316,0.0000024383057,0.0000039512847,0.0006640352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992607,0.00013159498,0.00017093355,0.00019216217,0.00008898413,0.00015562773],"domain_scores_gemma":[0.99936396,0.000076337186,0.000029899085,0.0003895129,0.000096463766,0.000043836873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016370406,0.000080517966,0.00010530125,0.00006460368,0.00017747279,0.000040081213,0.0005071236,0.000038185408,0.000035146975],"category_scores_gemma":[0.000010667744,0.00007357384,0.000020213776,0.0005842079,0.000038552444,0.00037045515,0.0001977801,0.00014392052,0.000030990806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013787202,0.00013078171,0.002686512,9.176489e-7,0.000008778716,0.000024918076,0.0016066732,0.012469143,0.00049098016,0.90234375,0.0044125104,0.07581122],"study_design_scores_gemma":[0.0002765173,0.000028452396,0.0043998263,0.000009353002,3.2865174e-7,0.000010399327,0.0000104481915,0.99423987,0.0002903502,0.000055259,0.0005700487,0.000109156346],"about_ca_topic_score_codex":0.000012182503,"about_ca_topic_score_gemma":0.00026554675,"teacher_disagreement_score":0.9817707,"about_ca_system_score_codex":0.000042004995,"about_ca_system_score_gemma":0.00004772481,"threshold_uncertainty_score":0.30002543},"labels":[],"label_agreement":null},{"id":"W2170789099","doi":"10.1109/isit.2008.4595304","title":"On the k-pairs problem","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiplicative function; Linear network coding; Upper and lower bounds; Conjecture; Coding (social sciences); Combinatorics; Computer science; Mathematics; Undirected graph; Discrete mathematics; Graph; Computer network; Statistics","score_opus":0.064536276380898,"score_gpt":0.2586101745882829,"score_spread":0.1940738982073849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170789099","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075811082,0.000104448314,0.35934007,0.029790465,0.00007101863,0.00014770545,5.217075e-8,0.00024394211,0.60272115],"genre_scores_gemma":[0.9833829,0.00016886904,0.008428575,0.0037718108,0.000011289458,0.00001089093,1.238269e-7,0.0000017039825,0.0042238706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996392,0.00006149424,0.000056630535,0.00008621057,0.00008225027,0.00007420926],"domain_scores_gemma":[0.9992873,0.00015640642,0.0000131112465,0.00049232243,0.000031124244,0.00001970702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001252647,0.000037703707,0.00003067337,0.000015077037,0.00029562382,0.000029105435,0.0006964386,0.00000852148,0.00013261469],"category_scores_gemma":[0.000017104105,0.000020582554,0.000018537194,0.00019427699,0.000027941698,0.00007713495,0.00016765347,0.00007119164,0.00023643374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.5673577e-7,0.000011186898,0.000033608583,1.19075324e-7,0.0000013463617,6.55735e-7,0.0002920004,0.000024531335,0.00003459436,0.95898676,0.03278714,0.007827803],"study_design_scores_gemma":[0.00056194526,0.00026160362,0.008817672,0.000045467026,0.0000019377333,0.00007402337,0.00006463276,0.29991072,0.004915489,0.03043121,0.6543679,0.0005473571],"about_ca_topic_score_codex":9.900529e-7,"about_ca_topic_score_gemma":0.000004549777,"teacher_disagreement_score":0.97580177,"about_ca_system_score_codex":0.0000056410636,"about_ca_system_score_gemma":0.000017852439,"threshold_uncertainty_score":0.30389562},"labels":[],"label_agreement":null},{"id":"W2170946417","doi":"10.1155/2012/636159","title":"Robust Nash Dynamic Game Strategy for User Cooperation Energy Efficiency in Wireless Cellular Networks","year":2012,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Relay; Computer science; Game theory; Nash equilibrium; Wireless; Stochastic game; Efficient energy use; Computer network; Perfect information; Base station; Wireless network; Non-cooperative game; Distributed computing; Mathematical optimization; Telecommunications; Engineering","score_opus":0.03179220572550204,"score_gpt":0.2406289481041166,"score_spread":0.20883674237861458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170946417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009033912,0.0007464452,0.9893848,0.00006886005,0.00013102616,0.00031589158,3.27053e-7,0.00010583939,0.00021290561],"genre_scores_gemma":[0.98602885,0.00013164654,0.013482201,0.000030797535,0.000037721136,0.00018930186,0.0000064496526,0.00002245741,0.00007057921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986413,0.00005729633,0.00044937813,0.00022981317,0.00012522908,0.0004969687],"domain_scores_gemma":[0.9991668,0.00025543218,0.00004866235,0.0003962632,0.00004641654,0.00008646306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000736215,0.00018145567,0.00024254339,0.00015593963,0.000048508085,0.00010774093,0.000527451,0.00009919413,0.000009790433],"category_scores_gemma":[0.000059091726,0.00017621552,0.000042190986,0.00058879174,0.000019268497,0.00043946458,0.0001752759,0.00022355866,0.0000044009043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.9087884e-7,0.00010720523,0.00003434752,0.00005186288,0.0000028947659,4.816243e-7,0.00031433924,0.7744401,0.0011516563,0.22072917,0.000007887983,0.003159344],"study_design_scores_gemma":[0.00029554305,0.000023744122,0.00005464981,0.00018938928,0.0000019218014,0.0000030356193,0.000008585539,0.99814785,0.00024663578,0.0006257309,0.00019147006,0.00021145366],"about_ca_topic_score_codex":0.0000021076323,"about_ca_topic_score_gemma":0.000019964069,"teacher_disagreement_score":0.97699493,"about_ca_system_score_codex":0.00012258442,"about_ca_system_score_gemma":0.000019066307,"threshold_uncertainty_score":0.718586},"labels":[],"label_agreement":null},{"id":"W2170965120","doi":"10.1109/icc.2011.5963419","title":"Statistical Modeling of the Physical-Layer Network Coding in Time-Varying Two-Way Relay Channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Linear network coding; Fading; Relay; Computer science; Physical layer; Decoding methods; Multipath propagation; Coding (social sciences); Wireless; Relay channel; Channel (broadcasting); Electronic engineering; Computer network; Algorithm; Telecommunications; Engineering; Mathematics; Physics; Statistics","score_opus":0.08524371334425213,"score_gpt":0.29424782276809713,"score_spread":0.209004109423845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170965120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05449302,0.00007788641,0.9255699,0.00019973339,0.00018253605,0.0001719812,4.828205e-7,0.00006624656,0.01923823],"genre_scores_gemma":[0.96983474,0.000034737037,0.029633466,0.00023199705,0.000061071165,0.000010085188,6.0559336e-7,0.000008099869,0.0001852061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987648,0.00024057571,0.00028227348,0.00023920747,0.00020342055,0.00026971594],"domain_scores_gemma":[0.9989106,0.00021639054,0.00007188751,0.0006737539,0.00007623769,0.000051150026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051465153,0.00011598989,0.00019136496,0.000043279473,0.00016100061,0.000048220525,0.0012254146,0.000028618982,0.000073637944],"category_scores_gemma":[0.00004872428,0.00008262132,0.000052401294,0.0005657451,0.000048778456,0.000232436,0.00088309025,0.00023589164,0.000028577071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015906502,0.00016623104,0.0023813476,0.0000089787345,0.000023598783,0.0000033760782,0.006286015,0.2457049,0.0017819672,0.7291689,0.0004731305,0.0139856525],"study_design_scores_gemma":[0.00020696477,0.000016126167,0.00046618737,0.00007402191,0.0000030641586,0.0000014413297,0.000008055737,0.9937567,0.00086379156,0.0044654356,0.000027989421,0.000110226094],"about_ca_topic_score_codex":0.000030157145,"about_ca_topic_score_gemma":0.000016217484,"teacher_disagreement_score":0.91534173,"about_ca_system_score_codex":0.000029112687,"about_ca_system_score_gemma":0.000031354048,"threshold_uncertainty_score":0.33691996},"labels":[],"label_agreement":null},{"id":"W2170974177","doi":"10.1109/glocom.2005.1578445","title":"GSECps: a diversity technique with improved performance-complexity tradeoff","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Fading; Rayleigh fading; Diversity combining; Signal-to-noise ratio (imaging); Selection (genetic algorithm); Computational complexity theory; Diversity scheme; Diversity (politics); Algorithm; Performance improvement; Scheme (mathematics); Diversity gain; Cooperative diversity; Telecommunications; Mathematics; Decoding methods; Engineering; Artificial intelligence","score_opus":0.05732486372260757,"score_gpt":0.2757730914047872,"score_spread":0.2184482276821796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170974177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062570706,0.0009453404,0.8147247,0.021792978,0.00041744168,0.0024715948,0.0001345175,0.0019820642,0.09496067],"genre_scores_gemma":[0.82710963,0.0020165606,0.16916004,0.0009629783,0.00007045785,0.00019618827,0.000053058728,0.000015973184,0.0004151064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674183,0.0004778769,0.0006901973,0.00074417505,0.00044161847,0.0009042905],"domain_scores_gemma":[0.994516,0.0001227157,0.0003691428,0.0040345388,0.00058019767,0.00037736085],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00069592753,0.0005323736,0.00052542594,0.00019370213,0.0022188923,0.00044800862,0.006749192,0.00019228409,0.00021354611],"category_scores_gemma":[0.000033632346,0.0005070066,0.00016446589,0.0013930962,0.00052494433,0.0015026915,0.0025922991,0.00078965083,0.00019966748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016344298,0.0023816568,0.008480408,0.00006553145,0.00042859683,0.000010363051,0.002243872,0.0009983535,0.0017171144,0.21237606,0.038743954,0.73239064],"study_design_scores_gemma":[0.0046400465,0.00096295873,0.057548188,0.0004426835,0.00015526582,0.0006213507,0.00028107406,0.52269995,0.0047134785,0.0040203137,0.40048608,0.0034285763],"about_ca_topic_score_codex":0.00017164835,"about_ca_topic_score_gemma":0.0037699915,"teacher_disagreement_score":0.76453894,"about_ca_system_score_codex":0.00068511756,"about_ca_system_score_gemma":0.00055850967,"threshold_uncertainty_score":0.99973816},"labels":[],"label_agreement":null},{"id":"W2171047480","doi":"10.1109/ccece.2006.277717","title":"Analytical Modeling of Interference in Cellular Fixed Relay Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Telecommunications link; Interference (communication); Simple (philosophy); Monte Carlo method; Cellular network; Context (archaeology); Topology (electrical circuits); Channel (broadcasting); Mathematics; Computer network; Physics","score_opus":0.039207588925089715,"score_gpt":0.26243830021551035,"score_spread":0.22323071129042063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171047480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03076588,0.00026565557,0.956031,0.000294242,0.00004486644,0.00004719807,5.3440406e-8,0.000038736096,0.012512343],"genre_scores_gemma":[0.9858691,0.00007330251,0.01369683,0.00006449173,0.000017641447,0.0000026597593,0.0000014502873,0.0000028326579,0.0002716947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992308,0.00008342306,0.0002926729,0.00017037475,0.00007849903,0.00014420635],"domain_scores_gemma":[0.9993415,0.00007594896,0.000035532747,0.00045091953,0.00007042158,0.000025673535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002708328,0.00006944204,0.00012730907,0.000086229986,0.000033122822,0.00003654481,0.0006443086,0.000038248654,0.000030538024],"category_scores_gemma":[0.000015889895,0.000061952334,0.00003431017,0.00048248968,0.00002384592,0.00015372952,0.00031321615,0.00014621939,0.0000048133493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036117735,0.00006527843,0.002394894,0.0000022455224,0.0000030706933,0.0000025772274,0.000100357836,0.5506767,0.00039898968,0.43966833,0.00023958406,0.006444355],"study_design_scores_gemma":[0.00012140533,0.00001383404,0.0002762632,0.000027135755,9.5318495e-7,5.4404535e-7,0.0000070397373,0.998604,0.00026760742,0.0005554911,0.000053956734,0.00007176121],"about_ca_topic_score_codex":0.00004524094,"about_ca_topic_score_gemma":0.00015296556,"teacher_disagreement_score":0.9551032,"about_ca_system_score_codex":0.000023257868,"about_ca_system_score_gemma":0.0000201226,"threshold_uncertainty_score":0.2526343},"labels":[],"label_agreement":null},{"id":"W2171256801","doi":"10.1109/twc.2009.081187","title":"Performance analysis of soft-bit maximal ratio combining in cooperative 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":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Maximal-ratio combining; Relay; Bit error rate; Upper and lower bounds; Modulation (music); Computer science; Cooperative diversity; Topology (electrical circuits); Channel (broadcasting); Telecommunications; Signal-to-noise ratio (imaging); Diversity combining; Algorithm; Antenna diversity; Mathematics; Fading; Wireless; Physics; Combinatorics","score_opus":0.03476783630864365,"score_gpt":0.2812846776390366,"score_spread":0.24651684133039292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171256801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05527564,0.00028081724,0.94090754,0.001708272,0.00009217616,0.00027265368,0.0000064349183,0.00013348508,0.0013229646],"genre_scores_gemma":[0.98992693,0.0033437943,0.0061192573,0.00037582632,0.0000057578995,0.00007621185,0.000020293544,0.0000107202,0.000121203935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979242,0.00050167344,0.0007053605,0.00034293925,0.00023619561,0.00028962467],"domain_scores_gemma":[0.9959692,0.00054736435,0.00021525675,0.002882599,0.00029635103,0.0000892695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005048833,0.00022609954,0.00046607316,0.0007798266,0.00066859764,0.00009773242,0.0024493947,0.000111962116,0.000031361582],"category_scores_gemma":[0.000009357543,0.000241279,0.00017890504,0.004601259,0.00018083466,0.0006283918,0.000030261675,0.00072407967,0.00000977774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023831946,0.000671287,0.000431386,0.0000027320696,0.0001822059,6.8366467e-7,0.001765666,0.8543611,0.00071600766,0.016080974,0.000022437884,0.12574165],"study_design_scores_gemma":[0.0004359036,0.00015722762,0.007602782,0.00007955216,0.00009046539,0.0000018661302,0.00007063818,0.9899981,0.0011992551,0.000017832117,0.00011129196,0.00023506547],"about_ca_topic_score_codex":0.000018417675,"about_ca_topic_score_gemma":0.00051714387,"teacher_disagreement_score":0.9347883,"about_ca_system_score_codex":0.00012880343,"about_ca_system_score_gemma":0.00010345982,"threshold_uncertainty_score":0.9839072},"labels":[],"label_agreement":null},{"id":"W2171323387","doi":"10.1109/tcomm.2010.080310.090066","title":"Bypassing Orthogonal Relaying Transmissions via Spatial Signal Separation","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Space-division multiple access; Computer science; Spectral efficiency; Antenna diversity; Coding (social sciences); MIMO; Topology (electrical circuits); Relay; Electronic engineering; Algorithm; Antenna (radio); Mathematics; Telecommunications; Base station; Engineering; Channel (broadcasting); Electrical engineering; Statistics; Physics","score_opus":0.04214836407210019,"score_gpt":0.31640642984982165,"score_spread":0.27425806577772144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171323387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022479966,0.000104248706,0.9845788,0.006779759,0.0005499312,0.0002927208,0.000009670005,0.0004264315,0.0050104284],"genre_scores_gemma":[0.9311612,0.00043122267,0.06746781,0.00039047722,0.000047465775,0.00013873595,0.00001569926,0.000022697785,0.00032467867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981338,0.00037558487,0.00048781125,0.00038236505,0.0003140725,0.00030640772],"domain_scores_gemma":[0.9957855,0.00056206936,0.00013571739,0.003064248,0.00024518056,0.00020733234],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004409791,0.00023777614,0.00019774353,0.00027244748,0.002470144,0.0002627886,0.0025123688,0.00015393221,0.00030263196],"category_scores_gemma":[0.0000112504595,0.00024789604,0.00017798445,0.0008108695,0.00021220233,0.00073524436,0.000030495547,0.0014193368,0.00014814822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016814563,0.000746449,0.000029772134,0.0000053877816,0.00006252863,0.0000016579927,0.0016556693,0.003756363,0.1379084,0.028521048,0.0002671591,0.82702875],"study_design_scores_gemma":[0.0007134018,0.000112168505,0.0006793765,0.000067129964,0.000045124594,0.00004909528,0.0000423714,0.94266784,0.020458952,0.0017046874,0.03287612,0.0005837292],"about_ca_topic_score_codex":0.000029246658,"about_ca_topic_score_gemma":0.0012249006,"teacher_disagreement_score":0.9389115,"about_ca_system_score_codex":0.00006242985,"about_ca_system_score_gemma":0.00020107043,"threshold_uncertainty_score":0.9999973},"labels":[],"label_agreement":null},{"id":"W2171376673","doi":"10.1109/isccsp.2004.1296241","title":"Scan and wait combining (SWC): a switch and examine strategy with a performance-delay tradeoff","year":2004,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Channel (broadcasting); Path (computing); Coherence (philosophical gambling strategy); Quality (philosophy); Transmission (telecommunications); Outage probability; Algorithm; Real-time computing; Statistics; Telecommunications; Mathematics; Computer network; Fading","score_opus":0.0302608597647541,"score_gpt":0.23835771658475394,"score_spread":0.20809685681999984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171376673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92792726,0.0005048504,0.06153253,0.00156246,0.000019329109,0.00013362264,1.7377094e-7,0.00011608459,0.008203691],"genre_scores_gemma":[0.9890544,0.0008138335,0.009541679,0.00030755365,0.000011438067,0.000008887196,9.407237e-7,0.0000061289643,0.0002551419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999318,0.000028996215,0.00012753088,0.00023890867,0.0001093631,0.00017720666],"domain_scores_gemma":[0.9994738,0.00004043467,0.00003517971,0.00030961272,0.000044079286,0.000096869924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016022392,0.00011724946,0.00012485191,0.00005746863,0.00023813605,0.00020073145,0.00027561828,0.00003656862,0.0000126737505],"category_scores_gemma":[0.0000034407465,0.000087120694,0.000008366502,0.0002680362,0.00007556823,0.00044138878,0.00018508827,0.00017869349,0.000002818898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035475012,0.0001549768,0.009286303,0.000032426775,0.00005344379,0.00002028122,0.0060356893,0.0015296519,0.0019647516,0.25072008,0.00013542797,0.7300315],"study_design_scores_gemma":[0.011133846,0.003996997,0.23498583,0.00063038844,0.000037992533,0.0010574255,0.0011613753,0.73301,0.004987103,0.001655745,0.00563192,0.0017113991],"about_ca_topic_score_codex":0.000016506157,"about_ca_topic_score_gemma":0.00017173053,"teacher_disagreement_score":0.7314803,"about_ca_system_score_codex":0.000020111062,"about_ca_system_score_gemma":0.000058868267,"threshold_uncertainty_score":0.35526788},"labels":[],"label_agreement":null},{"id":"W2171377712","doi":"10.1109/spawc.2009.5161839","title":"Node selection for sidelobe control in collaborative beamforming for wireless sensor networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Beamforming; Node (physics); Interference (communication); Wireless sensor network; Computer science; Computer network; Channel (broadcasting); Base station; Selection (genetic algorithm); Wireless; Wireless network; Limiting; Telecommunications; Engineering; Artificial intelligence","score_opus":0.01862399568861381,"score_gpt":0.2831878315259284,"score_spread":0.2645638358373146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171377712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018755861,0.00011356911,0.99243206,0.0037098206,0.00010783208,0.00099991,0.0000020553175,0.0001155627,0.00064358837],"genre_scores_gemma":[0.8452332,0.00009293766,0.15120322,0.0029512146,0.00009027127,0.000162692,0.000006081532,0.0000066680577,0.00025369122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902743,0.000072166484,0.0002692417,0.00026490667,0.000075551405,0.00029069243],"domain_scores_gemma":[0.9988177,0.00042511444,0.00008553016,0.00023649806,0.00038452836,0.000050643437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041381308,0.00012535916,0.00019920664,0.00009129826,0.0002571182,0.00013029118,0.00036306598,0.00006494364,0.0000032664668],"category_scores_gemma":[0.000059860435,0.00011734313,0.000051877938,0.00065035885,0.00001381339,0.00037001006,0.000032136228,0.00009958708,0.0000012940819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026360308,0.00023668846,0.0006751957,0.000012956247,0.00004293276,7.254352e-7,0.0015189572,0.12921512,0.009099126,0.49193996,0.007131494,0.35986325],"study_design_scores_gemma":[0.001446001,0.00016495092,0.0002430334,0.00002073436,0.0000034834352,0.0000015354286,0.00005416193,0.9911376,0.00091135164,0.0006402175,0.0052185487,0.00015833051],"about_ca_topic_score_codex":0.0000032463754,"about_ca_topic_score_gemma":0.00024103024,"teacher_disagreement_score":0.8619225,"about_ca_system_score_codex":0.000091705806,"about_ca_system_score_gemma":0.000074110285,"threshold_uncertainty_score":0.4785114},"labels":[],"label_agreement":null},{"id":"W2171446212","doi":"10.1109/tnet.2015.2448597","title":"Performance Analysis of Network-Coding-Based P2P Live Streaming Systems","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Linear network coding; Coding (social sciences); Scalability; Multiple description coding; Distributed computing; Redundancy (engineering); Computer network; Video on demand; Real-time computing; Network packet","score_opus":0.07365480834146866,"score_gpt":0.28159692257043467,"score_spread":0.20794211422896602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171446212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022705715,0.00087598525,0.973008,0.00016038671,0.0017434452,0.00023904358,0.000003723185,0.00023988682,0.0010238125],"genre_scores_gemma":[0.99079096,0.00053618156,0.008118027,0.00014739316,0.00022343197,0.000046282745,0.000008107182,0.000020002,0.00010962508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770737,0.0003235074,0.00058320817,0.0004572464,0.00046103733,0.00046765836],"domain_scores_gemma":[0.9970706,0.00052488083,0.0002989938,0.0015828033,0.00032900614,0.00019368964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009317331,0.00026361243,0.00049796427,0.00048137637,0.00045076568,0.00017181515,0.0014226667,0.00010850597,0.000015889123],"category_scores_gemma":[0.000015519096,0.00026662604,0.0002331473,0.00341867,0.00007157979,0.00035407208,0.00003375861,0.00037132314,0.000016671582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019530293,0.00007298739,0.0015650061,0.000010903575,0.00029352197,0.0000019705415,0.00052312907,0.93476576,0.0000285008,0.00028501125,0.0001404571,0.06229324],"study_design_scores_gemma":[0.00037851545,0.00013977799,0.00074526214,0.00025541103,0.00023283772,0.0000023499274,0.00006739492,0.995922,0.00016460485,0.000018958226,0.0018013323,0.00027152165],"about_ca_topic_score_codex":0.00003630379,"about_ca_topic_score_gemma":0.00015154065,"teacher_disagreement_score":0.9680852,"about_ca_system_score_codex":0.0001763258,"about_ca_system_score_gemma":0.00014456658,"threshold_uncertainty_score":0.9999786},"labels":[],"label_agreement":null},{"id":"W2171467140","doi":"10.1109/icc.2012.6364392","title":"Robust power allocation designs for cognitive radio networks with cooperative relays","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Interference (communication); Mathematical optimization; Robust optimization; Channel (broadcasting); Convex optimization; Optimization problem; Resource allocation; Power (physics); Regular polygon; Computer network; Wireless; Telecommunications; Mathematics; Algorithm","score_opus":0.08635935364202768,"score_gpt":0.2820489199888149,"score_spread":0.1956895663467872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171467140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091585354,0.000754958,0.9886356,0.0007002677,0.00017727299,0.0007908584,9.592197e-7,0.00015164894,0.007872575],"genre_scores_gemma":[0.9179572,0.00014680078,0.07947339,0.0009423199,0.000098830984,0.00025249363,0.000017655353,0.00001445893,0.001096857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989299,0.0001637618,0.00017811263,0.00025018654,0.00012238292,0.00035564555],"domain_scores_gemma":[0.99844104,0.0004805641,0.000076574855,0.00039281114,0.00047248404,0.00013650952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004886945,0.00016083813,0.00015157765,0.000056356243,0.00037003995,0.00014061568,0.00044188034,0.000058592897,0.00007964794],"category_scores_gemma":[0.00006599422,0.00012264198,0.000038020415,0.0004389312,0.000063947795,0.00091572205,0.00013170687,0.00014596593,0.000024560584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020245589,0.0005810522,0.0039988672,0.000009836232,0.0002651456,0.0000017795875,0.009824542,0.03190587,0.00040734044,0.8781891,0.02132444,0.053289555],"study_design_scores_gemma":[0.002671406,0.0008907328,0.007502945,0.00015701959,0.000052426687,0.000042721942,0.00074525544,0.96599907,0.0030545034,0.00008758977,0.017808933,0.000987381],"about_ca_topic_score_codex":0.0000015289928,"about_ca_topic_score_gemma":0.000023489107,"teacher_disagreement_score":0.93409324,"about_ca_system_score_codex":0.000055299934,"about_ca_system_score_gemma":0.00006309052,"threshold_uncertainty_score":0.5001195},"labels":[],"label_agreement":null},{"id":"W2171685173","doi":"10.1109/glocom.2012.6504036","title":"Improving throughput by fine-grained channel allocation in cooperative wireless networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Relay; Throughput; Channel (broadcasting); Node (physics); Channel allocation schemes; Wireless network; Wireless; Cooperative diversity; Antenna diversity; Diversity gain; Cognitive radio; Transmission (telecommunications); Relay channel; Distributed computing; Fading; Telecommunications; Engineering","score_opus":0.02676011794822166,"score_gpt":0.2648551014447135,"score_spread":0.23809498349649186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171685173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008995598,0.0012604631,0.9845146,0.0018709685,0.0002792536,0.0002632852,5.3395075e-7,0.00015667168,0.0026586503],"genre_scores_gemma":[0.99477863,0.0003133274,0.0029729065,0.000985229,0.00010525804,0.000060451315,0.000018302342,0.000010671284,0.00075523404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998701,0.00020843257,0.00027493847,0.0002651068,0.00013334249,0.00041719808],"domain_scores_gemma":[0.99900913,0.0001430445,0.00008054587,0.00054087065,0.00012257622,0.00010384538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057286274,0.00016381344,0.00017068269,0.00007101864,0.00019142104,0.00012884532,0.000709109,0.00007202642,0.000032483436],"category_scores_gemma":[0.000044211647,0.00014663771,0.000032204516,0.0007202412,0.00003865971,0.0010937987,0.0004090239,0.00022641916,0.000025640371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023218648,0.00074287795,0.0031113324,0.000018242788,0.000046886234,0.0000022860877,0.009549863,0.0064518945,0.0130758155,0.5175364,0.030483434,0.41895777],"study_design_scores_gemma":[0.00042571366,0.000034432116,0.00079233234,0.000023542038,0.0000019015579,0.000002657267,0.00008440486,0.9942987,0.0024732621,0.00004347351,0.0015589894,0.0002605955],"about_ca_topic_score_codex":0.00004576846,"about_ca_topic_score_gemma":0.00024904098,"teacher_disagreement_score":0.9878468,"about_ca_system_score_codex":0.00008634274,"about_ca_system_score_gemma":0.000036768186,"threshold_uncertainty_score":0.5979712},"labels":[],"label_agreement":null},{"id":"W2171740747","doi":"10.1109/infcom.2009.5061937","title":"On the Market Power of Network Coding in P2P Content Distribution Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Stochastic game; Computer science; Coding (social sciences); Market power; Maximization; Microeconomics; Scheduling (production processes); Mathematical optimization; Economics; Computer network; Mathematics","score_opus":0.05183911819873497,"score_gpt":0.2586263234814371,"score_spread":0.20678720528270214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171740747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036425352,0.00096380553,0.8840801,0.010295523,0.00047021825,0.0005291008,0.0000022018025,0.000100570665,0.067133114],"genre_scores_gemma":[0.9987663,0.00012543196,0.0001988151,0.00056424405,0.000013443856,0.000005459193,0.0000017134148,0.0000012895065,0.0003233169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991956,0.00022156791,0.00020850175,0.00011513664,0.00012233497,0.00013689822],"domain_scores_gemma":[0.9990503,0.00032348125,0.00006646205,0.00046687358,0.00007034488,0.000022548315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007409203,0.0000638048,0.00010420125,0.000019776437,0.00008767168,0.00007611657,0.0005383826,0.000022216964,0.000038364466],"category_scores_gemma":[0.000068652414,0.000040645387,0.000028375478,0.00035810997,0.000017910716,0.00008829121,0.00009185134,0.00010211138,0.0000053389494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060151074,0.000029783781,0.00020550456,7.531788e-7,0.0000025092017,5.2328465e-7,0.00009424972,0.0006212911,0.00010795314,0.98070574,0.015464703,0.0027609575],"study_design_scores_gemma":[0.00074284844,0.00037373972,0.09540686,0.0005728629,0.0000035167348,0.000006674551,0.00023484719,0.8816379,0.00059270643,0.004331916,0.015755182,0.00034097358],"about_ca_topic_score_codex":0.0000047551816,"about_ca_topic_score_gemma":0.000007354019,"teacher_disagreement_score":0.97637385,"about_ca_system_score_codex":0.000044174805,"about_ca_system_score_gemma":0.000013487725,"threshold_uncertainty_score":0.16574708},"labels":[],"label_agreement":null},{"id":"W2171848435","doi":"10.1109/glocom.2010.5683386","title":"Estimation, Training, and Effect of Timing Offsets in Distributed Cooperative Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Estimator; Computer science; Relay; Cramér–Rao bound; Synchronization (alternating current); Upper and lower bounds; Algorithm; Sequence (biology); Computational complexity theory; Interference (communication); Offset (computer science); Estimation; Real-time computing; Estimation theory; Channel (broadcasting); Telecommunications; Statistics; Mathematics; Engineering","score_opus":0.023783105139269223,"score_gpt":0.2897666608812662,"score_spread":0.26598355574199695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171848435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25481734,0.00008281231,0.7434516,0.00040405494,0.00009578341,0.00016400364,8.251559e-7,0.000049385708,0.0009342132],"genre_scores_gemma":[0.99152845,0.000045072476,0.008312038,0.000056789668,0.000009760216,0.0000117720565,0.000008778517,0.0000029677888,0.000024386161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993328,0.00013152832,0.00019081867,0.00015715486,0.00006852148,0.000119186996],"domain_scores_gemma":[0.9991663,0.00038720254,0.000053790347,0.00028616205,0.000061239385,0.000045299967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005123871,0.000085828164,0.000162469,0.0000594231,0.00008285211,0.000055738677,0.00030179063,0.000044896573,0.000023323553],"category_scores_gemma":[0.00017257902,0.00006906894,0.00001566454,0.00037587088,0.00006420389,0.00023519353,0.00017293607,0.00020675657,0.0000013726636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015764614,0.00006329595,0.01531518,0.000015462381,0.000020271566,0.0000035686044,0.0034370953,0.012589483,0.0030590098,0.19113924,0.00064084615,0.7737008],"study_design_scores_gemma":[0.00036672768,0.00006784482,0.0107614705,0.000023650262,0.0000016679187,0.0000046710334,0.000010739483,0.9870694,0.0013558229,0.00006180619,0.00019728589,0.000078895864],"about_ca_topic_score_codex":0.000006820694,"about_ca_topic_score_gemma":0.00017486776,"teacher_disagreement_score":0.9744799,"about_ca_system_score_codex":0.000007642933,"about_ca_system_score_gemma":0.000023568831,"threshold_uncertainty_score":0.28165498},"labels":[],"label_agreement":null},{"id":"W2171905704","doi":"10.1109/wcnc.2009.4917874","title":"Outage Analysis of Wireless Systems over Composite Fading/Shadowing Channels with Co-Channel Interference","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Interference (communication); Nakagami distribution; Co-channel interference; Channel (broadcasting); Computer science; Outage probability; Probability density function; Shadow mapping; Wireless; Fading distribution; Electronic engineering; Topology (electrical circuits); Telecommunications; Rayleigh fading; Mathematics; Statistics; Engineering; Electrical engineering","score_opus":0.035404513153236915,"score_gpt":0.2880102394554204,"score_spread":0.25260572630218353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171905704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1359914,0.00022339053,0.85752827,0.000230331,0.000091782094,0.00014367979,0.0000023254013,0.00012708617,0.005661755],"genre_scores_gemma":[0.9982761,0.0000801921,0.0009590936,0.00029484977,0.000016824188,0.000005681228,0.000007978655,0.000004803278,0.00035445977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987745,0.000121521996,0.00032576715,0.0003188337,0.00024001455,0.00021930577],"domain_scores_gemma":[0.99870014,0.00010877787,0.00015979623,0.0007571916,0.00019009413,0.00008399914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028628617,0.00016375663,0.0004085945,0.00039081395,0.00014062414,0.00022000479,0.0010568606,0.000041288324,0.000020578085],"category_scores_gemma":[0.000006032874,0.00012821644,0.00009323565,0.001578028,0.000041171992,0.00040543632,0.00016351142,0.000134954,0.000005450722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019069617,0.0009415991,0.01588078,0.000100737896,0.0036094913,0.000059603295,0.02658088,0.27731463,0.04482463,0.5706676,0.001319669,0.058509633],"study_design_scores_gemma":[0.00023505677,0.00015288562,0.0052894223,0.00012055009,0.00006270233,0.000003267563,0.00009407801,0.99197674,0.0017416324,0.000029253079,0.00008679761,0.00020762892],"about_ca_topic_score_codex":0.000029159315,"about_ca_topic_score_gemma":0.000027223377,"teacher_disagreement_score":0.8622847,"about_ca_system_score_codex":0.000041379375,"about_ca_system_score_gemma":0.00002194909,"threshold_uncertainty_score":0.52285147},"labels":[],"label_agreement":null},{"id":"W2171940859","doi":"10.1109/tit.2011.2165794","title":"Cooperative Diversity With Mobile Nodes: Capacity Outage Rate and Duration","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cooperative diversity; Rayleigh fading; Diversity gain; Computer science; Fading; Signal-to-noise ratio (imaging); Diversity combining; Outage probability; Mathematics; Channel (broadcasting); Logarithm; Topology (electrical circuits); Statistics; Telecommunications","score_opus":0.032222188495190485,"score_gpt":0.21865799383427495,"score_spread":0.18643580533908446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171940859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052551154,0.000009894387,0.9426449,0.000047064572,0.00011675728,0.0002625601,0.000009217674,0.00014516954,0.004213277],"genre_scores_gemma":[0.9949766,0.0001315391,0.0041677356,0.00053109106,0.000004398296,0.000054281954,0.0000026594907,0.0000033829133,0.00012835971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992115,0.00021681724,0.00020531911,0.0001238266,0.00012242637,0.00012013685],"domain_scores_gemma":[0.99918,0.0001061801,0.00009986556,0.00034474264,0.00020111381,0.000068075424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046344718,0.00012469232,0.00010136905,0.00013871446,0.0008631489,0.0001115123,0.000291596,0.000045506484,0.00010964436],"category_scores_gemma":[0.000005960611,0.00010371671,0.000026756805,0.00027632958,0.00011491994,0.0028696666,0.000014041318,0.00018682938,0.00006264844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066520995,0.0004369886,0.00018603385,0.000059587852,0.00023258792,0.0000032990229,0.25054157,0.01257,0.0005530509,0.40401238,0.00015964513,0.33057964],"study_design_scores_gemma":[0.013426533,0.0051877997,0.019743335,0.0005872943,0.00030050438,0.00021762976,0.020816514,0.60981727,0.294417,0.020987421,0.009811046,0.004687638],"about_ca_topic_score_codex":0.000009907501,"about_ca_topic_score_gemma":0.000025964437,"teacher_disagreement_score":0.9424254,"about_ca_system_score_codex":0.00004536943,"about_ca_system_score_gemma":0.00003080303,"threshold_uncertainty_score":0.6638731},"labels":[],"label_agreement":null},{"id":"W2172080133","doi":"10.1109/vetecf.2007.250","title":"Optimum Power Allocation for Fading Relay Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Transmitter power output; Broadcasting (networking); Transmission (telecommunications); Fading; MIMO; Power (physics); Key (lock); Relay channel; Computer network; Electronic engineering; Telecommunications; Engineering; Channel (broadcasting); Transmitter","score_opus":0.03624387971234087,"score_gpt":0.2892722492453604,"score_spread":0.2530283695330195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172080133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04017623,0.00035811216,0.95075107,0.006477535,0.0005402752,0.0003588515,5.9094145e-7,0.00055640796,0.00078095583],"genre_scores_gemma":[0.94686645,0.00014024618,0.052202865,0.00043690327,0.00003226022,0.00006886897,0.000003280394,0.000011174816,0.00023795685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986985,0.00003734884,0.0002920362,0.00042928464,0.0001376471,0.00040522072],"domain_scores_gemma":[0.998262,0.0001271359,0.00012146679,0.000954777,0.00046941504,0.00006518901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074963085,0.00016622021,0.00018669027,0.00036628955,0.00030166862,0.000100855286,0.0014908976,0.00025091323,0.000011351282],"category_scores_gemma":[0.00013030096,0.00016728425,0.00006042412,0.00080650457,0.00013127642,0.00027601462,0.0002304819,0.00028862062,0.000041230654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008886408,0.00007012425,0.00013532306,0.000008219415,0.000038043672,0.00001200413,0.00057370623,0.00057729974,0.09666848,0.7634807,0.0007416016,0.13768561],"study_design_scores_gemma":[0.0014934478,0.0004963486,0.00038735213,0.00022086257,0.000023246781,0.00009733444,0.0002715515,0.43692386,0.40636426,0.02075963,0.13187672,0.0010853749],"about_ca_topic_score_codex":8.8422723e-7,"about_ca_topic_score_gemma":0.000009685096,"teacher_disagreement_score":0.90669024,"about_ca_system_score_codex":0.00006410498,"about_ca_system_score_gemma":0.00007505487,"threshold_uncertainty_score":0.6821653},"labels":[],"label_agreement":null},{"id":"W2172164537","doi":"10.1145/1143549.1143663","title":"Effective channel assignment in multi-hop W-CDMA cellular networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Channel (broadcasting); Throughput; Hop (telecommunications); Channel allocation schemes; Code division multiple access; Spread spectrum; Flexibility (engineering); Wireless; Telecommunications; Mathematics","score_opus":0.026213391699672742,"score_gpt":0.25735993193892404,"score_spread":0.2311465402392513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172164537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026655118,0.0007032885,0.9890987,0.0005750642,0.00018983179,0.00032487148,1.3201499e-7,0.00012658912,0.006316002],"genre_scores_gemma":[0.9913836,0.00009800716,0.007038228,0.0003376133,0.000059356065,0.00007320379,0.000003522347,0.0000069862135,0.0009994684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889636,0.00022016038,0.00020519392,0.00029058056,0.00012321373,0.00026452076],"domain_scores_gemma":[0.99920106,0.00013838269,0.000048314178,0.0005148169,0.000051090494,0.00004632222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037434604,0.00012939151,0.00014057038,0.00009201697,0.00011939606,0.000101433,0.00063680066,0.00005352317,0.000027928158],"category_scores_gemma":[0.0000109453185,0.00011463209,0.000043342035,0.00048416085,0.000026846903,0.0002185401,0.0003901656,0.00017893754,0.00003981244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023644572,0.0016765627,0.007757515,0.000016720513,0.000048649094,0.000088049695,0.0019255641,0.29440197,0.010156449,0.40594313,0.010583564,0.26737818],"study_design_scores_gemma":[0.00055585225,0.000030808573,0.009319172,0.000021652335,0.0000011723255,0.0000010591964,0.000012624183,0.9854123,0.0022489326,0.00027998709,0.0019432831,0.00017315909],"about_ca_topic_score_codex":0.000052609765,"about_ca_topic_score_gemma":0.0003067308,"teacher_disagreement_score":0.9887181,"about_ca_system_score_codex":0.00009921432,"about_ca_system_score_gemma":0.00001437451,"threshold_uncertainty_score":0.4674561},"labels":[],"label_agreement":null},{"id":"W2172503700","doi":"10.1186/s13634-015-0273-3","title":"Systematic network coding for two-hop lossy transmissions","year":2015,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Computer science; Linear network coding; Lossy compression; Decoding methods; Network packet; Computer network; Coding (social sciences); Encoding (memory); Hop (telecommunications); Algorithm; Mathematics","score_opus":0.061365036794802576,"score_gpt":0.3522335494749885,"score_spread":0.29086851268018593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172503700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044911902,0.029967757,0.9655766,0.0008910689,0.00040328072,0.000344028,3.7846368e-7,0.00007551356,0.002292239],"genre_scores_gemma":[0.9437936,0.0010140642,0.053915672,0.0006986862,0.00041079003,0.00003997385,8.8846946e-7,0.0000217289,0.00010457825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977204,0.00040042438,0.00073234906,0.0002864863,0.00041962147,0.0004407171],"domain_scores_gemma":[0.9981087,0.0005891664,0.0004189778,0.00025819973,0.00035784784,0.00026711987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022016552,0.00021490818,0.00039545278,0.0001786238,0.00061642076,0.0005160396,0.0010975363,0.00004202887,0.0000069809275],"category_scores_gemma":[0.0002450391,0.00016983958,0.000097037904,0.0007972373,0.00004851123,0.0016898261,0.000087545086,0.0005169113,0.000008064462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023015065,0.00031170654,0.00041753572,0.0023686038,0.000041611853,0.00010149314,0.0055678003,0.35671252,0.0007812965,0.050238285,0.0010108233,0.58221817],"study_design_scores_gemma":[0.0029641108,0.00046302163,0.000032125732,0.024159525,0.00002508943,0.0003543449,0.0004942157,0.93635595,0.00042537707,0.0244068,0.009677359,0.0006420615],"about_ca_topic_score_codex":1.0702746e-7,"about_ca_topic_score_gemma":0.0000044688595,"teacher_disagreement_score":0.9433445,"about_ca_system_score_codex":0.00017454076,"about_ca_system_score_gemma":0.00022621968,"threshold_uncertainty_score":0.6925857},"labels":[],"label_agreement":null},{"id":"W2173327270","doi":"10.1109/tit.2008.2008131","title":"Parity Forwarding for Multiple-Relay Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Decodes; Computer science; Computer network; Parity (physics); Decoding methods; Telecommunications","score_opus":0.01993550998774262,"score_gpt":0.25861174214127597,"score_spread":0.23867623215353334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173327270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023390459,0.000042915668,0.9957091,0.0006784078,0.0005191151,0.00037608104,0.0000055176765,0.00029435407,0.002140568],"genre_scores_gemma":[0.9825569,0.00015505089,0.014719764,0.0023189313,0.000032013355,0.00007636568,0.0000073185925,0.0000042077445,0.0001294984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907845,0.00010550188,0.0003414881,0.00012358336,0.00013259219,0.0002184013],"domain_scores_gemma":[0.99868107,0.00046405828,0.00010953952,0.00050787075,0.00016183486,0.00007564717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006851703,0.00013317178,0.00012708192,0.0001687672,0.00061681046,0.00019565808,0.00052786514,0.00007937007,0.000022291963],"category_scores_gemma":[0.000026684853,0.00012802554,0.00012904059,0.00033534758,0.000026900716,0.0018799518,0.0000029190799,0.00022587163,0.00004452989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049922215,0.000046318364,0.0000013044703,0.000003779067,0.000015957623,6.579529e-8,0.0008601482,0.16466048,0.000030409281,0.12838162,0.00047122245,0.7054787],"study_design_scores_gemma":[0.00078348257,0.00014104292,0.00010955583,0.000030380521,0.000009959081,0.000004033674,0.00006590496,0.98192626,0.0021000365,0.0040230104,0.010591653,0.00021470206],"about_ca_topic_score_codex":4.942724e-7,"about_ca_topic_score_gemma":0.0000028490638,"teacher_disagreement_score":0.98232293,"about_ca_system_score_codex":0.00006719153,"about_ca_system_score_gemma":0.00003102227,"threshold_uncertainty_score":0.52207303},"labels":[],"label_agreement":null},{"id":"W2173579249","doi":"10.1007/978-3-540-69355-0_24","title":"Fast Radio Broadcasting with Advice","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Broadcasting (networking); Computer science; Advice (programming); Constant (computer programming); Radio broadcasting; Radio networks; Computer network; Broadcast communication network; Theoretical computer science; Telecommunications; Algorithm; Wireless network; Wireless","score_opus":0.027069239064189454,"score_gpt":0.2479054523564685,"score_spread":0.22083621329227904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173579249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041671625,0.001730016,0.98067397,0.00076623686,0.000519096,0.00027430672,0.0000011649878,0.00030635265,0.015687203],"genre_scores_gemma":[0.12699349,0.0015717507,0.86635154,0.0026051733,0.0006281729,0.000015823782,0.000006943629,0.0000663357,0.0017607824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678504,0.000055668253,0.00043567162,0.0012862812,0.0008335567,0.0006037813],"domain_scores_gemma":[0.99680454,0.00045733116,0.0002798848,0.001890442,0.00038245015,0.00018534482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005111363,0.00050968357,0.00047605165,0.00059420115,0.00062175654,0.00046134074,0.0041911225,0.0001791069,0.000024282908],"category_scores_gemma":[0.000055531633,0.0004322844,0.00008379034,0.0009647624,0.00074463093,0.00066682696,0.0017163983,0.0010198946,0.00004985827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049282817,0.000018822513,0.000051230578,0.000012069934,0.000010574575,0.00010496244,0.0015719013,0.028881202,0.00004272582,0.0055026943,0.00010220684,0.96369666],"study_design_scores_gemma":[0.0005059104,0.00026247368,0.00023654361,0.0009065155,0.00000733396,0.00062440993,2.7431307e-7,0.9740937,0.0003596962,0.002711397,0.019165725,0.0011260207],"about_ca_topic_score_codex":0.0000071893755,"about_ca_topic_score_gemma":0.000111036104,"teacher_disagreement_score":0.96257067,"about_ca_system_score_codex":0.00027312632,"about_ca_system_score_gemma":0.0006292887,"threshold_uncertainty_score":0.9998129},"labels":[],"label_agreement":null},{"id":"W2175517595","doi":"10.1109/tit.2013.2266656","title":"Joint Optimization of the Transmit Covariance and Relay Precoder in General Gaussian Amplify-and-Forward Relay Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Covariance; Transmitter power output; Gaussian; Asymptotically optimal algorithm; Control theory (sociology); Computer science; Optimization problem; Mathematics; Precoding; Mathematical optimization; Topology (electrical circuits); MIMO; Power (physics); Beamforming; Telecommunications; Channel (broadcasting); Statistics; Transmitter; Artificial intelligence; Physics","score_opus":0.015046071366985781,"score_gpt":0.2189897081310967,"score_spread":0.20394363676411092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175517595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006039539,0.000056600307,0.9910077,0.0013010626,0.0002041639,0.000406391,0.0000037670504,0.000041192314,0.00093959196],"genre_scores_gemma":[0.98141384,0.0006192751,0.016940784,0.00064829685,0.000007633807,0.00009988947,0.0000017133807,0.000005455334,0.00026312986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990107,0.00022087402,0.00039702686,0.0001132725,0.00013225652,0.00012591333],"domain_scores_gemma":[0.99930674,0.00010370437,0.00013140841,0.0003233547,0.000087708824,0.00004710753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004545559,0.000109672386,0.00012683126,0.00016412287,0.00021612225,0.00011587658,0.0002690492,0.00007406129,0.00007517562],"category_scores_gemma":[0.000010936997,0.00008428792,0.000038922506,0.00035538088,0.00008586946,0.0016330893,0.000008062602,0.0002340555,0.000011473963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015715264,0.000035622194,0.000008955038,0.000022731781,0.000016378954,4.3261316e-8,0.0069732135,0.85487056,0.00017073628,0.04883097,0.00006401308,0.088991076],"study_design_scores_gemma":[0.00060804316,0.000047395435,0.0012013735,0.00008930458,0.000007510105,0.000008911428,0.00014093377,0.9929386,0.0027241644,0.0016055246,0.0004756313,0.0001526574],"about_ca_topic_score_codex":0.000012582543,"about_ca_topic_score_gemma":0.000008651492,"teacher_disagreement_score":0.9753743,"about_ca_system_score_codex":0.000034086715,"about_ca_system_score_gemma":0.000033275177,"threshold_uncertainty_score":0.34371617},"labels":[],"label_agreement":null},{"id":"W2177467267","doi":"10.1109/sahcn.2015.7338291","title":"On the benefits of network coding to compressive data gathering in wireless sensor networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Compressed sensing; Wireless sensor network; Linear network coding; Scalability; Data aggregator; Computer network; Data compression; Coding (social sciences); Efficient energy use; Distributed computing; Algorithm; Engineering; Mathematics","score_opus":0.14493560446261017,"score_gpt":0.30753154885268313,"score_spread":0.16259594439007297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177467267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10050708,0.00041375673,0.8837683,0.004527115,0.00039693233,0.00047197964,0.00000259866,0.00010463379,0.009807615],"genre_scores_gemma":[0.9915409,0.00013882898,0.006906387,0.0012539523,0.00006348208,0.000009877808,0.0000037066338,0.000007542471,0.00007532244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988136,0.0002265744,0.00024698113,0.0002833921,0.00018847165,0.00024094938],"domain_scores_gemma":[0.99734277,0.00066526665,0.00008161957,0.001705012,0.000113396025,0.00009194892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093577773,0.000110966044,0.0001724925,0.000045255336,0.00010319329,0.00008738058,0.0025078743,0.000032453892,0.000010875628],"category_scores_gemma":[0.000103997794,0.000078434394,0.000017404822,0.0006998132,0.00002856221,0.00018737317,0.0020791728,0.00018779271,0.000011913774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014606808,0.000035687273,0.0007523672,0.0000016098151,0.000010209225,0.0000015078541,0.00087643624,0.4664161,0.000050041603,0.49260634,0.00843343,0.030801682],"study_design_scores_gemma":[0.00019330336,0.00003792108,0.0013117732,0.00016885239,0.0000013292146,0.0000014858715,0.00007859996,0.99682504,0.00012413101,0.00021477875,0.0009246551,0.00011815498],"about_ca_topic_score_codex":0.00002149442,"about_ca_topic_score_gemma":0.0002755262,"teacher_disagreement_score":0.8910338,"about_ca_system_score_codex":0.00003108647,"about_ca_system_score_gemma":0.000031206164,"threshold_uncertainty_score":0.4660296},"labels":[],"label_agreement":null},{"id":"W2177944699","doi":"10.1109/twc.2009.081580","title":"An opportunistic-based protocol for bidirectional cooperative networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Protocol (science); Relay; Upper and lower bounds; Computer network; Outage probability; Channel (broadcasting); Selection (genetic algorithm); Cooperative diversity; Power (physics); Topology (electrical circuits); Mathematics; Fading","score_opus":0.09081092780281547,"score_gpt":0.3593649179714254,"score_spread":0.2685539901686099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177944699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018901106,0.0000107425485,0.9683219,0.0045822384,0.000119960256,0.02555983,0.0000307685,0.00049763086,0.0008580229],"genre_scores_gemma":[0.7949437,0.00007497938,0.063540235,0.002179495,0.00004818843,0.13891703,0.00005779877,0.000025341347,0.00021322811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813235,0.0004660796,0.0004517626,0.0004252311,0.00021132646,0.00031327683],"domain_scores_gemma":[0.9952348,0.0005731792,0.00015110734,0.0032744857,0.0005573066,0.00020912633],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00040982998,0.00026155493,0.00024114322,0.00022158303,0.0018800099,0.00028799637,0.0027012292,0.00011822177,0.00004567793],"category_scores_gemma":[0.000009876377,0.00026606486,0.0001464125,0.00079961383,0.00016208786,0.00057198154,0.00000919914,0.00046733968,0.000013495917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015549446,0.003784213,0.000006919946,0.000011057768,0.00006079309,0.0000011195859,0.00036605835,0.20636956,0.0034186086,0.19684811,0.0014225019,0.5875555],"study_design_scores_gemma":[0.0011208057,0.0005470727,0.00006942967,0.000062892475,0.0000119155875,0.0000038525745,0.00001603803,0.9780894,0.0019623036,0.00028106483,0.01751275,0.00032249477],"about_ca_topic_score_codex":0.000004221728,"about_ca_topic_score_gemma":0.00010067469,"teacher_disagreement_score":0.90478164,"about_ca_system_score_codex":0.000128002,"about_ca_system_score_gemma":0.00029444034,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W2180459646","doi":"10.1007/s12083-015-0422-3","title":"Opportunistic cooperation in wireless ad hoc networks with interference correlation","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless ad hoc network; Interference (communication); Computer science; Wireless; Computer network; Correlation; Post-hoc analysis; Telecommunications; Mobile ad hoc network; Channel (broadcasting); Mathematics; Statistics","score_opus":0.05670263611936628,"score_gpt":0.2910093912865058,"score_spread":0.23430675516713956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180459646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003872266,0.0005051051,0.9853615,0.007306572,0.00017405576,0.0007072003,0.0000023485995,0.00016571213,0.0019052188],"genre_scores_gemma":[0.98338425,0.00030771183,0.013397867,0.0009273466,0.00019890194,0.0005309444,0.0000771172,0.000019190977,0.0011566586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835634,0.000121307,0.00034284175,0.0005275444,0.0003227306,0.000329217],"domain_scores_gemma":[0.99800813,0.00015446375,0.00009699703,0.00069484866,0.00067206094,0.00037349862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082439085,0.00020542314,0.00021647643,0.00017565669,0.0002956868,0.0003686001,0.0006489085,0.000074073745,0.00000344246],"category_scores_gemma":[0.000045459703,0.0001960424,0.000018301322,0.0014733068,0.00005022071,0.0002457031,0.0003464596,0.00029653194,0.000033991262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048021477,0.000121455465,0.0034825597,0.000006228358,0.000016734271,0.000003929388,0.0026905225,0.097129464,0.000079864614,0.065811224,0.0070625274,0.8235475],"study_design_scores_gemma":[0.0004988619,0.00017536918,0.0022867334,0.00015665941,0.000011123996,0.000018036682,0.00011552212,0.7771422,0.00000972271,0.0003683611,0.21880592,0.00041144624],"about_ca_topic_score_codex":0.000008375187,"about_ca_topic_score_gemma":0.00031772853,"teacher_disagreement_score":0.979512,"about_ca_system_score_codex":0.00010564313,"about_ca_system_score_gemma":0.000111141235,"threshold_uncertainty_score":0.7994377},"labels":[],"label_agreement":null},{"id":"W2199788805","doi":"10.1109/cjece.2014.2386698","title":"Relay Selection Based on Bayesian Decision Theory in Cooperative Wireless Networks","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Relay channel; Node (physics); Computer network; Computer science; Selection (genetic algorithm); Channel (broadcasting); Wireless; Wireless network; Bayes' theorem; Cooperative diversity; Bayesian probability; Telecommunications; Engineering; Fading; Artificial intelligence","score_opus":0.01180867065251105,"score_gpt":0.21003240153706246,"score_spread":0.19822373088455142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2199788805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020219773,0.0007132287,0.9784623,0.0002391856,0.00024134794,0.00005237561,9.946844e-8,0.0000137321285,0.00005796775],"genre_scores_gemma":[0.9877042,0.000042221185,0.011751351,0.00036416834,0.0001221591,0.0000016226036,3.5447752e-7,0.000007287423,0.000006619105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991328,0.00012533795,0.00025050592,0.00013661767,0.000116032934,0.00023871669],"domain_scores_gemma":[0.9988474,0.0003490242,0.000054111646,0.00012486862,0.00016687284,0.0004576735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005598213,0.00011470144,0.00017676843,0.00043093017,0.000074150084,0.00013998957,0.0003499067,0.000058943093,0.0000026810862],"category_scores_gemma":[0.00009313418,0.00010113704,0.000033045617,0.00080928794,0.000013833581,0.00019335713,0.00002503232,0.00043318825,7.1762804e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015220485,0.000013157929,0.0008522914,9.801753e-7,0.0000066907546,0.000039923318,0.0001422656,0.85535246,0.000008172367,0.019336222,0.00032526656,0.12390732],"study_design_scores_gemma":[0.00043090255,0.00031492257,0.002731703,0.00009343071,0.000001969895,0.000055808483,0.0000017790173,0.99517226,0.000027840946,0.000116086754,0.0009388029,0.000114495524],"about_ca_topic_score_codex":0.000020366992,"about_ca_topic_score_gemma":0.00032657813,"teacher_disagreement_score":0.9674844,"about_ca_system_score_codex":0.00019981028,"about_ca_system_score_gemma":0.0003593086,"threshold_uncertainty_score":0.4124249},"labels":[],"label_agreement":null},{"id":"W2202812032","doi":"10.1109/tit.2015.2491941","title":"Exploiting the &lt;inline-formula&gt; &lt;tex-math notation=\"LaTeX\"&gt;$N$ &lt;/tex-math&gt;&lt;/inline-formula&gt;-to-1 Mapping in Compress-and-Forward Relaying","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Algorithm; Linear network coding; Computer science; Relay; Constraint (computer-aided design); Diagonal; Notation; Relaxation (psychology); Bin; Mathematics; Discrete mathematics; Theoretical computer science; Arithmetic; Computer network; Network packet","score_opus":0.038691171714455956,"score_gpt":0.2660263468825533,"score_spread":0.22733517516809731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202812032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09953065,0.00034153255,0.8909087,0.0019464521,0.0009851365,0.0011163431,0.000037919537,0.0005505107,0.004582726],"genre_scores_gemma":[0.9818855,0.00062772445,0.014197141,0.0022892714,0.00011719183,0.00034366144,0.000054210686,0.000049851693,0.0004354389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952588,0.0005938358,0.0018048616,0.00054758205,0.0009862041,0.00080868235],"domain_scores_gemma":[0.99549186,0.0011407118,0.000631415,0.0015328118,0.0008018433,0.00040132983],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0036410075,0.00063096546,0.0005975008,0.00104758,0.0015104455,0.0008561536,0.0017211082,0.00026740102,0.00003748669],"category_scores_gemma":[0.00023725073,0.0005429317,0.00024614466,0.0019088148,0.00019064412,0.005291388,0.00012352786,0.0009786028,0.00052820286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001742816,0.0002479455,0.000033795022,0.00012097292,0.00015769199,0.0000062530085,0.067485,0.19888924,0.0020879495,0.40409034,0.0005704796,0.32613605],"study_design_scores_gemma":[0.0023211762,0.00017770425,0.0004518041,0.0005599254,0.000047986065,0.000073085066,0.0020066728,0.9447662,0.0018919241,0.0039442712,0.042807497,0.00095170125],"about_ca_topic_score_codex":0.000013442214,"about_ca_topic_score_gemma":0.00009891955,"teacher_disagreement_score":0.88235486,"about_ca_system_score_codex":0.0004520505,"about_ca_system_score_gemma":0.00028925316,"threshold_uncertainty_score":0.9997895},"labels":[],"label_agreement":null},{"id":"W22032000","doi":"10.1007/978-3-642-29222-4_26","title":"Time and Power Scheduling in a Wireless Network with Network Coding and Bidirectional Relaying","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Linear network coding; Computer network; Computer science; Wireless network; Maximum throughput scheduling; Relay; Node (physics); Scheduling (production processes); Wireless; Quality of service; Power (physics); Telecommunications; Engineering; Network packet; Round-robin scheduling; Dynamic priority scheduling","score_opus":0.021070952856782517,"score_gpt":0.22953275065122386,"score_spread":0.20846179779444135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22032000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032181344,0.0038671566,0.99003667,0.0008788464,0.00026055687,0.00046989962,0.0000067649225,0.000064577674,0.0011974148],"genre_scores_gemma":[0.09756871,0.0013886712,0.90063065,0.00018328762,0.00015094734,0.000017520442,0.000010720278,0.000016535474,0.000032972246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895704,0.000023451186,0.00043223295,0.00015745935,0.00016169198,0.0002681514],"domain_scores_gemma":[0.998705,0.00045154936,0.00030371195,0.00038398698,0.000101516685,0.000054192515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064172724,0.00023574922,0.00033090016,0.00013449961,0.0010440769,0.00021755252,0.0008281954,0.00014239273,8.4218146e-7],"category_scores_gemma":[0.000022571548,0.00019100566,0.000053712578,0.00031189152,0.0003986317,0.0004490646,0.0010232688,0.00045833195,2.2330062e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026711884,0.0000070454985,0.00007763417,0.00005679432,0.000052001422,8.308566e-8,0.001554869,0.86581016,0.000007184134,0.109446496,0.000020227524,0.022964813],"study_design_scores_gemma":[0.000216286,0.000042005828,0.00033109024,0.00064576,0.000021204194,0.000024388582,0.0000031847194,0.9922856,0.0000054092097,0.00045268683,0.0056842463,0.000288153],"about_ca_topic_score_codex":0.0000059927133,"about_ca_topic_score_gemma":0.000079573816,"teacher_disagreement_score":0.12647541,"about_ca_system_score_codex":0.000048253412,"about_ca_system_score_gemma":0.000090302456,"threshold_uncertainty_score":0.80303},"labels":[],"label_agreement":null},{"id":"W2203905818","doi":"10.1145/2725469","title":"QuGu","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Computer network; Interleaving; Packet loss; Network packet; Retransmission; Wireless ad hoc network; Video quality; Broadcasting (networking); Vehicular ad hoc network; Routing protocol; Router; Real-time computing; Wireless; Telecommunications","score_opus":0.0800176322452445,"score_gpt":0.3269377814079131,"score_spread":0.24692014916266858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203905818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003437281,0.0010633266,0.9861153,0.008605232,0.0000853709,0.00046620195,0.000006062984,0.00047204364,0.0028427392],"genre_scores_gemma":[0.6028732,0.0016113116,0.39456874,0.0005267975,0.000039339182,0.00020591031,0.000016587963,0.000014225506,0.0001438788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858415,0.00021992135,0.00036199074,0.0003886564,0.00020368458,0.00024162022],"domain_scores_gemma":[0.9939844,0.0008040851,0.000116002455,0.0045123794,0.00029442177,0.00028873316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047074005,0.00019204355,0.0001841842,0.00020115473,0.0010443152,0.00020439795,0.003242076,0.000074766125,0.0000078716785],"category_scores_gemma":[0.00005985876,0.00019882228,0.000063156716,0.00087890495,0.00022458893,0.00028836238,0.00035230874,0.00042861202,0.00013096648],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020085042,0.00026520825,0.00006467834,0.0000031242407,0.000023301984,1.9758603e-7,0.0010917422,0.00040005514,0.00012730704,0.034701187,0.00022369799,0.9630975],"study_design_scores_gemma":[0.0011495497,0.00012757316,0.0006830698,0.000055593533,0.00003123212,0.00003494573,0.00044841587,0.703863,0.0003500673,0.0075748414,0.2851107,0.0005709531],"about_ca_topic_score_codex":0.000016530059,"about_ca_topic_score_gemma":0.000034186978,"teacher_disagreement_score":0.96252656,"about_ca_system_score_codex":0.00007095936,"about_ca_system_score_gemma":0.000110424815,"threshold_uncertainty_score":0.81077373},"labels":[],"label_agreement":null},{"id":"W2209518052","doi":"10.1016/j.aeue.2015.12.018","title":"Outage analysis of buffer-aided underlay cognitive relay networks with outdated CSI","year":2016,"lang":"en","type":"article","venue":"AEU - International Journal of Electronics and Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Ministère de l'Éducation, du Loisir et du Sport Québec","keywords":"Underlay; Relay; Diversity gain; Computer science; Channel state information; Markov chain; Coding gain; Coding (social sciences); Asymptotic analysis; Markov process; Outage probability; Topology (electrical circuits); Signal-to-noise ratio (imaging); Channel (broadcasting); Fading; Telecommunications; Decoding methods; Mathematics; Wireless; Statistics; Physics; Power (physics)","score_opus":0.024065480138378767,"score_gpt":0.2984334334959417,"score_spread":0.2743679533575629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209518052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055351563,0.0074886875,0.92461437,0.011196693,0.0000929781,0.00010821809,0.000010583489,0.0000242375,0.0011126761],"genre_scores_gemma":[0.973853,0.020965852,0.0047843596,0.00023921728,0.000022021386,0.0000045068505,0.000013405693,0.0000076054216,0.00011004572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858946,0.00026499655,0.00053055515,0.00014467015,0.0003056286,0.00016471403],"domain_scores_gemma":[0.9961715,0.0008852182,0.00063537457,0.00075382204,0.001476457,0.00007766466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005825811,0.00012316162,0.00028388246,0.00040210134,0.00014882916,0.00010076248,0.0022562162,0.000048540343,0.000022649972],"category_scores_gemma":[0.00011751957,0.00008343132,0.00012586826,0.00074734754,0.00018073927,0.00045412485,0.00053528155,0.00028209106,0.0000010663327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002187082,0.000729124,0.013185927,0.0000033453873,0.010062423,0.00001235615,0.0022143635,0.0025647532,0.0035364402,0.774789,0.0003455075,0.19233811],"study_design_scores_gemma":[0.01337219,0.003670027,0.14292713,0.0017684677,0.004186981,0.0006614101,0.0012417948,0.7708858,0.003837825,0.013660258,0.04173558,0.0020524983],"about_ca_topic_score_codex":0.0000060877082,"about_ca_topic_score_gemma":0.0002531886,"teacher_disagreement_score":0.91983,"about_ca_system_score_codex":0.00009580809,"about_ca_system_score_gemma":0.00017070714,"threshold_uncertainty_score":0.41926485},"labels":[],"label_agreement":null},{"id":"W2213271070","doi":"10.1186/s13638-015-0481-4","title":"Utility-based efficient dynamic distributed resource allocation in buffer-aided relay-assisted OFDMA networks","year":2015,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Qatar National Research Fund; National Natural Science Foundation of China; Fonds National de la Recherche Luxembourg; Qatar Foundation","keywords":"Computer science; Relay; Resource allocation; Overhead (engineering); Base station; Mathematical optimization; Scheme (mathematics); Lyapunov optimization; Computer network; Power (physics); Distributed computing","score_opus":0.06552106994769327,"score_gpt":0.300888714023903,"score_spread":0.23536764407620972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213271070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12987389,0.020684354,0.82763124,0.019264335,0.0006083801,0.0005647104,0.0000050087992,0.0002759142,0.0010921747],"genre_scores_gemma":[0.98809963,0.0063486053,0.004721197,0.000600282,0.00008333033,0.000036598398,0.000059034854,0.000025998508,0.000025325102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960256,0.0018674517,0.0008360026,0.0003996423,0.00039444712,0.00047682086],"domain_scores_gemma":[0.9958317,0.0009554272,0.0004911253,0.0020416903,0.00034401813,0.00033600655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024397671,0.00029954838,0.00038230742,0.0003178254,0.0009924043,0.0005253456,0.0023369575,0.00014104677,0.0000038840676],"category_scores_gemma":[0.0000785933,0.00028626205,0.00009906767,0.001562034,0.00019644866,0.0002454977,0.0008208593,0.0013041307,0.000003854542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015073383,0.00089552137,0.009817177,0.000012636737,0.00006707405,0.000028736513,0.0013171135,0.17449878,0.00014186227,0.010861135,0.00094465987,0.8012646],"study_design_scores_gemma":[0.0011797987,0.00009644444,0.009333502,0.00052297144,0.000013158742,0.000052466243,0.00009236856,0.9674844,0.000010214576,0.000108717184,0.020812562,0.00029337415],"about_ca_topic_score_codex":0.000008134961,"about_ca_topic_score_gemma":0.00014563154,"teacher_disagreement_score":0.85822576,"about_ca_system_score_codex":0.0002707836,"about_ca_system_score_gemma":0.00018190425,"threshold_uncertainty_score":0.99995893},"labels":[],"label_agreement":null},{"id":"W2217268606","doi":"10.5539/cis.v9n1p21","title":"On the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching","year":2015,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Jackson State University","keywords":"Matching (statistics); Combinatorics; Vertex (graph theory); Mathematics; Similarity (geometry); Graph; Optimal matching; Random graph; Computer science; Artificial intelligence; Statistics; Image (mathematics)","score_opus":0.06545764659012271,"score_gpt":0.30927371393111824,"score_spread":0.24381606734099553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217268606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05608499,0.000039091163,0.9411709,0.00066204654,0.0003484176,0.00042510027,0.000004993296,0.000037680948,0.0012268012],"genre_scores_gemma":[0.9612717,0.000046998764,0.037380006,0.0012098363,0.000026411348,0.00004307221,0.000004634625,0.000002617683,0.000014730578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875516,0.000107357686,0.00035853687,0.0001781195,0.0003707318,0.00023011022],"domain_scores_gemma":[0.9977045,0.0008683571,0.00025303202,0.00036409972,0.00070173683,0.00010828886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020539856,0.00012317255,0.00018181537,0.00013619114,0.0005261966,0.0003736091,0.001033443,0.000024031187,0.0000041880035],"category_scores_gemma":[0.0002115564,0.000074508476,0.000040879044,0.0009622639,0.0003482681,0.0038477718,0.0003541245,0.00010804398,0.000004968187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010788267,0.0000158442,0.00008181118,0.000007980761,0.00000981814,1.7897841e-7,0.012152167,0.00520907,0.00002106083,0.9478376,0.00079224305,0.03376436],"study_design_scores_gemma":[0.0022211678,0.0005995262,0.006807481,0.00012438075,0.000007180842,0.000008785295,0.00068028684,0.9433408,0.0007270104,0.041199807,0.003988591,0.00029499232],"about_ca_topic_score_codex":0.0000032737191,"about_ca_topic_score_gemma":0.0000027962094,"teacher_disagreement_score":0.9381317,"about_ca_system_score_codex":0.00002913807,"about_ca_system_score_gemma":0.00020946843,"threshold_uncertainty_score":0.40471318},"labels":[],"label_agreement":null},{"id":"W2221249378","doi":"10.1016/j.vehcom.2015.11.002","title":"Decode-and-Forward cooperative vehicular relaying for LTE-A MIMO-downlink","year":2015,"lang":"en","type":"article","venue":"Vehicular Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; MIMO; Diversity gain; Antenna diversity; Spatial multiplexing; Telecommunications link; Computer network; Cooperative diversity; Multiplexing; Wireless; Spectral efficiency; Transmission (telecommunications); Orthogonality; Wireless network; Antenna (radio); Benchmark (surveying); Telecommunications; Channel (broadcasting)","score_opus":0.09124122185979001,"score_gpt":0.32258287724902407,"score_spread":0.23134165538923407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221249378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011413813,0.018708846,0.93112314,0.031543437,0.0002614464,0.0013205479,0.00001721827,0.00050673547,0.005104812],"genre_scores_gemma":[0.74283653,0.0037378126,0.25077832,0.0014801868,0.000057244273,0.0004581745,0.00010319546,0.000032932134,0.00051561365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796975,0.00054386986,0.00045941747,0.00043293167,0.0002468204,0.0003471893],"domain_scores_gemma":[0.9943851,0.0005815128,0.00016525398,0.0036919175,0.00088056247,0.0002956068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012377477,0.00024700418,0.000312091,0.00015748161,0.0010574136,0.00034532658,0.0030336902,0.00012508505,0.0000068325244],"category_scores_gemma":[0.00053951854,0.00023840276,0.00012564624,0.00065409637,0.00022488534,0.0006528337,0.0020877065,0.00040164584,0.00006288647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024050796,0.00038533617,0.001068937,0.000027871627,0.00025458593,0.0000047644317,0.0077778725,0.003170607,0.0020966905,0.8548161,0.009546482,0.12082674],"study_design_scores_gemma":[0.0011551265,0.00011600881,0.00043570186,0.0000761211,0.000040758943,0.000027827957,0.0003029141,0.57697135,0.00049740303,0.0030374941,0.41687757,0.0004617086],"about_ca_topic_score_codex":0.000015828886,"about_ca_topic_score_gemma":0.000103804836,"teacher_disagreement_score":0.85177857,"about_ca_system_score_codex":0.000118544536,"about_ca_system_score_gemma":0.00023543478,"threshold_uncertainty_score":0.9721782},"labels":[],"label_agreement":null},{"id":"W2221570658","doi":"10.1049/iet-net.2013.0045","title":"Finite‐state Markov modelling for wireless cooperative networks","year":2013,"lang":"en","type":"article","venue":"IET Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Fading; Markov chain; Wireless network; Wireless; Cooperative diversity; Path (computing); Markov model; Maximal-ratio combining; Signal-to-noise ratio (imaging); Scalability; Diversity combining; Computer network; Channel (broadcasting); Machine learning; Telecommunications","score_opus":0.03256792284504671,"score_gpt":0.25439941396990495,"score_spread":0.22183149112485823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221570658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001069232,0.0012190642,0.9934749,0.0010280868,0.00064497156,0.00088952715,0.0000019537474,0.00027453224,0.0013977144],"genre_scores_gemma":[0.96231866,0.0027749883,0.030618662,0.0018646979,0.00038451658,0.00048376565,0.000033468645,0.000040506002,0.0014807082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978913,0.00022663071,0.0004625285,0.00056094077,0.00017395345,0.0006846549],"domain_scores_gemma":[0.9972192,0.0008927714,0.00016036375,0.0009963223,0.0005292202,0.00020214687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000491159,0.000310411,0.0003403623,0.00007890892,0.0005873508,0.0006351935,0.0014257703,0.00014014068,0.00007355873],"category_scores_gemma":[0.000026729396,0.00028955287,0.00013508095,0.0006651211,0.00008490237,0.00077228114,0.0004913648,0.00044444282,0.00004677592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000913865,0.000032941334,0.000030424108,0.0000034717796,0.000029444576,0.0000017655589,0.00024553924,0.86127424,0.000005807047,0.0112052625,0.01176341,0.115398556],"study_design_scores_gemma":[0.0004598424,0.00007252035,0.00004150124,0.00006208964,0.0000060919506,0.0000042112315,0.000016195538,0.99205214,0.00001956242,0.00088521984,0.0060087685,0.00037184407],"about_ca_topic_score_codex":0.00001402163,"about_ca_topic_score_gemma":0.000029774694,"teacher_disagreement_score":0.96285623,"about_ca_system_score_codex":0.000060092465,"about_ca_system_score_gemma":0.000054544642,"threshold_uncertainty_score":0.99995565},"labels":[],"label_agreement":null},{"id":"W2223601936","doi":"10.1145/2829953","title":"Network Coding-Aware Compressive Data Gathering for Energy-Efficient Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Compressed sensing; Wireless sensor network; Scalability; Efficient energy use; Data aggregator; Linear network coding; Data compression; Computer network; Distributed computing; Algorithm; Network packet","score_opus":0.10434916727201593,"score_gpt":0.3016214182412487,"score_spread":0.1972722509692328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223601936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044005847,0.0007344698,0.99373555,0.0015260016,0.0020345496,0.0006078929,0.000036702357,0.00059660204,0.00028816127],"genre_scores_gemma":[0.9425557,0.0012507811,0.052618206,0.0017800888,0.00083694136,0.00016849441,0.00015678341,0.00009566354,0.00053730473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962064,0.00046819623,0.00068425696,0.001175034,0.000449118,0.0010169917],"domain_scores_gemma":[0.9926381,0.0013754143,0.0002958093,0.0047066323,0.00051453104,0.00046952275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008686398,0.00053164223,0.00057354505,0.00014192714,0.0011267638,0.00044175185,0.0040755016,0.00028399334,0.000023627923],"category_scores_gemma":[0.000057061025,0.00053065934,0.00018693037,0.0011021396,0.00014812952,0.0004254076,0.0003930846,0.00072388153,0.000015753709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008886985,0.0001465279,0.000016428601,0.0000055960004,0.00009196682,0.000009128261,0.00021260536,0.9017048,0.000013245576,0.0032911138,0.0056799613,0.08873979],"study_design_scores_gemma":[0.0011465786,0.0001421065,0.000028747345,0.00016972337,0.00005404993,0.00003253274,0.0001531406,0.9808225,0.000054406788,0.00014823063,0.016650217,0.0005977676],"about_ca_topic_score_codex":0.000024206589,"about_ca_topic_score_gemma":0.00011114332,"teacher_disagreement_score":0.94211566,"about_ca_system_score_codex":0.00017217522,"about_ca_system_score_gemma":0.00011206235,"threshold_uncertainty_score":0.9997145},"labels":[],"label_agreement":null},{"id":"W2233265793","doi":"10.1109/tvt.2015.2447452","title":"A Random Channel Sounding Decision Feedback Receiver for Two-Way Relay Communication With Pilotless Orthogonal Signaling and Physical-Layer Network Coding","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Telecommunications link; Electronic engineering; Relay; Additive white Gaussian noise; Keying; Phase-shift keying; Channel sounding; Bit error rate; Rayleigh fading; Computer science; Physical layer; Channel (broadcasting); Algorithm; Engineering; Telecommunications; MIMO; Physics; Wireless","score_opus":0.041211772487392294,"score_gpt":0.2832951468033171,"score_spread":0.24208337431592478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233265793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13358173,0.0006607175,0.8633423,0.0013878301,0.00015097574,0.0004883704,0.0000022330275,0.00032503737,0.000060824364],"genre_scores_gemma":[0.9362956,0.00042790233,0.062785484,0.00015714252,0.000041111718,0.00022211218,0.0000035175883,0.000027769505,0.00003932213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984838,0.0001829002,0.00028479146,0.00046945308,0.0002275144,0.00035155492],"domain_scores_gemma":[0.99792784,0.00056630076,0.00014918859,0.0009033574,0.00034004208,0.00011328539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006998825,0.00023982725,0.0003438777,0.00027502014,0.00084593496,0.0001296735,0.0007596916,0.00014571044,0.000002340539],"category_scores_gemma":[0.00002503327,0.00021017005,0.000080172744,0.0009873352,0.00018750488,0.00032561852,0.000032487373,0.000520005,0.000009241125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010192889,0.00044516352,0.00008434116,0.000027882685,0.00030663717,0.000012330763,0.0030870368,0.55068374,0.011402434,0.039709263,0.00036861052,0.3928533],"study_design_scores_gemma":[0.007268578,0.0006213772,0.000030419591,0.00049067516,0.00008888277,0.00010360666,0.0002621986,0.95865136,0.021437777,0.008468629,0.0020039417,0.0005725502],"about_ca_topic_score_codex":0.0000040207883,"about_ca_topic_score_gemma":0.00006609206,"teacher_disagreement_score":0.80271393,"about_ca_system_score_codex":0.00010861324,"about_ca_system_score_gemma":0.000074239826,"threshold_uncertainty_score":0.8570486},"labels":[],"label_agreement":null},{"id":"W2233951218","doi":"10.1561/0100000081","title":"Multi-way Communications: An Information Theoretic Perspective","year":2015,"lang":"en","type":"article","venue":"Foundations and Trends® in Communications and Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Perspective (graphical); Computer science; Artificial intelligence","score_opus":0.07329983956639588,"score_gpt":0.3417226983392135,"score_spread":0.2684228587728176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233951218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043238644,0.008066351,0.8193447,0.025953405,0.0003005378,0.0010060633,0.0000722817,0.0006383948,0.14029442],"genre_scores_gemma":[0.90413415,0.007835905,0.08639302,0.0009210887,0.000009777152,0.00016321887,0.00045703625,0.000006826248,0.000078978825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981433,0.00070267596,0.00062628504,0.00015555491,0.00017365576,0.00019848914],"domain_scores_gemma":[0.9957607,0.0003224993,0.00025992768,0.0028100652,0.0006664187,0.0001804209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016764778,0.00018742809,0.00018436748,0.000855836,0.0008232971,0.0008191049,0.0017798943,0.000088263085,0.000024750005],"category_scores_gemma":[0.00024757825,0.00018319386,0.000034647677,0.0011149237,0.0005165894,0.013436862,0.0013751012,0.0003444739,0.000048082056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060199236,0.000070898,0.00012151851,0.0000028086731,0.000008772924,3.1753128e-8,0.012422888,0.000017587447,0.0000016945021,0.73481774,0.00005402553,0.25247604],"study_design_scores_gemma":[0.0025648628,0.0002320282,0.015178406,0.000073368516,0.00002779248,0.00004218518,0.019341037,0.6622172,0.000007688101,0.10713043,0.19255076,0.00063422316],"about_ca_topic_score_codex":0.000073370014,"about_ca_topic_score_gemma":0.00026270607,"teacher_disagreement_score":0.8998103,"about_ca_system_score_codex":0.00015109013,"about_ca_system_score_gemma":0.000095238356,"threshold_uncertainty_score":0.97414005},"labels":[],"label_agreement":null},{"id":"W2235552839","doi":"","title":"Power Allocation and Admission Control in Multiuser Relay Networks via Convex Programming: Centralized and Distributed Schemes","year":2009,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Computer science; Max-min fairness; Mathematical optimization; Resource allocation; Power control; Maximization; Relay; Heuristic; Throughput; Power (physics); Admission control; Wireless network; Resource management (computing); Computer network; Wireless; Mathematics; Telecommunications; Quality of service","score_opus":0.010444672397432183,"score_gpt":0.25140367964662996,"score_spread":0.24095900724919778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235552839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1754431,0.006431471,0.78204006,0.034254238,0.00021448724,0.00097306713,0.000005841376,0.0005346904,0.00010301637],"genre_scores_gemma":[0.9665429,0.0011869641,0.031913787,0.00027351495,0.000009037253,0.000028175024,0.000014678692,0.000008236847,0.00002269373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984855,0.000075509735,0.00042242964,0.00047392125,0.00016440757,0.00037821394],"domain_scores_gemma":[0.99872833,0.000045054083,0.00022291947,0.0007204039,0.00016128628,0.000122016645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030954732,0.00024712077,0.00039536026,0.00034880036,0.00017968098,0.00007984396,0.00063661765,0.0003297633,0.000004557796],"category_scores_gemma":[0.0002247036,0.00023127896,0.000041023228,0.0009935783,0.0003155657,0.0005320118,0.00025903143,0.00043413392,0.0000010862128],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017314075,0.0007359639,0.0659381,0.00004180577,0.00015098191,0.000053259235,0.00084669597,0.0012618783,0.020542378,0.1337105,0.0010593693,0.77548593],"study_design_scores_gemma":[0.009600921,0.00068645773,0.057844218,0.00064012414,0.00005297186,0.00007036526,0.000104316714,0.53822315,0.0046549374,0.0013841358,0.3856075,0.001130895],"about_ca_topic_score_codex":0.0000042094853,"about_ca_topic_score_gemma":0.000028793858,"teacher_disagreement_score":0.7910998,"about_ca_system_score_codex":0.00006489308,"about_ca_system_score_gemma":0.000053246436,"threshold_uncertainty_score":0.9431282},"labels":[],"label_agreement":null},{"id":"W2242976416","doi":"10.1049/iet-com.2014.1236","title":"Transmit power allocation for asymmetric bi‐directional relay networks using channel statistics","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Concordia University","funders":"Nantong University; Government of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Relay; Relay channel; Computer science; Channel (broadcasting); Transmitter power output; Power (physics); Computer network; Telecommunications; Statistics; Transmitter; Mathematics","score_opus":0.13638363402507478,"score_gpt":0.3417300877324978,"score_spread":0.20534645370742302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242976416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011998878,0.0032049983,0.98928374,0.0037615502,0.000402908,0.00041694223,0.000022730443,0.00018994747,0.0025971858],"genre_scores_gemma":[0.5788573,0.0011411512,0.41898537,0.0004824442,0.00004911662,0.00012865601,0.00011865048,0.00001994206,0.00021736643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849135,0.00033995422,0.00040112398,0.0002689283,0.00022746378,0.00027119135],"domain_scores_gemma":[0.9958134,0.00073254545,0.00017246818,0.0022055397,0.0009033547,0.0001726532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000883786,0.00016367779,0.00018111087,0.00023132608,0.0007219192,0.0001951832,0.002255499,0.0000932589,0.000007063354],"category_scores_gemma":[0.0002653055,0.00017743564,0.00007369864,0.0013422915,0.00011202538,0.00046001346,0.00049387285,0.00028344034,0.000017448006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032220698,0.0007085032,0.0003385149,0.000012771357,0.00016371037,7.891506e-7,0.004169384,0.07096018,0.00023837393,0.7921333,0.0326325,0.098609775],"study_design_scores_gemma":[0.00046297486,0.00006524889,0.0004253143,0.000022724285,0.000017972636,0.000009245452,0.00006954216,0.9316705,0.000038352533,0.0026955174,0.0643027,0.00021989226],"about_ca_topic_score_codex":0.000026585765,"about_ca_topic_score_gemma":0.0001241379,"teacher_disagreement_score":0.8607103,"about_ca_system_score_codex":0.00019367386,"about_ca_system_score_gemma":0.00023355735,"threshold_uncertainty_score":0.7235615},"labels":[],"label_agreement":null},{"id":"W2243260590","doi":"10.1109/twc.2015.2476485","title":"Joint Subchannel Pairing and Power Allocation in Multichannel MABC-Based Two-Way Relaying","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Pairing; Computer science; Joint (building); Power (physics); Computer network; Wireless; Telecommunications; Physics; Engineering","score_opus":0.09021265818919832,"score_gpt":0.29626534034922836,"score_spread":0.20605268216003003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243260590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04149563,0.0005082492,0.94900763,0.007276829,0.00024068482,0.000395554,0.0000042142165,0.00027727504,0.00079392694],"genre_scores_gemma":[0.974099,0.0006715473,0.024387239,0.00050391676,0.00000890377,0.00022266149,0.0000067204205,0.000024615143,0.000075411874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799424,0.000568127,0.0004892224,0.00039230075,0.00025447184,0.00030163166],"domain_scores_gemma":[0.9964898,0.00040706838,0.00013060552,0.0024949876,0.00027585775,0.00020165811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008758659,0.00022878089,0.0002475875,0.00044736612,0.0005879663,0.00017182966,0.0014045622,0.00009189322,0.000006926749],"category_scores_gemma":[0.000029856496,0.0002513224,0.000072578376,0.00093430735,0.00016194678,0.0005866236,0.00005643617,0.00062012096,0.000037001955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001379816,0.004104224,0.0009885563,0.0000719354,0.00017117476,0.00001624432,0.038714994,0.42151397,0.019317504,0.099059895,0.000431214,0.4154723],"study_design_scores_gemma":[0.0015679991,0.0000862975,0.0007284692,0.00018893469,0.000010969853,0.00000851132,0.00046962246,0.9914842,0.004300754,0.00034477242,0.0004532116,0.00035624998],"about_ca_topic_score_codex":0.000094519666,"about_ca_topic_score_gemma":0.0010379411,"teacher_disagreement_score":0.93260336,"about_ca_system_score_codex":0.00023707088,"about_ca_system_score_gemma":0.00014536177,"threshold_uncertainty_score":0.9999939},"labels":[],"label_agreement":null},{"id":"W2244028849","doi":"10.3837/tiis.2015.10.012","title":"Performance Analysis of IDF Relaying M2M Cooperative Networks over N-Nakagami Fading Channels","year":2015,"lang":"en","type":"article","venue":"KSII Transactions on Internet and Information Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Nakagami distribution; Computer science; Fading; Computer network; Telecommunications; Channel (broadcasting)","score_opus":0.03505857809585362,"score_gpt":0.2583899061368837,"score_spread":0.22333132804103006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244028849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045080464,0.00017063336,0.9482205,0.00007905512,0.00062513404,0.00020472555,0.0000049823816,0.0000813674,0.0055331457],"genre_scores_gemma":[0.9987314,0.00043962483,0.00025995736,0.00014991299,0.000021141674,0.00003088157,0.000018212444,0.000004501639,0.00034440993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987482,0.00011994171,0.00058203994,0.0001467591,0.0002412742,0.00016178348],"domain_scores_gemma":[0.99883646,0.00008848355,0.00023524264,0.00036425286,0.0003669117,0.00010863061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053187605,0.00015013467,0.00029278654,0.00058643636,0.00014939396,0.0002933004,0.00036415798,0.00007762525,0.000018224513],"category_scores_gemma":[0.000012475557,0.00013372625,0.00007771601,0.0012662511,0.000044313852,0.0031252329,0.000027774895,0.00019710477,0.000017275788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029168008,0.000030520783,0.00055563974,0.00002476332,0.0003613996,2.1912591e-7,0.011905437,0.94628984,0.000011009969,0.014047591,0.0003198305,0.026424585],"study_design_scores_gemma":[0.0003614657,0.00012644604,0.00068004953,0.00010190646,0.00004967507,0.000004812363,0.00044356767,0.99227285,0.00014522881,0.0000013659346,0.005669527,0.00014309106],"about_ca_topic_score_codex":0.000038809718,"about_ca_topic_score_gemma":0.000010220374,"teacher_disagreement_score":0.9536509,"about_ca_system_score_codex":0.00008188871,"about_ca_system_score_gemma":0.000033699704,"threshold_uncertainty_score":0.54531986},"labels":[],"label_agreement":null},{"id":"W2246469622","doi":"10.1049/iet-com.2014.0318","title":"Adaptive transmission in amplify‐and‐forward cooperative communications using orthogonal space–time block codes under spatially correlated antennas","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rayleigh fading; Cumulative distribution function; Spectral efficiency; Spatial correlation; Computer science; Transmission (telecommunications); Algorithm; Fading; Relay; Block code; Coding (social sciences); Bit error rate; Mathematics; Topology (electrical circuits); Probability density function; Channel (broadcasting); Telecommunications; Statistics; Decoding methods; Physics","score_opus":0.11276938639785561,"score_gpt":0.3243417703368462,"score_spread":0.21157238393899058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246469622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03206649,0.01689755,0.89975095,0.036342286,0.00020365417,0.0018215559,0.00006439425,0.0006776418,0.012175475],"genre_scores_gemma":[0.8678583,0.00470779,0.12652104,0.0004972312,0.000014293109,0.00006744848,0.00010024251,0.000027937176,0.00020574017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965559,0.0016089149,0.0006822631,0.00044120304,0.00032144185,0.00039024747],"domain_scores_gemma":[0.99350446,0.00093805476,0.00024473656,0.0042541986,0.0007377341,0.00032079418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010457794,0.0003273124,0.00043987946,0.00030794044,0.0009314189,0.0002598676,0.0039744647,0.0001850776,0.000018888677],"category_scores_gemma":[0.00015087283,0.00033003377,0.00007851942,0.001400799,0.00064877584,0.00077215355,0.002643035,0.0009347754,0.00006079399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022812102,0.0028335913,0.003794987,0.000023875837,0.0005327114,0.000015386993,0.04313154,0.052771166,0.015910836,0.81641793,0.0024972865,0.061842564],"study_design_scores_gemma":[0.0011180176,0.0001180004,0.0015492772,0.00020647806,0.00003407356,0.00004163516,0.0005700604,0.98454845,0.00008123803,0.0020011717,0.009295221,0.00043640184],"about_ca_topic_score_codex":0.00018123088,"about_ca_topic_score_gemma":0.001117725,"teacher_disagreement_score":0.93177724,"about_ca_system_score_codex":0.0002525148,"about_ca_system_score_gemma":0.0005885542,"threshold_uncertainty_score":0.9999152},"labels":[],"label_agreement":null},{"id":"W2253241185","doi":"10.1109/tsp.2015.2494881","title":"Sum-Rate Maximization for Two-Way Active Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Maximization; Transceiver; Channel (broadcasting); Reciprocal; Computer science; Mathematical optimization; Constraint (computer-aided design); Transmitter power output; Topology (electrical circuits); Transmitter; Mathematics; Telecommunications; Wireless; Combinatorics","score_opus":0.08653331411629032,"score_gpt":0.3133437488915341,"score_spread":0.22681043477524376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253241185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094684766,0.000122984,0.996453,0.0008738793,0.00032546613,0.0002873588,0.0000037845084,0.00021322585,0.00077346317],"genre_scores_gemma":[0.9857289,0.000023408595,0.013093979,0.00044343894,0.000080018166,0.00011463268,0.0000033473773,0.00001739741,0.0004948848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891794,0.0001268544,0.00021501664,0.00032139654,0.00018331187,0.00023548013],"domain_scores_gemma":[0.99889845,0.00012952399,0.00010204218,0.00026891162,0.00046835202,0.0001327352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000404383,0.00015620339,0.00014837066,0.0001552431,0.0005173287,0.0002920911,0.00046977962,0.00005189312,0.000014799383],"category_scores_gemma":[0.0000086323735,0.00015215945,0.00006336099,0.0005776222,0.000041056857,0.0009790527,0.0000049348996,0.00018719178,0.000022687916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081765094,0.00013344052,8.6379106e-7,0.000015082774,0.000019132396,0.0000010274711,0.002339376,0.113834605,0.0031913517,0.0013646553,0.00015653683,0.87886214],"study_design_scores_gemma":[0.0010078351,0.00015416172,0.000005225818,0.00008192243,0.000014178498,0.000006032784,0.00011726088,0.91325843,0.08162637,0.0014890443,0.0019916806,0.00024788096],"about_ca_topic_score_codex":0.000002660162,"about_ca_topic_score_gemma":0.0000142618455,"teacher_disagreement_score":0.98478204,"about_ca_system_score_codex":0.00010710793,"about_ca_system_score_gemma":0.00017059759,"threshold_uncertainty_score":0.6204883},"labels":[],"label_agreement":null},{"id":"W2255026155","doi":"10.1002/dac.3119","title":"Topology evolution model for ad hoc‐cellular hybrid networks based on complex network theory","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Wireless ad hoc network; Mobile ad hoc network; Computer network; Network topology; Distributed computing; Network formation; Robustness (evolution); Optimized Link State Routing Protocol; Topology (electrical circuits); Network simulation; Vehicular ad hoc network; Average path length; Network performance; Routing protocol; Routing (electronic design automation); Shortest path problem; Wireless; Telecommunications; Network packet; Theoretical computer science","score_opus":0.055293824034620825,"score_gpt":0.306596300359632,"score_spread":0.2513024763250111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255026155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005463497,0.0045038057,0.98487407,0.007911012,0.0011370174,0.00024961543,0.0000064079336,0.000048865364,0.00072287506],"genre_scores_gemma":[0.97872645,0.0014000831,0.018438384,0.0007231225,0.00037027727,0.000038605278,0.000014497069,0.000016132564,0.00027245306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973731,0.00093057205,0.00083873724,0.00018466717,0.0004506928,0.00022219715],"domain_scores_gemma":[0.9946078,0.0016189893,0.00093121146,0.0010956357,0.0016504467,0.00009589853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024175881,0.00016542457,0.00028456378,0.00023116579,0.00024738535,0.00017245243,0.0035529064,0.00007135594,0.000016193993],"category_scores_gemma":[0.00017625057,0.0001236431,0.00018813496,0.0001600892,0.000109581066,0.00046163995,0.0003064851,0.0002101468,0.000009658666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017637637,0.00008442994,0.00006635275,0.000001443467,0.00008424945,0.0000016410331,0.00008772266,0.47345307,0.0003512791,0.4844216,0.0048980685,0.03637375],"study_design_scores_gemma":[0.0011552174,0.00011811102,0.00016306312,0.00028921146,0.000009918947,0.000023399256,0.000016035705,0.9515433,0.000037275622,0.011042576,0.035459027,0.00014287392],"about_ca_topic_score_codex":0.0000010838089,"about_ca_topic_score_gemma":0.00000410946,"teacher_disagreement_score":0.9781801,"about_ca_system_score_codex":0.00035252963,"about_ca_system_score_gemma":0.00016147202,"threshold_uncertainty_score":0.6602243},"labels":[],"label_agreement":null},{"id":"W2255394455","doi":"","title":"Node Switching Rates of Switch-and-Examine Relaying in Rician and Nakagami-m Fading","year":2011,"lang":"en","type":"article","venue":"Wireless Conference - Sustainable Wireless Technologies , European","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Nakagami distribution; Fading; Computer science; Node (physics); Fading distribution; Relay; Electronic engineering; Computer network; Engineering; Physics; Power (physics); Rayleigh fading; Channel (broadcasting)","score_opus":0.04705559220041705,"score_gpt":0.25508256326771506,"score_spread":0.208026971067298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255394455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91528565,0.0015935426,0.071156636,0.0006312242,0.000051975865,0.00037837017,8.532423e-7,0.000787196,0.010114554],"genre_scores_gemma":[0.99091446,0.004036817,0.004745205,0.000066541375,0.0000078628445,0.000028283297,0.0000018151815,0.00003598738,0.00016304242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972969,0.0003548252,0.00066839147,0.00074145064,0.00020870422,0.0007297096],"domain_scores_gemma":[0.99792534,0.0002011191,0.00035834257,0.0011068688,0.00032706067,0.00008126225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011413845,0.0003801574,0.0005434559,0.00066348066,0.0003979817,0.00023816027,0.001945231,0.00014248033,0.000005571919],"category_scores_gemma":[0.00027503373,0.0003670665,0.000044624307,0.00117665,0.00038721567,0.00092541927,0.0032292595,0.0006777175,0.0000045471957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002407413,0.00012355226,0.026986849,0.00023639749,0.000029371102,0.00020264076,0.007984772,0.000019942527,0.012176636,0.57693815,0.000018416247,0.37525922],"study_design_scores_gemma":[0.005767582,0.0011689983,0.2301129,0.004474945,0.000092756374,0.00023728672,0.15891577,0.45552868,0.102037385,0.03297087,0.0035149546,0.0051778792],"about_ca_topic_score_codex":0.00014737814,"about_ca_topic_score_gemma":0.00006173589,"teacher_disagreement_score":0.54396725,"about_ca_system_score_codex":0.000093091985,"about_ca_system_score_gemma":0.00008965264,"threshold_uncertainty_score":0.9998781},"labels":[],"label_agreement":null},{"id":"W2260858646","doi":"10.1049/iet-com.2015.0386","title":"Efficient combination of polynomial time algorithm and subtree decomposition for network coding","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear network coding; Time complexity; Computer science; Multicast; Algorithm; Coding (social sciences); Computational complexity theory; Theoretical computer science; Mathematical optimization; Mathematics; Distributed computing","score_opus":0.05057372867581421,"score_gpt":0.3162539849989059,"score_spread":0.26568025632309167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260858646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049366066,0.001766756,0.98628086,0.0044217613,0.0001496185,0.00048337821,0.000011263639,0.000118950615,0.001830828],"genre_scores_gemma":[0.6762172,0.0002516163,0.32321924,0.00011492329,0.00003331176,0.000058573576,0.000044035914,0.000007987183,0.00005310412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990152,0.00024130552,0.00029726143,0.00016182718,0.00012666274,0.00015771936],"domain_scores_gemma":[0.99751395,0.0005144111,0.00016794803,0.0013124227,0.00039873377,0.000092519695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007777862,0.00009759191,0.00016412338,0.00008181418,0.00037822864,0.000082410595,0.0011761246,0.00004688507,0.0000023519603],"category_scores_gemma":[0.000075508644,0.0001058423,0.00004516748,0.0003665039,0.0001228515,0.00013810325,0.00079847913,0.000107414104,0.000007663543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005683445,0.001144373,0.000605332,0.00003264854,0.00014091835,5.0427263e-7,0.007783941,0.011966182,0.0045485613,0.45851815,0.032704283,0.48249826],"study_design_scores_gemma":[0.000729067,0.000094860305,0.0008453719,0.0000403999,0.000011699051,0.0000036553133,0.00003377841,0.99106616,0.00023124294,0.0012773195,0.0055439495,0.000122479],"about_ca_topic_score_codex":0.0000068589657,"about_ca_topic_score_gemma":0.000010826478,"teacher_disagreement_score":0.9791,"about_ca_system_score_codex":0.000062568055,"about_ca_system_score_gemma":0.0000737204,"threshold_uncertainty_score":0.43161237},"labels":[],"label_agreement":null},{"id":"W2262000296","doi":"10.1017/cbo9780511667008.003","title":"Cooperative communications in OFDM and MIMO cellular relay networks: issues and approaches","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; MIMO; Computer network; Computer science; Wireless; Bandwidth (computing); Data as a service; Radio resource management; MIMO-OFDM; Transceiver; Wireless network; Telecommunications; Service (business); Power (physics); Channel (broadcasting); Business","score_opus":0.09573149242402042,"score_gpt":0.23161375539001403,"score_spread":0.1358822629659936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262000296","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008775393,0.013072701,0.029234512,0.00018217073,0.000054054755,0.0004842743,0.000013383569,0.000105680665,0.9567655],"genre_scores_gemma":[0.030506203,0.026467193,0.0038052436,0.00011247147,0.00003871576,0.000004396998,0.00003682255,0.000032006767,0.938997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986808,0.00023359933,0.00022607816,0.00053457083,0.00011005679,0.00021490177],"domain_scores_gemma":[0.9978453,0.00015766197,0.00016486445,0.0015680857,0.00012967875,0.00013442706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024837337,0.00031889623,0.00038810197,0.0001891854,0.0003859455,0.00013074707,0.0015307904,0.00025105194,0.0000020874434],"category_scores_gemma":[0.000009572327,0.00036457172,0.000054163065,0.000031217918,0.00056971033,0.00025962674,0.0030735962,0.00066745246,0.0000028682446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010991681,0.000014152556,0.000011886926,0.000015204522,0.000046900004,0.000021412625,0.00070128794,0.0000151943605,0.00000831314,0.9877808,0.0014034222,0.009970428],"study_design_scores_gemma":[0.00070399605,0.00007879069,0.00012122235,0.0003737844,0.00006561054,0.000015176285,0.00008214929,0.049704894,0.00007888224,0.00008793919,0.9479461,0.00074146246],"about_ca_topic_score_codex":0.000059927443,"about_ca_topic_score_gemma":0.000040302173,"teacher_disagreement_score":0.9876929,"about_ca_system_score_codex":0.00007522042,"about_ca_system_score_gemma":0.000055213073,"threshold_uncertainty_score":0.9998806},"labels":[],"label_agreement":null},{"id":"W2264454774","doi":"10.1016/j.omega.2016.01.012","title":"Models and column generation approach for the resource-constrained minimum cost path problem with relays","year":2016,"lang":"en","type":"article","venue":"Omega","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Column generation; Relay; Mathematical optimization; Path (computing); Computer science; Lagrangian relaxation; Resource (disambiguation); Constraint (computer-aided design); Mathematics; Computer network; Power (physics)","score_opus":0.06348057336691793,"score_gpt":0.24829457916349582,"score_spread":0.1848140057965779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264454774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014310032,0.00030579884,0.9891375,0.0034925267,0.000018266572,0.00081245246,0.0000035935675,0.000050207807,0.0047487044],"genre_scores_gemma":[0.8931436,0.00022143881,0.104173414,0.00036245288,0.00006623156,0.00046294637,0.000005718417,0.0000090540525,0.001555138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993374,0.00007056457,0.00011819844,0.00022971313,0.0000978957,0.00014626213],"domain_scores_gemma":[0.99914354,0.00021194619,0.0000569398,0.00045365808,0.00008853671,0.00004540104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036437655,0.00008363702,0.00008322042,0.000031869724,0.00034574085,0.00014891902,0.00038326267,0.000029970739,0.0000021151548],"category_scores_gemma":[0.000015687076,0.000043464683,0.000018474726,0.00016872356,0.00008973026,0.00025364017,0.00012825786,0.00005259233,0.0000010886721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045070512,0.00007372584,0.0001265275,0.00001308076,0.000044619657,7.311669e-7,0.0023252703,0.0023435212,0.005037207,0.46405202,0.011040362,0.5148979],"study_design_scores_gemma":[0.000795685,0.00009110462,0.000044836564,0.000023417857,0.000006463745,0.000010357818,0.00003739684,0.96588254,0.00017838785,0.0004935138,0.032316267,0.000120048055],"about_ca_topic_score_codex":8.140616e-7,"about_ca_topic_score_gemma":0.00000967042,"teacher_disagreement_score":0.963539,"about_ca_system_score_codex":0.000021976819,"about_ca_system_score_gemma":0.000042375166,"threshold_uncertainty_score":0.2659194},"labels":[],"label_agreement":null},{"id":"W2270922278","doi":"10.1007/s10776-015-0285-9","title":"User Cooperation for 5G Wireless Access Networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Computer network; Overhead (engineering); Telecommunications link; User equipment; Radio access technology; Radio resource management; Cellular network; Wireless; Radio access network; Wireless network; Exploit; Telecommunications; Base station; Mobile station; Computer security","score_opus":0.043325415032968786,"score_gpt":0.32117919947867063,"score_spread":0.27785378444570186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270922278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039064763,0.00025365368,0.98743045,0.0024645596,0.0042145927,0.00025670318,0.0000029264227,0.000065029766,0.0014055842],"genre_scores_gemma":[0.99119127,0.0010902352,0.004176373,0.0022694063,0.0010724548,0.00002909896,0.00006391466,0.000012675002,0.000094558396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977054,0.00013316116,0.0011246568,0.00013182871,0.0006459566,0.0002589704],"domain_scores_gemma":[0.9935918,0.00023996325,0.0010356578,0.00034993823,0.0045661167,0.00021653276],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013281985,0.00019899126,0.00027852913,0.00033798753,0.00013309215,0.0013398109,0.0029251354,0.00013805047,0.000012289194],"category_scores_gemma":[0.00016401598,0.0001804972,0.00015105514,0.00044286787,0.000051800955,0.007710055,0.00028767288,0.0003712829,0.000009301362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017702901,0.00007269867,0.00057175336,0.000005581932,0.0001439905,0.000004336749,0.0007782947,0.5446261,0.000010341149,0.09608327,0.04737455,0.31015202],"study_design_scores_gemma":[0.0016441226,0.000103417224,0.0002562539,0.00010239264,0.000009644564,0.00007726735,0.000053746433,0.941845,0.00012653001,0.00028567045,0.055288978,0.0002069568],"about_ca_topic_score_codex":0.000004190586,"about_ca_topic_score_gemma":0.00001193802,"teacher_disagreement_score":0.9872848,"about_ca_system_score_codex":0.0002445181,"about_ca_system_score_gemma":0.00026904925,"threshold_uncertainty_score":0.9996969},"labels":[],"label_agreement":null},{"id":"W2275431140","doi":"10.1002/wcm.2644","title":"QoE‐ and energy‐efficient resource optimization in OFDMA networks with bidirectional relaying","year":2015,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Quality of experience; Energy consumption; Linear network coding; Orthogonal frequency-division multiple access; Efficient energy use; Coding (social sciences); Computer network; Quality of service; Orthogonal frequency-division multiplexing; Channel (broadcasting)","score_opus":0.028565739121179014,"score_gpt":0.25755839422528004,"score_spread":0.22899265510410102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275431140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08032405,0.011639925,0.9054426,0.00082824164,0.00005399936,0.00015346234,5.970521e-7,0.000152235,0.0014048895],"genre_scores_gemma":[0.94737893,0.0035720845,0.048737314,0.00016336988,0.000024280387,0.000059010952,0.000011956641,0.000012654859,0.000040422212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987354,0.00033006628,0.00028790897,0.00030391687,0.00013895411,0.00020374183],"domain_scores_gemma":[0.99833274,0.00030842892,0.00013563188,0.00093443994,0.00016759231,0.00012117805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000603561,0.00014359802,0.00017890244,0.00016128022,0.00052767334,0.00020396366,0.00071567745,0.000057524965,0.0000010872258],"category_scores_gemma":[0.000016182506,0.00013612027,0.000016461861,0.0007251616,0.0001514943,0.00017033731,0.0013974439,0.0002487712,2.8788472e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058113383,0.00007921306,0.0024762633,0.000003774667,0.000009094171,8.641074e-7,0.0015527819,0.78677094,0.000013909767,0.014626231,0.00004110447,0.19442002],"study_design_scores_gemma":[0.00044001962,0.000049596845,0.00064126024,0.00014213323,0.000004094679,0.000022075237,0.0002961989,0.9913962,0.000008031895,0.000013301233,0.0068171485,0.00016993364],"about_ca_topic_score_codex":0.000044402812,"about_ca_topic_score_gemma":0.00006347199,"teacher_disagreement_score":0.8670549,"about_ca_system_score_codex":0.000062954736,"about_ca_system_score_gemma":0.000060591094,"threshold_uncertainty_score":0.5550824},"labels":[],"label_agreement":null},{"id":"W2276537857","doi":"10.1109/vtcfall.2015.7391102","title":"QoS Improvement for Video Streaming over MANET Using Network-Coding","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Linear network coding; Mobile ad hoc network; Multicast; Scalable Video Coding; Network packet; Quality of service; Video quality; Multiple description coding; Scalability","score_opus":0.099499193637486,"score_gpt":0.32283656739056216,"score_spread":0.22333737375307616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276537857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012630127,0.0002761528,0.98217684,0.00032867328,0.0006321048,0.00033096984,7.122966e-7,0.00015427757,0.0034701687],"genre_scores_gemma":[0.7593661,0.000048295355,0.23735975,0.0020032641,0.0005208894,0.000038312668,0.0000050257886,0.000016438356,0.0006419234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989342,0.00004877167,0.00023822396,0.00027967017,0.00016757954,0.0003315453],"domain_scores_gemma":[0.9989195,0.000121463854,0.00008897443,0.0005888943,0.00015134735,0.00012985703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058460643,0.00012962267,0.00014028038,0.000049924405,0.00023833223,0.0002331523,0.00067449117,0.000030397716,0.000023577035],"category_scores_gemma":[0.000041833653,0.000118267846,0.00005118584,0.0002607384,0.000017646427,0.00044281015,0.00057046686,0.00008263367,0.000007638774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033102293,0.00013516271,0.0024757083,0.00003028864,0.00009976976,0.000006438446,0.0016187996,0.026284076,0.00896807,0.55247194,0.060586575,0.34729007],"study_design_scores_gemma":[0.000595259,0.00008184984,0.0001354599,0.000034112454,0.0000061509904,0.0000034507555,0.000047710553,0.9578583,0.0010081511,0.0012053524,0.038816724,0.00020744142],"about_ca_topic_score_codex":0.000020082953,"about_ca_topic_score_gemma":0.00005665202,"teacher_disagreement_score":0.9315743,"about_ca_system_score_codex":0.00012326096,"about_ca_system_score_gemma":0.00008200351,"threshold_uncertainty_score":0.48228228},"labels":[],"label_agreement":null},{"id":"W2278525292","doi":"10.1109/vtcfall.2015.7390834","title":"Alternate AF MIMO Relaying Systems with Full Inter-Relay Interference Cancellation","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"MIMO; Computer science; Single antenna interference cancellation; Relay; Time division multiple access; Diversity gain; Spectral efficiency; Channel state information; Wireless; Multiplexing; Multi-user MIMO; Spatial multiplexing; Electronic engineering; Computer network; 3G MIMO; Fading; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.06943389404815407,"score_gpt":0.28185027534890844,"score_spread":0.21241638130075435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278525292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016885146,0.00057888124,0.94618434,0.00094665814,0.00053949136,0.0001541459,2.8712995e-7,0.00020689266,0.03450413],"genre_scores_gemma":[0.98655427,0.0000967386,0.0104645435,0.00017683812,0.000050535018,0.000019134948,0.000001922123,0.000007866984,0.00262818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989911,0.0001444258,0.00022291968,0.00027804545,0.00017862309,0.00018492436],"domain_scores_gemma":[0.99874705,0.00006246612,0.000105532046,0.00067780487,0.00027896164,0.00012820258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036589056,0.00012632077,0.00013451488,0.00007894387,0.00009857489,0.0003015839,0.00089906255,0.000031839347,0.000013856311],"category_scores_gemma":[0.000023693561,0.00009482432,0.00001982779,0.0003121704,0.000032186766,0.0004978964,0.00038759646,0.0001642536,0.000090536334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028179353,0.0002487927,0.015793532,0.00007776634,0.00021912088,0.00006832012,0.022964986,0.07110371,0.005103313,0.58941567,0.032064248,0.26265875],"study_design_scores_gemma":[0.0005666362,0.00025433753,0.0001115024,0.00023170083,0.0000045314096,0.000057977308,0.00026001813,0.98083234,0.00044973654,0.00012096546,0.016831199,0.0002790321],"about_ca_topic_score_codex":0.000098446515,"about_ca_topic_score_gemma":0.00036510438,"teacher_disagreement_score":0.9696691,"about_ca_system_score_codex":0.000121727964,"about_ca_system_score_gemma":0.00009338773,"threshold_uncertainty_score":0.38668236},"labels":[],"label_agreement":null},{"id":"W2286147203","doi":"10.3390/s16020249","title":"Joint Transmit Antenna Selection and Power Allocation for ISDF Relaying Mobile-to-Mobile Sensor Networks","year":2016,"lang":"en","type":"article","venue":"Sensors","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Relay; Nakagami distribution; Transmitter power output; Fading; Antenna (radio); Selection (genetic algorithm); Computer science; Power (physics); Outage probability; Joint (building); Electronic engineering; Computer network; Engineering; Telecommunications; Channel (broadcasting); Transmitter","score_opus":0.022634528394215907,"score_gpt":0.26070390072327304,"score_spread":0.23806937232905714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286147203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21119846,0.000320707,0.7855454,0.0014804387,0.000214315,0.00088960736,0.0000016320778,0.00017523664,0.00017419165],"genre_scores_gemma":[0.98229456,0.0006837031,0.015415824,0.0004141535,0.00007570291,0.0002696673,0.000001604333,0.000018459534,0.000826305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988021,0.00012884494,0.00025934118,0.00040348922,0.00011598241,0.00029020707],"domain_scores_gemma":[0.99895304,0.0002268172,0.000073044655,0.00040231377,0.00022431217,0.00012048382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039946867,0.0001520496,0.00016660421,0.00011427043,0.0002925145,0.00009891852,0.00024212756,0.00007330028,0.000018859311],"category_scores_gemma":[0.00005168425,0.00011716149,0.00006142661,0.00035414434,0.00003312672,0.0002313541,0.00008878166,0.00009828691,0.00002533319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013656657,0.00013900764,0.00051666616,0.00002773316,0.00008747489,0.0000033024928,0.0051872856,0.02385724,0.14876704,0.013055303,0.0017184442,0.80650395],"study_design_scores_gemma":[0.0011080361,0.0006825084,0.0014671383,0.00019037609,0.000015533933,0.00003980629,0.0001891173,0.93149084,0.0043042726,0.00017274532,0.059813786,0.0005258598],"about_ca_topic_score_codex":0.0000026707494,"about_ca_topic_score_gemma":0.000021158428,"teacher_disagreement_score":0.9076336,"about_ca_system_score_codex":0.00006626957,"about_ca_system_score_gemma":0.000023390452,"threshold_uncertainty_score":0.4777707},"labels":[],"label_agreement":null},{"id":"W2286329776","doi":"10.1109/jsen.2015.2495329","title":"Optimal and Near-Optimal Cooperative Routing and Power Allocation for Collision Minimization in Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Multipath routing; Mathematical optimization; Integer programming; Computer network; Static routing; Wireless sensor network; Equal-cost multi-path routing; Geographic routing; Dynamic Source Routing; Network packet; Distributed computing; Routing protocol; Algorithm; Mathematics","score_opus":0.03585037458130336,"score_gpt":0.2846773050909854,"score_spread":0.24882693050968202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286329776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5665821,0.00025578836,0.4319383,0.000750146,0.00022129146,0.00018223446,7.11802e-7,0.000019652081,0.00004978328],"genre_scores_gemma":[0.9395082,0.00051154237,0.059614837,0.00016213846,0.00010654174,0.0000067006404,0.0000028610775,0.000012682918,0.00007448146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863577,0.00030724323,0.00036249627,0.00026238133,0.00017328063,0.000258806],"domain_scores_gemma":[0.9986979,0.0002378802,0.00017387186,0.00018250433,0.00051817397,0.00018967946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009076197,0.00015553793,0.00020611621,0.0001030624,0.00042533508,0.00059213943,0.00021577682,0.000088713066,0.0000020947234],"category_scores_gemma":[0.000143733,0.00014467794,0.000027189222,0.00032156066,0.00008139678,0.00060614763,0.000102953876,0.00028866855,0.0000010930456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013208156,0.00005981602,0.001233505,0.000003954791,0.000027694748,0.000014273583,0.00850585,0.9763178,0.0007763407,0.0016210146,0.0012230236,0.010084606],"study_design_scores_gemma":[0.0012691123,0.00017869544,0.00094766536,0.00006884993,0.0000057846155,0.00017766544,0.00044735151,0.99577737,0.0004190065,0.0000135605615,0.0005179606,0.00017700889],"about_ca_topic_score_codex":0.0000028042132,"about_ca_topic_score_gemma":0.0000125809465,"teacher_disagreement_score":0.37292612,"about_ca_system_score_codex":0.00008727554,"about_ca_system_score_gemma":0.0001139867,"threshold_uncertainty_score":0.58997947},"labels":[],"label_agreement":null},{"id":"W2287608525","doi":"10.1109/tcomm.2015.2506698","title":"Energy Efficiency of Adaptive HARQ","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Transmitter; Rayleigh fading; Decoding methods; Transmission (telecommunications); Channel state information; Channel (broadcasting); Fading; Automatic repeat request; Transmitter power output; Link adaptation; Adaptive coding; Real-time computing; Computer network; Electronic engineering; Algorithm; Wireless; Telecommunications; Engineering","score_opus":0.10757928056429754,"score_gpt":0.30315965570770315,"score_spread":0.1955803751434056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287608525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015797853,0.0007390796,0.9800709,0.0019695489,0.00020079901,0.00009790508,0.000006944924,0.00014977877,0.016607098],"genre_scores_gemma":[0.9633888,0.0012347993,0.03452831,0.00023003273,0.00000749162,0.000064315784,0.0000030883823,0.0000070494098,0.00053611054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987604,0.0003442604,0.00031584885,0.00019421085,0.0002273139,0.00015797606],"domain_scores_gemma":[0.9959318,0.00031973864,0.000114502735,0.0031038926,0.00039869908,0.00013134105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030417446,0.00012457442,0.00016250793,0.00020323839,0.00034141215,0.00004289404,0.0027541323,0.00005225841,0.000016551325],"category_scores_gemma":[0.000010790264,0.000126217,0.00009074661,0.0009482537,0.00019115178,0.00031005897,0.000038244907,0.0002361555,0.00002516546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035363435,0.0020153243,0.000010925764,0.0000049026767,0.00011046502,0.0000010735757,0.0051691923,0.0115916,0.0021921527,0.56766784,0.00255825,0.4086429],"study_design_scores_gemma":[0.0011907043,0.0005525411,0.00005728507,0.00010092942,0.000035193083,0.000016780921,0.00040239136,0.91169184,0.03268046,0.004851012,0.04790911,0.0005117203],"about_ca_topic_score_codex":0.000039766925,"about_ca_topic_score_gemma":0.00015545757,"teacher_disagreement_score":0.96323085,"about_ca_system_score_codex":0.00007832873,"about_ca_system_score_gemma":0.00018560732,"threshold_uncertainty_score":0.51469797},"labels":[],"label_agreement":null},{"id":"W2288408808","doi":"10.1109/glocom.2014.7417620","title":"Best-Relay Selection for Multi-Hop Vehicular Communication in Highways","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Relay; Computer science; Hop (telecommunications); Pairwise error probability; Transmission (telecommunications); Computer network; Telecommunications; Power (physics); Decoding methods","score_opus":0.1116707322582937,"score_gpt":0.35454843155558163,"score_spread":0.24287769929728792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288408808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008281237,0.0024182117,0.9710137,0.009845078,0.00033403572,0.0011476433,0.000026607708,0.0005890013,0.0063444697],"genre_scores_gemma":[0.79601127,0.002943091,0.19984078,0.00050872547,0.000030141648,0.0004022472,0.00009331262,0.000017101129,0.00015333758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964703,0.0013111475,0.00080107327,0.00057880214,0.00029282825,0.00054586545],"domain_scores_gemma":[0.992843,0.0005417023,0.0003639447,0.004960417,0.0010967386,0.00019420753],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015698639,0.00036322285,0.00044596093,0.00019258713,0.00095551944,0.00044474666,0.0065825973,0.00023244541,0.000018554876],"category_scores_gemma":[0.00038893273,0.00039786877,0.00015037593,0.0013205898,0.00026970977,0.0009463107,0.0013371137,0.0005549539,0.00017469547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002440554,0.0010334607,0.0052549765,0.00002912262,0.000057988425,2.5454256e-7,0.0007799181,0.0024874494,0.0009867607,0.87136453,0.008819589,0.10916155],"study_design_scores_gemma":[0.0013349594,0.000109277775,0.00272935,0.00015737167,0.000020108204,0.000009069513,0.000085916596,0.9333645,0.00019246507,0.00259828,0.058934692,0.00046402361],"about_ca_topic_score_codex":0.00032909415,"about_ca_topic_score_gemma":0.0085813925,"teacher_disagreement_score":0.93087703,"about_ca_system_score_codex":0.00046569746,"about_ca_system_score_gemma":0.0002938882,"threshold_uncertainty_score":0.9998473},"labels":[],"label_agreement":null},{"id":"W2289435069","doi":"10.1109/acssc.2015.7421282","title":"Sum-rate maximization for asynchronous two-way relay networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Computer science; Beamforming; Maximization; Asynchronous communication; Transceiver; Relay channel; Channel (broadcasting); Transmitter power output; Transmission (telecommunications); Computer network; Power (physics); Electronic engineering; Topology (electrical circuits); Telecommunications; Transmitter; Wireless; Electrical engineering; Mathematical optimization; Mathematics; Engineering","score_opus":0.06048249265679637,"score_gpt":0.2928647663467199,"score_spread":0.2323822736899235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289435069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063396734,0.0003790965,0.9854786,0.0017053741,0.0004240489,0.00025116536,3.4823768e-7,0.0002398971,0.010887509],"genre_scores_gemma":[0.87965506,0.00022694115,0.11636733,0.0014206907,0.00017059322,0.00006081973,0.000018698573,0.000013718768,0.0020661254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990969,0.0001403338,0.00019807609,0.00024787517,0.00009543936,0.00022138754],"domain_scores_gemma":[0.9987083,0.00014336982,0.000068296074,0.00064577063,0.00030670763,0.00012755638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007177535,0.00010748039,0.00011751363,0.000051608982,0.00017796157,0.00019432344,0.00071741774,0.000043377262,0.000022873188],"category_scores_gemma":[0.00008975522,0.00009509763,0.000041588915,0.00035270533,0.000024138306,0.00040514674,0.00028088046,0.000092172326,0.000042418927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020004214,0.00007499205,0.00051713095,0.0000036399802,0.000023021395,0.0000016669659,0.0006707582,0.16237053,0.00008462977,0.6075476,0.033044964,0.19564106],"study_design_scores_gemma":[0.00062422093,0.0000657477,0.00020598201,0.000007978657,0.0000029579007,0.0000030277995,0.000011518488,0.9749918,0.00014882104,0.0010462272,0.02274779,0.00014394874],"about_ca_topic_score_codex":0.0000069937128,"about_ca_topic_score_gemma":0.0000931434,"teacher_disagreement_score":0.8790211,"about_ca_system_score_codex":0.00006908434,"about_ca_system_score_gemma":0.00007037682,"threshold_uncertainty_score":0.38779688},"labels":[],"label_agreement":null},{"id":"W2290212865","doi":"10.1109/apcc.2015.7412551","title":"Effective capacity of cognitive cooperative relay networks over α-μ fading channels","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Underlay; Fading; Computer science; Relay; Quality of service; Computer network; Network packet; Interference (communication); Cognitive network; Cognitive radio; Constraint (computer-aided design); Power (physics); Signal-to-noise ratio (imaging); Channel (broadcasting); Telecommunications; Mathematics; Wireless","score_opus":0.05748287380590897,"score_gpt":0.2930209793469261,"score_spread":0.23553810554101715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290212865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097261265,0.00038537112,0.88576055,0.00016913036,0.00038672079,0.00044401048,0.0000015552373,0.00012035821,0.015471035],"genre_scores_gemma":[0.99625,0.00008034522,0.0028310264,0.00035486426,0.00007588403,0.00004790765,0.0000039722013,0.000008749525,0.00034727473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850476,0.00046487033,0.0002542527,0.000315409,0.00021709898,0.00024362476],"domain_scores_gemma":[0.9978537,0.0007186669,0.00012445524,0.00041523547,0.00072702614,0.00016094532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007086546,0.00017011283,0.00027000022,0.00009359102,0.00014642661,0.00008867984,0.00059429376,0.00007530997,0.000038430957],"category_scores_gemma":[0.00039406976,0.00014451434,0.000063004256,0.00071920996,0.00012702458,0.00058116514,0.00050612085,0.0002552248,0.000022827666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021151672,0.00080447557,0.008276658,0.000026592936,0.0005803172,0.000023133509,0.07135806,0.10325412,0.0021637904,0.6579411,0.013574642,0.14178562],"study_design_scores_gemma":[0.0016226401,0.00043596805,0.0026914414,0.00021504903,0.000015709991,0.00001022858,0.0003876585,0.982217,0.010664412,0.0005202506,0.00081233965,0.00040726335],"about_ca_topic_score_codex":0.00002128121,"about_ca_topic_score_gemma":0.000037883954,"teacher_disagreement_score":0.8989887,"about_ca_system_score_codex":0.00008106988,"about_ca_system_score_gemma":0.000062502855,"threshold_uncertainty_score":0.5893124},"labels":[],"label_agreement":null},{"id":"W2290326887","doi":"10.1002/dac.3088","title":"Adaptive video protection in large scale peer‐to‐peer video streaming over mobile wireless mesh networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scalability; Wireless mesh network; Computer network; Wireless network; Video quality; Overhead (engineering); Wireless; Peer-to-peer; Mobile device; Real-time computing; Telecommunications","score_opus":0.04656327868252468,"score_gpt":0.3165459383941295,"score_spread":0.2699826597116048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290326887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07706255,0.0019102519,0.9116992,0.0049006427,0.0018590549,0.0007006083,0.0000066510747,0.00006906092,0.0017920197],"genre_scores_gemma":[0.9957424,0.00043164106,0.0028197223,0.00023259193,0.0002503346,0.000104337065,0.000010262869,0.000016627568,0.00039213154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630344,0.00091360783,0.0010115195,0.00021514986,0.0013272212,0.00022903807],"domain_scores_gemma":[0.99340737,0.00025089973,0.0007791127,0.00089821074,0.004465899,0.00019852008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00403548,0.0001790473,0.00032839944,0.00051799027,0.00013113447,0.00047692878,0.0031364993,0.00010319379,0.000009689529],"category_scores_gemma":[0.00027239358,0.00017188097,0.00010280562,0.00067014043,0.000038724553,0.0012810046,0.000845098,0.0005905638,0.00002179697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080208504,0.0017586525,0.016702356,0.000012692287,0.0006510268,0.00006426271,0.050260812,0.5850769,0.0014187888,0.12590647,0.030337708,0.18700819],"study_design_scores_gemma":[0.0017960444,0.00021101911,0.0037370238,0.000675475,0.00000809162,0.00010254167,0.002317585,0.93743956,0.00014972262,0.00026715983,0.053016834,0.00027894776],"about_ca_topic_score_codex":0.00010060734,"about_ca_topic_score_gemma":0.00026834034,"teacher_disagreement_score":0.9186798,"about_ca_system_score_codex":0.00062720425,"about_ca_system_score_gemma":0.0001934605,"threshold_uncertainty_score":0.7009102},"labels":[],"label_agreement":null},{"id":"W2290331499","doi":"10.1109/glocom.2015.7417463","title":"Distributed Space Time Coding for Bit-Interleaved Coded Modulation in Two-Way Relaying Communications","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rician fading; Computer science; Decoding methods; Algorithm; Rayleigh fading; Relay; Bit error rate; Coding (social sciences); Space–time code; Fading; Theoretical computer science; Mathematics; Statistics","score_opus":0.1402441959210119,"score_gpt":0.37247229194772247,"score_spread":0.23222809602671057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290331499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069983597,0.0018172077,0.9454224,0.027975721,0.0004516628,0.0016815225,0.00025504062,0.0006743036,0.014723745],"genre_scores_gemma":[0.8991396,0.0010749748,0.09829761,0.0003243258,0.000035807072,0.00032286954,0.0005927382,0.00002367937,0.00018842284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959939,0.0012498362,0.001042883,0.00063988054,0.0004089394,0.0006645349],"domain_scores_gemma":[0.9890608,0.00079390855,0.00051999744,0.0076839738,0.0015686811,0.00037264105],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018627853,0.00043585035,0.0005909232,0.00023903218,0.0008538756,0.0006280294,0.008824962,0.00016362888,0.00001867077],"category_scores_gemma":[0.0006495472,0.00048874074,0.00016316876,0.001817703,0.00040971508,0.0013030424,0.002940831,0.0005965209,0.00022417183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010019441,0.0009559697,0.005150686,0.000029588717,0.00013133835,0.0000026288967,0.0027246724,0.004191793,0.0024515803,0.8914253,0.026467044,0.066369176],"study_design_scores_gemma":[0.0021157227,0.000072977746,0.0017053024,0.00021703854,0.000024383313,0.000015145063,0.0003172202,0.96183336,0.00010629269,0.012745981,0.020270105,0.0005764693],"about_ca_topic_score_codex":0.00029422747,"about_ca_topic_score_gemma":0.0039297715,"teacher_disagreement_score":0.95764154,"about_ca_system_score_codex":0.0010493345,"about_ca_system_score_gemma":0.00057432865,"threshold_uncertainty_score":0.9997564},"labels":[],"label_agreement":null},{"id":"W2290379373","doi":"10.1109/glocom.2015.7417872","title":"On Channel Reuse for Cloud Network Users","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Computer science; Channel (broadcasting); Computer network; Cloud computing; Interference (communication); Reuse; Service (business); Simple (philosophy); Channel allocation schemes; Assignment problem; Distributed computing; Wireless; Mathematical optimization; Mathematics; Telecommunications; Engineering","score_opus":0.17470084676440947,"score_gpt":0.3604966858107308,"score_spread":0.18579583904632133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290379373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024848338,0.0032598418,0.89482844,0.04242818,0.0029177489,0.0015606937,0.00010010053,0.00089626835,0.051523887],"genre_scores_gemma":[0.9275361,0.0017508371,0.066804826,0.0027632134,0.00022807035,0.0003145268,0.00009424678,0.000023257224,0.0004849554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971768,0.00064497255,0.00057759957,0.00055623887,0.0003890794,0.000655254],"domain_scores_gemma":[0.98904765,0.00052677264,0.0002995702,0.008435434,0.0012375972,0.0004529936],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012736148,0.00036426962,0.00040568382,0.000082309845,0.0008022551,0.00048083637,0.010841371,0.00016636477,0.00001731988],"category_scores_gemma":[0.00060986605,0.00037091578,0.00015337815,0.0010518389,0.0002546064,0.0006166528,0.0024668972,0.00039750137,0.00032192477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033248787,0.00017656328,0.000117210686,0.0000041847425,0.00003942977,6.553993e-7,0.00042477556,0.0015598838,0.0000075734592,0.65637106,0.3311514,0.010114047],"study_design_scores_gemma":[0.0021324116,0.00044333757,0.00046197438,0.00020113218,0.00003766,0.000019314746,0.00022707292,0.44029766,0.000049286908,0.16807544,0.38709036,0.00096434745],"about_ca_topic_score_codex":0.00005265975,"about_ca_topic_score_gemma":0.0006118124,"teacher_disagreement_score":0.9250512,"about_ca_system_score_codex":0.0004097739,"about_ca_system_score_gemma":0.00059631467,"threshold_uncertainty_score":0.9998743},"labels":[],"label_agreement":null},{"id":"W2291414263","doi":"10.1109/acssc.2015.7421285","title":"Multi-user beamforming-aided AF relaying: A low-complexity adaptive design approach","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Computer science; Beamforming; Adaptive beamformer; MIMO; Constraint (computer-aided design); Power (physics); Computational complexity theory; Channel state information; Precoding; Transmitter power output; Control theory (sociology); Electronic engineering; Wireless; Algorithm; Computer network; Engineering; Telecommunications; Channel (broadcasting); Artificial intelligence; Control (management)","score_opus":0.2979500380175181,"score_gpt":0.31901256032821323,"score_spread":0.02106252231069511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291414263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005602701,0.00020640944,0.9809722,0.0004656701,0.00012689366,0.00036534292,4.119537e-7,0.00036671213,0.016936133],"genre_scores_gemma":[0.26295212,0.000027279852,0.73347616,0.0005533773,0.000031267464,0.000042642812,0.00000271821,0.000010588897,0.002903834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983227,0.00035471635,0.0002816412,0.0004263081,0.00028238044,0.000332243],"domain_scores_gemma":[0.9981689,0.000135265,0.00009592637,0.0010412273,0.0003100717,0.00024862812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009799321,0.00019640355,0.00021345673,0.00010216305,0.00026314892,0.00018671926,0.0015028052,0.000068633824,0.000021061],"category_scores_gemma":[0.00012793123,0.00016588256,0.00006472004,0.00058843236,0.00010264458,0.0007305483,0.0008289246,0.00025355053,0.00014036644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008736907,0.00090468506,0.00036554493,0.000014018078,0.00007503689,0.00001049576,0.012490244,0.009112228,0.0012692953,0.9177437,0.022823695,0.03510372],"study_design_scores_gemma":[0.0009942792,0.00009902226,0.00030045674,0.000018583656,0.0000046492446,0.000013897653,0.00032429644,0.98985255,0.0009176176,0.0012530902,0.005891178,0.00033035272],"about_ca_topic_score_codex":0.000018619336,"about_ca_topic_score_gemma":0.000018694374,"teacher_disagreement_score":0.98074037,"about_ca_system_score_codex":0.00012007787,"about_ca_system_score_gemma":0.00016877234,"threshold_uncertainty_score":0.6764495},"labels":[],"label_agreement":null},{"id":"W2291578564","doi":"10.1109/acssc.2015.7421244","title":"Jointly optimal pre- and post-channel equalization and network beamforming in asynchronous two-way relay networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Transceiver; Beamforming; Computer science; Asynchronous communication; Equalization (audio); Channel (broadcasting); Relay channel; Interference (communication); Antenna (radio); Intersymbol interference; Transmitter power output; Electronic engineering; Power (physics); Computer network; Telecommunications; Transmitter; Engineering; Wireless","score_opus":0.029894378784610223,"score_gpt":0.2753070912255893,"score_spread":0.24541271244097906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291578564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06213907,0.002853604,0.9315453,0.0006396608,0.00018848857,0.00023751198,2.3566854e-7,0.00011736393,0.0022787747],"genre_scores_gemma":[0.9561967,0.0008123008,0.041942168,0.0006962774,0.000113500704,0.000016656631,0.0000074450736,0.000011691608,0.00020325095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870646,0.00018954674,0.00030717562,0.0003385614,0.00013822824,0.00032005075],"domain_scores_gemma":[0.9990644,0.00014032083,0.000086299726,0.00039593602,0.00013962487,0.0001734301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094390335,0.00015826605,0.00019654291,0.00009039615,0.00018759447,0.00024177793,0.00033749364,0.00007046281,0.0000048860934],"category_scores_gemma":[0.000067339206,0.00014682925,0.000018320934,0.00045099747,0.000056315133,0.0007013094,0.00075134623,0.00019840375,0.0000029441564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042963704,0.000063626234,0.0031316418,0.00000969519,0.000020818165,0.00000800746,0.0070037837,0.7173679,0.000099582285,0.1650803,0.0008315183,0.10634018],"study_design_scores_gemma":[0.0006574036,0.00013430283,0.003716358,0.00005512246,0.0000032827836,0.000027640814,0.00009429544,0.9941741,0.000020367603,0.00045391667,0.00045610117,0.00020708413],"about_ca_topic_score_codex":0.000056424804,"about_ca_topic_score_gemma":0.0003093442,"teacher_disagreement_score":0.89405763,"about_ca_system_score_codex":0.00005812079,"about_ca_system_score_gemma":0.0000533041,"threshold_uncertainty_score":0.5987523},"labels":[],"label_agreement":null},{"id":"W2291599761","doi":"10.1109/glocom.2015.7417507","title":"Resource Allocation Framework in 5G Multi-Hop Relay System","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Université du Québec à Montréal","funders":"","keywords":"Relay; Software deployment; Computer science; Architecture; Hop (telecommunications); Resource allocation; Computer network; LTE Advanced; Resource management (computing); Resource (disambiguation); Principal (computer security); Distributed computing; Telecommunications link; Computer security","score_opus":0.14822520384097848,"score_gpt":0.35750853897528523,"score_spread":0.20928333513430675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291599761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044757593,0.005398003,0.90817195,0.018808583,0.0007982765,0.0009797642,0.000027552196,0.0009586428,0.06038148],"genre_scores_gemma":[0.88888466,0.00071135996,0.10937888,0.000534184,0.000043940778,0.0001489266,0.000047080455,0.000016222835,0.00023473105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600005,0.0014847154,0.00085866655,0.000616012,0.0004957916,0.00054475944],"domain_scores_gemma":[0.9914351,0.00034938226,0.00035790072,0.006488149,0.0009758267,0.0003936526],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016638867,0.00036319532,0.00044263666,0.00018788931,0.00045990004,0.0004895862,0.0076305848,0.00027247897,0.000013362192],"category_scores_gemma":[0.0004943259,0.0003861285,0.00009844635,0.0019506982,0.00026552792,0.00087139884,0.0012815528,0.0007818606,0.00051232235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020890484,0.00044518805,0.0035975873,0.000019729505,0.000036978385,0.000005712923,0.0027458307,0.0014855106,0.0000741654,0.9346572,0.012873954,0.04403725],"study_design_scores_gemma":[0.001783128,0.00011059747,0.006360197,0.00076857855,0.000025591306,0.0000610507,0.0029550784,0.8519553,0.00008929671,0.0028184126,0.13206096,0.0010118235],"about_ca_topic_score_codex":0.0003239187,"about_ca_topic_score_gemma":0.002127816,"teacher_disagreement_score":0.9318388,"about_ca_system_score_codex":0.0010717551,"about_ca_system_score_gemma":0.000658722,"threshold_uncertainty_score":0.99985904},"labels":[],"label_agreement":null},{"id":"W2291644919","doi":"10.1109/acssc.2015.7421245","title":"Symmetric beamforming for multi-antenna two-way relay networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Relay; Computer science; Transceiver; Antenna (radio); Topology (electrical circuits); Transmitter power output; Power (physics); Signal-to-noise ratio (imaging); Minification; Electronic engineering; Mathematics; Mathematical optimization; Telecommunications; Wireless; Transmitter; Electrical engineering; Engineering; Physics; Channel (broadcasting)","score_opus":0.14188272123150844,"score_gpt":0.3375291661835515,"score_spread":0.19564644495204306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291644919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004904709,0.00092396763,0.9925894,0.0006416641,0.0006086631,0.00027329655,3.649492e-7,0.00023995474,0.004232204],"genre_scores_gemma":[0.52446723,0.00018989283,0.47166976,0.000994101,0.00012033888,0.000053862466,0.000004945901,0.000012550286,0.0024873158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998929,0.00007741349,0.000251422,0.0002835847,0.00014419288,0.00031437012],"domain_scores_gemma":[0.9985046,0.00020358495,0.00007749823,0.0007143349,0.00031822379,0.00018179548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008347058,0.00013084043,0.0001588323,0.00015163029,0.00022018435,0.00017026893,0.0010618308,0.00004656071,0.0000072701428],"category_scores_gemma":[0.00020615286,0.000109472036,0.00007363861,0.00093181443,0.000025602458,0.000462999,0.00050284126,0.0001463236,0.000034321118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014201639,0.00015220967,0.00075265334,0.000005653383,0.000037779548,0.0000028294623,0.0010169194,0.008802722,0.00018264969,0.60435534,0.011044372,0.37363267],"study_design_scores_gemma":[0.0008725807,0.000057815465,0.00009997122,0.000013397758,0.0000035698965,0.000005086171,0.000033393702,0.97874624,0.00008660683,0.00014791956,0.019760868,0.00017257272],"about_ca_topic_score_codex":0.000011160207,"about_ca_topic_score_gemma":0.00006257912,"teacher_disagreement_score":0.9699435,"about_ca_system_score_codex":0.000069816604,"about_ca_system_score_gemma":0.00005266547,"threshold_uncertainty_score":0.446414},"labels":[],"label_agreement":null},{"id":"W2291871635","doi":"10.1109/glocom.2015.7417073","title":"HePNC: A Cross-Layer Design for MIMO Networks with Asymmetric Two-Way Relay Channel","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; MIMO; Relay channel; Computer science; Channel (broadcasting); Computer network; Layer (electronics); Physics; Materials science","score_opus":0.19962204265061248,"score_gpt":0.3754777279001943,"score_spread":0.1758556852495818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291871635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006884931,0.00408454,0.9738374,0.0047688438,0.0005466905,0.0012346139,0.00003250805,0.00044949717,0.01435744],"genre_scores_gemma":[0.82592845,0.0013298347,0.1708123,0.0008180404,0.00009570248,0.00047003428,0.000061779545,0.000028871436,0.0004550143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961809,0.00096649665,0.0007437141,0.00076584844,0.0005096198,0.000833415],"domain_scores_gemma":[0.98985934,0.00069992896,0.00045183665,0.005858233,0.002558869,0.00057179213],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019680979,0.00051103916,0.0005541626,0.0002073407,0.0010263409,0.0010684894,0.007847212,0.00020745015,0.0000142903355],"category_scores_gemma":[0.00032821245,0.00046731575,0.00015113232,0.0025031895,0.000459814,0.0011936808,0.0016535159,0.0005668527,0.00014420599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043857226,0.0014702724,0.0048989286,0.00003291446,0.00045230566,0.000011202599,0.0018696924,0.14158653,0.000064189444,0.5823567,0.13168947,0.13512926],"study_design_scores_gemma":[0.0025975578,0.00038965043,0.0009898525,0.00010873571,0.000043992848,0.000053817894,0.00010142433,0.9564922,0.00008328453,0.0034712693,0.034902666,0.00076556497],"about_ca_topic_score_codex":0.00015601396,"about_ca_topic_score_gemma":0.00089726545,"teacher_disagreement_score":0.82523996,"about_ca_system_score_codex":0.00049066887,"about_ca_system_score_gemma":0.0008555106,"threshold_uncertainty_score":0.99996847},"labels":[],"label_agreement":null},{"id":"W2292216993","doi":"10.1109/acssc.2015.7421281","title":"Jointly optimal distributed beamforming and power control in asynchronous two-way relay networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Transceiver; Beamforming; Computer science; Asynchronous communication; Relay channel; Computer network; Channel (broadcasting); Power control; Transmission (telecommunications); Transmitter power output; Topology (electrical circuits); Power (physics); Transmitter; Wireless; Telecommunications; Engineering; Electrical engineering","score_opus":0.02234485941512526,"score_gpt":0.2589384113820388,"score_spread":0.23659355196691356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292216993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02227794,0.000826676,0.9717677,0.0013285339,0.00014565846,0.00016876846,0.000001004347,0.000113475944,0.0033701935],"genre_scores_gemma":[0.97783506,0.00009001914,0.021269137,0.00067222037,0.00003025658,0.00000911885,0.0000053238273,0.0000066113043,0.00008223588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889845,0.00014314921,0.00026546064,0.0002679033,0.00013165982,0.00029338992],"domain_scores_gemma":[0.999036,0.00013503639,0.00006105671,0.0004825628,0.00011244661,0.0001728946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006811344,0.00013464628,0.00019351524,0.00007160336,0.000110374196,0.00018191047,0.0004978492,0.000051745465,0.00001973587],"category_scores_gemma":[0.00006816393,0.00011718575,0.0000275884,0.000371113,0.00005272066,0.0004722019,0.0004101319,0.00023659966,0.00001249196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014669652,0.00043873177,0.022921475,0.000008278073,0.00010556746,0.00010114489,0.0069349254,0.42066458,0.00043396937,0.34873182,0.011209247,0.18830357],"study_design_scores_gemma":[0.0015815342,0.00008948564,0.0021630842,0.000020734333,0.0000023023347,0.000022042013,0.00007057202,0.99268335,0.000023731474,0.000096073905,0.0030684606,0.00017860314],"about_ca_topic_score_codex":0.000020418598,"about_ca_topic_score_gemma":0.00010493563,"teacher_disagreement_score":0.9555571,"about_ca_system_score_codex":0.000092632705,"about_ca_system_score_gemma":0.000058156038,"threshold_uncertainty_score":0.47786963},"labels":[],"label_agreement":null},{"id":"W2292278363","doi":"10.1007/s10776-016-0296-1","title":"Performance Analysis of the Double-Antenna SDC System Over N-Nakagami Fading Channels","year":2016,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Nakagami distribution; Fading; Computer science; Antenna (radio); Probability density function; Algorithm; Channel (broadcasting); Telecommunications; Cumulative distribution function; Statistics; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.018247433421348484,"score_gpt":0.25520143591972844,"score_spread":0.23695400249837995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292278363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2242652,0.000075719,0.7712078,0.0010012385,0.0023691994,0.00008834653,0.000003406549,0.000025956542,0.0009631095],"genre_scores_gemma":[0.9986111,0.00063255435,0.00030011774,0.00021657499,0.00017746736,0.0000037508526,0.0000024693904,0.000003950113,0.000052012707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980139,0.000088868495,0.00097206223,0.0000790981,0.00069169566,0.00015438822],"domain_scores_gemma":[0.9966611,0.0001658291,0.0013669066,0.00039325978,0.0013547692,0.000058118796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007763352,0.00012184712,0.00026134148,0.00051480567,0.000121191755,0.0001679149,0.0022571874,0.00006251141,0.00002398913],"category_scores_gemma":[0.000030101957,0.00007011932,0.0002600409,0.00094991596,0.00006058025,0.0026184197,0.00039944804,0.00018113379,0.000004881259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029092506,0.00009265218,0.034503464,0.00003487143,0.0032463965,0.0000051676075,0.004185362,0.3135876,0.000917856,0.15821593,0.0014288067,0.48349097],"study_design_scores_gemma":[0.00086274947,0.000025653948,0.020575713,0.00046477377,0.000061381674,0.000033775195,0.000050200062,0.97577804,0.00037052756,0.000009220252,0.0016611404,0.00010679143],"about_ca_topic_score_codex":0.0000026367381,"about_ca_topic_score_gemma":0.000003912698,"teacher_disagreement_score":0.7743459,"about_ca_system_score_codex":0.00020982735,"about_ca_system_score_gemma":0.00007463261,"threshold_uncertainty_score":0.41944534},"labels":[],"label_agreement":null},{"id":"W2292514988","doi":"10.1049/iet-com.2015.0110","title":"Generalised selection at multi‐antenna sources in two‐way relay networks","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Relay; Computer science; Selection (genetic algorithm); Antenna (radio); Telecommunications; Computer network; Artificial intelligence; Physics","score_opus":0.062017376311947155,"score_gpt":0.3177114554492566,"score_spread":0.25569407913730946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292514988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048734438,0.004166298,0.9231691,0.019960543,0.00027878862,0.00041740751,0.0000035891528,0.0004669934,0.0028028537],"genre_scores_gemma":[0.94928545,0.0064303996,0.04165567,0.0004841652,0.000041484705,0.000119693694,0.000011122259,0.000016311902,0.0019556973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981235,0.0007192709,0.00039828062,0.00031978893,0.00011982673,0.00031931515],"domain_scores_gemma":[0.9961216,0.000582596,0.00015037901,0.002868259,0.00018101225,0.00009615612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056966493,0.00016619294,0.00017882223,0.00016997934,0.00066380424,0.00010702584,0.0030458726,0.00006275991,0.000051616593],"category_scores_gemma":[0.00010995162,0.00013277178,0.00007492295,0.00090844743,0.00015657095,0.00048203566,0.0018805526,0.0002694815,0.00010310393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006912278,0.0015935736,0.16953284,0.000012709033,0.00018778098,0.000005459619,0.010349779,0.01745667,0.13026801,0.3655703,0.017955244,0.2869985],"study_design_scores_gemma":[0.0013714203,0.000027178385,0.023319831,0.00011111872,0.000006488148,0.000009460264,0.00002335654,0.9117777,0.00043252125,0.00022778935,0.062344793,0.00034837244],"about_ca_topic_score_codex":0.000060873404,"about_ca_topic_score_gemma":0.005421244,"teacher_disagreement_score":0.900551,"about_ca_system_score_codex":0.00024057811,"about_ca_system_score_gemma":0.00004513282,"threshold_uncertainty_score":0.566004},"labels":[],"label_agreement":null},{"id":"W2293707299","doi":"10.1109/tccn.2015.2498615","title":"Cognitive Beamforming in Underlay Two-Way Relay Networks With Multiantenna Terminals","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Beamforming; Computer science; Underlay; Relay; Cognitive radio; Interference (communication); Algorithm; Power (physics); Topology (electrical circuits); Signal-to-noise ratio (imaging); Computer network; Mathematics; Telecommunications; Wireless; Combinatorics; Physics","score_opus":0.09257484298015302,"score_gpt":0.32278028226525307,"score_spread":0.23020543928510007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293707299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008643343,0.004193613,0.9825021,0.00067453226,0.00021812263,0.0005882858,0.0000064330543,0.00017630342,0.0029972717],"genre_scores_gemma":[0.9785814,0.009755558,0.01043691,0.00075281685,0.00006028,0.00024736053,0.000014894367,0.000034634486,0.00011613758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753803,0.00067082123,0.000492394,0.00054618635,0.00025721997,0.00049536827],"domain_scores_gemma":[0.9963412,0.0016640197,0.000203934,0.0010548808,0.00048611598,0.00024983854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089904235,0.00034883205,0.000365026,0.00037064322,0.00089586125,0.0002623404,0.0009908314,0.00011110324,0.0000066386465],"category_scores_gemma":[0.000018785357,0.00032829144,0.00007342368,0.0014041001,0.0004165212,0.0007228441,0.00008173649,0.0009758014,0.000012668571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017895286,0.0004930795,0.0011801003,0.000008482435,0.00012807566,0.000020802941,0.0041979407,0.0081219375,0.00002929718,0.0012772104,0.00001542372,0.9843487],"study_design_scores_gemma":[0.0038104432,0.00044823386,0.00069157564,0.0020460794,0.00007993728,0.000104022176,0.0019050121,0.9889671,0.00016177482,0.00020210666,0.0008912865,0.0006923845],"about_ca_topic_score_codex":0.000055712186,"about_ca_topic_score_gemma":0.002450375,"teacher_disagreement_score":0.9836563,"about_ca_system_score_codex":0.00012140253,"about_ca_system_score_gemma":0.00011762346,"threshold_uncertainty_score":0.9999169},"labels":[],"label_agreement":null},{"id":"W2294218193","doi":"10.1109/isit.2017.8006608","title":"Novel Outer Bounds and Capacity Results for the Interference Channel With Conferencing Receivers","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interference (communication); Channel (broadcasting); Computer science; SIGNAL (programming language); Channel capacity; Gaussian; Topology (electrical circuits); Telecommunications; Mathematics; Physics; Combinatorics","score_opus":0.16287206490437312,"score_gpt":0.3069569419173385,"score_spread":0.1440848770129654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294218193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012890066,0.00017360266,0.9801564,0.008066788,0.00046886495,0.00053741806,0.000024949171,0.00008688633,0.009196069],"genre_scores_gemma":[0.9627549,0.0009075428,0.0343481,0.0004024808,0.00007669741,0.000097510485,0.000009338954,0.0000086369755,0.0013948099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988055,0.000052746942,0.00022540774,0.0005658659,0.00013284813,0.00021762373],"domain_scores_gemma":[0.996895,0.00044108782,0.00027639917,0.0019161564,0.0004017129,0.000069637186],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00068188336,0.00023489284,0.0002437248,0.00005496067,0.0007850368,0.0012315536,0.002434613,0.0001094154,0.0000023643697],"category_scores_gemma":[0.00015930318,0.0001427969,0.00005091995,0.000046889294,0.00022349751,0.0002399952,0.0026801839,0.00049989624,0.0000017228409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081327924,0.00029451607,0.00038650277,0.00040816146,0.0011512309,0.000007254916,0.07058352,0.0028326928,0.0013844051,0.51513,0.021681966,0.38532647],"study_design_scores_gemma":[0.002043661,0.0002239195,0.0032069664,0.00094016985,0.000048292954,0.000028283735,0.00025734399,0.9749995,0.0007491892,0.003489533,0.013198307,0.0008148343],"about_ca_topic_score_codex":0.00014034843,"about_ca_topic_score_gemma":0.0014622769,"teacher_disagreement_score":0.9721668,"about_ca_system_score_codex":0.000050983053,"about_ca_system_score_gemma":0.0001683867,"threshold_uncertainty_score":0.9998053},"labels":[],"label_agreement":null},{"id":"W2294224885","doi":"10.1109/tvt.2015.2389826","title":"Overhearing Protocol Design Exploiting Intercell Interference in Cooperative Green Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Key Research and Development Program of China; Ministry of Education; National Natural Science Foundation of China","keywords":"Relay; Telecommunications link; Transmitter; Computer science; Transmitter power output; Interference (communication); Cellular network; Computer network; Enhanced Data Rates for GSM Evolution; Power (physics); Telecommunications; Channel (broadcasting)","score_opus":0.07880553506764897,"score_gpt":0.30135268947620647,"score_spread":0.2225471544085575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294224885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015385789,0.000035169218,0.9889589,0.0009839868,0.00014092462,0.007602314,3.331886e-7,0.0004370639,0.00030270984],"genre_scores_gemma":[0.96851635,0.00002564559,0.014017149,0.00021407545,0.000014399501,0.017077735,3.7812694e-7,0.000017006505,0.0001172398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983592,0.00031909815,0.00037065204,0.00046169152,0.00013946666,0.00034987522],"domain_scores_gemma":[0.9987343,0.00010822774,0.00008289578,0.00078607316,0.00019862555,0.000089852736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005012198,0.00021700839,0.00024891723,0.00052303163,0.00018892233,0.00009230542,0.0011394861,0.00020653548,0.000014574561],"category_scores_gemma":[0.000023759043,0.0002125864,0.000050490493,0.0013790424,0.000117054595,0.00038684648,0.0000406136,0.0008871216,0.000043259406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010795936,0.0004752737,0.00010332612,0.000013506635,0.00005137489,0.00007189951,0.0018212218,0.58679813,0.0040575103,0.00827495,0.00012790711,0.39809695],"study_design_scores_gemma":[0.0011000364,0.0004705428,0.0000135004075,0.0002052914,0.0000039822235,0.000038587845,0.0002140915,0.9635955,0.032565314,0.0006591587,0.0008331995,0.00030075866],"about_ca_topic_score_codex":0.000021196918,"about_ca_topic_score_gemma":0.00014732018,"teacher_disagreement_score":0.9749418,"about_ca_system_score_codex":0.00021554274,"about_ca_system_score_gemma":0.00010091385,"threshold_uncertainty_score":0.8669022},"labels":[],"label_agreement":null},{"id":"W2294378931","doi":"10.1109/lcomm.2015.2503277","title":"Per-Node Traffic Load in Cooperative Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Wireless sensor network; Fading; Key distribution in wireless sensor networks; Sink (geography); Node (physics); Wireless network; Cooperative diversity; Multipath routing; Wireless; Routing protocol; Distributed computing; Routing (electronic design automation); Channel (broadcasting); Dynamic Source Routing; Telecommunications; Engineering","score_opus":0.06853717599742386,"score_gpt":0.29738751054898604,"score_spread":0.22885033455156217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294378931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26035157,0.0043461756,0.6314132,0.0958288,0.00086930784,0.00090093655,0.0000048321904,0.0006785902,0.0056065368],"genre_scores_gemma":[0.9706296,0.0013376062,0.021800637,0.0058913226,0.000059371465,0.00011691751,0.000015863949,0.000021350435,0.00012736444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974514,0.0010009056,0.00046922037,0.00038526306,0.00029889893,0.00039431098],"domain_scores_gemma":[0.99502856,0.00040218997,0.00013112478,0.0038907963,0.00036241682,0.00018493504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009124438,0.00024009528,0.00028532417,0.0001826141,0.0003176336,0.00026119524,0.004239088,0.00008547838,0.000008289605],"category_scores_gemma":[0.00007564769,0.0002481873,0.00007277332,0.0011060075,0.0002752736,0.00059334276,0.00083245477,0.00066970347,0.00012644901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049480182,0.0009951508,0.0020794966,0.000012994641,0.0001200493,0.00003246022,0.02434435,0.7634819,0.010892865,0.028148869,0.058479913,0.111362465],"study_design_scores_gemma":[0.001023514,0.0000350611,0.0006712796,0.000072309485,0.0000069842663,0.000020158623,0.00028931221,0.96673083,0.00016594896,0.000017973594,0.030518038,0.0004486054],"about_ca_topic_score_codex":0.000031417305,"about_ca_topic_score_gemma":0.0005885986,"teacher_disagreement_score":0.710278,"about_ca_system_score_codex":0.00043344343,"about_ca_system_score_gemma":0.00022942721,"threshold_uncertainty_score":0.999997},"labels":[],"label_agreement":null},{"id":"W2294531726","doi":"10.1109/twc.2015.2487974","title":"Detect-and-Forward Multirelay Systems With Decision-Feedback Differential Coherent Receivers","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Computer science; Demodulation; Fading; Channel (broadcasting); Initialization; Differential (mechanical device); Telecommunications link; Differential coding; Signal-to-noise ratio (imaging); Algorithm; Control theory (sociology); Electronic engineering; Telecommunications; Decoding methods; Artificial intelligence","score_opus":0.04924061961761703,"score_gpt":0.2794181259794317,"score_spread":0.2301775063618147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294531726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015935201,0.00064483075,0.9799092,0.0013357545,0.00043134755,0.0004865918,0.000012431501,0.00032115448,0.0009235177],"genre_scores_gemma":[0.96688133,0.0031861789,0.029254913,0.00009814177,0.000015271258,0.0002315142,0.0000056894964,0.000025513402,0.00030145643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806595,0.00045105044,0.00040283424,0.00039922932,0.00039733498,0.00028357623],"domain_scores_gemma":[0.99539834,0.0006496592,0.00014749863,0.0030824177,0.00038971956,0.00033239138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002886191,0.00026902242,0.00031031,0.00023040496,0.0008808706,0.00032039534,0.002231685,0.00010883916,0.000014845809],"category_scores_gemma":[0.000011714639,0.00023257743,0.00007790014,0.00071105355,0.00027567777,0.00046773092,0.0000642633,0.0005796595,0.000082519044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019175516,0.00077073666,0.00010345437,0.000021922022,0.0003117993,0.000004802304,0.0046626753,0.032562554,0.0009048521,0.023333391,0.0011546311,0.9359774],"study_design_scores_gemma":[0.0035794503,0.00053690694,0.00051598274,0.00046521047,0.000095901094,0.00007344748,0.0007093374,0.9756232,0.0015164147,0.00028878907,0.015696349,0.00089900335],"about_ca_topic_score_codex":0.000058826132,"about_ca_topic_score_gemma":0.0005187903,"teacher_disagreement_score":0.9509461,"about_ca_system_score_codex":0.00018445456,"about_ca_system_score_gemma":0.00018343425,"threshold_uncertainty_score":0.9484232},"labels":[],"label_agreement":null},{"id":"W2295261104","doi":"","title":"Low Complexity Selection Cooperation Techniques Using Information Accumulation in Dual-Hop Relaying Networks","year":2011,"lang":"en","type":"article","venue":"Wireless Conference - Sustainable Wireless Technologies , European","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Computer science; Relay; Fading; Hop (telecommunications); Signal-to-noise ratio (imaging); Transmission (telecommunications); Algorithm; Outage probability; Selection (genetic algorithm); Decoding methods; Topology (electrical circuits); Mathematics; Computer network; Telecommunications; Physics","score_opus":0.09057344832039943,"score_gpt":0.28580014231393397,"score_spread":0.19522669399353454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295261104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25996926,0.000060453254,0.73145443,0.00021094341,0.00009371861,0.0007658453,0.0000010219277,0.0025127956,0.004931552],"genre_scores_gemma":[0.9840794,0.00070691813,0.014867267,0.000102744285,0.00002774591,0.000074938165,0.00003509137,0.000033780685,0.000072084615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996702,0.0006613275,0.00091572973,0.0005961565,0.00029991803,0.00082485285],"domain_scores_gemma":[0.99719626,0.00007310632,0.0005189235,0.0010691853,0.0010704034,0.0000721285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013553206,0.00043267253,0.00041441276,0.000856317,0.0008410901,0.0006935818,0.0013831359,0.0002736187,0.000021072847],"category_scores_gemma":[0.00019425857,0.00045723686,0.00006938937,0.0024045703,0.00031767247,0.004646558,0.0015808606,0.00087428826,0.000018775201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053945547,0.00020887969,0.003286838,0.0001222255,0.000019005718,0.000046504374,0.0030659046,0.0037917062,0.0038016064,0.62483954,0.000091746086,0.36067212],"study_design_scores_gemma":[0.0005145615,0.00015538522,0.002988045,0.00031027288,0.000009982102,0.00003000764,0.0038717557,0.9707008,0.018049415,0.0018752902,0.00072525366,0.00076923746],"about_ca_topic_score_codex":0.00017962854,"about_ca_topic_score_gemma":0.0001157658,"teacher_disagreement_score":0.9669091,"about_ca_system_score_codex":0.0005492547,"about_ca_system_score_gemma":0.00020086241,"threshold_uncertainty_score":0.9997879},"labels":[],"label_agreement":null},{"id":"W2295288239","doi":"10.1109/wcnc.2015.7127555","title":"Asymptotically tight error rate bounds for diversity receptions over arbitrarily correlated Rician channels","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Upper and lower bounds; Rician fading; Applied mathematics; Signal-to-noise ratio (imaging); Mathematics; Noise (video); Asymptotically optimal algorithm; Monte Carlo method; Diversity combining; Computer science; Algorithm; Statistics; Mathematical analysis","score_opus":0.09913964710677867,"score_gpt":0.3052042786507734,"score_spread":0.2060646315439947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295288239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010586085,0.000104792816,0.9558716,0.005999118,0.0010972422,0.0003581574,0.000003672205,0.00034051004,0.025638845],"genre_scores_gemma":[0.9669882,0.00005592265,0.02189417,0.0029842148,0.000087924396,0.000021709464,0.000017780021,0.000009346527,0.007940708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892825,0.00014398544,0.00019574363,0.00029539302,0.00016619623,0.00027040765],"domain_scores_gemma":[0.9985879,0.00017497268,0.00006423725,0.0005674884,0.00038481053,0.00022059618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005843683,0.00013136178,0.00015216277,0.000088799155,0.0006399104,0.0002189427,0.000959974,0.00008005496,0.00010429166],"category_scores_gemma":[0.00013398752,0.000118086115,0.000075047996,0.0005073358,0.000063745705,0.00051084976,0.000990811,0.0001699442,0.00013010502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071315735,0.00033306718,0.0015238434,0.0000074693344,0.00010504225,0.0000047552217,0.005099836,0.0010171805,0.0005724878,0.82130206,0.1575531,0.0124098305],"study_design_scores_gemma":[0.001904578,0.0002865925,0.005701802,0.0000334482,0.000025134312,0.0000054658904,0.00008237186,0.8494213,0.00024417276,0.0130009875,0.12877947,0.0005146514],"about_ca_topic_score_codex":0.000013951604,"about_ca_topic_score_gemma":0.00008552875,"teacher_disagreement_score":0.9564021,"about_ca_system_score_codex":0.00009487324,"about_ca_system_score_gemma":0.0001220016,"threshold_uncertainty_score":0.4921738},"labels":[],"label_agreement":null},{"id":"W2295334956","doi":"10.1109/lcomm.2015.2513775","title":"BER Upper Bound Expressions in Coded Two-Transmission Schemes With Arbitrarily Spaced Signal Constellations","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Economic Development and Innovation","keywords":"Fading; Transmission (telecommunications); Upper and lower bounds; Algorithm; Trellis (graph); Computer science; Mathematics; Nakagami distribution; Convolutional code; Expression (computer science); Signal-to-noise ratio (imaging); Trellis modulation; Decoding methods; Constellation diagram; Topology (electrical circuits); Bit error rate; Telecommunications; Combinatorics; Mathematical analysis","score_opus":0.0645962669066422,"score_gpt":0.30417380889149725,"score_spread":0.23957754198485504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295334956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1107107,0.0019997696,0.8063885,0.06605078,0.00016509733,0.00077671267,0.0000061247306,0.00039721848,0.01350508],"genre_scores_gemma":[0.85301113,0.000292552,0.14386922,0.0025473002,0.000024911653,0.00008976057,0.000026118778,0.000019452975,0.00011954181],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795383,0.0006108792,0.00041412425,0.00035838972,0.00032327176,0.00033950544],"domain_scores_gemma":[0.9959411,0.00046525252,0.00014482993,0.0029834772,0.00023034964,0.00023501017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047177263,0.0002329063,0.00024533682,0.00029234198,0.00056796765,0.00027133583,0.0026125992,0.000065489614,0.0000304567],"category_scores_gemma":[0.00002988546,0.00020941964,0.00006423916,0.0010574711,0.0003824492,0.0007613078,0.0004722223,0.00057873677,0.00004854389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024803088,0.002415698,0.030467859,0.000044364446,0.00035278714,0.000052102416,0.037421405,0.04171836,0.5080003,0.24523564,0.056690786,0.077352636],"study_design_scores_gemma":[0.01060655,0.00023262137,0.0052995514,0.0013025275,0.00008325431,0.00012914512,0.0011784299,0.5709162,0.020900073,0.002371211,0.38454047,0.0024399888],"about_ca_topic_score_codex":0.00004179425,"about_ca_topic_score_gemma":0.00021592157,"teacher_disagreement_score":0.74230045,"about_ca_system_score_codex":0.00014259937,"about_ca_system_score_gemma":0.00027904543,"threshold_uncertainty_score":0.8539885},"labels":[],"label_agreement":null},{"id":"W2295703532","doi":"10.1109/tsp.2015.2454487","title":"Optimal Resource Sharing and Network Beamforming in Multi-Carrier Bidirectional Relay Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Computer science; Transceiver; Beamforming; Spectral efficiency; Computer network; Relay channel; Topology (electrical circuits); Resource allocation; Shared resource; Interference (communication); Constraint (computer-aided design); Mathematical optimization; Power (physics); Telecommunications; Mathematics; Channel (broadcasting); Wireless; Engineering; Electrical engineering","score_opus":0.06555621047340339,"score_gpt":0.2933126313010925,"score_spread":0.2277564208276891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295703532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010227276,0.001346714,0.9873735,0.00021346299,0.000150668,0.00013272116,5.2708265e-7,0.0001663734,0.00038876195],"genre_scores_gemma":[0.95492816,0.000091929105,0.044302877,0.00025539016,0.00008544987,0.000034847322,0.000001138681,0.000018995543,0.00028121404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985249,0.00011308228,0.0003255312,0.00044643605,0.00023117264,0.00035888684],"domain_scores_gemma":[0.9992516,0.00010018817,0.00008845419,0.000268857,0.00010887292,0.00018201402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007876288,0.00018720144,0.00019244097,0.00018186409,0.00056588947,0.00029953994,0.00044452,0.00009913668,0.000008860282],"category_scores_gemma":[0.000006504894,0.00019180175,0.000044431883,0.0009092226,0.000069904956,0.00077933766,0.000022660515,0.00058395776,0.0000034728678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002595401,0.000050457034,0.00021718093,0.0000047883377,0.000007852177,0.0000039241095,0.0009321367,0.8620782,0.00004654756,0.000084246676,0.000041215808,0.13650754],"study_design_scores_gemma":[0.0006005908,0.000051596864,0.000113788,0.00019756121,0.0000064144992,0.000031054376,0.00010942918,0.9968015,0.00022891368,0.00003943841,0.0015966517,0.00022309202],"about_ca_topic_score_codex":0.000006969055,"about_ca_topic_score_gemma":0.000053735275,"teacher_disagreement_score":0.9447009,"about_ca_system_score_codex":0.00012516406,"about_ca_system_score_gemma":0.00010069917,"threshold_uncertainty_score":0.78214484},"labels":[],"label_agreement":null},{"id":"W2296439027","doi":"10.1109/tvt.2016.2517042","title":"Modeling and Analysis of Cooperative Relaying in Spectrum-Sharing Cellular Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Electronic engineering; Engineering; Computer network","score_opus":0.0244527046083669,"score_gpt":0.24926056232298488,"score_spread":0.22480785771461798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296439027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30940458,0.0004448625,0.6892565,0.00061764574,0.000054963253,0.000097719625,0.0000016676589,0.00009050507,0.00003154528],"genre_scores_gemma":[0.99751776,0.0008233619,0.0015561093,0.000017934397,0.0000027959097,0.00003595147,3.645089e-7,0.000007024691,0.000038687052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989362,0.000080092614,0.000326138,0.0003647781,0.000109239125,0.00018355905],"domain_scores_gemma":[0.9990639,0.00007356763,0.000058225778,0.0006905487,0.00008217784,0.000031562427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026776246,0.000121512,0.0003012519,0.0013018766,0.00013313905,0.000029492001,0.00051033276,0.00013077898,0.0000066590005],"category_scores_gemma":[0.000009561802,0.00009713541,0.00006282997,0.002242947,0.00008115473,0.0001894633,0.00001733751,0.00022339464,0.0000035137962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010556499,0.00011952533,0.0006540705,0.000011472808,0.00041360894,0.000015710679,0.0004602097,0.8061454,0.09158508,0.06877016,7.503469e-7,0.031813435],"study_design_scores_gemma":[0.00027353666,0.000050018607,0.00003164218,0.0001004249,0.00004923512,0.0000045225247,0.00005824482,0.9684238,0.03064704,0.00022222757,0.000018989835,0.00012035045],"about_ca_topic_score_codex":0.000021087424,"about_ca_topic_score_gemma":0.00011584805,"teacher_disagreement_score":0.6881132,"about_ca_system_score_codex":0.00007781702,"about_ca_system_score_gemma":0.000020428244,"threshold_uncertainty_score":0.3961067},"labels":[],"label_agreement":null},{"id":"W2299602071","doi":"10.1002/dac.3099","title":"Novel noncoherent detection for multi‐hop amplify‐and‐forward relaying systems","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Detector; Computer science; Bit error rate; Hop (telecommunications); Algorithm; Fading; Gaussian; Gaussian noise; Energy (signal processing); Word error rate; Noise (video); Telecommunications; Speech recognition; Statistics; Mathematics; Physics; Artificial intelligence; Decoding methods","score_opus":0.1570804721355105,"score_gpt":0.3643644036024294,"score_spread":0.2072839314669189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299602071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003758744,0.008038575,0.98381346,0.0011259177,0.0024775774,0.00033511003,0.000005326273,0.000046634083,0.00039866913],"genre_scores_gemma":[0.97239447,0.0014128542,0.025641462,0.00008746955,0.00023193439,0.000056864552,0.0000071616378,0.000013383485,0.00015441526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979927,0.00032501636,0.0008706793,0.00014776591,0.000529779,0.00013408114],"domain_scores_gemma":[0.99497646,0.00039890903,0.0009713288,0.0006309386,0.0028648626,0.00015748924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022252868,0.00013692274,0.00026164207,0.0002778832,0.0001703887,0.0006092573,0.0021044256,0.00008237211,6.9950266e-7],"category_scores_gemma":[0.00037407284,0.00012371998,0.00008554163,0.00017934514,0.000045550234,0.0008559626,0.00041708522,0.00027952265,0.0000064442243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005696369,0.0013103763,0.0030240105,0.00008577911,0.001840475,0.0000126898685,0.020588355,0.12089526,0.02720187,0.5608921,0.0069638323,0.25661564],"study_design_scores_gemma":[0.0029365886,0.0001640569,0.00044040874,0.00043433037,0.00002101251,0.000467633,0.0013313335,0.83251876,0.0002745996,0.00014748631,0.16102462,0.00023916713],"about_ca_topic_score_codex":0.00004986321,"about_ca_topic_score_gemma":0.000025720201,"teacher_disagreement_score":0.96863574,"about_ca_system_score_codex":0.0003033669,"about_ca_system_score_gemma":0.00013354143,"threshold_uncertainty_score":0.5875082},"labels":[],"label_agreement":null},{"id":"W2300078924","doi":"10.1049/iet-com.2015.0278","title":"Impact of spatial correlation on the BER performance of cooperative wireless relay networks with OSTBC","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Relay; Computer science; Wireless; Correlation; Wireless network; Spatial correlation; Computer network; Telecommunications; Mathematics; Physics","score_opus":0.03307229851139004,"score_gpt":0.2815571083553935,"score_spread":0.24848480984400345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2300078924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5350281,0.00029857145,0.4543319,0.004839961,0.00006837389,0.0004762014,0.000010780953,0.0000641895,0.0048819184],"genre_scores_gemma":[0.99584556,0.0018296599,0.0020319552,0.0000720546,0.000013621713,0.00004684734,0.000008121919,0.000010009871,0.0001421539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870694,0.0004620283,0.00033491736,0.00015836966,0.00018696787,0.00015078193],"domain_scores_gemma":[0.99480236,0.001319782,0.00030786646,0.0030109652,0.0005164189,0.00004260973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004066942,0.0001366975,0.00018665701,0.00006874274,0.0003642008,0.000029158049,0.00216605,0.000051714323,0.00004324564],"category_scores_gemma":[0.00006569153,0.00006927673,0.000072664225,0.0005431669,0.00038698697,0.00029694452,0.00052888517,0.00023588067,0.000012696154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034689196,0.0011059864,0.12295717,0.000012790944,0.00047329278,5.4886385e-7,0.006221878,0.072873384,0.006663659,0.45009863,0.0025602698,0.3366855],"study_design_scores_gemma":[0.0007815266,0.0009997159,0.16125475,0.00046872394,0.000019700667,0.0000053922854,0.000036470898,0.8340695,0.001383913,0.000055505036,0.0006810898,0.00024372198],"about_ca_topic_score_codex":0.000039188544,"about_ca_topic_score_gemma":0.0001459013,"teacher_disagreement_score":0.76119614,"about_ca_system_score_codex":0.000069576716,"about_ca_system_score_gemma":0.00013227733,"threshold_uncertainty_score":0.4025096},"labels":[],"label_agreement":null},{"id":"W2311456574","doi":"10.1109/icc.2016.7510782","title":"Decoding and file transfer delay balancing in network coding broadcast","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; File transfer; Network packet; Computer network; Decoding methods; Multicast; Sliding window protocol; Coding (social sciences); File size; Algorithm; Transfer (computing); Window (computing); Parallel computing; Operating system; Mathematics","score_opus":0.03181003905063806,"score_gpt":0.26830463225998724,"score_spread":0.23649459320934918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311456574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004166126,0.0024719548,0.9724685,0.0012958811,0.0005309709,0.00033412292,0.000013883436,0.00022784607,0.018490696],"genre_scores_gemma":[0.95740217,0.0052099335,0.035716902,0.0006962934,0.00024023413,0.00008610259,0.00002107801,0.00002491235,0.0006023475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979941,0.0002428113,0.0004571579,0.0006717422,0.00017204064,0.00046210733],"domain_scores_gemma":[0.9982556,0.00058098877,0.00006502224,0.00089758734,0.0000790172,0.000121781806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007009371,0.00029397858,0.00038617905,0.00015891528,0.00021848356,0.00036250343,0.0011633493,0.0001915276,0.00046938047],"category_scores_gemma":[0.00005382918,0.00024840582,0.00007596661,0.00029878554,0.000047836766,0.00029317502,0.0023058315,0.000601846,0.000019791594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015085431,0.000055661254,0.0053258436,0.000112721704,0.00007070256,0.00004843498,0.0030206442,0.0028186683,0.0005605101,0.22467355,0.021514775,0.7417834],"study_design_scores_gemma":[0.0013139349,0.000053692922,0.008147673,0.0044413493,0.000017106733,0.00005821545,0.00005383943,0.9330922,0.00035397738,0.012043454,0.03871315,0.0017114318],"about_ca_topic_score_codex":0.000013233351,"about_ca_topic_score_gemma":0.00025358226,"teacher_disagreement_score":0.95323604,"about_ca_system_score_codex":0.0001160547,"about_ca_system_score_gemma":0.00010608514,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W2317933924","doi":"10.1109/twc.2015.2504471","title":"Design and Analysis of Heterogeneous Physical Layer Network Coding","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Phase-shift keying; Computer science; Relay; Linear network coding; Computer network; Throughput; Channel (broadcasting); Quadrature amplitude modulation; Bottleneck; Decoding methods; Relay channel; Physical layer; Electronic engineering; Bit error rate; Wireless; Telecommunications; Network packet; Engineering; Physics","score_opus":0.10319156361712956,"score_gpt":0.316668166497609,"score_spread":0.21347660288047943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317933924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012781783,0.00038816067,0.9854448,0.0007272736,0.00007866016,0.00018851514,0.00000490833,0.00012164294,0.00026430073],"genre_scores_gemma":[0.95462835,0.0014085855,0.043693572,0.00013906945,0.000009471373,0.00006380713,0.000004518734,0.000010646706,0.000041971052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984703,0.0005986683,0.00029583718,0.0002418961,0.00020134258,0.00019196689],"domain_scores_gemma":[0.99644226,0.0007588357,0.00012703019,0.0022905685,0.0002365269,0.00014477829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004383026,0.00015026021,0.00032486435,0.0002648114,0.00042882306,0.00008161356,0.0014836984,0.000052079948,0.0000050080876],"category_scores_gemma":[0.0000064495125,0.00015227389,0.00012325728,0.0018718223,0.00017792826,0.00023608754,0.000047576403,0.00026379907,0.000007743023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025642832,0.0005109232,0.00009313803,0.000005170269,0.00086734875,0.0000010466323,0.004345371,0.8490873,0.0019249964,0.029209204,0.00013828964,0.113791555],"study_design_scores_gemma":[0.00023381166,0.00007546601,0.000117578355,0.000022755561,0.00019476481,0.0000034592529,0.000027706272,0.99549925,0.003108388,0.00029219635,0.00026766295,0.00015696482],"about_ca_topic_score_codex":0.000010793519,"about_ca_topic_score_gemma":0.00006550194,"teacher_disagreement_score":0.94184655,"about_ca_system_score_codex":0.000054831144,"about_ca_system_score_gemma":0.000070999304,"threshold_uncertainty_score":0.62095493},"labels":[],"label_agreement":null},{"id":"W2319277364","doi":"10.1155/2016/9187438","title":"Joint TAS and Power Allocation for SDF Relaying M2M Cooperative Networks","year":2016,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Nakagami distribution; Relay; Fading; Computer science; Transmitter power output; Selection (genetic algorithm); Power (physics); Outage probability; Antenna (radio); Joint (building); Mathematical optimization; Algorithm; Mathematics; Computer network; Telecommunications; Engineering; Channel (broadcasting); Artificial intelligence","score_opus":0.027986830548061552,"score_gpt":0.24042845127644313,"score_spread":0.21244162072838157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319277364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017566436,0.00038375,0.99582106,0.0011343214,0.000070699185,0.00039149864,4.05018e-7,0.00011348851,0.00032816417],"genre_scores_gemma":[0.94991684,0.00015035823,0.04959315,0.00006509203,0.000019851434,0.0001606061,7.0151754e-7,0.000014682712,0.00007873088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909,0.000033134915,0.00031579068,0.00023521455,0.00008652151,0.00023930114],"domain_scores_gemma":[0.99907166,0.00043039743,0.00004263896,0.0003213014,0.000069311485,0.00006471049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059094053,0.00013225124,0.00018360722,0.00008244498,0.00007223097,0.00008369316,0.00026357503,0.00005774191,0.000011596418],"category_scores_gemma":[0.00031332695,0.00009559031,0.000028273822,0.00020715794,0.000027158478,0.00030983772,0.00021294745,0.00011757562,0.000005960242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024194599,0.00006343903,0.000042433036,0.00011199996,0.000020986972,0.0000011443225,0.0014963526,0.15281771,0.008324608,0.8148682,0.00017579492,0.022074884],"study_design_scores_gemma":[0.0003895125,0.00004316093,0.000083879786,0.00051729864,0.000002200379,0.0000065930067,0.000009993096,0.99373406,0.00041924248,0.004051772,0.00056617486,0.00017612871],"about_ca_topic_score_codex":2.5963146e-7,"about_ca_topic_score_gemma":0.0000013414891,"teacher_disagreement_score":0.9481602,"about_ca_system_score_codex":0.000060386286,"about_ca_system_score_gemma":0.000011954606,"threshold_uncertainty_score":0.38980594},"labels":[],"label_agreement":null},{"id":"W2323143645","doi":"10.1007/s12083-016-0454-3","title":"Joint TAS and power allocation for D2D cooperative networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Young Scientists Fund; Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Nakagami distribution; Transmitter power output; Relay; Fading; Outage probability; Computer science; Antenna (radio); Power (physics); Joint (building); Topology (electrical circuits); Performance improvement; Electronic engineering; Mathematics; Telecommunications; Engineering; Transmitter; Channel (broadcasting); Physics","score_opus":0.03633668490090542,"score_gpt":0.288388145615534,"score_spread":0.2520514607146286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323143645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009918743,0.0006415288,0.94983685,0.04610317,0.00016925734,0.0011084228,0.000009052557,0.0001641759,0.0009756723],"genre_scores_gemma":[0.9662993,0.00047327668,0.025885383,0.0025394575,0.00047184102,0.0014731662,0.000020238647,0.000025627885,0.0028117015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983864,0.00007821359,0.00031994964,0.00061561295,0.00022567861,0.0003741625],"domain_scores_gemma":[0.9978105,0.00038255093,0.00008923391,0.00070153055,0.00071933214,0.0002968961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077554246,0.0002128602,0.00022227998,0.00011300036,0.0007104776,0.00031268754,0.0004883006,0.000075625314,0.000008103868],"category_scores_gemma":[0.0000772287,0.00016992069,0.000041274558,0.0005999903,0.0000715154,0.00020213117,0.00044526282,0.00011872609,0.000024705092],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147287155,0.000062445804,0.0002945732,0.000006023656,0.000040622985,2.791849e-7,0.0010274993,0.0016788706,0.0018071285,0.19550768,0.03539331,0.76416683],"study_design_scores_gemma":[0.00050190993,0.00012669375,0.0019888266,0.00010622123,0.000015576941,0.0000085771235,0.000043653275,0.061307836,0.00023405212,0.001682484,0.93356335,0.00042084232],"about_ca_topic_score_codex":0.0000033837805,"about_ca_topic_score_gemma":0.000026813757,"teacher_disagreement_score":0.9653074,"about_ca_system_score_codex":0.000052038118,"about_ca_system_score_gemma":0.000038206323,"threshold_uncertainty_score":0.69291645},"labels":[],"label_agreement":null},{"id":"W2325064798","doi":"10.1109/twc.2016.2542071","title":"Distributed Beamforming in Two-Way Relay Networks With Interference and Imperfect CSI","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Queen's University","funders":"National Research Foundation of Korea","keywords":"Beamforming; Computer science; Computational complexity theory; Channel state information; Mathematical optimization; Transmitter power output; Relay; Signal-to-interference-plus-noise ratio; Norm (philosophy); Minification; Algorithm; Channel (broadcasting); Power (physics); Mathematics; Wireless; Telecommunications; Transmitter","score_opus":0.027427965123398193,"score_gpt":0.27661181840736765,"score_spread":0.24918385328396947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325064798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030454403,0.0002871868,0.96483177,0.0035914173,0.00008048628,0.00025664468,0.00001158872,0.00018221943,0.00030426218],"genre_scores_gemma":[0.98375523,0.0053209574,0.010487589,0.00014050411,0.0000080011205,0.0001782959,0.0000047655376,0.000017304947,0.000087376946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998482,0.00035698904,0.00035693802,0.00036137394,0.000134692,0.00030801768],"domain_scores_gemma":[0.9963266,0.00086627435,0.00010697824,0.0024499642,0.00013038138,0.00011977044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000343867,0.0002167961,0.00022969834,0.00021326463,0.000605974,0.00012985124,0.0017704053,0.00006028353,0.00001283133],"category_scores_gemma":[0.000009085875,0.00015884636,0.00004915045,0.0008772286,0.00028515558,0.0006587333,0.00006364548,0.00048831815,0.000011386087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007378928,0.0005528147,0.0012315544,0.000009570821,0.000084629384,0.0000043675045,0.0016395062,0.019897843,0.0042918725,0.032915052,0.00005452615,0.93924445],"study_design_scores_gemma":[0.003490693,0.00039779767,0.0038449562,0.001375304,0.000038395763,0.000085552594,0.00016555865,0.98146814,0.0057270164,0.0002790442,0.0021273403,0.0010001943],"about_ca_topic_score_codex":0.00004486728,"about_ca_topic_score_gemma":0.0026779561,"teacher_disagreement_score":0.9615703,"about_ca_system_score_codex":0.00014794686,"about_ca_system_score_gemma":0.00006141095,"threshold_uncertainty_score":0.6477567},"labels":[],"label_agreement":null},{"id":"W2325372342","doi":"10.1049/iet-com.2015.0906","title":"Performance study of opportunistic scheduling in dual‐hop multi‐user underlay cognitive network","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Cumulative distribution function; Scheduling (production processes); Cognitive radio; Probability density function; Mathematical optimization; Monte Carlo method; Diversity gain; Fading; Algorithm; Mathematics; Telecommunications; Statistics; Wireless","score_opus":0.13859499111322576,"score_gpt":0.34601300805511137,"score_spread":0.2074180169418856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325372342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76488006,0.0010554865,0.22484586,0.0035378495,0.00019512867,0.0010710207,0.0000078545545,0.00021382519,0.0041929204],"genre_scores_gemma":[0.9789223,0.0026122164,0.017920155,0.00013636047,0.000017836095,0.00009211772,0.000005593326,0.000012250763,0.0002811754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816364,0.0006269374,0.0005165526,0.00025830613,0.00017595479,0.00025862124],"domain_scores_gemma":[0.9956639,0.0011328356,0.00021266671,0.002603565,0.00031196728,0.00007510787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077029463,0.00014852446,0.00023376913,0.00013900646,0.00037471607,0.000046866022,0.0018560848,0.000048815597,0.000020473484],"category_scores_gemma":[0.00019051362,0.00012250178,0.000040210278,0.00087391224,0.00017043031,0.0004397799,0.0017742408,0.0002425662,0.000032322685],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000828783,0.0086988015,0.3071729,0.00005007197,0.00036695684,0.000017046663,0.04043394,0.0052760732,0.0037945912,0.22740099,0.0005686931,0.40613705],"study_design_scores_gemma":[0.00838865,0.000822208,0.3685128,0.0020481371,0.000076555945,0.000023133898,0.0055354116,0.6071309,0.00021358846,0.0007444831,0.0053059617,0.0011982014],"about_ca_topic_score_codex":0.000017262093,"about_ca_topic_score_gemma":0.00086402457,"teacher_disagreement_score":0.6018548,"about_ca_system_score_codex":0.00006393393,"about_ca_system_score_gemma":0.00011972589,"threshold_uncertainty_score":0.49954772},"labels":[],"label_agreement":null},{"id":"W2327502233","doi":"10.1109/tvt.2015.2504244","title":"Performance Analysis of Opportunistic Scheduling in Dual-Hop Multiuser Underlay Cognitive Network in the Presence of Cochannel Interference","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Engineering and Physical Sciences Research Council; Leverhulme Trust","keywords":"Cumulative distribution function; Underlay; Rayleigh fading; Computer science; Scheduling (production processes); Signal-to-interference-plus-noise ratio; Monte Carlo method; Mathematical optimization; Relay; Topology (electrical circuits); Fading; Probability density function; Signal-to-noise ratio (imaging); Mathematics; Algorithm; Power (physics); Telecommunications; Statistics; Decoding methods","score_opus":0.06865162658024364,"score_gpt":0.2982314645664722,"score_spread":0.22957983798622855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2327502233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44162226,0.00013015678,0.557596,0.0003634606,0.000057578807,0.00014233237,0.000002056438,0.000028808558,0.000057331985],"genre_scores_gemma":[0.99701095,0.0003993371,0.0024525793,0.000067020344,0.0000035357089,0.000050101677,0.0000017601903,0.0000047744797,0.000009952637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868155,0.00025404882,0.0004076841,0.00026061837,0.00018667575,0.00020945705],"domain_scores_gemma":[0.9985884,0.0003556114,0.00014508133,0.0006384997,0.00024143801,0.00003097816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007419847,0.00012385727,0.00031086616,0.0008339762,0.0000675783,0.000014144486,0.0007402471,0.00012278238,0.0000049545206],"category_scores_gemma":[0.000059157785,0.000104481674,0.000066393,0.0044635567,0.00022672796,0.00015484772,0.000022683282,0.00044892117,0.0000024416129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005378173,0.00045921336,0.0025981446,0.000017666443,0.00020882925,0.000020017573,0.0045638564,0.95097154,0.0011697343,0.0057012704,0.0000047856106,0.03423114],"study_design_scores_gemma":[0.0004306877,0.00017604577,0.0014857793,0.00020052737,0.000063650026,0.0000069262464,0.0011353616,0.9931734,0.0029997826,0.00020551904,0.000008441293,0.000113847294],"about_ca_topic_score_codex":0.000022006241,"about_ca_topic_score_gemma":0.0006018898,"teacher_disagreement_score":0.5553887,"about_ca_system_score_codex":0.000043776083,"about_ca_system_score_gemma":0.00008742609,"threshold_uncertainty_score":0.4260639},"labels":[],"label_agreement":null},{"id":"W2328256769","doi":"10.1109/iccke.2014.6993426","title":"Energy balancing in cooperative sensor networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Energy consumption; Routing (electronic design automation); Computer network; Distributed computing; Energy (signal processing); Wireless sensor network; Variety (cybernetics); Routing protocol; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Channel (broadcasting); Dynamic Source Routing; Engineering; Telecommunications; Wireless; Electrical engineering","score_opus":0.01735998163423962,"score_gpt":0.24492966757101425,"score_spread":0.22756968593677462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328256769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013563273,0.000121952115,0.96050626,0.00102084,0.00012416385,0.00003616496,3.7788197e-8,0.00010338639,0.03673086],"genre_scores_gemma":[0.9857722,0.00023141027,0.010357276,0.002488612,0.00005869295,0.000009975359,0.0000013759665,0.000004737567,0.0010757569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990822,0.00025519484,0.00016890324,0.00021652055,0.00008043896,0.0001967088],"domain_scores_gemma":[0.99916804,0.00020000573,0.000029956864,0.0004758863,0.00007187459,0.000054262662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032521697,0.00009091119,0.00012370889,0.00006755182,0.00010264637,0.00010297745,0.000540043,0.00003589037,0.00004286474],"category_scores_gemma":[0.000036043282,0.00007844863,0.000022113027,0.0004740205,0.000020535828,0.00021587827,0.00027986715,0.00011566274,0.000017268701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018040337,0.000027021544,0.0009461675,7.3986735e-7,0.000004014963,0.0000018240661,0.00024447337,0.014583369,0.00035579,0.8310218,0.0014185279,0.15139452],"study_design_scores_gemma":[0.00019749462,0.000022139726,0.0011723157,0.000013868919,3.7887276e-7,0.000002049027,0.000011840987,0.9798661,0.0003336513,0.00015984602,0.0181044,0.00011592365],"about_ca_topic_score_codex":0.000018801898,"about_ca_topic_score_gemma":0.00040491877,"teacher_disagreement_score":0.9844158,"about_ca_system_score_codex":0.000031376276,"about_ca_system_score_gemma":0.000018519744,"threshold_uncertainty_score":0.31990424},"labels":[],"label_agreement":null},{"id":"W2329376265","doi":"10.1109/tvt.2016.2550479","title":"Distributed Linear Constellation Precoding with BICM/BICM-ID in Two-Way Relaying Communications","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Constellation; Computer science; Zero-forcing precoding; Computer network; Electronic engineering; Signal-to-noise ratio (imaging); Telecommunications; MIMO; Engineering; Channel (broadcasting); Physics","score_opus":0.02868601629013216,"score_gpt":0.2785890351851333,"score_spread":0.24990301889500113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329376265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036250923,0.00020965387,0.95247614,0.009611325,0.000110594345,0.00034200662,0.000010482787,0.0005871969,0.00040166915],"genre_scores_gemma":[0.9768689,0.0009420319,0.02194094,0.00010518272,0.000007944924,0.000061158404,0.000005315618,0.000017421042,0.000051074618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985034,0.00021793337,0.00037849217,0.0004183998,0.00016397875,0.00031783342],"domain_scores_gemma":[0.99739605,0.00031836046,0.00012852967,0.0019446634,0.0001521743,0.00006022865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030516356,0.00020031209,0.00023433288,0.0006081239,0.00044522944,0.000046421002,0.0013260987,0.0001523855,0.000025016992],"category_scores_gemma":[0.000017504539,0.00015544191,0.000054140164,0.0016907409,0.0003006957,0.0003754598,0.00003499219,0.0005192517,0.000058102934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006764806,0.0006860833,0.0018599839,0.00001620462,0.00015624637,0.000038934922,0.0005095329,0.030266566,0.06039269,0.050373435,0.00007060429,0.8555621],"study_design_scores_gemma":[0.008023698,0.00077602034,0.0008812017,0.0015256563,0.00009019836,0.0004181,0.00039422087,0.7347641,0.22095366,0.0030303427,0.027342325,0.001800456],"about_ca_topic_score_codex":0.000009782189,"about_ca_topic_score_gemma":0.0003340012,"teacher_disagreement_score":0.94061804,"about_ca_system_score_codex":0.00019850346,"about_ca_system_score_gemma":0.000070229384,"threshold_uncertainty_score":0.63387376},"labels":[],"label_agreement":null},{"id":"W2329971998","doi":"10.1016/j.comnet.2016.04.002","title":"Network coding-based approach for efficient video streaming over MANET","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Multicast; Scalable Video Coding; Mobile ad hoc network; Network packet; Multiple description coding; Linear network coding; Video quality; Scalability; Packet loss; Codec; Quality of service; Real-time computing; Telecommunications","score_opus":0.02908652807661785,"score_gpt":0.2525248268404266,"score_spread":0.22343829876380875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329971998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041918742,0.00061010214,0.99580944,0.00067029893,0.0009799796,0.00057439203,0.0000026508774,0.00041098698,0.0005229784],"genre_scores_gemma":[0.75168145,0.000079408084,0.24451067,0.0020822904,0.0013333531,0.000121284516,0.000023072822,0.0000337275,0.00013476986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976014,0.00021674325,0.00043642963,0.0007487215,0.000241897,0.0007548145],"domain_scores_gemma":[0.9972084,0.00090930867,0.00019113159,0.0013291119,0.00017480017,0.00018722125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007052472,0.0003246027,0.00034361813,0.00009713363,0.00048451478,0.0002930915,0.0017109449,0.00013428289,0.000020311936],"category_scores_gemma":[0.000018578106,0.00024345373,0.00016864717,0.0005390158,0.00009119962,0.00019562323,0.0007405889,0.00018792518,0.0000110828805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023448827,0.000104588085,0.0004432508,0.000012541524,0.000031254185,0.000002485705,0.000058324327,0.65412873,0.000025759102,0.057324626,0.03270969,0.25513533],"study_design_scores_gemma":[0.0011543076,0.00010102592,0.0011239033,0.00014798649,0.000009612938,0.000004270907,8.8814704e-7,0.9821835,0.00002151787,0.00021669177,0.014659573,0.00037668893],"about_ca_topic_score_codex":9.991223e-7,"about_ca_topic_score_gemma":0.000003021271,"teacher_disagreement_score":0.7512988,"about_ca_system_score_codex":0.000111256544,"about_ca_system_score_gemma":0.000059479196,"threshold_uncertainty_score":0.99277556},"labels":[],"label_agreement":null},{"id":"W2333570085","doi":"10.1109/glocomw.2013.6855699","title":"Subset-sum based relay selection for multipath TCP in cooperative LTE networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Computer network; Multipath propagation; Relay; Throughput; Bandwidth (computing); Fading; Wireless; Transmission (telecommunications); Channel (broadcasting); Telecommunications","score_opus":0.0303608878433176,"score_gpt":0.2715618807264829,"score_spread":0.24120099288316532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333570085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010655309,0.00011026636,0.9849071,0.0019516019,0.0001663097,0.00073991675,4.1989128e-7,0.00016198592,0.0013070997],"genre_scores_gemma":[0.94336975,0.00007792748,0.05340602,0.0015476847,0.000046618632,0.00035930797,0.0000098977025,0.000010281037,0.0011725449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988291,0.00020046758,0.0002633419,0.00032219864,0.00009680632,0.0002880477],"domain_scores_gemma":[0.99879634,0.0003423334,0.00006054506,0.00039961396,0.00032486476,0.00007629689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036897714,0.00014009146,0.00015683445,0.000111417656,0.00022169834,0.00021002884,0.0005524969,0.00007207101,0.00015529302],"category_scores_gemma":[0.00007852169,0.00012158921,0.000047918893,0.0007147984,0.000027642096,0.00056632294,0.00012867301,0.0001973062,0.00004824718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006299786,0.00066098245,0.02177494,0.000022381328,0.000052781554,0.0000018995632,0.0019053244,0.44912544,0.0059622433,0.20322022,0.05769848,0.2595123],"study_design_scores_gemma":[0.0006775161,0.00007884846,0.0041078413,0.00001947214,0.0000012682226,7.866849e-7,0.000016927528,0.990196,0.0008575518,0.00004692573,0.0038284962,0.00016836391],"about_ca_topic_score_codex":0.00005509238,"about_ca_topic_score_gemma":0.00079274666,"teacher_disagreement_score":0.9327144,"about_ca_system_score_codex":0.00008155096,"about_ca_system_score_gemma":0.00006652761,"threshold_uncertainty_score":0.49582642},"labels":[],"label_agreement":null},{"id":"W2334664297","doi":"10.1109/tvt.2015.2417568","title":"Closed-Form Average SNR and Ergodic Capacity Approximations for Best Relay Selection","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ergodic theory; Relay; Cumulative distribution function; Signal-to-noise ratio (imaging); Probability density function; Mathematics; Expression (computer science); Selection (genetic algorithm); Topology (electrical circuits); Capacity planning; Applied mathematics; Function (biology); Power (physics); Statistical physics; Mathematical optimization; Computer science; Statistics; Mathematical analysis; Physics; Combinatorics","score_opus":0.047077325275243734,"score_gpt":0.2665974517169061,"score_spread":0.21952012644166236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334664297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066324264,0.00014600164,0.9293216,0.002978635,0.00021558243,0.00040169788,0.0000053916538,0.000440733,0.00016609233],"genre_scores_gemma":[0.9479369,0.00021129167,0.051114313,0.00014976136,0.000016912956,0.0002531455,0.0000021109536,0.000012468932,0.00030308534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901,0.00006403122,0.00021870111,0.00034351132,0.00013156237,0.00023217253],"domain_scores_gemma":[0.99899906,0.00007215424,0.0000674167,0.0005270112,0.0002445995,0.000089788875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027669192,0.00015232773,0.00017009283,0.00040152448,0.0005049617,0.000069277245,0.0004293417,0.0002230263,0.0000055437467],"category_scores_gemma":[0.00002625828,0.00015364404,0.00006059531,0.0008620382,0.00012965401,0.00029760474,0.000009647034,0.00040139997,0.000026814627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006412348,0.0012392639,0.00015612022,0.00006524532,0.00022301299,0.0000062302356,0.0024928604,0.050722297,0.017772457,0.2585932,0.0009974417,0.66766775],"study_design_scores_gemma":[0.0015784848,0.00079552096,0.00004925836,0.000050911807,0.00003872705,0.00013148133,0.00012568418,0.90189624,0.057279177,0.008236116,0.029378844,0.0004395589],"about_ca_topic_score_codex":0.0000068075406,"about_ca_topic_score_gemma":0.000120159624,"teacher_disagreement_score":0.88161266,"about_ca_system_score_codex":0.00012751791,"about_ca_system_score_gemma":0.00006996344,"threshold_uncertainty_score":0.6265422},"labels":[],"label_agreement":null},{"id":"W2336676797","doi":"10.1109/wiecon-ece.2015.7443953","title":"Matching with externalities for decoupled uplink-downlink user association in full-duplex small cell networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Telecommunications link; Computer science; Computer network; Provisioning; Base station; Swap (finance); Duplex (building); Association (psychology); Distributed computing","score_opus":0.04515638091227306,"score_gpt":0.2647454712433678,"score_spread":0.21958909033109472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336676797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15460181,0.00026008554,0.84263754,0.00093134533,0.00014982077,0.00027748063,4.4827343e-7,0.000113395654,0.0010280485],"genre_scores_gemma":[0.8472282,0.00018052779,0.14672163,0.0008737095,0.00011247615,0.000086253785,0.000012012533,0.000015744316,0.004769398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988585,0.00011047331,0.0002847779,0.0002676072,0.00016477356,0.0003138561],"domain_scores_gemma":[0.99862695,0.00039645447,0.00015281262,0.000434629,0.000289432,0.000099726705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049688,0.00014291599,0.00018589856,0.000080757374,0.000116189694,0.0002958095,0.0007066927,0.00007754006,0.000013603953],"category_scores_gemma":[0.000038832724,0.000118796,0.00004107759,0.0003055391,0.000011376958,0.00038366346,0.0002381243,0.0001894029,0.000010758805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034177522,0.0006140531,0.07188762,0.00007413299,0.0001309417,0.000014415677,0.022059498,0.5608156,0.000910629,0.2637556,0.011137439,0.068258345],"study_design_scores_gemma":[0.0013869317,0.00010140098,0.0013747854,0.00004624577,0.0000051400907,0.0000020586174,0.00022741029,0.99243957,0.00013358341,0.0006470471,0.0033991155,0.00023670495],"about_ca_topic_score_codex":0.000060693234,"about_ca_topic_score_gemma":0.002275678,"teacher_disagreement_score":0.69591594,"about_ca_system_score_codex":0.00022021848,"about_ca_system_score_gemma":0.000095910254,"threshold_uncertainty_score":0.48443604},"labels":[],"label_agreement":null},{"id":"W2339053001","doi":"10.14288/1.0071328","title":"Asymptotic performance analysis and design of wireless communication systems in generalized fading and noise","year":2010,"lang":"en","type":"article","venue":"Open Collections","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Computer science; Wireless; Telecommunications; Noise (video); Electronic engineering; Computer network; Engineering; Artificial intelligence","score_opus":0.037173905941716545,"score_gpt":0.27774533848111466,"score_spread":0.2405714325393981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339053001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49642983,0.00081678835,0.49124843,0.0003383719,0.00015800353,0.0011525565,0.000002620931,0.000049492315,0.009803906],"genre_scores_gemma":[0.9723609,0.0016641159,0.024284596,0.000016689126,0.00000381313,0.00008038058,0.0000017222309,0.0000032879018,0.0015844821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992467,0.00024145003,0.00020747427,0.00015664211,0.00006200719,0.000085704625],"domain_scores_gemma":[0.99905574,0.00019811193,0.000089231144,0.00051988504,0.00009856825,0.000038460206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005948034,0.00006522193,0.00018402138,0.00019529855,0.000863197,0.00070598774,0.00059341383,0.000034231372,0.000010360588],"category_scores_gemma":[0.000026076666,0.00006529084,0.000014413124,0.0022358224,0.000055463253,0.0004076672,0.00046618172,0.00014047185,3.0211206e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002615603,0.0015923677,0.16603576,0.00022291446,0.0019708641,0.0000056113913,0.027533215,0.25200737,0.12964404,0.17625277,0.011703587,0.23276995],"study_design_scores_gemma":[0.00033325158,0.000021884198,0.010456212,0.000026341104,0.00002365549,0.0000053238855,0.000038526676,0.9884281,0.00027286663,0.000052866908,0.00025898046,0.00008196225],"about_ca_topic_score_codex":0.0010937838,"about_ca_topic_score_gemma":0.0024584588,"teacher_disagreement_score":0.73642075,"about_ca_system_score_codex":0.000020268319,"about_ca_system_score_gemma":0.000047408837,"threshold_uncertainty_score":0.6807856},"labels":[],"label_agreement":null},{"id":"W2340260419","doi":"10.1109/tit.2016.2555949","title":"Convolutional Codes With Maximum Column Sum Rank for Network Streaming","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hamming(7,4); Hamming distance; Column (typography); Convolutional code; Mathematics; Diagonal; Rank (graph theory); Linear code; Discrete mathematics; Block code; Computer science; Algorithm; Combinatorics; Decoding methods","score_opus":0.01632930772736306,"score_gpt":0.23528945024017728,"score_spread":0.2189601425128142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340260419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061152794,0.000032474283,0.99592996,0.00088204694,0.00036312526,0.00035167887,0.000035534904,0.00020903986,0.0015846165],"genre_scores_gemma":[0.9792052,0.00015168064,0.018888103,0.0008340319,0.000047987312,0.0002340993,0.000008671765,0.000008756744,0.00062145136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901295,0.000120617675,0.00029837945,0.00013545206,0.00018850798,0.0002441082],"domain_scores_gemma":[0.9983595,0.00073477376,0.00012736917,0.0004316122,0.00027410965,0.000072647315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005702808,0.00013727776,0.00012964841,0.000120301724,0.0006095022,0.00012690418,0.00043715985,0.000055791344,0.00010094821],"category_scores_gemma":[0.000012188037,0.00009806784,0.00006924442,0.00029133185,0.00010347678,0.001704564,0.0000045616953,0.00010225779,0.000085173044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028601088,0.00006109428,0.000020298789,0.000016659636,0.00008159978,2.1526849e-7,0.00069960806,0.01641766,0.00015187482,0.38821477,0.001330093,0.59272015],"study_design_scores_gemma":[0.025659645,0.002416688,0.0034716548,0.0020804352,0.00022800587,0.00016168786,0.0012504611,0.47137088,0.031869255,0.15021165,0.30743638,0.0038432672],"about_ca_topic_score_codex":0.000001068211,"about_ca_topic_score_gemma":0.000015307673,"teacher_disagreement_score":0.9785937,"about_ca_system_score_codex":0.000095443145,"about_ca_system_score_gemma":0.00010500215,"threshold_uncertainty_score":0.46878594},"labels":[],"label_agreement":null},{"id":"W2341059727","doi":"10.1109/comnet.2015.7566622","title":"Distributed collaborative beamforming designs for real-world applications in relayed and cooperative communications","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Beamforming; Quantization (signal processing); Computer science; Throughput; Overhead (engineering); Channel (broadcasting); Computer engineering; Algorithm; Electronic engineering; Telecommunications; Wireless; Engineering","score_opus":0.11404083080040563,"score_gpt":0.3545075356997369,"score_spread":0.2404667048993313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341059727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007904629,0.00057777105,0.98365295,0.0040029148,0.00002814219,0.001288225,0.000028828577,0.00014219279,0.0094884895],"genre_scores_gemma":[0.69967264,0.001334844,0.2962853,0.00032184625,0.000019829424,0.0013310559,0.00019648252,0.000013602782,0.0008243995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998857,0.0002221588,0.000326528,0.00028512775,0.00010324271,0.00020592113],"domain_scores_gemma":[0.9973255,0.00073823443,0.00009468469,0.0010675241,0.0006259656,0.00014809072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005961894,0.00014218703,0.00020361444,0.00015966925,0.00041142435,0.00017371167,0.0010183753,0.00004274013,0.0000025289796],"category_scores_gemma":[0.00014035523,0.0001302063,0.000022146618,0.0017236419,0.00013328622,0.0005367627,0.00059941434,0.0001177405,0.0000043176296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116058945,0.00010934207,0.0013916594,0.0000035642058,0.000016522568,2.145895e-7,0.003355708,0.00030345147,0.00023309815,0.9854636,0.0019892321,0.007121968],"study_design_scores_gemma":[0.0034534903,0.0003311993,0.0040447465,0.00008667686,0.000025436195,0.0000045044285,0.0047273505,0.68438536,0.0019828514,0.014366476,0.28569177,0.000900126],"about_ca_topic_score_codex":0.00004002548,"about_ca_topic_score_gemma":0.0036083756,"teacher_disagreement_score":0.9710972,"about_ca_system_score_codex":0.00015842394,"about_ca_system_score_gemma":0.00025019847,"threshold_uncertainty_score":0.5309659},"labels":[],"label_agreement":null},{"id":"W2343145829","doi":"10.1109/tvt.2015.2506682","title":"Two-Way Relay Strategies With a Multiaccess Uplink and Queue Stability Constraints","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Telecommunications link; Relay; Computer science; Computer network; Network packet; Linear network coding; Relay channel; Scheduling (production processes); Queue; Markov chain; Transmission (telecommunications); Node (physics); Mathematical optimization; Mathematics; Engineering; Telecommunications","score_opus":0.03902522238800225,"score_gpt":0.28177308489625263,"score_spread":0.2427478625082504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343145829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17467767,0.00022279103,0.8213299,0.0026062794,0.000097692784,0.00022438818,0.0000019173815,0.00045324085,0.0003861361],"genre_scores_gemma":[0.95902276,0.00012266329,0.040644985,0.000104435254,0.000005710454,0.00007073646,7.000975e-7,0.000009930051,0.000018089937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.00012503973,0.00020865713,0.0004367526,0.00015235132,0.00023754402],"domain_scores_gemma":[0.9983175,0.00007598245,0.00006498314,0.0011854022,0.0002477379,0.00010838514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030553312,0.00017958049,0.00020697419,0.00023351579,0.00024768192,0.00012987843,0.0008244557,0.00014903265,0.000014742701],"category_scores_gemma":[0.000015110317,0.00015201258,0.000032486983,0.0007203262,0.0005919697,0.00040824426,0.00002243416,0.00052296,0.000014834355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015999057,0.0010924016,0.0009803319,0.000047009864,0.0003223487,0.00013703488,0.0038626026,0.045444906,0.017834853,0.22413193,0.00009055949,0.705896],"study_design_scores_gemma":[0.010644878,0.0025250078,0.0007596266,0.00035472214,0.00012977501,0.0010221888,0.0058258865,0.74728674,0.21075511,0.014171742,0.004334492,0.0021898504],"about_ca_topic_score_codex":0.000018067902,"about_ca_topic_score_gemma":0.0002919131,"teacher_disagreement_score":0.7843451,"about_ca_system_score_codex":0.000067864195,"about_ca_system_score_gemma":0.00016603249,"threshold_uncertainty_score":0.6198893},"labels":[],"label_agreement":null},{"id":"W2343400540","doi":"","title":"Relay multiplexing enhancement using a nonreciprocal antenna array","year":2015,"lang":"en","type":"article","venue":"International Symposium on Antennas and Propagation","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Relay; Omnidirectional antenna; Telecommunications link; Multiplexing; Computer science; Electronic engineering; Reciprocal; Antenna (radio); Reciprocity (cultural anthropology); Electrical engineering; Power (physics); Engineering; Telecommunications; Physics","score_opus":0.06460296253631045,"score_gpt":0.30762510100022855,"score_spread":0.2430221384639181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343400540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03337393,0.00021828509,0.9518367,0.007698954,0.0009357218,0.00020113404,0.0000028037991,0.000092743096,0.0056397184],"genre_scores_gemma":[0.978794,0.00037779595,0.019108752,0.0009750697,0.00014663083,0.000017721604,0.000018216475,0.000009427043,0.00055243116],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987523,0.000117230615,0.00027033803,0.00034403428,0.00035587,0.0001602348],"domain_scores_gemma":[0.99894387,0.000056202614,0.00012738357,0.00027341227,0.000483191,0.000115933144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042026912,0.00013760205,0.000114452974,0.0000821911,0.00016262456,0.00024971273,0.00038672818,0.000046395675,0.000012498987],"category_scores_gemma":[0.000094660056,0.00012407408,0.000036568414,0.00015521806,0.00004168586,0.00050100865,0.00018028759,0.00014550975,0.00003655901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020346281,0.00043201965,0.0020004509,0.000016067994,0.00010262609,0.000032126056,0.004861877,0.0011454278,0.8355758,0.094818205,0.00041819768,0.06039371],"study_design_scores_gemma":[0.00096258265,0.00018669498,0.00048441274,0.00017084798,0.0000055590235,0.000069001166,0.00008285699,0.94840837,0.03268239,0.000870415,0.015793215,0.0002836768],"about_ca_topic_score_codex":0.000009501901,"about_ca_topic_score_gemma":0.000014415293,"teacher_disagreement_score":0.94726294,"about_ca_system_score_codex":0.00014471136,"about_ca_system_score_gemma":0.00007040193,"threshold_uncertainty_score":0.5059594},"labels":[],"label_agreement":null},{"id":"W2343839466","doi":"10.1007/978-3-319-50758-3_4","title":"A Novel Machine to Machine Communication Strategy Using Rateless Coding for the Internet of Things","year":2016,"lang":"en","type":"book-chapter","venue":"Internet of things","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Relay; Computer network; Decoding methods; Scalability; Multicast; The Internet; Coding (social sciences); Scheme (mathematics); Linear network coding; Channel (broadcasting); Physical layer; Distributed computing; Wireless; Telecommunications; Network packet","score_opus":0.07667330236219055,"score_gpt":0.30784279424524197,"score_spread":0.23116949188305141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343839466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014635509,0.002825917,0.9611428,0.0016028977,0.00031758603,0.00077664,0.000028517961,0.00007853753,0.033080764],"genre_scores_gemma":[0.80669606,0.0014548943,0.078368954,0.0019188115,0.000093720955,0.00005005216,0.00004684327,0.00012627931,0.11124438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978141,0.00008182615,0.0009898852,0.00047507297,0.00036938544,0.00026972077],"domain_scores_gemma":[0.99541754,0.0009958892,0.0011035717,0.0017610493,0.0006328567,0.000089126865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011992898,0.00042355966,0.0006664888,0.00026907428,0.0001272259,0.00018489313,0.004852143,0.00020273482,0.00010741327],"category_scores_gemma":[0.00012207149,0.00030425322,0.0002826329,0.00010695797,0.00020469903,0.00058934384,0.002509459,0.000542768,0.000010676661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010298328,0.00005186464,0.000008092101,0.00011326692,0.00028778665,9.070057e-7,0.006274247,0.00007866135,0.0077533214,0.8727773,0.0010016208,0.11154994],"study_design_scores_gemma":[0.0013665215,0.0004570571,0.000018627185,0.006036782,0.00015013681,0.00005402022,0.00005086112,0.89466524,0.0115135135,0.01095826,0.07377187,0.0009571333],"about_ca_topic_score_codex":0.0003618114,"about_ca_topic_score_gemma":0.00008888815,"teacher_disagreement_score":0.89458656,"about_ca_system_score_codex":0.00015738946,"about_ca_system_score_gemma":0.000096528776,"threshold_uncertainty_score":0.99994093},"labels":[],"label_agreement":null},{"id":"W2344432770","doi":"10.1109/tvt.2015.2497210","title":"An Analysis Framework for Buffer-Aided Relaying Under Time-Correlated Fading Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Fading distribution; Channel state information; Throughput; Computer science; Independent and identically distributed random variables; Channel (broadcasting); Computer network; Statistics; Mathematics; Telecommunications; Wireless; Rayleigh fading; Random variable","score_opus":0.041179210753981045,"score_gpt":0.30176373386438804,"score_spread":0.260584523110407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344432770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03391377,0.00019082261,0.9609197,0.003253242,0.00038594802,0.00031069646,0.000003454406,0.0009837382,0.000038638264],"genre_scores_gemma":[0.9226746,0.00006454603,0.07664589,0.00029917224,0.00002071523,0.00014104127,0.0000068842933,0.000021207095,0.00012592862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984276,0.0001623585,0.00031445522,0.00054216804,0.0001917426,0.00036164265],"domain_scores_gemma":[0.99786645,0.00020564761,0.00010824742,0.0013852842,0.00029229236,0.00014207263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004585127,0.0002163442,0.00034160723,0.0010404924,0.0004682761,0.00012063113,0.0011607144,0.0004327469,0.000024560062],"category_scores_gemma":[0.000036331145,0.00022033375,0.00018866772,0.0031751702,0.00009593687,0.00034155996,0.000011971857,0.0006026949,0.00007558638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033098273,0.00035050715,0.000031689626,0.000004764719,0.00068542454,0.000009559048,0.0009167419,0.8695412,0.0049485513,0.06320906,0.00010195154,0.060167458],"study_design_scores_gemma":[0.00046554118,0.00027630568,0.000011770691,0.000033100932,0.00017033707,0.000016622493,0.00012956216,0.9680871,0.0157756,0.014211214,0.00052403414,0.00029883845],"about_ca_topic_score_codex":0.0000044066187,"about_ca_topic_score_gemma":0.000012355041,"teacher_disagreement_score":0.88876086,"about_ca_system_score_codex":0.00016448069,"about_ca_system_score_gemma":0.00006342315,"threshold_uncertainty_score":0.89849496},"labels":[],"label_agreement":null},{"id":"W2344619542","doi":"10.1109/jsac.2016.2520245","title":"Greener Data Exchange in the Cloud: A Coding-Based Optimization for Big Data Processing","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Goodput; Cloud computing; Big data; Distributed computing; Data center; Volume (thermodynamics); Data exchange; Computer network; Database; Data mining; Operating system; Wireless","score_opus":0.27241760672678594,"score_gpt":0.3708167054825921,"score_spread":0.09839909875580616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344619542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004978548,0.0012916713,0.9586513,0.038390245,0.00028906335,0.00045215318,0.000049512713,0.00006067034,0.00031754933],"genre_scores_gemma":[0.92885816,0.005619677,0.06307764,0.0017329785,0.00034232845,0.0000998312,0.00021301987,0.000022567063,0.00003380206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744755,0.0010966517,0.000528243,0.00035528382,0.00028046418,0.0002917923],"domain_scores_gemma":[0.9908495,0.0018515534,0.00031532248,0.006474796,0.00044542793,0.00006340494],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0025931252,0.00015905355,0.00018206936,0.00034468013,0.0006906841,0.00036772364,0.013793455,0.00006739791,0.000007099979],"category_scores_gemma":[0.0008630856,0.00010285507,0.0000259476,0.0017636539,0.00009532151,0.000935153,0.0010501447,0.0005008511,0.0000035313628],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008637385,0.001142281,0.001564645,0.000024070714,0.0000351495,0.0000059333474,0.0016659809,0.007950298,0.0005825689,0.005141095,0.019209422,0.9625922],"study_design_scores_gemma":[0.00126976,0.00006657806,0.0011189287,0.0005139744,0.0000104077635,0.000027696005,0.00003251182,0.9499294,0.000040673815,0.0002884936,0.046502594,0.00019898145],"about_ca_topic_score_codex":0.000007649351,"about_ca_topic_score_gemma":0.0013636297,"teacher_disagreement_score":0.9623932,"about_ca_system_score_codex":0.00014937748,"about_ca_system_score_gemma":0.00044042716,"threshold_uncertainty_score":0.9915424},"labels":[],"label_agreement":null},{"id":"W2344910158","doi":"10.1007/s11276-016-1261-8","title":"Joint TAS/SC and power allocation for IAF relaying D2D cooperative networks","year":2016,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Computer science; Nakagami distribution; Relay; Outage probability; Fading; Transmitter power output; Power (physics); Selection (genetic algorithm); Antenna (radio); Joint (building); Mathematical optimization; Optimization problem; Topology (electrical circuits); Telecommunications; Mathematics; Algorithm; Channel (broadcasting); Transmitter","score_opus":0.028214691388097107,"score_gpt":0.2556267181575915,"score_spread":0.22741202676949443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344910158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070459507,0.0019654166,0.9855082,0.003528459,0.0005513431,0.00053764944,0.0000019666143,0.00020901259,0.00065197505],"genre_scores_gemma":[0.9900558,0.0032399695,0.0047049876,0.0010309588,0.00024294041,0.00016838853,0.000010398601,0.000030614236,0.0005159267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980792,0.00023292447,0.00042942338,0.00059443386,0.00016314098,0.000500906],"domain_scores_gemma":[0.9979288,0.00054789905,0.00018957823,0.0008162741,0.00034446895,0.0001729551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069713243,0.00027219983,0.0003176451,0.00008278147,0.0005855398,0.00026489096,0.0006792558,0.00017067291,0.000025478708],"category_scores_gemma":[0.000057815894,0.00020369542,0.00008261566,0.00040637024,0.00013802899,0.00063432194,0.0005093075,0.00024039557,0.00000964951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055295073,0.00008569005,0.00063409074,0.000009146596,0.000092045,0.00000414952,0.0008310406,0.011153389,0.0016838299,0.3176698,0.011898444,0.6558831],"study_design_scores_gemma":[0.0010741878,0.0001366397,0.0014052541,0.00024779784,0.000011181761,0.000011745587,0.000030971798,0.9865337,0.00023743954,0.00032521618,0.009568096,0.00041779506],"about_ca_topic_score_codex":0.000002591871,"about_ca_topic_score_gemma":0.00003287341,"teacher_disagreement_score":0.9830099,"about_ca_system_score_codex":0.00009249723,"about_ca_system_score_gemma":0.000054562457,"threshold_uncertainty_score":0.83064586},"labels":[],"label_agreement":null},{"id":"W2345235895","doi":"10.1109/cjece.2015.2496589","title":"MIMO V-BLAST Scheme Based on Physical-Layer Network Coding for Data Reliability in Emerging Wireless Networks","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"MIMO; Fading; Computer science; Network packet; Linear network coding; Phase-shift keying; Diversity gain; Multiplexing; Computer network; Physical layer; Time diversity; Redundancy (engineering); Wireless; Wireless network; Throughput; Electronic engineering; Bit error rate; Engineering; Channel (broadcasting); Telecommunications","score_opus":0.024898449811589323,"score_gpt":0.24007794315388678,"score_spread":0.21517949334229747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345235895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02406345,0.00033984196,0.9738869,0.0013095147,0.00027025442,0.00009801494,0.0000012537366,0.000017256758,0.000013502108],"genre_scores_gemma":[0.9743586,0.00007211468,0.02479709,0.00027118743,0.0004800989,0.000003859111,0.0000012527653,0.000011426805,0.0000043393998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988192,0.00006000507,0.00031061991,0.0002649187,0.00010549448,0.00043980067],"domain_scores_gemma":[0.99821043,0.00079834944,0.00008847871,0.00045696064,0.00011159166,0.0003341758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005463227,0.00014838268,0.00026044244,0.00019827593,0.0001190349,0.00011212201,0.00094516634,0.000047453646,0.00000184867],"category_scores_gemma":[0.000112821384,0.000114256756,0.000055456145,0.000535662,0.000021595219,0.00029818297,0.000106514926,0.0002775776,4.091333e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003596353,0.00005860804,0.007293932,0.000026034399,0.000042986627,0.000044359855,0.0001395961,0.4440045,0.00040704798,0.029223375,0.0031159008,0.5156077],"study_design_scores_gemma":[0.00047945077,0.00012814935,0.0030260559,0.00025016628,0.000003459844,0.000008640353,3.439187e-7,0.9922371,0.00003281904,0.000087713845,0.0035905698,0.00015552252],"about_ca_topic_score_codex":0.00001503849,"about_ca_topic_score_gemma":0.00013494072,"teacher_disagreement_score":0.9502952,"about_ca_system_score_codex":0.00012623526,"about_ca_system_score_gemma":0.000186419,"threshold_uncertainty_score":0.46592554},"labels":[],"label_agreement":null},{"id":"W2345860503","doi":"10.1109/lwc.2016.2561285","title":"Secrecy Capacity Scaling With Untrustworthy Aggressive Relays Cooperating With a Wire-Tapper","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Secrecy; Bounded function; Computer network; Scaling; Computer science; Relay; Beamforming; Trustworthiness; Topology (electrical circuits); Value (mathematics); Computer security; Telecommunications; Mathematics; Power (physics); Physics; Combinatorics","score_opus":0.032190279773112465,"score_gpt":0.24572945123910833,"score_spread":0.21353917146599588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345860503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3648612,0.000304567,0.60745525,0.025561063,0.000088546374,0.00047887475,0.000006646664,0.00036620768,0.0008776735],"genre_scores_gemma":[0.9383611,0.0007574846,0.057522215,0.0028721578,0.00006012259,0.00028507988,0.000009010262,0.000043360236,0.00008947551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973531,0.000665734,0.00046095636,0.0005849985,0.00040143577,0.00053379696],"domain_scores_gemma":[0.99345183,0.0007377229,0.00046861984,0.0047192853,0.00043126897,0.00019129418],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004719345,0.00037267045,0.00036324642,0.00019254725,0.0013578528,0.00033325973,0.003902139,0.00008459856,0.0000180054],"category_scores_gemma":[0.000051041483,0.00024027363,0.00007241139,0.0011107433,0.0007290008,0.0010825176,0.00070374773,0.00052731787,0.0000578588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018497006,0.0007222799,0.028407458,0.000062650084,0.0007102623,0.00009267724,0.013420648,0.004690531,0.18779299,0.28719038,0.0030906757,0.47363448],"study_design_scores_gemma":[0.030124871,0.002153101,0.0308198,0.024708437,0.0006163262,0.0027878848,0.0022313197,0.681564,0.110311285,0.0014774048,0.09793542,0.015270191],"about_ca_topic_score_codex":0.00003506145,"about_ca_topic_score_gemma":0.00044911777,"teacher_disagreement_score":0.67687345,"about_ca_system_score_codex":0.00019600545,"about_ca_system_score_gemma":0.00015277595,"threshold_uncertainty_score":0.99994224},"labels":[],"label_agreement":null},{"id":"W2345999502","doi":"10.48550/arxiv.1605.00979","title":"Gaussian Two-Way Channels With Discrete Inputs and Quantized Outputs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transmitter; Gaussian; Quantization (signal processing); Channel (broadcasting); Computation; Constellation; Topology (electrical circuits); Gaussian noise; Mathematics; Algorithm; Additive white Gaussian noise; Computer science; Telecommunications; Physics; Combinatorics; Quantum mechanics","score_opus":0.07981713108266283,"score_gpt":0.2185017894029898,"score_spread":0.13868465832032698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345999502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06249142,0.00026201425,0.9285843,0.001766803,0.0003481056,0.00033711633,0.0000075543467,0.00026242368,0.0059402995],"genre_scores_gemma":[0.9949953,0.0011921322,0.0013917838,0.00023083232,0.00007554046,0.0000021013623,0.000007440612,0.000019425514,0.0020854725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808353,0.000285517,0.0001798031,0.0010041519,0.0000946687,0.0003523484],"domain_scores_gemma":[0.99764985,0.00012755819,0.00023128685,0.0016004201,0.00016415521,0.00022673976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026441438,0.00035091472,0.0003733949,0.00022823816,0.0002978304,0.00024968252,0.0017201434,0.00019196337,0.000021014695],"category_scores_gemma":[0.000018314722,0.00028556742,0.000089728244,0.00043140267,0.00020430557,0.0004503152,0.0032635208,0.00059475016,0.000039219263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092444985,0.00006081342,0.003030995,0.000050029434,0.00017585198,0.00019305323,0.000943907,0.004307109,0.00017883399,0.9853174,0.00026879943,0.005380755],"study_design_scores_gemma":[0.009433217,0.00054281234,0.007527739,0.002857508,0.00024297932,0.00006089217,0.00013071451,0.87287194,0.0016775038,0.08507582,0.01546512,0.004113734],"about_ca_topic_score_codex":0.000015184614,"about_ca_topic_score_gemma":0.00008600068,"teacher_disagreement_score":0.9325039,"about_ca_system_score_codex":0.00009433156,"about_ca_system_score_gemma":0.00011973023,"threshold_uncertainty_score":0.99995965},"labels":[],"label_agreement":null},{"id":"W2346024257","doi":"10.1002/ett.3041","title":"Superposition network coded cooperation for wireless networks","year":2016,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Superposition principle; Transmission (telecommunications); Linear network coding; Computer network; Coding (social sciences); Wireless network; Cooperative diversity; QAM; Wireless; Quadrature amplitude modulation; Telecommunications; Channel (broadcasting); Bit error rate; Mathematics; Network packet","score_opus":0.027954922853713336,"score_gpt":0.27741842824900165,"score_spread":0.2494635053952883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346024257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007565612,0.0006863787,0.96707773,0.027527068,0.00020821673,0.000625582,0.0000078755875,0.002773651,0.00033692954],"genre_scores_gemma":[0.87280077,0.0089680115,0.11675942,0.0002122137,0.000023746084,0.0009116724,0.000016127518,0.000025230256,0.00028278146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835855,0.0001846871,0.00045155917,0.00042692592,0.00013851833,0.0004397594],"domain_scores_gemma":[0.9961503,0.0007960852,0.0001373518,0.002543248,0.0003282453,0.000044763958],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004636953,0.00024603854,0.00023873324,0.0002764844,0.0016847115,0.0001475702,0.0023177809,0.0001906747,0.000027846636],"category_scores_gemma":[0.000065056105,0.00019954717,0.00013319944,0.0011810297,0.00019483671,0.000664709,0.00009409465,0.00032164008,0.000028042443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017266748,0.00014921532,0.000019054582,0.0000038808066,0.000052741176,1.8043228e-7,0.00010015818,0.013986462,0.0024130426,0.1919939,0.0013852145,0.7898789],"study_design_scores_gemma":[0.002111066,0.00052546954,0.00023758045,0.00046468506,0.0000656595,0.000019193187,0.00025156423,0.8931017,0.024166074,0.0122542055,0.06558712,0.0012157072],"about_ca_topic_score_codex":0.000002856425,"about_ca_topic_score_gemma":0.000093028684,"teacher_disagreement_score":0.8791152,"about_ca_system_score_codex":0.0001638223,"about_ca_system_score_gemma":0.000056219353,"threshold_uncertainty_score":0.99961495},"labels":[],"label_agreement":null},{"id":"W2346273163","doi":"10.1049/el.2016.0048","title":"Fuzzy layered physical cell identities assignment in heterogeneous and small cell networks","year":2016,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Handover; Computer science; Fuzzy logic; Computer network; Cluster analysis; Reuse; Base station; Frequency allocation; Conventional PCI; Channel allocation schemes; Distributed computing; Engineering; Wireless; Artificial intelligence; Telecommunications","score_opus":0.011910853454179611,"score_gpt":0.2130714749322733,"score_spread":0.2011606214780937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346273163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6197362,0.0035591477,0.37067893,0.004547048,0.00012974981,0.00019827146,5.6949574e-7,0.000091405615,0.00105868],"genre_scores_gemma":[0.9956342,0.0020117562,0.0005660018,0.0014968057,0.0000617108,0.000022352984,9.300321e-7,0.000011556473,0.0001946947],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988014,0.00016625361,0.0001621978,0.00031442934,0.00012299685,0.00043271345],"domain_scores_gemma":[0.99926,0.0001494937,0.00006310217,0.00044412655,0.000019114006,0.00006417855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018073099,0.00014823841,0.00014867006,0.00006904146,0.000100761106,0.0001231726,0.0005811733,0.000034583423,0.0000033321494],"category_scores_gemma":[0.0000045058687,0.000119906275,0.00004466066,0.00017106348,0.00004423834,0.0001758908,0.00031445018,0.00018544908,0.0000126556415],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045347606,0.00052965153,0.002387117,0.000035107994,0.000060058886,0.00006578835,0.0032320237,0.02080911,0.8029424,0.03300487,0.008259378,0.12862918],"study_design_scores_gemma":[0.011839623,0.0016869373,0.0040822607,0.0004129146,0.00006409139,0.00011493585,0.00008733306,0.50525266,0.40534893,0.015496569,0.05122292,0.004390799],"about_ca_topic_score_codex":0.000001955729,"about_ca_topic_score_gemma":0.00004729241,"teacher_disagreement_score":0.48444358,"about_ca_system_score_codex":0.00015457773,"about_ca_system_score_gemma":0.000031815136,"threshold_uncertainty_score":0.4889636},"labels":[],"label_agreement":null},{"id":"W2347089374","doi":"10.1109/camsap.2015.7465296","title":"Total power minimization for two-way networks with multi-antenna relays","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Relay; Transmitter power output; Computer science; Transceiver; Mathematical optimization; Minification; Optimization problem; Vertex (graph theory); Mathematics; Topology (electrical circuits); Power (physics); Wireless; Telecommunications; Transmitter; Theoretical computer science","score_opus":0.05723518369333503,"score_gpt":0.28878854728668546,"score_spread":0.23155336359335044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2347089374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008521293,0.00023146819,0.99370265,0.0010176862,0.00027325636,0.00035098582,4.463654e-7,0.0001655718,0.0034058238],"genre_scores_gemma":[0.7572636,0.000016960039,0.23996021,0.0006292998,0.00004359965,0.00005910554,0.000008073328,0.000010566356,0.002008597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992127,0.00006869692,0.00016103499,0.00024119098,0.00011712957,0.00019925005],"domain_scores_gemma":[0.99883205,0.000093340175,0.00006183644,0.0005332904,0.00035963635,0.00011987416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002612238,0.000110634195,0.000114050345,0.000045995526,0.00013387222,0.00013732565,0.00046529685,0.000035513403,0.000015983564],"category_scores_gemma":[0.0000495219,0.000083049934,0.00003246194,0.00032219104,0.000029507597,0.0003756123,0.00015415474,0.000085257176,0.000014298055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032462936,0.0008641023,0.005150792,0.000012967544,0.00018333289,0.000016040562,0.010341732,0.2240871,0.00087673875,0.554473,0.069645666,0.13402389],"study_design_scores_gemma":[0.0012350903,0.00014422,0.00041149405,0.000014173263,0.00000331445,0.000008778717,0.00007150208,0.9935098,0.000060608254,0.000028526722,0.0043588257,0.00015362757],"about_ca_topic_score_codex":0.0000032123485,"about_ca_topic_score_gemma":0.0000604641,"teacher_disagreement_score":0.7694227,"about_ca_system_score_codex":0.000035504258,"about_ca_system_score_gemma":0.000051251824,"threshold_uncertainty_score":0.3386678},"labels":[],"label_agreement":null},{"id":"W2368724693","doi":"10.1109/tvt.2016.2567602","title":"Performance Analysis of Dual-Hop MIMO AF Relaying Network With Multiple Interferences","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Relay; MIMO; Hop (telecommunications); Transmitter; Diversity gain; Computer science; Maximal-ratio combining; Array gain; Signal-to-noise ratio (imaging); Electronic engineering; Interference (communication); Transmission (telecommunications); Topology (electrical circuits); Computer network; Engineering; Telecommunications; Fading; Antenna array; Beamforming; Decoding methods; Electrical engineering; Antenna (radio); Power (physics); Physics; Channel (broadcasting)","score_opus":0.01925350628936448,"score_gpt":0.23820183820765578,"score_spread":0.2189483319182913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2368724693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31682575,0.00010297189,0.68154776,0.0010571495,0.00009180112,0.00008487478,0.0000017242231,0.00019305374,0.00009492465],"genre_scores_gemma":[0.98869157,0.0007974601,0.010279497,0.00005632363,0.000007170883,0.000050448733,5.660092e-7,0.000008178351,0.00010881035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888396,0.000085938555,0.0002790412,0.00034143336,0.00015773665,0.000251874],"domain_scores_gemma":[0.9985074,0.00018536099,0.000128467,0.0009730791,0.00016616884,0.00003956254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020174074,0.00015201968,0.0002928425,0.00067028875,0.00024694222,0.000020267315,0.00072526303,0.00012865449,0.00003940819],"category_scores_gemma":[0.000008486312,0.00010157833,0.00010096004,0.003026855,0.00020908783,0.00022511916,0.000015785534,0.00023239234,0.000017695747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010153943,0.00032252914,0.014941954,0.000016546493,0.001820058,0.00001364544,0.00052621553,0.13660425,0.02727045,0.0069206147,0.000075081545,0.8113871],"study_design_scores_gemma":[0.0016063324,0.0012005549,0.005867943,0.00056104973,0.00052326807,0.00004136115,0.00013045096,0.83677965,0.14965647,0.00020844537,0.0026931176,0.0007313155],"about_ca_topic_score_codex":0.0000038890003,"about_ca_topic_score_gemma":0.00021888533,"teacher_disagreement_score":0.81065583,"about_ca_system_score_codex":0.00004517187,"about_ca_system_score_gemma":0.000035969493,"threshold_uncertainty_score":0.4142244},"labels":[],"label_agreement":null},{"id":"W2397393284","doi":"10.1109/tvt.2015.2438113","title":"Data Detection Algorithms for BICM Alternate-Relaying Cooperative Systems With Multiple-Antenna Destination","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Algorithm; Decoding methods; Bit error rate; Network packet; Transmission (telecommunications); Real-time computing; Computer network; Telecommunications","score_opus":0.09213230490528193,"score_gpt":0.3040648141522022,"score_spread":0.21193250924692028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397393284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009069551,0.0003522637,0.9874373,0.0010247617,0.0005958863,0.000782814,0.000028307906,0.00068105734,0.000028061644],"genre_scores_gemma":[0.9640607,0.00011323595,0.035241764,0.000068861875,0.00003008236,0.0003636387,0.00001645983,0.000023775157,0.00008142967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998439,0.00013771816,0.0002947812,0.0006098096,0.00023231652,0.00028637462],"domain_scores_gemma":[0.9974432,0.00016949506,0.00013396663,0.001494612,0.0006683749,0.0000903478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048149016,0.0002157986,0.00023279944,0.0004556525,0.00047656524,0.00015073747,0.001408547,0.00017876907,0.000001015467],"category_scores_gemma":[0.00006729906,0.00018820727,0.00003658783,0.001074985,0.000118275275,0.0006276501,0.000028083841,0.0003969692,0.000019880454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023721036,0.0007312052,0.00012027762,0.000049210335,0.00045396938,0.000046806974,0.00074336136,0.26671213,0.04407626,0.009866255,0.00017671942,0.6767866],"study_design_scores_gemma":[0.0012807695,0.0005107391,0.0000070631427,0.00007295542,0.000027210144,0.00013833663,0.00017036182,0.97146183,0.023594972,0.00008172807,0.0024122747,0.00024176667],"about_ca_topic_score_codex":0.000025928715,"about_ca_topic_score_gemma":0.00027749734,"teacher_disagreement_score":0.9549912,"about_ca_system_score_codex":0.00016425794,"about_ca_system_score_gemma":0.000105590516,"threshold_uncertainty_score":0.76748693},"labels":[],"label_agreement":null},{"id":"W2399230524","doi":"","title":"Subspaces in d-bounded distance-regular graphs and authemtication code with perfect secrecy.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Linear subspace; Bounded function; Secrecy; Code (set theory); Discrete mathematics; Combinatorics; Pure mathematics; Computer science; Computer security; Mathematical analysis; Programming language","score_opus":0.027371213552851627,"score_gpt":0.25827809322165385,"score_spread":0.23090687966880222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399230524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98412067,0.001963352,0.009254269,0.0019215369,0.0002830082,0.00024352215,6.7779206e-7,0.00014933028,0.0020636334],"genre_scores_gemma":[0.9973487,0.00029397244,0.002125817,0.0000761298,0.0000019145264,0.000027935774,0.0000037356795,0.000008447531,0.00011329188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900544,0.00017870736,0.0001479012,0.0002828944,0.00019895546,0.00018611767],"domain_scores_gemma":[0.9989925,0.0000966436,0.00006520893,0.00058759196,0.00013850199,0.0001195539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047859494,0.00012489677,0.00015405122,0.00009348275,0.0001244513,0.00016876553,0.0004911056,0.000040520983,0.0000023089772],"category_scores_gemma":[0.000048674065,0.00010821572,0.00001579351,0.00064017193,0.0001000877,0.00040750194,0.00017206484,0.00014145781,0.0000061320716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013147753,0.00005093927,0.014429802,0.0000049058604,0.000007226329,0.0000032270564,0.0019536444,0.000011653889,0.00008081137,0.9808292,0.00018826289,0.0024271898],"study_design_scores_gemma":[0.0029942705,0.00032256966,0.022945369,0.00012257868,0.000010477472,0.000019194287,0.00030936574,0.048758656,0.0010089772,0.91682696,0.006207917,0.00047365527],"about_ca_topic_score_codex":0.000013940445,"about_ca_topic_score_gemma":0.00026976137,"teacher_disagreement_score":0.064002216,"about_ca_system_score_codex":0.000072278766,"about_ca_system_score_gemma":0.000084048115,"threshold_uncertainty_score":0.4412909},"labels":[],"label_agreement":null},{"id":"W2399609796","doi":"10.1109/tvt.2016.2570801","title":"Cognitive Coded Cooperation in Underlay Spectrum-Sharing Networks Under Interference Power Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Phase-shift keying; Rayleigh fading; Underlay; Spectral efficiency; Pairwise error probability; Bit error rate; Electronic engineering; Interference (communication); Signal-to-noise ratio (imaging); Fading; Computer network; Telecommunications; Wireless; Decoding methods; Channel (broadcasting); Engineering","score_opus":0.026819552753682276,"score_gpt":0.2692242868571702,"score_spread":0.24240473410348792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399609796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05055781,0.00010360193,0.94314635,0.0048693526,0.0002833024,0.00026907984,0.0000028264521,0.00037445268,0.00039319674],"genre_scores_gemma":[0.9979966,0.00040069676,0.0009408778,0.00042766577,0.000008920703,0.00008067049,0.0000010455663,0.0000146739385,0.00012884304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985177,0.00012413305,0.00033581053,0.0005438445,0.00012114853,0.00035734763],"domain_scores_gemma":[0.99886256,0.00019542765,0.00007752831,0.0006714794,0.00013473182,0.00005825363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023590213,0.00020964383,0.0002251564,0.00051580736,0.0002191337,0.0000750364,0.0008144546,0.00024761184,0.0001612777],"category_scores_gemma":[0.000018971277,0.00017308573,0.00006097892,0.0010525907,0.0003454137,0.0003282752,0.00002484538,0.0005170731,0.000086037784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001064599,0.0007871385,0.0007101877,0.000007761817,0.00021430515,0.00008123948,0.00065423344,0.032577395,0.03057887,0.37826452,0.00005465761,0.5559632],"study_design_scores_gemma":[0.009952697,0.0016023662,0.002233457,0.0024980828,0.000067090754,0.0005483051,0.000770214,0.692804,0.26552865,0.021037212,0.0005291644,0.002428781],"about_ca_topic_score_codex":0.0000031305726,"about_ca_topic_score_gemma":0.0002911041,"teacher_disagreement_score":0.9474388,"about_ca_system_score_codex":0.00018256753,"about_ca_system_score_gemma":0.00006287793,"threshold_uncertainty_score":0.7058231},"labels":[],"label_agreement":null},{"id":"W2400060492","doi":"","title":"Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Matching (statistics); Graph","score_opus":0.032708916663560655,"score_gpt":0.2940946643015328,"score_spread":0.2613857476379722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400060492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9870875,0.0003828651,0.00735835,0.0015424996,0.001343856,0.00063097494,0.000019608564,0.00018004152,0.0014542975],"genre_scores_gemma":[0.9960099,0.00014061853,0.0034110215,0.00021638726,0.000009685372,0.000091499474,0.000010958855,0.000011778832,0.000098191485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852234,0.00015546224,0.00025777053,0.0006019497,0.00013972387,0.0003227587],"domain_scores_gemma":[0.9973513,0.00094968773,0.000095098454,0.0011391718,0.0002702188,0.00019455646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009723286,0.00019411108,0.0002751162,0.00007160881,0.0008652911,0.00023781182,0.0005734265,0.00010345287,0.000028703002],"category_scores_gemma":[0.00049153453,0.00019264828,0.000059859354,0.00026362334,0.00031713521,0.0006410205,0.00054934365,0.00035221787,0.0000075505377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090513395,0.00015718398,0.0059864093,0.000017755337,0.00001925239,9.876242e-7,0.00024490114,8.6397006e-7,0.0040783538,0.9694015,0.0007819593,0.019301828],"study_design_scores_gemma":[0.0018894251,0.00022601912,0.13824876,0.000022635068,0.00002352747,0.00003176988,0.000034230867,0.036048193,0.0019166528,0.81457746,0.0065441644,0.0004371544],"about_ca_topic_score_codex":0.000023762346,"about_ca_topic_score_gemma":0.00024674556,"teacher_disagreement_score":0.15482399,"about_ca_system_score_codex":0.0000342037,"about_ca_system_score_gemma":0.00008596856,"threshold_uncertainty_score":0.7855969},"labels":[],"label_agreement":null},{"id":"W2401259547","doi":"10.21553/rev-jec.7","title":"Jointly Optimal Precoder and Power Allocation for an Amplify-and-Forward Half-Duplex Relay System","year":2011,"lang":"en","type":"article","venue":"REV Journal on Electronics and Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Diversity gain; Node (physics); Power (physics); Coding gain; Unitary state; Coding (social sciences); Relay channel; Mathematics; Mathematical optimization; Control theory (sociology); Decoding methods; Telecommunications; Fading; Statistics; Engineering; Physics","score_opus":0.07027839350277273,"score_gpt":0.2974531792271485,"score_spread":0.22717478572437574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401259547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08569756,0.059600774,0.8372247,0.009643967,0.00018792853,0.0012006701,0.000008198126,0.00024913932,0.006187022],"genre_scores_gemma":[0.89870423,0.03640167,0.06442324,0.00027317952,0.000020433703,0.0000508316,0.000008011482,0.000015472682,0.00010291415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987555,0.00029852003,0.00035000252,0.00022946137,0.000109797686,0.00025667608],"domain_scores_gemma":[0.9980247,0.00018465887,0.00021213734,0.0011608271,0.0002377338,0.00017996038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087001774,0.00015067114,0.00019492659,0.00011481706,0.0010867799,0.0003083095,0.00096094474,0.000074281736,0.0000035230503],"category_scores_gemma":[0.00003319015,0.00013506363,0.00004398923,0.00015581668,0.00008406741,0.0004913119,0.0003414482,0.0004889995,0.0000020346506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023058463,0.00011101027,0.00005588973,0.0000111522595,0.00005432847,2.6842372e-7,0.0017945425,0.00004758085,0.00028258393,0.9368582,0.00020174694,0.06055966],"study_design_scores_gemma":[0.0015022958,0.0024823092,0.0025552656,0.00029796877,0.000094735,0.0007524825,0.0006397677,0.80423486,0.00026706315,0.004153789,0.18233904,0.00068040827],"about_ca_topic_score_codex":0.000004408751,"about_ca_topic_score_gemma":0.000050732957,"teacher_disagreement_score":0.9327044,"about_ca_system_score_codex":0.00008620986,"about_ca_system_score_gemma":0.000106309235,"threshold_uncertainty_score":0.83587426},"labels":[],"label_agreement":null},{"id":"W2403296376","doi":"10.1007/bf03002701","title":"Affectation heuristique de cellules à des commutateurs dans les réseaux cellulaires pour mobiles","year":2001,"lang":"fr","type":"article","venue":"Annals of Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Chemistry","score_opus":0.1720603111444295,"score_gpt":0.37197397601157806,"score_spread":0.19991366486714857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403296376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33178306,0.11558662,0.4639636,0.06717856,0.0002026337,0.0005620735,0.000046231315,0.00024808513,0.020429142],"genre_scores_gemma":[0.74696916,0.1970824,0.052991763,0.0003863596,0.000058449532,0.000078175945,0.000062603,0.000033460838,0.0023375943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563694,0.0023298252,0.0008003445,0.0003555901,0.00024276192,0.00063453434],"domain_scores_gemma":[0.9938863,0.0016372697,0.0004853556,0.0026578016,0.0010949273,0.00023832892],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012455987,0.00035098795,0.0004078514,0.00024855658,0.001426288,0.00025639593,0.0034173715,0.00019954344,0.00017501165],"category_scores_gemma":[0.00046522194,0.00040557748,0.00026992758,0.0011615993,0.001096136,0.0007647986,0.0010579382,0.0006267305,0.00007713481],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004059544,0.0026735477,0.03444562,0.00023004132,0.0002880944,0.000020557241,0.03966019,0.018354582,0.020273749,0.25625926,0.020782966,0.6069708],"study_design_scores_gemma":[0.0010730859,0.00064150884,0.14925212,0.0019516164,0.00015697605,0.0002876222,0.0055097356,0.46865624,0.06524857,0.050455876,0.25518075,0.0015858774],"about_ca_topic_score_codex":0.0014458073,"about_ca_topic_score_gemma":0.0050291372,"teacher_disagreement_score":0.6053849,"about_ca_system_score_codex":0.00012140671,"about_ca_system_score_gemma":0.00044556448,"threshold_uncertainty_score":0.9998737},"labels":[],"label_agreement":null},{"id":"W2404847855","doi":"10.25781/kaust-i6321","title":"Cooperative Cognitive Radio Systems over Nakagami-m Fading Channels","year":2013,"lang":"en","type":"dissertation","venue":"King Abdullah University of Science and Technology Repository (King Abdullah University of Science and Technology)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Abdullah University of Science and Technology; Université du Québec à Montréal","keywords":"Fading; Cognitive radio; Nakagami distribution; Telecommunications; Computer science; Channel (broadcasting); Wireless","score_opus":0.010512419427954325,"score_gpt":0.21378890078870752,"score_spread":0.2032764813607532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404847855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883189,0.0024583314,0.001927061,0.00072527205,0.0008178334,0.00070868875,0.000007583032,0.0004955732,0.0045407615],"genre_scores_gemma":[0.9940131,0.0023186738,0.0018385587,0.00001578627,0.00001834931,0.0000010580783,0.000005057989,0.000014421436,0.0017750186],"study_design_codex":"bench_or_experimental","study_design_gemma":"qualitative","domain_scores_codex":[0.9959882,0.00008682122,0.00040606837,0.0016366191,0.001087345,0.00079497497],"domain_scores_gemma":[0.9927789,0.00014716598,0.0009958787,0.0010447442,0.0048063584,0.00022694956],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0013698242,0.00047432445,0.00085850863,0.0050355154,0.005181949,0.00026629158,0.0044986494,0.00076217257,0.000007527547],"category_scores_gemma":[0.00037243994,0.0005667167,0.00007545041,0.009295992,0.020668967,0.0019642084,0.0020589663,0.00095075293,0.0000057816187],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015252647,0.00047413804,0.014139396,0.00069126097,0.0005159649,0.0004683826,0.033025734,0.00013226525,0.60211545,0.22713444,0.0007424402,0.12040802],"study_design_scores_gemma":[0.008559638,0.00365089,0.019500896,0.01699591,0.0011096123,0.001388419,0.51238686,0.1509844,0.25694165,0.0037439656,0.017557211,0.007180518],"about_ca_topic_score_codex":0.00039742293,"about_ca_topic_score_gemma":0.0000995383,"teacher_disagreement_score":0.47936115,"about_ca_system_score_codex":0.0004278747,"about_ca_system_score_gemma":0.0016790486,"threshold_uncertainty_score":0.99967843},"labels":[],"label_agreement":null},{"id":"W2407119240","doi":"10.1007/978-3-319-17981-0","title":"Amplify-and-Forward Relaying in Wireless Communications","year":2015,"lang":"en","type":"book","venue":"SpringerBriefs in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Wireless; Computer science; Telecommunications; Computer network","score_opus":0.05901147896485024,"score_gpt":0.3046504332196041,"score_spread":0.24563895425475388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407119240","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013233356,0.0052055484,0.7874511,0.0034325868,0.0018152441,0.0011709064,0.0000051808424,0.0004863538,0.19910973],"genre_scores_gemma":[0.38428771,0.017974202,0.56625986,0.0041606505,0.0006571433,0.00026194943,0.00004274661,0.0001688,0.026186919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651796,0.00022292383,0.0007435718,0.0011372423,0.0007349568,0.000643355],"domain_scores_gemma":[0.99481255,0.00039981847,0.00027661436,0.0039296974,0.00031774957,0.00026355486],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0034939197,0.00038936918,0.00055650785,0.0010296708,0.00038750167,0.00070530875,0.008588435,0.000215585,0.000004820017],"category_scores_gemma":[0.00008961476,0.00042568333,0.00005622674,0.0016777168,0.0010840207,0.0010949268,0.010550692,0.0013928894,0.00004165342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033833205,0.00008529354,0.0008626364,0.000039461815,0.000008707457,0.00003116127,0.0029126485,0.00039313117,0.00004539381,0.5960227,0.0013723201,0.39822316],"study_design_scores_gemma":[0.0007142393,0.00008140621,0.0022628878,0.001095274,0.000005284434,0.00004489594,0.000008805029,0.89265835,0.00002500735,0.018149467,0.08392059,0.0010337644],"about_ca_topic_score_codex":0.00003087172,"about_ca_topic_score_gemma":0.0003262783,"teacher_disagreement_score":0.89226526,"about_ca_system_score_codex":0.00097490096,"about_ca_system_score_gemma":0.0016748926,"threshold_uncertainty_score":0.9998195},"labels":[],"label_agreement":null},{"id":"W2407241564","doi":"10.1002/wcm.2682","title":"Beamforming for inter‐relay interference reduction in MIMO‐aided two‐path successive relaying","year":2016,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Beamforming; Computer science; Relay; MIMO; Interference (communication); Transmission (telecommunications); Precoding; Channel (broadcasting); Reduction (mathematics); Telecommunications; Control theory (sociology); Algorithm; Mathematics; Power (physics)","score_opus":0.03753265475825325,"score_gpt":0.31592671299827096,"score_spread":0.2783940582400177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407241564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16526747,0.0013750691,0.83094686,0.0012837881,0.00021918831,0.0005106093,0.0000024046558,0.00013920062,0.0002553997],"genre_scores_gemma":[0.9352533,0.0021788792,0.062147748,0.00007370697,0.000049539747,0.00020589278,0.0000075283942,0.000016318343,0.00006706906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827695,0.00028873634,0.0005721321,0.0004353056,0.00009316121,0.0003336962],"domain_scores_gemma":[0.99655277,0.0011353769,0.00027357548,0.0016804824,0.000272117,0.00008567552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000822017,0.00019785005,0.00027019565,0.00022457432,0.00069474045,0.00018645394,0.0019478238,0.00006541621,0.0000030759734],"category_scores_gemma":[0.0001278778,0.0001656462,0.00006586026,0.00046829006,0.00018101538,0.00067071366,0.0021100254,0.0002645128,0.0000038515805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008988723,0.00008293307,0.0008058071,0.000016933633,0.000014938023,4.4685495e-7,0.0041171275,0.00022988756,0.0101556815,0.052449446,0.00004042388,0.9320774],"study_design_scores_gemma":[0.001659245,0.00017173513,0.0003217639,0.0016712047,0.000010244201,0.000028247994,0.0009631953,0.9868471,0.001713401,0.0010071753,0.0051083644,0.0004982928],"about_ca_topic_score_codex":0.00002837741,"about_ca_topic_score_gemma":0.00008176711,"teacher_disagreement_score":0.98661727,"about_ca_system_score_codex":0.00014046197,"about_ca_system_score_gemma":0.00006692699,"threshold_uncertainty_score":0.6754856},"labels":[],"label_agreement":null},{"id":"W2408224050","doi":"10.1109/tvt.2015.2432152","title":"An Optimized and Distributed Data Packet Forwarding Scheme in LTE/LTE-A Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Packet forwarding; Network packet; Overhead (engineering); Throughput; Handover; Quality of service; Node (physics); Markov decision process; Transmission delay; Markov process; Distributed computing; Wireless; Engineering; Telecommunications","score_opus":0.05776873557464761,"score_gpt":0.3035023078048648,"score_spread":0.2457335722302172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408224050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024613118,0.00054598274,0.9714428,0.0025280744,0.00017374307,0.00021748051,0.000012974564,0.00043255402,0.000033225275],"genre_scores_gemma":[0.94895214,0.0006241124,0.05017529,0.00013635475,0.000013166359,0.000044921937,0.000031275245,0.000012837193,0.000009925692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985433,0.00017393468,0.00027365502,0.00055428216,0.00014204592,0.00031277206],"domain_scores_gemma":[0.99758923,0.00007045906,0.00006427618,0.0020400055,0.00010893745,0.00012706441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005717944,0.00017823759,0.0002606742,0.00036489338,0.0002007013,0.00010870913,0.0016424225,0.00023345457,0.0000053490094],"category_scores_gemma":[0.000027811577,0.00017949221,0.000029345993,0.0012827008,0.00013577592,0.00061223493,0.000059153845,0.0005919612,0.0000073709084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016878289,0.0010562327,0.0007883894,0.000014707153,0.000182163,0.00010983022,0.00058185647,0.49087182,0.0034582347,0.017754475,0.0008788651,0.48413464],"study_design_scores_gemma":[0.0011067548,0.0001153518,0.000054267388,0.000033255637,0.000009622999,0.000034681576,0.00010011171,0.99495786,0.0011570115,0.00040042662,0.0018212334,0.00020943818],"about_ca_topic_score_codex":0.000009322738,"about_ca_topic_score_gemma":0.00011014471,"teacher_disagreement_score":0.924339,"about_ca_system_score_codex":0.00008021858,"about_ca_system_score_gemma":0.000059970498,"threshold_uncertainty_score":0.731948},"labels":[],"label_agreement":null},{"id":"W2410996924","doi":"10.1049/iet-com.2015.0943","title":"Performance enhancement of multi‐hop relay‐based wireless systems based on outage probability","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hop (telecommunications); Relay; Computer science; Outage probability; Wireless; Computer network; Wireless network; Telecommunications; Fading; Channel (broadcasting)","score_opus":0.08723189252725588,"score_gpt":0.3050085729121892,"score_spread":0.2177766803849333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2410996924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06517099,0.0004735656,0.9177963,0.009971549,0.00023370193,0.0009827375,0.000016501934,0.00025424716,0.0051003685],"genre_scores_gemma":[0.9610536,0.0005267142,0.037668932,0.0002265987,0.000007948159,0.00025298176,0.000009959872,0.000010346682,0.00024289219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979442,0.0007866171,0.0004962368,0.00028793246,0.00026983125,0.00021521373],"domain_scores_gemma":[0.99236035,0.001023242,0.0002601938,0.0058768005,0.00039938747,0.00008002641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010677301,0.00016192286,0.00022250954,0.00011375909,0.00037939727,0.000054560263,0.0033786471,0.000060060494,0.000022080298],"category_scores_gemma":[0.00014255765,0.000121986566,0.000078259654,0.00046957302,0.00023372134,0.00025342478,0.00061106903,0.0001826873,0.000055973876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023918349,0.009368629,0.033896398,0.0005163386,0.00017755042,0.000001886788,0.0038972164,0.020123325,0.108807854,0.24829106,0.0026362813,0.57204425],"study_design_scores_gemma":[0.00075580855,0.00013398468,0.0030207874,0.00043450677,0.0000059228573,3.704175e-7,0.000010685511,0.98252434,0.005761909,0.0000172429,0.007144353,0.0001901115],"about_ca_topic_score_codex":0.000010030056,"about_ca_topic_score_gemma":0.000030457491,"teacher_disagreement_score":0.962401,"about_ca_system_score_codex":0.00015751595,"about_ca_system_score_gemma":0.0001757777,"threshold_uncertainty_score":0.6278423},"labels":[],"label_agreement":null},{"id":"W2414419511","doi":"10.1109/tvt.2016.2578180","title":"Bidirectional AF Relaying With Underlay Spectrum Sharing in Cognitive Radio Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Underlay; Cognitive radio; Relay; Quadrature amplitude modulation; Additive white Gaussian noise; Computer science; Upper and lower bounds; Transceiver; Electronic engineering; Topology (electrical circuits); Bit error rate; Telecommunications; Signal-to-noise ratio (imaging); Computer network; Mathematics; Decoding methods; Engineering; Power (physics); White noise; Wireless; Electrical engineering; Physics","score_opus":0.0238415128837675,"score_gpt":0.2529274496435531,"score_spread":0.2290859367597856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414419511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046324212,0.00023539735,0.9471989,0.0049900655,0.00019039142,0.00019386556,0.0000010695252,0.00048613484,0.00037993997],"genre_scores_gemma":[0.9962929,0.00061508454,0.0025178518,0.00013837396,0.000019164328,0.0001010843,4.7952557e-7,0.000016831227,0.0002982498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987128,0.00007392874,0.00022126126,0.00050609314,0.00014806086,0.00033789352],"domain_scores_gemma":[0.99904984,0.0001784494,0.0000654453,0.0005851238,0.00007076899,0.00005037603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020768959,0.00017724588,0.00019002019,0.0006170616,0.00028574376,0.000045167006,0.00063566514,0.00017881965,0.000050836145],"category_scores_gemma":[0.000008929803,0.00013432476,0.00005445817,0.0014905394,0.00015874635,0.0002861768,0.000015080644,0.0005073662,0.000028986728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019929756,0.00079213356,0.005051521,0.000010904806,0.00036794378,0.00023394008,0.0004900859,0.071539156,0.008539907,0.082209826,0.00009631672,0.83046895],"study_design_scores_gemma":[0.013016925,0.0022239948,0.007943051,0.0034125575,0.00013014508,0.0014521006,0.000464165,0.76680666,0.18238658,0.012964546,0.0060684183,0.0031308893],"about_ca_topic_score_codex":0.0000056769504,"about_ca_topic_score_gemma":0.00031616155,"teacher_disagreement_score":0.9499687,"about_ca_system_score_codex":0.00018586931,"about_ca_system_score_gemma":0.00005024104,"threshold_uncertainty_score":0.5477605},"labels":[],"label_agreement":null},{"id":"W2417694764","doi":"10.1109/jsyst.2015.2455813","title":"Video Streaming Over Vehicular Ad Hoc Networks Using Erasure Coding","year":2015,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Computer network; Network packet; The Internet; Erasure code; Server; Internet Protocol; Packet loss; Wireless ad hoc network; Vehicular ad hoc network; Erasure; Wireless; Decoding methods; Telecommunications; Operating system","score_opus":0.08175939712134732,"score_gpt":0.3022505861435777,"score_spread":0.22049118902223036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417694764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10318933,0.024251968,0.8671313,0.00022490084,0.004487664,0.00016267726,5.820599e-7,0.000105497376,0.00044608468],"genre_scores_gemma":[0.99422526,0.001045603,0.003492206,0.00017013587,0.000908092,0.000003885154,6.406001e-7,0.000019415129,0.00013473368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977085,0.0005925528,0.0005193911,0.00025607625,0.00051491376,0.00040854176],"domain_scores_gemma":[0.9981148,0.00010436859,0.00033679605,0.00060950406,0.00048119872,0.0003533184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018246394,0.00020237992,0.00029684065,0.00015387041,0.00056187995,0.00095949124,0.0010205649,0.000104201514,0.0000062738113],"category_scores_gemma":[0.00006713026,0.00017955744,0.00010473597,0.0004856093,0.000032521693,0.0008718748,0.00019634867,0.00061044464,0.000013224489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001544499,0.000055371813,0.002555383,0.00001879532,0.00013549562,0.00018448621,0.0023085652,0.9421859,0.004374671,0.0015631525,0.012272425,0.03433035],"study_design_scores_gemma":[0.00061441254,0.00004888157,0.00023380617,0.00042482163,0.000012701726,0.0009007183,0.00009140958,0.97256976,0.00005464118,0.00004173529,0.024751507,0.00025558134],"about_ca_topic_score_codex":0.000006462506,"about_ca_topic_score_gemma":0.00001028079,"teacher_disagreement_score":0.891036,"about_ca_system_score_codex":0.00032469572,"about_ca_system_score_gemma":0.00021194914,"threshold_uncertainty_score":0.92523956},"labels":[],"label_agreement":null},{"id":"W244636295","doi":"10.1007/11945529_15","title":"Incremental Construction of k-Dominating Sets in Wireless Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Dominating set; Connected dominating set; Combinatorics; Vertex (graph theory); Monotone polygon; Discrete mathematics; Unit disk graph; Graph; Mathematics; Computer science; Set (abstract data type); Wireless sensor network; Wireless network; Wireless; Computer network; Telecommunications","score_opus":0.014188598628928932,"score_gpt":0.2589777498402869,"score_spread":0.24478915121135794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W244636295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2916234,0.00009059961,0.7075925,0.00025076236,0.00026838385,0.00010377684,2.1215669e-7,0.000029109273,0.000041260893],"genre_scores_gemma":[0.7328091,0.000017686798,0.26699698,0.00012416436,0.000044581328,0.0000034848044,8.0279693e-7,0.0000030283531,1.5122514e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844533,0.00014256482,0.0003809564,0.0004205615,0.00029016688,0.00032042974],"domain_scores_gemma":[0.9989023,0.00031507402,0.0001412558,0.00048453017,0.00012143246,0.00003539989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084643386,0.00013168616,0.00019258568,0.0003339682,0.00014858662,0.00013187695,0.0011041036,0.000052202522,0.0000032658431],"category_scores_gemma":[0.00004288014,0.00012832922,0.00002999926,0.0023320212,0.00034264347,0.00045657114,0.00063068117,0.00024899625,0.0000010397855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035135124,0.00005600695,0.025134949,0.0000060021243,0.0000011897698,0.00000646028,0.00039402032,0.19499779,0.0067859716,0.0050528017,0.0000022876554,0.767559],"study_design_scores_gemma":[0.0003076638,0.000029774568,0.021531822,0.00008819651,5.6305925e-7,0.000020526066,0.0000014051806,0.9626443,0.013342653,0.0018933937,0.000003856411,0.00013585288],"about_ca_topic_score_codex":0.00007347219,"about_ca_topic_score_gemma":0.00033616967,"teacher_disagreement_score":0.7676465,"about_ca_system_score_codex":0.00013235112,"about_ca_system_score_gemma":0.00008913149,"threshold_uncertainty_score":0.5233114},"labels":[],"label_agreement":null},{"id":"W2461887739","doi":"10.1109/tsp.2017.2649486","title":"Cross-Layer Design for Downlink Multihop Cloud Radio Access Networks With Network Coding","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Radio access network; Telecommunications link; Multicast; Linear network coding; Beamforming; Unicast; Cloud computing; Base station; Telecommunications; Network packet","score_opus":0.1085573153800559,"score_gpt":0.3545309885053992,"score_spread":0.2459736731253433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461887739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006143514,0.00036495778,0.99675477,0.0005225438,0.00054792047,0.0006169464,0.0000024192086,0.0002685164,0.000307553],"genre_scores_gemma":[0.9238352,0.00018412533,0.074670054,0.00038162209,0.00040199325,0.00018453451,0.000001585904,0.000038570033,0.00030232666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979761,0.00014249285,0.00038342678,0.0006251604,0.00028012166,0.0005926971],"domain_scores_gemma":[0.9975948,0.0004504528,0.00036267174,0.0010093639,0.00041274284,0.00017000544],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008295738,0.00032303506,0.00031993192,0.000099677585,0.005349901,0.0035695347,0.0024100926,0.00013647626,0.000030913507],"category_scores_gemma":[0.000010994963,0.00028029527,0.00012018264,0.00035594273,0.0002137657,0.002269275,0.000025582573,0.0005192513,0.000006679083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016344007,0.00006853928,0.00006684786,0.000020633177,0.000037863785,0.0000037377376,0.00020707298,0.6939834,0.00019324593,0.00022107562,0.00016045045,0.3048737],"study_design_scores_gemma":[0.0012336397,0.00016325644,0.00026574996,0.00035757004,0.000031998963,0.000015872753,0.0000075493404,0.9913747,0.005071041,0.0001596354,0.00089602475,0.00042298035],"about_ca_topic_score_codex":0.000005090744,"about_ca_topic_score_gemma":0.00003097264,"teacher_disagreement_score":0.9232208,"about_ca_system_score_codex":0.00009610526,"about_ca_system_score_gemma":0.00019236059,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W2462178547","doi":"","title":"On approximate min-max theorems for graph connectivity problems","year":2006,"lang":"en","type":"article","venue":"TSpace","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Disjoint sets; Vertex (graph theory); Spanning tree; Conjecture; Discrete mathematics; Hypergraph; Graph","score_opus":0.03518498636823825,"score_gpt":0.3031521481228538,"score_spread":0.26796716175461555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2462178547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023620857,0.00031859012,0.94327176,0.0040577217,0.00015927138,0.0004938247,0.0000011836551,0.00024242242,0.027834391],"genre_scores_gemma":[0.98550975,0.000041279705,0.011918832,0.00039155452,0.000051412753,0.000103351544,0.000004756065,0.000010350495,0.0019687377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992058,0.00008969496,0.000112866124,0.000264213,0.000110947316,0.00021643484],"domain_scores_gemma":[0.99884266,0.0003477987,0.00006689935,0.0006193529,0.00008624968,0.00003706637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038459737,0.000114367394,0.00012332012,0.000059050224,0.00023649127,0.000116483956,0.00056050636,0.000034745393,0.00001436464],"category_scores_gemma":[0.00004510851,0.00009859673,0.00006173288,0.00028928448,0.0000459889,0.00012183198,0.00013347686,0.000093125454,0.000017893777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007656961,0.00008853691,0.000043519507,0.000008590886,0.0000056794293,4.0283282e-7,0.00062453985,0.0008013604,0.0021541112,0.9793787,0.0070746527,0.009812243],"study_design_scores_gemma":[0.00205114,0.000489621,0.0014816823,0.00014544632,0.000012880681,0.00001044856,0.000119859884,0.43412614,0.018212754,0.4430473,0.09942613,0.00087660016],"about_ca_topic_score_codex":0.000015738697,"about_ca_topic_score_gemma":0.00007515189,"teacher_disagreement_score":0.96188885,"about_ca_system_score_codex":0.000027673426,"about_ca_system_score_gemma":0.00002047369,"threshold_uncertainty_score":0.40206578},"labels":[],"label_agreement":null},{"id":"W2464946242","doi":"10.1109/vtcspring.2016.7504185","title":"Delay Analysis for Distributed Opportunistic Cooperative Communication under Strong Interference Channel","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Relay; Computer science; Channel state information; Computer network; Channel (broadcasting); Transmission (telecommunications); Relay channel; Wireless; Latency (audio); Interference (communication); Selection (genetic algorithm); Telecommunications","score_opus":0.10251359261828209,"score_gpt":0.31882788780795107,"score_spread":0.216314295189669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464946242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005556493,0.00010928351,0.9914581,0.006133477,0.000048564118,0.00023411587,0.00004009208,0.00014299923,0.0012776883],"genre_scores_gemma":[0.9882315,0.00039596861,0.009775405,0.00034660145,0.000012144505,0.00009937226,0.00010370792,0.000006293048,0.0010289985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884635,0.00020399908,0.0002971231,0.00031453377,0.000109099215,0.0002288822],"domain_scores_gemma":[0.9974334,0.00063376804,0.000115746356,0.0012143906,0.0004955753,0.000107111875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038048354,0.00014582765,0.00021785244,0.00013620954,0.00034191995,0.00015861513,0.0013942383,0.00004560693,0.000114245144],"category_scores_gemma":[0.00011150048,0.00009743284,0.000102260485,0.0007772389,0.00009262366,0.0004646076,0.00053382514,0.00007548662,0.000019631647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012218213,0.00007152702,0.00023374602,0.0000021431597,0.00029502995,3.756858e-7,0.00025632302,0.0007825241,0.00063613034,0.9746485,0.0012591516,0.021802329],"study_design_scores_gemma":[0.0012000245,0.00019837813,0.0039446517,0.000085375745,0.00014985648,0.0000035564838,0.00022428513,0.9817828,0.001255487,0.005384661,0.0051903566,0.0005805747],"about_ca_topic_score_codex":0.0000059562476,"about_ca_topic_score_gemma":0.00026952068,"teacher_disagreement_score":0.98767585,"about_ca_system_score_codex":0.00010160743,"about_ca_system_score_gemma":0.00007497138,"threshold_uncertainty_score":0.3973196},"labels":[],"label_agreement":null},{"id":"W2466725266","doi":"10.1007/978-3-319-27568-0_7","title":"Cross-Layer Designs for Energy-Efficient Wireless Ad-hoc Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Studies in systems, decision and control","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer network; Computer science; Wireless network; Physical layer; Wireless ad hoc network; Energy consumption; Wireless; Efficient energy use; PHY; Distributed computing; Engineering; Telecommunications; Electrical engineering","score_opus":0.1075199087938668,"score_gpt":0.35223161418027543,"score_spread":0.24471170538640863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466725266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002455249,0.21981092,0.7658097,0.0001831724,0.001961098,0.0007646362,0.000016133754,0.00007846011,0.011351293],"genre_scores_gemma":[0.72830904,0.12876981,0.001108303,0.00089610025,0.0006628615,0.0007654478,0.000005584856,0.0000939409,0.13938892],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99721134,0.0001586247,0.0009898616,0.00082298066,0.0003892736,0.00042790582],"domain_scores_gemma":[0.9947456,0.0029162355,0.00041666863,0.0010742712,0.00072361354,0.00012357577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013136487,0.0004842272,0.0010672242,0.00023561073,0.00050294126,0.00028766115,0.0010270791,0.0002871917,0.00001194713],"category_scores_gemma":[0.00012294954,0.0003474564,0.0001777872,0.00009179363,0.00025109324,0.00011092223,0.0007229359,0.00023475682,0.000013433298],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014640755,0.000021704183,0.0000147314,0.00003574411,0.00019519529,0.0000143780135,0.0003064432,0.0010017271,0.00001072324,0.45130616,0.0035974646,0.5433493],"study_design_scores_gemma":[0.0045622033,0.00023679741,0.000032129345,0.0030675319,0.000043179392,0.000022304213,0.00007874048,0.26433364,0.0000025323836,0.005163082,0.7215879,0.0008699741],"about_ca_topic_score_codex":6.7591407e-7,"about_ca_topic_score_gemma":0.000038621172,"teacher_disagreement_score":0.7647014,"about_ca_system_score_codex":0.00020253792,"about_ca_system_score_gemma":0.000068427194,"threshold_uncertainty_score":0.9998977},"labels":[],"label_agreement":null},{"id":"W2469954218","doi":"10.1109/tmc.2016.2585106","title":"Network Coding as a Performance Booster for Concurrent Multi-Path Transfer of Data in Multi-Hop Wireless Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Linear network coding; Network packet; Transport layer; Stream Control Transmission Protocol; Testbed; Wireless network; Distributed computing; Network layer; Wireless; Layer (electronics)","score_opus":0.09436529703555026,"score_gpt":0.3288500961123661,"score_spread":0.23448479907681585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469954218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04294038,0.00033483712,0.95475954,0.0001365433,0.0008439618,0.00083216245,0.0000170742,0.00011940106,0.00001610276],"genre_scores_gemma":[0.97803706,0.00083037274,0.020702165,0.00016351476,0.000066529145,0.000098902005,0.000005610395,0.00002631268,0.00006953446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977679,0.00021438113,0.00067000365,0.0006475,0.0001894763,0.00051072065],"domain_scores_gemma":[0.99759126,0.00085918256,0.00012039259,0.0011907257,0.00014086225,0.00009760542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008760882,0.00026204175,0.00038201074,0.0001410338,0.00036477004,0.00006832553,0.0016048906,0.000102233964,0.000013252915],"category_scores_gemma":[0.0000078540525,0.00021937038,0.00010369143,0.0005528446,0.000095733456,0.00060882815,0.000050165574,0.00031142015,0.0000073781903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003902442,0.00031744828,0.00023886151,0.000040625004,0.0000306241,0.000001287651,0.00077374466,0.16536206,0.0010809209,0.00047723134,0.000042552823,0.8315956],"study_design_scores_gemma":[0.0023098486,0.00019148692,0.00032296992,0.0008509602,0.000012369691,0.000005762697,0.000025262647,0.99334836,0.0020634762,0.0000039239208,0.0005791144,0.00028645582],"about_ca_topic_score_codex":0.0000066447496,"about_ca_topic_score_gemma":0.000085851665,"teacher_disagreement_score":0.9350967,"about_ca_system_score_codex":0.00009189824,"about_ca_system_score_gemma":0.00008208435,"threshold_uncertainty_score":0.8945665},"labels":[],"label_agreement":null},{"id":"W2472981973","doi":"10.1049/iet-com.2016.0076","title":"Opportunistic scheduling for a two‐way relay network using Markov decision process","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Relay; Markov decision process; Markov process; Scheduling (production processes); Partially observable Markov decision process; Computer network; Decision process; Markov chain; Markov model; Mathematical optimization; Machine learning; Mathematics; Business; Statistics; Process management","score_opus":0.11711992038712456,"score_gpt":0.37751159357729364,"score_spread":0.2603916731901691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472981973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034016198,0.0012613939,0.9871692,0.005656192,0.0002220589,0.0004633431,0.000008708273,0.00022226135,0.0015952335],"genre_scores_gemma":[0.5703532,0.00089490216,0.42808232,0.00032026612,0.00006975383,0.00011890117,0.000009692655,0.000017460017,0.00013349368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983175,0.00027324175,0.00048174433,0.00035543542,0.0001938983,0.00037822957],"domain_scores_gemma":[0.99315363,0.0019588927,0.0002310722,0.003993499,0.0005140999,0.0001488007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010495962,0.00018277937,0.0002196139,0.000103515515,0.0012941494,0.00018818906,0.0040835314,0.00006851066,0.000024572619],"category_scores_gemma":[0.00048612495,0.00014586325,0.00010492056,0.00069691584,0.0001555033,0.0005781975,0.0014086546,0.00018929418,0.00002601564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002951421,0.00018472163,0.00069077517,0.000014453828,0.000058660095,0.0000011315609,0.0006594515,0.0039866953,0.0037444604,0.41697407,0.0017173449,0.5719387],"study_design_scores_gemma":[0.0012145047,0.00006110342,0.00032753026,0.0006677459,0.000031818443,0.000022390082,0.000039924613,0.9330253,0.00016628948,0.020473585,0.04349337,0.0004764396],"about_ca_topic_score_codex":0.0000036798506,"about_ca_topic_score_gemma":0.00007610164,"teacher_disagreement_score":0.9290386,"about_ca_system_score_codex":0.00011581136,"about_ca_system_score_gemma":0.00021497396,"threshold_uncertainty_score":0.99536824},"labels":[],"label_agreement":null},{"id":"W2473225105","doi":"10.1109/tvt.2016.2582515","title":"Robust Optimization of SC-FDE-Based Multihop DF Relay Systems With Imperfect CSI","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"SC-FDE; Relay; Computer science; Channel state information; Bit error rate; Optimization problem; Equalization (audio); Transmitter power output; Robustness (evolution); Mathematical optimization; Channel (broadcasting); Power (physics); Algorithm; Wireless; Mathematics; Computer network; Telecommunications; Transmitter","score_opus":0.021064770929442308,"score_gpt":0.22456797332281336,"score_spread":0.20350320239337105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473225105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111825755,0.00021776704,0.9852262,0.0023183466,0.00018750425,0.00032176194,0.0000041864887,0.00047179608,0.000069854716],"genre_scores_gemma":[0.9535063,0.00026638227,0.045936696,0.00005174431,0.0000070744763,0.000108328604,9.1686985e-7,0.000017768054,0.000104796556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876714,0.0001490252,0.00029003085,0.00037170318,0.00019368443,0.0002284097],"domain_scores_gemma":[0.9982216,0.00015276414,0.00014047895,0.0011398323,0.00029559323,0.0000497706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021376791,0.0001769397,0.00024021347,0.0005069507,0.00022019674,0.000032196072,0.00075149693,0.00020373272,0.00002036822],"category_scores_gemma":[0.000014526581,0.00012230373,0.00006983145,0.0011222443,0.00019468718,0.00021409738,0.0000074631866,0.00023418285,0.000018072527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022045388,0.00013872585,0.000047836875,0.000009784129,0.000042409316,0.000005048854,0.000030403293,0.9544718,0.011460625,0.002442815,0.000018862445,0.031309623],"study_design_scores_gemma":[0.0012806732,0.0004529614,0.000022050743,0.00028869623,0.000024028452,0.000032097585,0.000017876468,0.89240396,0.1045984,0.000012354678,0.0006274877,0.00023940332],"about_ca_topic_score_codex":0.0000066353723,"about_ca_topic_score_gemma":0.000023944902,"teacher_disagreement_score":0.94232374,"about_ca_system_score_codex":0.0000976463,"about_ca_system_score_gemma":0.00009052074,"threshold_uncertainty_score":0.4987401},"labels":[],"label_agreement":null},{"id":"W2474855735","doi":"10.1109/vtcspring.2016.7504205","title":"Effect of Bursty Impulsive Noise on the Performance of Multi-Relay DF Cooperative Relaying Scheme","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Additive white Gaussian noise; Relay; Rayleigh fading; Computer science; Bit error rate; Channel (broadcasting); Fading; Noise (video); Algorithm; Gaussian noise; Electronic engineering; Topology (electrical circuits); Mathematics; Telecommunications; Engineering; Physics; Artificial intelligence","score_opus":0.023795415113034596,"score_gpt":0.27965124486979065,"score_spread":0.255855829756756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474855735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93744683,0.00019174529,0.058273766,0.0013331674,0.000102249316,0.0003493971,0.0000014706488,0.000047064717,0.002254325],"genre_scores_gemma":[0.99564874,0.00039008065,0.0029672824,0.00016455134,0.000012312719,0.000024887877,3.4360875e-7,0.000006146532,0.0007856282],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99877775,0.0004024458,0.00026560924,0.000209893,0.00018381234,0.00016048356],"domain_scores_gemma":[0.997311,0.0013988469,0.00015334491,0.00084884063,0.00024797863,0.00003999443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081731204,0.00013732899,0.0002054648,0.00005764349,0.00017712513,0.000019173196,0.0009645404,0.00003920199,0.00006831308],"category_scores_gemma":[0.00026632883,0.00006119579,0.000067805915,0.00035336797,0.00014880885,0.00025314346,0.0003931848,0.0001327333,0.00004524421],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002318997,0.00027153984,0.014461769,0.00006673155,0.00015928698,0.000001986994,0.00353098,0.0010416447,0.45909268,0.17208274,0.0013093936,0.34774935],"study_design_scores_gemma":[0.0012414148,0.0012687689,0.0033537173,0.00040242512,0.0000067972383,0.0000023327007,0.000024523006,0.21340573,0.779595,0.00000503401,0.0005009337,0.00019332841],"about_ca_topic_score_codex":0.0000031809661,"about_ca_topic_score_gemma":0.0000042559236,"teacher_disagreement_score":0.34755602,"about_ca_system_score_codex":0.000034994886,"about_ca_system_score_gemma":0.000039006118,"threshold_uncertainty_score":0.24954918},"labels":[],"label_agreement":null},{"id":"W2476926530","doi":"10.1017/cbo9780511667008.011","title":"Cross-layer scheduling design for cooperative wireless two-way relay networks","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MIMO; Fading; Spatial multiplexing; Computer science; Wireless; Multi-user MIMO; Relay; Computer network; 3G MIMO; Scheduling (production processes); Wireless network; Multiplexing; Electronic engineering; Transmitter power output; Bandwidth (computing); Channel (broadcasting); Power (physics); Telecommunications; Engineering; Mathematics; Transmitter; Mathematical optimization; Physics","score_opus":0.08578330908249188,"score_gpt":0.2633361306793819,"score_spread":0.17755282159689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476926530","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022076892,0.0004133047,0.5600709,0.000013997485,0.00027822965,0.00068009965,0.000020159849,0.00019742954,0.43830383],"genre_scores_gemma":[0.01174678,0.0009368595,0.015325712,0.0002176617,0.00022620543,0.000012254731,0.00003949818,0.00007926952,0.97141576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976324,0.00021072297,0.00038847566,0.0009950978,0.00024236512,0.00053093507],"domain_scores_gemma":[0.9963654,0.0004239119,0.00040859153,0.0015847357,0.0009544448,0.00026287016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005039566,0.0006049845,0.0006119742,0.00020550421,0.0009998365,0.0003418454,0.0026575369,0.00045039333,0.000013388313],"category_scores_gemma":[0.000023563802,0.0006884183,0.00030391605,0.000039785507,0.00035034574,0.00043604517,0.0015445934,0.0008742899,0.000021159296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011157949,0.000015983956,0.0000012747383,0.000018966553,0.00017041355,0.000042657506,0.00021565982,0.0048665367,0.000054280958,0.97977537,0.0038831523,0.010844136],"study_design_scores_gemma":[0.0019549115,0.00019921569,0.0000070602523,0.00043393325,0.00013971527,0.000019644023,0.000009637073,0.31358463,0.0012129624,0.00006523387,0.6810242,0.0013488458],"about_ca_topic_score_codex":0.00001596489,"about_ca_topic_score_gemma":0.000004149304,"teacher_disagreement_score":0.9797101,"about_ca_system_score_codex":0.00026482312,"about_ca_system_score_gemma":0.00023883706,"threshold_uncertainty_score":0.9995567},"labels":[],"label_agreement":null},{"id":"W2479114928","doi":"10.4018/978-1-60566-665-5.ch017","title":"Data Gathering in Correlated Wireless Sensor Networks with Cooperative Transmission","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MIMO; Transmission (telecommunications); Node (physics); Wireless sensor network; Constellation; Computer science; Coding (social sciences); Topology (electrical circuits); Wireless; Algorithm; Channel (broadcasting); Computer network; Mathematics; Engineering; Statistics; Telecommunications","score_opus":0.037404700229346374,"score_gpt":0.2649968056404916,"score_spread":0.22759210541114522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479114928","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001473718,0.0007647182,0.39606506,0.00017563734,0.00029329435,0.0005567117,0.00003668605,0.0002421485,0.60171837],"genre_scores_gemma":[0.8665327,0.0013335809,0.05212409,0.001815461,0.00047978744,0.000063482854,0.00019947831,0.00024268977,0.07720877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978981,0.00009145466,0.0004488255,0.000879082,0.0003062438,0.00037631884],"domain_scores_gemma":[0.9970474,0.00009543169,0.00020573703,0.0022812486,0.00019078382,0.00017936224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002752514,0.00048990914,0.00050904904,0.00007563482,0.00023540159,0.00024856435,0.0026217753,0.0004706956,0.00004267766],"category_scores_gemma":[0.000007630577,0.00041588303,0.00005644889,0.000103184335,0.00015069378,0.00021144505,0.0009979177,0.0013416517,0.000035541852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072301096,0.000028047156,0.000025744033,0.000011452525,0.00008085627,0.0001670175,0.0003859802,0.0016333401,0.00015325681,0.8688225,0.00022026864,0.12839924],"study_design_scores_gemma":[0.002549401,0.00032638345,0.00010856807,0.0031189688,0.00007904803,0.00027015503,0.000025729758,0.82639164,0.00013919295,0.010492888,0.15417194,0.0023260538],"about_ca_topic_score_codex":0.000021022479,"about_ca_topic_score_gemma":0.0009810241,"teacher_disagreement_score":0.8663853,"about_ca_system_score_codex":0.00013398471,"about_ca_system_score_gemma":0.0002732338,"threshold_uncertainty_score":0.9998293},"labels":[],"label_agreement":null},{"id":"W2484401148","doi":"10.1109/icc.2016.7511175","title":"BICM-ID in two-way relaying communications","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decoding methods; Relay; Computer science; Algorithm; Bit error rate; Interference (communication); Coding (social sciences); Upper and lower bounds; Phase-shift keying; Code (set theory); Theoretical computer science; Telecommunications; Mathematics; Channel (broadcasting); Statistics","score_opus":0.07400031242674611,"score_gpt":0.3346696766742477,"score_spread":0.2606693642475016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484401148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008070986,0.0010459026,0.7934801,0.04632825,0.00017172056,0.00020386987,7.221103e-7,0.00037455995,0.15032388],"genre_scores_gemma":[0.9556838,0.0013315532,0.040763784,0.0007137086,0.000011802581,0.000021092792,7.3297645e-7,0.000004473831,0.0014690073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918956,0.0001915138,0.00019966988,0.00017007424,0.00008646945,0.00016268744],"domain_scores_gemma":[0.99758136,0.00035757883,0.000039606362,0.0019172841,0.00005599606,0.000048175378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038848305,0.00007082673,0.00008489376,0.0001069948,0.00015759055,0.00006299047,0.0020330485,0.000017420123,0.00008525396],"category_scores_gemma":[0.00006133278,0.000047924765,0.000023396737,0.00046038974,0.000056815017,0.0004417863,0.0011675738,0.000101560065,0.00022648097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.3415557e-7,0.000040544357,0.0028047552,5.8605696e-7,0.0000031588554,0.0000010763389,0.00029405457,0.0000056034655,0.0045567,0.661067,0.00097401964,0.33025166],"study_design_scores_gemma":[0.0051555987,0.000118525866,0.052278865,0.00056301063,0.000007481246,0.000050096478,0.00020907211,0.22767796,0.007513634,0.024886161,0.6800341,0.0015055337],"about_ca_topic_score_codex":0.000017837465,"about_ca_topic_score_gemma":0.000596823,"teacher_disagreement_score":0.9476129,"about_ca_system_score_codex":0.0000578072,"about_ca_system_score_gemma":0.000030730913,"threshold_uncertainty_score":0.37779438},"labels":[],"label_agreement":null},{"id":"W2489233087","doi":"10.4018/978-1-4666-8732-5.ch008","title":"Energy-Efficient Power Allocation for HARQ Systems","year":2015,"lang":"en","type":"book-chapter","venue":"Advances in wireless technologies and telecommunication book series","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Automatic repeat request; Network packet; Rayleigh fading; Wireless; Fading; Transmission (telecommunications); Computer network; Real-time computing; Telecommunications; Channel (broadcasting)","score_opus":0.026347940181224383,"score_gpt":0.2674142021423432,"score_spread":0.2410662619611188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489233087","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033830078,0.61920226,0.23576482,0.0054734116,0.00048470966,0.0012759359,0.000025767455,0.0016579295,0.13608134],"genre_scores_gemma":[0.20160699,0.7428329,0.012888047,0.00014648668,0.000026633636,0.0008026244,0.00011816167,0.00006799245,0.041510172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834114,0.00005594176,0.0005927192,0.0005229818,0.0002106628,0.00027654186],"domain_scores_gemma":[0.9966845,0.00026004194,0.00046373758,0.0021193535,0.0004297918,0.00004257916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039687508,0.0003722534,0.0004766326,0.0003300831,0.00032327088,0.0001921851,0.0021577599,0.00037311055,0.000004393996],"category_scores_gemma":[0.0000634667,0.00036602738,0.00006249201,0.0001566407,0.00040807342,0.0010979897,0.0013526848,0.0004000888,0.0000037323491],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000951126,0.000017228054,0.000002262011,0.000028531724,0.000011941428,5.028673e-7,0.000100047524,0.00025777114,0.000020644267,0.7900563,0.00039957426,0.2090957],"study_design_scores_gemma":[0.00025633714,0.00013161327,0.0000027512249,0.00034442454,0.000007477963,0.000012076323,0.0002323559,0.01741637,0.00017727377,0.030876579,0.950101,0.0004417288],"about_ca_topic_score_codex":0.0000039019214,"about_ca_topic_score_gemma":0.0001395421,"teacher_disagreement_score":0.9497014,"about_ca_system_score_codex":0.00020201202,"about_ca_system_score_gemma":0.000105009385,"threshold_uncertainty_score":0.9998792},"labels":[],"label_agreement":null},{"id":"W2489354201","doi":"10.4018/978-1-60566-665-5.ch009","title":"Relay Selection in Cooperative Networks","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Cooperative diversity; Computer science; Maximal-ratio combining; Selection (genetic algorithm); Computer network; Antenna diversity; Node (physics); Synchronization (alternating current); Transmission (telecommunications); Fading; Channel state information; Diversity combining; Relay channel; Channel (broadcasting); Rendering (computer graphics); Outage probability; Telecommunications; Wireless; Engineering; Artificial intelligence","score_opus":0.023202402897054754,"score_gpt":0.2613966515396758,"score_spread":0.23819424864262104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489354201","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034345645,0.00059457234,0.10877553,0.00016945916,0.00044469238,0.0003344464,0.0000033968497,0.00020126672,0.8894423],"genre_scores_gemma":[0.7017995,0.0005447002,0.013611135,0.0032144755,0.0009286924,0.00010873761,0.000013164454,0.00010195923,0.27967763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998374,0.00008295301,0.00041375784,0.000573991,0.00023119173,0.00032414097],"domain_scores_gemma":[0.99870664,0.000070726324,0.00018441533,0.00067837565,0.00023872474,0.00012109051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026020492,0.00037195272,0.00037680857,0.000102566024,0.00022997835,0.00022636802,0.0011379791,0.0005312403,0.00006648507],"category_scores_gemma":[0.000023754708,0.0003782343,0.00010961154,0.0001004315,0.00009232362,0.00013861856,0.0005744726,0.0012701837,0.00013726736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065911076,0.000007876672,0.000014820874,0.0000020184634,0.000018390456,0.000011680561,0.00006208385,0.0010172378,0.000039530445,0.9789373,0.0006465363,0.019235881],"study_design_scores_gemma":[0.0019869986,0.00046436992,0.0005291234,0.0010024667,0.000055061828,0.00023475187,0.0000090434105,0.22752032,0.00028218044,0.2440921,0.52081543,0.0030081552],"about_ca_topic_score_codex":0.000011160628,"about_ca_topic_score_gemma":0.0015196785,"teacher_disagreement_score":0.7348452,"about_ca_system_score_codex":0.00029361658,"about_ca_system_score_gemma":0.00023392598,"threshold_uncertainty_score":0.99986696},"labels":[],"label_agreement":null},{"id":"W2489403550","doi":"10.1109/icc.2016.7511027","title":"Maximizing coding gain in wireless networks with decodable network coding","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Linear network coding; Computer network; Multicast; Computer science; Unicast; Network packet; Coding (social sciences); Relay; Coding gain; Wireless network; Wireless; Decoding methods; Distributed computing; Algorithm; Telecommunications; Mathematics","score_opus":0.027715113157994433,"score_gpt":0.24909085264534858,"score_spread":0.22137573948735415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489403550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052151904,0.00026193133,0.98016995,0.0017839264,0.00017410646,0.00018680612,1.56475e-7,0.00025005153,0.011957851],"genre_scores_gemma":[0.9634469,0.0013746966,0.033584114,0.0007123535,0.00010992936,0.00003208773,9.3443794e-7,0.000018534349,0.0007204303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981467,0.00021759533,0.00034409395,0.000452676,0.00019308146,0.00064585113],"domain_scores_gemma":[0.9983124,0.00055090955,0.00011109477,0.0008054556,0.000096383825,0.00012375123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008815603,0.00020832842,0.00026400204,0.0001137949,0.0003103004,0.00021729329,0.001116701,0.000069519934,0.00007465544],"category_scores_gemma":[0.00002870565,0.00013541117,0.000040843315,0.0010203297,0.000062593055,0.0007107809,0.0005698407,0.0002053464,0.000025695435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036852856,0.000060361137,0.02505259,0.000007984169,0.000029904631,0.00003730663,0.00031696793,0.018942796,0.0011342696,0.632369,0.0029030566,0.31910893],"study_design_scores_gemma":[0.0015174072,0.00008344293,0.0033297627,0.000896117,0.0000046686882,0.000028755787,0.000044391527,0.98804694,0.00082639634,0.00083828834,0.0037662901,0.0006175078],"about_ca_topic_score_codex":0.0000109732455,"about_ca_topic_score_gemma":0.00051632413,"teacher_disagreement_score":0.9691042,"about_ca_system_score_codex":0.00013814414,"about_ca_system_score_gemma":0.000062339204,"threshold_uncertainty_score":0.5521907},"labels":[],"label_agreement":null},{"id":"W2490243937","doi":"10.1142/9789812837172_0014","title":"COOPERATIVE DIVERSITY SYSTEMS FOR WIRELESS COMMUNICATION","year":2010,"lang":"en","type":"book-chapter","venue":"Series on coding theory and cryptology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Diversity (politics); Wireless; Computer science; Cooperative diversity; Telecommunications; Computer network; Wireless network; Sociology; Anthropology","score_opus":0.033996931116331126,"score_gpt":0.2591204972538753,"score_spread":0.2251235661375442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490243937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001319325,0.008957799,0.5689201,0.0042018727,0.0024930502,0.0020338895,0.00009929726,0.0006228268,0.41135186],"genre_scores_gemma":[0.664046,0.060429666,0.007020897,0.003043889,0.0004585989,0.00028312427,0.00026361799,0.0001364576,0.26431778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986583,0.00035150745,0.00026047174,0.00042277842,0.00010391464,0.00020301779],"domain_scores_gemma":[0.9970351,0.0013451871,0.00022979018,0.0010287414,0.00028520788,0.000076006654],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009542365,0.00028959417,0.00043716386,0.000111695445,0.0017181913,0.00015788671,0.0011783616,0.0003762546,0.000046280504],"category_scores_gemma":[0.00008342136,0.00027724492,0.00007385975,0.000037886493,0.00051615667,0.00024468763,0.0014720678,0.00062893284,0.000014360407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010175476,0.000010948673,0.0000025907618,0.000025937512,0.00005615309,0.0000017513141,0.00090396253,0.0000041849194,0.00007907885,0.98939437,0.0003687368,0.009050535],"study_design_scores_gemma":[0.0007988573,0.0006090608,0.0000181464,0.00041783554,0.0000645141,0.000070067974,0.00019719863,0.0016387914,0.0003714561,0.5331229,0.46183613,0.00085506326],"about_ca_topic_score_codex":0.0000012824271,"about_ca_topic_score_gemma":0.000039672657,"teacher_disagreement_score":0.66272664,"about_ca_system_score_codex":0.00003971438,"about_ca_system_score_gemma":0.0000513625,"threshold_uncertainty_score":0.999968},"labels":[],"label_agreement":null},{"id":"W2490336733","doi":"10.1049/iet-com.2016.0372","title":"Dual‐hop signal space cooperative systems using multiple DF relays","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Hop (telecommunications); Dual (grammatical number); Relay; Telecommunications; SIGNAL (programming language); Computer network; Topology (electrical circuits); Electrical engineering; Physics","score_opus":0.09838602357897028,"score_gpt":0.31265409243536135,"score_spread":0.21426806885639108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490336733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003424262,0.0030768854,0.97192097,0.012585662,0.00027565152,0.0006385362,0.000020795229,0.00038216877,0.0076750666],"genre_scores_gemma":[0.9625693,0.0019560219,0.0339821,0.00022157996,0.000059969534,0.00013141947,0.0000097262,0.000020577745,0.0010493158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977264,0.00093307754,0.00043136234,0.00034828208,0.00023338146,0.0003275387],"domain_scores_gemma":[0.99338996,0.001376673,0.0002005357,0.0043530515,0.0005313335,0.00014841503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005988903,0.00021192081,0.00024528548,0.0001370585,0.0011032537,0.00028091818,0.003123208,0.0000869302,0.00004308026],"category_scores_gemma":[0.00021163547,0.00016447343,0.000082248436,0.0007565015,0.00026636382,0.0008131177,0.0021710997,0.00028033456,0.00021158047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000989759,0.00030186857,0.0013766696,0.00000907442,0.00010809745,0.000004264534,0.0028481316,0.001626542,0.060867343,0.89948213,0.0058128084,0.02755316],"study_design_scores_gemma":[0.0011921298,0.000090815054,0.0005643995,0.0003926108,0.000023629465,0.000062204956,0.00033972363,0.81173295,0.001791862,0.0007072061,0.18243718,0.00066530163],"about_ca_topic_score_codex":0.00004598575,"about_ca_topic_score_gemma":0.0001461125,"teacher_disagreement_score":0.959145,"about_ca_system_score_codex":0.00019143513,"about_ca_system_score_gemma":0.00018336592,"threshold_uncertainty_score":0.84854466},"labels":[],"label_agreement":null},{"id":"W2492119979","doi":"10.1109/tvt.2015.2454234","title":"Repeated Game Analysis for Cooperative MAC With Incentive Design for Wireless Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless; Incentive; Computer network; Computer science; Game theory; Wireless network; Telecommunications; Economics; Microeconomics","score_opus":0.04736447180152522,"score_gpt":0.276572141559699,"score_spread":0.22920766975817378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492119979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044121295,0.00018623917,0.99193585,0.0017335714,0.0001307828,0.0011184202,0.000011182274,0.00045321631,0.00001858333],"genre_scores_gemma":[0.92827314,0.00012167608,0.07023964,0.00019995724,0.000012994249,0.0009752905,0.000012153963,0.000019231167,0.00014594705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985585,0.00015980375,0.00026851633,0.00053215976,0.00014204608,0.00033896576],"domain_scores_gemma":[0.9977989,0.00023783089,0.00011820819,0.00086750404,0.00088159635,0.00009594097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038661755,0.00022188501,0.00037097177,0.0005652843,0.00033846404,0.00008328666,0.0007823135,0.00021442934,0.000004015264],"category_scores_gemma":[0.000017176897,0.00019127573,0.00013885587,0.0028204492,0.0001653265,0.00020128676,0.000009115587,0.00029469185,0.0000037239279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023349636,0.00022135765,0.000027804545,0.0000040699733,0.0009507882,0.0000054481166,0.0003752882,0.9427517,0.00055943633,0.009703453,0.00018517191,0.044981997],"study_design_scores_gemma":[0.0013728652,0.00084273,0.00000934114,0.000023853725,0.00020822557,0.00000769045,0.00010440781,0.9686151,0.02676594,0.00031258125,0.0014743601,0.00026286204],"about_ca_topic_score_codex":0.0000038938815,"about_ca_topic_score_gemma":0.0001130469,"teacher_disagreement_score":0.92386097,"about_ca_system_score_codex":0.00014154302,"about_ca_system_score_gemma":0.00012307159,"threshold_uncertainty_score":0.7799998},"labels":[],"label_agreement":null},{"id":"W2493114647","doi":"10.4018/978-1-61520-674-2.ch030","title":"Wireless Collaboration","year":2010,"lang":"en","type":"book-chapter","venue":"Advances in wireless technologies and telecommunication book series","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cooperative diversity; Wireless; Computer network; Wireless network; Antenna diversity; Node (physics); Channel (broadcasting); Telecommunications; Engineering","score_opus":0.012555353564918739,"score_gpt":0.2592341082546014,"score_spread":0.24667875468968267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493114647","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009878664,0.3637852,0.020219311,0.031467043,0.00087277533,0.0021651231,0.000033975917,0.0048501235,0.57561857],"genre_scores_gemma":[0.07256428,0.8848954,0.017940372,0.00020570998,0.000023171506,0.00016772852,0.000052723666,0.000045712284,0.024104936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982742,0.0000577993,0.00060196035,0.0005722214,0.00020995407,0.0002838368],"domain_scores_gemma":[0.9963568,0.00023523351,0.00047820804,0.0026239948,0.0002659329,0.000039854367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026499972,0.00042606247,0.00051826384,0.00038008182,0.00048922887,0.00025798546,0.0026549287,0.0006282315,0.000024212588],"category_scores_gemma":[0.000058122285,0.00043463087,0.000055733875,0.00027459115,0.0007840713,0.002887401,0.0019611462,0.0013481419,0.000013832917],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005035579,0.0000115260555,0.000015928772,0.000019728459,0.00000704589,0.0000017234141,0.00011517414,0.0000024072276,0.00027519825,0.63200337,0.00004770145,0.36749515],"study_design_scores_gemma":[0.0002251093,0.00008535737,0.000026156864,0.00028433424,0.0000070726123,0.00001950102,0.00020385785,0.00068804465,0.0031178594,0.07118538,0.92358893,0.00056839414],"about_ca_topic_score_codex":0.0000021539474,"about_ca_topic_score_gemma":0.0014910625,"teacher_disagreement_score":0.92354125,"about_ca_system_score_codex":0.00010441939,"about_ca_system_score_gemma":0.000105332365,"threshold_uncertainty_score":0.9998106},"labels":[],"label_agreement":null},{"id":"W2493256317","doi":"10.1109/tvt.2015.2453405","title":"Transmit Power Optimization for Amplify-and-Forward Relay Networks With Reduced Overheads","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Relay; Transmitter power output; Channel state information; Computer science; Power control; Node (physics); Power optimization; Transmission (telecommunications); Overhead (engineering); Power (physics); Optimization problem; Channel (broadcasting); Wireless; Computer network; Electronic engineering; Engineering; Telecommunications; Power consumption; Transmitter; Algorithm","score_opus":0.022123567599562743,"score_gpt":0.25279766471395143,"score_spread":0.2306740971143887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493256317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061504976,0.0003648803,0.98783875,0.004354003,0.0002021721,0.00044895275,0.0000026030748,0.00049776403,0.00014036901],"genre_scores_gemma":[0.8853346,0.00032697944,0.1136999,0.00030159534,0.000010902038,0.00019851296,0.0000035411574,0.000021574066,0.00010238086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988839,0.000069023336,0.00022018763,0.000406193,0.00014497634,0.00027572238],"domain_scores_gemma":[0.99880826,0.00007447742,0.000068243724,0.0007142247,0.00022663632,0.0001081428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024660575,0.00018594612,0.00021547657,0.00028631682,0.00028746875,0.00007065864,0.00050953793,0.00026243913,0.000009526387],"category_scores_gemma":[0.000009204958,0.00016469423,0.000054352215,0.00079649827,0.00013150398,0.00024055784,0.000006407992,0.00039515083,0.0000044858266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000674732,0.00011026076,0.000007072388,0.0000040809286,0.000063448744,0.0000032978746,0.00023004896,0.94541025,0.0003171983,0.011606978,0.00017747367,0.04200241],"study_design_scores_gemma":[0.001409007,0.00072685967,0.000008803454,0.00004380443,0.000032304542,0.000064453896,0.00006040848,0.98619074,0.0044930167,0.00026534585,0.0064199846,0.0002853011],"about_ca_topic_score_codex":0.0000017097983,"about_ca_topic_score_gemma":0.00001588057,"teacher_disagreement_score":0.8791841,"about_ca_system_score_codex":0.00007232074,"about_ca_system_score_gemma":0.00007048624,"threshold_uncertainty_score":0.67160356},"labels":[],"label_agreement":null},{"id":"W2493307690","doi":"10.1109/tvt.2015.2457680","title":"Toward a Comprehensive Model for Performance Analysis of Opportunistic Routing in Wireless Mesh Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Network packet; Wireless mesh network; Distributed computing; Routing protocol; Routing (electronic design automation); Reliability (semiconductor); Forwarder; Wireless network; Wireless; Source routing; Dynamic Source Routing; Telecommunications","score_opus":0.09169604456826168,"score_gpt":0.294165015478959,"score_spread":0.20246897091069732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493307690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1028256,0.000040325183,0.8961395,0.00053192495,0.00008114249,0.00021893303,0.0000050785343,0.00013054717,0.00002693835],"genre_scores_gemma":[0.9899845,0.0003039942,0.009453027,0.000107324595,0.0000036143783,0.00010538877,0.0000053636277,0.000008769394,0.00002799576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891835,0.000059352198,0.000354619,0.00029782712,0.00013056747,0.00023929625],"domain_scores_gemma":[0.9987485,0.0000951413,0.000119125034,0.00066660537,0.0003122288,0.000058417078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024596887,0.00013838084,0.00037229803,0.0008527534,0.00010582912,0.000018952775,0.0007216032,0.00016171893,0.0000015894357],"category_scores_gemma":[0.0000082776,0.00014320899,0.00011842625,0.0023614261,0.00010009808,0.00013237866,0.000014501888,0.00029559832,0.0000010943252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021872169,0.00012730139,0.00011107714,0.00000904164,0.00019239647,0.0000028100294,0.0004681309,0.8957054,0.0005645793,0.0332403,0.000011728458,0.06954539],"study_design_scores_gemma":[0.00044603721,0.0001010677,0.00004904108,0.00003258131,0.00008963955,0.00000365927,0.00008240754,0.99748284,0.001399021,0.00015457023,0.000021724378,0.00013742707],"about_ca_topic_score_codex":0.000005453806,"about_ca_topic_score_gemma":0.00007994677,"teacher_disagreement_score":0.88715893,"about_ca_system_score_codex":0.00009127201,"about_ca_system_score_gemma":0.00009384201,"threshold_uncertainty_score":0.5839893},"labels":[],"label_agreement":null},{"id":"W2493572093","doi":"10.4018/978-1-4666-2005-6.ch008","title":"Distributed Coalition Formation and Resource Allocation in Cognitive LTE Femto-cells","year":2012,"lang":"en","type":"book-chapter","venue":"Advances in wireless technologies and telecommunication book series","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Femtocell; Throughput; Computer science; Computer network; Resource allocation; Resource (disambiguation); Game theory; Femto-; Resource management (computing); Distributed computing; Base station; Wireless; Telecommunications; Mathematical economics; Mathematics","score_opus":0.022014600998753436,"score_gpt":0.2613285562082307,"score_spread":0.23931395520947726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493572093","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004902649,0.7337087,0.1401816,0.018733928,0.0002599528,0.004096498,0.0001476781,0.002777814,0.09519117],"genre_scores_gemma":[0.4148259,0.5809061,0.0024575703,0.00008602039,0.000008233255,0.00013458575,0.00024796615,0.000018389932,0.0013152622],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985306,0.000107201726,0.000569934,0.000377544,0.0001501987,0.00026446584],"domain_scores_gemma":[0.9981286,0.0003475601,0.00042792,0.0009301847,0.00013132751,0.000034413344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003777537,0.00031697715,0.00038314876,0.00036470575,0.00027016565,0.00013053256,0.0008385534,0.00033862086,0.0000062820977],"category_scores_gemma":[0.00006150646,0.0003352049,0.000030652664,0.00021214932,0.0004802531,0.0033603169,0.0011661509,0.00065204554,0.0000036896695],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019118725,0.000025826243,0.000072307455,0.000053073072,0.0000073699775,9.741245e-7,0.00039943543,0.000012419159,0.00010075836,0.4632149,0.000040208557,0.5360536],"study_design_scores_gemma":[0.0012732699,0.00024120286,0.0008064948,0.0025920605,0.00003257706,0.0000535474,0.0024521363,0.007219664,0.0062999227,0.049092833,0.9285556,0.0013806808],"about_ca_topic_score_codex":0.000004344339,"about_ca_topic_score_gemma":0.00051402906,"teacher_disagreement_score":0.9285154,"about_ca_system_score_codex":0.00014972371,"about_ca_system_score_gemma":0.00002704287,"threshold_uncertainty_score":0.99991},"labels":[],"label_agreement":null},{"id":"W2493910346","doi":"10.1017/cbo9781139034357.002","title":"Lossless multicast with a single source","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Regina","funders":"","keywords":"Multicast; Computer science; Lossless compression; Linear network coding; Context (archaeology); Computer network; Data compression; Algorithm; History","score_opus":0.0547834368325009,"score_gpt":0.202962005849128,"score_spread":0.1481785690166271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493910346","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002973765,0.00015083514,0.17873931,0.000019051005,0.00006341076,0.00022420485,0.000009866053,0.00023130632,0.82053226],"genre_scores_gemma":[0.008014499,0.00014611147,0.0019622252,0.0001046659,0.00004777808,7.9971403e-7,0.000007032228,0.00003471859,0.9896822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987631,0.00006271307,0.00015323785,0.00054127024,0.00021661451,0.00026310602],"domain_scores_gemma":[0.99789953,0.00006885868,0.00020849588,0.0013695696,0.00027491458,0.0001786156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000082116334,0.00033829498,0.00032481508,0.0001493961,0.00030031375,0.000117700554,0.00181299,0.00018350517,0.000008286235],"category_scores_gemma":[0.000004408927,0.00035005852,0.000110426605,0.000018719824,0.00026622257,0.00018144122,0.0013372996,0.00044383632,0.000038243536],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003068436,0.000021577267,0.0000018978911,0.000016881722,0.00006895273,0.0001084771,0.00024259664,0.00000520451,0.000027340686,0.97336435,0.003036606,0.023075413],"study_design_scores_gemma":[0.00047379258,0.00010015751,0.000007531247,0.00022953025,0.000053746353,0.000031874806,0.000009727112,0.0012943108,0.00031731723,0.000009659281,0.99697155,0.000500809],"about_ca_topic_score_codex":0.000018900684,"about_ca_topic_score_gemma":0.000008639781,"teacher_disagreement_score":0.9939349,"about_ca_system_score_codex":0.0001378778,"about_ca_system_score_gemma":0.00009519745,"threshold_uncertainty_score":0.99989516},"labels":[],"label_agreement":null},{"id":"W2495234003","doi":"10.1017/cbo9780511667008.013","title":"Network coding in relay-based networks","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Computer network; Relay; Wireless network; Network packet; Multiple description coding; Multiplexing; Coding (social sciences); Wireless; Telecommunications; Mathematics","score_opus":0.050901960916127476,"score_gpt":0.21226930873317695,"score_spread":0.16136734781704948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495234003","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000331142,0.0006053562,0.25856763,0.000032491844,0.00026039814,0.00027463405,0.0000045060424,0.00019235456,0.7400593],"genre_scores_gemma":[0.008983285,0.0009865777,0.0024997091,0.0004715516,0.00016319052,0.0000021555056,0.000025632286,0.000045488847,0.9868224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821466,0.00016087078,0.00030614212,0.00065551035,0.0002042247,0.00045856409],"domain_scores_gemma":[0.99775344,0.000181136,0.00028370135,0.0014489666,0.00016284958,0.00016987647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032938647,0.00040568624,0.00045362345,0.00023717967,0.00031260494,0.000099436176,0.0022095786,0.00039055553,0.000009848553],"category_scores_gemma":[0.000008378014,0.00050463615,0.00017495472,0.000051605683,0.00015847338,0.00018058953,0.001317266,0.0009802714,0.00001888021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027887763,0.000009037708,0.000009022589,0.000012002788,0.000026607382,0.00014959663,0.000043054955,0.0019593136,0.0000014026648,0.9753179,0.016197873,0.0062463316],"study_design_scores_gemma":[0.00069070864,0.00004910537,0.000054344484,0.0005809644,0.000036582845,0.000006016073,0.0000022220306,0.07418024,0.00001291967,0.00008351313,0.9236043,0.00069905753],"about_ca_topic_score_codex":0.000022175198,"about_ca_topic_score_gemma":0.0000148184445,"teacher_disagreement_score":0.9752343,"about_ca_system_score_codex":0.000266612,"about_ca_system_score_gemma":0.00015938973,"threshold_uncertainty_score":0.99974054},"labels":[],"label_agreement":null},{"id":"W2498021588","doi":"10.4018/978-1-60566-665-5.ch008","title":"Distributed Space-Time Block Coding for Amplify-and-Forward Cooperative Networks","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Monomial; Block code; Computer science; Upper and lower bounds; Linear network coding; Block (permutation group theory); Coding (social sciences); Theoretical computer science; Uncorrelated; Algorithm; Mathematics; Computer network; Discrete mathematics; Decoding methods; Combinatorics","score_opus":0.02349870737703217,"score_gpt":0.2607593069865633,"score_spread":0.23726059960953114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498021588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019089997,0.0008490345,0.52791053,0.0006275662,0.0005148133,0.0010551814,0.00027510434,0.00036907138,0.4683796],"genre_scores_gemma":[0.57793826,0.0015117478,0.06834369,0.006565425,0.0033575518,0.0006660984,0.0005992341,0.00042597254,0.34059203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997848,0.000060058133,0.0004971693,0.0008073204,0.00026517044,0.000522305],"domain_scores_gemma":[0.99741393,0.0003147248,0.0003189069,0.0011787256,0.00047403417,0.00029966506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032665726,0.0006031977,0.0007047886,0.00006794006,0.0006742047,0.00054592034,0.0013235199,0.0006232788,0.000033244727],"category_scores_gemma":[0.00006921775,0.0005887731,0.00020889525,0.000059468886,0.00022737707,0.00013190869,0.0011149915,0.00082729757,0.00007155909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019696421,0.000007734251,0.0000018739452,0.000009930369,0.00009783412,0.0000057503325,0.000055349723,0.0001484389,0.00009587973,0.98793596,0.003661233,0.007960296],"study_design_scores_gemma":[0.0017878476,0.00037123068,0.000022663133,0.0005675581,0.00017380212,0.00012504113,0.000007998293,0.15949063,0.0002371741,0.13909304,0.69602126,0.0021017827],"about_ca_topic_score_codex":0.0000036078955,"about_ca_topic_score_gemma":0.000060782593,"teacher_disagreement_score":0.8488429,"about_ca_system_score_codex":0.00018153709,"about_ca_system_score_gemma":0.00019718645,"threshold_uncertainty_score":0.9996564},"labels":[],"label_agreement":null},{"id":"W2498582208","doi":"10.1016/b978-0-12-380918-6.00003-2","title":"Network Coding for Content Distribution and Multimedia Streaming in Peer-to-Peer Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Peer-to-peer; Content distribution; Computer network; Coding (social sciences); Multimedia; Linear network coding; Video streaming; Sociology","score_opus":0.06548140712503633,"score_gpt":0.26901079864460087,"score_spread":0.20352939151956453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498582208","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003911989,0.0040570353,0.41375473,0.0012164288,0.0012022034,0.0026334797,0.000053940214,0.00021176231,0.5768313],"genre_scores_gemma":[0.030263951,0.00087617245,0.016175428,0.0010753962,0.00071490975,0.00029180784,0.0002559528,0.000084300955,0.95026207],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978927,0.000071821974,0.0005787737,0.0006479829,0.00030783308,0.00050092523],"domain_scores_gemma":[0.99786514,0.00034379232,0.00024676573,0.00079536904,0.00053954293,0.00020941284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010862682,0.00041684203,0.00054360053,0.00011191121,0.00028277547,0.00019022987,0.000819247,0.00027599884,0.000018714707],"category_scores_gemma":[0.00011718957,0.00041946128,0.0001196731,0.00005385751,0.0000851005,0.00012148084,0.00079452817,0.0005417151,0.000014684855],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014986464,0.000006596972,0.00003387287,0.0000132176765,0.000025671514,0.000004189282,0.00049446075,0.000076240816,0.0000036994657,0.07674964,0.0008179457,0.9217595],"study_design_scores_gemma":[0.0006316083,0.00010447504,0.0003660109,0.0009754779,0.00003316938,0.000007155394,0.000008215826,0.04069686,0.000008174045,0.0067643225,0.9497522,0.0006523056],"about_ca_topic_score_codex":0.0000010138797,"about_ca_topic_score_gemma":0.00013359018,"teacher_disagreement_score":0.94893426,"about_ca_system_score_codex":0.00016165445,"about_ca_system_score_gemma":0.00006283002,"threshold_uncertainty_score":0.9998257},"labels":[],"label_agreement":null},{"id":"W2498685566","doi":"10.4018/978-1-61520-680-3.ch007","title":"Resource Allocation and QoS Provisioning for Wireless Relay Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Advances in wireless technologies and telecommunication book series","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Computer network; Computer science; Wireless network; Quality of service; Relay; Resource allocation; Provisioning; Wireless; Power control; Throughput; Cooperative diversity; Distributed computing; Resource management (computing); Power (physics); Telecommunications","score_opus":0.012856957643314005,"score_gpt":0.2521648528585069,"score_spread":0.2393078952151929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498685566","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012648804,0.5123604,0.35503158,0.041878752,0.0007394824,0.00554327,0.000025701307,0.004330316,0.07882562],"genre_scores_gemma":[0.07784169,0.8493475,0.058067422,0.00033720615,0.000060793216,0.0005634477,0.00010320865,0.00008136746,0.013597372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982011,0.000053327738,0.00061086484,0.00066289416,0.00015066315,0.00032120655],"domain_scores_gemma":[0.9966476,0.00060397474,0.000518977,0.0019892938,0.00019460595,0.000045579825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044638585,0.0004206663,0.0005149139,0.00029426292,0.00073697197,0.00024227139,0.0018470476,0.0006380625,0.0000036460215],"category_scores_gemma":[0.000098408345,0.0004184444,0.00005816546,0.00015562991,0.0007810727,0.0016707062,0.0019000961,0.0012049654,0.0000010451284],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013203429,0.0000092259415,0.000016968253,0.000035989695,0.000008991261,5.010326e-7,0.0001445673,0.000041905685,0.00008744813,0.53031737,0.00004033293,0.4692835],"study_design_scores_gemma":[0.00036247796,0.00015683734,0.000032179945,0.00060532556,0.000013453985,0.000023129864,0.00019991389,0.017249504,0.00077547005,0.015591108,0.9643904,0.0006002113],"about_ca_topic_score_codex":0.0000019555414,"about_ca_topic_score_gemma":0.0003095724,"teacher_disagreement_score":0.96435004,"about_ca_system_score_codex":0.000070672366,"about_ca_system_score_gemma":0.000052130035,"threshold_uncertainty_score":0.9998267},"labels":[],"label_agreement":null},{"id":"W2499497335","doi":"10.1109/icassp.2003.1202648","title":"An optimal receiver for transmission diversity over uncertain channels","year":2004,"lang":"en","type":"article","venue":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Detector; Upper and lower bounds; Probability density function; Channel (broadcasting); Algorithm; Transmission (telecommunications); Computer science; Maximum a posteriori estimation; Quadratic equation; Diversity scheme; Mathematics; Statistics; Telecommunications; Maximum likelihood; Orthogonal frequency-division multiplexing","score_opus":0.07371560672537493,"score_gpt":0.3208076119893289,"score_spread":0.24709200526395397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499497335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025280997,0.00019645038,0.96438724,0.00086783164,0.0007713501,0.00069514714,0.000036098194,0.00026327808,0.0075016017],"genre_scores_gemma":[0.874331,0.00086774904,0.1222997,0.0011085152,0.00037115437,0.000041177726,0.000031697247,0.000028489912,0.0009205387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739254,0.000032255743,0.00046132097,0.0008860712,0.00072371477,0.0005040739],"domain_scores_gemma":[0.99497545,0.000018077695,0.000309067,0.0002172562,0.0041433806,0.0003367942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005301834,0.00042350846,0.00034871887,0.0002573098,0.0009830722,0.00096126914,0.0015415984,0.00022322305,0.00021460577],"category_scores_gemma":[0.000137194,0.00040071175,0.00006183494,0.0005938203,0.00020862995,0.0014497617,0.00022848931,0.00047389942,0.000022504835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012820075,0.002175668,0.000692294,0.00036192735,0.00025627768,0.00007266508,0.011909414,0.008862934,0.05186339,0.62201595,0.016983788,0.2835237],"study_design_scores_gemma":[0.001892599,0.00067955535,0.00034111907,0.0003934729,0.000034519602,0.00003671303,0.00033711805,0.9805678,0.0063135354,0.00267312,0.0060161366,0.0007142721],"about_ca_topic_score_codex":0.00001690034,"about_ca_topic_score_gemma":0.0000043671726,"teacher_disagreement_score":0.9717049,"about_ca_system_score_codex":0.0002444726,"about_ca_system_score_gemma":0.0004701679,"threshold_uncertainty_score":0.9998445},"labels":[],"label_agreement":null},{"id":"W2499847568","doi":"10.4018/978-1-61350-101-6.ch405","title":"Data Gathering in Correlated Wireless Sensor Networks with Cooperative Transmission Data Gathering in Correlated Wireless Sensor Networks with Cooperative Transmission","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MIMO; Wireless sensor network; Transmission (telecommunications); Computer science; Node (physics); Wireless; Data transmission; Constellation; Topology (electrical circuits); Computer network; Algorithm; Channel (broadcasting); Mathematics; Engineering; Telecommunications","score_opus":0.050792941137458636,"score_gpt":0.2620118394389609,"score_spread":0.21121889830150226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499847568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002393654,0.0031202922,0.9048389,0.00017869566,0.00046073136,0.0028737092,0.00022699511,0.00060269685,0.08530432],"genre_scores_gemma":[0.9708637,0.004079187,0.013853,0.0005852477,0.00022707086,0.000101541365,0.0010298605,0.00042464116,0.008835739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926239,0.0007128623,0.001587131,0.0029755654,0.000798139,0.0013023523],"domain_scores_gemma":[0.9928063,0.00036950348,0.00071521563,0.0050036,0.00054571044,0.0005596794],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0010054198,0.0016930586,0.0018263373,0.00029356737,0.0006055098,0.0005351946,0.005753691,0.0011561309,0.00009384126],"category_scores_gemma":[0.000018287172,0.0013863317,0.000113974456,0.0007182694,0.0004986635,0.0010205725,0.0020455115,0.0032103325,0.000025698999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005302406,0.00072784914,0.00087649334,0.00020393239,0.0014537245,0.0036900835,0.010944618,0.44839174,0.0004249383,0.12943687,0.00081882044,0.39772853],"study_design_scores_gemma":[0.0037507743,0.0005062846,0.00012614841,0.0077834395,0.00013548766,0.00026426147,0.0001411198,0.9794737,0.000048284823,0.00018931503,0.0055448227,0.0020363543],"about_ca_topic_score_codex":0.0003760295,"about_ca_topic_score_gemma":0.0036552318,"teacher_disagreement_score":0.96847004,"about_ca_system_score_codex":0.0005356382,"about_ca_system_score_gemma":0.00079295906,"threshold_uncertainty_score":0.9996257},"labels":[],"label_agreement":null},{"id":"W2501620221","doi":"10.1109/icc.2016.7510859","title":"Energy efficient design for non-orthogonal AF relaying in underlay spectrum sharing networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Underlay; Relay; Computer science; Mathematical optimization; Context (archaeology); Signal-to-noise ratio (imaging); Interference (communication); Optimization problem; Power (physics); Convex optimization; Transmission (telecommunications); Computer network; Mathematics; Telecommunications; Regular polygon","score_opus":0.050052203283323694,"score_gpt":0.2696919522704905,"score_spread":0.2196397489871668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501620221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019993363,0.00014324093,0.9926998,0.0023507397,0.00020352793,0.00016758611,1.812205e-7,0.00010054752,0.0023350294],"genre_scores_gemma":[0.9638504,0.00020796203,0.034493055,0.0004197158,0.000073344316,0.00005914533,7.5214797e-7,0.000011171291,0.0008844646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987515,0.00007834045,0.00026974987,0.00040167395,0.00011963938,0.00037904698],"domain_scores_gemma":[0.99865586,0.000558913,0.00006265544,0.000599572,0.00004725513,0.00007574938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068117876,0.00013332898,0.00014617406,0.00012632644,0.00018571301,0.000111076464,0.00095129194,0.000053846852,0.000034011264],"category_scores_gemma":[0.000028430002,0.00009542198,0.00005966219,0.00040715802,0.000027388396,0.00018535006,0.00050383393,0.000082310995,0.000007842099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021344335,0.00006716836,0.0009678202,0.0000023897658,0.000012727369,0.0000035342784,0.00018272514,0.06706072,0.0009860762,0.8070489,0.00071649865,0.12293011],"study_design_scores_gemma":[0.0005422455,0.000045024033,0.00092564954,0.00007456653,0.0000013199983,0.0000031521715,0.0000060207562,0.99397695,0.00083140266,0.0025027571,0.00091388955,0.00017701587],"about_ca_topic_score_codex":0.0000047649996,"about_ca_topic_score_gemma":0.0001162536,"teacher_disagreement_score":0.96185106,"about_ca_system_score_codex":0.00011435617,"about_ca_system_score_gemma":0.00005083479,"threshold_uncertainty_score":0.38911954},"labels":[],"label_agreement":null},{"id":"W2501912280","doi":"10.1109/icc.2016.7511080","title":"Performance analysis of power allocation and relay assignment in OFDM systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Subcarrier; Orthogonal frequency-division multiplexing; Computer science; Signal-to-noise ratio (imaging); Node (physics); Mathematical optimization; Assignment problem; Optimization problem; Transmitter power output; Computational complexity theory; Power (physics); Computer network; Algorithm; Mathematics; Telecommunications; Transmitter; Engineering","score_opus":0.023177356708681904,"score_gpt":0.25138673099328657,"score_spread":0.22820937428460467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501912280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51325214,0.00032533627,0.48025647,0.0009595787,0.0000499544,0.0000882448,2.7010645e-7,0.00002308417,0.00504493],"genre_scores_gemma":[0.99781746,0.0007093924,0.00088226236,0.00003369474,0.0000017422389,0.0000070309165,3.1302622e-7,0.0000011196126,0.0005470026],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994944,0.00006757726,0.00016722844,0.000116160256,0.00009054464,0.000064099055],"domain_scores_gemma":[0.99945676,0.00007988384,0.000051159106,0.0003382302,0.000052967847,0.000020978428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003309023,0.00003997416,0.000101649865,0.00016226247,0.000024914296,0.000018726001,0.00022280826,0.000016393138,0.000019433797],"category_scores_gemma":[0.000011960372,0.00002513924,0.000014848547,0.00056760956,0.000018578632,0.00020819722,0.00011797462,0.000021086164,0.0000032023188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012921975,0.00016710589,0.38062665,0.000020350431,0.0003135882,8.688632e-7,0.0027795422,0.008549225,0.029028995,0.3260279,0.00045263275,0.25202018],"study_design_scores_gemma":[0.00022732459,0.00004562415,0.29193962,0.000060131133,0.000014271715,5.342639e-7,0.000030790954,0.7056061,0.00095890986,0.000007623673,0.0010209553,0.00008813368],"about_ca_topic_score_codex":0.0000060759335,"about_ca_topic_score_gemma":0.000027302845,"teacher_disagreement_score":0.6970569,"about_ca_system_score_codex":0.00003211088,"about_ca_system_score_gemma":0.000011878747,"threshold_uncertainty_score":0.10251484},"labels":[],"label_agreement":null},{"id":"W2503144029","doi":"10.1109/icc.2016.7510862","title":"AF relaying in underlay spectrum-sharing systems with outdated CSI","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Underlay; Rayleigh fading; Channel state information; Relay; Computer science; Probability density function; Monte Carlo method; Channel (broadcasting); Cognitive radio; Cumulative distribution function; Topology (electrical circuits); Fading; Outage probability; Upper and lower bounds; Telecommunications; Signal-to-noise ratio (imaging); Computer network; Wireless; Mathematics; Engineering; Physics; Statistics; Power (physics); Electrical engineering","score_opus":0.04455591179366724,"score_gpt":0.259769625184152,"score_spread":0.21521371339048473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503144029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037194334,0.000303914,0.92014474,0.004432769,0.00018384015,0.00020099661,2.3286192e-7,0.0003267399,0.037212424],"genre_scores_gemma":[0.99418586,0.00014496026,0.0027623323,0.00013243133,0.000023565417,0.000013042897,3.7537347e-7,0.000007166251,0.0027302478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991011,0.00007534884,0.00019171498,0.00028354328,0.00012870117,0.00021958325],"domain_scores_gemma":[0.99901134,0.00011371605,0.000051384282,0.00072917785,0.000042510215,0.00005185686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032177765,0.00009694538,0.000120340155,0.00011011329,0.000098046556,0.00016455573,0.00084050774,0.000029070796,0.000033384717],"category_scores_gemma":[0.000019272216,0.000056548637,0.000015138551,0.0004784304,0.000023961578,0.0004717819,0.0003630202,0.000094809846,0.00007286304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012048559,0.0000535846,0.03749124,0.000009551574,0.000024075776,0.000023932223,0.000822092,0.0006700947,0.0027214992,0.93388754,0.0005202327,0.023764078],"study_design_scores_gemma":[0.006044396,0.00044053394,0.055500533,0.0028224143,0.000012195208,0.00016857545,0.0005743196,0.89435506,0.0059219142,0.004237706,0.02790647,0.002015892],"about_ca_topic_score_codex":0.000030919648,"about_ca_topic_score_gemma":0.00030849082,"teacher_disagreement_score":0.95699155,"about_ca_system_score_codex":0.0001032979,"about_ca_system_score_gemma":0.000032947206,"threshold_uncertainty_score":0.23059864},"labels":[],"label_agreement":null},{"id":"W2504065224","doi":"10.1109/icc.2016.7510994","title":"Fast authentication in 5G HetNet through SDN enabled weighted secure-context-information transfer","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computer network; Heterogeneous network; Handover; Authentication (law); Provisioning; Latency (audio); Wireless network; Distributed computing; Wireless; Computer security","score_opus":0.02066055322075604,"score_gpt":0.24701664703368714,"score_spread":0.2263560938129311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504065224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0186364,0.000098356766,0.9550359,0.007944504,0.00014043447,0.00027425622,0.0000016442493,0.00018309505,0.017685363],"genre_scores_gemma":[0.9937076,0.00037690677,0.0039493493,0.0010441063,0.000019475368,0.000037999773,0.000008037601,0.000004492293,0.00085200666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894017,0.00013107216,0.00035488608,0.0001847767,0.00016913666,0.00021994855],"domain_scores_gemma":[0.99909794,0.00010490317,0.000039422346,0.0005811837,0.00012970099,0.000046868678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002695201,0.00012075025,0.0001271558,0.00010703702,0.00010536765,0.00012577575,0.0006767437,0.00005851371,0.00029164393],"category_scores_gemma":[0.000023045312,0.00008133211,0.0000401504,0.0004720294,0.000034130542,0.0025352766,0.00008442263,0.00008793853,0.00030570882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009976577,0.000047373396,0.00021211345,0.0000048810766,0.000008385085,4.1604912e-7,0.0068323337,0.0000065822746,0.0027962662,0.6720049,0.0013115633,0.31676525],"study_design_scores_gemma":[0.008850269,0.00029040262,0.026145348,0.0005077222,0.000019628711,0.000023153274,0.0008012292,0.4004392,0.06403127,0.027492514,0.469758,0.0016412452],"about_ca_topic_score_codex":0.000022491646,"about_ca_topic_score_gemma":0.00023944033,"teacher_disagreement_score":0.97507125,"about_ca_system_score_codex":0.00007986736,"about_ca_system_score_gemma":0.000047844238,"threshold_uncertainty_score":0.39293703},"labels":[],"label_agreement":null},{"id":"W2504591244","doi":"10.1109/icc.2016.7511007","title":"An asymptotically capacity-achieving scheme for the Gaussian multiple-access relay channel","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Decoding methods; Computer science; Decodes; User equipment; Telecommunications link; Upper and lower bounds; Computer network; Transmission (telecommunications); Base station; Channel (broadcasting); Topology (electrical circuits); Mathematics; Algorithm; Telecommunications; Power (physics)","score_opus":0.08568209216851011,"score_gpt":0.31902549391101803,"score_spread":0.23334340174250792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504591244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049880506,0.00008104754,0.9723731,0.02031869,0.000205326,0.0003023995,0.0000015589364,0.0002007383,0.0015290556],"genre_scores_gemma":[0.94528425,0.00016205439,0.05251235,0.0013660964,0.000108269254,0.00008235687,7.949969e-7,0.0000107708065,0.00047305613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989336,0.00012573252,0.00020263201,0.0003127113,0.00014020604,0.000285126],"domain_scores_gemma":[0.9975232,0.0009774456,0.000060898114,0.0011715258,0.00015471854,0.00011223285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006056063,0.00012657476,0.00011489652,0.000045160737,0.0005654007,0.00035369553,0.0024274555,0.000045814566,0.00004329716],"category_scores_gemma":[0.00025476993,0.00006341257,0.00006149919,0.00023228042,0.00008666182,0.0009476786,0.0004785346,0.00010331977,0.00002292424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021431752,0.00013983373,0.0027370267,0.000009843993,0.000049000857,7.8319067e-7,0.0009242106,0.00015246644,0.026150605,0.73998755,0.0018063291,0.22802089],"study_design_scores_gemma":[0.0010199572,0.00016023402,0.017463746,0.0000963662,0.00000713822,0.000007973262,0.000037869522,0.94414085,0.0044521214,0.0012038427,0.03098029,0.00042958691],"about_ca_topic_score_codex":0.000005734617,"about_ca_topic_score_gemma":0.00012590879,"teacher_disagreement_score":0.9439884,"about_ca_system_score_codex":0.00003310787,"about_ca_system_score_gemma":0.000037146598,"threshold_uncertainty_score":0.45108566},"labels":[],"label_agreement":null},{"id":"W2506403468","doi":"10.1002/wcm.2711","title":"Cooperative amplify‐and‐forward partial relay selection with outdated channel information in spectrum‐sharing systems","year":2016,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Rayleigh fading; Channel state information; Relay; Channel (broadcasting); Transmitter power output; Cognitive radio; Interference (communication); Transmitter; Spectral efficiency; Telecommunications; Relay channel; Bit error rate; Signal-to-noise ratio (imaging); Fading; Computer network; Power (physics); Wireless; Physics","score_opus":0.022391307070743268,"score_gpt":0.2600556241697342,"score_spread":0.23766431709899094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506403468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33578268,0.0010516662,0.6606621,0.0012012412,0.00008673891,0.0006466768,0.000003686318,0.00022529424,0.00033993233],"genre_scores_gemma":[0.9942998,0.0028583582,0.0025645,0.00007282124,0.000025471852,0.00012217298,0.000014821667,0.000009991876,0.00003200933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863046,0.0002506779,0.0004414031,0.00028264834,0.00012744525,0.00026735818],"domain_scores_gemma":[0.99829537,0.00029803452,0.0002042047,0.0009374399,0.00017603152,0.000088902256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005865302,0.00017844458,0.0002364408,0.00020099315,0.00066298776,0.00036906908,0.0008199989,0.00007130179,0.0000018750482],"category_scores_gemma":[0.00002480188,0.00013355711,0.000016975773,0.0005733778,0.00013716768,0.001071312,0.0011602123,0.00026515158,0.000006863123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006734204,0.00029018562,0.020204019,0.000094257106,0.00013516637,0.0000026153573,0.021156974,0.029817445,0.0023436774,0.36563882,0.000114573835,0.56013495],"study_design_scores_gemma":[0.00081797614,0.00013468142,0.0020426481,0.00039564187,0.0000056559884,0.000033366323,0.00035782557,0.9907648,0.00016508452,0.000037968923,0.004991524,0.00025285248],"about_ca_topic_score_codex":0.0000807543,"about_ca_topic_score_gemma":0.00015251143,"teacher_disagreement_score":0.96094733,"about_ca_system_score_codex":0.00009729855,"about_ca_system_score_gemma":0.00005439973,"threshold_uncertainty_score":0.5446301},"labels":[],"label_agreement":null},{"id":"W2507470562","doi":"","title":"A quest for high-performance peer-to-peer live multimedia streaming","year":2008,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Multimedia; Laptop; Live streaming; Pace; Peer-to-peer; Phone; Bandwidth (computing); Digital content; Coding (social sciences); Mobile device; Android (operating system); Computer network; Video streaming; World Wide Web; Operating system","score_opus":0.03565965022054031,"score_gpt":0.336517466924577,"score_spread":0.3008578167040367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507470562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79503477,0.0035425448,0.1405667,0.014324888,0.007273187,0.0043768333,0.000038069917,0.001501057,0.033341955],"genre_scores_gemma":[0.6698034,0.0016012641,0.10768511,0.00046365606,0.00044169778,0.0004326135,0.0008261506,0.00006914058,0.21867701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828655,0.00006235663,0.00027552116,0.0005228094,0.00049306644,0.0003597239],"domain_scores_gemma":[0.997329,0.00025112514,0.00018846632,0.0009174839,0.0011688643,0.00014507247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030545663,0.0003091085,0.00032562416,0.00019126735,0.00041491442,0.0001558528,0.0013377278,0.00017601698,0.00003874572],"category_scores_gemma":[0.0003165101,0.00031591597,0.00007428388,0.000395345,0.000021272012,0.00024015014,0.0001677225,0.00034202207,0.00022566806],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014178127,0.00025145404,0.00018032154,0.00024093289,0.00014778414,0.000014194876,0.1896164,0.0007940707,0.0031320513,0.008623505,0.11419179,0.6826657],"study_design_scores_gemma":[0.0031754642,0.0012178781,0.029852295,0.002277089,0.00011413572,0.00002865203,0.005797719,0.3883285,0.037306964,0.00017350464,0.52775073,0.003977087],"about_ca_topic_score_codex":0.00006556928,"about_ca_topic_score_gemma":0.0005132751,"teacher_disagreement_score":0.67868865,"about_ca_system_score_codex":0.00011537171,"about_ca_system_score_gemma":0.00020903186,"threshold_uncertainty_score":0.9999293},"labels":[],"label_agreement":null},{"id":"W2507577160","doi":"10.1109/lcomm.2016.2606503","title":"Context-Aware Relay Selection in Buffer-Aided Wireless Relay Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of Tabriz; Iran's National Elites Foundation","keywords":"Relay; Computer science; Computer network; Relay channel; Network packet; Scheduling (production processes); Queue; Wireless network; Link Access Procedure for Frame Relay; Wireless; Telecommunications; Mathematical optimization","score_opus":0.03764916306932005,"score_gpt":0.2745392827465888,"score_spread":0.23689011967726875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507577160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081868924,0.00080358726,0.8442352,0.0714037,0.00042196325,0.00039873776,0.000001667016,0.00039359732,0.000472643],"genre_scores_gemma":[0.9863831,0.0031186254,0.006106637,0.0038882997,0.00006907318,0.00016300475,0.0000063793077,0.00002393469,0.00024093594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974435,0.0010097112,0.00053585245,0.00041284558,0.00019591695,0.00040215603],"domain_scores_gemma":[0.99571025,0.00097738,0.00019933659,0.0028412424,0.00016755998,0.00010425487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072660693,0.0002270419,0.00025724733,0.0002644142,0.00052399916,0.00014361566,0.0037751803,0.000117297044,0.000018798166],"category_scores_gemma":[0.00006785192,0.00019307046,0.00009340228,0.0011443923,0.00024487328,0.00077940477,0.00073585374,0.00052865746,0.00009218399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005558383,0.0006429104,0.022284413,0.00001660654,0.00015562653,0.0000160893,0.0035658767,0.008616525,0.11903736,0.085891046,0.06068516,0.6990328],"study_design_scores_gemma":[0.0036756266,0.0001352196,0.02796595,0.0009925121,0.000029058758,0.00008676646,0.000108897904,0.8646626,0.0042872294,0.00029084293,0.09616372,0.001601607],"about_ca_topic_score_codex":0.00004301275,"about_ca_topic_score_gemma":0.00084741256,"teacher_disagreement_score":0.9045142,"about_ca_system_score_codex":0.00033023383,"about_ca_system_score_gemma":0.0000657161,"threshold_uncertainty_score":0.7873185},"labels":[],"label_agreement":null},{"id":"W2507895428","doi":"10.1049/iet-com.2016.0048","title":"Area spectral efficiency of infrastructure relay enhanced cellular systems","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia","funders":"","keywords":"Spectral efficiency; Relay; Computer science; Telecommunications link; Rayleigh fading; Transmission (telecommunications); Transmitter power output; Electronic engineering; Bandwidth (computing); Relay channel; Computer network; Single antenna interference cancellation; Fading; Channel (broadcasting); Telecommunications; Transmitter; Power (physics); Engineering; Physics","score_opus":0.028080568633731144,"score_gpt":0.26212991362439597,"score_spread":0.23404934499066482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507895428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032107614,0.0030550505,0.9453643,0.0032619834,0.00025101463,0.00027976997,0.000008793139,0.00018721074,0.015484256],"genre_scores_gemma":[0.9805911,0.0024305284,0.016492398,0.00005375894,0.000019624831,0.000035193476,0.0000053162707,0.0000086528335,0.00036343047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986708,0.0003173953,0.0004015049,0.00021476128,0.00018886228,0.00020664341],"domain_scores_gemma":[0.99464184,0.00043559208,0.00021346514,0.004367156,0.00026687825,0.000075046235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032409423,0.0001310995,0.00019604158,0.00011000783,0.00029576904,0.00006247218,0.0041442257,0.00006372822,0.000037622714],"category_scores_gemma":[0.000111424335,0.00009582642,0.00007506398,0.0006071853,0.00022006263,0.00029975313,0.0010893451,0.00017859935,0.00003832683],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041388566,0.00017620022,0.0004746607,0.000012728626,0.000040968793,6.074645e-7,0.002176133,0.0005108489,0.37948552,0.5848941,0.0021630814,0.030060982],"study_design_scores_gemma":[0.0046852357,0.00072931923,0.019324725,0.0021034607,0.00010042411,0.00006276168,0.00082466286,0.35526833,0.36981943,0.013969844,0.2304201,0.0026916876],"about_ca_topic_score_codex":0.0000061332976,"about_ca_topic_score_gemma":0.000016503996,"teacher_disagreement_score":0.94848347,"about_ca_system_score_codex":0.00007119486,"about_ca_system_score_gemma":0.00009648006,"threshold_uncertainty_score":0.7701072},"labels":[],"label_agreement":null},{"id":"W2511550785","doi":"10.1109/isit.2016.7541829","title":"Low delay network streaming under burst losses","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Erasure; Computer science; Network packet; Binary erasure channel; Computer network; Erasure code; Construct (python library); Rank (graph theory); Channel (broadcasting); Channel capacity; Algorithm; Decoding methods; Mathematics; Combinatorics","score_opus":0.0343541122192256,"score_gpt":0.27131010107975007,"score_spread":0.23695598886052446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511550785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045110066,0.00033679066,0.9759698,0.004667006,0.00020385408,0.000059344064,2.469015e-7,0.00021536375,0.014036583],"genre_scores_gemma":[0.977639,0.00057119364,0.0169376,0.0011418969,0.00012692937,0.000006489314,5.274678e-7,0.00000623025,0.0035701038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999197,0.00007872062,0.00014463719,0.00021884845,0.00011550457,0.00024530216],"domain_scores_gemma":[0.998834,0.0002719837,0.00004006301,0.00069709646,0.0000836109,0.000073209056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018525364,0.00009537033,0.00009043391,0.000030626474,0.000204237,0.00011492193,0.0008192119,0.000030565163,0.0002041411],"category_scores_gemma":[0.000021985976,0.00005888359,0.00003611943,0.00029890845,0.000042966516,0.00038336834,0.0004347685,0.000055162036,0.00018915847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017706715,0.000033860022,0.00093558413,0.0000014862998,0.000016143922,0.0000030347921,0.0000712421,0.00042695308,0.0007782103,0.58921707,0.008990074,0.39952454],"study_design_scores_gemma":[0.005061536,0.00060800865,0.059110604,0.0016896867,0.000039246563,0.00015348842,0.00021858574,0.26699463,0.022579951,0.082125485,0.5575068,0.0039120084],"about_ca_topic_score_codex":0.0000024106168,"about_ca_topic_score_gemma":0.00007698411,"teacher_disagreement_score":0.973128,"about_ca_system_score_codex":0.000038061116,"about_ca_system_score_gemma":0.000038794304,"threshold_uncertainty_score":0.24313125},"labels":[],"label_agreement":null},{"id":"W2511737534","doi":"10.1109/access.2016.2601031","title":"Fountain Coded Cooperative Communications for LTE-A Connected Heterogeneous M2M Network","year":2016,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Relay; Rayleigh fading; Transmission (telecommunications); EnodeB; Base station; Distributed computing; Channel (broadcasting); User equipment; Fading; Telecommunications","score_opus":0.10152619969527804,"score_gpt":0.3583807665402834,"score_spread":0.25685456684500535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511737534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054365755,0.000775159,0.98438215,0.006683843,0.000528874,0.00073327747,0.00001920603,0.0003112335,0.0011296603],"genre_scores_gemma":[0.98004866,0.0011294872,0.015814362,0.0019863558,0.00017299474,0.00038937567,0.0000153017,0.000022387601,0.0004210529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829614,0.0003820303,0.0003692392,0.0003985381,0.00014683233,0.00040721428],"domain_scores_gemma":[0.99540895,0.0014349408,0.0001659393,0.0022818462,0.00058813195,0.00012020521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042743993,0.00020257666,0.00025678886,0.000071389084,0.00076878874,0.000419394,0.0047250553,0.000075691896,0.000043387583],"category_scores_gemma":[0.00015507267,0.0001513993,0.000089794405,0.0006033789,0.00015989339,0.0008602899,0.0010216935,0.000120569544,0.00004856242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013823793,0.0004359562,0.0019054115,0.000026578922,0.00035111027,0.000008476516,0.0014348015,0.0045051496,0.016226128,0.5166228,0.06589849,0.3924469],"study_design_scores_gemma":[0.0067442087,0.00061987207,0.0019450661,0.000552314,0.00007039954,0.000056291366,0.000036998008,0.52307713,0.04887813,0.023503102,0.39235738,0.0021591024],"about_ca_topic_score_codex":0.000008372706,"about_ca_topic_score_gemma":0.000488054,"teacher_disagreement_score":0.9746121,"about_ca_system_score_codex":0.000093741364,"about_ca_system_score_gemma":0.000110997935,"threshold_uncertainty_score":0.8780407},"labels":[],"label_agreement":null},{"id":"W2512019831","doi":"10.1109/spawc.2016.7536803","title":"Performance analysis of MRC/MRT relaying in massive MIMO systems via interference modelling","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Interference (communication); MIMO; Maximal-ratio combining; Signal-to-noise ratio (imaging); Computer science; Probability density function; Topology (electrical circuits); Transmission (telecommunications); Power (physics); Signal-to-interference-plus-noise ratio; Signal-to-interference ratio; Outage probability; Electronic engineering; Telecommunications; Mathematics; Decoding methods; Statistics; Fading; Electrical engineering; Beamforming; Physics; Engineering","score_opus":0.053428945528990086,"score_gpt":0.2635928659577892,"score_spread":0.2101639204287991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512019831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16752027,0.00018892068,0.82924205,0.00020453305,0.00007328459,0.00006555875,3.6261463e-7,0.000035029825,0.0026699775],"genre_scores_gemma":[0.99253446,0.0008016145,0.006233373,0.000027212785,0.00000682189,0.000012232996,5.80208e-7,0.000003359634,0.0003803514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897707,0.00011240371,0.0003659198,0.00024665106,0.00013349156,0.0001644547],"domain_scores_gemma":[0.99881315,0.0001945638,0.00012342706,0.00067869184,0.00015058786,0.000039557603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039021493,0.00009286857,0.0002367546,0.00038493634,0.00005922397,0.000039530212,0.00084832386,0.000034827248,0.000026971009],"category_scores_gemma":[0.000015053208,0.00006281232,0.000056849123,0.0013483259,0.00003221558,0.00045234594,0.00031025577,0.000079325364,0.000012973963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023637456,0.00011051653,0.112812676,0.000040458028,0.00034802756,0.0000035494666,0.0031889183,0.6277073,0.011512366,0.08504484,0.000081497696,0.15912622],"study_design_scores_gemma":[0.00011651083,0.00002149819,0.002516383,0.00014657053,0.000013570033,5.2825226e-7,0.000026069469,0.99632365,0.0006503692,0.00002655898,0.0000598665,0.00009845421],"about_ca_topic_score_codex":0.00003653594,"about_ca_topic_score_gemma":0.000060621576,"teacher_disagreement_score":0.8250142,"about_ca_system_score_codex":0.00006392581,"about_ca_system_score_gemma":0.000025521833,"threshold_uncertainty_score":0.25614122},"labels":[],"label_agreement":null},{"id":"W2512165098","doi":"10.1007/s11277-016-3580-6","title":"Performance of Energy-Efficient Cooperative MAC Protocol with Power Backoff in MANETs","year":2016,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Network packet; Transmission (telecommunications); Power control; Efficient energy use; Energy consumption; Distributed coordination function; Wireless ad hoc network; Protocol (science); Mobile ad hoc network; Network allocation vector; Transmitter power output; Exponential backoff; IEEE 802.11; Power (physics); Wireless; Wireless network; Throughput; Channel (broadcasting); Telecommunications","score_opus":0.03021873065278675,"score_gpt":0.28140279322364925,"score_spread":0.2511840625708625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512165098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75604516,0.0006020383,0.13261062,0.021859376,0.00012583075,0.028907022,0.00005392418,0.00044150028,0.059354525],"genre_scores_gemma":[0.98462427,0.0002205679,0.0043822653,0.00014537992,0.0000061728233,0.010246112,0.000004328265,0.000012989932,0.00035790764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984763,0.00035228106,0.0003636427,0.00028314485,0.00027374315,0.00025083794],"domain_scores_gemma":[0.99723464,0.00030199482,0.00016978158,0.0018593767,0.000357532,0.000076669545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032425098,0.00017906178,0.00022551464,0.00016360593,0.00028009678,0.000042832384,0.0023431226,0.000052017316,0.00007377],"category_scores_gemma":[0.000016917007,0.00012086084,0.000043359414,0.00076433184,0.00036615235,0.0002995006,0.0008648662,0.00018645813,0.000018636361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037802398,0.0024998619,0.029043207,0.00007369141,0.00013148776,0.00000777397,0.011928571,0.0009950692,0.02464993,0.7055959,0.0008319423,0.22386453],"study_design_scores_gemma":[0.004975763,0.0010492991,0.05094109,0.001747673,0.000012426615,0.00004885722,0.00040222218,0.89090294,0.009260962,0.000090648544,0.03945884,0.0011092905],"about_ca_topic_score_codex":0.000013150808,"about_ca_topic_score_gemma":0.00023484041,"teacher_disagreement_score":0.88990784,"about_ca_system_score_codex":0.00011130645,"about_ca_system_score_gemma":0.00020426331,"threshold_uncertainty_score":0.49285617},"labels":[],"label_agreement":null},{"id":"W2514709250","doi":"10.1049/el.2016.1592","title":"Rate region of unicast routing networks","year":2016,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Unicast; Correctness; Computer science; Graph; Node (physics); Routing (electronic design automation); Computer network; Theoretical computer science; Algorithm; Multicast; Engineering","score_opus":0.02031984302390779,"score_gpt":0.23709843498190383,"score_spread":0.21677859195799604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514709250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018465102,0.00077562104,0.96158224,0.018360928,0.00009739911,0.00007117171,8.846474e-8,0.00008279784,0.0005646728],"genre_scores_gemma":[0.99502265,0.0015557203,0.0013830084,0.001869361,0.000048284233,0.000004673521,5.7687794e-7,0.000008012675,0.00010768055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989833,0.00020178371,0.00020389882,0.00020788157,0.000089706475,0.00031340108],"domain_scores_gemma":[0.9988643,0.00020714852,0.00012912403,0.0007003609,0.000058836173,0.000040245388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038428832,0.000094330615,0.00012116412,0.000052403127,0.000103166836,0.00003378431,0.00086677144,0.000030434,0.000004331454],"category_scores_gemma":[0.000041139636,0.000070243834,0.000052827974,0.00034121712,0.000049204973,0.00023517643,0.00024412823,0.00013498013,0.0000073139263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015894615,0.000037356593,0.00060843385,0.0000034700686,0.000048787122,0.0000068856366,0.00029259027,0.0011496029,0.13906822,0.5179687,0.01009045,0.33070958],"study_design_scores_gemma":[0.0049650962,0.00071007,0.0062007285,0.00089578266,0.000048802893,0.00016277026,0.000025961484,0.634403,0.07907165,0.0042932257,0.2670061,0.0022168448],"about_ca_topic_score_codex":8.615632e-7,"about_ca_topic_score_gemma":0.000009040758,"teacher_disagreement_score":0.97655755,"about_ca_system_score_codex":0.00009025318,"about_ca_system_score_gemma":0.0000418938,"threshold_uncertainty_score":0.28644606},"labels":[],"label_agreement":null},{"id":"W2514915491","doi":"10.1109/twc.2017.2649521","title":"Maximizing Data Rate for Multiway Relay Channels With Pairwise Transmission Strategy","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise comparison; Pairing; Relay; Computer science; Transmission (telecommunications); Pairwise error probability; Channel (broadcasting); Transmission rate; Relay channel; Algorithm; Computer network; Telecommunications; Power (physics); Artificial intelligence; Physics","score_opus":0.17449194963077497,"score_gpt":0.35080263764279934,"score_spread":0.17631068801202437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514915491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003528775,0.0013761192,0.983934,0.010449505,0.0006133805,0.0018277562,0.00033031372,0.0005503752,0.0005656745],"genre_scores_gemma":[0.8413312,0.018090492,0.1373633,0.00021448518,0.000061232015,0.001309639,0.0004542529,0.00009505675,0.0010803292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962564,0.00082961575,0.0007512611,0.0012852497,0.00034746772,0.00053001597],"domain_scores_gemma":[0.976535,0.0008996004,0.00062450155,0.021099469,0.0005793632,0.0002620464],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001254857,0.0006420174,0.0006748168,0.00034969478,0.003506013,0.0011559775,0.017547628,0.00040434566,0.000018719358],"category_scores_gemma":[0.000020555222,0.0006028112,0.000246084,0.00034006665,0.00038833244,0.001037192,0.00045479613,0.0020199192,0.000022352695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012550583,0.0010627975,0.0000025160127,0.00017989763,0.00039897795,0.000004188571,0.0019186495,0.14711945,0.0008745928,0.005502108,0.0010534263,0.8417579],"study_design_scores_gemma":[0.0011705367,0.00015427665,0.000025557381,0.001118834,0.00013531688,0.000009308347,0.000058222748,0.9725529,0.0019058789,0.0005112141,0.021540187,0.00081776717],"about_ca_topic_score_codex":0.0000702923,"about_ca_topic_score_gemma":0.00053838565,"teacher_disagreement_score":0.8465707,"about_ca_system_score_codex":0.00017035475,"about_ca_system_score_gemma":0.0006923845,"threshold_uncertainty_score":0.9998809},"labels":[],"label_agreement":null},{"id":"W2515162970","doi":"10.1109/tvt.2016.2607159","title":"On the Spectral Efficiency of Selective Decode-and-Forward Relaying","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spectral efficiency; Transmission (telecommunications); Computer science; Channel (broadcasting); Modulation (music); Decoding methods; Link adaptation; Transmitter power output; Electronic engineering; Algorithm; Computer network; Telecommunications; Fading; Engineering; Transmitter; Physics","score_opus":0.014855763393041422,"score_gpt":0.24097852563957886,"score_spread":0.22612276224653743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515162970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17453815,0.00009608983,0.8159918,0.0086302925,0.00008898188,0.00014485247,0.0000011722307,0.00016465774,0.00034400215],"genre_scores_gemma":[0.9973588,0.00038567954,0.0019531213,0.000171315,0.0000041816215,0.000038447655,4.3687745e-8,0.000007091108,0.00008134923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912596,0.00010051031,0.00018055149,0.00026972062,0.00012971251,0.00019352906],"domain_scores_gemma":[0.99875635,0.00036247782,0.000066753724,0.0006983358,0.00008773186,0.000028362296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022950287,0.000116036,0.00014055995,0.0002668699,0.00030430334,0.000015895157,0.0006845092,0.00010625684,0.000018953624],"category_scores_gemma":[0.000032983335,0.00006828013,0.000064779975,0.0007727697,0.00021992718,0.00008875261,0.00001085807,0.00029659315,0.00002654954],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026817053,0.00024837957,0.000060319668,0.0000045089473,0.00009090397,0.000005438987,0.00043061856,0.0013177197,0.07617693,0.5809402,0.00011983027,0.34057835],"study_design_scores_gemma":[0.0008176831,0.0008254735,0.00025796163,0.00017563894,0.000024532623,0.000059757695,0.000068925445,0.03211854,0.9450789,0.019266384,0.0009808594,0.00032531237],"about_ca_topic_score_codex":0.000001449834,"about_ca_topic_score_gemma":0.000014355816,"teacher_disagreement_score":0.868902,"about_ca_system_score_codex":0.000055735465,"about_ca_system_score_gemma":0.000033770324,"threshold_uncertainty_score":0.2784383},"labels":[],"label_agreement":null},{"id":"W2516177554","doi":"10.1109/lcomm.2016.2599868","title":"Joint Power Allocation and Subcarrier-Relay Assignment for OFDM-Based Decode-and-Forward Relay Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subcarrier; Orthogonal frequency-division multiplexing; Relay; Computer science; Joint (building); Resource allocation; Optimization problem; Signal-to-noise ratio (imaging); Multiplexing; Mathematical optimization; Computational complexity theory; Channel (broadcasting); Power (physics); Computer network; Telecommunications; Algorithm; Mathematics; Engineering","score_opus":0.03998087911710258,"score_gpt":0.27230909251842506,"score_spread":0.23232821340132248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516177554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011015134,0.0010856428,0.8799877,0.10696518,0.00018626502,0.0004780996,0.0000053616586,0.00013363952,0.00014294572],"genre_scores_gemma":[0.9241971,0.0016577264,0.06785308,0.0058141053,0.000028337594,0.000305955,0.000011321998,0.000021207938,0.000111180816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983392,0.00037610202,0.00042716306,0.00039060242,0.00016397683,0.00030296564],"domain_scores_gemma":[0.99575824,0.0009614582,0.00019899603,0.0027568259,0.00017487237,0.00014959947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084621913,0.00020821547,0.00021811835,0.0001454102,0.0006912485,0.00018327612,0.0014857744,0.000084976644,0.000009151583],"category_scores_gemma":[0.00010547573,0.00016958138,0.00008011063,0.00027145987,0.00029797043,0.0004109061,0.0005388851,0.00019735818,0.000008526217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001029412,0.0005462616,0.005543978,0.000058789978,0.00039187272,0.0000030939352,0.0036412799,0.011349839,0.17208898,0.23450653,0.06750232,0.5042641],"study_design_scores_gemma":[0.0037211196,0.00028862536,0.01028623,0.00044120164,0.000071997856,0.000019329513,0.00006637889,0.7549738,0.0055775275,0.0006374783,0.22269225,0.0012240271],"about_ca_topic_score_codex":0.000004952164,"about_ca_topic_score_gemma":0.00004268939,"teacher_disagreement_score":0.91318196,"about_ca_system_score_codex":0.00014040057,"about_ca_system_score_gemma":0.000057191646,"threshold_uncertainty_score":0.69153285},"labels":[],"label_agreement":null},{"id":"W2517783573","doi":"10.1109/isit.2016.7541604","title":"A reduction approach to the multiple-unicast conjecture in network coding","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Unicast; Linear network coding; Corollary; Conjecture; Computer science; Computer network; Coding (social sciences); Theoretical computer science; Mathematics; Network packet; Combinatorics","score_opus":0.04792215854852138,"score_gpt":0.2653813111517087,"score_spread":0.21745915260318732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517783573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002134447,0.00016345066,0.95929825,0.024963975,0.00022293089,0.0002914791,2.3452546e-7,0.00010869629,0.012816541],"genre_scores_gemma":[0.969778,0.00016133292,0.028199075,0.0008818578,0.00014222212,0.000043879445,4.893669e-7,0.00000479744,0.0007883535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907106,0.00018607204,0.00016362625,0.00025309165,0.00010576867,0.00022038017],"domain_scores_gemma":[0.9988917,0.00019827191,0.000034759058,0.0007756347,0.000045702905,0.000053897988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194852,0.000087597466,0.00009429724,0.00004907208,0.00018870091,0.00009020194,0.0010146047,0.000032965887,0.000014249228],"category_scores_gemma":[0.00007740626,0.000044163597,0.00002843731,0.0007015844,0.00002955873,0.00019755721,0.00048720176,0.00011201759,0.00004423104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014775847,0.00007789531,0.0009552965,0.000002522472,0.000012920165,8.7303687e-7,0.0037580563,0.006666046,0.002755926,0.5726272,0.02234027,0.3907882],"study_design_scores_gemma":[0.0020107494,0.00012747472,0.01644352,0.000281955,0.0000057141383,0.00009924208,0.0003048969,0.49536136,0.0014443869,0.0016874262,0.48142865,0.00080461684],"about_ca_topic_score_codex":0.000006357514,"about_ca_topic_score_gemma":0.0000891863,"teacher_disagreement_score":0.96764356,"about_ca_system_score_codex":0.00006031838,"about_ca_system_score_gemma":0.000024415498,"threshold_uncertainty_score":0.18854049},"labels":[],"label_agreement":null},{"id":"W2519970793","doi":"10.1109/wcnc.2016.7564959","title":"End-to-end distortion analysis of multicasting over orthogonal receive component decode-forward cooperative broadcast channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Channel (broadcasting); Computer network; Decodes; Distortion (music); Relay; Decoding methods; Broadcasting (networking); Multicast; Layer (electronics); Transmission (telecommunications); Telecommunications; Bandwidth (computing)","score_opus":0.03942130668605934,"score_gpt":0.2983598156605762,"score_spread":0.25893850897451687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519970793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16801697,0.00007957181,0.8291002,0.0010820649,0.00016991129,0.00018990092,0.000016960368,0.00007681103,0.0012676327],"genre_scores_gemma":[0.98712057,0.0001486417,0.011706593,0.00031100633,0.000038741015,0.000026070169,0.000014715008,0.000008738179,0.00062494795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980888,0.0002636411,0.00052277796,0.00047529914,0.00036038095,0.0002891206],"domain_scores_gemma":[0.99786013,0.0005485696,0.00019300861,0.0007352123,0.00047770434,0.00018539805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050955213,0.00019479245,0.00039742046,0.00041479312,0.00022196675,0.00008175881,0.00073745294,0.000049391732,0.0007730508],"category_scores_gemma":[0.00019490084,0.00013515375,0.00016985025,0.0016707138,0.0000923431,0.0004377869,0.00058511825,0.00009789879,0.00004681212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009677192,0.00043947206,0.015713612,0.0000107905835,0.0014342128,0.000008105127,0.0065384908,0.0152980955,0.06514186,0.08264629,0.0011322569,0.81154007],"study_design_scores_gemma":[0.0012374215,0.00027953906,0.11503396,0.00019308171,0.00023846587,0.000005113363,0.000120246346,0.8534196,0.01898787,0.00009268562,0.009630326,0.00076169363],"about_ca_topic_score_codex":0.000025070594,"about_ca_topic_score_gemma":0.0002840741,"teacher_disagreement_score":0.8381215,"about_ca_system_score_codex":0.00014084042,"about_ca_system_score_gemma":0.000058469443,"threshold_uncertainty_score":0.84643644},"labels":[],"label_agreement":null},{"id":"W2520157656","doi":"10.1109/wcnc.2016.7564944","title":"Cooperative routing for collision probability minimization in wireless sensor networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Collision; Multipath routing; Computer network; Routing (electronic design automation); Cooperative diversity; Multipath propagation; Equal-cost multi-path routing; Network packet; Transmission (telecommunications); Link-state routing protocol; Static routing; Routing protocol; Distributed computing; Fading; Channel (broadcasting); Telecommunications","score_opus":0.0420464313020909,"score_gpt":0.2809740450491474,"score_spread":0.2389276137470565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520157656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031864654,0.000023630037,0.96397877,0.002629158,0.0001137638,0.0005895352,9.835699e-7,0.00009785558,0.0007016375],"genre_scores_gemma":[0.9582988,0.00013756829,0.04066819,0.00024523228,0.000036513775,0.00008596038,0.0000029666899,0.000006279567,0.0005184925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988672,0.00021331984,0.0002868424,0.00032722333,0.000088847344,0.00021655885],"domain_scores_gemma":[0.99852633,0.0006322069,0.00007029649,0.0004396746,0.0002843369,0.000047170215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005381292,0.000106072446,0.00014605152,0.000051707964,0.00017153991,0.000087657594,0.00043395767,0.00005653317,0.00001468946],"category_scores_gemma":[0.00020564035,0.00006990921,0.000033187025,0.00045325782,0.000037536127,0.00040856656,0.00021893957,0.000058742222,0.0000047934072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060518505,0.00019744193,0.007694579,0.000009787013,0.000012769849,0.0000011388606,0.0010903474,0.0112534715,0.003551209,0.6579728,0.0013264989,0.31682938],"study_design_scores_gemma":[0.0008046748,0.00005765479,0.0019759561,0.00008283177,0.0000011403561,9.534248e-7,0.000021576092,0.99337995,0.0023284894,0.00038120107,0.00080551783,0.0001600287],"about_ca_topic_score_codex":0.0000028071552,"about_ca_topic_score_gemma":0.00014596882,"teacher_disagreement_score":0.9821265,"about_ca_system_score_codex":0.00010896382,"about_ca_system_score_gemma":0.000055491313,"threshold_uncertainty_score":0.28508148},"labels":[],"label_agreement":null},{"id":"W2520522230","doi":"10.1109/wcnc.2016.7565046","title":"On relay selection in bursty impulsive noise channel","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Rayleigh fading; Relay channel; Computer science; Selection (genetic algorithm); Channel state information; Bit error rate; Additive white Gaussian noise; Channel (broadcasting); Noise (video); Phase-shift keying; Selection algorithm; Gaussian noise; Fading; Electronic engineering; Topology (electrical circuits); Computer network; Algorithm; Telecommunications; Wireless; Engineering; Electrical engineering; Artificial intelligence; Power (physics); Physics","score_opus":0.021849153565349163,"score_gpt":0.2637445785105914,"score_spread":0.24189542494524224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520522230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07128759,0.000080426835,0.9001328,0.010663905,0.00020240626,0.00017869736,2.9858327e-7,0.0002087738,0.017245129],"genre_scores_gemma":[0.9950137,0.00019221022,0.0015621063,0.000667203,0.000022932749,0.00001411524,1.8351012e-7,0.0000032934747,0.0025242188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993988,0.00008708984,0.00010757003,0.00018835194,0.000082325394,0.00013585517],"domain_scores_gemma":[0.9994811,0.0001435965,0.00002843205,0.00025340065,0.000055803852,0.00003766301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017658793,0.00006458602,0.00006388223,0.00009661303,0.0000716524,0.00003038764,0.00037518065,0.000028370774,0.000062256346],"category_scores_gemma":[0.00005789733,0.00004079244,0.000020289583,0.00036736153,0.000013441445,0.00023699187,0.00013741401,0.00007275841,0.00015755382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020277092,0.00014098024,0.0010238311,0.0000017500536,0.000007946328,0.0000035242517,0.000857569,0.00058453396,0.013522602,0.6163181,0.00645961,0.36105925],"study_design_scores_gemma":[0.0058952947,0.0013020661,0.14018191,0.00064982905,0.000005937705,0.000041248077,0.00008015903,0.7202246,0.06486928,0.03058075,0.034495424,0.0016734755],"about_ca_topic_score_codex":0.000006384932,"about_ca_topic_score_gemma":0.00012124026,"teacher_disagreement_score":0.92372614,"about_ca_system_score_codex":0.00007945914,"about_ca_system_score_gemma":0.000021563374,"threshold_uncertainty_score":0.20250882},"labels":[],"label_agreement":null},{"id":"W2520852302","doi":"10.1109/wcnc.2016.7565049","title":"Large scale opportunistic antenna and user selection in AF relay networks with interference","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Rayleigh fading; Relay; Computer science; Fading; Scheduling (production processes); MIMO; Moment-generating function; Topology (electrical circuits); Interference (communication); Maximal-ratio combining; Multiuser detection; Context (archaeology); Mathematics; Algorithm; Channel (broadcasting); Telecommunications; Probability density function; Mathematical optimization; Statistics; Physics; Code division multiple access; Combinatorics; Power (physics)","score_opus":0.026302150308400343,"score_gpt":0.2520099302927345,"score_spread":0.22570777998433417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520852302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025330933,0.000086629305,0.97180957,0.0012043613,0.0000351848,0.00007974981,2.584139e-7,0.00007634895,0.0013769654],"genre_scores_gemma":[0.989538,0.00069826696,0.007593155,0.000280275,0.000013826911,0.000010308938,4.6248422e-7,0.00000458889,0.0018611165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993012,0.00008999273,0.00012873704,0.00023207959,0.00006258901,0.0001854167],"domain_scores_gemma":[0.9994979,0.00009683271,0.000035868903,0.00023775021,0.0000679136,0.000063765365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025287847,0.0000832735,0.00009320202,0.00006536474,0.00009006912,0.00007373029,0.0002965126,0.000031861786,0.00004973181],"category_scores_gemma":[0.000016296686,0.000049513517,0.0000089694395,0.00032150926,0.000038986378,0.00035439603,0.0002445752,0.00009821643,0.000007257139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013721938,0.0003697375,0.3267241,0.00001578238,0.000041860905,0.00002849371,0.0030224095,0.00017839795,0.008611434,0.40013632,0.0036827654,0.25705147],"study_design_scores_gemma":[0.0012221086,0.00025012429,0.06700608,0.00033871038,0.000003881231,0.000047780686,0.00008996591,0.9242964,0.00014660317,0.00019434451,0.0060599684,0.000344029],"about_ca_topic_score_codex":0.00000358673,"about_ca_topic_score_gemma":0.0010288637,"teacher_disagreement_score":0.9642164,"about_ca_system_score_codex":0.000029649742,"about_ca_system_score_gemma":0.000027551001,"threshold_uncertainty_score":0.20191027},"labels":[],"label_agreement":null},{"id":"W2521088866","doi":"10.11159/eee16.123","title":"Outage Probability of DF IDMA Networks with Best Relay Selection in Weibull Fading","year":2016,"lang":"en","type":"article","venue":"Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Erciyes Üniversitesi","keywords":"Fading; Outage probability; Weibull distribution; Computer science; Selection (genetic algorithm); Relay; Weibull fading; Computer network; Fading distribution; Decoding methods; Statistics; Telecommunications; Mathematics; Rayleigh fading; Artificial intelligence; Power (physics); Physics","score_opus":0.010477292070248114,"score_gpt":0.2075970495018958,"score_spread":0.1971197574316477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521088866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88117874,0.0006104057,0.11642054,0.00058810017,0.00043245652,0.00045479447,3.8689205e-7,0.00007668382,0.00023787859],"genre_scores_gemma":[0.9976546,0.00008499325,0.002075355,0.000013856453,0.000032450233,0.000014267915,1.21151125e-8,0.000004546936,0.000119901364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998888,0.000015485788,0.00026482108,0.00033970643,0.00024596372,0.00024600828],"domain_scores_gemma":[0.9992913,0.000150285,0.00014148984,0.0001369331,0.00020833495,0.00007164729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067107595,0.00012705794,0.00022285746,0.0002308702,0.00012827059,0.00012534315,0.0006449238,0.000028672348,1.8330634e-7],"category_scores_gemma":[0.000047534253,0.0000714749,0.000020679123,0.0016083654,0.00015985368,0.00032552684,0.00025843663,0.00016475818,9.486431e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008292208,0.00026971346,0.0847313,0.00028966094,0.000045532088,0.0000014380175,0.0006544832,0.08712562,0.030743705,0.6901927,0.00015255758,0.10571036],"study_design_scores_gemma":[0.00025736002,0.0002077981,0.0086545665,0.00071512104,0.000003031621,0.000016003973,0.000002257113,0.98803514,0.0017723055,0.000025752313,0.00019002375,0.00012062074],"about_ca_topic_score_codex":0.0000073232627,"about_ca_topic_score_gemma":0.0000064786304,"teacher_disagreement_score":0.90090954,"about_ca_system_score_codex":0.00005643352,"about_ca_system_score_gemma":0.000030016065,"threshold_uncertainty_score":0.29146618},"labels":[],"label_agreement":null},{"id":"W2521636665","doi":"10.11159/eee16.122","title":"An Analytical Study for Two-Hop Amplify-and-Forward DS-CDMA Systems over Rayleigh/Nakagami-m Fading Channels","year":2016,"lang":"en","type":"article","venue":"Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Erciyes Üniversitesi","keywords":"Nakagami distribution; Rayleigh fading; Fading; Computer science; Hop (telecommunications); Code division multiple access; Spread spectrum; Electronic engineering; Telecommunications; Channel (broadcasting); Engineering","score_opus":0.01993923977631987,"score_gpt":0.26851642554131255,"score_spread":0.2485771857649927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521636665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85466695,0.0009582515,0.1399146,0.00054077833,0.0022382748,0.0013423389,0.000003051706,0.00021478308,0.00012097299],"genre_scores_gemma":[0.9989825,0.000046609766,0.00046999645,0.000041412095,0.00018323965,0.00005987514,6.583676e-8,0.000010966287,0.0002053747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981869,0.000027112532,0.0003610541,0.00061845797,0.00039142786,0.000415086],"domain_scores_gemma":[0.998707,0.00033568195,0.000148394,0.00030366002,0.00028033435,0.00022493178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011574129,0.00022578923,0.00037712132,0.00033598405,0.00041044434,0.00082354096,0.0011036958,0.000036963527,2.2127698e-7],"category_scores_gemma":[0.000074003845,0.0001343821,0.000039406932,0.0009777197,0.0001594981,0.0005733734,0.00043643315,0.00016238943,2.3684724e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044541663,0.00021693503,0.006650256,0.00016923808,0.00008981242,0.0000015407634,0.0008318711,0.0046085194,0.012303351,0.9341785,0.0004081669,0.040497273],"study_design_scores_gemma":[0.00064548897,0.00038055232,0.0021082081,0.00031070612,0.000011898464,0.000019331814,0.000015878057,0.995085,0.00041319395,0.00003801674,0.0007493026,0.0002224017],"about_ca_topic_score_codex":0.00000842726,"about_ca_topic_score_gemma":0.0000011251599,"teacher_disagreement_score":0.9904765,"about_ca_system_score_codex":0.000054948807,"about_ca_system_score_gemma":0.00002871516,"threshold_uncertainty_score":0.7941425},"labels":[],"label_agreement":null},{"id":"W2522493423","doi":"10.1109/csndsp.2016.7573990","title":"A time scheduling scheme in MIMO Y channels with reduced antenna configurations","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Relay; MIMO; Scheduling (production processes); Computer science; Precoding; Computer network; Multi-user MIMO; Channel (broadcasting); Scheme (mathematics); Topology (electrical circuits); Engineering; Mathematics; Electrical engineering; Mathematical optimization","score_opus":0.034559619385901366,"score_gpt":0.2670509914629505,"score_spread":0.23249137207704917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522493423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11323165,0.0001655214,0.85342443,0.020826649,0.00008277007,0.00025402673,5.729961e-7,0.00025524746,0.011759155],"genre_scores_gemma":[0.9565749,0.00009108414,0.04032557,0.00036304115,0.000025535926,0.000024492892,8.548032e-7,0.0000056729514,0.0025888195],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992384,0.00007216176,0.00016367594,0.0002336688,0.00010321174,0.00018892578],"domain_scores_gemma":[0.99914515,0.00010905732,0.000042001342,0.0005183419,0.00012530356,0.00006012325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020399175,0.0000918959,0.00010946619,0.00010699916,0.000104389124,0.00008771842,0.0005467388,0.000027708096,0.00017795821],"category_scores_gemma":[0.00005026887,0.000055788725,0.000018986566,0.00048493437,0.000054735054,0.0004783987,0.000144164,0.00007255937,0.0002046971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001757367,0.00011710954,0.00030880905,0.000003241074,0.000023149174,0.000009634497,0.0012379366,0.000079895726,0.7384027,0.22017752,0.00047395483,0.03914844],"study_design_scores_gemma":[0.0027400963,0.0002220555,0.0025222693,0.0006910091,0.000004001211,0.000041153053,0.00011663153,0.9479286,0.036964297,0.0009383245,0.0070487144,0.000782849],"about_ca_topic_score_codex":0.0000024441256,"about_ca_topic_score_gemma":0.000024632118,"teacher_disagreement_score":0.9478487,"about_ca_system_score_codex":0.00003300242,"about_ca_system_score_gemma":0.00007483944,"threshold_uncertainty_score":0.26310354},"labels":[],"label_agreement":null},{"id":"W2523975658","doi":"","title":"Joint optimal power allocation and relay selection with spatial diversity in wireless relay networks","year":2011,"lang":"en","type":"article","venue":"Espace ÉTS (ETS)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Relay; Mathematical optimization; Base station; Computer science; RSS; Wireless; Optimization problem; Selection (genetic algorithm); Wireless network; Node (physics); Power (physics); Computer network; Mathematics; Engineering; Telecommunications; Artificial intelligence","score_opus":0.028701620162679548,"score_gpt":0.2280032232263521,"score_spread":0.19930160306367256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523975658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4786714,0.00010315068,0.51924735,0.00061091414,0.00010897102,0.00016346092,1.5749777e-7,0.000082598424,0.0010119678],"genre_scores_gemma":[0.9887244,0.00023574516,0.010624496,0.00013780358,0.000026805359,0.000009789556,0.0000019712854,0.000008682568,0.00023029049],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894345,0.0001865584,0.00014874681,0.0003405629,0.00015878283,0.00022191627],"domain_scores_gemma":[0.9992963,0.000042084994,0.000099173485,0.00036595378,0.000112686015,0.00008381237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038900704,0.00013924408,0.00014554764,0.000114888084,0.000334601,0.00007363111,0.00035030674,0.00008038248,0.00003363389],"category_scores_gemma":[0.0000172134,0.00012804812,0.00002187982,0.0004715358,0.00006192094,0.0004752607,0.00064165035,0.00029834322,0.000009867881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010814476,0.0011990084,0.4700527,0.000041230567,0.00023347833,0.00010947131,0.109242454,0.08597877,0.003182047,0.16806902,0.0038125298,0.15699786],"study_design_scores_gemma":[0.00087527715,0.00030817767,0.2795199,0.00008980224,0.0000102935355,0.000026223533,0.00014941978,0.71715397,0.0008920764,0.000023541126,0.0005935238,0.00035783683],"about_ca_topic_score_codex":0.0001600656,"about_ca_topic_score_gemma":0.0016709289,"teacher_disagreement_score":0.63117516,"about_ca_system_score_codex":0.00008504137,"about_ca_system_score_gemma":0.000039634575,"threshold_uncertainty_score":0.5221651},"labels":[],"label_agreement":null},{"id":"W2525693147","doi":"10.1109/tit.2016.2613988","title":"On Base Field of Linear Network Coding","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Coset; Multicast; Linear network coding; Multiplicative function; Finite field; Base (topology); Algebraic number; Topology (electrical circuits)","score_opus":0.018813647294524616,"score_gpt":0.2582966965281903,"score_spread":0.2394830492336657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525693147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009343212,0.000009987636,0.991667,0.0008920982,0.00043212308,0.000107219974,0.000004450626,0.00010673371,0.0058460925],"genre_scores_gemma":[0.99437135,0.00019698797,0.0034206808,0.0017039946,0.000022128686,0.000018595983,6.8080374e-7,0.0000035871856,0.0002619749],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991973,0.00013644695,0.00029710965,0.00008294007,0.00015430484,0.00013192189],"domain_scores_gemma":[0.99819964,0.0010116262,0.000114169365,0.00051567296,0.00011103128,0.000047880192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954921,0.0000904829,0.00009822072,0.00014244246,0.00023116959,0.000029184008,0.00041055947,0.000048738402,0.00025011087],"category_scores_gemma":[0.000034548044,0.00006544354,0.00006770128,0.00029863894,0.00003276854,0.00092701474,0.0000047124795,0.00012256592,0.00020085498],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068983616,0.000036724512,0.0000014221309,0.0000066237358,0.000016318452,1.5409333e-7,0.00065324485,0.012694254,0.00027511042,0.45657873,0.0009973275,0.5286711],"study_design_scores_gemma":[0.0056140707,0.002276665,0.00020987699,0.0019218574,0.000052728657,0.000023226796,0.0003215778,0.32001272,0.5508206,0.076870546,0.040369965,0.0015061914],"about_ca_topic_score_codex":6.21916e-7,"about_ca_topic_score_gemma":0.0000017300212,"teacher_disagreement_score":0.99343705,"about_ca_system_score_codex":0.000033268185,"about_ca_system_score_gemma":0.000032441367,"threshold_uncertainty_score":0.27385387},"labels":[],"label_agreement":null},{"id":"W2525875107","doi":"10.1049/iet-com.2015.1029","title":"Ergodic sum rate analysis and efficient power allocation for a massive MIMO two‐way relay network","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ergodic theory; Relay; Computer science; MIMO; Power (physics); Computer network; Telecommunications; Mathematics; Beamforming; Physics","score_opus":0.03143801009714463,"score_gpt":0.29845690920218076,"score_spread":0.2670188991050361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525875107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008807746,0.002096258,0.95845324,0.028584477,0.00012325747,0.00047050195,0.000011870401,0.0001644262,0.0012882086],"genre_scores_gemma":[0.9371281,0.0022399623,0.05931717,0.0005493094,0.000029184699,0.00025696785,0.000028326649,0.000013193566,0.0004377552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981901,0.00058365776,0.00039663631,0.00038212427,0.00013480088,0.00031267508],"domain_scores_gemma":[0.9940509,0.0015846514,0.00021852872,0.0035980463,0.0004207619,0.00012710944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010629463,0.00017448876,0.0002433143,0.00020370094,0.00089236203,0.00017724789,0.0021538492,0.00006210345,0.00002513573],"category_scores_gemma":[0.00019958467,0.00013730463,0.00014161719,0.0014375946,0.00021156279,0.00025063744,0.001178262,0.0001458665,0.000029988949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034951398,0.0003442297,0.004196832,0.000008713008,0.0007617806,7.620154e-7,0.0031465415,0.009448486,0.006987503,0.8880906,0.0069719097,0.08000768],"study_design_scores_gemma":[0.0023411373,0.00017143002,0.04494878,0.00019038253,0.00039574024,0.0000056159424,0.00009780345,0.82549185,0.00062194426,0.004182823,0.12067438,0.00087810453],"about_ca_topic_score_codex":0.000014198281,"about_ca_topic_score_gemma":0.00047755003,"teacher_disagreement_score":0.9283204,"about_ca_system_score_codex":0.00009028517,"about_ca_system_score_gemma":0.00007312873,"threshold_uncertainty_score":0.68634176},"labels":[],"label_agreement":null},{"id":"W2528053997","doi":"10.7717/peerj-cs.89","title":"TCP adaptation with network coding and opportunistic data forwarding in multi-hop wireless networks","year":2016,"lang":"en","type":"article","venue":"PeerJ Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Linear network coding; Network packet; Wireless network; Packet forwarding; TCP Westwood plus; TCP Friendly Rate Control; TCP tuning; Transmission Control Protocol; Wireless; Telecommunications","score_opus":0.12178753556621826,"score_gpt":0.30483387909542947,"score_spread":0.18304634352921123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528053997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054256483,0.00019499149,0.9920867,0.0015075827,0.000362633,0.00020434373,0.0000016279016,0.0001288852,0.00008760138],"genre_scores_gemma":[0.8046257,0.0004153916,0.19450387,0.00030407257,0.00008944356,0.000009641131,0.0000035762064,0.00000833933,0.000039945837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763244,0.00014038985,0.00031979478,0.00093225326,0.0004062476,0.00056889514],"domain_scores_gemma":[0.9974951,0.0003977694,0.00015040365,0.0015287681,0.00022282262,0.00020514487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020501087,0.0001961033,0.00023566108,0.00018598777,0.00054262654,0.0005303091,0.0030197825,0.00003927626,0.0000032354096],"category_scores_gemma":[0.00006240498,0.00013844355,0.000016033335,0.0014554786,0.00039557903,0.0022089577,0.0029185503,0.00016367261,0.0000042361007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008514034,0.000036332134,0.004557189,0.0000058942,0.0000073480383,0.000019087804,0.000603733,0.012118346,0.00026929105,0.03523592,0.0002857806,0.94685256],"study_design_scores_gemma":[0.00056756975,0.000052260584,0.0117796855,0.00025722838,0.0000031546765,0.00002885162,0.00001267228,0.98635405,0.000013531142,0.00009303178,0.00059287006,0.00024508976],"about_ca_topic_score_codex":0.000012257976,"about_ca_topic_score_gemma":0.00018833653,"teacher_disagreement_score":0.9742357,"about_ca_system_score_codex":0.00008881382,"about_ca_system_score_gemma":0.00020600962,"threshold_uncertainty_score":0.56455636},"labels":[],"label_agreement":null},{"id":"W2528326411","doi":"10.6180/jase.2015.18.3.12","title":"Performance Analysis of the Mobile-Relay-Based M2M Communication Over N-Nakagami Fading Channels","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Science and Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Fading; Nakagami distribution; Moment-generating function; Relay; Upper and lower bounds; Power (physics); Mathematics; Algorithm; Modulation (music); Computer science; Moment (physics); Topology (electrical circuits); Telecommunications; Statistical physics; Electronic engineering; Statistics; Random variable; Channel (broadcasting); Physics; Mathematical analysis; Combinatorics; Engineering; Quantum mechanics","score_opus":0.023339419103677615,"score_gpt":0.24323158166819436,"score_spread":0.21989216256451674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528326411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93177044,0.00032432395,0.06691924,0.00018229762,0.00015173323,0.00007071262,1.8185177e-7,0.000012456745,0.0005685958],"genre_scores_gemma":[0.99295706,0.00013741977,0.0068121557,0.000069997106,0.000014219274,0.0000030474364,1.1059046e-7,0.0000024956514,0.0000034823806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999093,0.000015472191,0.00026176948,0.00009084913,0.00041368013,0.00012522077],"domain_scores_gemma":[0.99888945,0.00007038237,0.00020479364,0.0004351267,0.0003154875,0.00008473779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017434575,0.00006904628,0.0001624031,0.00036233425,0.00015850895,0.00009277056,0.0012270529,0.000020050757,0.000001125957],"category_scores_gemma":[0.000052246814,0.000048859045,0.00004696662,0.002475,0.00010551924,0.0004268351,0.00027030363,0.00016401854,2.8013017e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039227148,0.000014291311,0.00053703977,0.0000052583937,0.000028775394,1.369871e-7,0.0018387444,0.97071767,0.015804965,0.0032004865,0.000027384567,0.007821307],"study_design_scores_gemma":[0.00016767276,0.000027458913,0.0062232674,0.00003922763,0.00002756505,0.0000020939449,0.000058003086,0.98793066,0.004871675,0.00001232082,0.00057854725,0.0000615172],"about_ca_topic_score_codex":8.0027155e-7,"about_ca_topic_score_gemma":7.354638e-7,"teacher_disagreement_score":0.061186608,"about_ca_system_score_codex":0.00007121209,"about_ca_system_score_gemma":0.00013601506,"threshold_uncertainty_score":0.228019},"labels":[],"label_agreement":null},{"id":"W2532008581","doi":"10.1109/camap.2005.1574206","title":"The Pairwise Error Probability and Precoder Design for Amplify-And-Forward Half-Duplex Cooperative System","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pairwise error probability; Coding gain; Pairwise comparison; Unitary state; Computer science; Diversity gain; Quadrature amplitude modulation; Control theory (sociology); Probability of error; QAM; Algorithm; Duplex (building); Coding (social sciences); Outage probability; Detector; Mathematics; Mathematical optimization; Bit error rate; Telecommunications; Statistics; Decoding methods; Fading; Artificial intelligence","score_opus":0.06461207908098755,"score_gpt":0.2773547437189951,"score_spread":0.21274266463800756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532008581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029330081,0.0010510548,0.98908204,0.0039950972,0.00008090776,0.001284859,0.0000019036612,0.00019592106,0.0013752242],"genre_scores_gemma":[0.85222214,0.00013471223,0.14494056,0.00018902025,0.000045770215,0.00040624387,0.000003208398,0.000009984642,0.0020483325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872,0.00034056537,0.0002620639,0.00034481843,0.00010424148,0.00022833758],"domain_scores_gemma":[0.9981161,0.00096494483,0.00006699624,0.0005525955,0.00023585523,0.000063554115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010900717,0.00014394707,0.00016045044,0.000023403722,0.00088898576,0.00042170816,0.00045945882,0.000046782017,0.0000047207513],"category_scores_gemma":[0.00007692991,0.00008930461,0.000031523163,0.00016045835,0.00013277837,0.00025812673,0.00029431257,0.00009501938,0.00000386785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030776744,0.000046344205,0.0002720158,0.000037737515,0.000024140347,3.477429e-7,0.00055364316,0.0010464096,0.00022531471,0.9560834,0.008590382,0.033089466],"study_design_scores_gemma":[0.0005269084,0.00012699324,0.0010815376,0.000030923085,0.000009403579,0.000010430794,0.00012312994,0.9588581,0.0006883629,0.0021167416,0.036205523,0.00022196502],"about_ca_topic_score_codex":0.000023159582,"about_ca_topic_score_gemma":0.00029816153,"teacher_disagreement_score":0.95781165,"about_ca_system_score_codex":0.000052081818,"about_ca_system_score_gemma":0.00006077908,"threshold_uncertainty_score":0.68374497},"labels":[],"label_agreement":null},{"id":"W2533310758","doi":"10.1109/icspc.2007.4728546","title":"Recursive and Non-Recursive Network Coding: Performance and Complexity","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Computer science; Computational complexity theory; Coding (social sciences); Network packet; Theoretical computer science; Encoding (memory); Throughput; Computer network; Algorithm; Mathematics; Artificial intelligence","score_opus":0.05396336199440613,"score_gpt":0.28416238798533056,"score_spread":0.23019902599092443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533310758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21798377,0.0010462916,0.73240364,0.0021349704,0.00029349801,0.00028847114,5.2980204e-7,0.00013409663,0.045714732],"genre_scores_gemma":[0.94584054,0.0019513072,0.050847657,0.00093254884,0.00007644916,0.0000031683314,0.0000016414753,0.000004752135,0.0003419613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99911374,0.00004467658,0.00017554782,0.00026747023,0.000108863525,0.0002896814],"domain_scores_gemma":[0.9991051,0.00021222951,0.00006455753,0.00036573326,0.000117524454,0.00013486698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062561576,0.000120424185,0.00014391294,0.000049498678,0.00043135305,0.000120284145,0.00038604037,0.000041316074,0.000017972821],"category_scores_gemma":[0.000022448068,0.0001088264,0.000016823678,0.0003247551,0.00017024195,0.0003417449,0.0005419173,0.0001633192,0.00000974798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025021813,0.00003494972,0.016514866,0.000015876034,0.000023764434,0.000005202812,0.0026707386,0.00003340051,0.00015263724,0.7688878,0.008372604,0.20326313],"study_design_scores_gemma":[0.0017868467,0.00056216016,0.68091404,0.00028239604,0.000019098214,0.00012256116,0.00043068297,0.23396887,0.0020552487,0.01785624,0.06086626,0.0011355882],"about_ca_topic_score_codex":0.0000049081536,"about_ca_topic_score_gemma":0.000084886575,"teacher_disagreement_score":0.7510316,"about_ca_system_score_codex":0.000024540319,"about_ca_system_score_gemma":0.000018829534,"threshold_uncertainty_score":0.4437812},"labels":[],"label_agreement":null},{"id":"W2534067685","doi":"10.1109/asms-spsc.2016.7601464","title":"Network coding and MPTCP in satellite networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de la Santé et des Services sociaux","keywords":"Computer network; Computer science; Multipath TCP; Linear network coding; Network packet; Exploit; Quality of service; Throughput; Distributed computing; Multipath propagation; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.03255422116464326,"score_gpt":0.2561662251072946,"score_spread":0.22361200394265132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534067685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032682298,0.0025309375,0.97000045,0.0072067417,0.00017453263,0.000104948296,6.282661e-8,0.00013477128,0.016579328],"genre_scores_gemma":[0.9771442,0.012108408,0.008537445,0.0013270536,0.00006889012,0.000007258327,2.1295178e-7,0.0000045312286,0.00080201577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919856,0.00010978399,0.00016846026,0.00021713496,0.00006463917,0.00024140903],"domain_scores_gemma":[0.9991979,0.000284764,0.000032169766,0.00039331868,0.000029365994,0.000062499545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040644142,0.000082953295,0.00010506608,0.000045081062,0.00009332112,0.00008384982,0.00041332937,0.000035651636,0.00003453714],"category_scores_gemma":[0.000021214986,0.000054793163,0.000014804177,0.00035408797,0.000037027334,0.00038002885,0.0004239276,0.00007613723,0.000016894084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021707829,0.000006804307,0.010832564,7.5446843e-7,0.0000022745905,0.0000021614258,0.00008518901,0.00011296833,0.0001086189,0.4972855,0.0009914468,0.49056956],"study_design_scores_gemma":[0.0024121946,0.00012542687,0.22396664,0.00062775257,0.000004812464,0.000035961464,0.00002944107,0.55330575,0.00024069862,0.016065393,0.2021117,0.0010742407],"about_ca_topic_score_codex":0.0000019010168,"about_ca_topic_score_gemma":0.00009075067,"teacher_disagreement_score":0.97387594,"about_ca_system_score_codex":0.000023854951,"about_ca_system_score_gemma":0.000011245007,"threshold_uncertainty_score":0.22344004},"labels":[],"label_agreement":null},{"id":"W2535105045","doi":"10.1109/itw2.2006.323833","title":"Optimal Multicast with Erasure Correction Coding","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multicast; Linear network coding; Computer science; Computer network; Erasure; Erasure code; Distributed computing; Network packet; Throughput; Routing protocol; Coding (social sciences); Algorithm; Decoding methods; Wireless; Mathematics","score_opus":0.021475593550317765,"score_gpt":0.24869483445683066,"score_spread":0.2272192409065129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535105045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016208936,0.000054533622,0.9550634,0.00056206767,0.00017416853,0.000071396156,8.603516e-8,0.00023161397,0.027633782],"genre_scores_gemma":[0.93539035,0.000018735023,0.061592776,0.00013255325,0.000045545632,0.0000064875944,0.0000012285051,0.00000394883,0.0028083827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947226,0.00004106081,0.00009770911,0.00015904871,0.00010634238,0.00012360323],"domain_scores_gemma":[0.99947333,0.00005706843,0.0000302639,0.00031366036,0.00009749788,0.000028173137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108684064,0.00007025536,0.000066418936,0.00004042127,0.00019179974,0.00014287763,0.00030379044,0.000019266785,0.00004380843],"category_scores_gemma":[0.000007430559,0.00005380088,0.000016539645,0.0002882982,0.000023345841,0.00026517684,0.00010181679,0.0000884569,0.000034977496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004421885,0.00044125327,0.02787971,0.000010346383,0.0000388075,0.000027656086,0.0012297427,0.0649113,0.008493425,0.5652079,0.05621923,0.27549642],"study_design_scores_gemma":[0.00030569278,0.00005529187,0.01022574,0.000020353737,0.0000022407685,0.000029461386,0.000026279627,0.9751942,0.0033593706,0.000022516515,0.010603239,0.00015560997],"about_ca_topic_score_codex":0.000020392332,"about_ca_topic_score_gemma":0.0001858246,"teacher_disagreement_score":0.9191814,"about_ca_system_score_codex":0.000025747056,"about_ca_system_score_gemma":0.000020665788,"threshold_uncertainty_score":0.21939361},"labels":[],"label_agreement":null},{"id":"W2537162100","doi":"10.1109/apace.2012.6457653","title":"Coded cooperative networks with channel estimation technique","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Channel (broadcasting); Bit error rate; Transmission (telecommunications); Relay; Channel state information; Phase-shift keying; Convolutional code; Decoding methods; Keying; Algorithm; Degradation (telecommunications); Signal-to-noise ratio (imaging); Electronic engineering; Telecommunications; Wireless; Engineering","score_opus":0.030307891430963217,"score_gpt":0.2736138937661181,"score_spread":0.2433060023351549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537162100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022531314,0.00025854856,0.98735046,0.0006685107,0.00007559472,0.00030009833,1.5706667e-7,0.00027342394,0.010847897],"genre_scores_gemma":[0.8688157,0.00008490634,0.12995277,0.0005798818,0.00004392928,0.000114344846,0.000004674762,0.000006696046,0.0003971074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925643,0.00011655112,0.0001266732,0.00014797765,0.00010981932,0.0002425686],"domain_scores_gemma":[0.9991567,0.00007560233,0.000049147882,0.00048206362,0.00013980997,0.00009664917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003402014,0.00011365755,0.0001059995,0.000051970113,0.00022155319,0.00009779516,0.00045616252,0.000042290267,0.000039694347],"category_scores_gemma":[0.00001685212,0.000082408274,0.000017157068,0.00049013173,0.0000388621,0.00081100053,0.00020204064,0.00014286993,0.00003013101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020333242,0.00026822698,0.00062734727,0.00000671259,0.00004695459,0.0000019445533,0.002382732,0.072924405,0.00086051656,0.84706014,0.0056810905,0.070119604],"study_design_scores_gemma":[0.00018756826,0.00006705152,0.0006441306,0.000026184369,0.000002850967,0.000020478421,0.000021893808,0.99324626,0.0038293372,0.00007961316,0.0016866865,0.00018796785],"about_ca_topic_score_codex":0.0000023033572,"about_ca_topic_score_gemma":0.000012079937,"teacher_disagreement_score":0.9203218,"about_ca_system_score_codex":0.000034651574,"about_ca_system_score_gemma":0.000026094021,"threshold_uncertainty_score":0.3360512},"labels":[],"label_agreement":null},{"id":"W2537404375","doi":"10.1109/apace.2012.6457654","title":"Distributed convolutional-based coding for system non-idealities","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Coding (social sciences); Channel (broadcasting); Ideal (ethics); Algorithm; Relay; Transmission (telecommunications); Focus (optics); Bounded function; Phase-shift keying; Convolutional code; Bit error rate; Theoretical computer science; Topology (electrical circuits); Decoding methods; Computer network; Telecommunications; Mathematics; Physics; Statistics; Combinatorics","score_opus":0.05296454181132032,"score_gpt":0.28691084580370385,"score_spread":0.23394630399238353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537404375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064189476,0.00025324256,0.99382985,0.0009802949,0.00030529156,0.00020080403,0.000013669913,0.00021652537,0.0035584052],"genre_scores_gemma":[0.969625,0.000008088316,0.02951682,0.00035864144,0.00008659174,0.00007882395,0.000039245067,0.000004410387,0.00028236545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992923,0.000058545374,0.00016862871,0.00011828006,0.00010593951,0.0002562933],"domain_scores_gemma":[0.9989848,0.00033180893,0.000051681087,0.00037785407,0.00016269005,0.000091128095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004395688,0.00008272183,0.00010796644,0.000042144493,0.00029366722,0.00008370537,0.00045798163,0.000028476195,0.000015586385],"category_scores_gemma":[0.000038494316,0.00007323102,0.000052706037,0.00018497527,0.000026278227,0.00029407698,0.000119869546,0.00004702638,0.000025274796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002461354,0.000020262063,0.00078423246,0.000023863055,0.000007648569,7.496936e-8,0.00010645315,0.00010466843,0.00020343918,0.99087405,0.0067917197,0.0010811237],"study_design_scores_gemma":[0.0005491484,0.000024770266,0.00344034,0.00006410879,0.000005703552,0.0000035733774,0.00015435368,0.93908256,0.0023148083,0.0001068028,0.054040674,0.00021313106],"about_ca_topic_score_codex":0.0000047302997,"about_ca_topic_score_gemma":0.0000054143284,"teacher_disagreement_score":0.99076724,"about_ca_system_score_codex":0.000111206995,"about_ca_system_score_gemma":0.000056085355,"threshold_uncertainty_score":0.29862744},"labels":[],"label_agreement":null},{"id":"W2537496845","doi":"10.1109/lcomm.2016.2619706","title":"Generic Linear Network Code Construction Using Transversal Matroids","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Matroid; Transversal (combinatorics); Linear network coding; Code (set theory); Computer science; Dual code; Algorithm; Representation (politics); Systematic code; Matrix (chemical analysis); Coding (social sciences); Theoretical computer science; Independence (probability theory); Discrete mathematics; Mathematics; Low-density parity-check code; Decoding methods; Programming language","score_opus":0.07720417784015142,"score_gpt":0.2965778877077936,"score_spread":0.21937370986764215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537496845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026939739,0.00061151735,0.9418839,0.029173627,0.0005060265,0.00017503444,0.0000053550957,0.00028658388,0.00041819346],"genre_scores_gemma":[0.582059,0.0019634448,0.4132189,0.0024859228,0.00017110833,0.000029013667,0.0000052134947,0.000020118934,0.000047271955],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998347,0.00047787902,0.00036883823,0.0002913644,0.0001792824,0.000335674],"domain_scores_gemma":[0.9960309,0.00029941826,0.0001511866,0.003294731,0.00012613558,0.00009759333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003629533,0.00017717826,0.00018302821,0.000114114104,0.000726724,0.00009878991,0.0030211331,0.00006058041,0.00002403493],"category_scores_gemma":[0.000021125188,0.00015011909,0.00010175805,0.0007062135,0.00036322974,0.0005876408,0.00045907355,0.0002096804,0.000069728034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021421843,0.00015775832,0.0031520964,0.00001215588,0.0001811726,0.000005450587,0.0011706643,0.010211625,0.6125661,0.12258719,0.016731681,0.23320267],"study_design_scores_gemma":[0.0027552445,0.000101446116,0.0024462002,0.0004438393,0.00009736264,0.00023868047,0.00007538169,0.69497484,0.010255451,0.0016048502,0.2853107,0.0016960283],"about_ca_topic_score_codex":0.000007664015,"about_ca_topic_score_gemma":0.000041410305,"teacher_disagreement_score":0.6847632,"about_ca_system_score_codex":0.00015680863,"about_ca_system_score_gemma":0.000070430855,"threshold_uncertainty_score":0.61216784},"labels":[],"label_agreement":null},{"id":"W2539674285","doi":"10.1109/acssc.2012.6489391","title":"A total power minimization approach to relay selection for two-way relay networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Relay channel; Transceiver; Link Access Procedure for Frame Relay; Computer science; Selection (genetic algorithm); Computer network; Power (physics); Signal-to-noise ratio (imaging); Telecommunications; Wireless; Artificial intelligence","score_opus":0.03164062361634309,"score_gpt":0.27693687514182097,"score_spread":0.24529625152547788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539674285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033221822,0.00016728377,0.97841656,0.0005946978,0.00042536686,0.00045699746,2.7821147e-7,0.00020965401,0.016406963],"genre_scores_gemma":[0.7619052,0.00001536119,0.23453937,0.00076445326,0.00016218751,0.000114250906,0.0000085216925,0.000011479523,0.0024791695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989268,0.00011912655,0.00021591406,0.00026403146,0.00012513256,0.0003489843],"domain_scores_gemma":[0.99906766,0.000113969516,0.000058848207,0.00043355732,0.00017020988,0.00015572821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004907419,0.00012748582,0.000121952464,0.00009265436,0.00029085233,0.00013045773,0.0004046923,0.00006427165,0.000031624393],"category_scores_gemma":[0.00006343863,0.00011461542,0.00005840571,0.0007214588,0.000012116519,0.0006104502,0.00022791374,0.00012407971,0.000029164714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004090571,0.00044706723,0.0018441445,0.0000066294115,0.00004460294,6.1190775e-8,0.0039570318,0.22143838,0.0007521085,0.66433364,0.053485777,0.053649675],"study_design_scores_gemma":[0.00031193165,0.0000695619,0.001359906,0.000007393437,0.00000464305,0.000011326406,0.00002472943,0.9811839,0.00025100968,0.000014099424,0.016566338,0.00019518012],"about_ca_topic_score_codex":0.000003338023,"about_ca_topic_score_gemma":0.00000791786,"teacher_disagreement_score":0.7597455,"about_ca_system_score_codex":0.000073417854,"about_ca_system_score_gemma":0.000021049602,"threshold_uncertainty_score":0.4673881},"labels":[],"label_agreement":null},{"id":"W2540504585","doi":"10.1109/acssc.2011.6189949","title":"Correcting erasure bursts with minimum decoding delay","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Erasure; Computer science; Erasure code; Decoding methods; Tornado code; Online codes; Interleaving; Fountain code; Block code; Algorithm; Network packet; Coding (social sciences); Concatenated error correction code; Computer network; Mathematics; Statistics","score_opus":0.06722699874559915,"score_gpt":0.2577962096297761,"score_spread":0.19056921088417697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540504585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06588672,0.0001769995,0.84688836,0.0002291683,0.00020205989,0.000093449984,6.9060135e-8,0.00027367956,0.08624949],"genre_scores_gemma":[0.89189553,0.00003122736,0.106859855,0.00040445107,0.000022170318,0.0000076104793,3.681889e-7,0.000006370635,0.000772425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992532,0.000067911045,0.00013571527,0.00022665708,0.00011691622,0.0001995908],"domain_scores_gemma":[0.99911267,0.00008633849,0.00005453858,0.0005463968,0.00012514177,0.00007490856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024422025,0.000102169965,0.00009790661,0.000058984577,0.00023621994,0.00008982984,0.0007459679,0.00002782554,0.0001368262],"category_scores_gemma":[0.000025476316,0.00007743505,0.00002470909,0.00037644256,0.000026115767,0.0003648429,0.00024976212,0.00013184866,0.00005177106],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021868535,0.00012045551,0.021872226,0.0000064522205,0.000052132316,0.000034619694,0.012313559,0.00004818504,0.0007672776,0.10666672,0.0026572424,0.85543925],"study_design_scores_gemma":[0.003730761,0.0013826118,0.041261293,0.0006370494,0.00005798019,0.001569012,0.0026288335,0.8579864,0.061936766,0.0021087634,0.023365919,0.0033346072],"about_ca_topic_score_codex":0.0000105696745,"about_ca_topic_score_gemma":0.00015691576,"teacher_disagreement_score":0.85793823,"about_ca_system_score_codex":0.000022446253,"about_ca_system_score_gemma":0.000039087783,"threshold_uncertainty_score":0.31577095},"labels":[],"label_agreement":null},{"id":"W2541282732","doi":"10.1109/icscs.2009.5412687","title":"Outage analysis of general asynchronous OFDM amplify-and-forward cooperative networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orthogonal frequency-division multiplexing; Asynchronous communication; Computer science; Synchronization (alternating current); Relay; Multiplexing; Computer network; Channel (broadcasting); Electronic engineering; Telecommunications; Engineering; Physics","score_opus":0.021182785750472114,"score_gpt":0.28148257195443094,"score_spread":0.2602997862039588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541282732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019300058,0.00058822834,0.9695862,0.0008414504,0.000049102167,0.00011171472,0.0000015433485,0.00008899185,0.00943274],"genre_scores_gemma":[0.98100346,0.00083925435,0.016140828,0.0014194811,0.000030156532,0.0000041190888,0.000012303403,0.0000033921772,0.00054702064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890715,0.00014556806,0.00030754108,0.00029294105,0.0001412782,0.00020550822],"domain_scores_gemma":[0.99886554,0.00010587695,0.00009563333,0.000669525,0.00016708796,0.0000963391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002872201,0.0001404763,0.00034823944,0.00020997235,0.00015892544,0.0001162674,0.0006321796,0.000058343707,0.000096331176],"category_scores_gemma":[0.000022758462,0.00011727145,0.00009605326,0.0014140868,0.00005835852,0.0002546832,0.00023527684,0.00014605351,0.000004323942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010395914,0.00013078665,0.0017550574,0.0000018485996,0.00051894225,0.0000034366192,0.0011680888,0.06611308,0.001003735,0.71847886,0.0011059798,0.20970976],"study_design_scores_gemma":[0.00019772771,0.000112148526,0.021864425,0.0000051927286,0.0000752968,0.0000015354432,0.00001825847,0.97629577,0.00027922794,0.000112792426,0.000874771,0.00016282794],"about_ca_topic_score_codex":0.000013179491,"about_ca_topic_score_gemma":0.000085534055,"teacher_disagreement_score":0.96170336,"about_ca_system_score_codex":0.000027760576,"about_ca_system_score_gemma":0.000031681582,"threshold_uncertainty_score":0.4782191},"labels":[],"label_agreement":null},{"id":"W2541979517","doi":"10.1016/j.ffa.2017.04.007","title":"Matroidal structure of skew polynomial rings with application to network coding","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Matroid; Mathematics; Discrete mathematics; Combinatorics; Finite field; Matroid partitioning; Vector space; Pure mathematics; Graphic matroid","score_opus":0.013737985695262056,"score_gpt":0.24933133949012695,"score_spread":0.2355933537948649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541979517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00810649,0.00011901678,0.9873439,0.0021175027,0.000027198168,0.0003606066,0.0000144141195,0.000042587526,0.00186829],"genre_scores_gemma":[0.97667533,0.000097997305,0.022658024,0.0002812104,0.00011990132,0.00008569193,0.0000086736245,0.0000064156893,0.00006674789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938935,0.00001828537,0.0001534046,0.00023440016,0.00006279239,0.0001417531],"domain_scores_gemma":[0.9984897,0.00010329747,0.00015369756,0.0010890977,0.00008853185,0.00007570727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084528605,0.00010545167,0.00013825469,0.000038086047,0.0006979561,0.00016650706,0.0008739082,0.000054398533,0.000008013231],"category_scores_gemma":[0.000011445341,0.0000833314,0.000023983719,0.00014927886,0.000058662976,0.00015417098,0.00039362008,0.00012882601,0.000004163133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002464269,0.000045823195,0.0034498405,0.000027830187,0.0000461458,2.2332021e-7,0.0017571994,0.00088989997,0.0076263794,0.68027735,0.0010453244,0.30480936],"study_design_scores_gemma":[0.002616369,0.00077505194,0.11470324,0.00044683678,0.00006983485,0.00004904067,0.00020870718,0.1937757,0.018866057,0.0707856,0.5956723,0.0020312837],"about_ca_topic_score_codex":0.000017082217,"about_ca_topic_score_gemma":0.00012935032,"teacher_disagreement_score":0.96856886,"about_ca_system_score_codex":0.0000080686395,"about_ca_system_score_gemma":0.000024078105,"threshold_uncertainty_score":0.53681844},"labels":[],"label_agreement":null},{"id":"W2542048154","doi":"10.1109/camap.2005.1574181","title":"Distributed Space-Time Block Coding for Cooperative Networks with Multiple-Antenna Nodes","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Space–time block code; Relay; Node (physics); Block code; Space–time code; Computer science; Coding (social sciences); Diversity gain; Block (permutation group theory); Antenna (radio); Topology (electrical circuits); Decoding methods; Mathematics; MIMO; Algorithm; Beamforming; Combinatorics; Telecommunications; Physics; Power (physics)","score_opus":0.018146512773859483,"score_gpt":0.24017995055235603,"score_spread":0.22203343777849655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2542048154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033518793,0.00024059873,0.99199754,0.0019387755,0.00006656835,0.00047641926,0.000011083716,0.00033451317,0.0015826365],"genre_scores_gemma":[0.94961244,0.00006236069,0.04802812,0.00029745183,0.000100382764,0.00007737555,0.000073917065,0.000016145064,0.0017318263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987193,0.00009847288,0.0002550936,0.00039608357,0.0001447324,0.00038631493],"domain_scores_gemma":[0.9982157,0.00057606056,0.00009767435,0.0005996092,0.000431026,0.00007997081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002382689,0.00022093933,0.00025279867,0.00005995864,0.00052674644,0.00032571505,0.00072891783,0.000058686022,0.000024232984],"category_scores_gemma":[0.00005517747,0.00016670312,0.00006423855,0.00057891104,0.00008438682,0.00035467802,0.00025716698,0.00014586723,0.000018675244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028599525,0.0006941989,0.009400983,0.000029788282,0.0002591012,0.000022801602,0.0005774339,0.33780468,0.021798592,0.56499654,0.054417726,0.009712176],"study_design_scores_gemma":[0.0009836266,0.00009447952,0.0013948542,0.000043519096,0.000008546048,0.000009637421,0.00001973968,0.989994,0.0012338136,0.000052538937,0.0058785635,0.00028671266],"about_ca_topic_score_codex":0.000018720753,"about_ca_topic_score_gemma":0.00019010945,"teacher_disagreement_score":0.9462605,"about_ca_system_score_codex":0.000058809266,"about_ca_system_score_gemma":0.000050406168,"threshold_uncertainty_score":0.6797956},"labels":[],"label_agreement":null},{"id":"W2542943474","doi":"10.1109/allerton.2008.4797540","title":"Diversity-multiplexing tradeoff in multiple-relay network-part I: Proposed scheme and single-antenna networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Multiplexing; Fading; Computer network; Antenna (radio); Transmission (telecommunications); Relay channel; Topology (electrical circuits); Electronic engineering; Telecommunications; Channel (broadcasting); Engineering; Electrical engineering; Physics","score_opus":0.09002670441454765,"score_gpt":0.2375458521423179,"score_spread":0.14751914772777025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2542943474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2832087,0.002237672,0.70801365,0.0019555383,0.0004912613,0.0006644862,6.816629e-7,0.0005064542,0.0029215578],"genre_scores_gemma":[0.9624059,0.0012332248,0.035191353,0.0006006563,0.00012173175,0.0000073131755,0.000004113769,0.000011655389,0.0004240381],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820334,0.00022768539,0.00035435488,0.00048903766,0.00021344057,0.00051212515],"domain_scores_gemma":[0.99871826,0.0003310428,0.00009456261,0.0006146263,0.00008660377,0.00015493238],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00044127522,0.00022040147,0.00027331605,0.00011515589,0.0015331748,0.00008514468,0.00089992216,0.000102377715,0.000027090688],"category_scores_gemma":[0.00007918677,0.0002076468,0.0000611151,0.0007974947,0.00017298198,0.00061759347,0.002603195,0.0003879575,0.000008104936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013053289,0.00084714754,0.8490561,0.000026870413,0.00011639853,0.00023005599,0.012387773,0.026930999,0.004093725,0.040785514,0.005771586,0.059623286],"study_design_scores_gemma":[0.0011317234,0.000062961706,0.026818387,0.000071450326,0.000002286911,0.000035696175,0.000031729167,0.9680974,0.00008799714,0.00004516869,0.0033001727,0.00031503278],"about_ca_topic_score_codex":0.000026822769,"about_ca_topic_score_gemma":0.00040890483,"teacher_disagreement_score":0.9411664,"about_ca_system_score_codex":0.00006953681,"about_ca_system_score_gemma":0.00003465605,"threshold_uncertainty_score":0.9997667},"labels":[],"label_agreement":null},{"id":"W2543050020","doi":"10.1109/allerton.2008.4797703","title":"Adversarial error correction for network coding: Models and metrics","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Subspace topology; Linear network coding; Error detection and correction; Computer science; Algorithm; Metric (unit); Coding (social sciences); Theoretical computer science; Decoding methods; Constant-weight code; Network topology; Topology (electrical circuits); Concatenated error correction code; Block code; Mathematics; Computer network; Artificial intelligence; Statistics","score_opus":0.1241633182446614,"score_gpt":0.30007010985008686,"score_spread":0.17590679160542547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543050020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008345489,0.00036082813,0.9911473,0.00049934856,0.0009017625,0.00017856185,2.5694274e-7,0.00012857416,0.0059488406],"genre_scores_gemma":[0.9068348,0.0010837025,0.08972234,0.00048049242,0.0001558228,0.000020318612,0.0000021936223,0.0000051606257,0.001695187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939424,0.000044110457,0.00013044101,0.00018864968,0.0000885766,0.0001540087],"domain_scores_gemma":[0.9992529,0.00026214603,0.000042552398,0.00026680777,0.00011820464,0.000057398753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023372447,0.000073592266,0.00010072789,0.000061114704,0.00045542076,0.00005240477,0.00029289324,0.00003683963,0.0000067556352],"category_scores_gemma":[0.000056853623,0.000067886955,0.000032929005,0.00046227986,0.000030341074,0.00038013924,0.00019755651,0.00007093335,0.0000027042654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039350412,0.00006571343,0.0006136323,0.000005797472,0.00003321518,0.0000018280052,0.0015403094,0.035185028,0.00008514343,0.6989652,0.1452677,0.11819706],"study_design_scores_gemma":[0.00032905588,0.000047197325,0.00019166624,0.0000047534018,0.0000026855068,0.000012587601,0.000009517812,0.9843563,0.0000653945,0.0015629039,0.013323602,0.00009432903],"about_ca_topic_score_codex":0.0000040350537,"about_ca_topic_score_gemma":0.000015081089,"teacher_disagreement_score":0.9491713,"about_ca_system_score_codex":0.000024902047,"about_ca_system_score_gemma":0.000034396206,"threshold_uncertainty_score":0.35027742},"labels":[],"label_agreement":null},{"id":"W2543619353","doi":"10.1109/acssc.2011.6190210","title":"Beamforming in MIMO broadcast relay networks with multiple antenna users","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Relay; Beamforming; Computer science; Precoding; Antenna (radio); Base station; Relay channel; Algorithm; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.04617026629061073,"score_gpt":0.23919048699064507,"score_spread":0.19302022070003433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543619353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03704868,0.00031206687,0.94880384,0.00019367019,0.00009974787,0.00016486332,1.1312011e-7,0.00016131121,0.013215714],"genre_scores_gemma":[0.8974848,0.00028268417,0.10140133,0.00041017015,0.000014737265,0.000013309904,0.0000010433205,0.000007957666,0.00038398308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911904,0.00006988649,0.00019170111,0.0002505587,0.00009885123,0.00026998227],"domain_scores_gemma":[0.99909365,0.00008337956,0.000052782412,0.00063277566,0.00006340092,0.000074005795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002514769,0.00011777024,0.00012469532,0.00009783389,0.00012520108,0.000060561175,0.00080206135,0.000040657458,0.000046751713],"category_scores_gemma":[0.000018657376,0.00009084155,0.000025982023,0.0006049243,0.0000445656,0.00052684336,0.0003202368,0.00020336587,0.000018308994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018245821,0.0006639065,0.39492288,0.000016471155,0.00008603653,0.00012256873,0.026271915,0.0118166115,0.0009876693,0.108186975,0.0014996658,0.45524284],"study_design_scores_gemma":[0.00059192284,0.0000845064,0.025078796,0.00006914812,0.0000017846901,0.000015974814,0.00015724244,0.9705738,0.00019436043,0.000027867565,0.0029726257,0.00023197458],"about_ca_topic_score_codex":0.00007695552,"about_ca_topic_score_gemma":0.0011680237,"teacher_disagreement_score":0.95875716,"about_ca_system_score_codex":0.000032405536,"about_ca_system_score_gemma":0.000026777436,"threshold_uncertainty_score":0.3704411},"labels":[],"label_agreement":null},{"id":"W2544361486","doi":"10.1109/allerton.2008.4797541","title":"Diversity-multiplexing tradeoff in multiple-relay network-part II: Multiple-antenna networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; MIMO; Rayleigh fading; Relay channel; Computer science; Multiplexing; Diversity gain; Topology (electrical circuits); Antenna (radio); Cooperative MIMO; Transmission (telecommunications); Fading; Computer network; Electronic engineering; Channel (broadcasting); Telecommunications; 3G MIMO; Mathematics; Engineering; Physics","score_opus":0.07939680573497047,"score_gpt":0.24682570543822144,"score_spread":0.16742889970325098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544361486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17757979,0.0017529109,0.81197584,0.0019347369,0.0012431837,0.0007323848,0.000002011032,0.0008300095,0.00394913],"genre_scores_gemma":[0.976494,0.0021342023,0.018525314,0.0012778313,0.00026660913,0.00002883501,0.000012428081,0.000021426938,0.0012393196],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970357,0.00037236742,0.00061155204,0.00072061457,0.00036957508,0.00089022366],"domain_scores_gemma":[0.99743736,0.0008227228,0.00015760223,0.0012033366,0.00013880532,0.00024020391],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00069705123,0.00035723945,0.00043097575,0.00019864894,0.0038122789,0.00007562581,0.002201007,0.00017019523,0.000092589034],"category_scores_gemma":[0.00018272617,0.00034845734,0.00017660523,0.0014220901,0.00017783098,0.00087927014,0.0056617414,0.0006882849,0.00003719516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009296678,0.0006356306,0.6974042,0.000009766347,0.00009680405,0.00019434432,0.010644169,0.22075424,0.00026007416,0.024481433,0.017821778,0.027604619],"study_design_scores_gemma":[0.0015610121,0.0000625438,0.049820714,0.0000699177,0.0000034864936,0.000034019686,0.000036273952,0.9356018,0.000033548495,0.00004223815,0.012284216,0.00045025043],"about_ca_topic_score_codex":0.00009610042,"about_ca_topic_score_gemma":0.0015868361,"teacher_disagreement_score":0.79891425,"about_ca_system_score_codex":0.0001357264,"about_ca_system_score_gemma":0.000063606036,"threshold_uncertainty_score":0.99989676},"labels":[],"label_agreement":null},{"id":"W2546190674","doi":"10.1109/glocom.2016.7842079","title":"Optimal Control for Network Coding Broadcast","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Multicast; Markov decision process; Computer network; Network packet; Coding (social sciences); Intuition; Computational complexity theory; Markov process; Distributed computing; Scheduling (production processes); Algorithm; Mathematical optimization","score_opus":0.03744334014911874,"score_gpt":0.27895086557031706,"score_spread":0.24150752542119833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546190674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029597638,0.00022580517,0.98895943,0.005762684,0.00021357201,0.00019123282,0.0000010508707,0.00016472067,0.004185501],"genre_scores_gemma":[0.8821009,0.0002082637,0.113799445,0.0012625504,0.00019617256,0.00004857278,4.6360626e-7,0.000006238177,0.0023774004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927664,0.00005637161,0.00014873936,0.00019436437,0.00007296716,0.00025093456],"domain_scores_gemma":[0.99884206,0.000489131,0.00004267046,0.0004520398,0.000109784516,0.00006432997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003408167,0.000080086254,0.00010726812,0.000023618237,0.0002164036,0.00009015391,0.00068664306,0.000025929074,0.000073309464],"category_scores_gemma":[0.00005346629,0.000050527695,0.000054979228,0.00014075014,0.000026718913,0.00027318756,0.00017130536,0.000034105193,0.00004787365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009726317,0.000012010123,0.00018598294,0.0000012266029,0.000013254505,3.833582e-7,0.000051758267,0.00034578954,0.0016565729,0.64893043,0.018808484,0.3299844],"study_design_scores_gemma":[0.003131248,0.00016850964,0.00083840074,0.00008913287,0.00000753766,0.000009302628,0.0000086244545,0.47754332,0.0014034229,0.002233419,0.5141606,0.00040649876],"about_ca_topic_score_codex":3.5855638e-7,"about_ca_topic_score_gemma":0.0000038013525,"teacher_disagreement_score":0.88180494,"about_ca_system_score_codex":0.000025060714,"about_ca_system_score_gemma":0.000026297947,"threshold_uncertainty_score":0.20604597},"labels":[],"label_agreement":null},{"id":"W2546297967","doi":"10.1109/acssc.2012.6489065","title":"Power control for two-way relay networks under per-node power constraint","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Ontario Tech University","funders":"","keywords":"Relay; Node (physics); Constraint (computer-aided design); Power control; Computer science; Power (physics); Signal-to-noise ratio (imaging); Outage probability; Control theory (sociology); Mathematical optimization; Power network; Control (management); Electric power system; Mathematics; Engineering; Telecommunications","score_opus":0.031036644336015027,"score_gpt":0.28802605441951284,"score_spread":0.2569894100834978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546297967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009924343,0.0012102075,0.9535583,0.0040803323,0.0007209992,0.00036197735,0.0000016380934,0.00019674607,0.038877327],"genre_scores_gemma":[0.9664099,0.000046075904,0.024881417,0.007060335,0.000105042425,0.00003464859,0.0000030205385,0.000014707933,0.0014448414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860144,0.00016009559,0.00028044882,0.00026895432,0.00014777626,0.00054129196],"domain_scores_gemma":[0.99820364,0.00047701105,0.00008094411,0.00084448105,0.00018933183,0.00020460588],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078384776,0.00018305634,0.00020797894,0.000056081793,0.00029422596,0.00016273264,0.0007784438,0.00007719785,0.0010086336],"category_scores_gemma":[0.000043681714,0.00014948043,0.00012307866,0.00018363007,0.00009281106,0.00048711075,0.00024200602,0.00021030947,0.000093346265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013355698,0.0001143471,0.0005162203,0.0000013317011,0.00005145727,3.8372576e-7,0.0006904843,0.003626569,0.00033867624,0.97658944,0.008986574,0.009071172],"study_design_scores_gemma":[0.00501396,0.00021951873,0.006508466,0.000049007547,0.000028147135,0.000054103017,0.00037585548,0.7640046,0.0002466767,0.0011912186,0.22122335,0.0010850996],"about_ca_topic_score_codex":0.0000019955744,"about_ca_topic_score_gemma":0.0000092391265,"teacher_disagreement_score":0.9753982,"about_ca_system_score_codex":0.000060742725,"about_ca_system_score_gemma":0.00004372804,"threshold_uncertainty_score":0.9999046},"labels":[],"label_agreement":null},{"id":"W2546712194","doi":"10.1007/978-3-319-47726-8_2","title":"Related Works on Cooperative Wireless Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; IBM (Canada); University of New Brunswick","funders":"","keywords":"Computer science; Computer network; Cooperative diversity; Wireless network; Wireless; Relay; Physical layer; MIMO; Network packet; Diversity gain; Schedule; Channel (broadcasting); Distributed computing; Telecommunications; Power (physics)","score_opus":0.024000102598550798,"score_gpt":0.2438584181203916,"score_spread":0.21985831552184082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546712194","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033554526,0.006437808,0.4935254,0.0015855688,0.0027168961,0.0009648256,0.000009826519,0.00097412424,0.493752],"genre_scores_gemma":[0.398809,0.058244932,0.0005097812,0.003269973,0.0022143056,0.00018575507,0.00018812281,0.00043721296,0.5361409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943797,0.00041426756,0.0013540394,0.0018755136,0.0007569644,0.0012195252],"domain_scores_gemma":[0.99322575,0.0011189439,0.00091633695,0.0036016742,0.0006287406,0.0005085688],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.00079446455,0.0014207177,0.0014349672,0.00037264096,0.0009631349,0.00072117615,0.0039545665,0.0017698309,0.00064802356],"category_scores_gemma":[0.00002629161,0.0012009228,0.0005130484,0.0004768291,0.00048197992,0.00064175285,0.0016877668,0.003280448,0.000624934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040148858,0.000038752474,0.0000040100804,0.0000057371876,0.00018931384,0.00005988134,0.00011141225,0.008539087,0.0000036447382,0.6171095,0.010588395,0.36331013],"study_design_scores_gemma":[0.0018134294,0.00036052312,0.00003436815,0.006014081,0.00008071149,0.000050767463,0.000008275143,0.8516768,0.00001609339,0.004656344,0.13262573,0.002662872],"about_ca_topic_score_codex":0.0000015844586,"about_ca_topic_score_gemma":0.000048166832,"teacher_disagreement_score":0.84313774,"about_ca_system_score_codex":0.000465953,"about_ca_system_score_gemma":0.00023037537,"threshold_uncertainty_score":0.99985427},"labels":[],"label_agreement":null},{"id":"W2546754593","doi":"10.1007/978-3-319-47726-8","title":"Protocol Design and Analysis for Cooperative Wireless Networks","year":2016,"lang":"en","type":"book","venue":"Wireless networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; IBM (Canada); University of New Brunswick","funders":"","keywords":"Computer network; Computer science; Wireless network; Access control; Wireless; Protocol design; Layer (electronics); Media access control; Protocol (science); Telecommunications; Communications protocol; Chemistry; Medicine","score_opus":0.044545794317554545,"score_gpt":0.29490618796387974,"score_spread":0.2503603936463252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546754593","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010531978,0.00066512986,0.93942446,0.00032317033,0.00028905098,0.050896484,0.00001360523,0.00032295118,0.0080641],"genre_scores_gemma":[0.010286669,0.0070551457,0.04157605,0.002670655,0.0039053115,0.38907334,0.00054423086,0.000503047,0.54438555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557453,0.000697942,0.0009473585,0.0014823691,0.0003858241,0.0009119993],"domain_scores_gemma":[0.99429864,0.0018603513,0.0007400468,0.0019817965,0.0007695423,0.00034964716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012589963,0.00091878435,0.0014509712,0.0004156856,0.0008606636,0.00071490026,0.0023533474,0.00083823147,0.000060899587],"category_scores_gemma":[0.00002842628,0.0007461101,0.00043432412,0.0009964473,0.0003363452,0.0004683443,0.0011653795,0.00087809307,0.000011569734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025345772,0.00012283163,0.00008449642,0.000102169855,0.0025394296,0.00002069152,0.00037388736,0.091312855,0.000010975014,0.22697048,0.10245595,0.5757528],"study_design_scores_gemma":[0.0011955675,0.00018885193,0.0000342108,0.00044937772,0.00024158112,0.000005430224,0.0000025331544,0.90075415,0.00001068531,0.00066799624,0.095517404,0.00093223137],"about_ca_topic_score_codex":0.000001337094,"about_ca_topic_score_gemma":0.000042386186,"teacher_disagreement_score":0.8978484,"about_ca_system_score_codex":0.00030367106,"about_ca_system_score_gemma":0.00048110602,"threshold_uncertainty_score":0.99949896},"labels":[],"label_agreement":null},{"id":"W2546863732","doi":"","title":"Area spectral efficiency of cooperative network with DF and AF relaying","year":2012,"lang":"en","type":"article","venue":"Asia-Pacific Signal and Information Processing Association Annual Summit and Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Spectral efficiency; Path loss; Computer science; Transmission (telecommunications); Fading; Reliability (semiconductor); Computer network; Node (physics); Path (computing); Metric (unit); Electronic engineering; Decoding methods; Power (physics); Telecommunications; Wireless; Engineering; Channel (broadcasting); Physics","score_opus":0.014270976812612543,"score_gpt":0.2215086118067929,"score_spread":0.20723763499418035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546863732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4655177,0.004628158,0.47164613,0.0030978334,0.00020875157,0.0006466571,0.000021910675,0.00025611126,0.053976744],"genre_scores_gemma":[0.9973023,0.0005566721,0.0017745672,0.00015248136,0.000031546093,0.000011052548,0.000011809782,0.0000032180208,0.00015637562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892586,0.000089666806,0.00032970266,0.00013808007,0.00024626334,0.0002704166],"domain_scores_gemma":[0.99876356,0.00011836668,0.00036906422,0.000102880156,0.000530744,0.0001153931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006195005,0.00015013601,0.00020358374,0.00008196309,0.00047108476,0.00042736522,0.0001476157,0.00007649258,0.000016345975],"category_scores_gemma":[0.000059175247,0.00012126036,0.000014957721,0.00041565605,0.00009185356,0.005384777,0.000106031825,0.00017919567,0.0000030046838],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095356496,0.00014211115,0.25574332,0.00015568615,0.00010232595,6.01591e-7,0.07114075,0.00020913203,0.00028235163,0.17450812,0.0018187353,0.4958015],"study_design_scores_gemma":[0.0051147304,0.0016386664,0.43273783,0.0016055421,0.0001738884,0.000067718065,0.07085726,0.43425405,0.004167797,0.0019194974,0.04477401,0.002688997],"about_ca_topic_score_codex":0.000004103103,"about_ca_topic_score_gemma":0.000006218946,"teacher_disagreement_score":0.5317846,"about_ca_system_score_codex":0.00003800327,"about_ca_system_score_gemma":0.000092667964,"threshold_uncertainty_score":0.49448538},"labels":[],"label_agreement":null},{"id":"W2546907076","doi":"10.1007/978-3-319-47726-8_6","title":"Diversity Relaying with Spatially Random Mobile Relays","year":2016,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; IBM (Canada); University of New Brunswick","funders":"","keywords":"Computer science; Aloha; A priori and a posteriori; Outage probability; Cooperative diversity; Timer; Wireless; Fading; Wireless network; Computer network; Diversity (politics); Random access; Upper and lower bounds; Throughput; Algorithm; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.02042717658406599,"score_gpt":0.21752230016245008,"score_spread":0.1970951235783841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546907076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007236947,0.002177185,0.69884765,0.0002493129,0.00048438853,0.00071351184,0.0000035657301,0.00035352382,0.2970985],"genre_scores_gemma":[0.5533199,0.023975234,0.0039107017,0.0010007832,0.0011879456,0.00017171717,0.00004090379,0.00017987427,0.41621295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978115,0.00011234953,0.00040715004,0.00076915475,0.00045207914,0.0004477952],"domain_scores_gemma":[0.9969756,0.00040650181,0.00042363416,0.0017246474,0.00027668598,0.00019293147],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00041727183,0.0005048272,0.00061860285,0.00013483028,0.001529051,0.00014327072,0.0021879163,0.00040846027,0.00018279422],"category_scores_gemma":[0.0000066791667,0.00038700103,0.00018690003,0.000117018935,0.00019125771,0.00036256216,0.0044142655,0.0008694117,0.00009855269],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014406934,0.000026689615,0.0001652621,0.000016442651,0.0002104688,0.00009856456,0.0006983651,0.003616724,0.0000053579397,0.5842286,0.0029260605,0.4078634],"study_design_scores_gemma":[0.009442226,0.00080749753,0.00017847879,0.0053595267,0.00026421316,0.00012675872,0.000014356034,0.3388357,0.000025321024,0.007588125,0.6331193,0.004238525],"about_ca_topic_score_codex":0.000003896022,"about_ca_topic_score_gemma":0.00010748483,"teacher_disagreement_score":0.69493693,"about_ca_system_score_codex":0.00016734011,"about_ca_system_score_gemma":0.00011514439,"threshold_uncertainty_score":0.9998582},"labels":[],"label_agreement":null},{"id":"W2547056635","doi":"10.1109/ccece.2016.7726607","title":"Selective decode-and-forward two-way relay network with weighted decision-feedback differential coherent detectors","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Differential (mechanical device); Fading; Detector; Computer science; Differential coding; Modulation (music); SIGNAL (programming language); Phase-shift keying; Relay channel; Signal-to-noise ratio (imaging); Electronic engineering; Decoding methods; Topology (electrical circuits); Computer network; Algorithm; Bit error rate; Telecommunications; Physics; Engineering; Electrical engineering","score_opus":0.012732754778701602,"score_gpt":0.24346948574259586,"score_spread":0.23073673096389424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547056635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21434268,0.00020008993,0.7820837,0.00056204933,0.00021071467,0.0002367453,7.3635385e-7,0.00020766526,0.0021556085],"genre_scores_gemma":[0.9588822,0.00047626923,0.03945213,0.00021458647,0.00010570347,0.000039584207,0.0000010521194,0.000018196797,0.00081027887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981803,0.00021525493,0.00031365093,0.0005523659,0.00030315772,0.00043521615],"domain_scores_gemma":[0.9978516,0.0007577075,0.000116002215,0.000821707,0.00023676906,0.00021621733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002442101,0.00026038176,0.00027666125,0.00008774486,0.0003956589,0.0001802629,0.0008480752,0.00006873825,0.00028708807],"category_scores_gemma":[0.000032713604,0.00014055222,0.00006310166,0.0006123375,0.00010841794,0.00038981508,0.0006570965,0.00018550245,0.00008127297],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017473593,0.0000936682,0.019979272,0.0000033655936,0.00015525894,0.0000052787223,0.00035151702,0.00012287412,0.001567447,0.050500616,0.0056441505,0.9214018],"study_design_scores_gemma":[0.023802783,0.0031466687,0.3303017,0.0021607752,0.00019381769,0.00021568565,0.0000901907,0.52688146,0.03308262,0.025190216,0.04979552,0.0051385644],"about_ca_topic_score_codex":0.000010300358,"about_ca_topic_score_gemma":0.000636712,"teacher_disagreement_score":0.9162632,"about_ca_system_score_codex":0.000097582575,"about_ca_system_score_gemma":0.00006426983,"threshold_uncertainty_score":0.57315534},"labels":[],"label_agreement":null},{"id":"W2547088953","doi":"10.1109/ccece.2016.7726611","title":"On the imperfection of channel estimation, relay's forwarding policy and destination's knowledge of signal presence","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Channel (broadcasting); Imperfect; Node (physics); Spell; SIGNAL (programming language); Symbol (formal); Relay channel; Maximal-ratio combining; Signal-to-noise ratio (imaging); Telecommunications; Computer network; Algorithm; Fading; Engineering","score_opus":0.02987705784071693,"score_gpt":0.2904530697066506,"score_spread":0.26057601186593365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547088953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035333157,0.0000973308,0.956699,0.0033868435,0.000033336706,0.00012262478,4.62929e-7,0.000030032681,0.0042971913],"genre_scores_gemma":[0.9964965,0.0001335249,0.0029679225,0.000040845196,0.000016404398,0.00001042403,1.4253644e-7,0.0000024843212,0.00033177694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945545,0.00012333914,0.00015097296,0.00011215278,0.00008197077,0.0000760918],"domain_scores_gemma":[0.9981179,0.0012554873,0.0000919604,0.0002903056,0.0002205391,0.000023755381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004372553,0.00005557286,0.00007502567,0.00010061146,0.00012619194,0.000019174067,0.00031472175,0.000019451478,0.000014486674],"category_scores_gemma":[0.00060043455,0.00003001546,0.000021068225,0.00036641498,0.00007756675,0.00024204586,0.00019060551,0.000037143556,0.0000036527601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003170262,0.00002576258,0.00008261329,0.0000060999264,0.0000057550233,2.3215193e-8,0.0008354687,0.0002799806,0.006211506,0.8302211,0.0002903556,0.16203818],"study_design_scores_gemma":[0.0003843242,0.00021298548,0.004436987,0.0002808145,0.000004393327,0.0000060323373,0.000045540488,0.9231142,0.048320483,0.022826377,0.00024298961,0.00012491609],"about_ca_topic_score_codex":0.000007413533,"about_ca_topic_score_gemma":0.0000074885647,"teacher_disagreement_score":0.96116334,"about_ca_system_score_codex":0.000024681489,"about_ca_system_score_gemma":0.000051552175,"threshold_uncertainty_score":0.122399494},"labels":[],"label_agreement":null},{"id":"W2547481303","doi":"10.1109/ccece.2016.7726641","title":"Random node failures and wireless networks connectivity: A novel recovery scheme","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Backup; Computer network; Computer science; Robustness (evolution); Wireless; Wireless network; Wireless sensor network; Scheduling (production processes); Distributed computing; Engineering; Telecommunications; Database","score_opus":0.026118890620714645,"score_gpt":0.24733858225462638,"score_spread":0.22121969163391172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547481303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020301694,0.00035240597,0.9683151,0.008252055,0.00012874685,0.000114107774,5.8556253e-7,0.00015483245,0.0023804726],"genre_scores_gemma":[0.97319734,0.0012308966,0.023771461,0.0009347029,0.000056390498,0.00001809123,4.3933247e-7,0.000006941108,0.0007837632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917245,0.00008814045,0.00014965543,0.00029220738,0.00009686365,0.00020067088],"domain_scores_gemma":[0.99856645,0.0006699075,0.00005182586,0.000548577,0.000083397405,0.0000798482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003586635,0.00011593682,0.00016533116,0.000051077608,0.00017659985,0.00016035297,0.0004706816,0.000049940067,0.00004190632],"category_scores_gemma":[0.00007592352,0.00007468651,0.000038388553,0.00020217024,0.000065880886,0.0005216929,0.0005292168,0.00008671024,0.000012630567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059985214,0.00008237681,0.0013491941,0.000004626632,0.000052742867,0.000002317857,0.00016787135,0.0000865504,0.031507444,0.35001656,0.002804827,0.6138655],"study_design_scores_gemma":[0.008211083,0.00012413075,0.0057813744,0.0002581914,0.0000096321,0.000048297064,0.000029479745,0.9195138,0.0034756905,0.0014003909,0.060334615,0.0008132891],"about_ca_topic_score_codex":0.000010875372,"about_ca_topic_score_gemma":0.00012114178,"teacher_disagreement_score":0.95289564,"about_ca_system_score_codex":0.00002357533,"about_ca_system_score_gemma":0.000028527804,"threshold_uncertainty_score":0.30456275},"labels":[],"label_agreement":null},{"id":"W2547966610","doi":"10.1007/978-3-319-48314-6_19","title":"Asynchronous Broadcasting with Bivalent Beeps","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Asynchronous communication; Broadcasting (networking); Computer network; Node (physics); Anonymity; Theoretical computer science; Computer security","score_opus":0.027451130262717824,"score_gpt":0.2543659421237031,"score_spread":0.22691481186098528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547966610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040721123,0.0011233039,0.982489,0.001918302,0.00064214924,0.00030698968,0.0000018328967,0.0002045754,0.013273114],"genre_scores_gemma":[0.37120047,0.00072127435,0.62409943,0.002160196,0.00077081315,0.000021542648,0.000003044338,0.00006915596,0.00095408986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968145,0.0000550827,0.0004267929,0.0012863802,0.00078306376,0.0006341973],"domain_scores_gemma":[0.99671996,0.0005419699,0.00028353563,0.0019261086,0.00034661553,0.00018179121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007040598,0.00049187895,0.00043933804,0.0005709437,0.00041261685,0.000510566,0.0039420663,0.00017045977,0.000049415263],"category_scores_gemma":[0.000059959155,0.00035376867,0.00008295574,0.0005668804,0.0006880255,0.0005795247,0.0020725226,0.0006686986,0.0000830346],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034087152,0.000013732163,0.000045976376,0.000010846181,0.000009227564,0.000039038103,0.00050971226,0.00305314,0.000105267,0.039838478,0.00000911482,0.95636207],"study_design_scores_gemma":[0.0018324911,0.0011977062,0.0006343616,0.006049679,0.00003001366,0.0005978453,5.829696e-7,0.8469754,0.003214229,0.11396878,0.021758668,0.0037402418],"about_ca_topic_score_codex":0.0000020393902,"about_ca_topic_score_gemma":0.000068313566,"teacher_disagreement_score":0.9526218,"about_ca_system_score_codex":0.00039202452,"about_ca_system_score_gemma":0.00059411814,"threshold_uncertainty_score":0.9998914},"labels":[],"label_agreement":null},{"id":"W2548042055","doi":"10.1109/ccece.2016.7726609","title":"Transmitter precoding to cancel inter-relay interference in AF systems with successive transmissions","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Precoding; Computer science; Relay; Telecommunications link; Base station; Single antenna interference cancellation; Channel state information; Transmitter; Electronic engineering; Wireless; Computer network; Channel (broadcasting); MIMO; Telecommunications; Engineering; Physics","score_opus":0.030196471793963738,"score_gpt":0.2703508755928546,"score_spread":0.24015440379889086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548042055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013587665,0.00013123441,0.9714397,0.009705749,0.00013869665,0.00028721077,0.0000013312533,0.00007510168,0.0046332804],"genre_scores_gemma":[0.99079996,0.000117233605,0.0066425013,0.00039026816,0.00001863915,0.00009409622,3.0674204e-7,0.000008313978,0.0019286611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880123,0.00015084303,0.00027734475,0.00037826147,0.000116603296,0.00027569465],"domain_scores_gemma":[0.9988979,0.00025086378,0.000043688127,0.0005585123,0.000101095735,0.00014794135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021058279,0.00015154539,0.00018364898,0.0001694356,0.000087520006,0.00013575116,0.0011324263,0.000037554117,0.00012474897],"category_scores_gemma":[0.000020293119,0.00008431722,0.000029515615,0.000508917,0.00003425651,0.0005072434,0.0001415922,0.0001297523,0.00004751757],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010389581,0.00017070501,0.0068129036,0.000035535108,0.00004712503,0.000027746559,0.016623043,0.0011203132,0.019274984,0.03981279,0.001859425,0.91411155],"study_design_scores_gemma":[0.015437525,0.0036329066,0.02717385,0.033563867,0.00006241836,0.00019798754,0.0027092649,0.6724191,0.07311281,0.00067235396,0.16434857,0.006669393],"about_ca_topic_score_codex":0.00006889057,"about_ca_topic_score_gemma":0.0017749324,"teacher_disagreement_score":0.9772123,"about_ca_system_score_codex":0.00010157212,"about_ca_system_score_gemma":0.00007246891,"threshold_uncertainty_score":0.34383565},"labels":[],"label_agreement":null},{"id":"W2548896735","doi":"10.1109/acssc.2011.6190187","title":"Distributed single carrier frequency-domain equalization for multi-relay cooperative networks over frequency selective Rician channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Algorithm; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.08220827887346445,"score_gpt":0.2946926105191276,"score_spread":0.21248433164566316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548896735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002758024,0.0004430121,0.99141026,0.00019923807,0.00053863256,0.0008886364,0.000030110978,0.00031069122,0.0034214081],"genre_scores_gemma":[0.8537867,0.00007814608,0.1446481,0.0007566444,0.00010721976,0.00022489965,0.00012753592,0.000028999777,0.00024175465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977791,0.00039181072,0.00048496682,0.0006141232,0.0001899912,0.00054006267],"domain_scores_gemma":[0.9978288,0.00023374846,0.00020424431,0.00073910074,0.0008167148,0.0001774277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047718338,0.0003208596,0.0003153346,0.00012718911,0.00064474007,0.00020176577,0.0010157996,0.00017107441,0.00014091682],"category_scores_gemma":[0.0002237897,0.0002911844,0.00011553883,0.0012040279,0.000105658335,0.000869832,0.00026922004,0.00023948967,0.000012152697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002711825,0.00050580595,0.0023115748,0.000008959051,0.00015112174,0.00000556014,0.010695906,0.0019473903,0.00366903,0.9746981,0.0026569918,0.0033224057],"study_design_scores_gemma":[0.0028092007,0.0008364372,0.0052116793,0.000107211,0.000038492894,0.000009967942,0.00038827368,0.9697341,0.00808098,0.009779175,0.0016561339,0.0013483883],"about_ca_topic_score_codex":0.00008530443,"about_ca_topic_score_gemma":0.0006207946,"teacher_disagreement_score":0.96778667,"about_ca_system_score_codex":0.00025557674,"about_ca_system_score_gemma":0.00012513557,"threshold_uncertainty_score":0.99995404},"labels":[],"label_agreement":null},{"id":"W2548939748","doi":"","title":"Performance analysis of Decode-and-Forward cooperative networks with best relay selection","year":2012,"lang":"en","type":"article","venue":"International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Relay channel; Decodes; Computer science; Cooperative diversity; Selection (genetic algorithm); Node (physics); Computer network; Link Access Procedure for Frame Relay; Hop (telecommunications); Topology (electrical circuits); Channel (broadcasting); Decoding methods; Power (physics); Telecommunications; Mathematics; Fading; Engineering; Artificial intelligence","score_opus":0.08105159770417639,"score_gpt":0.33384989515241054,"score_spread":0.2527982974482341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548939748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1661616,0.00079686067,0.7350763,0.0066320184,0.00026102582,0.0004078028,0.000017411254,0.00016418453,0.09048278],"genre_scores_gemma":[0.9783692,0.0050497567,0.015958523,0.00023014471,0.000020767386,0.000057293404,0.000047700894,0.0000065918553,0.00026004494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989212,0.0001966619,0.0002958284,0.00018673719,0.00022755112,0.00017202737],"domain_scores_gemma":[0.9977867,0.00026161806,0.00019927278,0.0010293712,0.0006341455,0.00008890738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036082344,0.00013730774,0.00020484961,0.00033726337,0.00031515048,0.000101422214,0.0015831635,0.000050921157,0.00008673783],"category_scores_gemma":[0.000040144863,0.00011913062,0.000050915976,0.0010843306,0.00017005767,0.0006539222,0.0005162571,0.00028132778,0.000012005406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030392697,0.00039389523,0.06506189,0.0000025425104,0.00078645704,9.937378e-8,0.0013695196,0.022613468,0.00024941447,0.87921375,0.000087509594,0.03019106],"study_design_scores_gemma":[0.00017845232,0.00012042343,0.031039506,0.00004727983,0.00009778273,0.000004228464,0.000084418425,0.9661322,0.00013975835,0.000015482092,0.0019938783,0.0001465702],"about_ca_topic_score_codex":0.000017498221,"about_ca_topic_score_gemma":0.00025345225,"teacher_disagreement_score":0.94351876,"about_ca_system_score_codex":0.00006934106,"about_ca_system_score_gemma":0.000062998784,"threshold_uncertainty_score":0.4858006},"labels":[],"label_agreement":null},{"id":"W2549221151","doi":"10.1109/tvt.2016.2627338","title":"Space-Time Network Coding With Multiple AF Relays Over Nakagami- $m$ Fading Channels","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Key Research and Development Program of China; Natural Science Foundation of Beijing Municipality; Southeast University; National Natural Science Foundation of China","keywords":"Fading; Nakagami distribution; Independent and identically distributed random variables; Moment-generating function; QAM; Mathematics; Phase-shift keying; Keying; Linear network coding; Topology (electrical circuits); Relay; Telecommunications; Quadrature amplitude modulation; Algorithm; Computer science; Bit error rate; Decoding methods; Statistics; Computer network; Random variable; Physics; Combinatorics","score_opus":0.01460310336437071,"score_gpt":0.22816301755096,"score_spread":0.2135599141865893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549221151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027220575,0.00019223907,0.96490157,0.0056763855,0.00036154815,0.00037257434,0.0000033270485,0.0010180529,0.000253704],"genre_scores_gemma":[0.9854586,0.00048261814,0.012821563,0.00022350736,0.000049950322,0.00015406623,7.1805647e-7,0.000031683732,0.00077725656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827564,0.0001236976,0.0002655674,0.00057441794,0.00022247154,0.00053823553],"domain_scores_gemma":[0.9980772,0.0002701427,0.00011493297,0.0013123722,0.00012957571,0.00009577152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025991138,0.0002713147,0.0002967866,0.0004020199,0.0006036531,0.0000756028,0.0010352036,0.00025262815,0.00008150036],"category_scores_gemma":[0.000017445367,0.00019836822,0.00009951181,0.0013956876,0.00019601276,0.0003815541,0.000026158114,0.0004418187,0.00021489384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018269915,0.00063126336,0.0007793769,0.0000296374,0.0006381303,0.00019231129,0.0007449368,0.14103907,0.24553895,0.08659514,0.00243591,0.52119255],"study_design_scores_gemma":[0.0061903307,0.001388008,0.00038648324,0.0015643509,0.00011048481,0.00039199303,0.000063619234,0.6223881,0.28149426,0.0032651594,0.08058099,0.0021761975],"about_ca_topic_score_codex":0.000002680575,"about_ca_topic_score_gemma":0.000035273362,"teacher_disagreement_score":0.95823807,"about_ca_system_score_codex":0.0001466917,"about_ca_system_score_gemma":0.000049017115,"threshold_uncertainty_score":0.8089221},"labels":[],"label_agreement":null},{"id":"W2549675421","doi":"","title":"Design factors for dual-hop AF systems with partial relay selection","year":2014,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Dual (grammatical number); Selection (genetic algorithm); Hop (telecommunications); Computer network; Artificial intelligence; Physics","score_opus":0.01882366071901197,"score_gpt":0.2566302119809246,"score_spread":0.23780655126191264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549675421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018604654,0.000024310333,0.9924499,0.0011695689,0.00017424856,0.00076895347,0.000010062974,0.0001469958,0.003395488],"genre_scores_gemma":[0.99439776,0.000116758674,0.0034886948,0.00048342271,0.00011411924,0.000971879,0.000081472164,0.000007616389,0.00033830674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904126,0.00016524609,0.00029850888,0.00017188842,0.00019509814,0.00012798923],"domain_scores_gemma":[0.99829066,0.00081706024,0.00020395762,0.00023544593,0.00038463357,0.00006824981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078283006,0.00012970227,0.000099666504,0.00011308525,0.0004515068,0.0003484166,0.00037358818,0.000054150427,0.000011495837],"category_scores_gemma":[0.000080579244,0.000105543586,0.000027366732,0.00020062528,0.000028219229,0.0012395956,0.000063375,0.00010024453,0.000042638047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005321982,0.000027590362,0.000017176995,0.000007394211,0.000025254289,1.02687645e-8,0.00071536866,0.020503523,0.0003920696,0.97258663,0.00020607811,0.005465698],"study_design_scores_gemma":[0.0006694619,0.00024979803,0.00012224678,0.00003806822,0.000013069266,0.0000126561135,0.00012145742,0.71281934,0.0044568116,0.0021979157,0.27904502,0.000254131],"about_ca_topic_score_codex":9.684187e-7,"about_ca_topic_score_gemma":6.684833e-7,"teacher_disagreement_score":0.99253726,"about_ca_system_score_codex":0.00005725753,"about_ca_system_score_gemma":0.000027521522,"threshold_uncertainty_score":0.43039423},"labels":[],"label_agreement":null},{"id":"W2554673546","doi":"10.1109/allerton.2012.6483483","title":"A decoding procedure for compress-and-forward and quantize-and-forward relaying","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Multicast; Computer science; Relay; Scheme (mathematics); Linear network coding; Gaussian; Algorithm; Computer network; Theoretical computer science; Mathematics","score_opus":0.05388004770787041,"score_gpt":0.3094361042699274,"score_spread":0.255556056562057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554673546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14098231,0.010025322,0.83984363,0.004121421,0.00021057964,0.0006286743,0.0000016805002,0.00026446016,0.0039219437],"genre_scores_gemma":[0.91831595,0.0014524453,0.079102375,0.0007100138,0.00005344858,0.00004381567,0.0000013670477,0.000009426621,0.00031116093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909353,0.00005243029,0.00019823729,0.00025649706,0.00009467008,0.00030464394],"domain_scores_gemma":[0.9990668,0.00032908423,0.00006345997,0.0002985899,0.000070372844,0.00017168371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000524368,0.00013864749,0.00018601528,0.00007153895,0.00045136324,0.00021548984,0.0002897056,0.000053409036,0.0000072952607],"category_scores_gemma":[0.000101150894,0.00011626897,0.000030936506,0.00014709475,0.000058220863,0.0006826717,0.00060011214,0.000119578515,0.0000032195364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018852925,0.000046873414,0.031903237,0.00010430586,0.00004685088,3.961475e-7,0.004591008,0.000008521884,0.001496959,0.7699534,0.0023992406,0.1894303],"study_design_scores_gemma":[0.0025962007,0.00022780456,0.03522185,0.00030193423,0.000065469554,0.00016404383,0.00074478594,0.84063554,0.0026483985,0.0040829894,0.11213892,0.0011720755],"about_ca_topic_score_codex":0.0000031272637,"about_ca_topic_score_gemma":0.00001527765,"teacher_disagreement_score":0.840627,"about_ca_system_score_codex":0.000014005143,"about_ca_system_score_gemma":0.000017743474,"threshold_uncertainty_score":0.4741311},"labels":[],"label_agreement":null},{"id":"W2554730289","doi":"10.1109/allerton.2009.5394860","title":"Asymptotic rate limits for randomized broadcasting with network coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Network packet; Network topology; Randomized algorithm; Broadcasting (networking); Upload; Computer network; Upper and lower bounds; Node (physics); Distributed computing; Mathematics; Algorithm","score_opus":0.034782064833402536,"score_gpt":0.2745571303799317,"score_spread":0.23977506554652914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554730289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073428184,0.00032731247,0.97755677,0.0032736682,0.000109836634,0.0006192071,9.58329e-8,0.00025379582,0.017125031],"genre_scores_gemma":[0.80061495,0.00022484023,0.1950264,0.0027186063,0.00013393446,0.00004648294,0.0000022097138,0.000007559099,0.0012250136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988078,0.00023893177,0.0002613756,0.00026855734,0.0001016143,0.0003217296],"domain_scores_gemma":[0.99798065,0.0012029752,0.00011032662,0.00045558886,0.00017372642,0.00007673697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012815611,0.00014324716,0.00032403425,0.00004636726,0.0003901347,0.0002555356,0.0006170484,0.000029858431,0.000013148218],"category_scores_gemma":[0.00018206313,0.00010249664,0.00008120391,0.0004286904,0.00003526653,0.0003121231,0.000074479925,0.000102920654,0.000008788309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017470347,0.0000368875,0.00003277152,0.0000052221258,0.00004085058,0.000002145248,0.00036364884,0.007631981,0.00038513035,0.8344631,0.0024590835,0.15283212],"study_design_scores_gemma":[0.03778908,0.00015370682,0.00020107633,0.00012237523,0.000017584845,0.000009995876,0.00000857667,0.95404136,0.00044710774,0.003821593,0.0031032315,0.0002842934],"about_ca_topic_score_codex":5.39094e-7,"about_ca_topic_score_gemma":0.0000074904956,"teacher_disagreement_score":0.9464094,"about_ca_system_score_codex":0.000022393648,"about_ca_system_score_gemma":0.000043512748,"threshold_uncertainty_score":0.41796917},"labels":[],"label_agreement":null},{"id":"W2556413940","doi":"10.1109/lcomm.2016.2632731","title":"Sparse Random Linear Network Coding With Precoded Band Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Decoding methods; Code (set theory); Lossy compression; Linear network coding; Overhead (engineering); Algorithm; Linear code; Concatenated error correction code; Sparse matrix; Coding (social sciences); Theoretical computer science; Block code; Computer network; Mathematics; Artificial intelligence","score_opus":0.0501694703091445,"score_gpt":0.2759008394902195,"score_spread":0.22573136918107498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556413940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012173491,0.0007101433,0.933927,0.049744513,0.00021580987,0.00038363895,0.0000041512526,0.0003646669,0.0024765641],"genre_scores_gemma":[0.8986423,0.0031882531,0.094336234,0.0033103817,0.0001163624,0.00012329125,0.000007349018,0.000022983057,0.00025285836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808234,0.00061743014,0.0003645416,0.00033913442,0.00021212928,0.000384403],"domain_scores_gemma":[0.9941041,0.001214427,0.00018801136,0.004200961,0.00017203223,0.00012050711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000665536,0.00021550972,0.00026608683,0.00010315748,0.0007973822,0.00016303026,0.0037663507,0.000050411098,0.000026591832],"category_scores_gemma":[0.000060684833,0.00014899424,0.00007590018,0.00063547754,0.00033066465,0.00061628455,0.0005295746,0.00024715567,0.00009898139],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045583016,0.0008145674,0.01713613,0.000050591676,0.0009119,0.00002953407,0.0061865337,0.01233967,0.2936568,0.17722884,0.17204082,0.3191488],"study_design_scores_gemma":[0.020836858,0.00046619982,0.009490399,0.0029671078,0.00020722054,0.00020409781,0.000113542264,0.24852206,0.036081802,0.0020371578,0.6750801,0.003993429],"about_ca_topic_score_codex":0.0000064900632,"about_ca_topic_score_gemma":0.0001663325,"teacher_disagreement_score":0.88646877,"about_ca_system_score_codex":0.00008722998,"about_ca_system_score_gemma":0.00006407201,"threshold_uncertainty_score":0.69988793},"labels":[],"label_agreement":null},{"id":"W2558006873","doi":"10.1007/s11277-016-3921-5","title":"Power Adaptation for Energy Efficient Bi-directional Relaying with Quality-of-Service Requirement and Individual Peak-Power Limit","year":2016,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; SCSI; Relay; Quality of service; Transmitter power output; Computer network; Efficient energy use; Power (physics); Sleep mode; Limit (mathematics); Timeout; Energy (signal processing); Channel (broadcasting); Real-time computing; Electrical engineering; Mathematics; Computer hardware","score_opus":0.1236176969117916,"score_gpt":0.31706922295220413,"score_spread":0.19345152604041255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558006873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12610534,0.0022652391,0.84104085,0.027241552,0.00012954057,0.00043279957,0.000060076673,0.00017790942,0.0025466892],"genre_scores_gemma":[0.966703,0.00055051607,0.031825513,0.0005790694,0.000013795855,0.00017272486,0.000026264766,0.000016055974,0.00011307284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998301,0.00035236753,0.000419285,0.00032871406,0.00037880387,0.00021981956],"domain_scores_gemma":[0.9964611,0.0012477746,0.00028827015,0.0012275915,0.0006799537,0.00009529613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076204503,0.00017178287,0.00021507227,0.00015198282,0.0007071353,0.000087078035,0.0013268886,0.00006236533,0.000021627457],"category_scores_gemma":[0.00007487895,0.00013215635,0.000064190055,0.0004991043,0.00021335922,0.00030915556,0.0007571931,0.00012271311,0.000002888936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010643721,0.0004177336,0.0007931156,0.000023672079,0.00017140174,2.481802e-7,0.012623741,0.0001877873,0.013689758,0.9095171,0.00025512069,0.06221389],"study_design_scores_gemma":[0.01297723,0.0020399184,0.12760457,0.0025004223,0.00020747865,0.00008887199,0.009871335,0.723306,0.0055634105,0.004174433,0.10820781,0.0034585262],"about_ca_topic_score_codex":0.00003879292,"about_ca_topic_score_gemma":0.0004201599,"teacher_disagreement_score":0.90534264,"about_ca_system_score_codex":0.00008636169,"about_ca_system_score_gemma":0.00016561475,"threshold_uncertainty_score":0.54387844},"labels":[],"label_agreement":null},{"id":"W2558073332","doi":"10.1109/jsac.2016.2633039","title":"Small-Macro Cell Cooperation for HetNet Uplink Transmission: Spectral Efficiency and Reliability Analyses","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Spectral efficiency; Transmission (telecommunications); Telecommunications link; Decoding methods; Macro; Heterogeneous network; User equipment; Fading; Base station; Cellular network; Computer network; Relay; Small cell; Algorithm; Channel (broadcasting); Wireless network; Telecommunications; Wireless; Power (physics)","score_opus":0.09039897798359212,"score_gpt":0.34549365051688535,"score_spread":0.2550946725332932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558073332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050499063,0.0014439571,0.93202066,0.014533438,0.00013172145,0.0004209574,0.000003936599,0.00009295819,0.0008533147],"genre_scores_gemma":[0.92651886,0.009327676,0.06359243,0.0002738538,0.00005322239,0.000049638926,0.000005794997,0.000013332211,0.00016517988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793977,0.0006637202,0.0006052566,0.00031944536,0.00016174675,0.00031004718],"domain_scores_gemma":[0.9959305,0.0015240918,0.0002083687,0.0015101754,0.0006522855,0.0001745866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009462549,0.0001942824,0.00025156743,0.00026100432,0.00088328624,0.0002357325,0.0018926545,0.000089534435,0.000019236466],"category_scores_gemma":[0.00028170948,0.00013882198,0.000083611805,0.0010260906,0.00013565924,0.00038607704,0.00014954616,0.00048574246,0.0000061461624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004314191,0.0045883446,0.0061951973,0.000068347304,0.0001370665,0.000012432832,0.00589926,0.008790467,0.28151911,0.05938892,0.0063754744,0.62659395],"study_design_scores_gemma":[0.0064656646,0.0014143202,0.015594544,0.0008687185,0.00007415573,0.0001929382,0.00005938414,0.87257576,0.04972108,0.006965788,0.044779938,0.0012876882],"about_ca_topic_score_codex":0.0000037629807,"about_ca_topic_score_gemma":0.00004635648,"teacher_disagreement_score":0.87601984,"about_ca_system_score_codex":0.00018060683,"about_ca_system_score_gemma":0.00025265376,"threshold_uncertainty_score":0.6793613},"labels":[],"label_agreement":null},{"id":"W2558102708","doi":"","title":"Power Saving Potential of Cooperative Communication: A Two-Dimensional Approach","year":2015,"lang":"en","type":"article","venue":"Systems Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Power (physics); Computer science; Physics","score_opus":0.0720915925588285,"score_gpt":0.30585868355923196,"score_spread":0.23376709100040347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558102708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015351038,0.052243106,0.6718015,0.008326328,0.0009519129,0.0022857368,0.00003858338,0.0008558067,0.248146],"genre_scores_gemma":[0.92602473,0.00021085037,0.07299704,0.000121314035,0.000021327207,0.00013503383,0.00005925428,0.000016158894,0.00041430132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666905,0.0016567346,0.0007066291,0.00029371577,0.00043382234,0.00024006388],"domain_scores_gemma":[0.99165106,0.00031699298,0.00036990017,0.00606606,0.0014045982,0.00019136968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014895767,0.0002045514,0.00036227005,0.00018049874,0.0005883567,0.00020591445,0.0051137544,0.000077525794,0.0000117230475],"category_scores_gemma":[0.00015732352,0.00019771447,0.000094756106,0.0009451523,0.0003447755,0.00065379083,0.0030878119,0.00039379246,0.000047039495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011404798,0.00054645695,0.00023172282,0.000015433643,0.0001207903,9.7051e-7,0.0062646368,0.032384112,0.0019452634,0.9508004,0.006137387,0.0015414045],"study_design_scores_gemma":[0.0020036025,0.00014447444,0.0008167446,0.00024885326,0.000028914032,0.00014023752,0.0021497083,0.96724206,0.00017187034,0.0011714406,0.0252494,0.00063270115],"about_ca_topic_score_codex":0.00007751509,"about_ca_topic_score_gemma":0.000026673588,"teacher_disagreement_score":0.94962895,"about_ca_system_score_codex":0.00012490379,"about_ca_system_score_gemma":0.00034715628,"threshold_uncertainty_score":0.95027125},"labels":[],"label_agreement":null},{"id":"W2560025158","doi":"10.1109/wimob.2016.7763219","title":"Increasing throughput in multi-way three-user MIMO networks using successive relaying and IRI cancellation","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"MIMO; Relay; Channel state information; Computer science; Single antenna interference cancellation; Transceiver; Bit error rate; Throughput; Scheduling (production processes); Computer network; Wireless; Electronic engineering; Channel (broadcasting); Multi-user MIMO; Relay channel; Telecommunications; Engineering","score_opus":0.06654673922477304,"score_gpt":0.30769393869121503,"score_spread":0.24114719946644197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560025158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15269268,0.0010152503,0.84460807,0.00076946785,0.00011777922,0.00013865708,1.8055596e-7,0.00007120517,0.0005867328],"genre_scores_gemma":[0.9331994,0.00065090455,0.06574464,0.00024045272,0.000040997427,0.00000542032,5.032023e-7,0.000009324392,0.00010837134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988117,0.0002131117,0.00026423833,0.0003431157,0.000110151996,0.0002576717],"domain_scores_gemma":[0.99883133,0.00046363124,0.00010688038,0.0004396326,0.00009414064,0.00006440994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077909,0.0001367446,0.0001566877,0.00009762301,0.0002548563,0.00014981577,0.00039527856,0.000069819005,0.000020984698],"category_scores_gemma":[0.00009078218,0.00009913705,0.000023741033,0.00041837283,0.00006221515,0.00090041326,0.0004904196,0.00013024404,0.000003765148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030831965,0.00006674381,0.34411585,0.000010667842,0.000025061792,0.000012881617,0.0014630951,0.0077024787,0.011114509,0.060122468,0.0001066921,0.57522875],"study_design_scores_gemma":[0.0006528881,0.000011104944,0.030367754,0.00022157747,0.000002780354,0.000009761702,0.000021921258,0.9677387,0.00020516635,0.00020767082,0.00035831664,0.00020239543],"about_ca_topic_score_codex":0.00027575088,"about_ca_topic_score_gemma":0.002683311,"teacher_disagreement_score":0.96003616,"about_ca_system_score_codex":0.00012822043,"about_ca_system_score_gemma":0.00004162086,"threshold_uncertainty_score":0.40426916},"labels":[],"label_agreement":null},{"id":"W2560569444","doi":"10.1109/wimob.2016.7763221","title":"Orthogonal signal space alignment for MIMO Y channels with redundant antennas","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Precoding; MIMO; Computer science; Decoding methods; Relay; Bit error rate; Orthogonality; Channel (broadcasting); Multi-user MIMO; Scheduling (production processes); Electronic engineering; Topology (electrical circuits); Algorithm; Telecommunications; Power (physics); Mathematics; Engineering; Mathematical optimization; Electrical engineering","score_opus":0.03788977223669914,"score_gpt":0.26562220262035646,"score_spread":0.2277324303836573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560569444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020389608,0.00009455421,0.979833,0.015076595,0.000102632424,0.0002430832,0.0000019174727,0.000104957035,0.0025042747],"genre_scores_gemma":[0.93849975,0.00011845412,0.05433465,0.00065675733,0.00007502605,0.000065152024,0.0000011550112,0.000008228834,0.006240799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991371,0.000050132912,0.00013493489,0.00027536455,0.00016152601,0.0002409668],"domain_scores_gemma":[0.9990737,0.00016678403,0.00005287858,0.00046585503,0.0001490867,0.00009169655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025141196,0.00011210088,0.00011248092,0.000044771245,0.00017356484,0.00009219212,0.0005948907,0.000022203063,0.00008618369],"category_scores_gemma":[0.00001145251,0.00006015458,0.0000420349,0.00016123438,0.00005093986,0.0002498295,0.00021543691,0.0000351541,0.000028695682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003697416,0.00006858254,0.00018785051,0.0000037755176,0.000032121683,0.0000031735444,0.00026456162,0.00002451044,0.018650623,0.89637727,0.005332448,0.079018086],"study_design_scores_gemma":[0.007312125,0.0026177762,0.0021774317,0.00077904045,0.00003218967,0.00013432375,0.00019104996,0.16080713,0.13417345,0.012848116,0.67700183,0.0019255425],"about_ca_topic_score_codex":0.0000010844772,"about_ca_topic_score_gemma":0.000019680354,"teacher_disagreement_score":0.9364608,"about_ca_system_score_codex":0.000036376492,"about_ca_system_score_gemma":0.00006641249,"threshold_uncertainty_score":0.24530324},"labels":[],"label_agreement":null},{"id":"W2561386561","doi":"10.1007/978-3-319-47352-9_3","title":"Cross-Layer Broadcast in V2V Communication Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Broadcast communication network; Layer (electronics); Atomic broadcast; Multimedia Broadcast Multicast Service; Broadcasting (networking); Multicast","score_opus":0.03622021007889879,"score_gpt":0.28210767372068396,"score_spread":0.24588746364178515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561386561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058811824,0.019149695,0.5096533,0.000979481,0.0009538147,0.0006609693,0.0000057730913,0.00043872645,0.46809945],"genre_scores_gemma":[0.5483419,0.08776465,0.0019301514,0.0015507763,0.0011027999,0.00014409592,0.00013499244,0.00022470519,0.35880592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966122,0.00026872547,0.0010269339,0.00094887766,0.0004006078,0.0007426691],"domain_scores_gemma":[0.9944659,0.0005951719,0.0005960819,0.003790161,0.00033850956,0.00021420815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008963092,0.00069404056,0.00077742233,0.00029050466,0.00045266343,0.0005524489,0.004181119,0.00089933275,0.00038414533],"category_scores_gemma":[0.00001818088,0.00064478576,0.00025108995,0.0002795274,0.00033793403,0.00063257845,0.0023743892,0.0017467347,0.00017798234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016754873,0.000027091379,0.00018307798,0.000007195485,0.00003937389,0.000015618096,0.00011106409,0.0062630456,0.000003101789,0.54776865,0.0026916764,0.44287336],"study_design_scores_gemma":[0.0011667944,0.000053641917,0.00071200886,0.0019075046,0.000017821425,0.000024277922,0.000002658748,0.69330466,0.000004840976,0.00500011,0.29647666,0.0013289833],"about_ca_topic_score_codex":0.000007567253,"about_ca_topic_score_gemma":0.00024757488,"teacher_disagreement_score":0.68704164,"about_ca_system_score_codex":0.00033756217,"about_ca_system_score_gemma":0.0001204954,"threshold_uncertainty_score":0.99960035},"labels":[],"label_agreement":null},{"id":"W2565357610","doi":"10.1007/978-3-319-51204-4_12","title":"Optimizing Power Allocation in Wireless Networks: Are the Implicit Constraints Really Redundant?","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subgradient method; Mathematical optimization; Convergence (economics); Computer science; Iterative method; Power (physics); Karush–Kuhn–Tucker conditions; Mathematics","score_opus":0.023054474393723517,"score_gpt":0.2459191937643738,"score_spread":0.22286471937065028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565357610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001322917,0.0006604024,0.99108607,0.003835734,0.00039532632,0.0005740675,0.000015433141,0.00005529705,0.0032454003],"genre_scores_gemma":[0.35882798,0.0016938925,0.6384685,0.00066761766,0.00015126316,0.00006163728,0.000018360392,0.000026954716,0.00008377279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985976,0.000036053665,0.0006966055,0.00018557782,0.0002174624,0.000266686],"domain_scores_gemma":[0.99759775,0.00056405284,0.0006097597,0.0009593611,0.0002276612,0.00004138294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007021887,0.0002738112,0.00034701132,0.00017852997,0.0010229391,0.00029081147,0.00308123,0.00018288296,0.0000012101461],"category_scores_gemma":[0.000056449364,0.00018158456,0.00014586147,0.0003144743,0.0006737897,0.00040253336,0.0012352628,0.00049200206,5.171252e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018260251,0.0000124593635,0.000007680646,0.00004229383,0.000056385186,1.14119295e-7,0.0021007531,0.56729454,0.000024115501,0.364745,0.000057426983,0.065657414],"study_design_scores_gemma":[0.0002901768,0.000038933547,0.00012532799,0.00080276554,0.000019309831,0.0000137868,0.000013610656,0.9891335,0.000042553213,0.0010905649,0.008063212,0.00036631085],"about_ca_topic_score_codex":0.000006022965,"about_ca_topic_score_gemma":0.00014519913,"teacher_disagreement_score":0.4218389,"about_ca_system_score_codex":0.00010682556,"about_ca_system_score_gemma":0.00017436736,"threshold_uncertainty_score":0.78677243},"labels":[],"label_agreement":null},{"id":"W2566210112","doi":"10.1109/pimrc.2016.7794675","title":"Two-tier distributed and open loop multi-point cooperation using SCMA","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Computer network; Backhaul (telecommunications); Cellular network; Distributed computing; Scheduling (production processes); Wireless network; Synchronization networks; Network performance; Synchronization (alternating current); Wireless; Base station; Telecommunications; Channel (broadcasting)","score_opus":0.09876870136477582,"score_gpt":0.34169538875280264,"score_spread":0.2429266873880268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566210112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013823415,0.00018110378,0.9818824,0.0028810066,0.00009171006,0.0002179189,0.0000026841997,0.00007664624,0.00084315107],"genre_scores_gemma":[0.9124762,0.000174137,0.08567431,0.00055529625,0.000021211958,0.000010213391,0.0000037850245,0.000005863358,0.0010790073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992376,0.00013482358,0.00017521964,0.00022853675,0.00006885651,0.00015495591],"domain_scores_gemma":[0.9990973,0.000080760714,0.00004594736,0.00052950287,0.00016355915,0.00008296848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032255956,0.00009840402,0.00011863635,0.00003820823,0.00028070871,0.00045665808,0.00081377313,0.000025779931,0.00010161594],"category_scores_gemma":[0.00006568226,0.000063489264,0.000015565161,0.00024612906,0.000050811002,0.0011114164,0.0014232101,0.00005033082,0.000027301394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019345485,0.00018761418,0.004133557,0.0000052530545,0.000041181436,0.00000492748,0.00090205984,0.00020694414,0.1154564,0.42248368,0.0029944137,0.4535646],"study_design_scores_gemma":[0.0033231003,0.00007202476,0.0028540385,0.0001305804,0.000007925748,0.00002658742,0.00005166318,0.9659857,0.015546082,0.00045344164,0.011051346,0.0004974978],"about_ca_topic_score_codex":0.00002481613,"about_ca_topic_score_gemma":0.00013016693,"teacher_disagreement_score":0.96577877,"about_ca_system_score_codex":0.00005237885,"about_ca_system_score_gemma":0.00005326387,"threshold_uncertainty_score":0.44035643},"labels":[],"label_agreement":null},{"id":"W2566414444","doi":"","title":"On improving the performance of mobile applications using the cloud","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cloud computing; Mobile cloud computing; Distributed computing; Computer network; Mobile device; Mobile computing; Virtualization; Utility computing; Multimedia; Cloud computing security; Operating system","score_opus":0.02609779877051673,"score_gpt":0.289992275347178,"score_spread":0.26389447657666126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566414444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7366281,0.003268074,0.2230319,0.00040729027,0.0012301818,0.0039991685,0.0000027470403,0.00021105731,0.031221472],"genre_scores_gemma":[0.9909541,0.00059301115,0.0022203855,0.00023952223,0.00009483875,0.00049890846,0.000018834837,0.000012788809,0.005367582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991338,0.00008883449,0.0002606373,0.0001981283,0.0001925679,0.00012599274],"domain_scores_gemma":[0.9978832,0.000257987,0.00025605375,0.0013533573,0.00022922656,0.000020150897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028158794,0.00013343831,0.0001271435,0.000047631427,0.00055425614,0.00012662305,0.0019275348,0.00006124417,0.000058016336],"category_scores_gemma":[0.000012314758,0.000069992224,0.00006280074,0.00037819328,0.000041292347,0.00013215815,0.00017194686,0.0002979356,0.000031472937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007586228,0.00009415733,0.000021962407,0.00009383319,0.0000468756,5.8838708e-8,0.0042303307,0.004214013,0.011722291,0.35513675,0.0014336221,0.62299854],"study_design_scores_gemma":[0.00011662832,0.00009926655,0.00043953685,0.0001236329,0.00002357024,0.0000020978234,0.00076542894,0.9706691,0.015690265,0.00029979553,0.011483141,0.00028755603],"about_ca_topic_score_codex":0.000021059768,"about_ca_topic_score_gemma":0.000028180213,"teacher_disagreement_score":0.96645504,"about_ca_system_score_codex":0.00003106756,"about_ca_system_score_gemma":0.00010164929,"threshold_uncertainty_score":0.4262946},"labels":[],"label_agreement":null},{"id":"W2567595868","doi":"10.1109/imis.2016.138","title":"Performance Analysis of Amplify and Forward Technique in Region Based Cooperative Routing for Underwater Wireless Sensor Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer network; Computer science; Rayleigh fading; Network packet; Node (physics); Routing protocol; Acknowledgement; Transmission (telecommunications); Wireless sensor network; Throughput; Fading; Relay channel; Wireless; Real-time computing; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.034385513921761424,"score_gpt":0.2726299644758107,"score_spread":0.2382444505540493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567595868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060393836,0.000018800873,0.93820655,0.0007989686,0.000014748381,0.00031212508,9.120504e-7,0.000041002124,0.0002130657],"genre_scores_gemma":[0.9788131,0.00022551825,0.020529833,0.00020142218,0.00000795293,0.00007699604,0.0000030566018,0.000005507638,0.00013663007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990912,0.00011998136,0.00027539002,0.00025787263,0.00007133629,0.00018423678],"domain_scores_gemma":[0.99886227,0.00044347887,0.0000938166,0.00039625628,0.00016629884,0.000037905815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046517755,0.00010753313,0.00024861482,0.00023711011,0.000102617356,0.00003781462,0.00030744463,0.000063607986,0.000006166667],"category_scores_gemma":[0.000024413193,0.00007016907,0.000049355804,0.0008257128,0.00006028576,0.0002423138,0.00014768152,0.00006812872,3.0017705e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002458651,0.00026880795,0.22777769,0.00008339895,0.0005750392,0.0000042846764,0.0020643964,0.044881895,0.03825961,0.14238136,0.0003971358,0.54306054],"study_design_scores_gemma":[0.00039966428,0.00006596014,0.0057729227,0.00008309582,0.000020406711,8.176562e-7,0.000018537397,0.98566663,0.0077112988,0.000019494471,0.000115944844,0.00012522443],"about_ca_topic_score_codex":0.000006159014,"about_ca_topic_score_gemma":0.00013219914,"teacher_disagreement_score":0.94078475,"about_ca_system_score_codex":0.000043960117,"about_ca_system_score_gemma":0.00002817753,"threshold_uncertainty_score":0.28614116},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0224123968946915,"score_gpt":0.25542126826280737,"score_spread":0.23300887136811588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569741146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040255385,0.000006819737,0.97979075,0.0003004031,0.00029131607,0.00041486978,0.0000018080841,0.0003330827,0.014835438],"genre_scores_gemma":[0.9762765,0.0000221144,0.020107538,0.0031402996,0.000061780585,0.00024162437,0.0000049642827,0.000008057861,0.00013708911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891144,0.00018150987,0.00027189357,0.00016476656,0.00021064446,0.00025972284],"domain_scores_gemma":[0.99863213,0.00015096142,0.0000756325,0.0008004766,0.00017008609,0.00017068654],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040618412,0.00015457788,0.00013530916,0.00017820376,0.0005183918,0.0004139144,0.00082730316,0.000047797203,0.00009796574],"category_scores_gemma":[0.0000059552463,0.00014194839,0.00006999894,0.00069931545,0.000033060904,0.0036354824,0.000007755749,0.00023898538,0.0012802808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010817676,0.00013043155,0.0000010290493,0.000007054503,0.000021620577,4.3654186e-8,0.0065685497,0.16478722,0.00042994443,0.4007551,0.0014908103,0.42579737],"study_design_scores_gemma":[0.00038369585,0.00016262723,0.0002982661,0.000034074124,0.000009744941,0.0000059996687,0.00035309556,0.9779976,0.004647646,0.011810026,0.0038705592,0.00042665558],"about_ca_topic_score_codex":0.0000029465923,"about_ca_topic_score_gemma":9.895801e-7,"teacher_disagreement_score":0.972251,"about_ca_system_score_codex":0.000056935474,"about_ca_system_score_gemma":0.000031408366,"threshold_uncertainty_score":0.99949735},"labels":[],"label_agreement":null},{"id":"W2569787515","doi":"10.1109/tvt.2017.2649562","title":"Antenna Selection for Dual-Hop Cognitive Radio Networks: A Multiple-Relay Scenario","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Relay; Hop (telecommunications); Selection (genetic algorithm); Computer network; Dual (grammatical number); Computer science; Radio networks; Telecommunications; Wireless; Electrical engineering; Engineering; Electronic engineering; Wireless network; Physics; Power (physics); Artificial intelligence","score_opus":0.028144246085536687,"score_gpt":0.2795289724166536,"score_spread":0.2513847263311169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569787515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01615403,0.00029719673,0.9780043,0.0035244313,0.00063241203,0.00066942256,0.000005792747,0.0006375966,0.000074850686],"genre_scores_gemma":[0.987081,0.0006325791,0.011272367,0.0002190555,0.000053701922,0.00038220183,0.0000029710181,0.000024452349,0.00033165843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985315,0.00009159988,0.0002780938,0.0005510081,0.0001362997,0.00041149752],"domain_scores_gemma":[0.9980208,0.00022675564,0.00019288798,0.0011169752,0.0003669356,0.00007558969],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00029545432,0.0002355811,0.0002728262,0.00036945214,0.0021588264,0.00022857939,0.0010616541,0.00032097433,0.000012675264],"category_scores_gemma":[0.00008692863,0.00023860767,0.00016472233,0.0004672017,0.00026582598,0.00041575468,0.000021553822,0.0006200747,0.000030103689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026885586,0.0010926361,0.0009033075,0.00003107398,0.0006513592,0.000036248268,0.00067770673,0.04171049,0.025820594,0.01806712,0.00071303284,0.91002756],"study_design_scores_gemma":[0.0016838531,0.00034599242,0.00028975558,0.00012261047,0.000044126202,0.00008151286,0.000042034393,0.9744671,0.019067414,0.00024799583,0.0032688535,0.0003387507],"about_ca_topic_score_codex":0.0000125473825,"about_ca_topic_score_gemma":0.0004042023,"teacher_disagreement_score":0.970927,"about_ca_system_score_codex":0.000102830745,"about_ca_system_score_gemma":0.00006796762,"threshold_uncertainty_score":0.9991402},"labels":[],"label_agreement":null},{"id":"W2570375860","doi":"10.1109/tvt.2017.2647813","title":"A Spectrally Efficient Signal Space Diversity-Based Two-Way Relaying System","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Carleton University","funders":"Ontario Ministry of Economic Development and Innovation","keywords":"Relay; Transmission (telecommunications); Computer science; Spectral efficiency; Selection (genetic algorithm); Antenna diversity; Constellation; Optimization problem; Cooperative diversity; Topology (electrical circuits); Algorithm; Mathematics; Telecommunications; Decoding methods; Wireless; Fading; Channel (broadcasting); Power (physics)","score_opus":0.023296115586931287,"score_gpt":0.2521944293406865,"score_spread":0.2288983137537552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570375860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037932064,0.00007589196,0.9535782,0.0060867327,0.00037043288,0.00024126051,0.0000023741616,0.00083150767,0.0008815486],"genre_scores_gemma":[0.9877799,0.000020910307,0.01191311,0.00014651858,0.000015540543,0.0000333079,4.0525487e-7,0.000012366084,0.000077951365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986262,0.00010731596,0.00020056264,0.0004695982,0.00025995012,0.00033639808],"domain_scores_gemma":[0.99758184,0.00006517983,0.00015759477,0.0019880054,0.00013883552,0.00006856598],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030869577,0.00019655829,0.00022508546,0.0004137664,0.0031883568,0.00019378116,0.0023233693,0.00016375475,0.000015713109],"category_scores_gemma":[0.000008604852,0.00019839677,0.00013831146,0.0004091683,0.0002149407,0.0001578307,0.0000681178,0.00058346847,0.00010999829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099736775,0.00089446764,0.00039663358,0.00007680647,0.00027279678,0.0004600329,0.0006857622,0.52474606,0.035862617,0.30645862,0.00021531183,0.12983117],"study_design_scores_gemma":[0.0012703806,0.00018441677,0.00014137436,0.00018480548,0.00003561221,0.000053885935,0.00007298694,0.8855553,0.11103355,0.00016812618,0.00092272036,0.00037680953],"about_ca_topic_score_codex":0.00001720531,"about_ca_topic_score_gemma":0.00005200858,"teacher_disagreement_score":0.9498478,"about_ca_system_score_codex":0.00020839558,"about_ca_system_score_gemma":0.000063241205,"threshold_uncertainty_score":0.99810934},"labels":[],"label_agreement":null},{"id":"W2576389945","doi":"10.1002/ett.3073","title":"Emerging network architecture and functional design considerations for 5G radio access","year":2016,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Ministry of Economy, Trade and Industry","keywords":"Metis; Architecture; Key (lock); Telecommunications; Air interface; Radio access network; Computer science; Interface (matter); Systems engineering; Engineering; Wireless; Computer security; World Wide Web; Base station; Geography; Mobile station","score_opus":0.07573652117560169,"score_gpt":0.3038679969770464,"score_spread":0.22813147580144472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576389945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016280993,0.0012754861,0.9234801,0.072235376,0.00015489814,0.0005936944,0.0000069847165,0.0017987397,0.00029193197],"genre_scores_gemma":[0.66423887,0.005549443,0.32901672,0.00023944472,0.000019786386,0.0007348798,0.0000030150327,0.0000213007,0.0001765631],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983386,0.00022803548,0.00040919785,0.000468516,0.00015374467,0.00040195216],"domain_scores_gemma":[0.9948641,0.0027090462,0.00014807653,0.0019979856,0.00022517827,0.000055636057],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00051710615,0.00025751747,0.00023804704,0.00044130726,0.002277795,0.00025586647,0.0014360596,0.00013883348,0.00005722965],"category_scores_gemma":[0.00028597438,0.00020883018,0.000102871476,0.00087095774,0.00029356874,0.00068253855,0.00010988415,0.00038370478,0.000009963111],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002165298,0.00013427882,0.000046262634,0.000010257529,0.00012962773,4.9971754e-7,0.00034907303,0.044086445,0.0017736861,0.15036651,0.004199382,0.7988823],"study_design_scores_gemma":[0.0046105417,0.0007457851,0.0023896024,0.0008406919,0.0001906466,0.00020078663,0.0006498395,0.18137921,0.041833747,0.6056697,0.15868035,0.0028091313],"about_ca_topic_score_codex":0.0000030416102,"about_ca_topic_score_gemma":0.00006398322,"teacher_disagreement_score":0.7960732,"about_ca_system_score_codex":0.00009463193,"about_ca_system_score_gemma":0.00010270706,"threshold_uncertainty_score":0.9990211},"labels":[],"label_agreement":null},{"id":"W2578635061","doi":"10.1109/icsae.2016.7810225","title":"Rank deficient decoding for arithmetic subspace network coding","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Linear network coding; Decoding methods; Subspace topology; Computer science; Algorithm; List decoding; Coding (social sciences); Theoretical computer science; Linear subspace; Arithmetic; Mathematics; Computer network; Artificial intelligence; Block code; Statistics; Concatenated error correction code","score_opus":0.04708979387768664,"score_gpt":0.28664120629242457,"score_spread":0.23955141241473793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578635061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012150247,0.00049135234,0.9854688,0.0067270636,0.0003894505,0.0002585905,5.9753427e-7,0.0002333174,0.0052157748],"genre_scores_gemma":[0.80438995,0.0006031422,0.19219774,0.0007874828,0.00012030959,0.000058512192,7.3203194e-7,0.00001096332,0.001831156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988251,0.000086312095,0.00022347487,0.0003253972,0.00013798931,0.00040176808],"domain_scores_gemma":[0.99818,0.0008296995,0.00007151643,0.0006699804,0.00015317457,0.000095673844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071305555,0.00012802641,0.00015349014,0.00006372259,0.00040735782,0.00015891153,0.00089671125,0.0000383195,0.000053168354],"category_scores_gemma":[0.00013961861,0.00008538321,0.00008330565,0.00039186573,0.000037070637,0.00028972764,0.00037724798,0.000056284138,0.00005328661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052373007,0.00001824526,0.00039680937,0.0000036679403,0.0000100334255,5.6695154e-7,0.000122379,0.00013510456,0.0018308396,0.75758713,0.007950232,0.23193973],"study_design_scores_gemma":[0.0030074609,0.00021604897,0.0016602279,0.00039832873,0.000022306254,0.000026632533,0.0000522184,0.7669631,0.008563465,0.016946547,0.20110421,0.0010394496],"about_ca_topic_score_codex":8.921354e-7,"about_ca_topic_score_gemma":0.000030769454,"teacher_disagreement_score":0.8031749,"about_ca_system_score_codex":0.00006740679,"about_ca_system_score_gemma":0.000041022347,"threshold_uncertainty_score":0.34818262},"labels":[],"label_agreement":null},{"id":"W2582667927","doi":"10.1109/tvt.2017.2659539","title":"FlexONC: Joint Cooperative Forwarding and Network Coding With Precise Encoding Conditions","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear network coding; Computer science; Network packet; Computer network; Packet forwarding; Wireless network; Coding (social sciences); Encoding (memory); Broadcasting (networking); Wireless; Distributed computing; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.035188348284649076,"score_gpt":0.28060100145679534,"score_spread":0.24541265317214628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582667927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009730703,0.00085314526,0.98200625,0.0038202342,0.0007145649,0.00091987575,0.000028523515,0.0008473456,0.0010793498],"genre_scores_gemma":[0.97115993,0.0044767354,0.023326006,0.00016685984,0.000069749476,0.0005444089,0.00001240906,0.00004418516,0.00019971414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739224,0.00021156829,0.00047581707,0.0010790473,0.00028508046,0.00055627734],"domain_scores_gemma":[0.9965467,0.00016792024,0.0003920591,0.0023607402,0.0003883291,0.00014425321],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045337385,0.00054093025,0.0007421428,0.0006856035,0.0023243865,0.00057997776,0.001614398,0.0006277631,0.000014478146],"category_scores_gemma":[0.00003105608,0.00050678116,0.00015911565,0.0005757166,0.0005308608,0.0003956105,0.00017955282,0.002176277,0.00003577284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089127156,0.0005440917,0.00011317595,0.000244353,0.0017865783,0.00030402635,0.0021285866,0.54741347,0.011040078,0.136212,0.0013094225,0.29881507],"study_design_scores_gemma":[0.0030885173,0.0010848134,0.00023590097,0.005669331,0.00049414026,0.00069304014,0.00039119562,0.88543874,0.07887926,0.013152408,0.007700966,0.0031717108],"about_ca_topic_score_codex":0.000013662944,"about_ca_topic_score_gemma":0.00016825716,"teacher_disagreement_score":0.96142924,"about_ca_system_score_codex":0.00020270715,"about_ca_system_score_gemma":0.0002410426,"threshold_uncertainty_score":0.9997384},"labels":[],"label_agreement":null},{"id":"W2583117607","doi":"10.1109/glocom.2016.7841547","title":"A Sequential Posted Price Mechanism for D2D Content Sharing Communications","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Incentive; Disadvantage; Mechanism design; Computer network; Game theory; Base station; Transmission (telecommunications); Operations research; Computer security; Microeconomics; Telecommunications; Economics","score_opus":0.20736588172251114,"score_gpt":0.33153452282334234,"score_spread":0.1241686411008312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583117607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009661915,0.00009450394,0.972752,0.019787692,0.00012994996,0.00033803412,0.000002669442,0.00023246293,0.0056965253],"genre_scores_gemma":[0.886386,0.00038421582,0.108213216,0.0013398533,0.00002540317,0.000125906,0.0000035105645,0.000008142363,0.0035137506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919444,0.00006554116,0.00021585857,0.00023359768,0.00009611616,0.00019443908],"domain_scores_gemma":[0.9975118,0.0002588771,0.000071475486,0.0017162244,0.00037052055,0.00007110896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030057877,0.00009001355,0.000102710525,0.000055553348,0.00032012112,0.00012408361,0.0023783448,0.000032844084,0.000044604818],"category_scores_gemma":[0.000075974116,0.000061905266,0.000062594634,0.0001810457,0.000037470632,0.0003758735,0.0014424195,0.000055044497,0.00004544583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002418056,0.000025378571,0.000021896876,0.0000013925876,0.000012368419,1.17963744e-7,0.00013914226,1.4674177e-7,0.040292904,0.932038,0.00027837016,0.02718785],"study_design_scores_gemma":[0.006006346,0.00044512178,0.0010512639,0.00039602176,0.000039080507,0.00004753262,0.00019984525,0.6627116,0.10450593,0.12106115,0.10214081,0.0013952781],"about_ca_topic_score_codex":0.00000677513,"about_ca_topic_score_gemma":0.00006855196,"teacher_disagreement_score":0.8854198,"about_ca_system_score_codex":0.0000650426,"about_ca_system_score_gemma":0.000040099523,"threshold_uncertainty_score":0.4419596},"labels":[],"label_agreement":null},{"id":"W2584912154","doi":"10.1109/glocom.2016.7841936","title":"Joint Sparse Beamforming and Network Coding for Downlink Multi-Hop Cloud Radio Access Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Radio access network; Telecommunications link; Linear network coding; Multicast; Cloud computing; C-RAN; Beamforming; Remote radio head; Wireless network; Distributed computing; Wireless; Base station; Network packet; Channel (broadcasting); Telecommunications","score_opus":0.09091188780253166,"score_gpt":0.311042791035177,"score_spread":0.22013090323264534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584912154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013785906,0.00086968235,0.9929468,0.0027407121,0.0007175927,0.00043915832,0.0000011219992,0.0002377576,0.00066857896],"genre_scores_gemma":[0.76835406,0.0052893846,0.22199795,0.0017164298,0.000904607,0.00010732938,0.000004249326,0.000028065964,0.0015979116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844694,0.0001011993,0.0003773312,0.00044791508,0.0001174179,0.00050917635],"domain_scores_gemma":[0.99825364,0.00054188655,0.00013989523,0.000723893,0.0001689893,0.00017168785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008396488,0.00020576362,0.000275885,0.00006784916,0.00056400313,0.00043457255,0.0010641329,0.000083379746,0.000031082283],"category_scores_gemma":[0.00010632923,0.00014018433,0.00008164894,0.00033016223,0.000078113095,0.0010161296,0.0011504638,0.00013218612,0.0000073078645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026815045,0.000061637285,0.0020232063,0.000017934432,0.00006443041,0.0000028703098,0.00038712812,0.003101188,0.0010213212,0.26425612,0.020221366,0.708816],"study_design_scores_gemma":[0.0015108052,0.00006217995,0.001529065,0.00020971651,0.000010577717,0.000015334048,0.000012595276,0.9661278,0.0005052557,0.0012040476,0.028389696,0.00042293564],"about_ca_topic_score_codex":0.0000032001367,"about_ca_topic_score_gemma":0.000056071694,"teacher_disagreement_score":0.9630266,"about_ca_system_score_codex":0.000060534752,"about_ca_system_score_gemma":0.00003783079,"threshold_uncertainty_score":0.5716551},"labels":[],"label_agreement":null},{"id":"W2584940104","doi":"10.1109/glocom.2016.7842325","title":"Throughput Analysis of Network Coding in Multi-Hop Wireless Mesh Networks Using Queueing Theory","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Retransmission; Computer science; Queueing theory; Linear network coding; Unicast; Computer network; Network packet; Coding (social sciences); Layered queueing network; Queue; Wireless network; Distributed computing; Wireless; Mathematics; Telecommunications","score_opus":0.0807333449645538,"score_gpt":0.333492920550693,"score_spread":0.2527595755861392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584940104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011531186,0.0016231043,0.9837104,0.00016672676,0.0006327695,0.00035076324,0.0000028264608,0.0001644396,0.0018177821],"genre_scores_gemma":[0.94673645,0.0032809386,0.0493585,0.00026106887,0.00013344275,0.00002498392,0.000013376709,0.00002807786,0.00016313771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957733,0.001280037,0.0010861347,0.00093035406,0.00031880694,0.0006113711],"domain_scores_gemma":[0.9955245,0.0010473169,0.0007017932,0.0022995912,0.0003203095,0.00010648264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025903545,0.00044937246,0.0011813291,0.0006579604,0.00022938522,0.00022578579,0.002800763,0.0003649587,0.00008065876],"category_scores_gemma":[0.000073899624,0.00038037924,0.0004371831,0.002689297,0.00014349897,0.00035325284,0.0056239935,0.0008145967,0.0000022416516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016729064,0.00009447805,0.009955924,0.000033937704,0.0010644271,0.000008477156,0.001349101,0.4741193,0.00024377913,0.46146047,0.00008975013,0.051563617],"study_design_scores_gemma":[0.00029166855,0.000007513257,0.003275593,0.000788405,0.0001809701,8.9226535e-7,0.00004069502,0.9929224,0.00007762901,0.0019207491,0.000037278292,0.00045620455],"about_ca_topic_score_codex":0.00009024767,"about_ca_topic_score_gemma":0.0008511753,"teacher_disagreement_score":0.9352053,"about_ca_system_score_codex":0.0002610367,"about_ca_system_score_gemma":0.00019605977,"threshold_uncertainty_score":0.9998648},"labels":[],"label_agreement":null},{"id":"W2585685126","doi":"10.1109/glocom.2016.7842212","title":"Relay Selection to Improve Secrecy in Cooperative Threshold Decode-and-Forward Relaying","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Relay; Rayleigh fading; Secrecy; Selection (genetic algorithm); Decoding methods; Channel (broadcasting); Channel state information; Outage probability","score_opus":0.02330233760304065,"score_gpt":0.27642161384329256,"score_spread":0.2531192762402519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585685126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13585778,0.0001404,0.8487332,0.0072026458,0.00015152273,0.00030260326,5.0955936e-7,0.00015972705,0.007451635],"genre_scores_gemma":[0.98021895,0.0003760045,0.01556573,0.0011642562,0.000027928756,0.000051200317,3.1466797e-7,0.00000801806,0.0025875883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989224,0.000104345316,0.00023386473,0.00038670917,0.00011474086,0.0002379156],"domain_scores_gemma":[0.9991591,0.0001795619,0.00003677105,0.00038332058,0.00012910928,0.000112159534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045652696,0.0001244097,0.0001412351,0.00015087063,0.00017125408,0.00011331291,0.00043132817,0.00005324159,0.00005416478],"category_scores_gemma":[0.00012149096,0.000083892715,0.00002361197,0.00062085805,0.000023582386,0.00058748643,0.00046314186,0.00013694413,0.000077824196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000301143,0.00006131497,0.012527207,0.0000042366137,0.000020494455,0.000003397277,0.0021416696,0.00057045766,0.073236726,0.5041394,0.0017729842,0.405492],"study_design_scores_gemma":[0.0066518253,0.0017198746,0.057792097,0.00084574946,0.000019429597,0.00008134993,0.00039586477,0.7203282,0.14251596,0.0076298644,0.059204567,0.0028151907],"about_ca_topic_score_codex":0.000011699398,"about_ca_topic_score_gemma":0.0005263978,"teacher_disagreement_score":0.8443612,"about_ca_system_score_codex":0.00011585321,"about_ca_system_score_gemma":0.00005418561,"threshold_uncertainty_score":0.34210455},"labels":[],"label_agreement":null},{"id":"W2585687159","doi":"10.1007/978-3-319-53007-9_18","title":"Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.06490744186987044,"score_gpt":0.3080399301277933,"score_spread":0.24313248825792286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585687159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011805568,0.003783369,0.99127984,0.00095096766,0.0019303269,0.00062932004,0.000008667685,0.00014978767,0.0011496749],"genre_scores_gemma":[0.052623104,0.0006143003,0.9422156,0.0021115532,0.0006526742,0.00001770289,0.000019666924,0.000077597375,0.0016677945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599344,0.000048711696,0.0006237902,0.0016717684,0.000854925,0.00080738566],"domain_scores_gemma":[0.99516547,0.000561396,0.00054105686,0.0028334507,0.0005678058,0.0003308257],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00087383256,0.00068704766,0.0006806189,0.0009285687,0.0014285432,0.0012367509,0.0059035053,0.00032684093,0.000029059585],"category_scores_gemma":[0.0001706959,0.00065137784,0.00031623614,0.00042613747,0.000911584,0.0010059841,0.002827,0.0008296957,0.00001771791],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009535244,0.00002493462,0.00002952055,0.000018693647,0.000022378797,0.000012931016,0.0003401383,0.0064425636,0.0005086162,0.08631955,0.00019097612,0.9060802],"study_design_scores_gemma":[0.0006594103,0.0001388813,0.00004499281,0.0007760107,0.000017731943,0.000083679486,1.2125851e-7,0.76120776,0.0007945765,0.19926366,0.0360189,0.0009942525],"about_ca_topic_score_codex":0.000023682764,"about_ca_topic_score_gemma":0.000079813704,"teacher_disagreement_score":0.9050859,"about_ca_system_score_codex":0.00021804548,"about_ca_system_score_gemma":0.0012168112,"threshold_uncertainty_score":0.99987143},"labels":[],"label_agreement":null},{"id":"W2585801176","doi":"10.1109/glocom.2016.7841600","title":"Analysis of Batched Opportunistic Data Forwarding in Wireless Mesh Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Network packet; Packet forwarding; Schedule; Markov chain; Wireless; Markov process; Channel (broadcasting); Distributed computing; Telecommunications","score_opus":0.09893264845516986,"score_gpt":0.31832594729256275,"score_spread":0.2193932988373929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585801176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059505915,0.00003540167,0.99073935,0.00094158377,0.00005438897,0.00005910182,0.000003736128,0.000043537155,0.0021723362],"genre_scores_gemma":[0.9954006,0.0008485038,0.0033158946,0.00012782587,0.000011093597,0.0000037917296,0.000018151388,0.0000035134722,0.00027062374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989485,0.00013216426,0.0003165737,0.00030370578,0.00012941685,0.00016964445],"domain_scores_gemma":[0.9974432,0.00040550472,0.00009638934,0.0019195679,0.00007667037,0.000058644557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007632709,0.000081298866,0.00026062725,0.00025024635,0.000044725206,0.000036757006,0.0021216625,0.00003354758,0.000104039085],"category_scores_gemma":[0.00006966497,0.000055451088,0.000049369315,0.0016363601,0.00003853939,0.00041403333,0.0013820523,0.00005738447,0.0000030295869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053283675,0.00006204457,0.028895555,0.000003038863,0.0002831028,0.0000043441346,0.0001771589,0.00020989212,0.001263538,0.42616284,0.0007771261,0.54215604],"study_design_scores_gemma":[0.0001765741,0.000008048156,0.008592198,0.000029098315,0.000039135382,3.3669062e-7,0.000013003591,0.99064255,0.000055699777,0.00007493638,0.00027316142,0.00009527968],"about_ca_topic_score_codex":0.000014132365,"about_ca_topic_score_gemma":0.00043844365,"teacher_disagreement_score":0.9904326,"about_ca_system_score_codex":0.00002906587,"about_ca_system_score_gemma":0.000043759897,"threshold_uncertainty_score":0.3942612},"labels":[],"label_agreement":null},{"id":"W2586213791","doi":"10.1109/glocomw.2016.7848868","title":"D2D Relay Selection and Fairness on 5G Wireless Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer network; Computer science; Relay; Wireless network; Cellular network; Wireless; Enhanced Data Rates for GSM Evolution; Power (physics); Telecommunications","score_opus":0.02099069366667922,"score_gpt":0.2481693198396829,"score_spread":0.2271786261730037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586213791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033418376,0.00007885601,0.9566419,0.0032319801,0.00014732787,0.00007207083,7.335336e-8,0.0001810359,0.006228352],"genre_scores_gemma":[0.9952858,0.0007520526,0.001420597,0.00049519463,0.00005213824,0.000009246764,2.294024e-7,0.000004669364,0.0019800768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993562,0.00009715032,0.00010371063,0.00021952718,0.000083079496,0.00014035143],"domain_scores_gemma":[0.999358,0.00016964356,0.000032109783,0.0003197042,0.00006420259,0.000056366483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000191193,0.00007888112,0.00007584262,0.000043933294,0.00017825516,0.00008408259,0.00032137294,0.000040256593,0.000037122754],"category_scores_gemma":[0.000010912343,0.00004949225,0.000016776954,0.00024408582,0.000024640865,0.00025950914,0.00013658835,0.00007924617,0.000029368255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004658176,0.000018227835,0.0008904032,7.631649e-7,0.00000511144,4.7364733e-7,0.00007099418,0.00010508098,0.0009241073,0.32232532,0.001611425,0.6740434],"study_design_scores_gemma":[0.00071186916,0.00017788596,0.010189092,0.00011205288,0.0000030964761,0.000017048615,0.000010426603,0.96399057,0.0038374215,0.0006637594,0.019944081,0.00034268585],"about_ca_topic_score_codex":0.0000021428903,"about_ca_topic_score_gemma":0.00005075132,"teacher_disagreement_score":0.9638855,"about_ca_system_score_codex":0.00003021914,"about_ca_system_score_gemma":0.000013213702,"threshold_uncertainty_score":0.20182353},"labels":[],"label_agreement":null},{"id":"W2586633569","doi":"","title":"Network Descriptors Based on Betweenness Centrality and Transmission and their Extremal Values","year":2011,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Betweenness centrality; Centrality; Network theory; Transmission (telecommunications); Mathematics; Computer science; Theoretical computer science; Combinatorics; Telecommunications","score_opus":0.046103757014474916,"score_gpt":0.22119234785641548,"score_spread":0.17508859084194056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586633569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3901567,0.0015187142,0.6055079,0.0011177589,0.00016327924,0.0001611491,0.0000013621948,0.00013697687,0.0012361808],"genre_scores_gemma":[0.9730637,0.0004978119,0.02560941,0.0007025839,0.00006105833,0.0000061124447,0.00000255096,0.000008044058,0.00004873725],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989521,0.00028020845,0.00015153126,0.00029447433,0.00008868367,0.0002329988],"domain_scores_gemma":[0.99924827,0.00015671136,0.000046971785,0.00037075786,0.000036879377,0.00014041833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035543958,0.0001567205,0.00015787664,0.000044399938,0.00050412724,0.0000898295,0.0003484065,0.00007773339,0.000017306424],"category_scores_gemma":[0.000013444934,0.00012222385,0.000035904108,0.00018673475,0.00017883426,0.0001918843,0.000074346106,0.00020350757,0.0000010309399],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008107193,0.00013656521,0.035101183,0.000027655253,0.000030810294,0.000009104506,0.020803524,0.00008129527,0.0004633024,0.18434647,0.00096948526,0.75794953],"study_design_scores_gemma":[0.0025487703,0.0006090142,0.4711181,0.00040952163,0.000040845516,0.000025552488,0.0004446753,0.44406325,0.0047470448,0.04805777,0.026502581,0.0014328783],"about_ca_topic_score_codex":0.000010374471,"about_ca_topic_score_gemma":0.0000057880316,"teacher_disagreement_score":0.75651664,"about_ca_system_score_codex":0.000027654825,"about_ca_system_score_gemma":0.00001773106,"threshold_uncertainty_score":0.4984144},"labels":[],"label_agreement":null},{"id":"W2589141113","doi":"","title":"Optimal Power Allocation for a Successive Refinable Source with Multiple Descriptions over a Fading Relay Channel Using Broadcast/Multicast Strategies","year":2009,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Multicast; Fading; Relay; Channel (broadcasting); Computer science; Computer network; Power (physics); Channel state information; Electronic engineering; Telecommunications; Wireless; Engineering; Physics","score_opus":0.025467679812375254,"score_gpt":0.24513232123152284,"score_spread":0.2196646414191476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589141113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6140904,0.00022989794,0.3844754,0.0003233286,0.000110116656,0.0005106836,0.000010298162,0.0001054879,0.00014437389],"genre_scores_gemma":[0.8535476,0.00015992485,0.09537887,0.000027676568,0.000028705834,0.000004435587,0.00023768123,0.00003355646,0.05058156],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985617,0.000097681404,0.00018472096,0.00052995543,0.00025734087,0.00036862376],"domain_scores_gemma":[0.9981262,0.000107712476,0.00040854834,0.00060078054,0.0006558151,0.00010090746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017685904,0.0003057396,0.00038128576,0.0003548379,0.0008291729,0.0002235344,0.00091775967,0.00020967762,0.00001751486],"category_scores_gemma":[0.00002850025,0.00033488186,0.00013952708,0.00047446977,0.0000810881,0.0013545111,0.00013691738,0.00028411622,0.000004423538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012957515,0.0006817951,0.00015367928,0.00045926042,0.00056058017,0.000047447145,0.63493407,0.28802556,0.03844068,0.012205627,0.0010404903,0.022155093],"study_design_scores_gemma":[0.0022012412,0.0005187357,0.0015041885,0.0009842314,0.00017448008,0.000010967682,0.14774925,0.8433183,0.0011617172,0.00006622433,0.0014578778,0.00085281447],"about_ca_topic_score_codex":0.0028839444,"about_ca_topic_score_gemma":0.014590114,"teacher_disagreement_score":0.5552927,"about_ca_system_score_codex":0.00018541976,"about_ca_system_score_gemma":0.00025536556,"threshold_uncertainty_score":0.9999103},"labels":[],"label_agreement":null},{"id":"W2593255571","doi":"10.1109/acssc.2016.7869588","title":"Joint relay beamforming and receiver processing for multi-way multi-antenna relaying","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Relay; Computer science; Maximization; Joint (building); Optimization problem; Signal-to-noise ratio (imaging); Antenna (radio); Power (physics); Electronic engineering; Algorithm; Mathematical optimization; Telecommunications; Mathematics; Engineering","score_opus":0.12957064669183713,"score_gpt":0.3180622246574869,"score_spread":0.18849157796564978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593255571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005590339,0.0007456068,0.990634,0.002124866,0.00013265325,0.00027512983,7.699187e-7,0.00019452006,0.0003021128],"genre_scores_gemma":[0.42343715,0.00055451744,0.57288814,0.00037477753,0.000025530213,0.000040144125,5.4332247e-7,0.0000118994585,0.0026672787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892884,0.000055811848,0.00027296817,0.0003694074,0.00009844171,0.00027453792],"domain_scores_gemma":[0.9990171,0.00016250898,0.00010495228,0.0004241705,0.00019719041,0.00009404353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052238844,0.00014040624,0.00015839457,0.00008905095,0.00048718054,0.0001499328,0.0004268842,0.000053730273,0.000011288355],"category_scores_gemma":[0.00022151196,0.000090034126,0.000048528513,0.00018511245,0.000059324004,0.00086803915,0.00041190846,0.00009216495,0.000012591122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007177552,0.000055912707,0.00086449645,0.0000227357,0.0000129353275,0.0000013036644,0.0018298159,0.000006136148,0.0673418,0.010962978,0.0002689743,0.9186257],"study_design_scores_gemma":[0.0020876331,0.00006923256,0.003131951,0.00045513545,0.000007937132,0.000017868768,0.00012819238,0.97290874,0.007512945,0.00013052711,0.013128218,0.000421626],"about_ca_topic_score_codex":0.0000027256335,"about_ca_topic_score_gemma":0.000031394997,"teacher_disagreement_score":0.9729026,"about_ca_system_score_codex":0.00005195446,"about_ca_system_score_gemma":0.000036798665,"threshold_uncertainty_score":0.3747048},"labels":[],"label_agreement":null},{"id":"W2593423258","doi":"10.1109/tcomm.2017.2679194","title":"Optimal Training Design for MIMO-OFDM Two-Way Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea","keywords":"Relay; MIMO; Fading; Orthogonal frequency-division multiplexing; Node (physics); Channel (broadcasting); Computer science; Minimum mean square error; Relay channel; Mean squared error; Signal-to-noise ratio (imaging); Convex optimization; Computational complexity theory; Control theory (sociology); Mathematical optimization; Mathematics; Algorithm; Power (physics); Regular polygon; Telecommunications; Engineering; Statistics","score_opus":0.18213757611971593,"score_gpt":0.3540135723578985,"score_spread":0.17187599623818256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593423258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016349813,0.0004005086,0.98754066,0.00749961,0.00056671695,0.0006547052,0.000010775495,0.00029740832,0.002866109],"genre_scores_gemma":[0.6873047,0.0014945654,0.3097098,0.00027950093,0.000043053456,0.00046184185,0.000005314478,0.000023752344,0.0006774829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982112,0.0003973355,0.0004163418,0.0004049333,0.00016979959,0.00040039036],"domain_scores_gemma":[0.990924,0.001233294,0.00025593795,0.0071597775,0.00026784156,0.0001591209],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.000915315,0.00024306621,0.000263126,0.00015235988,0.005761978,0.0006839935,0.0063884505,0.00010786389,0.0000272363],"category_scores_gemma":[0.000051690808,0.00025850313,0.00020917639,0.00025030048,0.00030004585,0.0008343751,0.000067971574,0.00061795686,0.000038872677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040373285,0.0004021393,0.0000050358453,0.0000049364726,0.00013595234,0.000001078923,0.0026649933,0.54316366,0.0005547152,0.041447043,0.0014053251,0.41017476],"study_design_scores_gemma":[0.000889589,0.00012037774,0.00008142267,0.00006979657,0.000032967455,0.000009978674,0.00006397836,0.9823977,0.00089744356,0.000362091,0.014753271,0.0003214202],"about_ca_topic_score_codex":0.000016089667,"about_ca_topic_score_gemma":0.00020129707,"teacher_disagreement_score":0.6871412,"about_ca_system_score_codex":0.00009461676,"about_ca_system_score_gemma":0.00013236616,"threshold_uncertainty_score":0.9999867},"labels":[],"label_agreement":null},{"id":"W2600366014","doi":"10.1109/tsp.2017.2686323","title":"Jointly Optimal Pre- and Post-Channel Equalization and Distributed Beamforming in Asynchronous Bidirectional Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Transceiver; Relay; Beamforming; Computer science; Intersymbol interference; Channel (broadcasting); Equalization (audio); Asynchronous communication; Relay channel; Electronic engineering; Computer network; Power (physics); Telecommunications; Engineering; Wireless","score_opus":0.02707992270245189,"score_gpt":0.2800713897339359,"score_spread":0.252991467031484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600366014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04000893,0.0005244901,0.9586335,0.00042276486,0.00010435652,0.0001396625,0.0000039181614,0.00007972518,0.00008267755],"genre_scores_gemma":[0.99410725,0.00034400102,0.005333719,0.000097026765,0.000033646982,0.000025582993,0.0000042659267,0.000011025677,0.000043473752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989912,0.00007569979,0.00024776236,0.00033040496,0.00014474856,0.00021020514],"domain_scores_gemma":[0.9992878,0.000094239214,0.0001445661,0.00026376653,0.000126518,0.00008314034],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00032890914,0.00015061202,0.00015303759,0.0001400526,0.0015118641,0.0006164373,0.0002988896,0.0000827091,0.000005720544],"category_scores_gemma":[0.000011860122,0.00015321004,0.000027660291,0.00019412323,0.00010938842,0.0012202774,0.000018487004,0.0003024084,9.41974e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061627754,0.00011665101,0.00013314659,0.000030141464,0.000017747756,0.0000045649767,0.0016355634,0.42154208,0.0022513582,0.00037565254,0.0000058055616,0.57382566],"study_design_scores_gemma":[0.00042960903,0.00009336328,0.0040372,0.0002071777,0.000008484589,0.000032229567,0.00005230824,0.99346966,0.001363229,0.00007503591,0.00003981619,0.00019189272],"about_ca_topic_score_codex":0.000020272226,"about_ca_topic_score_gemma":0.00007064604,"teacher_disagreement_score":0.95409834,"about_ca_system_score_codex":0.000065526656,"about_ca_system_score_gemma":0.00007085407,"threshold_uncertainty_score":0.99978805},"labels":[],"label_agreement":null},{"id":"W2600601717","doi":"10.1109/vtcfall.2016.7881224","title":"Simplified Performance Analysis for Amplify-and-Forward Cooperative Diversity Optimal Detection of Binary Signals with Symmetric Alpha-Stable Noise","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Noise (video); Correctness; Computer science; Binary number; Probability density function; Algorithm; Interference (communication); Unavailability; Diversity combining; Range (aeronautics); Applied mathematics; Mathematics; Topology (electrical circuits); Fading; Statistics; Telecommunications; Channel (broadcasting); Artificial intelligence; Combinatorics; Engineering","score_opus":0.03569901196056392,"score_gpt":0.2529840984676634,"score_spread":0.2172850865070995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600601717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37528002,0.000085734704,0.6240224,0.00015638079,0.0000156343,0.00018263137,0.0000049863806,0.00004177825,0.00021037813],"genre_scores_gemma":[0.9900946,0.000457865,0.00884809,0.00009021422,0.000009894967,0.000026607253,0.0000027281458,0.0000049542546,0.000465019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990045,0.000085614905,0.00020931433,0.00032106985,0.00017471137,0.00020482756],"domain_scores_gemma":[0.9984876,0.0004300745,0.00012818714,0.00043538975,0.00043467688,0.00008409086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040461536,0.00013710378,0.00027286995,0.0003783565,0.0005055867,0.000052990163,0.0004835541,0.000043891454,0.000029894052],"category_scores_gemma":[0.000044593882,0.000085677435,0.00006629539,0.0018126923,0.00008560208,0.0006698457,0.0006310037,0.00006046599,0.0000031225236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016069585,0.0007602411,0.11229029,0.00015844963,0.003630543,0.0000044278117,0.0045396956,0.045678094,0.23966292,0.051818263,0.0005113737,0.53933877],"study_design_scores_gemma":[0.002392559,0.0016668679,0.0731219,0.000059765,0.00026874023,0.0000045609513,0.00012563226,0.804783,0.1158499,0.00005514122,0.0011139906,0.0005579443],"about_ca_topic_score_codex":0.000016884615,"about_ca_topic_score_gemma":0.000045700737,"teacher_disagreement_score":0.7591049,"about_ca_system_score_codex":0.00004960163,"about_ca_system_score_gemma":0.00003401069,"threshold_uncertainty_score":0.3888615},"labels":[],"label_agreement":null},{"id":"W2600809465","doi":"10.3837/tiis.2016.12.002","title":"Cluster-based Cooperative Data Forwarding with Multi-radio Multi-channel for Multi-flow Wireless Networks","year":2016,"lang":"en","type":"article","venue":"KSII Transactions on Internet and Information Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Medical Research and Materiel Command; Khulna University; University of British Columbia; Chinese University of Hong Kong; Nanyang Technological University; Auckland University of Technology, New Zealand; City University of Hong Kong","keywords":"Computer science; Computer network; Channel (broadcasting); Cluster (spacecraft); Wireless; Flow (mathematics); Wireless network; Telecommunications","score_opus":0.0714968182210633,"score_gpt":0.2850869904874533,"score_spread":0.21359017226639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600809465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027355726,0.00011025373,0.997243,0.000421893,0.0005705196,0.0010241742,0.000115748684,0.00018915226,0.00005171275],"genre_scores_gemma":[0.9606233,0.0002221321,0.037946273,0.00031229918,0.000038124825,0.00026556387,0.00008352784,0.000017046123,0.0004917281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984648,0.00014899085,0.0005647017,0.00034541893,0.00018567983,0.00029038847],"domain_scores_gemma":[0.9980669,0.00029403297,0.00023063428,0.0008639528,0.00040764635,0.00013685487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259238,0.0002662298,0.00029132044,0.0002311716,0.00038156178,0.00051504374,0.00087714125,0.000111712834,0.0000061920487],"category_scores_gemma":[0.000022670863,0.00017899639,0.000057950656,0.0002768014,0.00008199743,0.0040492653,0.000050421353,0.00017442918,0.000018704173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006522147,0.0006577859,0.00016625322,0.00030127147,0.00057325664,0.000001989084,0.012782308,0.47604245,0.00011249841,0.0065432256,0.002596074,0.49957067],"study_design_scores_gemma":[0.0042925784,0.00020724101,0.000061705825,0.00046687748,0.00001580927,0.000012919719,0.00038032045,0.98698235,0.00018439998,3.737762e-7,0.007111607,0.0002838173],"about_ca_topic_score_codex":0.000024806195,"about_ca_topic_score_gemma":0.00013427509,"teacher_disagreement_score":0.96034974,"about_ca_system_score_codex":0.00010054534,"about_ca_system_score_gemma":0.00006737917,"threshold_uncertainty_score":0.72992605},"labels":[],"label_agreement":null},{"id":"W26012853","doi":"10.1007/978-3-642-35076-4_5","title":"Green Cooperative Transmission Scheme for Estimate-and-Forward Relay Based Wireless Communication Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Wireless; Cooperative diversity; Relay channel; Transmitter power output; Diversity gain; Computer network; Power (physics); Decoding methods; Electronic engineering; Telecommunications; Real-time computing; Wireless network; Fading; Channel (broadcasting); Engineering; Transmitter","score_opus":0.05578673397327276,"score_gpt":0.31187289997697204,"score_spread":0.25608616600369927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26012853","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006776223,0.00728652,0.9655489,0.002937898,0.00017772987,0.0013710868,0.000024302368,0.00016982708,0.022415997],"genre_scores_gemma":[0.2094075,0.042305242,0.74352306,0.0018090168,0.00007731405,0.0005510793,0.0004863955,0.00005280361,0.0017876164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772364,0.00014837648,0.0009709647,0.00037871674,0.00042186052,0.00035642544],"domain_scores_gemma":[0.9945881,0.0007419867,0.0004981031,0.0029823093,0.0009636101,0.00022593238],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00229265,0.00036854268,0.0004491002,0.00084296963,0.0014250181,0.00090944004,0.0038405575,0.00022258463,0.00000668988],"category_scores_gemma":[0.00004607118,0.00035928635,0.00006675495,0.00051431946,0.000995629,0.0063736755,0.002104327,0.0006025267,0.000018476427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062610875,0.00002298155,0.000027768623,0.0000557737,0.000009234127,5.9137207e-8,0.0017564682,0.000581979,0.00001529511,0.7189874,0.0001571831,0.2783796],"study_design_scores_gemma":[0.0005089701,0.00005638167,0.00018632137,0.0005061775,0.000010539378,0.000010118798,0.00001966504,0.8364823,0.000014661703,0.0007494351,0.16108632,0.00036910895],"about_ca_topic_score_codex":0.000019641604,"about_ca_topic_score_gemma":0.000015777841,"teacher_disagreement_score":0.8359003,"about_ca_system_score_codex":0.00021129815,"about_ca_system_score_gemma":0.00037230898,"threshold_uncertainty_score":0.9998859},"labels":[],"label_agreement":null},{"id":"W2604412474","doi":"10.1109/lcomm.2017.2691344","title":"Energy Efficient Coverage Extension Relay Node Placement in LTE-A Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Relay; LTE Advanced; Node (physics); Extension (predicate logic); Energy (signal processing); Telecommunications link; Telecommunications; Engineering; Mathematics; Power (physics)","score_opus":0.045010590172655025,"score_gpt":0.29215756610505045,"score_spread":0.24714697593239543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604412474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028495172,0.0012649873,0.92646676,0.038316343,0.0005883491,0.00022682265,0.0000014974663,0.00014211664,0.0044979407],"genre_scores_gemma":[0.975902,0.0037624422,0.014584951,0.005456229,0.000041687876,0.00008670934,0.0000126112645,0.000015910487,0.00013745285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981957,0.0004456028,0.0004105984,0.00038179316,0.00022135851,0.00034491948],"domain_scores_gemma":[0.99032015,0.00031367387,0.00027880343,0.0088937655,0.00010079734,0.000092822556],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00066194264,0.00019429311,0.00021352747,0.000171903,0.0015112624,0.0004740646,0.0063836486,0.00006863332,0.000011189563],"category_scores_gemma":[0.00006531098,0.00020245605,0.00008023043,0.00027824758,0.00022152528,0.0003623406,0.002256002,0.00041856544,0.000030316996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025147963,0.00060316996,0.0023089757,0.000006809136,0.00004890866,0.00002259164,0.001448244,0.8331073,0.012873119,0.049063012,0.019611292,0.08088146],"study_design_scores_gemma":[0.00061125157,0.0000149073385,0.007267872,0.00010849638,0.000004863178,0.0000057046827,0.000010477601,0.9633687,0.00025325158,0.000033405217,0.028045412,0.00027562684],"about_ca_topic_score_codex":0.00008584189,"about_ca_topic_score_gemma":0.00034495277,"teacher_disagreement_score":0.9474068,"about_ca_system_score_codex":0.00019208885,"about_ca_system_score_gemma":0.000042215277,"threshold_uncertainty_score":0.99978864},"labels":[],"label_agreement":null},{"id":"W2604464446","doi":"","title":"On the Performance of Selective Decode and Forward Relaying over Imperfectly Known Fading Relay Channels","year":2013,"lang":"en","type":"article","venue":"International Conference on Wireless and Mobile Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Fading; Relay; Computer science; Computer network; Electronic engineering; Outage probability; Channel (broadcasting); Telecommunications; Physics; Engineering; Power (physics)","score_opus":0.04090062555238363,"score_gpt":0.29989106839652513,"score_spread":0.2589904428441415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604464446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800784,0.00033824588,0.005952045,0.0043064193,0.00012000144,0.0004390109,0.0000048030865,0.000045432807,0.008715655],"genre_scores_gemma":[0.98937964,0.0088774515,0.0008027393,0.00036167278,0.0000140136835,0.00036342966,0.0000061376754,0.000007997813,0.00018694226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903065,0.00016499762,0.00025781913,0.00022951321,0.00017632057,0.00014067013],"domain_scores_gemma":[0.99769187,0.0007577427,0.00015721687,0.000956135,0.00037984585,0.000057208166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002873688,0.00013758623,0.00014868034,0.00011396923,0.0004806239,0.0002167126,0.0014831617,0.000048592625,0.00006589875],"category_scores_gemma":[0.000060718103,0.00010406449,0.00003627342,0.00018727698,0.00019287567,0.0003909692,0.0008128556,0.00032967897,0.000013467382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008705117,0.00008967782,0.0010307797,0.0000056412473,0.00004785041,1.1270642e-7,0.0023225474,0.0002490882,0.003659275,0.90449756,0.00028317928,0.08780559],"study_design_scores_gemma":[0.00035163012,0.00028780848,0.00531466,0.0003138842,0.0000066358293,0.0000068597237,0.00024726312,0.98648477,0.0020915833,0.002789056,0.0018842458,0.00022161729],"about_ca_topic_score_codex":0.00003317246,"about_ca_topic_score_gemma":0.00002166213,"teacher_disagreement_score":0.9862357,"about_ca_system_score_codex":0.000045113648,"about_ca_system_score_gemma":0.000047010813,"threshold_uncertainty_score":0.4243627},"labels":[],"label_agreement":null},{"id":"W2605154071","doi":"10.1109/access.2017.2692206","title":"Optimal Design and Energy Efficient Binary Resource Allocation of Interference-Limited Cellular Relay-Aided Systems With Consideration of Queue Stability","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Subcarrier; Mathematical optimization; Orthogonal frequency-division multiple access; Relay; Resource allocation; Throughput; Telecommunications link; Interference (communication); Queue; Power (physics); Orthogonal frequency-division multiplexing; Computer network; Mathematics; Telecommunications; Wireless","score_opus":0.08856072609155237,"score_gpt":0.29201236223880506,"score_spread":0.2034516361472527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605154071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4331795,0.0002103841,0.5661438,0.00013632764,0.000060283088,0.0001139232,6.2337364e-7,0.000017449072,0.00013769358],"genre_scores_gemma":[0.9941177,0.00007893503,0.0057207737,0.000018829112,0.000012185038,0.000021950838,0.0000026977439,0.000005546306,0.000021398151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872637,0.00040154805,0.0003264969,0.0002655586,0.000171109,0.000108918226],"domain_scores_gemma":[0.9977641,0.0002654272,0.00043519036,0.0010930437,0.00039516814,0.00004708512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006112004,0.00010834155,0.0002077981,0.000082116014,0.00026730276,0.00029235228,0.00096741406,0.000048652255,0.0000026674259],"category_scores_gemma":[0.00008327221,0.00009103466,0.000019036464,0.00014222521,0.00019590442,0.0004534416,0.0003268242,0.00008124814,2.5415247e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036140738,0.0003994653,0.0038538566,0.00018458097,0.00009871035,0.000008355287,0.004004316,0.75462604,0.194616,0.030193659,0.0003261153,0.01132749],"study_design_scores_gemma":[0.00033634494,0.00016392136,0.001835504,0.00017250403,0.000008833855,0.0000032294645,0.00005211914,0.8621241,0.1351297,0.000018127083,0.000049551243,0.000106107516],"about_ca_topic_score_codex":0.0001167116,"about_ca_topic_score_gemma":0.000025575577,"teacher_disagreement_score":0.5609382,"about_ca_system_score_codex":0.000030285957,"about_ca_system_score_gemma":0.000088337314,"threshold_uncertainty_score":0.37122855},"labels":[],"label_agreement":null},{"id":"W2607306415","doi":"10.1007/978-3-319-53472-5_1","title":"Relay Technology for 5G Networks and IoT Applications","year":2017,"lang":"en","type":"book-chapter","venue":"Studies in big data","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Relay; Software deployment; 3rd Generation Partnership Project 2; Computer science; Broadband; Computer network; LTE Advanced; Cellular network; Telecommunications; General partnership; Internet of Things; Telecommunications link; Computer security; Business","score_opus":0.3514277441720988,"score_gpt":0.4016067699823458,"score_spread":0.05017902581024697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607306415","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.813249e-7,0.2934956,0.55720097,0.012535599,0.001586832,0.0021411465,0.00015807773,0.00028477176,0.13259606],"genre_scores_gemma":[0.012827847,0.78624296,0.057316814,0.0011493539,0.0017742638,0.0012652655,0.00061046274,0.00010220468,0.13871084],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988571,0.0000136885865,0.0002510648,0.00062802853,0.00007264571,0.00017748134],"domain_scores_gemma":[0.9950896,0.00023152724,0.00019913816,0.00431191,0.00014103139,0.000026797448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003820499,0.00019135457,0.0003310997,0.00016170405,0.00053050753,0.00008707377,0.0036286446,0.00017810284,0.0000011618222],"category_scores_gemma":[0.00011663264,0.00018111653,0.00002133502,0.000052227475,0.00039490132,0.00011537737,0.0050657815,0.0003450889,0.0000063124176],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016111196,0.000005935807,0.000009949087,0.000021878246,0.000068288056,0.0000015409253,0.00007114166,0.000011762438,4.349193e-7,0.41638592,0.022512473,0.56090903],"study_design_scores_gemma":[0.00016890053,0.000020483625,0.0000079390575,0.00018592663,0.000013961957,0.0000048678253,0.000017670623,0.0049949465,6.868149e-7,0.022410791,0.97197384,0.00019997767],"about_ca_topic_score_codex":9.06635e-7,"about_ca_topic_score_gemma":0.00031191448,"teacher_disagreement_score":0.9494614,"about_ca_system_score_codex":0.00003987411,"about_ca_system_score_gemma":0.000037825357,"threshold_uncertainty_score":0.73857176},"labels":[],"label_agreement":null},{"id":"W2607423673","doi":"10.1016/j.comnet.2017.04.004","title":"A new cooperative communication algorithm for improving connectivity in the event of network failure in VANETs","year":2017,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Retransmission; Computer science; Computer network; Node (physics); Relay; Network packet; Wireless ad hoc network; Throughput; Distributed computing; Tree (set theory); Wireless; Telecommunications","score_opus":0.027011757260534567,"score_gpt":0.2876495046784495,"score_spread":0.26063774741791496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607423673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016978126,0.0009832351,0.99392235,0.0020731336,0.00031942723,0.00082503207,0.0000010379472,0.00003141093,0.00014653831],"genre_scores_gemma":[0.79624194,0.00020836147,0.20278765,0.00038547927,0.00026413327,0.000073399395,0.000009558814,0.000009787495,0.000019656833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808866,0.0005692499,0.0004587809,0.00036210913,0.00015372944,0.00036748053],"domain_scores_gemma":[0.99638677,0.0009045913,0.00037865943,0.0021123996,0.00016064096,0.00005694894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016681248,0.00019701882,0.00034186261,0.000071008835,0.00056041946,0.0003949714,0.0035168314,0.00010618619,0.0000035309533],"category_scores_gemma":[0.000055802273,0.00016417926,0.0000869193,0.00034237048,0.000087535096,0.0005630793,0.0011726428,0.0004459585,0.0000011092642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008852323,0.00007360538,0.0012186468,0.00000620452,0.000012714175,0.0000023440957,0.0014762762,0.08288646,0.000004613738,0.027437337,0.0034948485,0.8833781],"study_design_scores_gemma":[0.0009788345,0.00009679462,0.019321984,0.00015556188,0.000004208996,0.000004834657,0.000022311866,0.97610843,0.000010253227,0.0012892474,0.0018291746,0.00017837647],"about_ca_topic_score_codex":0.00010370505,"about_ca_topic_score_gemma":0.00286082,"teacher_disagreement_score":0.893222,"about_ca_system_score_codex":0.000064245636,"about_ca_system_score_gemma":0.000105766805,"threshold_uncertainty_score":0.6695036},"labels":[],"label_agreement":null},{"id":"W2610221642","doi":"10.1016/j.comcom.2017.08.003","title":"Optimizing power allocation in wireless networks: Are the implicit constraints really redundant?","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Power (physics); Wireless network; Mathematical optimization; Computer network; Distributed computing; Telecommunications","score_opus":0.05477273371121708,"score_gpt":0.30991945216789674,"score_spread":0.25514671845667963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610221642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004038093,0.0011037393,0.95068014,0.03468785,0.00041356636,0.00050896575,0.0000022630659,0.0001995142,0.008365869],"genre_scores_gemma":[0.945071,0.0024356751,0.051160216,0.0011055516,0.00006346926,0.00008766888,0.00001267315,0.00001590646,0.00004786396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980612,0.0005280271,0.00049021735,0.00038403223,0.00018132116,0.0003552376],"domain_scores_gemma":[0.98935497,0.00048567713,0.00048271398,0.0092938375,0.0002896264,0.00009315093],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00090874924,0.00021311664,0.0002550655,0.00011210348,0.0025387744,0.0012354252,0.011454146,0.00008844116,0.000008625478],"category_scores_gemma":[0.000069798196,0.00018538265,0.00009029043,0.00033499353,0.0006541311,0.0007861194,0.005091086,0.000611699,0.000026382875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067970427,0.00030065252,0.0048819026,0.0000068648083,0.000070148744,0.000007055647,0.0041816914,0.004531847,0.00026243497,0.62907314,0.0026265238,0.35405093],"study_design_scores_gemma":[0.00048004856,0.00002679704,0.0648759,0.00023277257,0.0000068079275,0.000022708371,0.00012003079,0.9274418,0.000026559945,0.0008341342,0.005614066,0.00031840915],"about_ca_topic_score_codex":0.000030641582,"about_ca_topic_score_gemma":0.0005197364,"teacher_disagreement_score":0.9410329,"about_ca_system_score_codex":0.00010563496,"about_ca_system_score_gemma":0.00010510991,"threshold_uncertainty_score":0.9998014},"labels":[],"label_agreement":null},{"id":"W2610649726","doi":"10.1109/tip.2017.2700765","title":"Joint Source-Channel Coding of JPEG 2000 Image Transmission Over Two-Way Multi-Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; JPEG; Relay; Relay channel; Transmission (telecommunications); Image quality; Algorithm; JPEG 2000; Channel (broadcasting); Image compression; Data compression; Computer vision; Computer network; Image processing; Image (mathematics); Power (physics); Telecommunications","score_opus":0.04370357855188419,"score_gpt":0.31192152958830976,"score_spread":0.2682179510364256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610649726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014921683,0.0006344293,0.9956063,0.0006195082,0.0003301694,0.00024347367,0.0000031213665,0.0002125901,0.0008582468],"genre_scores_gemma":[0.9100471,0.0006281172,0.088388756,0.00014333281,0.000054322925,0.000029795418,0.0000011371465,0.000036529094,0.00067087216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980248,0.00015056752,0.0005395311,0.0005345008,0.00031877097,0.00043178615],"domain_scores_gemma":[0.9978397,0.00009297593,0.00040211267,0.0011871373,0.00030315894,0.00017490554],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00053960906,0.00030972683,0.00036124975,0.00021365877,0.0022143046,0.00080320874,0.0013071704,0.00010876509,0.00008147502],"category_scores_gemma":[0.000018818617,0.0002949342,0.0002017701,0.00030692466,0.00027244707,0.0018983943,0.000026433867,0.00062412414,0.00001732246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043393688,0.00038900587,0.000006649517,0.00009244838,0.000038534778,0.000009262183,0.0035173018,0.04159249,0.088033155,0.00004943869,0.000107896856,0.8661204],"study_design_scores_gemma":[0.0011938043,0.00004819067,0.00020691707,0.00061894715,0.000026947828,0.0000126254745,0.00004860183,0.92790484,0.069303855,0.000031203712,0.00027490317,0.00032915873],"about_ca_topic_score_codex":0.000030742514,"about_ca_topic_score_gemma":0.00002821608,"teacher_disagreement_score":0.908555,"about_ca_system_score_codex":0.00009921862,"about_ca_system_score_gemma":0.00013457827,"threshold_uncertainty_score":0.9999503},"labels":[],"label_agreement":null},{"id":"W2611975244","doi":"10.1109/wcnc.2017.7925518","title":"Generalized Asymptotic Measures for Wireless Fading Channels with a Logarithmic Singularity","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Logarithm; Singularity; Random variable; Wireless; Signal-to-noise ratio (imaging); Topology (electrical circuits); Algorithm; Mathematics; Computer science; Combinatorics; Statistics; Mathematical analysis; Telecommunications; Decoding methods","score_opus":0.07438326232155429,"score_gpt":0.30613612478005525,"score_spread":0.23175286245850096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611975244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026024735,0.0001061086,0.96792394,0.0026592868,0.00021871265,0.00033646898,6.143314e-7,0.00014729088,0.0025828378],"genre_scores_gemma":[0.92349625,0.000065050015,0.07507935,0.00033635064,0.00007738152,0.000055268243,0.0000016352634,0.000009568303,0.00087911985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906486,0.00006944597,0.0001424698,0.00030773826,0.00016037596,0.00025510474],"domain_scores_gemma":[0.9982125,0.00007822273,0.00012226724,0.0012638404,0.00024436778,0.00007881481],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004319692,0.00013509873,0.00018746538,0.000053311,0.0013183465,0.0008782477,0.0016552885,0.00004314295,0.000009088104],"category_scores_gemma":[0.00007624728,0.00010470946,0.000054760978,0.000077942655,0.00008102671,0.00050329434,0.0003960869,0.00009463589,0.0000060514867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036201207,0.00009516102,0.0013002873,0.000020038493,0.00008845276,0.000006026319,0.0010997297,0.00051015185,0.003644733,0.80176646,0.00084208196,0.1905907],"study_design_scores_gemma":[0.0026732504,0.00020068022,0.0031379058,0.00014107252,0.000021548505,0.00002704789,0.000022129767,0.96329665,0.010235889,0.005964877,0.013644911,0.0006340133],"about_ca_topic_score_codex":0.0000233092,"about_ca_topic_score_gemma":0.00019162185,"teacher_disagreement_score":0.9627865,"about_ca_system_score_codex":0.00003839651,"about_ca_system_score_gemma":0.00006560675,"threshold_uncertainty_score":0.9999818},"labels":[],"label_agreement":null},{"id":"W2612364459","doi":"10.1109/wcnc.2017.7925681","title":"Relay Selection for Cognitive Massive MIMO Two-Way Relay Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Computer science; Underlay; Interference (communication); Cognitive radio; Selection (genetic algorithm); Relay channel; Computer network; Signal-to-noise ratio (imaging); Wireless; Topology (electrical circuits); Power (physics); Telecommunications; Engineering; Electrical engineering; Channel (broadcasting)","score_opus":0.04773762738730226,"score_gpt":0.32440777506594126,"score_spread":0.276670147678639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612364459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031376195,0.00015478746,0.97342634,0.0026053065,0.00047280674,0.00039730998,0.0000010008216,0.00017081937,0.019634018],"genre_scores_gemma":[0.9642061,0.00026603666,0.029181482,0.00069108856,0.0002057129,0.00010461204,0.000006608045,0.000012317456,0.005326033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892443,0.0001097345,0.00019895138,0.000370927,0.00011413806,0.00028179627],"domain_scores_gemma":[0.9981784,0.0003498079,0.00020204709,0.0007614264,0.0004192725,0.00008904691],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042635278,0.00014269524,0.00015419231,0.00005446944,0.0016141116,0.0005440631,0.0011128586,0.00007132651,0.000050853378],"category_scores_gemma":[0.00026199565,0.00012771219,0.00008471162,0.00014010236,0.00007548046,0.00070693804,0.00046957895,0.00021719809,0.0000413582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007242854,0.0001291906,0.0040362407,0.00000797407,0.0001245829,0.0000034291288,0.00087379804,0.006505727,0.0005545337,0.5166875,0.021176482,0.4498281],"study_design_scores_gemma":[0.00095193257,0.0001083466,0.0033744376,0.00005392641,0.000012047624,0.000005570614,0.00002320133,0.9852733,0.0010902868,0.00039340113,0.0084813535,0.0002321865],"about_ca_topic_score_codex":0.000016729691,"about_ca_topic_score_gemma":0.0002977986,"teacher_disagreement_score":0.9787676,"about_ca_system_score_codex":0.000050070623,"about_ca_system_score_gemma":0.00004636651,"threshold_uncertainty_score":0.99968565},"labels":[],"label_agreement":null},{"id":"W2613463446","doi":"10.1109/wcnc.2017.7925812","title":"Optimizing Data Transmission Power for ARQ Energy Efficiency under Imperfect CSI","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Automatic repeat request; Computer science; Fading; Transmission (telecommunications); Hybrid automatic repeat request; Network packet; Data transmission; Energy (signal processing); Wireless; Channel (broadcasting); Algorithm; Real-time computing; Computer network; Telecommunications; Mathematics; Statistics","score_opus":0.0894489186352943,"score_gpt":0.33585706581993374,"score_spread":0.24640814718463944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613463446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002556977,0.00064614194,0.9785414,0.0038787606,0.00017033485,0.00010278462,0.0000015392473,0.00010271625,0.016300645],"genre_scores_gemma":[0.85858923,0.00061202457,0.13861728,0.00070728565,0.000037614613,0.000011384359,0.000010802056,0.000009429415,0.0014049411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990151,0.00005302165,0.00016311361,0.00041129376,0.0001269272,0.00023054895],"domain_scores_gemma":[0.99654037,0.00014835868,0.00007936534,0.0030590524,0.00008668232,0.000086171916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044376857,0.0001151694,0.00012442427,0.00004467383,0.0011278726,0.0005586777,0.004455867,0.00004282135,0.00006228265],"category_scores_gemma":[0.000041199637,0.00009101202,0.000049834016,0.00007680632,0.000048696456,0.0008732041,0.0012324845,0.00007373609,0.0000065035274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011846524,0.00010682956,0.00001901591,0.0000056766858,0.000021500355,0.0000013114865,0.00050463947,0.0006129295,0.006689108,0.4207398,0.0070005096,0.5642868],"study_design_scores_gemma":[0.00048708767,0.00006838223,0.00019175168,0.00003187579,0.000004582562,0.0000033380934,0.000016753766,0.83547026,0.0030568682,0.00072171993,0.15973374,0.00021366905],"about_ca_topic_score_codex":0.000010760839,"about_ca_topic_score_gemma":0.000025969483,"teacher_disagreement_score":0.8583335,"about_ca_system_score_codex":0.000018767945,"about_ca_system_score_gemma":0.000065491644,"threshold_uncertainty_score":0.86747986},"labels":[],"label_agreement":null},{"id":"W2613683030","doi":"10.1109/wcnc.2017.7925970","title":"Multi-Antenna Down-Link Cooperative Systems over Composite Multipath/Shadowing Channels","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Lakehead University","keywords":"Fading; Multipath propagation; Shadow mapping; Computer science; Hop (telecommunications); Topology (electrical circuits); Path loss; MIMO; Channel (broadcasting); Antenna (radio); Link level; Algorithm; Electronic engineering; Computer network; Mathematics; Telecommunications; Wireless; Engineering","score_opus":0.07625320916281032,"score_gpt":0.3204345357704092,"score_spread":0.2441813266075989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613683030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015967367,0.0010744113,0.9722832,0.0023446654,0.0024113788,0.0006042719,0.000005109889,0.0003944951,0.0049150987],"genre_scores_gemma":[0.9796134,0.0003361726,0.015948063,0.00056539656,0.00019612143,0.000051801293,0.000005762084,0.00001657732,0.003266663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821806,0.0002329977,0.00036941553,0.00052957144,0.00025708126,0.0003929015],"domain_scores_gemma":[0.99688464,0.00014298891,0.00022433983,0.0021897936,0.00038688412,0.00017137149],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00052565924,0.0002634375,0.00033474536,0.00009788839,0.0018834827,0.0020839418,0.002854233,0.00008599929,0.000039516548],"category_scores_gemma":[0.00013091887,0.00021827397,0.00009889955,0.0001548627,0.00012090539,0.0013913322,0.0016084261,0.00028786983,0.000192832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081802384,0.0012493769,0.023395574,0.00014179443,0.0007305429,0.00026632028,0.022328269,0.01098435,0.36805093,0.3806101,0.008991703,0.18316922],"study_design_scores_gemma":[0.00097584975,0.000036260823,0.009282142,0.00013634058,0.0000052725313,0.0000091652955,0.000044847155,0.9832955,0.0010122508,0.000011606285,0.0048439917,0.00034675517],"about_ca_topic_score_codex":0.00012876226,"about_ca_topic_score_gemma":0.00006427277,"teacher_disagreement_score":0.97231114,"about_ca_system_score_codex":0.000068428126,"about_ca_system_score_gemma":0.00004982768,"threshold_uncertainty_score":0.99941593},"labels":[],"label_agreement":null},{"id":"W2621166484","doi":"10.1109/access.2017.2710908","title":"A Two-Way Network Beamforming Approach Based on Total Power Minimization With Symmetric Relay Beamforming Matrices","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Relay; Computer science; Minification; Transmitter power output; Transceiver; Mathematical optimization; Power (physics); Topology (electrical circuits); Mathematics; Telecommunications; Wireless; Transmitter; Physics","score_opus":0.03869536631438776,"score_gpt":0.3015853194127307,"score_spread":0.26288995309834295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621166484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044618007,0.00023560012,0.9144547,0.0005810729,0.0006286657,0.00042860222,0.0000014364941,0.00020988505,0.038842052],"genre_scores_gemma":[0.92262995,0.000065331704,0.07625311,0.00061225164,0.00019429874,0.000055105,0.0000070110564,0.000023490555,0.00015946772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819565,0.00010320195,0.00031394727,0.0005117657,0.00043896603,0.00043648723],"domain_scores_gemma":[0.997166,0.00022104094,0.0004444878,0.001804483,0.00024022635,0.00012376247],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005513422,0.00025207744,0.00025548498,0.00027457133,0.001617254,0.0016841325,0.0030037556,0.00007358772,0.0000125523275],"category_scores_gemma":[0.00011146057,0.00020457942,0.00007031791,0.0010170768,0.00007171345,0.002372291,0.0005236261,0.0002884735,0.000012998827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001193426,0.00033903364,0.0094116265,0.000045639747,0.000067910456,0.000020718053,0.0007970578,0.8614387,0.000092361515,0.023504687,0.0018574334,0.10230549],"study_design_scores_gemma":[0.0010292496,0.00014917381,0.0047872486,0.00018129332,0.000017086326,0.000016056525,0.000020497408,0.99111885,0.0005053345,0.00006546477,0.0016731196,0.00043661497],"about_ca_topic_score_codex":0.000020424704,"about_ca_topic_score_gemma":0.000019601615,"teacher_disagreement_score":0.87801194,"about_ca_system_score_codex":0.000083884835,"about_ca_system_score_gemma":0.00009144163,"threshold_uncertainty_score":0.9996825},"labels":[],"label_agreement":null},{"id":"W2621310776","doi":"10.1109/access.2017.2692210","title":"On Sum-Rate Maximization Approach to Network Beamforming and Power Allocation for Asynchronous Single-Carrier Two-Way Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Computer science; Beamforming; Maximization; Relay channel; Channel (broadcasting); Multiplexing; Asynchronous communication; Transceiver; Mathematical optimization; Topology (electrical circuits); Power (physics); Telecommunications; Mathematics; Wireless","score_opus":0.06077208868255074,"score_gpt":0.3110750493484778,"score_spread":0.25030296066592705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621310776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019089498,0.00016762874,0.9740551,0.00075337366,0.0008693299,0.00067263714,0.0000018772023,0.00010067183,0.0042898837],"genre_scores_gemma":[0.97139156,0.00009811669,0.026625106,0.0012572097,0.00028861724,0.00014113517,0.00001623396,0.000024808372,0.00015723043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856794,0.0001123986,0.00027856085,0.0005156458,0.00014733938,0.00037811295],"domain_scores_gemma":[0.99782777,0.00021725526,0.00025269733,0.0013321083,0.00022594986,0.0001442084],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000751408,0.00020424939,0.00020935987,0.00008000066,0.0014193024,0.0016605437,0.0017840208,0.00008661634,0.0000040850373],"category_scores_gemma":[0.00015137922,0.00019653582,0.000047054044,0.00023411885,0.000057014367,0.0013654674,0.000531253,0.000167575,0.000003997638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006998788,0.000123925,0.00092987384,0.00001516367,0.00004285114,9.891734e-7,0.00078530854,0.79772526,0.0003337312,0.065955676,0.004044746,0.1299725],"study_design_scores_gemma":[0.0006960631,0.0001448368,0.0033271837,0.00010150653,0.000012481575,0.0000039612723,0.000007171275,0.989507,0.00042667557,0.0012968306,0.0040995646,0.00037672816],"about_ca_topic_score_codex":0.000010126081,"about_ca_topic_score_gemma":0.000055680695,"teacher_disagreement_score":0.95230204,"about_ca_system_score_codex":0.00008366895,"about_ca_system_score_gemma":0.00003399964,"threshold_uncertainty_score":0.99988073},"labels":[],"label_agreement":null},{"id":"W2622829522","doi":"10.1109/tcomm.2017.2712601","title":"TAS-Based Incremental Hybrid Decode–Amplify–Forward Relaying for Physical Layer Security Enhancement","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Australian Research Council; National Natural Science Foundation of China","keywords":"Relay; Physical layer; Computer science; Overhead (engineering); Transmission (telecommunications); Computer network; Channel state information; Secure transmission; Secrecy; Scheme (mathematics); Electronic engineering; Topology (electrical circuits); Wireless; Engineering; Telecommunications; Power (physics); Mathematics; Electrical engineering","score_opus":0.08509650198207858,"score_gpt":0.35777423591280727,"score_spread":0.2726777339307287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622829522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006647069,0.0001102801,0.9820291,0.0071788933,0.0003219703,0.00066011294,0.00006298533,0.00018812472,0.0028015103],"genre_scores_gemma":[0.9580132,0.00049171736,0.039928265,0.0005971659,0.000035196397,0.00069732766,0.000027375536,0.000021151896,0.00018862617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984636,0.00022415615,0.00034823612,0.00039489058,0.00025046064,0.00031867815],"domain_scores_gemma":[0.9928269,0.00062457495,0.00023776428,0.0059460476,0.00022815684,0.00013658302],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00047509483,0.00022853052,0.00024204698,0.0001256171,0.004428854,0.00046610087,0.004474194,0.00005584188,0.000037641592],"category_scores_gemma":[0.000033410644,0.00024220577,0.00021412998,0.00015025544,0.0002254675,0.0006391949,0.00008494503,0.0005059071,0.00008066559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030820502,0.009708096,0.00013086137,0.00011326758,0.0006917277,0.0000043047676,0.0060181827,0.008794803,0.037147485,0.14218651,0.009550378,0.7853462],"study_design_scores_gemma":[0.0016205293,0.00030237928,0.00013358389,0.00011803516,0.00006328025,0.000004239124,0.000055983717,0.8570539,0.098848976,0.0025786497,0.03868019,0.000540273],"about_ca_topic_score_codex":0.000023782874,"about_ca_topic_score_gemma":0.00027649238,"teacher_disagreement_score":0.9513661,"about_ca_system_score_codex":0.00018218422,"about_ca_system_score_gemma":0.00013431993,"threshold_uncertainty_score":0.99686724},"labels":[],"label_agreement":null},{"id":"W2673438180","doi":"10.1109/tit.2018.2865936","title":"Adversarial Network Coding","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Adversarial system; Linear network coding; Computer science; Coding (social sciences); Hamming distance; Theoretical computer science; Point (geometry); Topology (electrical circuits); Algorithm; Mathematics; Computer network; Artificial intelligence; Combinatorics; Statistics","score_opus":0.025143518722477394,"score_gpt":0.26193329017676964,"score_spread":0.23678977145429225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2673438180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011511895,0.000055122957,0.97693354,0.0003699633,0.0059142783,0.0003974718,0.000019927518,0.00052222854,0.015672354],"genre_scores_gemma":[0.97223127,0.0010321405,0.022718156,0.0026727172,0.0005370448,0.00019717311,0.00004313966,0.000021912649,0.0005464643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981039,0.00039126308,0.00059726567,0.00026318937,0.00033397775,0.00031036278],"domain_scores_gemma":[0.99755853,0.00030130206,0.0003336621,0.0013792476,0.0003182535,0.0001090292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011585532,0.0002949251,0.00025657695,0.0002903742,0.00071865215,0.0005048221,0.0015481443,0.0002728614,0.0003214094],"category_scores_gemma":[0.000018797293,0.00030169028,0.00019994091,0.00040942596,0.000107689266,0.0014100717,0.00005997001,0.00091468263,0.0007759341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013240562,0.000084650885,0.0000011794574,0.00007057833,0.00019636838,9.4190597e-7,0.0057167658,0.273049,0.000012071622,0.26730165,0.011687332,0.44174707],"study_design_scores_gemma":[0.0016668289,0.00026889605,0.000067563415,0.0008892227,0.000103852915,0.000020405385,0.00018959542,0.8237149,0.003533296,0.080640644,0.087248616,0.0016561481],"about_ca_topic_score_codex":0.0000022762792,"about_ca_topic_score_gemma":0.000005559466,"teacher_disagreement_score":0.9721161,"about_ca_system_score_codex":0.00017702115,"about_ca_system_score_gemma":0.00021426837,"threshold_uncertainty_score":0.9999435},"labels":[],"label_agreement":null},{"id":"W2679131546","doi":"10.1109/twc.2017.2717399","title":"Performance Analysis and Scaling Law of MRC/MRT Relaying With CSI Error in Multi-Pair Massive MIMO Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Maximal-ratio combining; Topology (electrical circuits); Computer science; Signal-to-noise ratio (imaging); Scaling; Relay channel; Channel state information; Interference (communication); Antenna (radio); Upper and lower bounds; Channel (broadcasting); Telecommunications; Mathematics; Power (physics); Fading; Wireless; Physics; Mathematical analysis; Geometry; Combinatorics","score_opus":0.06838628220647013,"score_gpt":0.3083466550831574,"score_spread":0.23996037287668726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2679131546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20809552,0.00032230487,0.7891705,0.001198438,0.00007868942,0.00030355755,0.000009627709,0.00007767536,0.0007436657],"genre_scores_gemma":[0.97561914,0.0018767345,0.022220464,0.000038292514,0.0000034529003,0.00013098816,0.000003446016,0.000013396407,0.000094112176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856585,0.00028927872,0.0004335366,0.00031473124,0.0001888648,0.00020774093],"domain_scores_gemma":[0.99490505,0.00031225072,0.00033053968,0.004140335,0.00022920319,0.000082637176],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00043022574,0.00017978108,0.0003582929,0.00036212645,0.0017746496,0.00024180926,0.0024018602,0.00007817274,0.0000028845895],"category_scores_gemma":[0.000007202565,0.0001699935,0.00008329037,0.0007500164,0.00045285263,0.0007683111,0.000064888845,0.00045200918,0.0000034742875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000168528,0.0030780407,0.087835915,0.00031366068,0.0021243517,0.000010733497,0.01883101,0.5862977,0.006508624,0.08809841,0.000018383547,0.20671466],"study_design_scores_gemma":[0.00059781864,0.000048921687,0.02059863,0.00030614957,0.000089819085,0.0000039705064,0.00021956058,0.9764216,0.001389832,0.000005450541,0.00010223447,0.00021600645],"about_ca_topic_score_codex":0.00050777965,"about_ca_topic_score_gemma":0.0052288957,"teacher_disagreement_score":0.7675236,"about_ca_system_score_codex":0.000072921124,"about_ca_system_score_gemma":0.00005775851,"threshold_uncertainty_score":0.9995249},"labels":[],"label_agreement":null},{"id":"W2725229240","doi":"10.1109/tit.2018.2878452","title":"Interference Mitigation via Relaying","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"MIMO; Quantization (signal processing); Relay; Covariance matrix; Covariance; Relay channel; Control theory (sociology); Topology (electrical circuits); Telecommunications link","score_opus":0.018691038927703612,"score_gpt":0.25415666686620425,"score_spread":0.23546562793850065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725229240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013829604,0.000010952045,0.98461634,0.0004068378,0.00068774377,0.00012429745,0.0000017209223,0.00026287953,0.012506295],"genre_scores_gemma":[0.99154836,0.00005388682,0.006706888,0.0014051438,0.000029810863,0.00003192581,0.000002457566,0.000003949379,0.00021758086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916595,0.0001490199,0.00028826096,0.000109239496,0.00014734332,0.00014016023],"domain_scores_gemma":[0.9989517,0.00013547864,0.00009979078,0.0005167556,0.00023891746,0.000057363286],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045059953,0.000103218044,0.00007586035,0.00021532095,0.0005005732,0.00016667244,0.0005350293,0.00005128877,0.00021002712],"category_scores_gemma":[0.0000125950355,0.00009982252,0.000047973317,0.00043778124,0.00009230788,0.0024733897,0.000006132026,0.00019346797,0.0010960896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002439359,0.000028234126,0.00000157048,0.000004961947,0.00001492876,1.12372966e-7,0.0050390605,0.00067291176,0.00066556915,0.11348046,0.00025154444,0.87981623],"study_design_scores_gemma":[0.0013160992,0.0006777999,0.0003566976,0.00024555612,0.000024017014,0.000049652106,0.00062254746,0.7503094,0.18755469,0.035701923,0.022272369,0.0008692734],"about_ca_topic_score_codex":0.0000011640404,"about_ca_topic_score_gemma":0.000004853948,"teacher_disagreement_score":0.9901654,"about_ca_system_score_codex":0.000065051696,"about_ca_system_score_gemma":0.000036389123,"threshold_uncertainty_score":0.99968165},"labels":[],"label_agreement":null},{"id":"W2738018578","doi":"","title":"High-performance multicast in multi-channel multi-radio wireless mesh networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer network; Multicast; Computer science; Wireless mesh network; Source-specific multicast; Node (physics); Throughput; Channel (broadcasting); Xcast; Wireless network; Protocol Independent Multicast; Distributed computing; Wireless; Telecommunications; Engineering","score_opus":0.06278664708732733,"score_gpt":0.2859743389017306,"score_spread":0.22318769181440323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738018578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11631966,0.0004037665,0.8816281,0.0003294041,0.00064024684,0.00023680688,3.9346182e-7,0.00021596091,0.00022567662],"genre_scores_gemma":[0.9482447,0.0010909454,0.049538534,0.0003972011,0.00009194342,0.0000467884,0.000003825845,0.000015651758,0.0005704132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983666,0.0001766152,0.00035873026,0.00031169836,0.00016055601,0.00062578806],"domain_scores_gemma":[0.9986326,0.00013248294,0.00007877981,0.00087384955,0.00009140146,0.00019085257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006141777,0.00021643743,0.0002446361,0.00013537928,0.00020762876,0.000101939084,0.0011384486,0.00009651677,0.0000345963],"category_scores_gemma":[0.000027198234,0.00019310655,0.000044232667,0.00066200324,0.00006105357,0.0010642303,0.0006266664,0.0003510256,0.00010612642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006307285,0.0047614113,0.111959025,0.0000733955,0.00013446166,0.00002177786,0.015964266,0.06012624,0.002045181,0.25120926,0.0028658581,0.55077606],"study_design_scores_gemma":[0.0009503352,0.000017710114,0.0678762,0.000038888327,0.0000019180497,0.0000056557024,0.000032424345,0.92998594,0.0005829265,0.0000021384476,0.00024786327,0.00025797507],"about_ca_topic_score_codex":0.00003212361,"about_ca_topic_score_gemma":0.0001777862,"teacher_disagreement_score":0.86985976,"about_ca_system_score_codex":0.000090050824,"about_ca_system_score_gemma":0.000024405032,"threshold_uncertainty_score":0.78746563},"labels":[],"label_agreement":null},{"id":"W2739148573","doi":"10.1007/978-3-319-58721-9_4","title":"Cooperation in ADHOC MAC","year":2017,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Relay; Node (physics); Network packet; Time division multiple access; Throughput; Transmission (telecommunications); Channel (broadcasting); Wireless ad hoc network; Wireless; Telecommunications; Engineering","score_opus":0.0362022475506403,"score_gpt":0.2666129863904261,"score_spread":0.23041073883978577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739148573","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022841683,0.005285717,0.2354619,0.000929015,0.0011433962,0.00046573533,0.0000027464066,0.0002452842,0.7564434],"genre_scores_gemma":[0.40599966,0.032465804,0.0013742845,0.0011084141,0.0010147123,0.000056412653,0.00015117206,0.00011968743,0.5577099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838537,0.000070694965,0.0004323339,0.0005742502,0.00021464155,0.0003227134],"domain_scores_gemma":[0.99729174,0.000095663796,0.00031666987,0.0020370942,0.00015712708,0.00010171328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003530348,0.0003597649,0.00045030197,0.00015819266,0.0004060846,0.00048175367,0.002308984,0.00042315933,0.0001520118],"category_scores_gemma":[0.000013369518,0.00037554628,0.00010783304,0.000050585568,0.00010401279,0.00037649838,0.0009037474,0.00092185556,0.00013801172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045471475,0.00001107037,0.000011674742,0.0000052111614,0.00001496233,0.000024672878,0.000091456415,0.0011519009,0.0000032433154,0.65437645,0.004068178,0.34023666],"study_design_scores_gemma":[0.00050214544,0.000043019125,0.00013452506,0.00074846816,0.000009942173,0.00001347597,0.0000010777563,0.6380516,0.0000069960856,0.0033146415,0.35646254,0.0007115634],"about_ca_topic_score_codex":0.0000057716666,"about_ca_topic_score_gemma":0.00051485613,"teacher_disagreement_score":0.6510618,"about_ca_system_score_codex":0.00013361161,"about_ca_system_score_gemma":0.00010511977,"threshold_uncertainty_score":0.99986964},"labels":[],"label_agreement":null},{"id":"W2740070852","doi":"10.1109/icc.2017.7996923","title":"Outage analysis of spectrum sharing multi-antenna multi-relay networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Nakagami distribution; Relay; Computer science; Rayleigh fading; Cognitive radio; Channel state information; Fading; Diversity gain; Cooperative diversity; Maximal-ratio combining; Beamforming; Electronic engineering; Telecommunications; Computer network; Channel (broadcasting); Wireless; Engineering","score_opus":0.0882160124599055,"score_gpt":0.3339306338671929,"score_spread":0.2457146214072874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740070852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012013864,0.00029032596,0.98519874,0.0005899676,0.00021812503,0.00009401676,8.517993e-7,0.00009575597,0.0014983411],"genre_scores_gemma":[0.95671177,0.0005021562,0.040607147,0.0001459644,0.000022275393,0.0000052422392,0.0000023776079,0.0000065612758,0.0019965186],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988726,0.00005632121,0.0003176446,0.00036917697,0.00013531168,0.0002489804],"domain_scores_gemma":[0.9968802,0.000066590095,0.00026330518,0.0026017043,0.00010218052,0.00008607394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045758203,0.00013588808,0.0003147206,0.00020260029,0.0005417138,0.00035106705,0.0030847741,0.000053425287,0.000095500385],"category_scores_gemma":[0.00008192475,0.000117698226,0.00019649278,0.00047854643,0.00008140174,0.00046024722,0.0017657595,0.00017789894,0.000015397742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001945142,0.00085731776,0.6511399,0.000017347724,0.002902264,0.000032066637,0.0038712549,0.05911604,0.0047681024,0.16886912,0.00032436175,0.10808277],"study_design_scores_gemma":[0.00026024398,0.000009524617,0.17362025,0.000016182998,0.000050671173,3.3927748e-7,0.000010940676,0.82560426,0.00018627931,0.00000864834,0.00011136633,0.00012129751],"about_ca_topic_score_codex":0.00009344372,"about_ca_topic_score_gemma":0.001966997,"teacher_disagreement_score":0.9446979,"about_ca_system_score_codex":0.000026525457,"about_ca_system_score_gemma":0.000015090952,"threshold_uncertainty_score":0.5732329},"labels":[],"label_agreement":null},{"id":"W2740183276","doi":"10.1109/icufn.2017.7993827","title":"An architecture of IPTV networks based on network coding","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"IPTV; Computer science; Computer network; Backbone network; Linear network coding; Network architecture; Robustness (evolution); Coding (social sciences); Distributed computing","score_opus":0.03576645182190654,"score_gpt":0.2985946786004319,"score_spread":0.26282822677852535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740183276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010667386,0.00006843778,0.96521,0.00153676,0.00024659454,0.00010093579,2.618944e-7,0.000099338926,0.031670928],"genre_scores_gemma":[0.96114963,0.000060033777,0.037434187,0.0010746068,0.00015062389,0.00000539438,0.000002160033,0.0000068454506,0.0001165323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990655,0.00014519309,0.00017299663,0.00024390836,0.00015074335,0.00022162644],"domain_scores_gemma":[0.99710107,0.00015749305,0.0001608474,0.002409348,0.00008201835,0.00008923308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045498193,0.00011444773,0.00015599464,0.000043638076,0.00067555107,0.00027354763,0.002357056,0.00005004536,0.000051731764],"category_scores_gemma":[0.00004521849,0.00009484379,0.000055321827,0.00012633405,0.00007382348,0.00023276974,0.00030143152,0.000200657,0.0000048133434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018238698,0.000082101775,0.0029251934,0.0000040368877,0.000010097627,0.0000027102071,0.0001259002,0.4495673,0.00020684699,0.2959783,0.002055537,0.24902375],"study_design_scores_gemma":[0.00022406128,0.00010729379,0.010045031,0.00005935284,0.0000019211004,7.136533e-7,0.0000020673529,0.9855901,0.00022707468,0.00044736822,0.003170706,0.00012431438],"about_ca_topic_score_codex":0.0000059005556,"about_ca_topic_score_gemma":0.000064496504,"teacher_disagreement_score":0.9600829,"about_ca_system_score_codex":0.000013309598,"about_ca_system_score_gemma":0.000040601695,"threshold_uncertainty_score":0.5195861},"labels":[],"label_agreement":null},{"id":"W2740451416","doi":"10.1109/icc.2017.7997224","title":"Stackelberg game approach for wireless virtualization design in wireless networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Stackelberg competition; Computer science; Wireless network; Wireless; Virtualization; Computer network; Resource allocation; Telecommunications link; Nash equilibrium; Game theory; Telecommunications; Mathematical optimization; Cloud computing; Economics","score_opus":0.07872652850138165,"score_gpt":0.30716431870350963,"score_spread":0.22843779020212798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740451416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013153132,0.000100084464,0.99479645,0.00040828955,0.00013930764,0.00050069846,3.5816842e-7,0.000095713265,0.0026437987],"genre_scores_gemma":[0.93594515,0.0005356438,0.062383834,0.0002632097,0.000060010476,0.0001308169,0.000010140604,0.000012407286,0.0006587984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881196,0.00020059118,0.00024699382,0.00034849634,0.00012241158,0.0002695621],"domain_scores_gemma":[0.9981804,0.00018813094,0.00014906668,0.0012823401,0.00013573961,0.000064350854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007991837,0.00013669272,0.00018485037,0.00007381535,0.00043650548,0.00055581005,0.0018935692,0.000078447134,0.000007569034],"category_scores_gemma":[0.000057263533,0.00012735247,0.000043381446,0.00017888958,0.00005978022,0.0007166948,0.00045910594,0.000121629986,0.000003449306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021683754,0.00012400601,0.00087909994,0.000009326575,0.000011975185,9.082651e-7,0.000512722,0.019574475,0.00025046134,0.7946069,0.001383193,0.18262522],"study_design_scores_gemma":[0.00053968816,0.000034723063,0.0013468261,0.000020047422,0.0000018016542,0.0000010258691,0.000016928434,0.9964092,0.00039452148,0.00053018593,0.00052590645,0.00017916417],"about_ca_topic_score_codex":0.000010720652,"about_ca_topic_score_gemma":0.000067375775,"teacher_disagreement_score":0.9768347,"about_ca_system_score_codex":0.00005132535,"about_ca_system_score_gemma":0.00004987161,"threshold_uncertainty_score":0.5359689},"labels":[],"label_agreement":null},{"id":"W2741066817","doi":"10.1109/icc.2017.7997174","title":"An experimental study on the robustness of integer-forcing linear receivers","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; MIMO; Software-defined radio; Robustness (evolution); Algorithm; Wireless; Integer (computer science); Channel (broadcasting); Joint (building); Telecommunications; Engineering","score_opus":0.11005115840504644,"score_gpt":0.36199698319855933,"score_spread":0.2519458247935129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741066817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89492595,0.000022097296,0.09271035,0.0010451943,0.00021833456,0.00022557723,1.4523637e-7,0.00004956395,0.010802756],"genre_scores_gemma":[0.99787205,0.000009448138,0.0018452678,0.00009481713,0.000027510341,0.0000085575475,1.8249028e-7,0.00000307573,0.00013907808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940026,0.00013474654,0.000109790264,0.00014999158,0.00012439083,0.00008083375],"domain_scores_gemma":[0.9981233,0.00007442415,0.000085046835,0.0016222894,0.00006539683,0.000029529925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038035007,0.000065128246,0.000080400874,0.000025638275,0.00059152464,0.000150255,0.0021006376,0.000013088278,0.00004861429],"category_scores_gemma":[0.00003790396,0.000040764815,0.000024189458,0.000058421858,0.000058589325,0.000340211,0.00042306728,0.00009318149,0.0000067838796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019342596,0.008067996,0.024116362,0.000009209315,0.00019744434,0.000014638222,0.08451999,0.023604196,0.04356408,0.6662444,0.0040154923,0.14545281],"study_design_scores_gemma":[0.00065239304,0.0013857002,0.011076968,0.00004650996,0.0000037590744,0.0000013933844,0.008565688,0.91736466,0.060168717,0.000029563578,0.00047998555,0.00022465666],"about_ca_topic_score_codex":0.000013436306,"about_ca_topic_score_gemma":0.000029285658,"teacher_disagreement_score":0.89376044,"about_ca_system_score_codex":0.000017020633,"about_ca_system_score_gemma":0.000015683247,"threshold_uncertainty_score":0.4549589},"labels":[],"label_agreement":null},{"id":"W2741202102","doi":"10.1109/icc.2017.7996438","title":"Delay optimal scheduling for network coding broadcast","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Decoding methods; Network packet; Computer network; Scheduling (production processes); Coding (social sciences); File transfer; Transfer (computing); Algorithm; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.0744555899159033,"score_gpt":0.3287778205993552,"score_spread":0.2543222306834519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741202102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026932743,0.00032951552,0.9823226,0.0021386999,0.00039989833,0.00016772552,3.6100593e-7,0.00013283653,0.011815093],"genre_scores_gemma":[0.5934207,0.00018656536,0.40502027,0.0003548716,0.00020335427,0.000021011829,0.0000011555483,0.000005964547,0.000786151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991827,0.000032509393,0.00016352991,0.00024608182,0.000089059926,0.00028611015],"domain_scores_gemma":[0.9983292,0.000143884,0.000113737595,0.0012040373,0.00013298528,0.000076153905],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004858566,0.00009991154,0.00012295808,0.000024323048,0.0018268782,0.00083865295,0.0019126053,0.000037718444,0.000026562777],"category_scores_gemma":[0.00011957028,0.000091683774,0.00006623727,0.00006756003,0.000045228877,0.0006113514,0.00083740224,0.00010362365,0.000026549777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069949565,0.00001871495,0.0005639439,0.0000047687886,0.000020163976,0.0000018538584,0.00021623564,0.008908872,0.00033162138,0.72120446,0.0038082977,0.2649141],"study_design_scores_gemma":[0.00034035885,0.000031307838,0.00062308635,0.00003614509,0.0000031067673,0.0000055664245,0.000009626264,0.94720286,0.0003617398,0.0006103722,0.05060686,0.00016897096],"about_ca_topic_score_codex":0.000002492137,"about_ca_topic_score_gemma":0.000015628457,"teacher_disagreement_score":0.938294,"about_ca_system_score_codex":0.000021476984,"about_ca_system_score_gemma":0.000037604612,"threshold_uncertainty_score":0.9994726},"labels":[],"label_agreement":null},{"id":"W2741488859","doi":"10.22215/etd/2011-07108","title":"A distributed resource block assignment scheme for relay-assisted cellular networks with self-organizing terminal relays","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Relay; Terminal (telecommunication); Scheme (mathematics); Computer science; Block (permutation group theory); Resource (disambiguation); Computer network; Telecommunications; Mathematics; Physics; Combinatorics; Power (physics)","score_opus":0.024921544351952634,"score_gpt":0.24251171035036276,"score_spread":0.21759016599841013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741488859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053846636,0.0012526696,0.9778006,0.00025621313,0.00040915664,0.0018554504,0.000010671548,0.0009479718,0.012082618],"genre_scores_gemma":[0.5168523,0.0007442306,0.43926117,0.0006610624,0.00051931373,0.0014248336,0.0050312635,0.0003061635,0.035199665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973354,0.00019907347,0.0006253533,0.0008914775,0.0003786964,0.0005700172],"domain_scores_gemma":[0.9970305,0.00022073877,0.0005385863,0.0015361002,0.00046351744,0.00021056566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048718188,0.00054348144,0.00051449763,0.00016095668,0.0007125478,0.000342672,0.0018349345,0.00039736714,0.000045411616],"category_scores_gemma":[0.000039324554,0.0004668937,0.00016133425,0.0007865407,0.000032203065,0.00025074786,0.0002922599,0.00069834717,0.000015983323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055386415,0.008336925,0.0026791648,0.0025999993,0.0073893755,0.0008536104,0.040675163,0.0076771993,0.02372165,0.31220904,0.22713201,0.36118722],"study_design_scores_gemma":[0.0049435147,0.0016666034,0.004181647,0.0023755815,0.0006261155,0.00015829687,0.001307532,0.66548705,0.011916507,0.0001588018,0.30285892,0.004319413],"about_ca_topic_score_codex":0.0000063112234,"about_ca_topic_score_gemma":0.00013369172,"teacher_disagreement_score":0.65780985,"about_ca_system_score_codex":0.00021005928,"about_ca_system_score_gemma":0.00023304741,"threshold_uncertainty_score":0.9997783},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030190943688163285,"score_gpt":0.2696145879682965,"score_spread":0.23942364428013324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741791149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44570264,0.006979629,0.4946621,0.0016541858,0.016677205,0.0011358953,0.000004734418,0.0009250343,0.03225858],"genre_scores_gemma":[0.99771905,0.00024950533,0.0011287093,0.00017576944,0.00038303397,0.00002978052,0.0000023973507,0.000013770893,0.0002979589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857926,0.00021865018,0.00028953046,0.000359477,0.00017249254,0.00038057132],"domain_scores_gemma":[0.9975065,0.000085652326,0.00019822396,0.0020631528,0.000057461675,0.00008902462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042462873,0.00016421394,0.0002406869,0.000051942407,0.0006964003,0.00049503444,0.0021229358,0.000078647594,0.0000043447403],"category_scores_gemma":[0.000017152743,0.00016486834,0.00007617779,0.00020365513,0.000049929735,0.00027700348,0.00044631743,0.00021883537,0.000081818805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018772636,0.0006395101,0.014130486,0.00022173837,0.00030031792,0.002341074,0.003307777,0.27262098,0.011673773,0.050708614,0.02130717,0.62256086],"study_design_scores_gemma":[0.0011978075,0.00008018344,0.021987507,0.0005579277,0.000010326811,0.00007571263,0.000010486218,0.95152813,0.0005187716,0.0007161811,0.022687957,0.0006289943],"about_ca_topic_score_codex":0.000015812027,"about_ca_topic_score_gemma":0.00039000862,"teacher_disagreement_score":0.67890716,"about_ca_system_score_codex":0.00015985254,"about_ca_system_score_gemma":0.00004499333,"threshold_uncertainty_score":0.6723136},"labels":[],"label_agreement":null},{"id":"W2742128636","doi":"10.1109/icc.2017.7996332","title":"Optimization of cache-enabled opportunistic interference alignment wireless networks: A big data deep reinforcement learning approach","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Reinforcement learning; Computer science; Wireless network; Cache; Markov decision process; Wireless; Deep learning; Channel (broadcasting); Distributed computing; Q-learning; Artificial intelligence; Computer network; Markov process; Telecommunications","score_opus":0.140926819351558,"score_gpt":0.30026514297261475,"score_spread":0.15933832362105674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742128636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008859734,0.000101585065,0.9783953,0.0002401364,0.00018341764,0.00020459159,3.2455364e-7,0.00006900198,0.020717058],"genre_scores_gemma":[0.9614114,0.001246421,0.035996687,0.000089806206,0.0000512882,0.000019052253,0.00009187646,0.000008416611,0.001085018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985981,0.00015425128,0.00038920034,0.00040991357,0.0002173576,0.00023115416],"domain_scores_gemma":[0.99610746,0.000071284856,0.00041154688,0.0031436484,0.00016943579,0.00009663047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000766099,0.0001498928,0.00021889595,0.00006197382,0.00060007395,0.00040193775,0.0041569737,0.000048069276,0.000039974755],"category_scores_gemma":[0.00012487349,0.00013367468,0.000029750252,0.00013604929,0.000092914604,0.00063746196,0.0039947536,0.00017667946,0.0000029468358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000756805,0.0000573828,0.00022684566,0.000014420444,0.000033891567,0.0000012114606,0.00035657233,0.8540206,0.00006035627,0.032855593,0.00021797721,0.11214756],"study_design_scores_gemma":[0.00028059923,0.000051954437,0.00007958718,0.00005749005,0.000009884821,0.0000024109308,0.00006938331,0.9987272,0.000061654944,0.000018030194,0.0004859588,0.00015585677],"about_ca_topic_score_codex":0.000031590345,"about_ca_topic_score_gemma":0.000024129684,"teacher_disagreement_score":0.96132284,"about_ca_system_score_codex":0.00004734955,"about_ca_system_score_gemma":0.00007818543,"threshold_uncertainty_score":0.7724761},"labels":[],"label_agreement":null},{"id":"W2742523248","doi":"10.1109/lsp.2017.2735806","title":"Distributed Alamouti Relay Beamforming Scheme in Multiuser Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Beamforming; Computer science; Relay channel; Signal-to-noise ratio (imaging); Transmitter power output; Optimization problem; Mathematical optimization; Power (physics); Algorithm; Mathematics; Telecommunications; Transmitter","score_opus":0.033820565308053864,"score_gpt":0.2824159891927094,"score_spread":0.24859542388465553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742523248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08991805,0.00039207004,0.902359,0.0064551285,0.00026859975,0.00016203677,0.0000010117085,0.00016524475,0.00027887477],"genre_scores_gemma":[0.97229815,0.000053083415,0.025435299,0.0019430985,0.00015391718,0.00002535997,0.000006977735,0.000019729232,0.00006438334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982422,0.00011085203,0.00039315823,0.000483056,0.00026305794,0.00050766126],"domain_scores_gemma":[0.99836105,0.000099897814,0.00032799135,0.0010003624,0.00010031584,0.00011039759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064492796,0.00023360766,0.00024080505,0.00011321061,0.0012133808,0.0009640925,0.0021868425,0.0001008236,0.000008405385],"category_scores_gemma":[0.000067729234,0.00022718645,0.00007077868,0.0003096959,0.00017061821,0.0015555971,0.0004199017,0.00061817875,0.000016762437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008514589,0.00031725876,0.03679551,0.0001050711,0.00008093153,0.00024959823,0.004450619,0.2646826,0.10854636,0.001889972,0.0109830415,0.57181394],"study_design_scores_gemma":[0.000644912,0.000016582442,0.00764876,0.00035250364,0.000004675619,0.000009900103,0.000014145104,0.98641926,0.0013650354,0.000027458089,0.0031200568,0.0003767344],"about_ca_topic_score_codex":0.000016154963,"about_ca_topic_score_gemma":0.000036955484,"teacher_disagreement_score":0.8823801,"about_ca_system_score_codex":0.00012639655,"about_ca_system_score_gemma":0.00006665576,"threshold_uncertainty_score":0.9332467},"labels":[],"label_agreement":null},{"id":"W2742528185","doi":"10.1109/tcomm.2017.2736549","title":"A Weighted Combining Algorithm for Spatial Multiplexing MIMO DF Relaying Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"MIMO; Spatial multiplexing; Computer science; Multiplexing; Algorithm; Electronic engineering; Beamforming; Telecommunications; Engineering","score_opus":0.08740658906341649,"score_gpt":0.32649771827796065,"score_spread":0.23909112921454417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742528185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017502207,0.00045006504,0.99187046,0.003118204,0.0010416496,0.00071770605,0.000041519244,0.00034221695,0.0022431551],"genre_scores_gemma":[0.8115328,0.0010439949,0.18617128,0.00012427318,0.000044710992,0.0005595525,0.000014087913,0.000026126338,0.00048320426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830526,0.00029769275,0.0004714236,0.00038258272,0.00021216458,0.00033087732],"domain_scores_gemma":[0.9921505,0.0008939163,0.0003294791,0.006139412,0.00035483617,0.00013188225],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00057628955,0.00022694435,0.00027474907,0.00019643093,0.006558673,0.0009077904,0.0050274176,0.00011117996,0.000009294844],"category_scores_gemma":[0.000035702233,0.00024454945,0.0001753967,0.00021284995,0.00020907263,0.00078520004,0.000083886844,0.00052821747,0.000042765936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011370612,0.0004500628,0.000019408175,0.000015065728,0.00013734518,0.0000011615192,0.0017391993,0.0029914044,0.0009927602,0.02192404,0.0002640915,0.9714541],"study_design_scores_gemma":[0.000945179,0.00007324754,0.00010145215,0.00015920616,0.00002304375,0.000008731627,0.00008679159,0.98039687,0.00091202825,0.00027170772,0.016735625,0.0002861393],"about_ca_topic_score_codex":0.00018265561,"about_ca_topic_score_gemma":0.0003464478,"teacher_disagreement_score":0.9774054,"about_ca_system_score_codex":0.00012450412,"about_ca_system_score_gemma":0.0000912521,"threshold_uncertainty_score":0.9972437},"labels":[],"label_agreement":null},{"id":"W2742585922","doi":"10.1109/isit.2017.8006843","title":"Towards an algebraic network information theory: Simultaneous joint typicality decoding","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Code word; Tuple; Computer science; Theoretical computer science; Linear code; Code (set theory); Encoder; Encoding (memory); Random access; Coding (social sciences); Algorithm; Mathematics; Block code; Discrete mathematics; Artificial intelligence","score_opus":0.04909971794798162,"score_gpt":0.30349375003246715,"score_spread":0.2543940320844855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742585922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007889004,0.000059818052,0.94251025,0.0019912575,0.00034200362,0.00014812998,5.6976126e-7,0.0002675513,0.046791427],"genre_scores_gemma":[0.9576137,0.00011392407,0.04043545,0.0015343716,0.00010647035,0.00000775989,0.000005361236,0.000004108461,0.00017883556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989214,0.00020962731,0.0002673939,0.00018025337,0.00016829766,0.00025302116],"domain_scores_gemma":[0.9975476,0.00013544603,0.00017774591,0.001834162,0.00017673628,0.00012826755],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001113083,0.00012068616,0.0001445166,0.00003615603,0.0012667235,0.0012110177,0.001805769,0.00005630732,0.00013133232],"category_scores_gemma":[0.0005594841,0.00010107851,0.000049303333,0.000104362145,0.000070457645,0.0024963203,0.000919885,0.0001640113,0.00012934489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041596654,0.000011067971,0.000105407205,0.0000015852862,0.000005389728,8.246163e-7,0.00034639498,0.0005510653,0.000014220379,0.57942194,0.0003165938,0.41922137],"study_design_scores_gemma":[0.00030716852,0.0000693042,0.010378109,0.000026714182,0.000004671943,0.0000080222935,0.00003702077,0.91200215,0.00027999832,0.054074176,0.022523338,0.00028933448],"about_ca_topic_score_codex":0.000011524665,"about_ca_topic_score_gemma":0.000067034794,"teacher_disagreement_score":0.94972473,"about_ca_system_score_codex":0.000043689935,"about_ca_system_score_gemma":0.000061131075,"threshold_uncertainty_score":0.99982584},"labels":[],"label_agreement":null},{"id":"W2743875549","doi":"10.1049/iet-com.2016.1312","title":"Optimal and simple near optimal non‐coherent detection in amplify‐and‐forward two‐way relaying over fast fading channels","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fading; Simple (philosophy); Computer science; Algorithm; Channel (broadcasting); Telecommunications","score_opus":0.05218717176585899,"score_gpt":0.32966969988873157,"score_spread":0.27748252812287255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743875549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7333307,0.001286479,0.25731182,0.003847671,0.00022418084,0.0005765733,0.0000063933007,0.00016571108,0.0032504683],"genre_scores_gemma":[0.96678996,0.0019423829,0.030925335,0.00012424962,0.000032422056,0.00009450881,0.000008805273,0.000015356101,0.00006695591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986974,0.00020993117,0.0003257469,0.00033839673,0.00013750982,0.0002910413],"domain_scores_gemma":[0.99617714,0.00026729182,0.0002092744,0.003132561,0.00009314374,0.00012059784],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00060110615,0.00018058228,0.00021943409,0.000119807184,0.0025238574,0.0011038234,0.0022710275,0.00007893573,0.000010759423],"category_scores_gemma":[0.00011905844,0.00019311794,0.00004356844,0.00020268066,0.0002842851,0.0009983331,0.00349911,0.0005212676,0.000012655367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047224134,0.00041310387,0.022164052,0.000045274526,0.00013712027,0.000008128727,0.02903701,0.02067295,0.011546963,0.051594354,0.00043825302,0.8638956],"study_design_scores_gemma":[0.00079822267,0.000054714936,0.036629695,0.000084391075,0.000009656245,0.000015314567,0.00017335807,0.95157504,0.00034918546,0.000269205,0.009755601,0.00028564085],"about_ca_topic_score_codex":0.0001933014,"about_ca_topic_score_gemma":0.0007877147,"teacher_disagreement_score":0.93090206,"about_ca_system_score_codex":0.000078405086,"about_ca_system_score_gemma":0.00003865619,"threshold_uncertainty_score":0.9999331},"labels":[],"label_agreement":null},{"id":"W2743884249","doi":"10.7939/r3bp8w","title":"Performance evaluation, optimal power allocation, and physical layer designs for wireless relaying systems","year":2009,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Computer science; Channel state information; Wireless; Physical layer; Ergodic theory; Wireless network; Channel (broadcasting); Mathematical optimization; Computer network; Telecommunications; Mathematics","score_opus":0.03475796240736693,"score_gpt":0.23977814746320084,"score_spread":0.20502018505583391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743884249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92548764,0.00018493972,0.06661637,0.0023149364,0.000047883485,0.00030451673,4.593704e-7,0.00004321122,0.0050000725],"genre_scores_gemma":[0.99197614,0.00013440539,0.0069654034,0.000091830305,0.000015263706,6.0333736e-7,0.0000081567,0.0000033798772,0.0008048336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994553,0.0000794126,0.00008187008,0.00017332156,0.0001108447,0.000099288714],"domain_scores_gemma":[0.9993229,0.0001732712,0.00006972408,0.00027898516,0.00010621821,0.000048920458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012212544,0.0000709136,0.000109205735,0.000058634392,0.000228166,0.000048861806,0.0004472769,0.000030351295,0.000011310757],"category_scores_gemma":[0.000011487192,0.00007816125,0.000029395944,0.00018220195,0.00003845413,0.0013076939,0.000121479505,0.000053697135,0.0000030278873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024592946,0.0005992929,0.009524748,0.00009435032,0.00017024789,0.000002618393,0.086416736,0.020167286,0.0063784383,0.70525867,0.023002112,0.14813957],"study_design_scores_gemma":[0.00047139166,0.0001420754,0.0069105425,0.000054074135,0.000013188857,0.000002140938,0.00029025192,0.9878033,0.0004869207,0.00007623627,0.0036236627,0.00012622321],"about_ca_topic_score_codex":0.0000054043912,"about_ca_topic_score_gemma":0.0000016505883,"teacher_disagreement_score":0.967636,"about_ca_system_score_codex":0.00001400171,"about_ca_system_score_gemma":0.00007955986,"threshold_uncertainty_score":0.3187323},"labels":[],"label_agreement":null},{"id":"W2744996721","doi":"10.1109/tmc.2017.2737422","title":"Performance Analysis of Network Coding with IEEE 802.11 DCF in Multi-Hop Wireless Networks","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Retransmission; Computer network; Linear network coding; Network packet; Wireless network; Distributed coordination function; IEEE 802.11; Queueing theory; Unicast; Wireless; Distributed computing; Telecommunications","score_opus":0.04734255140235394,"score_gpt":0.3000373913583815,"score_spread":0.25269483995602754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744996721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.234264,0.00022447281,0.763593,0.00003317588,0.0010395359,0.000558091,0.000005945931,0.00016424284,0.00011753171],"genre_scores_gemma":[0.9803682,0.0018241011,0.017399322,0.00006516035,0.00010165418,0.00011912647,0.000012449794,0.00004192063,0.00006808946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644774,0.00041757125,0.00097292295,0.0010625281,0.0004248093,0.0006744265],"domain_scores_gemma":[0.9954093,0.0005388725,0.0009152642,0.0026794972,0.00031475115,0.0001423283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011364346,0.00056730147,0.0011875636,0.0007954616,0.0009212944,0.0003415185,0.002781775,0.00032797112,0.000013414307],"category_scores_gemma":[0.0000048915035,0.00056723756,0.0003856563,0.0019021347,0.00019058776,0.000308387,0.00012661512,0.0016915996,0.0000034196887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021343056,0.00018559264,0.0032783188,0.000048013168,0.00038224657,0.000005863771,0.0007982728,0.8891241,0.000026534593,0.000041900297,0.000015225363,0.10607262],"study_design_scores_gemma":[0.0005811796,0.00009813156,0.005895571,0.001474171,0.00024452136,0.000003738917,0.000028073346,0.9907473,0.00032599655,0.0000026012956,0.00003758307,0.00056115864],"about_ca_topic_score_codex":0.00009939852,"about_ca_topic_score_gemma":0.0015410706,"teacher_disagreement_score":0.7461937,"about_ca_system_score_codex":0.00023766844,"about_ca_system_score_gemma":0.00020149835,"threshold_uncertainty_score":0.9996779},"labels":[],"label_agreement":null},{"id":"W2746588124","doi":"10.1109/lcomm.2017.2743175","title":"Generalized Relay Selection for Network-Coded Cooperation Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Selection (genetic algorithm); Relay; Computer network; Linear network coding; Decoding methods; Theoretical computer science; Telecommunications; Artificial intelligence","score_opus":0.08290666875693752,"score_gpt":0.32381838451125644,"score_spread":0.2409117157543189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746588124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067598587,0.00094412325,0.96362996,0.02565163,0.0010096176,0.0007882102,0.000004609537,0.00028000426,0.0009319762],"genre_scores_gemma":[0.8500701,0.0013308692,0.1452429,0.0019233081,0.00030396922,0.0006193152,0.000051278756,0.000024789859,0.0004334518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998397,0.00042263154,0.00040715685,0.0003284832,0.00012839597,0.00031632933],"domain_scores_gemma":[0.9936998,0.00027007444,0.0003747778,0.0052071894,0.0003673639,0.00008081306],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008420444,0.00018066537,0.00022211345,0.00008539356,0.0041526463,0.0012921112,0.005011109,0.000078050856,0.0000038456087],"category_scores_gemma":[0.00013193306,0.00018958571,0.00009888597,0.0002219562,0.0001560733,0.0009562676,0.0005926064,0.0002506725,0.00002784196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016872009,0.00010579121,0.0011621264,0.000017159684,0.00011254828,2.63992e-7,0.00056287827,0.0547109,0.052067153,0.7974396,0.07237887,0.021425854],"study_design_scores_gemma":[0.00067900773,0.000027567756,0.000365098,0.000049810962,0.000016059415,0.000005209077,0.0000040527407,0.86718595,0.00057637814,0.00018134537,0.13064364,0.0002658659],"about_ca_topic_score_codex":0.000059593825,"about_ca_topic_score_gemma":0.00022051316,"teacher_disagreement_score":0.84331024,"about_ca_system_score_codex":0.00012535519,"about_ca_system_score_gemma":0.00006572921,"threshold_uncertainty_score":0.99974465},"labels":[],"label_agreement":null},{"id":"W2749637736","doi":"10.1109/access.2017.2741972","title":"On Design and Efficient Decoding of Sparse Random Linear Network Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Gruppo Nazionale per il Calcolo Scientifico; Nantong University; National Natural Science Foundation of China","keywords":"Linear network coding; Decoding methods; Computer science; Network packet; Overhead (engineering); Coding (social sciences); Algorithm; Code (set theory); Theoretical computer science; Computer network; Mathematics; Statistics","score_opus":0.113287726888919,"score_gpt":0.35605846030760885,"score_spread":0.24277073341868985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749637736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10969237,0.00031655584,0.88811135,0.00038128847,0.00036109478,0.00018586176,3.608276e-7,0.00003581339,0.0009153048],"genre_scores_gemma":[0.9831667,0.00046574653,0.01606558,0.00017006259,0.00007219228,0.000009767638,2.4552122e-7,0.0000053326435,0.000044358505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917275,0.00014988975,0.00017666612,0.0002082981,0.00012907665,0.00016330578],"domain_scores_gemma":[0.9981969,0.00053424295,0.000186492,0.000936448,0.00008862865,0.000057280617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006982447,0.000095309304,0.00018013518,0.000042180196,0.0005884752,0.00037925915,0.0017178407,0.000031198026,0.0000069203074],"category_scores_gemma":[0.00013365841,0.00008126842,0.00003083526,0.00009970345,0.00008897211,0.00027409615,0.00048582567,0.00009936349,0.00000554057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029225592,0.00020935522,0.004296442,0.000035418692,0.00007948278,0.000017159711,0.0011022283,0.7026989,0.0019385406,0.06746732,0.0076564574,0.21420649],"study_design_scores_gemma":[0.0009636846,0.000046795547,0.0027045682,0.00013225389,0.000005747696,0.0000020665843,0.000001620453,0.98719084,0.0073384913,0.001055142,0.0004274965,0.00013131757],"about_ca_topic_score_codex":0.0000060926636,"about_ca_topic_score_gemma":0.000010968166,"teacher_disagreement_score":0.87347436,"about_ca_system_score_codex":0.00001121599,"about_ca_system_score_gemma":0.000026203943,"threshold_uncertainty_score":0.4526135},"labels":[],"label_agreement":null},{"id":"W2753265799","doi":"","title":"On the Benefits of Network Coding in Multi-party Video Conferencing","year":2013,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Videoconferencing; Computer science; Coding (social sciences); Linear network coding; Computer network; Multimedia; Sociology","score_opus":0.08702547225086593,"score_gpt":0.3395578397854256,"score_spread":0.25253236753455965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753265799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87570554,0.00775359,0.041184194,0.002970942,0.0022611255,0.0020389985,0.0000026967402,0.00026722628,0.06781567],"genre_scores_gemma":[0.9916576,0.0011744511,0.0019254371,0.0002467608,0.000043764914,0.00006205524,0.000025390604,0.00001637073,0.0048481748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998721,0.00023239863,0.00031008938,0.00028599397,0.0002056251,0.00024488766],"domain_scores_gemma":[0.9979703,0.0006711371,0.00028497548,0.0008434073,0.00018945368,0.000040716033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004835227,0.00020031196,0.00028711252,0.00009804714,0.00016764097,0.000107926295,0.0011858204,0.00012268535,0.00011058455],"category_scores_gemma":[0.000170658,0.00015179499,0.000062648156,0.00048541647,0.000021721506,0.00010673872,0.0001660938,0.00047056467,0.00004709664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001583826,0.000070146525,0.00024678072,0.000044110897,0.000030432593,9.5192416e-7,0.019243527,0.005054337,0.0007410427,0.9452412,0.00555215,0.023759497],"study_design_scores_gemma":[0.0017751047,0.0002532614,0.087757334,0.0075849844,0.00004040601,0.0000030016192,0.0049712406,0.8750172,0.012959344,0.0032811486,0.004685185,0.0016717716],"about_ca_topic_score_codex":0.000073702795,"about_ca_topic_score_gemma":0.0014582869,"teacher_disagreement_score":0.94196004,"about_ca_system_score_codex":0.000052327177,"about_ca_system_score_gemma":0.00009651063,"threshold_uncertainty_score":0.619002},"labels":[],"label_agreement":null},{"id":"W2753952433","doi":"10.14209/jcis.2017.10","title":"On Multiplicative Matrix Channels over Finite Chain Rings","year":2017,"lang":"en","type":"article","venue":"Journal of Communication and Information Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Multiplicative function; Channel (broadcasting); Coding (social sciences); Matrix (chemical analysis); Mathematics; Transmitter; Channel capacity; Linear network coding; Topology (electrical circuits); Finite field; Chain (unit); Discrete mathematics; Computer science; Telecommunications; Combinatorics; Mathematical analysis; Physics; Statistics","score_opus":0.03205894422058727,"score_gpt":0.3065044624902132,"score_spread":0.27444551826962593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753952433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059062254,0.005259447,0.84838897,0.020724075,0.0019639276,0.0011845435,0.000010786644,0.00016497355,0.06324103],"genre_scores_gemma":[0.9943136,0.0034438483,0.0015766142,0.0004174282,0.00003950061,0.000010828005,0.000002755596,0.0000036290899,0.00019181828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869525,0.00020320075,0.0006653026,0.00006076301,0.0002707365,0.0001047615],"domain_scores_gemma":[0.9959205,0.00031878246,0.0017162334,0.0013740575,0.00057770795,0.00009274245],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012997278,0.00010833652,0.0002091632,0.00022329453,0.0007804282,0.001211165,0.0018245969,0.000056691966,0.000006247521],"category_scores_gemma":[0.00040046172,0.000089361514,0.000055735258,0.00010295271,0.00007242588,0.0053968583,0.00043968108,0.00027494165,0.000030490046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003752697,0.00005300257,0.0004529983,0.000027071465,0.000050917562,4.95077e-7,0.007656177,0.0025741654,0.000077498116,0.93770075,0.0033754602,0.04799397],"study_design_scores_gemma":[0.0023404935,0.00024850207,0.019774718,0.000695163,0.00001010141,0.00006621775,0.0005267317,0.5734304,0.00019637975,0.0011074741,0.4012672,0.0003365871],"about_ca_topic_score_codex":0.0000075681164,"about_ca_topic_score_gemma":0.0000011408059,"teacher_disagreement_score":0.93659323,"about_ca_system_score_codex":0.00005152913,"about_ca_system_score_gemma":0.00004144951,"threshold_uncertainty_score":0.99982566},"labels":[],"label_agreement":null},{"id":"W2754628908","doi":"10.1007/s11036-017-0906-x","title":"Improving Video Transmission in Cellular Networks with Cached and Segmented Video Download Algorithms","year":2017,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cache; Download; Transmission (telecommunications); Algorithm; Computer network; Telecommunications; World Wide Web","score_opus":0.01166417964007458,"score_gpt":0.24383589192001037,"score_spread":0.2321717122799358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754628908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005078451,0.0055400133,0.9876519,0.0005008743,0.00003010991,0.00082114845,0.0000015940158,0.00008143131,0.0002944641],"genre_scores_gemma":[0.9880492,0.0047956877,0.0059052743,0.00015313667,0.00010110469,0.0008886903,0.000019797984,0.000012059681,0.00007504896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874574,0.0000698034,0.00025798596,0.0005178529,0.00010806872,0.0003005605],"domain_scores_gemma":[0.9984792,0.000104369574,0.00015894602,0.0010313487,0.0000668942,0.00015926255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033401352,0.00019424483,0.00021705788,0.00005966682,0.0010880992,0.0005104107,0.000677766,0.000097330674,0.000006682228],"category_scores_gemma":[0.0000043291425,0.00016504938,0.000027645121,0.00023976724,0.00015156461,0.0003795532,0.00037208572,0.0003051953,0.0000014550478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001006882,0.000075922304,0.0016258213,0.000010882187,0.000013985072,0.0000032210123,0.00012898678,0.038435247,0.0008669312,0.0024007694,0.00011620146,0.95631194],"study_design_scores_gemma":[0.00072702765,0.00007220422,0.0028746016,0.00007008766,0.000012771832,0.0000074304107,0.00003021945,0.98194444,0.00013350337,0.00006667414,0.01381273,0.0002483206],"about_ca_topic_score_codex":0.000050870636,"about_ca_topic_score_gemma":0.000091864604,"teacher_disagreement_score":0.9829708,"about_ca_system_score_codex":0.000027317383,"about_ca_system_score_gemma":0.00002556036,"threshold_uncertainty_score":0.83688897},"labels":[],"label_agreement":null},{"id":"W2756132392","doi":"10.1109/icccn.2017.8038531","title":"Monotonic Optimization for Power Assignment in Two-Way Cognitive Radio Networks with Shared-Band Amplify-and-Forward Relays","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cognitive radio; Monotonic function; Optimization problem; Convex optimization; Computer science; Mathematical optimization; Transformation (genetics); Transmitter power output; Regular polygon; Algorithm; Mathematics; Telecommunications; Transmitter; Wireless","score_opus":0.02985963286996805,"score_gpt":0.2963570031395279,"score_spread":0.26649737026955983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756132392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015996231,0.0003058816,0.9880066,0.00094363705,0.000080924896,0.0007702263,0.0000021369447,0.00005463323,0.008236348],"genre_scores_gemma":[0.9542871,0.0004976408,0.044269685,0.00031509364,0.000024011173,0.0002193194,0.000011542471,0.0000121818775,0.0003633907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900043,0.0000717148,0.00019882742,0.0003645737,0.00011539111,0.00024909127],"domain_scores_gemma":[0.9987658,0.0002257196,0.00014829171,0.0006431131,0.00013195424,0.00008509108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003935427,0.00015004302,0.00018399132,0.00006473437,0.0005378739,0.00057226873,0.0006392555,0.00004725724,0.00005294367],"category_scores_gemma":[0.000060637452,0.0001213584,0.00002837364,0.00010395025,0.00007550196,0.0006753529,0.00026832175,0.00016079815,0.0000026332705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004214406,0.0003493457,0.014643844,0.000022200527,0.00020707345,0.000017182198,0.0039329706,0.6672449,0.00008814859,0.13146569,0.0029337157,0.17867348],"study_design_scores_gemma":[0.001967158,0.00014498063,0.0038757115,0.00010479266,0.000008605368,0.000004705522,0.000043903387,0.99267733,0.00011631565,0.00011248237,0.00072574965,0.00021823906],"about_ca_topic_score_codex":0.0000108528575,"about_ca_topic_score_gemma":0.00018038765,"teacher_disagreement_score":0.9526875,"about_ca_system_score_codex":0.00006281253,"about_ca_system_score_gemma":0.000041921307,"threshold_uncertainty_score":0.55184},"labels":[],"label_agreement":null},{"id":"W2756667118","doi":"10.23919/spects.2017.8046772","title":"Achieving maximal sum-rate capacity of two-way cognitive radio with relays operating in separate bands through MO","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cognitive radio; Optimization problem; Monotonic function; Transmission (telecommunications); Mathematical optimization; Computer science; Radio spectrum; Convex optimization; Spectrum (functional analysis); Regular polygon; Mathematics; Telecommunications; Wireless","score_opus":0.07114895405116176,"score_gpt":0.31465898846082685,"score_spread":0.2435100344096651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756667118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71913534,0.00011715707,0.2465351,0.0005204165,0.000050535247,0.0002722961,0.0000021406493,0.000054985256,0.033311997],"genre_scores_gemma":[0.9725287,0.0001589882,0.026678136,0.00020554494,0.000027810309,0.000026657059,0.00000198101,0.000010135145,0.00036205607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985592,0.0002885434,0.00032724818,0.00037832934,0.00016135398,0.00028537173],"domain_scores_gemma":[0.9984227,0.00022659771,0.00024100018,0.0008187714,0.00023277818,0.00005815611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080188265,0.00018454087,0.00029983697,0.00006002637,0.0006649994,0.00037703812,0.0011957654,0.000045476903,0.000028086646],"category_scores_gemma":[0.00014770537,0.00014626032,0.000043152664,0.00023479701,0.0001955603,0.0014761975,0.0006207479,0.00031816057,0.000011975796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015165946,0.0005689691,0.24457149,0.00008574616,0.00025559918,0.000083659164,0.034637373,0.0065880106,0.05189139,0.61237663,0.00035232838,0.048437163],"study_design_scores_gemma":[0.006951613,0.0006194609,0.2674023,0.0013554402,0.000034398938,0.00006155184,0.0005735556,0.66125184,0.05903755,0.0009744328,0.0004783094,0.0012595572],"about_ca_topic_score_codex":0.00016379346,"about_ca_topic_score_gemma":0.00069554907,"teacher_disagreement_score":0.6546638,"about_ca_system_score_codex":0.00004316234,"about_ca_system_score_gemma":0.00006671056,"threshold_uncertainty_score":0.59643227},"labels":[],"label_agreement":null},{"id":"W2757478948","doi":"10.1587/transcom.2017ebp3015","title":"Low-Latency Communication in LTE and WiFi Using Spatial Diversity and Encoding Redundancy","year":2017,"lang":"en","type":"article","venue":"IEICE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Redundancy (engineering); Antenna diversity; Latency (audio); Computer network; Encoding (memory); Telecommunications; Wireless; Artificial intelligence","score_opus":0.09279263198215977,"score_gpt":0.3181030689530498,"score_spread":0.22531043697089004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757478948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24031268,0.0034181532,0.7327198,0.014559553,0.00022938655,0.0007344876,0.00001426198,0.00023812972,0.0077735637],"genre_scores_gemma":[0.96324885,0.016025502,0.020459559,0.00012987608,0.0000073184315,0.000024510875,0.0000030035915,0.0000098942355,0.000091469374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986745,0.0003679008,0.00030193003,0.00030636534,0.00014638799,0.0002029209],"domain_scores_gemma":[0.9950235,0.0003434389,0.00020013518,0.00420901,0.00012327562,0.00010065366],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005217318,0.0001658381,0.00019357106,0.0002655109,0.0083717955,0.00037748195,0.0028241824,0.0000836385,0.000009702286],"category_scores_gemma":[0.0000538275,0.0001896726,0.00004290691,0.0002734993,0.00042276186,0.0012515583,0.0012263472,0.0005388941,0.0000046443324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006410126,0.001472491,0.02284907,0.00007561257,0.00014107606,0.000006623056,0.03485463,0.0013156814,0.0051228926,0.21090516,0.000032369528,0.72316027],"study_design_scores_gemma":[0.0025576393,0.00013536146,0.19705991,0.0009627041,0.000078043675,0.00005200468,0.00056380266,0.78807545,0.0011403426,0.006502642,0.0018687375,0.0010033604],"about_ca_topic_score_codex":0.0006946729,"about_ca_topic_score_gemma":0.0031748505,"teacher_disagreement_score":0.7867598,"about_ca_system_score_codex":0.000095150586,"about_ca_system_score_gemma":0.000048933765,"threshold_uncertainty_score":0.99291915},"labels":[],"label_agreement":null},{"id":"W2757842630","doi":"10.1109/twc.2017.2755026","title":"Bi-Directional Multi-Hop Wireless Pipeline Using Physical-Layer Network Coding","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Bit error rate; Hop (telecommunications); Relay; Linear network coding; Upper and lower bounds; Coding gain; Wireless network; Wireless; Computer network; End-to-end principle; Algorithm; Decoding methods; Telecommunications; Network packet; Mathematics","score_opus":0.11764620974821427,"score_gpt":0.3488583466181933,"score_spread":0.23121213686997905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757842630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015293713,0.00020629728,0.97847193,0.0029643236,0.00085691595,0.00038710376,0.000021041902,0.00045832482,0.001340346],"genre_scores_gemma":[0.94598186,0.0022263064,0.05042958,0.0003353559,0.00016195598,0.00014182061,0.000008619656,0.00004659055,0.0006679402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974835,0.00049214833,0.0005314778,0.0005819777,0.00038074655,0.00053016585],"domain_scores_gemma":[0.991338,0.00059739035,0.0004234582,0.0069642966,0.00046012097,0.00021669715],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005156905,0.00038242654,0.0004327223,0.00020855617,0.007465278,0.00075122423,0.0057700253,0.00013735202,0.00003287548],"category_scores_gemma":[0.000022801649,0.00040855163,0.00027718488,0.00062145345,0.00048416076,0.0011754296,0.00017987,0.0009788086,0.00009936137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064417196,0.003442497,0.00046649124,0.000041103696,0.00042845935,0.000008931938,0.00335924,0.10884164,0.05188528,0.07985719,0.0014112473,0.7501935],"study_design_scores_gemma":[0.00073140115,0.000031036427,0.0005924411,0.0001866987,0.000043085292,0.00001592363,0.00003581456,0.9884869,0.006709101,0.00019539513,0.0024948386,0.00047739912],"about_ca_topic_score_codex":0.000101644386,"about_ca_topic_score_gemma":0.00065693725,"teacher_disagreement_score":0.93068814,"about_ca_system_score_codex":0.0002190089,"about_ca_system_score_gemma":0.00018111944,"threshold_uncertainty_score":0.9998366},"labels":[],"label_agreement":null},{"id":"W2758267643","doi":"10.1109/twc.2017.2755017","title":"Design and Analysis of Hierarchical Physical Layer Network Coding","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Linear network coding; Computer network; Relay channel; Node (physics); Phase-shift keying; Channel (broadcasting); Wireless; Physical layer; Bit error rate; Telecommunications; Network packet; Engineering","score_opus":0.08415139727514076,"score_gpt":0.328688036756599,"score_spread":0.24453663948145826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758267643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011863939,0.0001227701,0.9846515,0.0023235579,0.00008081832,0.00018701798,0.0000060970965,0.00008603223,0.0006782707],"genre_scores_gemma":[0.9496305,0.0024063534,0.04770862,0.000102342936,0.000012699171,0.00006205883,0.0000029878536,0.0000098312075,0.00006458068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985866,0.00046462336,0.00028673533,0.0002723621,0.00018308111,0.0002066241],"domain_scores_gemma":[0.99395204,0.0010509538,0.00021287744,0.0045338715,0.00014739812,0.000102887585],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00043806527,0.00014910627,0.0003509589,0.00022451377,0.002124193,0.000232922,0.0030372837,0.00005998662,0.000009218348],"category_scores_gemma":[0.000012785283,0.00015209643,0.0001538369,0.0006817213,0.00043890416,0.0003962999,0.000090621885,0.00041546713,0.000005737196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004646994,0.0009573961,0.00057723373,0.00001456347,0.0017187098,0.0000017602714,0.004283887,0.12384447,0.0074708303,0.30957314,0.00015342727,0.5513581],"study_design_scores_gemma":[0.00022781742,0.000047326743,0.004103206,0.0000416158,0.00020284083,0.000001423164,0.000010591437,0.99239075,0.0019809948,0.0006339086,0.00019303036,0.00016649526],"about_ca_topic_score_codex":0.000014208467,"about_ca_topic_score_gemma":0.00008918016,"teacher_disagreement_score":0.9377666,"about_ca_system_score_codex":0.000031222626,"about_ca_system_score_gemma":0.00005128783,"threshold_uncertainty_score":0.9991749},"labels":[],"label_agreement":null},{"id":"W2761089354","doi":"10.1109/infocom.2017.8057027","title":"FEC for VoIP using dual-delay streaming codes","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Forward error correction; Voice over IP; Network packet; Computer network; Packet loss; Channel (broadcasting); Error detection and correction; Real-time computing; Algorithm; Decoding methods; The Internet","score_opus":0.1191824609001632,"score_gpt":0.35908276130249517,"score_spread":0.23990030040233196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761089354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032086167,0.00011716877,0.9574726,0.0012929458,0.00020369313,0.00014646,0.0000011085924,0.00009500369,0.008584847],"genre_scores_gemma":[0.86602503,0.000056735178,0.13240527,0.00019371013,0.00006017503,0.000008021274,0.0000010521503,0.0000048528705,0.0012451351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943507,0.00003044687,0.00011710625,0.0001827998,0.00007476977,0.00015983221],"domain_scores_gemma":[0.9985918,0.000121860234,0.00008829055,0.0010325827,0.00011887552,0.000046619138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025577928,0.00007635951,0.00009576637,0.000030082625,0.0011766359,0.00057022274,0.00094046956,0.00002589313,0.000015433592],"category_scores_gemma":[0.00010397014,0.000066291286,0.0000424518,0.00004324103,0.00004077346,0.0005223867,0.000531608,0.000054505872,0.000008864169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065643635,0.000069529946,0.0015472821,0.000013248173,0.00004043295,0.0000047135713,0.0010896438,0.00061805954,0.015260497,0.54378057,0.0029246346,0.43464482],"study_design_scores_gemma":[0.00037323294,0.000030232302,0.002611575,0.000038100778,0.0000049062123,0.000008101701,0.000029890649,0.975167,0.0035520808,0.001138155,0.016851868,0.00019490045],"about_ca_topic_score_codex":0.00001873648,"about_ca_topic_score_gemma":0.000117208474,"teacher_disagreement_score":0.9745489,"about_ca_system_score_codex":0.000025187424,"about_ca_system_score_gemma":0.000036437545,"threshold_uncertainty_score":0.9049851},"labels":[],"label_agreement":null},{"id":"W2762855506","doi":"10.1109/tcomm.2017.2761867","title":"Joint Relay Beamforming and Receiver Processing for Multi-Way Multi-Antenna Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Relay; Beamforming; Computer science; Relay channel; Signal-to-noise ratio (imaging); Optimization problem; Channel state information; Channel (broadcasting); Interference (communication); Convex optimization; Electronic engineering; Power (physics); Algorithm; Telecommunications; Wireless; Mathematics; Engineering; Regular polygon","score_opus":0.16765956673449453,"score_gpt":0.35076821495119004,"score_spread":0.1831086482166955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762855506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046919758,0.0013040951,0.9924233,0.0042599007,0.00037015844,0.00062181434,0.000010947835,0.00022887775,0.0003117371],"genre_scores_gemma":[0.6551281,0.005151378,0.33832517,0.00023067393,0.000019155195,0.0002762217,0.0000049675928,0.000024161423,0.0008401512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844813,0.00019023349,0.00045396676,0.0004307989,0.00013650856,0.00034037305],"domain_scores_gemma":[0.9945745,0.0003083692,0.0003250285,0.0042977417,0.0003427728,0.00015160885],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00064904185,0.00024493676,0.00026683044,0.00016409456,0.0062838565,0.0006502469,0.0028379017,0.00013553047,0.0000067252695],"category_scores_gemma":[0.00006692229,0.0002446943,0.00013931148,0.00021672563,0.0003535068,0.0011345808,0.00010454392,0.0006620047,0.000012069322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036896345,0.0011395855,0.00013045345,0.000047489644,0.00014941917,0.0000016268947,0.0052684317,0.01439182,0.004075404,0.0068836883,0.00031769898,0.9675575],"study_design_scores_gemma":[0.0009885646,0.00005725923,0.0010872906,0.00021044796,0.000032456177,0.000010527332,0.00008552656,0.9910116,0.0006018523,0.000039004008,0.0055728033,0.0003026351],"about_ca_topic_score_codex":0.000026790578,"about_ca_topic_score_gemma":0.00066619675,"teacher_disagreement_score":0.97661984,"about_ca_system_score_codex":0.00009430917,"about_ca_system_score_gemma":0.0000749993,"threshold_uncertainty_score":0.9978344},"labels":[],"label_agreement":null},{"id":"W2763550211","doi":"10.1016/j.jalgebra.2018.02.005","title":"Skew and linearized Reed–Solomon codes and maximum sum rank distance codes over any division ring","year":2018,"lang":"en","type":"preprint","venue":"Journal of Algebra","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Danmarks Frie Forskningsfond","keywords":"Mathematics; Reed–Solomon error correction; Skew; Hamming distance; Coding theory; Discrete mathematics; Reed–Muller code; Rank (graph theory); Linear code; Block code; Hamming code; Linear network coding; Expander code; Combinatorics; Algorithm; Decoding methods; Computer science; Telecommunications","score_opus":0.027923489115857396,"score_gpt":0.29107322304418354,"score_spread":0.26314973392832613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763550211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4689479,0.01365499,0.5146064,0.0013962286,0.0007502756,0.00018124221,0.000006576045,0.00004698296,0.0004094266],"genre_scores_gemma":[0.9466418,0.020545095,0.03228024,0.00019840966,0.00025224607,0.00000249974,0.0000028891218,0.000015980413,0.000060831917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981081,0.00028873907,0.0006454343,0.00035917148,0.00036455586,0.00023398956],"domain_scores_gemma":[0.9976963,0.00031570916,0.00074848556,0.0006636933,0.00039401074,0.00018183679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012738277,0.00025774437,0.00057098735,0.00019572783,0.00027238755,0.000645793,0.0010229532,0.00016356312,0.000016957898],"category_scores_gemma":[0.00017781343,0.00022026141,0.00011163975,0.00018349521,0.00018889653,0.00044414183,0.0023398537,0.0008301068,0.0000021169665],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012649738,0.0010351742,0.07598489,0.0015260597,0.0018358295,0.0004163124,0.02232813,0.000758392,0.024630936,0.0728916,0.010947192,0.7863805],"study_design_scores_gemma":[0.0101652695,0.0014017549,0.3257822,0.012607952,0.00035538495,0.00063110015,0.00017155439,0.5170399,0.0076487917,0.08756937,0.033439465,0.0031872564],"about_ca_topic_score_codex":0.000008432992,"about_ca_topic_score_gemma":0.00003366419,"teacher_disagreement_score":0.78319323,"about_ca_system_score_codex":0.00006247836,"about_ca_system_score_gemma":0.00010564935,"threshold_uncertainty_score":0.8982},"labels":[],"label_agreement":null},{"id":"W2765087690","doi":"10.1109/tvt.2017.2766209","title":"Design of Channel Coded Heterogeneous Modulation Physical Layer Network Coding","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Decoding methods; Relay; Relay channel; Linear network coding; Decodes; Computer science; Channel (broadcasting); Coding (social sciences); Bit error rate; Algorithm; Coding gain; Computer network; Mathematics; Physics","score_opus":0.05266075169647405,"score_gpt":0.2871354576710796,"score_spread":0.23447470597460557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765087690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030217038,0.0000717068,0.96774846,0.0011410414,0.00026821758,0.0002515669,0.0000011895464,0.00024976328,0.000051030314],"genre_scores_gemma":[0.9884844,0.00020333193,0.011110557,0.00006209719,0.000030145915,0.000058618254,5.440862e-7,0.000012965823,0.000037379912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989659,0.000108549604,0.00020931725,0.00031378644,0.00015424774,0.00024817412],"domain_scores_gemma":[0.9980337,0.0000759277,0.00018465228,0.0015242909,0.0001408195,0.000040604777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019653155,0.00015335037,0.00024379429,0.00017268445,0.0008051607,0.00007149258,0.0012616229,0.00015266382,0.0000054842126],"category_scores_gemma":[0.000011383336,0.0001536931,0.00008909142,0.00029669274,0.00016668541,0.00022217947,0.000023201672,0.0003005503,0.000019068477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001662721,0.00014397746,0.000010810218,0.000005408913,0.000066222645,0.00000802193,0.00015968224,0.868319,0.036429945,0.007909905,0.000025764222,0.08690465],"study_design_scores_gemma":[0.00029555988,0.00012681932,0.000055841054,0.00003998063,0.000011755936,0.000014832234,0.000003585825,0.8572918,0.13951716,0.002433281,0.000071436814,0.00013791109],"about_ca_topic_score_codex":0.0000026457576,"about_ca_topic_score_gemma":0.0000090894555,"teacher_disagreement_score":0.95826733,"about_ca_system_score_codex":0.00004005382,"about_ca_system_score_gemma":0.00002781396,"threshold_uncertainty_score":0.62674224},"labels":[],"label_agreement":null},{"id":"W2765737508","doi":"","title":"Two–Way Relaying Communications with OFDM and BICM/BICM-ID","year":2016,"lang":"en","type":"article","venue":"University Library (University of Saskatchewan)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Orthogonal frequency-division multiplexing; Computer science; Telecommunications; Channel (broadcasting)","score_opus":0.016388822164516002,"score_gpt":0.1861945017759152,"score_spread":0.1698056796113992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765737508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51397747,0.00095125916,0.3926902,0.049675062,0.00012541558,0.0005752021,0.000079125064,0.0010199371,0.040906284],"genre_scores_gemma":[0.92050385,0.00155758,0.070455976,0.00012219875,0.000008267049,4.3229946e-8,0.000008092442,0.000008361175,0.0073355986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990321,0.00021057593,0.00008963558,0.00031930397,0.0001481471,0.00020025877],"domain_scores_gemma":[0.9981289,0.00024651753,0.00014031169,0.0012441247,0.00007991506,0.00016021838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010598451,0.00014235183,0.00020166929,0.00023116586,0.00065566174,0.00004092573,0.0021592123,0.00006269857,0.00012858052],"category_scores_gemma":[0.0000038117741,0.00013778497,0.000054525357,0.0006384095,0.000527287,0.0031578152,0.0023094916,0.00016253014,0.000024248704],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056385365,0.0006477359,0.088197805,0.0000939146,0.0005854797,0.00027335575,0.10901205,0.000042369404,0.009593678,0.2785668,0.007527434,0.5048955],"study_design_scores_gemma":[0.02085483,0.001366743,0.079129755,0.0018707779,0.0003521477,0.00015427233,0.23313975,0.018746551,0.0036943988,0.0047300425,0.63224757,0.0037131829],"about_ca_topic_score_codex":0.00013731669,"about_ca_topic_score_gemma":0.0007453505,"teacher_disagreement_score":0.6247201,"about_ca_system_score_codex":0.00004724835,"about_ca_system_score_gemma":0.0001697938,"threshold_uncertainty_score":0.5618708},"labels":[],"label_agreement":null},{"id":"W2766448030","doi":"10.1109/twc.2017.2762300","title":"Double Auction Based Multi-Flow Transmission in Software-Defined and Virtualized Wireless Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"China Scholarship Council; Academy of Finland","keywords":"Computer science; Computer network; Wireless; Software; Transmission (telecommunications); Distributed computing; Telecommunications; Operating system","score_opus":0.06053913852336691,"score_gpt":0.30892584351137187,"score_spread":0.24838670498800497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766448030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006199958,0.0004437851,0.9876956,0.0043922104,0.00027852168,0.0005133817,0.000006742167,0.00031931527,0.00015051528],"genre_scores_gemma":[0.89394915,0.005375554,0.09991,0.00024076979,0.000012640634,0.0002790647,0.000012328764,0.000030684376,0.00018979814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792796,0.00044353848,0.0005274538,0.0005150841,0.00023016297,0.0003558231],"domain_scores_gemma":[0.9942195,0.0004875418,0.00024467788,0.00469327,0.00017299864,0.00018202754],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00056684064,0.00030432985,0.00036181344,0.00031151765,0.002882967,0.00051746005,0.0031677824,0.00019538669,0.000021680997],"category_scores_gemma":[0.000011962387,0.00032134575,0.00012890334,0.0004503866,0.00037015413,0.0009252343,0.000063254396,0.00081153057,0.000011988542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012898477,0.0010511343,0.00023767048,0.000019422803,0.000044972585,0.0000028153645,0.0010578278,0.060607642,0.0012053925,0.0041039297,0.00004466419,0.93149555],"study_design_scores_gemma":[0.0033667185,0.00005768045,0.001840016,0.00021971659,0.000019933364,0.00000513975,0.00003200892,0.9916383,0.0012419289,0.000060257793,0.0011600973,0.00035818006],"about_ca_topic_score_codex":0.00015061739,"about_ca_topic_score_gemma":0.0016168803,"teacher_disagreement_score":0.9311374,"about_ca_system_score_codex":0.00012803992,"about_ca_system_score_gemma":0.000121722434,"threshold_uncertainty_score":0.9999239},"labels":[],"label_agreement":null},{"id":"W2768807967","doi":"10.23919/softcom.2017.8115540","title":"Gain analysis of cooperative broadcast in two-dimensional wireless networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Node (physics); Computer network; Transmission (telecommunications); Energy (signal processing); Energy consumption; Set (abstract data type); Wireless network; Wireless; Upper and lower bounds; Power (physics); Efficient energy use; Telecommunications; Mathematics; Engineering; Electrical engineering","score_opus":0.040289315443212174,"score_gpt":0.32548148701815205,"score_spread":0.28519217157493987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768807967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25104022,0.00050111226,0.7295971,0.0017926517,0.00020029375,0.00021695814,0.0000022858032,0.00006506862,0.016584314],"genre_scores_gemma":[0.9958384,0.00012316846,0.0033605082,0.00026431406,0.000019373296,0.0000073979836,0.0000053392587,0.000003483739,0.00037799755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998951,0.00016846252,0.00028286333,0.00026857565,0.00015429356,0.00017475845],"domain_scores_gemma":[0.99810916,0.000168618,0.00016228722,0.0013032962,0.00020004222,0.000056571236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048432517,0.00010684656,0.00029819968,0.00021936852,0.00030115945,0.00016242712,0.0014002572,0.000028839186,0.0000989703],"category_scores_gemma":[0.000047920938,0.00009225472,0.000083199564,0.00074371486,0.00011115329,0.00038347192,0.0007886555,0.00014782588,0.0000056104745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020139254,0.00022168912,0.035150893,0.0000023921189,0.00040654527,0.000012850421,0.0010377143,0.36141574,0.001706587,0.43106374,0.0006966365,0.16826507],"study_design_scores_gemma":[0.0003253002,0.000014499971,0.03448551,0.000017942655,0.00001774411,5.6981463e-7,0.000010803979,0.96441436,0.0004738284,0.00003942467,0.00009057274,0.00010946255],"about_ca_topic_score_codex":0.00011327223,"about_ca_topic_score_gemma":0.0021175442,"teacher_disagreement_score":0.7447982,"about_ca_system_score_codex":0.000029713896,"about_ca_system_score_gemma":0.000046840167,"threshold_uncertainty_score":0.37620384},"labels":[],"label_agreement":null},{"id":"W2769933087","doi":"10.1109/ficloudw.2017.74","title":"Secrecy Analysis of Cooperative Network with Untrustworthy Relays Using Location-Based Multicasting Technique","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Secrecy; Computer science; Computer network; Multicast; Beamforming; Scalability; Relay; Disjoint sets; Broadcasting (networking); Node (physics); Telecommunications; Computer security; Power (physics); Engineering; Mathematics; Physics","score_opus":0.05365126496103658,"score_gpt":0.31402154932944476,"score_spread":0.2603702843684082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769933087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100283455,0.000083921936,0.986325,0.0002616649,0.00003610907,0.0003485036,9.0955996e-7,0.00008351971,0.002832023],"genre_scores_gemma":[0.7597199,0.0000118709,0.24002802,0.00012910918,0.000020606232,0.00003027913,0.0000044726876,0.0000069288867,0.000048828617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987726,0.00016932159,0.00031398723,0.0003271674,0.0001917604,0.00022516491],"domain_scores_gemma":[0.9967825,0.00028359945,0.00038104926,0.0017201329,0.00075902266,0.00007371895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059061806,0.00015560788,0.00032230164,0.00018580347,0.0009981341,0.00025658793,0.0012458237,0.00005432581,0.000044075605],"category_scores_gemma":[0.00016745081,0.00012504168,0.00006872656,0.0015745296,0.00016580494,0.00042257493,0.0003423644,0.00016352707,0.0000018339747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017062508,0.00006414736,0.05031839,0.000008790945,0.00035582457,0.0000045094375,0.00029453597,0.8564252,0.0006298337,0.08367588,0.000021777272,0.0081840325],"study_design_scores_gemma":[0.00022448595,0.000045761648,0.011059649,0.000104136336,0.00011692671,0.0000015329608,0.000016698572,0.9864686,0.0016580874,0.000049351198,0.00008000383,0.00017475],"about_ca_topic_score_codex":0.00007392191,"about_ca_topic_score_gemma":0.0005869124,"teacher_disagreement_score":0.74969155,"about_ca_system_score_codex":0.000052423973,"about_ca_system_score_gemma":0.00020317518,"threshold_uncertainty_score":0.7676942},"labels":[],"label_agreement":null},{"id":"W2770100404","doi":"10.1109/vtcspring.2017.8108427","title":"An Efficient Noma V2X Communication Scheme in the Internet of Vehicles","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Erasure; Computer science; Belief propagation; Algorithm; Sequential decoding; Tanner graph; Encoder; Theoretical computer science; Low-density parity-check code; Block code","score_opus":0.05975137769081378,"score_gpt":0.32734203105306386,"score_spread":0.2675906533622501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770100404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8989155,0.00029751327,0.07549321,0.004964438,0.00004448997,0.00015521268,2.0147228e-7,0.0000370315,0.020092381],"genre_scores_gemma":[0.98459136,0.0000875976,0.01501354,0.00023120361,0.0000053945646,0.0000077585855,0.0000011456773,0.0000018474457,0.00006011958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993567,0.0002078581,0.00015021155,0.00010490356,0.00010275718,0.00007755326],"domain_scores_gemma":[0.9972416,0.00009606242,0.00010390655,0.0024738684,0.000067044006,0.000017510278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071426324,0.00004927307,0.000068953195,0.00003561739,0.00019260307,0.00021481272,0.004210538,0.00001899413,0.000012301562],"category_scores_gemma":[0.000045263794,0.00003375285,0.000019733872,0.00008366001,0.00009276683,0.00023575938,0.000582136,0.00010393805,0.000009209364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048442457,0.00027864537,0.0135063715,0.0000036345987,0.0000053071117,7.027038e-7,0.0071813953,0.00017298947,0.002321569,0.88359505,0.0005338794,0.09239563],"study_design_scores_gemma":[0.00022345035,0.000039153394,0.16526237,0.00003418722,7.9618184e-7,0.0000015603063,0.00013213417,0.8299255,0.0021533135,0.00038772525,0.0017659658,0.00007384506],"about_ca_topic_score_codex":0.000065405016,"about_ca_topic_score_gemma":0.00024558083,"teacher_disagreement_score":0.8832073,"about_ca_system_score_codex":0.000011688725,"about_ca_system_score_gemma":0.000015420734,"threshold_uncertainty_score":0.78242975},"labels":[],"label_agreement":null},{"id":"W2770779175","doi":"10.1109/wimob.2017.8115831","title":"Superposition coding in alternate DF relaying systems with inter-relay interference cancellation","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Relay; Single antenna interference cancellation; Computer science; Decodes; Decoding methods; Transmitter; Topology (electrical circuits); Transmission (telecommunications); Interference (communication); Linear network coding; Base station; Coding (social sciences); Spectral efficiency; Electronic engineering; Computer network; Channel (broadcasting); Power (physics); Telecommunications; Engineering; Mathematics; Electrical engineering; Network packet; Physics","score_opus":0.048829857203042365,"score_gpt":0.29118748332108796,"score_spread":0.2423576261180456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770779175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17382286,0.00016080371,0.80361605,0.0011293305,0.0004155474,0.00021150384,3.5793028e-7,0.000099255536,0.020544298],"genre_scores_gemma":[0.9963522,0.00025484266,0.0025808022,0.000074020885,0.00003113951,0.000023061944,0.0000017241846,0.0000062704607,0.00067596644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991164,0.00010088796,0.00021934113,0.0002719608,0.00011668242,0.00017473029],"domain_scores_gemma":[0.9987494,0.000059819835,0.0001437974,0.0008974351,0.00010339272,0.000046183348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000336177,0.00011009307,0.0001327639,0.00009824612,0.00039962833,0.00078648655,0.0011365655,0.00003377681,0.000011926573],"category_scores_gemma":[0.000026528494,0.00009065367,0.000017911787,0.0001064145,0.000042584434,0.0010456846,0.0004149312,0.00018540822,0.000019983734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011680089,0.00016635518,0.2259589,0.00009435539,0.00007875518,0.00008642791,0.014678482,0.012086159,0.016622795,0.5304073,0.00074250344,0.19896117],"study_design_scores_gemma":[0.0004885952,0.00007543048,0.010078473,0.00072067283,0.0000024550893,0.000022795657,0.00008619615,0.98684263,0.00094394723,0.00008214678,0.00043971854,0.00021691114],"about_ca_topic_score_codex":0.00030347303,"about_ca_topic_score_gemma":0.0012910654,"teacher_disagreement_score":0.9747565,"about_ca_system_score_codex":0.00012796026,"about_ca_system_score_gemma":0.00003237571,"threshold_uncertainty_score":0.75841075},"labels":[],"label_agreement":null},{"id":"W2774224529","doi":"10.1109/iemcon.2017.8117202","title":"Max-min optimization of transmission powers in the two-way cognitive radio network assisted by orthogonally signaling relays","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Transmission (telecommunications); Optimization problem; Computer science; Mathematical optimization; Boundary (topology); Set (abstract data type); Convex optimization; Simple (philosophy); Feasible region; Function (biology); Regular polygon; Topology (electrical circuits); Mathematics; Telecommunications; Wireless","score_opus":0.03500126031078698,"score_gpt":0.28913664713980863,"score_spread":0.25413538682902165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774224529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051180227,0.000629313,0.97778237,0.0019489535,0.000079057245,0.00032326183,0.000001244911,0.000036362864,0.014081408],"genre_scores_gemma":[0.9569976,0.00044312704,0.041847363,0.00040398436,0.000025317519,0.000019005427,0.000015488871,0.0000073996553,0.00024073146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857354,0.00042526325,0.00032254943,0.00024444997,0.00023571821,0.00019850237],"domain_scores_gemma":[0.9985182,0.00039820356,0.00022998666,0.00065370137,0.00015021532,0.0000496543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011336573,0.00012441736,0.00017106213,0.00004896325,0.00053412374,0.00022347155,0.0014178056,0.00005404499,0.000073280615],"category_scores_gemma":[0.000085125124,0.000090577385,0.00006196021,0.0002987898,0.00008668499,0.00043065965,0.00016097265,0.00021239779,0.0000027586964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016886952,0.00051502784,0.0062319897,0.00002644544,0.00011091693,0.000025029947,0.009231998,0.24890715,0.008159793,0.06179019,0.0056045116,0.6592281],"study_design_scores_gemma":[0.0015599325,0.000107221436,0.008261887,0.00035961857,0.000017693637,0.000009778625,0.00018192147,0.98520213,0.0013514482,0.00022591915,0.0024293603,0.0002930801],"about_ca_topic_score_codex":0.000014607826,"about_ca_topic_score_gemma":0.000041929226,"teacher_disagreement_score":0.95187956,"about_ca_system_score_codex":0.000021856884,"about_ca_system_score_gemma":0.00005170894,"threshold_uncertainty_score":0.4108102},"labels":[],"label_agreement":null},{"id":"W2774323520","doi":"10.1109/tit.2017.2779851","title":"Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure code; Computer science; Rank (graph theory); Multiplicative function; Channel (broadcasting); Binary erasure channel; Erasure; Communication source; Matrix (chemical analysis); Algorithm; Discrete mathematics; Mathematics; Channel capacity; Decoding methods; Combinatorics; Computer network","score_opus":0.024671034538534992,"score_gpt":0.2913047066467689,"score_spread":0.2666336721082339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774323520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018245644,0.000022537606,0.9947025,0.0009295061,0.00030729896,0.00050742785,0.000029984607,0.00017383808,0.0015023496],"genre_scores_gemma":[0.98665047,0.00012799246,0.012217775,0.00023848678,0.000027779412,0.00026547496,0.000007388511,0.000008161571,0.0004564964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991508,0.00007500956,0.00026254734,0.00015304855,0.00016062833,0.00019792745],"domain_scores_gemma":[0.9979389,0.00035292734,0.00026127248,0.0010937105,0.00028016604,0.000073058945],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004990864,0.00015638852,0.00015070594,0.00015106851,0.0017959003,0.0005594327,0.0010558042,0.00005587275,0.00002111659],"category_scores_gemma":[0.000027258673,0.00013158354,0.000074874144,0.00011950126,0.00014111804,0.0028905536,0.000008640995,0.00016536762,0.0000641308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003028398,0.00013508092,0.000013622885,0.000050270595,0.0001186724,5.862586e-7,0.007239124,0.03085656,0.00020491744,0.24626541,0.0001636914,0.7146492],"study_design_scores_gemma":[0.0077820825,0.0008074922,0.0007697873,0.00050070434,0.00008483238,0.00004603024,0.0014081358,0.87252545,0.06547996,0.0097245285,0.0394526,0.0014183791],"about_ca_topic_score_codex":0.000003510744,"about_ca_topic_score_gemma":0.000012063657,"teacher_disagreement_score":0.9848259,"about_ca_system_score_codex":0.000054411088,"about_ca_system_score_gemma":0.00005348958,"threshold_uncertainty_score":0.9995036},"labels":[],"label_agreement":null},{"id":"W2775721062","doi":"10.1109/twc.2017.2777446","title":"A Novel Self-Interference Cancellation Scheme for Channel-Unaware Differential Space-Time Two-Way Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Pairwise error probability; Upper and lower bounds; Single antenna interference cancellation; Topology (electrical circuits); Interference (communication); Channel state information; Relay channel; Computer science; Mathematics; Signal-to-noise ratio (imaging); Diversity gain; Channel (broadcasting); Fading; Telecommunications; Wireless; Physics; Power (physics); Mathematical analysis","score_opus":0.050734690012145964,"score_gpt":0.3003594327313262,"score_spread":0.24962474271918023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775721062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027488,0.00017507606,0.98870116,0.005481455,0.00064184115,0.00079258694,0.00004290313,0.0004608885,0.00095527386],"genre_scores_gemma":[0.9476752,0.001702939,0.048886277,0.00013906365,0.00008064722,0.0005668184,0.00002821453,0.000040073548,0.00088070997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811447,0.0001814707,0.00048336713,0.00055144634,0.00022655271,0.00044271076],"domain_scores_gemma":[0.99218297,0.00049944315,0.00041095456,0.0062685288,0.0004601407,0.00017797432],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003462505,0.0003429443,0.0003713243,0.00019163874,0.0044001057,0.00070135767,0.005277918,0.0001572224,0.00003768844],"category_scores_gemma":[0.000016370524,0.00036479274,0.0002793698,0.00030867846,0.00023649521,0.0008109492,0.0001295122,0.0006699783,0.00004697872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035355944,0.0065279314,0.00014932945,0.00013606146,0.0015544114,0.0000032008732,0.008958987,0.17892791,0.07195873,0.19258496,0.0028878679,0.53595704],"study_design_scores_gemma":[0.0012356729,0.000092140384,0.00023572784,0.00016167208,0.0000456526,0.000006498323,0.000020037864,0.99348307,0.0021858718,0.00010112384,0.0020169818,0.00041553535],"about_ca_topic_score_codex":0.00006796976,"about_ca_topic_score_gemma":0.00072449894,"teacher_disagreement_score":0.94492644,"about_ca_system_score_codex":0.00020709376,"about_ca_system_score_gemma":0.00012994873,"threshold_uncertainty_score":0.99988043},"labels":[],"label_agreement":null},{"id":"W2777541168","doi":"10.1109/tcomm.2017.2785765","title":"Cheat-Proof Distributed Power Control in Full-Duplex Small Cell Networks: A Repeated Game With Imperfect Public Monitoring","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Repeated game; Nash equilibrium; Distributed algorithm; Mathematical optimization; Stackelberg competition; Game theory; Power control; Non-cooperative game; Duplex (building); Private information retrieval; Power (physics); Mathematical economics; Distributed computing; Mathematics; Computer security","score_opus":0.04956796327051696,"score_gpt":0.2771206207554552,"score_spread":0.22755265748493822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777541168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023435108,0.00060275785,0.96761096,0.006253264,0.00024201834,0.0006219262,0.000021878714,0.00026012526,0.00095194177],"genre_scores_gemma":[0.9919522,0.0016200445,0.005814306,0.0001081494,0.000020629197,0.00028540322,0.000013344068,0.00002956414,0.000156383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788,0.0005140497,0.0004385103,0.0004704501,0.00021118645,0.00048585102],"domain_scores_gemma":[0.9913984,0.0004878947,0.00028387908,0.0072788554,0.0003588016,0.00019215672],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005517423,0.0003028319,0.00033482537,0.00023797629,0.0019328871,0.0007948761,0.004978254,0.00013316843,0.000024584258],"category_scores_gemma":[0.000033758668,0.00028726793,0.00012593046,0.0007011896,0.0002676379,0.00080812105,0.00007588164,0.0009805014,0.000021902959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072758656,0.011383096,0.012100323,0.00007980644,0.00094972795,0.00006511152,0.009269131,0.60857993,0.017624347,0.0106541095,0.0006279579,0.32793888],"study_design_scores_gemma":[0.0033240088,0.0003209077,0.010443329,0.00024630202,0.000042074094,0.000023514813,0.00015151061,0.9798163,0.0021993874,0.000029884337,0.002759404,0.00064336247],"about_ca_topic_score_codex":0.0000689848,"about_ca_topic_score_gemma":0.0011147656,"teacher_disagreement_score":0.96851707,"about_ca_system_score_codex":0.00022657202,"about_ca_system_score_gemma":0.00016226823,"threshold_uncertainty_score":0.9999579},"labels":[],"label_agreement":null},{"id":"W2779012937","doi":"10.1007/s11036-017-0982-y","title":"Outage Performance for IDF Relaying Mobile Cooperative Networks","year":2017,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"State Key Laboratory of Millimeter Waves; National Natural Science Foundation of China","keywords":"Computer science; Key (lock); Wireless; Transmitter power output; Outage probability; Wireless network; Selection (genetic algorithm); Monte Carlo method; Computer network; Power (physics); Telecommunications; Channel (broadcasting); Statistics; Fading; Artificial intelligence; Transmitter; Mathematics","score_opus":0.025190368264920417,"score_gpt":0.2928945403711026,"score_spread":0.26770417210618214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779012937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046498836,0.0028973883,0.9879277,0.00023614771,0.00015804337,0.0018536466,0.0000045971947,0.00014716733,0.0021254683],"genre_scores_gemma":[0.98138446,0.007126739,0.0022704527,0.00032121871,0.00039814063,0.007697936,0.000026066748,0.00002068165,0.0007542903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869585,0.000045922032,0.00029706108,0.0005043301,0.00009523498,0.00036157307],"domain_scores_gemma":[0.9976411,0.00021302102,0.00022319685,0.0015795366,0.00020575376,0.0001374238],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00039288503,0.00020589781,0.00023540757,0.00004041236,0.0033997996,0.0007558115,0.0013393535,0.00010587817,0.000011886201],"category_scores_gemma":[0.000014597832,0.00019366333,0.00006835358,0.00017440204,0.00017771752,0.0005836894,0.00065328577,0.00026418254,0.00000852548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008089591,0.000078921206,0.0010312892,0.0000126703735,0.000027482667,3.6541837e-7,0.00010845196,0.40597108,0.000044904427,0.059853997,0.0015738135,0.5312889],"study_design_scores_gemma":[0.00034128252,0.00009611333,0.0015622431,0.00003140705,0.000009880677,0.0000037296695,0.00002927487,0.82572657,0.000031363743,0.00008500738,0.17185213,0.00023099936],"about_ca_topic_score_codex":0.0000025553734,"about_ca_topic_score_gemma":0.00001580435,"teacher_disagreement_score":0.9856572,"about_ca_system_score_codex":0.000032362535,"about_ca_system_score_gemma":0.000031824602,"threshold_uncertainty_score":0.9978976},"labels":[],"label_agreement":null},{"id":"W2782419828","doi":"10.48550/arxiv.1801.00394","title":"Generalized Compression Strategy for the Downlink Cloud Radio Access Network","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Telecommunications link; Computer network; Radio access network; Relay; Broadcasting (networking); Transmission (telecommunications); Base station; Telecommunications; Power (physics); Mobile station","score_opus":0.22260906284704013,"score_gpt":0.27270516821315727,"score_spread":0.05009610536611714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782419828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00981421,0.00124146,0.9837475,0.0006635842,0.0016599955,0.00085813896,0.000010943425,0.0002496848,0.0017544731],"genre_scores_gemma":[0.9899239,0.0040059085,0.002915738,0.0005181989,0.0010833727,0.0000099663575,0.000052431074,0.000022326176,0.0014681793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793386,0.000430219,0.0002598505,0.00086876255,0.00009002018,0.0004172951],"domain_scores_gemma":[0.99633545,0.0005230068,0.00033394323,0.0023483264,0.00032855553,0.00013074692],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00058822264,0.0003241748,0.0003438392,0.00008294384,0.0009421803,0.0005460473,0.006281603,0.0002349874,0.000066366956],"category_scores_gemma":[0.000026306207,0.00026945604,0.00025394515,0.00059865194,0.00018875445,0.0003600877,0.005525786,0.0005628954,0.000022999755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056710618,0.000041175572,0.00022255101,0.000022499877,0.00012143624,0.000007770956,0.00010378869,0.6660041,0.000008955098,0.28491402,0.04311777,0.005379199],"study_design_scores_gemma":[0.0006188392,0.00004079512,0.0004889425,0.000105545456,0.000056183617,0.000001593436,0.000010173347,0.92873955,0.00004358112,0.025094071,0.04444272,0.0003580199],"about_ca_topic_score_codex":0.000024354054,"about_ca_topic_score_gemma":0.00007767168,"teacher_disagreement_score":0.9808318,"about_ca_system_score_codex":0.00012555414,"about_ca_system_score_gemma":0.00020963264,"threshold_uncertainty_score":0.99997574},"labels":[],"label_agreement":null},{"id":"W2782711800","doi":"10.1109/isit.2018.8437619","title":"A Multi-Hop Framework for Multi-Source Multi-Relay All-Cast Channels","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Decoding methods; Computer science; Encoding (memory); Node (physics); Hop (telecommunications); Relay channel; Flow (mathematics); Source model; Topology (electrical circuits); Computer network; Algorithm; Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence; Physics; Geometry; Acoustics","score_opus":0.16413509719863567,"score_gpt":0.37245400661250605,"score_spread":0.20831890941387038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782711800","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012175528,0.0003456374,0.9942757,0.0020626625,0.0008372606,0.00059681194,0.0000023390658,0.0004669217,0.0001951078],"genre_scores_gemma":[0.20092034,0.00012158669,0.79010314,0.0032799777,0.00025116108,0.00010661011,0.0000042686697,0.000026002941,0.005186907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981865,0.00014956693,0.00035742763,0.000601591,0.00017730446,0.0005275756],"domain_scores_gemma":[0.99753505,0.00036531858,0.00012657157,0.0013253727,0.00044237048,0.00020532485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051320955,0.0002632522,0.00025186932,0.000121236044,0.00055505,0.0003141944,0.0018450798,0.00016075655,0.00012261857],"category_scores_gemma":[0.0003722578,0.00023086273,0.00013694342,0.0004893083,0.00014431332,0.00037866755,0.00090028363,0.00028049905,0.00038515514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098021505,0.0035337103,0.0014443173,0.00008123601,0.00058658567,0.000011841174,0.057463065,0.0020408046,0.017590614,0.27303433,0.029330367,0.61478513],"study_design_scores_gemma":[0.0012363689,0.00011463875,0.00037690523,0.00005897869,0.0000069749517,0.0000049071937,0.000084307525,0.9077031,0.0019770714,0.000074803625,0.088032275,0.0003296711],"about_ca_topic_score_codex":0.000014133866,"about_ca_topic_score_gemma":0.00015523299,"teacher_disagreement_score":0.9056623,"about_ca_system_score_codex":0.00005682177,"about_ca_system_score_gemma":0.000048365164,"threshold_uncertainty_score":0.94143087},"labels":[],"label_agreement":null},{"id":"W2783471352","doi":"10.1109/glocom.2017.8254933","title":"Performance Analysis for Multi-Pair Massive MIMO AF Relay Networks with ZF Processing","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Nanjing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Relay; Ergodic theory; MIMO; Topology (electrical circuits); Computer science; Transmission (telecommunications); Relay channel; Telecommunications link; Outage probability; Scaling law; Scaling; Power (physics); Mathematics; Computer network; Telecommunications; Physics; Beamforming; Combinatorics; Mathematical analysis","score_opus":0.06709462009306288,"score_gpt":0.31182431175311853,"score_spread":0.24472969166005565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783471352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010530003,0.00021586972,0.985055,0.0013926723,0.00005701505,0.00021760126,3.6138172e-7,0.000121814075,0.0024096083],"genre_scores_gemma":[0.7743664,0.00012288472,0.22322524,0.00019529343,0.00003751337,0.00005248862,0.0000031588293,0.000006982806,0.0019900738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905837,0.000038250277,0.00017668463,0.00034232083,0.00012265216,0.000261753],"domain_scores_gemma":[0.9980704,0.000057595404,0.00022289535,0.0012764847,0.00029479762,0.00007779811],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00031419986,0.00014025245,0.00020255319,0.00009254506,0.0015472843,0.00061684503,0.0015468999,0.000047196816,0.000013535034],"category_scores_gemma":[0.000034482997,0.000102478196,0.00007889073,0.0003804925,0.0000853609,0.0008793152,0.0003761266,0.00013455951,0.000005054875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006773534,0.00018097872,0.21233042,0.000043378917,0.00051011896,0.000004996346,0.0017306764,0.16676675,0.00007514309,0.008392368,0.001282932,0.6086145],"study_design_scores_gemma":[0.00041988963,0.000054179713,0.049586624,0.00003739935,0.000043662894,0.0000010708029,0.000019536965,0.94776857,0.00012712872,0.0000031330678,0.0017646385,0.00017419166],"about_ca_topic_score_codex":0.000004741565,"about_ca_topic_score_gemma":0.00021830994,"teacher_disagreement_score":0.7810018,"about_ca_system_score_codex":0.00003176276,"about_ca_system_score_gemma":0.000056689136,"threshold_uncertainty_score":0.9997526},"labels":[],"label_agreement":null},{"id":"W2783624805","doi":"10.1109/iccw.2018.8403670","title":"Throughput Maximization in Cloud Radio Access Networks Using Network Coding","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Cloud computing; Linear network coding; Computer network; Synchronizing; Scheduling (production processes); Clique problem; Radio access network; Distributed computing; Graph; Mathematical optimization; Theoretical computer science; Transmission (telecommunications); Mathematics","score_opus":0.1101443073012781,"score_gpt":0.3464081818508043,"score_spread":0.2362638745495262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783624805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020075757,0.0019012298,0.98514944,0.00055044953,0.00382478,0.0005725633,7.202989e-7,0.00034293387,0.0056503243],"genre_scores_gemma":[0.84570146,0.0076064053,0.14208876,0.0014129474,0.0027999724,0.000055229866,0.00005511615,0.000058412454,0.00022172839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677384,0.0005949557,0.0007529598,0.0009504766,0.00029590732,0.00063184224],"domain_scores_gemma":[0.99694747,0.000211281,0.00041550572,0.0020253765,0.00028575145,0.000114640745],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011964345,0.0004267506,0.000544248,0.00021309944,0.0004057996,0.001354359,0.004159021,0.00039523872,0.00011926769],"category_scores_gemma":[0.000061499726,0.0004375753,0.00012956011,0.0013307877,0.00010057665,0.00078623014,0.009654326,0.0009977458,0.000012698802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073236624,0.000037866055,0.0031891428,0.000021607659,0.000031028463,0.000006201714,0.00032581238,0.94736475,0.0000045275315,0.031763066,0.0061516045,0.011097058],"study_design_scores_gemma":[0.0002552163,0.000012978105,0.0012227533,0.0004944912,0.000010061208,0.000006945033,0.0000054557095,0.99132437,0.000025149942,0.0043807896,0.0017660469,0.0004957389],"about_ca_topic_score_codex":0.00006600116,"about_ca_topic_score_gemma":0.0002991443,"teacher_disagreement_score":0.84369385,"about_ca_system_score_codex":0.00036935302,"about_ca_system_score_gemma":0.00024416277,"threshold_uncertainty_score":0.9998076},"labels":[],"label_agreement":null},{"id":"W2783939382","doi":"10.1109/uemcon.2017.8249104","title":"Outage probability and system optimization of SSD-based dual-hop relaying system with multiple relays","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hop (telecommunications); Rayleigh fading; Outage probability; Computer science; Dual (grammatical number); Relay; Wireless; Fading; Diversity gain; Radio repeater; Electronic engineering; Channel (broadcasting); Topology (electrical circuits); Computer network; Power (physics); Telecommunications; Electrical engineering; Engineering; Physics; Cognitive radio","score_opus":0.03891660212001762,"score_gpt":0.249578474650302,"score_spread":0.21066187253028437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783939382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03083121,0.000072197785,0.9620831,0.00031969527,0.000077366945,0.0005098547,0.0000013612251,0.00021436528,0.00589087],"genre_scores_gemma":[0.8556134,0.0000096891235,0.14424907,0.00001598213,0.000009102032,0.00003228556,0.0000015848728,0.000006522786,0.00006233569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989608,0.00016589166,0.00027161554,0.00030051218,0.00016714317,0.00013402308],"domain_scores_gemma":[0.99773026,0.00015041909,0.00029317295,0.0015133852,0.00024827255,0.00006448247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064179953,0.000116301686,0.00020273525,0.000049570925,0.00062502443,0.00024444915,0.00058507966,0.00004747523,0.000002224281],"category_scores_gemma":[0.00010209783,0.0000885926,0.000026857282,0.00011155052,0.00009510263,0.000460642,0.00035684585,0.00009359601,0.0000020674736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116459836,0.00018720656,0.09664516,0.0014317213,0.00007861371,0.000015850803,0.0022039337,0.3667129,0.0011339838,0.5194022,0.00009830567,0.011973681],"study_design_scores_gemma":[0.0006114508,0.00005680643,0.0032478091,0.00034917454,0.000006122119,0.000006920857,0.0001339205,0.99483716,0.0005865258,0.000003026399,0.000043065556,0.000118006574],"about_ca_topic_score_codex":0.000035046945,"about_ca_topic_score_gemma":0.00007444057,"teacher_disagreement_score":0.8247822,"about_ca_system_score_codex":0.000078190504,"about_ca_system_score_gemma":0.000058373567,"threshold_uncertainty_score":0.48072457},"labels":[],"label_agreement":null},{"id":"W2785440403","doi":"10.1109/pimrc.2017.8292415","title":"An integrated design of STBC and signal alignment in MIMO Y channels","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"MIMO; Space–time block code; Computer science; Block code; Fading; Rayleigh fading; Electronic engineering; Bit error rate; Channel (broadcasting); Algorithm; Computer network; Decoding methods; Engineering","score_opus":0.08187551666977992,"score_gpt":0.31376140798803864,"score_spread":0.2318858913182587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785440403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022404518,0.00010840832,0.97585016,0.00058670784,0.000043189528,0.00011655411,2.2077478e-7,0.000021182586,0.0008690574],"genre_scores_gemma":[0.96661776,0.0001807384,0.03299139,0.00008892012,0.0000066043076,0.0000061065343,4.474575e-7,0.0000019426975,0.000106070955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994554,0.00012718188,0.000121850346,0.00013843497,0.00006913482,0.00008801505],"domain_scores_gemma":[0.9992056,0.00004731867,0.000059473077,0.0005950064,0.000050778868,0.000041810286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039089596,0.000057124187,0.0000920311,0.000047758953,0.00011894507,0.00015114507,0.00080837,0.000020486495,0.000030104857],"category_scores_gemma":[0.00001536558,0.00004629334,0.000008354338,0.00006201015,0.000049524897,0.00035388448,0.00022967983,0.000051780007,0.0000019746003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030288998,0.00034154035,0.005844402,0.00000912498,0.000023318738,0.000008951571,0.005776025,0.0034444265,0.043910056,0.14095774,0.0007710896,0.798883],"study_design_scores_gemma":[0.00037193554,0.0001535298,0.0049522095,0.00004199908,8.6894033e-7,0.0000015260723,0.00007547896,0.9762815,0.016789455,0.0007951078,0.00042563333,0.0001107147],"about_ca_topic_score_codex":0.000033676482,"about_ca_topic_score_gemma":0.00004455401,"teacher_disagreement_score":0.9728371,"about_ca_system_score_codex":0.000012356222,"about_ca_system_score_gemma":0.00002588721,"threshold_uncertainty_score":0.18877876},"labels":[],"label_agreement":null},{"id":"W2785580603","doi":"10.1109/vtcfall.2017.8287996","title":"Diversity Analysis of MIMO Network Coded Cooperation Systems with Relay Selection","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Selection (genetic algorithm); Computer science; Diversity gain; Outage probability; Encoding (memory); Throughput; Antenna (radio); Communications system; Topology (electrical circuits); Decoding methods; Computer network; Telecommunications; Wireless; Engineering; Power (physics); Beamforming; Fading; Electrical engineering; Artificial intelligence","score_opus":0.040593535128963264,"score_gpt":0.2681346069675303,"score_spread":0.227541071838567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785580603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10004351,0.00007641752,0.8944933,0.00024165849,0.00010067588,0.000085727195,3.9770435e-7,0.000056072462,0.004902229],"genre_scores_gemma":[0.994169,0.000091187525,0.0050682304,0.000042679298,0.000022032164,0.0000035968208,0.0000032357884,0.0000019077675,0.0005981506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939036,0.00009733593,0.00012467479,0.00015830129,0.00013385479,0.00009544412],"domain_scores_gemma":[0.99876267,0.0000456214,0.00017591291,0.00070841896,0.00027380273,0.00003356437],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00032250286,0.000058828275,0.00014289148,0.000071310606,0.0019667277,0.00017609933,0.0007150356,0.00002948073,0.000020560234],"category_scores_gemma":[0.000021024925,0.000048371352,0.000037547474,0.0005522703,0.000040641353,0.0004234057,0.00074059935,0.000061397026,0.0000028156355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028118837,0.00005568612,0.17037283,0.000006936114,0.0007812673,0.000001242305,0.0010752771,0.50428826,0.00026753274,0.31758103,0.0019643889,0.0035774207],"study_design_scores_gemma":[0.0001444125,0.00004545191,0.053396344,0.000013345941,0.00008645415,8.3749325e-7,0.000009131414,0.94568664,0.0001600503,0.000005477952,0.00037985155,0.000071988965],"about_ca_topic_score_codex":0.00016557079,"about_ca_topic_score_gemma":0.0016633094,"teacher_disagreement_score":0.89412546,"about_ca_system_score_codex":0.000021842015,"about_ca_system_score_gemma":0.00002552958,"threshold_uncertainty_score":0.99933255},"labels":[],"label_agreement":null},{"id":"W2786148814","doi":"10.1109/vtcfall.2017.8287999","title":"Network Coded Cooperation Based on Relay Selection with Imperfect CSI","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Imperfect; Relay; Computer science; Telecommunications link; Channel state information; Selection (genetic algorithm); Multiplexing; Encoding (memory); Diversity gain; Channel (broadcasting); Computer network; Topology (electrical circuits); Telecommunications; Fading; Wireless; Mathematics; Power (physics); Physics; Artificial intelligence","score_opus":0.030476951678680947,"score_gpt":0.27384639381931036,"score_spread":0.24336944214062942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786148814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077175363,0.000028602486,0.9563829,0.004324588,0.00018904981,0.0002364927,1.8996877e-7,0.00025050767,0.030870186],"genre_scores_gemma":[0.9691766,0.000033656073,0.027803782,0.0016627795,0.00011508961,0.000026650734,0.0000037143561,0.00000868461,0.0011690825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990792,0.0001475994,0.0001282534,0.00028574202,0.0001611921,0.00019798527],"domain_scores_gemma":[0.99841624,0.00009960745,0.00010493138,0.0011286123,0.00018918468,0.000061406616],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003926409,0.00012460373,0.00011444836,0.00004126024,0.001536781,0.0006757732,0.0008210115,0.000044650395,0.000061676095],"category_scores_gemma":[0.00005883702,0.00009278021,0.000025728816,0.00020310219,0.00004227406,0.00050497,0.00012745314,0.00017232125,0.000053279582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020377133,0.00023970778,0.013977193,0.000008971159,0.000044286553,0.000007964082,0.00032390692,0.4256068,0.0026299036,0.40693146,0.035085376,0.11494066],"study_design_scores_gemma":[0.0005356881,0.00031378362,0.006815524,0.000040232884,0.0000034389939,0.0000033818271,0.0000012359038,0.98474586,0.0013887977,0.000040449675,0.005947151,0.00016443776],"about_ca_topic_score_codex":0.000010332805,"about_ca_topic_score_gemma":0.00030249497,"teacher_disagreement_score":0.96145904,"about_ca_system_score_codex":0.00005188178,"about_ca_system_score_gemma":0.000086747445,"threshold_uncertainty_score":0.9997631},"labels":[],"label_agreement":null},{"id":"W2786484950","doi":"10.1109/pimrc.2017.8292577","title":"Outage probability analysis of a two-hop Rayleigh-Lognormal relay network","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rayleigh fading; Relay; Hop (telecommunications); Log-normal distribution; Computer science; Wireless network; Outage probability; Wireless; Computer network; Fading; Upper and lower bounds; Telecommunications; Mathematics; Statistics; Physics; Channel (broadcasting)","score_opus":0.05973665573381892,"score_gpt":0.3192057710412303,"score_spread":0.2594691153074114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786484950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1100045,0.00023036182,0.83899546,0.0016313888,0.00024311223,0.00023576166,0.0000016683365,0.00014267764,0.048515078],"genre_scores_gemma":[0.94709504,0.00008187387,0.051900186,0.00018461634,0.000039061513,0.000010473491,0.0000026692435,0.0000032996672,0.000682788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874574,0.00018645544,0.00032899086,0.00031534,0.00018782628,0.00023566457],"domain_scores_gemma":[0.9964454,0.00015391846,0.00026480312,0.0028609147,0.00019551151,0.0000794237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009895726,0.00011396782,0.00030958487,0.00009437024,0.0006017373,0.0002370862,0.0023956115,0.000039462837,0.00014899574],"category_scores_gemma":[0.0001417228,0.00009322945,0.00017756513,0.00064182136,0.00014037218,0.00051047665,0.0013129575,0.00013966179,0.000010678402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001490862,0.0001799766,0.18648086,0.000007730807,0.00064962305,0.0000037904824,0.0010124765,0.048458103,0.0003533854,0.6771677,0.0014393608,0.084232084],"study_design_scores_gemma":[0.00037233697,0.000041547934,0.12880874,0.000014385881,0.000114053895,6.763587e-7,0.000006323946,0.86528003,0.00029082358,0.002005832,0.002855209,0.00021004041],"about_ca_topic_score_codex":0.00003998604,"about_ca_topic_score_gemma":0.000922921,"teacher_disagreement_score":0.83709055,"about_ca_system_score_codex":0.00002587642,"about_ca_system_score_gemma":0.000046190224,"threshold_uncertainty_score":0.46281376},"labels":[],"label_agreement":null},{"id":"W2786651367","doi":"10.1109/vtcfall.2017.8288235","title":"Cross-Layer Routing for Multicasting Multiple Description Coded Media in Wireless Mesh Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multicast; Computer science; Computer network; Routing (electronic design automation); Heuristic; Bandwidth (computing); Distributed computing; Wireless; Wireless mesh network; Wireless network; Telecommunications; Artificial intelligence","score_opus":0.12230535578119736,"score_gpt":0.34194622790702517,"score_spread":0.2196408721258278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786651367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15433452,0.000031524065,0.8436501,0.000373141,0.00042147533,0.0002759438,7.022977e-7,0.00011252945,0.0008000863],"genre_scores_gemma":[0.9587533,0.000064788306,0.040633544,0.00014363341,0.000118537886,0.00005643078,0.000004541684,0.0000115691755,0.0002136643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987289,0.00008430477,0.00034208436,0.00035383046,0.00012489405,0.00036599863],"domain_scores_gemma":[0.99786574,0.00066443085,0.00018946792,0.0009907582,0.000210728,0.00007885056],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009357989,0.00014015766,0.0001885558,0.000059781974,0.0009999907,0.0010597182,0.001456919,0.000080234066,0.000012388925],"category_scores_gemma":[0.0009414271,0.00013270482,0.000058708076,0.00011726,0.00007540255,0.0010093567,0.0007183354,0.00019582333,0.000006099532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054848577,0.00016148105,0.22029637,0.000018098584,0.000024595207,0.0000069216485,0.0044474113,0.003327243,0.008133129,0.23430446,0.0003138496,0.5289116],"study_design_scores_gemma":[0.0010210992,0.000011036827,0.049218893,0.000061040766,0.0000016696771,0.000001381298,0.000036759757,0.9484235,0.0008280893,0.000099448946,0.0001299289,0.00016717633],"about_ca_topic_score_codex":0.000040251496,"about_ca_topic_score_gemma":0.0019519111,"teacher_disagreement_score":0.94509625,"about_ca_system_score_codex":0.000063272564,"about_ca_system_score_gemma":0.000029557139,"threshold_uncertainty_score":0.9999773},"labels":[],"label_agreement":null},{"id":"W2789299613","doi":"10.1080/02564602.2017.1346488","title":"Joint TAS and Power Allocation for Multiuser M2M Cooperative Networks","year":2018,"lang":"en","type":"article","venue":"IETE Technical Review","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; China Postdoctoral Science Foundation; Postdoctoral Innovation Project of Shandong Province; National Natural Science Foundation of China","keywords":"Nakagami distribution; Computer science; Fading; Joint (building); Transmitter power output; Selection (genetic algorithm); Monte Carlo method; Outage probability; Power (physics); Multiuser detection; Antenna (radio); Telecommunications; Computer network; Mathematical optimization; Statistics; Mathematics; Code division multiple access; Channel (broadcasting); Physics; Engineering; Transmitter; Artificial intelligence","score_opus":0.05932971735309451,"score_gpt":0.3353466693311436,"score_spread":0.2760169519780491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789299613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058564452,0.06529551,0.92437595,0.007589498,0.00012420132,0.0010282643,0.0000011549627,0.0002033963,0.0013234377],"genre_scores_gemma":[0.66879565,0.22222303,0.09198533,0.016054321,0.00016120894,0.00047133575,0.000013118558,0.000025456917,0.0002705382],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883586,0.0001390701,0.0003552399,0.0003508118,0.00011267564,0.00020636809],"domain_scores_gemma":[0.9984515,0.0001884188,0.00010362301,0.00075487286,0.00040346078,0.000098140015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008356549,0.00014590248,0.00028229423,0.00002909885,0.00022946853,0.000084284366,0.00056400645,0.00006684419,0.000042400705],"category_scores_gemma":[0.00043819178,0.00011555154,0.000072830204,0.0003870642,0.0001395684,0.00022612326,0.00041004203,0.00016528457,0.000030721407],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010500392,0.00010701557,0.000017400062,0.00020474971,0.000034283625,0.0000011317892,0.00012584758,0.00001676231,0.002410534,0.23044544,0.08580373,0.6808226],"study_design_scores_gemma":[0.00052349526,0.0005362365,0.0009688971,0.0027798156,0.000036363228,0.00002273361,0.0000030169176,0.09197117,0.0005751477,0.00061719696,0.90147775,0.00048815078],"about_ca_topic_score_codex":7.8705233e-7,"about_ca_topic_score_gemma":0.000014875369,"teacher_disagreement_score":0.83239067,"about_ca_system_score_codex":0.00003430385,"about_ca_system_score_gemma":0.000035791527,"threshold_uncertainty_score":0.4712055},"labels":[],"label_agreement":null},{"id":"W2789497997","doi":"10.1109/lcomm.2018.2808182","title":"Exact Solutions for Certain Weighted Sum-Rate and Common-Rate Maximization Problems","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Algorithm; Combinatorics; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.07643602099072798,"score_gpt":0.2970351139120086,"score_spread":0.2205990929212806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789497997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015230763,0.00080494717,0.8985771,0.083224736,0.0002725971,0.00082585023,0.000014712406,0.00032715264,0.00072215596],"genre_scores_gemma":[0.9201513,0.002006424,0.07174819,0.0053577116,0.00009100115,0.0003439519,0.000087175016,0.000026797472,0.0001874772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998043,0.0007085841,0.0004015675,0.00034769048,0.00009942994,0.00039972586],"domain_scores_gemma":[0.9956613,0.0007236207,0.00019366057,0.0029734913,0.0003408348,0.00010710205],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010702295,0.00019831058,0.0002038689,0.00019392616,0.0019624447,0.00033738706,0.0023559048,0.0000670251,0.000010434235],"category_scores_gemma":[0.000071472656,0.00020468817,0.00006379362,0.0007037387,0.00039175732,0.0006323946,0.00085295003,0.00022612234,0.000035707188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052081698,0.00069344486,0.0018739306,0.000092464645,0.00032424147,0.000001605017,0.01027398,0.0014142203,0.21324678,0.5406621,0.08399178,0.14737335],"study_design_scores_gemma":[0.0008714925,0.00010890819,0.0033858155,0.00010259947,0.000030421685,0.000009088132,0.000039533625,0.87201536,0.0012635692,0.003356118,0.118321985,0.00049510866],"about_ca_topic_score_codex":0.000037654594,"about_ca_topic_score_gemma":0.000675654,"teacher_disagreement_score":0.9049205,"about_ca_system_score_codex":0.00010891851,"about_ca_system_score_gemma":0.00005478846,"threshold_uncertainty_score":0.99933684},"labels":[],"label_agreement":null},{"id":"W2790565987","doi":"10.4236/jis.2018.91007","title":"Security Analysis of Subspace Network Coding","year":2018,"lang":"en","type":"article","venue":"Journal of Information Security","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Science Foundation of Liaoning Province; National Natural Science Foundation of China","keywords":"Subspace topology; Computer science; Theoretical computer science; Coding (social sciences); Code (set theory); Probabilistic logic; Independence (probability theory); Security analysis; Flexibility (engineering); Network security; Linear network coding; Algorithm; Computer security; Mathematics; Artificial intelligence; Statistics; Programming language","score_opus":0.018692711004719868,"score_gpt":0.2823425043055562,"score_spread":0.2636497933008363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790565987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15559246,0.00038193568,0.83105,0.0014111506,0.00064903504,0.0001085137,0.000004426589,0.000040050392,0.010762438],"genre_scores_gemma":[0.9938985,0.00042517143,0.005152657,0.00038834082,0.00012603006,5.403219e-7,0.0000028913666,0.000001569547,0.0000042708334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845695,0.00015210395,0.0008128014,0.000056262346,0.00037123894,0.00015065454],"domain_scores_gemma":[0.99673384,0.00014667808,0.0011347104,0.0004013601,0.0014947798,0.00008863834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016648455,0.000088665096,0.00030874214,0.00043469382,0.00016601915,0.00012938735,0.00084231107,0.000051450508,0.00007368953],"category_scores_gemma":[0.00017997518,0.00007723912,0.00018618384,0.002288316,0.00007094192,0.0024360218,0.00022709058,0.00022064899,0.000010538306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000151051,0.00022157894,0.016575973,0.00007304523,0.0019931803,0.0000038394815,0.090416014,0.007877525,0.00024545775,0.80004257,0.04145484,0.040944938],"study_design_scores_gemma":[0.0009730953,0.00038065083,0.033522587,0.00015199075,0.00029074802,0.00003796112,0.00061069307,0.87989783,0.0021613466,0.006225209,0.07539575,0.00035211476],"about_ca_topic_score_codex":0.0000035588603,"about_ca_topic_score_gemma":0.00004068478,"teacher_disagreement_score":0.8720203,"about_ca_system_score_codex":0.000053648506,"about_ca_system_score_gemma":0.0000902185,"threshold_uncertainty_score":0.314972},"labels":[],"label_agreement":null},{"id":"W2790880079","doi":"10.4236/ijids.2018.31001","title":"A Network Coding Based Cloud Storage Scheme","year":2018,"lang":"en","type":"article","venue":"International Journal of Internet and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Natural Science Foundation of China","keywords":"Computer science; Decoding methods; Cloud storage; Row; Cloud computing; Linear network coding; Computer data storage; Erasure code; Separable space; Bandwidth (computing); Computer network; Algorithm; Computer hardware; Network packet; Mathematics; Operating system","score_opus":0.03296345628508695,"score_gpt":0.283799110583566,"score_spread":0.25083565429847904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790880079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02191019,0.0011305634,0.9707071,0.0012126823,0.0041315462,0.00006471184,0.000009742634,0.000033102882,0.000800357],"genre_scores_gemma":[0.9953392,0.00008167657,0.0025776904,0.00036158628,0.0015082824,0.000002487568,0.000010737321,0.000005781452,0.00011253549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986478,0.00015462664,0.00052416296,0.00014583388,0.00036643434,0.00016111067],"domain_scores_gemma":[0.99789804,0.00014964817,0.0004344906,0.00021039654,0.0011940764,0.00011335291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070898625,0.00011947059,0.00020037657,0.000113598006,0.00007557265,0.00048556871,0.0012405325,0.000050051298,0.00003314064],"category_scores_gemma":[0.00013369153,0.00010069926,0.00007021659,0.00019034008,0.00007684127,0.00035899974,0.00027589497,0.00018725629,0.000013579152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005112833,0.00037569876,0.025540834,0.000051179602,0.00096437434,0.00037180178,0.00232665,0.0048551518,0.0033911804,0.62598413,0.31637073,0.019256976],"study_design_scores_gemma":[0.0015561983,0.0003526378,0.002332708,0.0008672105,0.000011935624,0.0004515677,0.00011151817,0.84107953,0.00036642983,0.00047595796,0.15210904,0.00028526605],"about_ca_topic_score_codex":0.000009254172,"about_ca_topic_score_gemma":0.000007318129,"teacher_disagreement_score":0.973429,"about_ca_system_score_codex":0.00010727247,"about_ca_system_score_gemma":0.00007808649,"threshold_uncertainty_score":0.46823502},"labels":[],"label_agreement":null},{"id":"W2791285730","doi":"10.1109/lcomm.2018.2797877","title":"A Power-Efficient and Social-Aware Relay Selection Method for Multi-Hop D2D Communications","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Relay; Computer science; Hop (telecommunications); Exploit; Computer network; Upload; Selection (genetic algorithm); Power consumption; Transmission (telecommunications); Power (physics); Telecommunications; Computer security; Artificial intelligence","score_opus":0.1046367194452691,"score_gpt":0.3780376339120289,"score_spread":0.2734009144667598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791285730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024757045,0.0005323349,0.9311536,0.06429308,0.00018079473,0.00062500895,0.0000121394105,0.00030976214,0.0004176082],"genre_scores_gemma":[0.48646417,0.00034266585,0.5087097,0.0040302635,0.000042922642,0.00028005947,0.000021859478,0.00002147886,0.000086838176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977265,0.000886623,0.00045336236,0.0004177866,0.00016950858,0.000346244],"domain_scores_gemma":[0.9943531,0.00079002575,0.00024349151,0.0039288765,0.0005955544,0.00008894345],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010686001,0.00022564012,0.00024714644,0.000247659,0.0030048923,0.0002852533,0.004389046,0.00009965364,0.000009193599],"category_scores_gemma":[0.000059713064,0.00024550772,0.000113232265,0.00084150565,0.00059615937,0.00031352893,0.0016032549,0.0004047985,0.000034851684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006092908,0.0020035522,0.0007597791,0.00007613199,0.00051904266,9.0544427e-7,0.056948703,0.00061551086,0.17335322,0.3693897,0.06915349,0.327119],"study_design_scores_gemma":[0.0006032112,0.000058564834,0.0005640479,0.00003083246,0.000020892718,0.000012285795,0.00016984304,0.8873305,0.0008051487,0.0000621909,0.1100361,0.00030641648],"about_ca_topic_score_codex":0.00002026959,"about_ca_topic_score_gemma":0.00022680589,"teacher_disagreement_score":0.88671494,"about_ca_system_score_codex":0.00015976263,"about_ca_system_score_gemma":0.00007827817,"threshold_uncertainty_score":0.9999997},"labels":[],"label_agreement":null},{"id":"W2791622688","doi":"10.1109/comst.2018.2796101","title":"Joint Inter-Flow Network Coding and Opportunistic Routing in Multi-Hop Wireless Mesh Networks: A Comprehensive Survey","year":2018,"lang":"en","type":"preprint","venue":"IEEE Communications Surveys & Tutorials","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless mesh network; Computer science; Computer network; Routing protocol; Coding (social sciences); Joint (building); Linear network coding; Wireless; Wireless network; Distributed computing; Routing (electronic design automation); Telecommunications; Engineering; Sociology","score_opus":0.22269083826535002,"score_gpt":0.3564703544750021,"score_spread":0.13377951620965206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791622688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009214678,0.002155692,0.9773728,0.00077067903,0.007811503,0.001738659,0.00013509604,0.00047899233,0.00032186485],"genre_scores_gemma":[0.9380245,0.022587221,0.03702949,0.00029504308,0.0007600754,0.00034506572,0.0007374573,0.0000953764,0.00012575471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97237176,0.02226112,0.002405909,0.0014649428,0.0004618212,0.0010344719],"domain_scores_gemma":[0.98083717,0.0067564105,0.0014878967,0.008723557,0.0018350317,0.00035995716],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.01843917,0.0009205434,0.0017928772,0.0004361544,0.0012515985,0.0012867873,0.007445816,0.0006563528,0.000020748595],"category_scores_gemma":[0.0013767534,0.0010328781,0.000236385,0.0014455495,0.00090326904,0.00050342263,0.014990167,0.00232806,0.000027100252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003041666,0.0050474997,0.160427,0.0010692825,0.003621819,0.00016156386,0.03651553,0.04734204,0.0025439,0.1686638,0.061238438,0.513065],"study_design_scores_gemma":[0.00092177757,0.0000556686,0.055730734,0.0015997735,0.00004066071,0.000011675173,0.000070867485,0.93861246,0.000016435424,0.0004502831,0.0013517189,0.0011379286],"about_ca_topic_score_codex":0.0012459926,"about_ca_topic_score_gemma":0.0110831885,"teacher_disagreement_score":0.9403433,"about_ca_system_score_codex":0.00050887547,"about_ca_system_score_gemma":0.0006680512,"threshold_uncertainty_score":0.9999736},"labels":[],"label_agreement":null},{"id":"W2791756387","doi":"10.1007/s11265-018-1338-y","title":"Performance Analysis of Mobile Multiuser Cooperative Networks with TAS Schemes","year":2018,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.02341813941893293,"score_gpt":0.2754403589934775,"score_spread":0.25202221957454457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791756387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28369072,0.00400518,0.7116991,0.00003090819,0.000100270896,0.000106051346,4.9435073e-7,0.000018956442,0.00034831566],"genre_scores_gemma":[0.99499804,0.00020205358,0.0044770692,0.000035986803,0.00018500183,0.0000064145183,7.585146e-7,0.000008207409,0.000086483145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984567,0.00016032241,0.00065832207,0.00015981334,0.00038728432,0.00017753209],"domain_scores_gemma":[0.99634403,0.000095802345,0.00095105346,0.0002748945,0.0022506888,0.000083517225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008564109,0.00014133305,0.00048227198,0.0003381671,0.00025976947,0.00021237011,0.000798473,0.000049690327,0.000013751536],"category_scores_gemma":[0.000014153225,0.00009484582,0.00008143267,0.0020361647,0.0001614701,0.00086287974,0.000096806514,0.00022369056,0.0000015614598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002787989,0.0003714637,0.024908489,0.00018659544,0.0022115854,0.000016838036,0.00837567,0.7879535,0.008412597,0.0010160807,0.00054652744,0.1657219],"study_design_scores_gemma":[0.00033989115,0.0005550239,0.0013416349,0.0006223887,0.00013709355,0.000032656615,0.00020863947,0.993779,0.0016050664,5.511916e-7,0.0012480807,0.00012996756],"about_ca_topic_score_codex":0.0000022890754,"about_ca_topic_score_gemma":0.000004757346,"teacher_disagreement_score":0.7113073,"about_ca_system_score_codex":0.00004866094,"about_ca_system_score_gemma":0.00020153813,"threshold_uncertainty_score":0.38677},"labels":[],"label_agreement":null},{"id":"W2792717300","doi":"10.1109/twc.2018.2808952","title":"Multipair Two-Way Half-Duplex DF Relaying With Massive Arrays and Imperfect CSI","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Science and Technology Major Project; National Natural Science Foundation of China; State Key Laboratory of Integrated Services Networks; Queen's University; Queen's University Belfast","keywords":"Relay; Computer science; Transmitter power output; Imperfect; Channel (broadcasting); Mathematical optimization; Relay channel; Topology (electrical circuits); Power (physics); Sequence (biology); Spectral efficiency; Telecommunications; Mathematics; Combinatorics; Physics","score_opus":0.03775816080485428,"score_gpt":0.2860916937740101,"score_spread":0.24833353296915583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792717300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029744815,0.00031266114,0.96093464,0.0055247317,0.00017805997,0.0004232682,0.0000080638565,0.0004541738,0.002419576],"genre_scores_gemma":[0.93969655,0.0019909304,0.057292424,0.00047238983,0.000035216864,0.00020595056,0.0000055445425,0.000032426018,0.00026858711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804634,0.0004913651,0.00036750955,0.00048638898,0.00024812203,0.00036026305],"domain_scores_gemma":[0.99482226,0.0006962848,0.00015779457,0.0037410469,0.00039503028,0.00018756316],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00036015015,0.00029380413,0.0002742166,0.00025877202,0.0023712723,0.00027303016,0.0021886516,0.00008867412,0.00003900466],"category_scores_gemma":[0.0000113142605,0.00026943724,0.000086045584,0.0009769662,0.0006841926,0.0006824134,0.00007065799,0.0005991535,0.00006941337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014309523,0.0014876325,0.0003913507,0.00004028645,0.00048386693,0.000009182965,0.017400632,0.011251502,0.032241836,0.09751398,0.00068073446,0.8383559],"study_design_scores_gemma":[0.0020871516,0.0005773839,0.00065677223,0.00033380726,0.00007110067,0.00007126264,0.00047559463,0.9668951,0.018825531,0.00019310614,0.008954424,0.0008587754],"about_ca_topic_score_codex":0.00006840192,"about_ca_topic_score_gemma":0.0018131498,"teacher_disagreement_score":0.9556436,"about_ca_system_score_codex":0.00011416468,"about_ca_system_score_gemma":0.000109283894,"threshold_uncertainty_score":0.9999758},"labels":[],"label_agreement":null},{"id":"W2792820945","doi":"10.1109/camsap.2017.8313134","title":"Network beamforming for asynchronous MIMO two-way relay networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Relay; Transceiver; Asynchronous communication; MIMO; Computer science; Transmitter power output; Antenna (radio); Computer network; Electronic engineering; Channel (broadcasting); Power (physics); Topology (electrical circuits); Telecommunications; Transmitter; Engineering; Wireless; Electrical engineering","score_opus":0.045441986391547534,"score_gpt":0.30479409036516336,"score_spread":0.25935210397361586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792820945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000506028,0.0005662429,0.9681619,0.0024291573,0.00089054415,0.00033978117,3.9441466e-7,0.00021018268,0.026895797],"genre_scores_gemma":[0.73963493,0.00033277643,0.25582594,0.0013747312,0.00071516074,0.000081395,0.000004908246,0.000017933571,0.0020122356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986522,0.000061134095,0.0002785348,0.00038022676,0.000124501,0.0005033584],"domain_scores_gemma":[0.99706686,0.0002510945,0.00021286671,0.0021949655,0.00015224294,0.00012199468],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007517164,0.00017639347,0.00021352271,0.000033800126,0.0023872764,0.0008017057,0.0027151466,0.00006908338,0.000036448087],"category_scores_gemma":[0.00009873637,0.00015732952,0.00010529427,0.00011713706,0.000077987585,0.00078877754,0.0010874815,0.0001976384,0.000030153524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010218092,0.000034366356,0.0008177839,0.0000045931074,0.000030161047,0.0000023272426,0.00018185285,0.037339512,0.000040440835,0.57641,0.016309356,0.3688194],"study_design_scores_gemma":[0.0005931628,0.00006395773,0.0010118169,0.000043834723,0.000006432891,0.000006960158,0.00000525115,0.94190633,0.00006897595,0.0020998197,0.053926397,0.0002670348],"about_ca_topic_score_codex":0.0000140058255,"about_ca_topic_score_gemma":0.00020744452,"teacher_disagreement_score":0.9045668,"about_ca_system_score_codex":0.00005238715,"about_ca_system_score_gemma":0.000048277696,"threshold_uncertainty_score":0.9989115},"labels":[],"label_agreement":null},{"id":"W2793054715","doi":"10.1109/tvt.2018.2816822","title":"Network Coding Aided Collaborative Real-Time Scalable Video Transmission in D2D Communications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scalability; Linear network coding; Network packet; Scalable Video Coding; Scheduling (production processes); Coding (social sciences); Computer network; Decoding methods; Schedule; Real-time computing; Video quality; Distributed computing; Algorithm; Engineering","score_opus":0.0204935809473763,"score_gpt":0.27338189489933384,"score_spread":0.25288831395195754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793054715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005925722,0.0005101628,0.97820336,0.010333307,0.00019287338,0.0005053634,0.0000036484823,0.00076375564,0.0035618187],"genre_scores_gemma":[0.92820615,0.0032401779,0.06768445,0.00036650957,0.00002843658,0.00017631328,0.0000037895622,0.00002337469,0.00027082054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979429,0.00040542116,0.00047029206,0.0005125764,0.00019883124,0.00046996685],"domain_scores_gemma":[0.99702823,0.0002526909,0.00011961409,0.002164666,0.00034367703,0.000091120106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051965675,0.00024430398,0.0003405493,0.00058188604,0.0009311364,0.000089693356,0.0020483276,0.00030779114,0.00008567618],"category_scores_gemma":[0.000010609849,0.0002527813,0.00007461589,0.0042402465,0.00048104397,0.00036471046,0.000040210376,0.0006674885,0.00022120145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001218428,0.0010996261,0.00012429329,0.000021830996,0.00016981603,0.000031048672,0.002596222,0.01104355,0.11865464,0.06845554,0.002605406,0.7950762],"study_design_scores_gemma":[0.0017434305,0.0006530719,0.00015556876,0.00049991446,0.000037555343,0.000039495102,0.00015658772,0.8748671,0.08581073,0.0065608183,0.028729646,0.00074608537],"about_ca_topic_score_codex":0.000015897527,"about_ca_topic_score_gemma":0.0002134358,"teacher_disagreement_score":0.92228043,"about_ca_system_score_codex":0.0001795287,"about_ca_system_score_gemma":0.00014607415,"threshold_uncertainty_score":0.99999243},"labels":[],"label_agreement":null},{"id":"W2794039646","doi":"10.1109/wdd.2006.8321413","title":"A new class of distributed space-time trellis codes","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Trellis (graph); Computer science; Set (abstract data type); Decoding methods; Node (physics); Class (philosophy); Algorithm; Rank (graph theory); Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence; Engineering; Programming language","score_opus":0.018720277566496513,"score_gpt":0.24635785122095372,"score_spread":0.2276375736544572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794039646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022887897,0.00031129917,0.9585795,0.0033507624,0.000034249882,0.000062357874,0.000002824454,0.00012518466,0.03524505],"genre_scores_gemma":[0.9174474,0.000106157975,0.06926787,0.000117406766,0.000045632067,0.0000023614327,0.000019664982,0.000004647926,0.012988845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994333,0.00005374734,0.00016096597,0.00013116957,0.00010565742,0.000115169474],"domain_scores_gemma":[0.99924326,0.000095487885,0.000054403958,0.0004874601,0.00007567816,0.000043715438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095226074,0.00006939192,0.00012013447,0.0000393195,0.00005686055,0.000054786447,0.0005833972,0.000025652484,0.00019124366],"category_scores_gemma":[0.000012671218,0.00005898885,0.000042479824,0.00042863912,0.00002364832,0.0001414193,0.00020260488,0.000051545372,0.00006418763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039103634,0.00006761414,0.00059205154,0.000002750019,0.00001128677,0.0000011582434,0.00010560721,0.00045161214,0.010603847,0.778617,0.17155953,0.03798362],"study_design_scores_gemma":[0.0010621882,0.0001171523,0.013077531,0.000052367897,0.000011511225,0.000007322763,0.000016099788,0.5625224,0.052540895,0.008302706,0.36184216,0.00044765844],"about_ca_topic_score_codex":0.00008386683,"about_ca_topic_score_gemma":0.000103844555,"teacher_disagreement_score":0.9151586,"about_ca_system_score_codex":0.00001863961,"about_ca_system_score_gemma":0.000048820548,"threshold_uncertainty_score":0.24054956},"labels":[],"label_agreement":null},{"id":"W2794384390","doi":"10.1109/tgcn.2018.2809729","title":"Energy Efficiency, Spectral Efficiency and Delay Analysis for Selective ARQ Multichannel Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Green Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Retransmission; Spectral efficiency; Computer science; Efficient energy use; Bandwidth (computing); Hybrid automatic repeat request; Automatic repeat request; Channel (broadcasting); Real-time computing; Electronic engineering; Computer network; Network packet; Engineering; Telecommunications link","score_opus":0.04317586754851963,"score_gpt":0.28055661587187425,"score_spread":0.23738074832335462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794384390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016629937,0.00363205,0.992688,0.000677192,0.00026806153,0.00030530535,0.000008663731,0.00013830804,0.0006194081],"genre_scores_gemma":[0.98516953,0.005041549,0.0091069285,0.00022046996,0.00010919629,0.00015444656,0.000005255363,0.000015730338,0.00017688042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835515,0.00029198604,0.00037377616,0.00046740667,0.00015261462,0.00035907034],"domain_scores_gemma":[0.9972308,0.0007596534,0.00014521336,0.0014371657,0.00029391595,0.0001332311],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00051985483,0.00022363692,0.00030131746,0.00040132724,0.0021507468,0.00026597097,0.0010781701,0.00009067255,0.0000024909634],"category_scores_gemma":[0.00000153591,0.00021981959,0.00011849633,0.0018010653,0.00032784572,0.00023855934,0.00005121427,0.0002392607,0.000001983744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000683451,0.00061337126,0.00033931134,0.000022553575,0.000958357,0.0000012252033,0.00552758,0.0060027447,0.000553029,0.01914342,0.00016620843,0.9666039],"study_design_scores_gemma":[0.00036192217,0.0002622022,0.00007918131,0.00004607137,0.0001422555,0.000012007828,0.000062941064,0.9932397,0.00022162026,0.00016791909,0.005150036,0.0002541356],"about_ca_topic_score_codex":0.0002329006,"about_ca_topic_score_gemma":0.0016863481,"teacher_disagreement_score":0.987237,"about_ca_system_score_codex":0.00006570411,"about_ca_system_score_gemma":0.00004587002,"threshold_uncertainty_score":0.9991483},"labels":[],"label_agreement":null},{"id":"W2794477591","doi":"10.1371/journal.pone.0193350","title":"Exact and heuristic algorithms for Space Information Flow","year":2018,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Delaunay triangulation; Algorithm; Computer science; Heuristic; Multicast; Linear programming; Multi-commodity flow problem; Consistent heuristic; Mathematics; Mathematical optimization; Topology (electrical circuits); Flow network; Search algorithm; Beam search; Combinatorics; Incremental heuristic search; Distributed computing","score_opus":0.07484449065572621,"score_gpt":0.2692955351138611,"score_spread":0.1944510444581349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794477591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101695135,0.00017100804,0.98506147,0.0022942675,0.000057338177,0.00023832222,0.0000026397688,0.00009926572,0.0019062001],"genre_scores_gemma":[0.5924209,0.00039836604,0.40596887,0.0006880601,0.00016034726,0.000042242737,0.000009267361,0.0000046680275,0.0003072858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996106,0.00002284426,0.00009464353,0.00008219507,0.000092676084,0.00009702941],"domain_scores_gemma":[0.9993741,0.00008654737,0.00003692129,0.0002747234,0.00018669918,0.000041005882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014743597,0.00005026808,0.00007165063,0.00004063335,0.0001686966,0.00012512601,0.00023294377,0.000018807497,0.000011571772],"category_scores_gemma":[0.00010722363,0.000048076156,0.000010017812,0.00012520743,0.000032396285,0.00050372444,0.00014531073,0.00004229874,0.0000448166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022653003,0.00042157166,0.00036366336,0.00011492751,0.00011800526,4.3328492e-7,0.0068657775,0.000013230697,0.0028971161,0.074034765,0.0061843987,0.90896344],"study_design_scores_gemma":[0.0002882666,0.00013656716,0.00085228914,0.000054430744,0.0000081857725,6.8160455e-7,0.0000101538535,0.9815388,0.003959892,0.0007040147,0.012346138,0.00010057963],"about_ca_topic_score_codex":8.300882e-7,"about_ca_topic_score_gemma":0.000004312457,"teacher_disagreement_score":0.9815256,"about_ca_system_score_codex":0.000013229352,"about_ca_system_score_gemma":0.000015956433,"threshold_uncertainty_score":0.19604889},"labels":[],"label_agreement":null},{"id":"W2794986565","doi":"10.1109/twc.2018.2817481","title":"Cooperative Device-to-Device Communication for Uplink Transmission in Cellular System","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Telecommunications link; User equipment; Computer science; Computer network; Cellular network; Relay; Stochastic geometry; Fading; Transmission (telecommunications); Power control; Base station; Telecommunications; Power (physics); Channel (broadcasting)","score_opus":0.05562242519636704,"score_gpt":0.3106943663615812,"score_spread":0.25507194116521414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794986565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004457266,0.00054853497,0.98375195,0.007191374,0.00021016892,0.0014848376,0.000014792406,0.00039770553,0.0019433884],"genre_scores_gemma":[0.89273286,0.0010259259,0.10415688,0.00070711324,0.000025652009,0.0010476232,0.00002475901,0.000038246435,0.00024092948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972186,0.0008046649,0.0007606583,0.0005479471,0.00024550795,0.0004226068],"domain_scores_gemma":[0.9930386,0.0009934381,0.00016425045,0.004785936,0.0007968051,0.00022098284],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008817901,0.00032495937,0.00038855113,0.0004945363,0.0019319974,0.00023122983,0.004538654,0.0001665051,0.000022170638],"category_scores_gemma":[0.0000150462,0.00034280348,0.0001469512,0.0019503947,0.00024107799,0.000582612,0.00006731301,0.00058694306,0.0001807913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001926899,0.0018864548,0.000034250337,0.00013120045,0.00016996334,0.000001758962,0.018301949,0.008064464,0.041847143,0.18852931,0.00081112114,0.7400297],"study_design_scores_gemma":[0.0013919276,0.0003496169,0.00011298567,0.00080182235,0.000039003553,0.0000063629063,0.00049026025,0.92270046,0.044834804,0.00016039336,0.028470678,0.0006416695],"about_ca_topic_score_codex":0.000054665805,"about_ca_topic_score_gemma":0.0010421867,"teacher_disagreement_score":0.914636,"about_ca_system_score_codex":0.00036453703,"about_ca_system_score_gemma":0.00019196956,"threshold_uncertainty_score":0.9999024},"labels":[],"label_agreement":null},{"id":"W2798320009","doi":"10.1109/icrito.2017.8342392","title":"Cost-, spectrum-, and energy-efficient distributed collaborative beamforming designs for real-world applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Beamforming; Computer science; Throughput; Range (aeronautics); Distributed computing; Power (physics); Dual (grammatical number); Efficient energy use; Wireless; Electronic engineering; Computer engineering; Telecommunications; Electrical engineering; Engineering","score_opus":0.07876747827771957,"score_gpt":0.3392624388348588,"score_spread":0.2604949605571392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798320009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018358369,0.00012435885,0.9836121,0.0032898255,0.000059289523,0.00047236145,0.000023319863,0.00011110024,0.012124012],"genre_scores_gemma":[0.89319927,0.000875493,0.10188542,0.00028141166,0.00008578038,0.00093696953,0.000042257052,0.000012089677,0.002681329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913853,0.000041994586,0.00018694662,0.0003123627,0.00009894362,0.00022124415],"domain_scores_gemma":[0.99824256,0.00022761307,0.00015431624,0.0010623873,0.0002035146,0.00010961581],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00026140927,0.00012329679,0.0001469725,0.00007037219,0.0017745424,0.00057657977,0.0009752311,0.00002830833,0.000009134371],"category_scores_gemma":[0.00004425303,0.00011087784,0.00003172757,0.0002763608,0.000107224405,0.0002679355,0.0004882054,0.000062492036,0.0000034752513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048156858,0.00004060584,0.00014591262,0.0000028900315,0.000012569938,2.6451787e-7,0.00018493675,0.00028076398,0.00025300492,0.9285584,0.0009832531,0.06953257],"study_design_scores_gemma":[0.0007643011,0.00007052521,0.0030640196,0.000028993712,0.000013467499,0.000002639067,0.0000955204,0.63490933,0.006045948,0.0048775277,0.34974772,0.00038000685],"about_ca_topic_score_codex":0.000029129833,"about_ca_topic_score_gemma":0.0009707866,"teacher_disagreement_score":0.9236809,"about_ca_system_score_codex":0.000071443865,"about_ca_system_score_gemma":0.00008788326,"threshold_uncertainty_score":0.999525},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.026441189963418432,"score_gpt":0.28621969294979666,"score_spread":0.2597785029863782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799292918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013084361,0.00020599461,0.9837743,0.00011759197,0.00090174907,0.0010242362,0.0000024866342,0.00032743148,0.0005618293],"genre_scores_gemma":[0.957207,0.00007884223,0.04188072,0.00027245612,0.0002170731,0.00014539913,0.0000025233076,0.000027011694,0.00016895111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812746,0.00018159825,0.00038591592,0.0006105826,0.00020082308,0.0004936116],"domain_scores_gemma":[0.99793816,0.00049360096,0.0001395759,0.000729951,0.00057535805,0.00012333428],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005650203,0.00027992306,0.0002587357,0.0001341844,0.0014758562,0.00025285376,0.00072139077,0.00006745871,0.000021986625],"category_scores_gemma":[0.000009103613,0.00024254096,0.00010258735,0.00076119043,0.00013906245,0.00015233958,0.000022835848,0.00030511836,0.000045962934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036839,0.00020973975,0.000013755075,0.000006643451,0.000047379646,9.871502e-7,0.0022302193,0.6373525,0.00026499463,0.0014726572,0.000044836626,0.3583194],"study_design_scores_gemma":[0.00085685204,0.00072230544,0.000061131475,0.00017067566,0.000015491854,0.0000058350684,0.000121710815,0.98703605,0.007971344,0.000005204639,0.002721931,0.00031149227],"about_ca_topic_score_codex":0.0000022899094,"about_ca_topic_score_gemma":0.00006148602,"teacher_disagreement_score":0.9441227,"about_ca_system_score_codex":0.00014414501,"about_ca_system_score_gemma":0.00007857921,"threshold_uncertainty_score":0.9998241},"labels":[],"label_agreement":null},{"id":"W2801400867","doi":"10.1109/tit.2019.2912165","title":"Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natur og Univers, Det Frie Forskningsråd","keywords":"Linear network coding; Decoding methods; Network packet; Channel code; Information-theoretic security; Secrecy; Coding (social sciences); Code (set theory); Shannon–Fano coding; Computational complexity theory","score_opus":0.01899466051068887,"score_gpt":0.2509348176087943,"score_spread":0.23194015709810545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801400867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012078004,0.000088348235,0.98426646,0.0001133226,0.00060798874,0.0003013439,0.0000041757708,0.00018384412,0.0023565167],"genre_scores_gemma":[0.9774112,0.00043915396,0.021077786,0.00077386835,0.000025897954,0.000015925396,0.0000049360483,0.000007860247,0.00024338765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989971,0.0001288413,0.00033746945,0.00015248556,0.00016741216,0.0002167083],"domain_scores_gemma":[0.99893737,0.00022818815,0.00013687879,0.00049156015,0.00013526817,0.000070757946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007153822,0.00013904492,0.00016765586,0.00014512887,0.00048243883,0.00025795033,0.00034698486,0.00008930029,0.000088811226],"category_scores_gemma":[0.000008324831,0.00014173305,0.00005287379,0.00042204908,0.000046185927,0.0019473525,0.000012536581,0.00030389847,0.00011324826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023922331,0.00009556221,0.00013357091,0.0000932657,0.00011358744,0.0000010360242,0.0094703315,0.62061036,0.0022483913,0.15807344,0.0004293017,0.2084919],"study_design_scores_gemma":[0.0007726055,0.00007133773,0.00007460493,0.00013735077,0.000011732103,0.000015670423,0.00019727129,0.9915155,0.0027568212,0.0011631321,0.0030457976,0.00023816431],"about_ca_topic_score_codex":0.000006356841,"about_ca_topic_score_gemma":0.0000069856446,"teacher_disagreement_score":0.96533316,"about_ca_system_score_codex":0.00006000588,"about_ca_system_score_gemma":0.000045060413,"threshold_uncertainty_score":0.57797056},"labels":[],"label_agreement":null},{"id":"W2802230519","doi":"10.1109/twc.2018.2822274","title":"Asynchronous Two-Way MIMO Relaying: A Multi-Relay Scenario","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Beamforming; Asynchronous communication; MIMO; Transceiver; Computer science; Relay channel; Transmitter power output; Topology (electrical circuits); Antenna (radio); Channel (broadcasting); Power (physics); Electronic engineering; Computer network; Telecommunications; Wireless; Transmitter; Electrical engineering; Engineering; Physics","score_opus":0.06136215886342536,"score_gpt":0.3126282213491001,"score_spread":0.25126606248567473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802230519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004271554,0.00043689014,0.9847611,0.0045783077,0.00059697405,0.00041613157,0.000010322139,0.0006776764,0.004251035],"genre_scores_gemma":[0.8809499,0.0017522584,0.115564145,0.0008238746,0.00004977728,0.00019843916,0.000006601513,0.00003625116,0.0006187292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975107,0.000620399,0.00056475564,0.0005412992,0.00030016855,0.00046268303],"domain_scores_gemma":[0.99255985,0.0005071091,0.00018514706,0.006038147,0.00048667775,0.00022306343],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048769682,0.00032457322,0.00030008657,0.0003403,0.0026529212,0.0002902037,0.0047551794,0.00013444526,0.00011067186],"category_scores_gemma":[0.000016646509,0.0003394037,0.00019065522,0.0013429461,0.0006128643,0.0006444484,0.0000966184,0.00089889107,0.00082443794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045485966,0.0033911262,0.00012980854,0.000017750821,0.0003111258,0.0000059555496,0.010653423,0.0066160075,0.0129939765,0.120820776,0.0012838003,0.84373075],"study_design_scores_gemma":[0.0019610913,0.00031136628,0.00045916013,0.00021646032,0.00005210435,0.000047370322,0.0001545664,0.959479,0.013072342,0.00020248802,0.02319096,0.0008531087],"about_ca_topic_score_codex":0.0000740438,"about_ca_topic_score_gemma":0.0020480037,"teacher_disagreement_score":0.952863,"about_ca_system_score_codex":0.00024470018,"about_ca_system_score_gemma":0.00022428269,"threshold_uncertainty_score":0.9999535},"labels":[],"label_agreement":null},{"id":"W2804214385","doi":"10.1109/wd.2018.8361721","title":"Increasing data rates in relay-assisted wireless multicast networks with single antenna receivers","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Multicast; Computer network; Computer science; Source-specific multicast; Base station; Relay; Multiplexing; Wireless network; Wireless; Telecommunications","score_opus":0.08474970249983164,"score_gpt":0.30283299737135977,"score_spread":0.2180832948715281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804214385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18269528,0.0002499932,0.8080431,0.0015050067,0.00018506436,0.00022347351,0.0000011965127,0.00024258783,0.006854295],"genre_scores_gemma":[0.9269287,0.0001826132,0.07224736,0.00042006024,0.000056545938,0.0000034664017,0.000015644539,0.000010303586,0.00013531906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985305,0.00032626197,0.00023420736,0.00047274187,0.00014194047,0.00029435262],"domain_scores_gemma":[0.99767774,0.0003038181,0.00008273586,0.001663349,0.00018691829,0.0000854609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065418123,0.00014366659,0.00017155525,0.000104031446,0.00024561674,0.00024759225,0.0018255753,0.000051692856,0.000034852936],"category_scores_gemma":[0.00008588507,0.00011509353,0.00001346337,0.0010338292,0.00017927172,0.0008221587,0.001153565,0.00019853972,0.000021629237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004569899,0.0010442565,0.07901357,0.000017379129,0.00012563361,0.00010369597,0.00355587,0.00075068336,0.02053734,0.018212926,0.003972749,0.8722089],"study_design_scores_gemma":[0.0005651887,0.00010396915,0.01575211,0.0001489775,0.0000036165964,0.000034321634,0.00010291646,0.9813007,0.0001902083,0.0000069569373,0.0015852816,0.00020575509],"about_ca_topic_score_codex":0.00009876975,"about_ca_topic_score_gemma":0.0025832544,"teacher_disagreement_score":0.98055,"about_ca_system_score_codex":0.00006411724,"about_ca_system_score_gemma":0.000052461994,"threshold_uncertainty_score":0.4693378},"labels":[],"label_agreement":null},{"id":"W2804478849","doi":"","title":"Optimum HDAF Relay-Assisted Combining Scheme with Relay Decision Information","year":2017,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Maximal-ratio combining; Computer science; Scheme (mathematics); Network packet; Monte Carlo method; Signal-to-noise ratio (imaging); Relay channel; Algorithm; Mathematics; Computer network; Statistics; Telecommunications; Fading; Decoding methods","score_opus":0.02367356491563114,"score_gpt":0.2716207792503646,"score_spread":0.24794721433473346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804478849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29486197,0.0006279277,0.6595655,0.02313647,0.0011326725,0.00058875355,0.000010539968,0.0011683203,0.01890782],"genre_scores_gemma":[0.7010506,0.00025547008,0.29842812,0.00011704818,0.000012125981,0.000021546128,0.000008334903,0.000010174345,0.000096640746],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983585,0.000031846834,0.0004919851,0.00036155968,0.00040030698,0.00035581092],"domain_scores_gemma":[0.99554855,0.00005417383,0.0007570556,0.0031361873,0.00041183748,0.000092215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041798185,0.0002587606,0.00034360323,0.00058307656,0.0011595561,0.00035889389,0.0033691186,0.00032856822,0.000012275822],"category_scores_gemma":[0.0006352819,0.00023404602,0.00007996052,0.0007253821,0.0006065962,0.00327481,0.0015666207,0.00059295964,0.000058366793],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097753655,0.00020171427,0.010319841,0.00004427702,0.0002137076,0.000043315667,0.0010623701,0.0010900191,0.002266094,0.42600676,0.004540676,0.55411345],"study_design_scores_gemma":[0.008778845,0.0012474133,0.03333287,0.0025080002,0.00010203354,0.00029228823,0.00042681542,0.16070858,0.018124776,0.0029580952,0.7694492,0.0020711108],"about_ca_topic_score_codex":0.000009824366,"about_ca_topic_score_gemma":0.0000694655,"teacher_disagreement_score":0.7649085,"about_ca_system_score_codex":0.000090100555,"about_ca_system_score_gemma":0.00017233661,"threshold_uncertainty_score":0.954412},"labels":[],"label_agreement":null},{"id":"W2806594972","doi":"10.1109/lcomm.2018.2843347","title":"Performance Analysis and Code Optimization of IDMA With 5G New Radio LDPC Code","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Low-density parity-check code; Computer science; Spectral efficiency; Code rate; Code (set theory); Enhanced Data Rates for GSM Evolution; Algorithm; Program optimization; Base station; Theoretical computer science; Decoding methods; Computer network; Telecommunications; Channel (broadcasting)","score_opus":0.038808881529345474,"score_gpt":0.2751331165543144,"score_spread":0.2363242350249689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806594972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0761473,0.00034700023,0.9108128,0.011352747,0.0000454873,0.00015299897,0.0000042569327,0.00009255228,0.0010448482],"genre_scores_gemma":[0.781702,0.001723642,0.21564807,0.0007970965,0.000024722644,0.000012078016,0.0000129251375,0.000008148528,0.00007133781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894154,0.00020208432,0.00029738378,0.00023378355,0.0001641735,0.0001610417],"domain_scores_gemma":[0.9964161,0.00017134767,0.00020338125,0.0028986917,0.00022529304,0.000085208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028133023,0.00013131204,0.00021511482,0.00028246845,0.0004339758,0.00010006839,0.0020936145,0.00003453224,0.0000166141],"category_scores_gemma":[0.000019350347,0.0001221274,0.000044973225,0.00175595,0.00042316504,0.00047253317,0.00031992837,0.00015344619,0.00000668617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018509693,0.0007739741,0.18161008,0.0000943976,0.0033065185,0.0000033480771,0.030293904,0.38680893,0.068058014,0.030103507,0.026674027,0.2720882],"study_design_scores_gemma":[0.00042630578,0.00008929353,0.01163047,0.000049892493,0.00011469274,0.0000069830626,0.000022047687,0.97841,0.0035872206,0.0000087918115,0.0054353653,0.00021894743],"about_ca_topic_score_codex":0.00002332352,"about_ca_topic_score_gemma":0.00043744603,"teacher_disagreement_score":0.70555466,"about_ca_system_score_codex":0.000040309962,"about_ca_system_score_gemma":0.00006395159,"threshold_uncertainty_score":0.49802107},"labels":[],"label_agreement":null},{"id":"W2807732674","doi":"10.1109/lcomm.2018.2846727","title":"Network-Coded Cooperation With Outdated CSI","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.052149056840526946,"score_gpt":0.2846018946823751,"score_spread":0.23245283784184817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807732674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013000499,0.00037629844,0.9280482,0.051100157,0.0003280934,0.00038246549,0.000001949655,0.0005375528,0.006224808],"genre_scores_gemma":[0.871598,0.00030338223,0.11494849,0.012652079,0.00018521641,0.000081040045,0.00003348803,0.000019404086,0.00017890205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838257,0.0004554775,0.0003170864,0.00032213496,0.00019032355,0.00033243498],"domain_scores_gemma":[0.99459916,0.00018941014,0.0001426478,0.004545564,0.00042971707,0.00009350058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042499715,0.00018964561,0.00017565023,0.00010770643,0.0011783075,0.00033048962,0.0037716513,0.000050585222,0.00002948903],"category_scores_gemma":[0.000028463828,0.00017071782,0.00003800844,0.0011935825,0.00043578286,0.0006841895,0.00063562306,0.00030118442,0.0002441871],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009746185,0.0006088572,0.0029931641,0.000015565896,0.0003368407,0.000010411681,0.008550175,0.006832132,0.1102038,0.41803187,0.33983284,0.11248688],"study_design_scores_gemma":[0.0022306351,0.00044060254,0.0041963034,0.00025610082,0.000056901114,0.000073635805,0.00006277258,0.5368799,0.0075404537,0.0006087586,0.44616872,0.0014852254],"about_ca_topic_score_codex":0.0000123548525,"about_ca_topic_score_gemma":0.00034972097,"teacher_disagreement_score":0.8585975,"about_ca_system_score_codex":0.00007681862,"about_ca_system_score_gemma":0.00007476737,"threshold_uncertainty_score":0.90627074},"labels":[],"label_agreement":null},{"id":"W2808151025","doi":"10.1109/wcnc.2018.8377054","title":"Packet duplication for URLLC in 5G dual connectivity architecture","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Network packet; PHY; Computer network; Latency (audio); Dual (grammatical number); Distributed computing; Optimization problem; Physical layer; Software deployment; Architecture; Radio resource management; Wireless; Wireless network; Telecommunications; Algorithm","score_opus":0.042694820946176465,"score_gpt":0.30724211561121884,"score_spread":0.26454729466504234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808151025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046445426,0.000048567596,0.93802905,0.0066748634,0.00010424229,0.00027402153,8.878861e-7,0.00010585916,0.008317104],"genre_scores_gemma":[0.97404474,0.000020036858,0.024642546,0.00083333947,0.00008654597,0.000052290645,0.0000028551963,0.000003683626,0.000313932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993801,0.00007577725,0.00011613368,0.00021904317,0.00006364943,0.00014530412],"domain_scores_gemma":[0.99908364,0.00021574927,0.000033799923,0.00051634794,0.00011513452,0.000035318695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033592933,0.000067300534,0.00008070285,0.0000656384,0.00012874832,0.00006391444,0.00039507757,0.000031989406,0.000031255524],"category_scores_gemma":[0.0000993204,0.00005846823,0.000025141215,0.00032057744,0.000044482837,0.00015457679,0.00013574593,0.0000767105,0.000025878342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014850393,0.00008228943,0.0009037984,0.0000043570426,0.0000060255225,3.0600776e-7,0.0015457631,0.00003394446,0.0050539924,0.48947448,0.0042616553,0.49861854],"study_design_scores_gemma":[0.0023459739,0.00061902497,0.09931299,0.0000637663,0.0000054106863,0.000022375552,0.00008544852,0.5450132,0.0413479,0.05442426,0.25597942,0.0007802391],"about_ca_topic_score_codex":0.000008236831,"about_ca_topic_score_gemma":0.00087645894,"teacher_disagreement_score":0.9275994,"about_ca_system_score_codex":0.000028186409,"about_ca_system_score_gemma":0.000032275788,"threshold_uncertainty_score":0.23842652},"labels":[],"label_agreement":null},{"id":"W2808442353","doi":"10.1109/wcnc.2018.8377394","title":"Outage probability analysis of heterogeneous relay networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Rayleigh fading; Relay; Outage probability; Computer network; Fading; Wireless network; Cellular network; Heterogeneous network; Log-normal distribution; Channel (broadcasting); Wireless; Telecommunications; Statistics; Mathematics","score_opus":0.041418579224530225,"score_gpt":0.2873548333667505,"score_spread":0.24593625414222026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808442353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060870122,0.00011590123,0.9321818,0.00025030036,0.000084405314,0.00008604378,3.9204508e-7,0.00009331913,0.0063177263],"genre_scores_gemma":[0.9782319,0.00006063778,0.021139722,0.0002743068,0.000023877703,0.000004518712,0.0000018760601,0.000002379361,0.0002607756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999155,0.00013715397,0.00023631017,0.0002274964,0.00010883444,0.00013519828],"domain_scores_gemma":[0.99845177,0.000088900415,0.00007552254,0.0011128432,0.00022110033,0.00004988846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037528254,0.00007202312,0.00017752948,0.00010953732,0.00010434197,0.00004264561,0.00081346,0.000034510034,0.00020124714],"category_scores_gemma":[0.00003367695,0.000059189148,0.000107825545,0.0015285627,0.00009962677,0.00011695776,0.00042531884,0.00006385109,0.000012019759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003428447,0.00058470486,0.05290799,0.00001310115,0.00208475,0.0000049813,0.004316062,0.105556846,0.0014192851,0.4863688,0.0022465265,0.3444627],"study_design_scores_gemma":[0.000057973,0.0000552422,0.0064982013,0.0000030115418,0.00003782504,6.828929e-7,0.0000023229566,0.9910678,0.00067230687,0.00016869119,0.0013563349,0.00007955429],"about_ca_topic_score_codex":0.0000067241535,"about_ca_topic_score_gemma":0.0003065556,"teacher_disagreement_score":0.9173618,"about_ca_system_score_codex":0.000020438165,"about_ca_system_score_gemma":0.000017091787,"threshold_uncertainty_score":0.24136634},"labels":[],"label_agreement":null},{"id":"W2809950372","doi":"10.1155/2018/2034870","title":"Multiway Physical‐Layer Network Coding via Uniquely Decodable Codes","year":2018,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Linear network coding; Coding (social sciences); Physical layer; Layer (electronics); Computer network; Theoretical computer science; Telecommunications; Mathematics; Wireless","score_opus":0.03778951710602208,"score_gpt":0.3139673787195667,"score_spread":0.27617786161354463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809950372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18717757,0.0025050724,0.80453503,0.00066356716,0.00020546892,0.00044872198,0.0000017333748,0.00048812458,0.0039747353],"genre_scores_gemma":[0.9213671,0.0021627322,0.07571468,0.00041744058,0.00016209453,0.000058342855,0.000010803068,0.000022323386,0.000084470215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980694,0.00045462762,0.00040525213,0.00044385472,0.00016291124,0.00046396325],"domain_scores_gemma":[0.99577004,0.0007735347,0.00021964933,0.002685493,0.0003972697,0.00015401511],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007214155,0.0002470537,0.00033524676,0.00009400034,0.002263987,0.00035430398,0.0025664577,0.000071697315,0.0000087212375],"category_scores_gemma":[0.000021449983,0.00024565836,0.00007604341,0.00079956546,0.0004443293,0.00039145656,0.003590742,0.00037751638,0.000035204936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000472301,0.00020548108,0.0016003911,0.000015936885,0.000053481945,0.0000010151813,0.0048711635,0.0004918327,0.005412919,0.20468985,0.0004999303,0.78215325],"study_design_scores_gemma":[0.0002807741,0.00010623444,0.00094984507,0.00014006556,0.000010050043,0.0000135070195,0.000087069835,0.9743291,0.0009989229,0.0013726884,0.021391127,0.00032062343],"about_ca_topic_score_codex":0.000027527436,"about_ca_topic_score_gemma":0.00008364769,"teacher_disagreement_score":0.97383726,"about_ca_system_score_codex":0.00005748789,"about_ca_system_score_gemma":0.000059544473,"threshold_uncertainty_score":0.9999996},"labels":[],"label_agreement":null},{"id":"W2870662404","doi":"10.1109/tit.2019.2919295","title":"Capacity of Two-Way Channels With Symmetry Properties","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Channel capacity; Channel (broadcasting); Symmetry (geometry); Coding (social sciences); Ergodic theory; Upper and lower bounds; Computer science; Mathematics; Topology (electrical circuits); Statistical physics; Telecommunications; Combinatorics; Physics; Statistics; Mathematical analysis","score_opus":0.024722353565253572,"score_gpt":0.22488235480685229,"score_spread":0.20016000124159872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2870662404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06296343,0.000018587427,0.9300193,0.00015368569,0.00031433543,0.00024211904,0.0000032021492,0.00010497146,0.0061803474],"genre_scores_gemma":[0.99684983,0.000037648748,0.002431036,0.00034899698,0.0000066499088,0.000028222063,9.671942e-7,0.0000041559915,0.00029246663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992125,0.0001240925,0.0002525853,0.00008954069,0.00019998342,0.00012132011],"domain_scores_gemma":[0.9990132,0.000089123045,0.00011997944,0.0005412462,0.00019664581,0.00003982414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038497767,0.00010491167,0.00012627356,0.00020458177,0.00014076017,0.000074514915,0.00043612169,0.000033938224,0.00009204158],"category_scores_gemma":[0.000003852885,0.00007919575,0.000046541845,0.00040706215,0.00006369208,0.0017732447,0.0000042849533,0.00017343272,0.00020157063],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018671004,0.00019200583,0.00003217814,0.0001237039,0.00011731704,1.9169858e-7,0.01583944,0.09235022,0.003912694,0.5977198,0.00007069355,0.28945506],"study_design_scores_gemma":[0.003604637,0.0010004962,0.00028973632,0.00060733967,0.00003671425,0.000041507865,0.001278398,0.340068,0.64251846,0.0055762115,0.00406461,0.0009138863],"about_ca_topic_score_codex":0.0000036931515,"about_ca_topic_score_gemma":0.000003079156,"teacher_disagreement_score":0.9338864,"about_ca_system_score_codex":0.00003651406,"about_ca_system_score_gemma":0.00004198773,"threshold_uncertainty_score":0.3229509},"labels":[],"label_agreement":null},{"id":"W2883248204","doi":"10.1109/comst.2018.2859900","title":"A Survey of Secure Routing Protocols in Multi-Hop Cellular Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Routing protocol; Link-state routing protocol; Computer security; Network packet; Distributed computing","score_opus":0.17824297902057654,"score_gpt":0.3805583713474058,"score_spread":0.20231539232682924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883248204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009661724,0.0009795675,0.9803158,0.00036547115,0.001215321,0.005998929,0.000023597207,0.00022045033,0.001219111],"genre_scores_gemma":[0.97798485,0.0003496226,0.019875955,0.000069265036,0.00015904247,0.0013902348,0.00004907517,0.000025769103,0.00009616073],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9863307,0.011299424,0.0011932923,0.0004452599,0.0002958842,0.00043545745],"domain_scores_gemma":[0.98972726,0.0024244285,0.0005716863,0.005702173,0.00146625,0.000108177235],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.015819592,0.00026339918,0.00056081725,0.00023296983,0.00048051105,0.0001887645,0.005929525,0.00018281786,0.000023792118],"category_scores_gemma":[0.0014724317,0.00027424935,0.00008939491,0.002378421,0.0004578491,0.0004978591,0.0016326404,0.00048089595,0.000034921533],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016269076,0.0072436673,0.43535858,0.00014960225,0.0005383807,0.000012437446,0.035942446,0.006060481,0.07457563,0.12710254,0.008618076,0.30423546],"study_design_scores_gemma":[0.0024124095,0.000235322,0.2790742,0.0005606734,0.000012623985,0.0000029274734,0.00008183432,0.69876575,0.0064150295,0.00023420376,0.011261489,0.0009435532],"about_ca_topic_score_codex":0.0008511088,"about_ca_topic_score_gemma":0.011870246,"teacher_disagreement_score":0.9683232,"about_ca_system_score_codex":0.00012274228,"about_ca_system_score_gemma":0.00029151642,"threshold_uncertainty_score":0.999971},"labels":[],"label_agreement":null},{"id":"W2885059027","doi":"10.1109/tcomm.2018.2864281","title":"Partially Blind Joint Channel Estimation and Symbol Detection in Amplify-and-Forward Two-Way Relay Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Isfahan University of Technology; Iran National Science Foundation","keywords":"Algorithm; Channel (broadcasting); Relay; Block (permutation group theory); Convergence (economics); Computational complexity theory; Computer science; Detector; Mathematics; Reciprocal; Joint (building); Symbol (formal); Telecommunications; Engineering","score_opus":0.07112185769842491,"score_gpt":0.30747490699559554,"score_spread":0.23635304929717063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885059027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014301035,0.00052432204,0.9813353,0.0021270106,0.00032810518,0.0004899067,0.000005322227,0.00018757982,0.000701418],"genre_scores_gemma":[0.9896275,0.002344528,0.007469561,0.00014193536,0.000027541068,0.00026434124,0.0000039632146,0.000015237029,0.00010541051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983532,0.00047174352,0.00045238854,0.00033677812,0.00016334331,0.0002225781],"domain_scores_gemma":[0.9974491,0.00030637885,0.000127317,0.0018162425,0.00018479468,0.00011614343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006582937,0.00017953714,0.00020878855,0.00035989867,0.0010223308,0.00026473534,0.00074701273,0.00009822233,0.000006437626],"category_scores_gemma":[0.000023619032,0.00018822038,0.000040053437,0.00070904015,0.00025281997,0.0005672868,0.000046964604,0.0004780873,0.000043768963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010944879,0.0010090304,0.0000519345,0.00006172715,0.0001592245,0.0000022313673,0.01463488,0.05973262,0.011241212,0.04553346,0.00012507662,0.86733913],"study_design_scores_gemma":[0.00078343553,0.00014446957,0.0005632284,0.000114370996,0.000017880197,0.000027292308,0.00013006646,0.99400145,0.0027490484,0.00040308904,0.0008474045,0.00021826012],"about_ca_topic_score_codex":0.00012283117,"about_ca_topic_score_gemma":0.0025016773,"teacher_disagreement_score":0.9753264,"about_ca_system_score_codex":0.00010234146,"about_ca_system_score_gemma":0.000047766585,"threshold_uncertainty_score":0.78630453},"labels":[],"label_agreement":null},{"id":"W2886045823","doi":"10.5220/0006907900420051","title":"Multicasting in Tactical Networks: Forwarding Versus Network Coding","year":2018,"lang":"en","type":"article","venue":"Proceedings of the 15th International Joint Conference on e-Business and Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Multicast; Linear network coding; Coding (social sciences); Network packet","score_opus":0.08171999203139281,"score_gpt":0.3087357066808663,"score_spread":0.2270157146494735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886045823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35736024,0.0007977929,0.28287262,0.10561513,0.004755619,0.001808337,0.000011054663,0.00048799877,0.2462912],"genre_scores_gemma":[0.9790099,0.0010099694,0.019525757,0.00020992622,0.00014454089,0.000035785957,0.0000022143918,0.000009890637,0.000051965028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987382,0.00004258716,0.0004510778,0.00027934715,0.00023264193,0.0002561416],"domain_scores_gemma":[0.9977483,0.00029048737,0.00030871847,0.00043462098,0.0011606584,0.000057223013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005826208,0.00016096604,0.00021109213,0.00014814708,0.0004793637,0.00027373224,0.001879691,0.00006251902,0.000026891155],"category_scores_gemma":[0.0006793531,0.00013243452,0.000052967767,0.0008756076,0.00025705763,0.0005264779,0.0015305049,0.00035934825,0.0000041856592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004625562,0.00010591829,0.004270922,0.000009565715,0.000040785635,1.620479e-7,0.0005096653,0.00045991328,0.0008602491,0.9703007,0.00024235282,0.023153536],"study_design_scores_gemma":[0.0012230865,0.0000885278,0.08381329,0.0009295269,0.000016777381,0.000013411095,0.000244209,0.90634245,0.0006086312,0.004322154,0.002066386,0.00033154385],"about_ca_topic_score_codex":0.000018880964,"about_ca_topic_score_gemma":0.00007459583,"teacher_disagreement_score":0.9659785,"about_ca_system_score_codex":0.00007871466,"about_ca_system_score_gemma":0.00005775389,"threshold_uncertainty_score":0.5400523},"labels":[],"label_agreement":null},{"id":"W2888337474","doi":"10.1109/tsipn.2018.2866322","title":"Improved Bounds for Max Consensus in Wireless Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Random geometric graph; Pairwise comparison; Combinatorics; Binary logarithm; Mathematics; Wireless network; Random graph; Graph; Discrete mathematics; Upper and lower bounds; Asynchronous communication; Computer science; Algorithm; Wireless; Statistics; Line graph","score_opus":0.017423577107964456,"score_gpt":0.25554497526096737,"score_spread":0.2381213981530029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888337474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037964638,0.00011629316,0.99430805,0.0003109602,0.0003648839,0.0003160006,0.0000026351843,0.00012501849,0.0006596781],"genre_scores_gemma":[0.99468267,0.00025818238,0.003034264,0.0017428092,0.00009839137,0.000086815555,0.000005984107,0.000008887079,0.000082008424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988289,0.000054273605,0.0004624279,0.00020917179,0.00012885244,0.00031641123],"domain_scores_gemma":[0.9990856,0.00014579814,0.0001658471,0.00023977025,0.00027070954,0.00009226473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038998222,0.00018509898,0.00018883286,0.00019369036,0.00066097133,0.00049209315,0.00031642473,0.00013374456,0.000023239769],"category_scores_gemma":[0.0000036406127,0.00017575063,0.000051523282,0.00062683906,0.00014174852,0.0018014862,0.000009094114,0.0003014029,0.000003445824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013290766,0.000053266936,0.000018470659,0.000024364823,0.00001538326,2.5068994e-7,0.00082104147,0.026660882,0.00007032695,0.0029358475,0.00043420613,0.968833],"study_design_scores_gemma":[0.0009061826,0.00021084405,0.00016809022,0.00010823653,0.000007039846,0.0000067348856,0.000034954126,0.99538094,0.00040074805,0.00011465629,0.002440474,0.00022108086],"about_ca_topic_score_codex":0.0000063982366,"about_ca_topic_score_gemma":0.00004592496,"teacher_disagreement_score":0.9912738,"about_ca_system_score_codex":0.000059538084,"about_ca_system_score_gemma":0.00008393529,"threshold_uncertainty_score":0.71669024},"labels":[],"label_agreement":null},{"id":"W2889009405","doi":"10.1109/ccece.2018.8447574","title":"Inter-Cell Interference Coordination Using Fractional Frequency Reuse Scheme in Multi-Relay Multi-Cell OFDMA Systems","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Orthogonal frequency-division multiple access; Interference (communication); Orthogonal frequency-division multiplexing; Frequency reuse; Cellular network; Computer science; Relay; Electronic engineering; Frequency-division multiple access; Reuse; Computer network; Engineering; Base station; Channel (broadcasting)","score_opus":0.10460995002147634,"score_gpt":0.3293041280550966,"score_spread":0.2246941780336203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889009405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085247874,0.0005866049,0.9111117,0.0004088521,0.00072472997,0.00024761652,0.0000014313446,0.00013411234,0.0015370714],"genre_scores_gemma":[0.8279902,0.00009732501,0.16990691,0.00015686252,0.000057008874,0.000025653924,0.0000031925426,0.000010939756,0.001751956],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835217,0.00027461394,0.00047094183,0.0004525505,0.00017663257,0.0002731022],"domain_scores_gemma":[0.9980863,0.0001341548,0.00019239681,0.0009950033,0.00050481147,0.00008735536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004864147,0.00019286007,0.00019249808,0.00026526608,0.0002217677,0.000253059,0.0015998514,0.000101687714,0.00014790885],"category_scores_gemma":[0.00012455156,0.00018371808,0.00004715011,0.0006642342,0.00008742997,0.0009428242,0.000882943,0.00033072795,0.00014473629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058106685,0.004919407,0.10665219,0.00018840056,0.00008717314,0.000030408397,0.013372226,0.00394408,0.80173486,0.036772117,0.00504627,0.02719475],"study_design_scores_gemma":[0.0008833153,0.00005793311,0.0010693637,0.0001580653,0.000002451919,0.0000056477943,0.000111932546,0.99181193,0.004812459,0.000015412254,0.0008348644,0.00023661545],"about_ca_topic_score_codex":0.0002746836,"about_ca_topic_score_gemma":0.00040347563,"teacher_disagreement_score":0.98786783,"about_ca_system_score_codex":0.0002419361,"about_ca_system_score_gemma":0.00011145142,"threshold_uncertainty_score":0.74918056},"labels":[],"label_agreement":null},{"id":"W2890051339","doi":"10.1049/iet-wss.2017.0095","title":"Performance of rank metric codes for interference constrained wireless sensor networks","year":2018,"lang":"en","type":"article","venue":"IET Wireless Sensor Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Wireless sensor network; Wireless; Coding (social sciences); Computer network; Linear network coding; Additive white Gaussian noise; Wireless network; Channel (broadcasting); Telecommunications; Network packet; Mathematics","score_opus":0.03693292611355117,"score_gpt":0.27471158086438924,"score_spread":0.23777865475083806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890051339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40087292,0.00058265263,0.5944852,0.00014269719,0.0013973209,0.00077760825,0.000020334119,0.00020751645,0.0015137426],"genre_scores_gemma":[0.9944604,0.00057058653,0.0039303,0.00007688519,0.0003658732,0.00008463712,0.000010959785,0.00002716713,0.0004731704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974935,0.00036072716,0.00079081836,0.00054573175,0.0002994903,0.00050971075],"domain_scores_gemma":[0.9962823,0.0007514768,0.000458941,0.0011824563,0.0011827326,0.00014212434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000862092,0.00031066683,0.000660665,0.0002531718,0.00036161824,0.00021872396,0.001428025,0.00015292867,0.0000127082],"category_scores_gemma":[0.00008080655,0.00028057958,0.00013429306,0.0011245433,0.00036671816,0.00036539164,0.00027993438,0.00021256617,0.000021374268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014349129,0.0012342118,0.025985107,0.0029032247,0.0015237551,0.000035628575,0.014382005,0.03130721,0.14399734,0.2027922,0.015674729,0.5587297],"study_design_scores_gemma":[0.0007895756,0.0003755092,0.00040835605,0.00042071193,0.000016703718,0.00003702644,0.0001980972,0.99005216,0.006088137,0.0000041892413,0.0012681806,0.00034132187],"about_ca_topic_score_codex":0.000030127962,"about_ca_topic_score_gemma":0.000030767602,"teacher_disagreement_score":0.958745,"about_ca_system_score_codex":0.0000735985,"about_ca_system_score_gemma":0.000095022755,"threshold_uncertainty_score":0.99996465},"labels":[],"label_agreement":null},{"id":"W2890214118","doi":"10.1109/icassp.2018.8462540","title":"Multiple Peer-to-Peer Bidirectional Cooperative Communications Using Massive MIMO Relays","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Transceiver; Relay; Beamforming; Computer science; MIMO; Relay channel; Interference (communication); Signal-to-noise ratio (imaging); Transmitter power output; Topology (electrical circuits); Channel (broadcasting); Antenna (radio); Electronic engineering; Power (physics); Computer network; Telecommunications; Transmitter; Electrical engineering; Wireless; Engineering; Physics","score_opus":0.09898567736009141,"score_gpt":0.34187930212519024,"score_spread":0.24289362476509885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890214118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067666345,0.00014499412,0.9220827,0.030248854,0.0005241266,0.00048482843,0.000008160823,0.00033074035,0.039408915],"genre_scores_gemma":[0.710792,0.000053454656,0.27906772,0.0020671058,0.00013620258,0.000053178268,0.0000136410135,0.000012952737,0.0078037316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998376,0.0002971653,0.00029043094,0.00037288733,0.00039146948,0.00027202984],"domain_scores_gemma":[0.9950501,0.00037468108,0.000079227575,0.0018463618,0.002483434,0.00016621013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055295776,0.00016914666,0.00016538052,0.00017117149,0.0012024309,0.00027175221,0.0020165343,0.00006293452,0.00024099913],"category_scores_gemma":[0.0005375623,0.00015704709,0.00005880456,0.0011402087,0.00021263864,0.0005064829,0.0016494289,0.00024112275,0.00051462516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047124424,0.0006401295,0.0044408417,0.000006043845,0.00021659024,0.000005361457,0.01781889,0.0027954741,0.047153745,0.6898101,0.16408221,0.07298349],"study_design_scores_gemma":[0.0003323148,0.000094042225,0.0011759426,0.000028470271,0.0000058819014,0.000011482864,0.00017078848,0.6536968,0.005080234,0.0002067013,0.3389028,0.00029454104],"about_ca_topic_score_codex":0.000047503927,"about_ca_topic_score_gemma":0.00060035335,"teacher_disagreement_score":0.7040254,"about_ca_system_score_codex":0.00014120388,"about_ca_system_score_gemma":0.0001575469,"threshold_uncertainty_score":0.9248248},"labels":[],"label_agreement":null},{"id":"W2891685769","doi":"10.1109/lwc.2018.2868645","title":"Sequential Relay Selection in D2D-Enabled Cellular Networks With Outdated CSI Over Mixed Fading Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação Cearense de Apoio ao Desenvolvimento Científico e Tecnológico; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Fading; Relay; Computer science; Channel state information; Outage probability; Selection (genetic algorithm); Computer network; Signal-to-noise ratio (imaging); Channel (broadcasting); Relay channel; Throughput; Cellular network; Cellular radio; Diversity combining; Algorithm; Telecommunications; Wireless; Physics; Base station; Power (physics)","score_opus":0.0328936548253857,"score_gpt":0.2657566319595045,"score_spread":0.2328629771341188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891685769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3778956,0.00016864945,0.61619955,0.0043791165,0.00038315548,0.0003503855,9.594947e-7,0.0002782387,0.00034433312],"genre_scores_gemma":[0.98362505,0.00037350634,0.013888232,0.0016338336,0.00018098777,0.00012641703,0.00003160308,0.000037392245,0.00010294468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729055,0.0009006718,0.00050900714,0.0005030152,0.00026772567,0.0005290286],"domain_scores_gemma":[0.99672097,0.00023331039,0.0002521573,0.002419328,0.0002620614,0.00011218734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007081764,0.0002901666,0.00030577465,0.00037307607,0.0009089822,0.0003681223,0.0031731073,0.00012531463,0.000023156883],"category_scores_gemma":[0.000015822246,0.00029063,0.000070414,0.002153664,0.0003590837,0.0008442822,0.0007053381,0.0007106049,0.000040092982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021818928,0.001126045,0.01181899,0.000045786473,0.0004908922,0.000044511475,0.014452538,0.23396209,0.6276849,0.033821695,0.018656453,0.05767794],"study_design_scores_gemma":[0.00091124175,0.00007165912,0.0013138513,0.0001674215,0.0000148541485,0.000013782011,0.00003726988,0.98418427,0.008290095,0.000018337898,0.0045381146,0.00043913216],"about_ca_topic_score_codex":0.00010345422,"about_ca_topic_score_gemma":0.00100052,"teacher_disagreement_score":0.75022215,"about_ca_system_score_codex":0.00027261116,"about_ca_system_score_gemma":0.000081393,"threshold_uncertainty_score":0.9999546},"labels":[],"label_agreement":null},{"id":"W2892912714","doi":"10.1109/tit.2018.2872053","title":"A Joint Typicality Approach to Compute–Forward","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministerio de Economía y Competitividad; National Science Foundation","keywords":"Decoding methods; Computer science; Encoding (memory); Gaussian; Joint (building); Theoretical computer science; Algorithm; Context (archaeology); Channel (broadcasting); Mathematics; Telecommunications; Artificial intelligence","score_opus":0.03505041804431539,"score_gpt":0.26141645457964996,"score_spread":0.22636603653533457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892912714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053519075,0.0000049834607,0.9690327,0.00071748946,0.00045447104,0.00024914084,0.0000045832558,0.0002783084,0.02872315],"genre_scores_gemma":[0.94840014,0.000016147238,0.04545903,0.0057841795,0.000044405908,0.000058458936,0.0000028772965,0.0000047476988,0.000230028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998936,0.00018613026,0.0003364887,0.00014821975,0.00020966861,0.00018351065],"domain_scores_gemma":[0.99871933,0.00008143313,0.00007130256,0.0007418561,0.00025457397,0.00013150483],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068951765,0.00012298253,0.00012470229,0.00023323,0.0005077046,0.00018762701,0.0006392752,0.00005378474,0.00008886457],"category_scores_gemma":[0.000013752201,0.00011205089,0.00007324821,0.00062797556,0.00007749556,0.0014555751,0.0000128809625,0.00019293153,0.0013759036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050154966,0.00015046833,4.524815e-7,0.000010491117,0.000029437768,7.372667e-8,0.006801325,0.005807383,0.0001177491,0.49044412,0.002520504,0.49406785],"study_design_scores_gemma":[0.0016044477,0.000746841,0.0005806225,0.00010812153,0.000026111376,0.000038662685,0.0006306788,0.7679167,0.03978549,0.014776813,0.17271729,0.0010682332],"about_ca_topic_score_codex":0.0000015717577,"about_ca_topic_score_gemma":0.0000016521059,"teacher_disagreement_score":0.94786495,"about_ca_system_score_codex":0.000073339295,"about_ca_system_score_gemma":0.00004920068,"threshold_uncertainty_score":0.9994016},"labels":[],"label_agreement":null},{"id":"W2893065390","doi":"10.1109/csndsp.2018.8471752","title":"Signal Alignment in MIMO Y Channels with Two-way Relaying and Unicast Traffic Patterns","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Unicast; Precoding; Relay; MIMO; Computer science; Computer network; Channel (broadcasting); Relay channel; Multi-user MIMO; Multicast","score_opus":0.03488375330323968,"score_gpt":0.26962452566679906,"score_spread":0.2347407723635594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893065390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66238755,0.00017137245,0.33104703,0.0022843636,0.00007957602,0.0001832179,3.5083798e-7,0.00009934164,0.003747163],"genre_scores_gemma":[0.9917204,0.00012333765,0.0074186358,0.0004644038,0.000039637416,0.000011451729,7.427123e-7,0.0000055750465,0.00021585131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917,0.00010514258,0.00014781546,0.00026272153,0.00012145692,0.0001928588],"domain_scores_gemma":[0.999376,0.00006859804,0.000035864927,0.00039883135,0.00005145245,0.00006923117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027167704,0.00010051187,0.00010543694,0.000076422766,0.00013963955,0.00013230788,0.0004438648,0.000020835841,0.000068186615],"category_scores_gemma":[0.0000036140993,0.0000773048,0.000011852683,0.0002805845,0.00006194017,0.0002355065,0.00032307827,0.00009798235,0.00001459809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058000758,0.0003859842,0.016925782,0.000026636968,0.00006580481,0.00005752125,0.02151095,0.0038987144,0.0029486679,0.124607265,0.00095636025,0.8285583],"study_design_scores_gemma":[0.0019040774,0.0005895579,0.0066347504,0.00028243984,0.000005189278,0.000050125534,0.00041981039,0.9832483,0.0029214064,0.00012930196,0.00331598,0.00049909466],"about_ca_topic_score_codex":0.000011362007,"about_ca_topic_score_gemma":0.00037989,"teacher_disagreement_score":0.97934955,"about_ca_system_score_codex":0.000031017888,"about_ca_system_score_gemma":0.0000201635,"threshold_uncertainty_score":0.31523982},"labels":[],"label_agreement":null},{"id":"W2893834508","doi":"10.1109/mnet.2018.1700297","title":"Joint Opportunistic Routing and Intra-Flow Network Coding in Multi-Hop Wireless Networks: A Survey","year":2018,"lang":"en","type":"article","venue":"IEEE Network","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Wireless network; Routing protocol; Linear network coding; Wireless; Wireless Routing Protocol; Dynamic Source Routing; Distributed computing; Lossy compression; Multiple description coding; Routing (electronic design automation); Telecommunications; Network packet; Artificial intelligence","score_opus":0.10242894426136064,"score_gpt":0.29958199623187015,"score_spread":0.19715305197050953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893834508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01919744,0.001130365,0.97277355,0.0003418582,0.0049637747,0.00046168978,0.0000026613857,0.00029273483,0.00083593203],"genre_scores_gemma":[0.9779992,0.0017106315,0.015814226,0.0011761944,0.0030981943,0.000034582023,0.00001659237,0.000038810053,0.00011158145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960932,0.0010546381,0.0007639318,0.00076196477,0.0002447793,0.0010814477],"domain_scores_gemma":[0.99734545,0.00080666057,0.00028072554,0.0010286043,0.00025896035,0.00027962014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003516553,0.0003737837,0.0005453978,0.00010100141,0.0007753684,0.00042681833,0.001048748,0.0001744057,0.00001556479],"category_scores_gemma":[0.00015329673,0.00038455406,0.00006735194,0.0016868016,0.00025865863,0.00038961248,0.0007444486,0.0006016909,0.000023557739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023975497,0.00040892055,0.1280216,0.00004956485,0.00022868373,0.00018057972,0.0046591726,0.23041761,0.00031944507,0.041453835,0.08528707,0.50873375],"study_design_scores_gemma":[0.00061031565,0.00007775403,0.049983155,0.0003716752,0.0000068816526,0.00001753457,0.000013028742,0.94683415,0.000009391049,0.00026449037,0.0013693367,0.00044226856],"about_ca_topic_score_codex":0.000068048794,"about_ca_topic_score_gemma":0.0033060042,"teacher_disagreement_score":0.95880175,"about_ca_system_score_codex":0.00011551313,"about_ca_system_score_gemma":0.000112624715,"threshold_uncertainty_score":0.99986064},"labels":[],"label_agreement":null},{"id":"W2895787695","doi":"10.1109/twc.2018.2865545","title":"Delay Reduction in Multi-Hop Device-to-Device Communication Using Network Coding","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Linear network coding; Decoding methods; Network packet; Wireless network; Wireless; Optimization problem; Vertex (graph theory); Coding (social sciences); Clique problem; Computer network; Graph; Algorithm; Theoretical computer science; Mathematics; Chordal graph; Telecommunications","score_opus":0.11198560762348853,"score_gpt":0.3459691297295167,"score_spread":0.23398352210602819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895787695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028741645,0.00047722942,0.96494174,0.0033974636,0.00047003684,0.0007197256,0.0000061096575,0.00037703814,0.00086900324],"genre_scores_gemma":[0.8155323,0.0020559318,0.18137409,0.00063485466,0.00004917996,0.00018989372,0.00000908024,0.000036490845,0.00011817891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664414,0.0011630267,0.0007998888,0.00055583566,0.00029661346,0.0005404725],"domain_scores_gemma":[0.99301964,0.0004868165,0.00024367197,0.0054436335,0.0005978427,0.0002083755],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010477313,0.00033144688,0.00035480724,0.00054406817,0.0023301297,0.00027908885,0.004268371,0.00016900028,0.000036588764],"category_scores_gemma":[0.00002297877,0.00038718877,0.0001223787,0.0033449368,0.00032673488,0.00093616557,0.00015411939,0.00088492566,0.0001808571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017685593,0.003887287,0.00055018155,0.000060960967,0.00032914296,0.0000055486757,0.028544333,0.26186755,0.05498294,0.08069486,0.0013664452,0.5675339],"study_design_scores_gemma":[0.00084047584,0.000110319066,0.00061643653,0.00055300293,0.000032331656,0.00003541545,0.00032228572,0.98631346,0.005035562,0.00020859459,0.005307602,0.0006245378],"about_ca_topic_score_codex":0.00019147075,"about_ca_topic_score_gemma":0.0042598895,"teacher_disagreement_score":0.78679067,"about_ca_system_score_codex":0.00047130825,"about_ca_system_score_gemma":0.0001795293,"threshold_uncertainty_score":0.999858},"labels":[],"label_agreement":null},{"id":"W2896593054","doi":"10.1109/tvt.2018.2875463","title":"Context Awareness Group Buying in D2D Networks: A Coalition Formation Game-Theoretic Approach","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China; Nanjing University of Aeronautics and Astronautics; China Computer Federation","keywords":"Upload; Context (archaeology); Computer science; Download; Stochastic game; Order (exchange); Pareto principle; Nash equilibrium; Game theory; Cost sharing; Computer network; Operations research; Mathematical optimization; Microeconomics; Engineering; Economics; World Wide Web; Mathematics","score_opus":0.025449971388107225,"score_gpt":0.2612490365613358,"score_spread":0.23579906517322857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896593054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03164676,0.00025547712,0.96579725,0.0009057617,0.00026725428,0.00034417745,0.0000011227473,0.0004929347,0.0002892447],"genre_scores_gemma":[0.9926469,0.00039054206,0.006332353,0.0003408094,0.000028420702,0.00021729442,0.0000056952053,0.000014590275,0.000023440787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854076,0.00022446914,0.00035365345,0.00039402072,0.0001543823,0.0003327069],"domain_scores_gemma":[0.9987817,0.000070806134,0.00009889698,0.0008476244,0.00015460464,0.00004636333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039440126,0.00018439346,0.00022203424,0.0006141085,0.00034731888,0.00008200224,0.0008074683,0.0002526346,0.000016795977],"category_scores_gemma":[0.000008307567,0.00018854236,0.00006901226,0.001603154,0.00027333313,0.00046230783,0.000015985624,0.00048242323,0.000038333324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057799352,0.0007101893,0.00008957163,0.000039503175,0.000052319145,0.000013219139,0.001818277,0.034454633,0.0038939277,0.25167403,0.00009307387,0.70710343],"study_design_scores_gemma":[0.00066966104,0.00018664086,0.000050989536,0.00009877528,0.000008936023,0.00005574802,0.00022582052,0.98643523,0.008675874,0.0020851935,0.0012717651,0.0002353544],"about_ca_topic_score_codex":0.0000107991555,"about_ca_topic_score_gemma":0.00019609122,"teacher_disagreement_score":0.9610001,"about_ca_system_score_codex":0.00015232863,"about_ca_system_score_gemma":0.00003089357,"threshold_uncertainty_score":0.7688534},"labels":[],"label_agreement":null},{"id":"W2898600895","doi":"10.1007/s11036-018-1157-1","title":"A Physical Layer Network Coding Based Modify-and-Forward with Opportunistic Secure Cooperative Transmission Protocol","year":2018,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Computer network; Secrecy; Relay; Node (physics); Linear network coding; Physical layer; Transmission (telecommunications); Secure transmission; Encryption; Channel (broadcasting); Coding (social sciences); Wireless; Data transmission; Telecommunications; Computer security; Network packet","score_opus":0.02358603351207374,"score_gpt":0.29559539890148906,"score_spread":0.27200936538941534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898600895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042253692,0.00010562001,0.9819577,0.00039255884,0.0000134518,0.015741153,0.0000025764687,0.00014568305,0.0012187673],"genre_scores_gemma":[0.90271723,0.00014151442,0.0072391434,0.0006492272,0.0004742743,0.08863304,0.000017459495,0.000021641137,0.0001064467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987405,0.000112735164,0.00020945452,0.00048637952,0.0001438611,0.00030709934],"domain_scores_gemma":[0.9987684,0.0001728947,0.00009653292,0.0005427099,0.00020362777,0.00021583684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021023377,0.0002187148,0.00022956777,0.000037125017,0.0009793165,0.00023615501,0.0003851835,0.00006898828,0.000024472414],"category_scores_gemma":[0.0000028583293,0.00016685053,0.000033810436,0.000588121,0.00025593233,0.00019068719,0.00017379249,0.00024351376,0.0000050477443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001277243,0.00043366032,0.0005219896,0.00006380363,0.00007738657,0.000004529695,0.00088892126,0.11223586,0.0007638576,0.3907607,0.0050046183,0.48911697],"study_design_scores_gemma":[0.000536776,0.00025062932,0.0001710292,0.000082355,0.000014322856,0.0000061938977,0.000017206421,0.87059,0.00007613834,0.0003391396,0.12769277,0.00022348184],"about_ca_topic_score_codex":0.000002531599,"about_ca_topic_score_gemma":0.00001636307,"teacher_disagreement_score":0.9747185,"about_ca_system_score_codex":0.000021056845,"about_ca_system_score_gemma":0.000076746706,"threshold_uncertainty_score":0.75322104},"labels":[],"label_agreement":null},{"id":"W2899093846","doi":"10.1145/3243046.3289320","title":"Session details: Session1: Ad Hoc Networks and Energy Efficiency","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Session (web analytics); Computer science; Wireless ad hoc network; Mobile ad hoc network; Computer network; Telecommunications; World Wide Web; Wireless","score_opus":0.02660141441952887,"score_gpt":0.27599202097971803,"score_spread":0.24939060656018916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899093846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055399556,0.004308168,0.97390807,0.0011256709,0.00027857316,0.00003239732,7.160515e-8,0.00018818863,0.014618923],"genre_scores_gemma":[0.97819394,0.004952474,0.012598136,0.0018807963,0.000095075855,0.0000067993283,0.0000010942114,0.000006146635,0.0022655171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907357,0.0001294194,0.00016142234,0.00029606093,0.00012559844,0.00021396334],"domain_scores_gemma":[0.9990038,0.000102498394,0.000049818347,0.0006022048,0.00013214163,0.00010950103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023109406,0.0001111118,0.00010626285,0.0000623003,0.00046267145,0.00017258919,0.00064227596,0.000052542564,0.00010352108],"category_scores_gemma":[0.000023224467,0.00008288382,0.000023687564,0.00045845614,0.00010322946,0.00032899508,0.00080346613,0.00009089016,0.00002015255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038398703,0.000035173038,0.00018035625,0.0000011481487,0.000003939609,0.0000012724573,0.0002532343,0.00003167469,0.00067530817,0.04893633,0.003661397,0.94621634],"study_design_scores_gemma":[0.00025429754,0.0001345159,0.0012684833,0.000051540716,0.0000024397195,0.0000120424775,0.000021423872,0.8213478,0.0011438158,0.0003246863,0.17522438,0.00021458937],"about_ca_topic_score_codex":0.0000014129278,"about_ca_topic_score_gemma":0.000054253036,"teacher_disagreement_score":0.972654,"about_ca_system_score_codex":0.000016263404,"about_ca_system_score_gemma":0.000031501037,"threshold_uncertainty_score":0.35585415},"labels":[],"label_agreement":null},{"id":"W2900255759","doi":"10.1109/lwc.2018.2879840","title":"Coupling Information Transmission With Window Decoding","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Interleaving; Computer science; Network packet; Transmission (telecommunications); Channel (broadcasting); Sliding window protocol; Single antenna interference cancellation; Interference (communication); Algorithm; Coupling (piping); Electronic engineering; Window (computing); Telecommunications; Computer network; Engineering","score_opus":0.029512511676998344,"score_gpt":0.2676081651393079,"score_spread":0.23809565346230957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900255759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07660017,0.00013445642,0.90599304,0.014887592,0.00012254747,0.00023312353,0.0000011158482,0.00031345032,0.0017145135],"genre_scores_gemma":[0.9059574,0.00062030036,0.090728916,0.0025513326,0.000048076738,0.000050213268,0.000016922986,0.000011406649,0.000015424896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881375,0.00012499731,0.00035098745,0.0001952133,0.00024606285,0.00026897088],"domain_scores_gemma":[0.9966073,0.00019543925,0.00017254516,0.0026370634,0.00028654965,0.00010107139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037509788,0.00017312444,0.00015911958,0.00020416339,0.0011328812,0.00034301385,0.0030728974,0.00005044739,0.000013031706],"category_scores_gemma":[0.000010921563,0.00015660783,0.00004720476,0.00082334696,0.00030494717,0.0018146364,0.00033424865,0.00030178388,0.000110582274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055592245,0.00021564928,0.0018678011,0.000037113216,0.00012851335,0.0000027926342,0.014414638,0.0039434233,0.12339042,0.08488924,0.005424951,0.7656299],"study_design_scores_gemma":[0.0007424075,0.00008160101,0.0013258377,0.00022397297,0.000013654414,0.000021887981,0.00010021585,0.9263974,0.009457282,0.000045801746,0.061146606,0.00044332762],"about_ca_topic_score_codex":0.000011538746,"about_ca_topic_score_gemma":0.000042757016,"teacher_disagreement_score":0.922454,"about_ca_system_score_codex":0.00008733355,"about_ca_system_score_gemma":0.00006966353,"threshold_uncertainty_score":0.871332},"labels":[],"label_agreement":null},{"id":"W2901535708","doi":"10.1109/access.2018.2881338","title":"Joint Space-Frequency Block Codes and Signal Alignment for Heterogeneous Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Block code; Telecommunications link; Block (permutation group theory); Interference (communication); Joint (building); Interference alignment; Coding (social sciences); Macro; Information exchange; Distributed computing; Channel (broadcasting); Computer network; Theoretical computer science; Algorithm; Decoding methods; Telecommunications; Mathematics; MIMO; Engineering","score_opus":0.06626686315543116,"score_gpt":0.3157727610549371,"score_spread":0.24950589789950595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901535708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046537027,0.0010308011,0.9496311,0.0011673815,0.0004637146,0.0003412844,0.0000022118772,0.00010473756,0.00072176225],"genre_scores_gemma":[0.9889536,0.000425259,0.00929107,0.0008664263,0.00031666883,0.000056777375,0.0000015425825,0.000009350725,0.00007932257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905014,0.00007624616,0.00019439965,0.00030838625,0.000115656745,0.00025518474],"domain_scores_gemma":[0.9990289,0.000104641615,0.00008386709,0.0005181921,0.00016701648,0.00009736595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025317402,0.00012986248,0.00014973755,0.000049923892,0.0003437854,0.00041405237,0.00092357415,0.00004591676,0.000018637276],"category_scores_gemma":[0.000012096708,0.00011718184,0.00004176611,0.00018180185,0.000096947886,0.00031737585,0.00038612136,0.00007307269,0.0000060921884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001274701,0.00064748497,0.006742241,0.00012295292,0.00050589436,0.00004753288,0.0051164357,0.02012231,0.05296645,0.1576476,0.06518377,0.69076985],"study_design_scores_gemma":[0.00077054475,0.0003980755,0.00086243567,0.00008618647,0.000017475099,0.00004513392,0.0000083711075,0.9316476,0.050632197,0.0049928655,0.010053237,0.00048585408],"about_ca_topic_score_codex":0.000009449578,"about_ca_topic_score_gemma":0.00008966291,"teacher_disagreement_score":0.94241655,"about_ca_system_score_codex":0.000033426648,"about_ca_system_score_gemma":0.000028318296,"threshold_uncertainty_score":0.47785366},"labels":[],"label_agreement":null},{"id":"W2901857701","doi":"10.1109/cnsr.2009.88","title":"Tutorial 2","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Transceiver; Computer science; Transmitter; Variety (cybernetics); Channel (broadcasting); Mathematical optimization; Computer engineering; Wireless; Telecommunications; Mathematics; Artificial intelligence","score_opus":0.03174585913234173,"score_gpt":0.284162590849025,"score_spread":0.2524167317166833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901857701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006849544,0.00011235354,0.7536003,0.0071556587,0.00031413333,0.000031906493,1.611521e-8,0.0002275011,0.23787317],"genre_scores_gemma":[0.9676131,0.00006241516,0.0287355,0.00200724,0.00010384988,6.186026e-7,1.9126225e-7,5.3661273e-7,0.0014765596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976236,0.000018656045,0.000045927984,0.000067022636,0.000048242233,0.000057822323],"domain_scores_gemma":[0.99963915,0.000013898071,0.0000075936396,0.00029103312,0.000025148345,0.00002318254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006612566,0.000025186464,0.000027682083,0.000015332902,0.000056989487,0.0000614855,0.00042351978,0.000008786979,0.00005135972],"category_scores_gemma":[0.000009594884,0.00002068507,0.000012503236,0.00013430513,0.0000036154263,0.00015007198,0.000054839038,0.000032399927,0.00007358077],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.1086255e-7,0.0000069885946,0.000005171715,2.8392613e-8,3.3676898e-7,2.51647e-7,0.000051566094,0.0000024475796,0.00045882945,0.7494111,0.005965215,0.24409783],"study_design_scores_gemma":[0.00045004816,0.00013423708,0.0076603875,0.000006021957,9.4113557e-7,0.0000065205713,0.000004851916,0.07629855,0.0037916815,0.024892908,0.886517,0.0002368942],"about_ca_topic_score_codex":2.1629269e-7,"about_ca_topic_score_gemma":0.0000010178243,"teacher_disagreement_score":0.9669281,"about_ca_system_score_codex":0.000006554241,"about_ca_system_score_gemma":0.000010215866,"threshold_uncertainty_score":0.09457564},"labels":[],"label_agreement":null},{"id":"W2903884281","doi":"10.1109/twc.2020.2997290","title":"Performance Analysis of Massive MIMO Multi-Way Relay Networks With Low-Resolution ADCs","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Singular value decomposition; Quantization (signal processing); MIMO; Computer science; Gaussian; Relay; Topology (electrical circuits); Algorithm; Channel state information; Channel (broadcasting); Control theory (sociology); Mathematics; Electronic engineering; Power (physics); Telecommunications; Wireless; Engineering","score_opus":0.05064919160143769,"score_gpt":0.28535701814107894,"score_spread":0.23470782653964126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903884281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010156129,0.000598187,0.98481,0.002628264,0.0002653042,0.000676461,0.00008405803,0.00034409348,0.00043752659],"genre_scores_gemma":[0.9172517,0.018394599,0.06344838,0.00019722534,0.000018034147,0.00040528944,0.00014291279,0.000041567368,0.00010027384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966826,0.00078278495,0.0009182656,0.00079032447,0.00045157393,0.000374444],"domain_scores_gemma":[0.99071604,0.0005491255,0.0007490574,0.00706395,0.0007151944,0.0002066135],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003754236,0.00050712045,0.00087647967,0.0007970138,0.0009582016,0.00017421662,0.0055379993,0.00034976003,0.000028805993],"category_scores_gemma":[0.000009767615,0.00050279294,0.00046772702,0.003566138,0.0004348088,0.00036012093,0.00027641054,0.0021805093,0.000017358487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037076046,0.00056037295,0.00010308146,0.000046924284,0.0013323013,0.0000010551737,0.0013693931,0.9571171,0.00019615838,0.0011234396,0.00004649921,0.038066607],"study_design_scores_gemma":[0.00045352546,0.00011135862,0.0021863356,0.0004484415,0.0007767104,0.0000016104814,0.000050574818,0.9944806,0.0007498103,0.0000056400518,0.00023784534,0.00049751904],"about_ca_topic_score_codex":0.00006977105,"about_ca_topic_score_gemma":0.0011193589,"teacher_disagreement_score":0.9213616,"about_ca_system_score_codex":0.0002504429,"about_ca_system_score_gemma":0.00029626573,"threshold_uncertainty_score":0.9998425},"labels":[],"label_agreement":null},{"id":"W2905757196","doi":"10.1109/tcomm.2018.2889089","title":"Multi-Node ML Time and Frequency Synchronization for Distributed MIMO-Relay Beamforming Over Time-Varying Flat-Fading Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Institut National de la Recherche Scientifique; University of Manitoba; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Computer science; Relay; Carrier frequency offset; MIMO; Node (physics); Synchronization (alternating current); Fading; Electronic engineering; Channel (broadcasting); Frequency offset; Computer network; Orthogonal frequency-division multiplexing; Engineering; Telecommunications; Power (physics)","score_opus":0.04051896480186675,"score_gpt":0.29557336871957274,"score_spread":0.255054403917706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905757196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016946088,0.0004219149,0.9943848,0.001864825,0.00025570925,0.0006000816,0.00008312945,0.00036083444,0.0003340888],"genre_scores_gemma":[0.7994943,0.00066167896,0.1986686,0.00029256233,0.000055887806,0.00019891665,0.00009399884,0.000033206812,0.00050085405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984215,0.00022134962,0.00044130176,0.00041002544,0.0001612355,0.00034461776],"domain_scores_gemma":[0.9964972,0.000644365,0.00016400455,0.002185148,0.00037473274,0.00013453345],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004201302,0.0002462883,0.00023854345,0.0002433854,0.0024590879,0.0002691728,0.0015993582,0.00012418101,0.00008293646],"category_scores_gemma":[0.000044503908,0.0002684417,0.0001037149,0.0008086128,0.0002552518,0.0008752166,0.0000633905,0.00033169286,0.000120815705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001496468,0.003143211,0.00023455874,0.00017061371,0.0012908897,0.0000035999599,0.026549155,0.09957913,0.35463133,0.020242732,0.0052085225,0.4887966],"study_design_scores_gemma":[0.0007253931,0.000099317454,0.00005766003,0.00013848272,0.000037875332,0.000009013363,0.000012620396,0.991287,0.004569773,0.0001757133,0.0025728676,0.00031426258],"about_ca_topic_score_codex":0.000028279215,"about_ca_topic_score_gemma":0.000107672975,"teacher_disagreement_score":0.8917079,"about_ca_system_score_codex":0.00018037739,"about_ca_system_score_gemma":0.000089670975,"threshold_uncertainty_score":0.99997675},"labels":[],"label_agreement":null},{"id":"W2907845854","doi":"10.1109/pimrc.2018.8580738","title":"Superposition Coding in Alternate DF Relaying Systems with Virtual MIMO IRI Cancellation","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Single antenna interference cancellation; MIMO; Computer science; Relay; Base station; Transmission (telecommunications); Electronic engineering; Interference (communication); Beamforming; Topology (electrical circuits); 3G MIMO; Channel (broadcasting); Computer network; Power (physics); Telecommunications; Electrical engineering; Engineering; Physics","score_opus":0.029982984468066416,"score_gpt":0.26593773011363864,"score_spread":0.23595474564557223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907845854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24651426,0.00012738518,0.73552155,0.0005359182,0.00030882092,0.00018785322,2.8528214e-7,0.00013064289,0.016673265],"genre_scores_gemma":[0.9959158,0.00013845944,0.0030859623,0.00018913361,0.00009355562,0.000014202163,0.0000025251352,0.0000062867393,0.00055410515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911845,0.00012536172,0.00019336375,0.00023640224,0.00015472953,0.00017166589],"domain_scores_gemma":[0.99931824,0.00006559573,0.000057278998,0.00038083844,0.00013460276,0.00004344223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003080423,0.0000916655,0.00010255931,0.00011126336,0.00020016203,0.00020032065,0.00039989824,0.00003082265,0.00001897142],"category_scores_gemma":[0.000009203381,0.000077220466,0.000012931305,0.00042980694,0.000040215946,0.0005247882,0.00013893266,0.00010606287,0.000041924253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072570896,0.00009827181,0.028069573,0.000022894134,0.000037611735,0.000021969408,0.0120201325,0.006067357,0.017772349,0.84337425,0.001342338,0.091100685],"study_design_scores_gemma":[0.0004328077,0.0002000711,0.0020226047,0.0001926703,0.0000019514569,0.000018979072,0.00012585033,0.9943883,0.0012950253,0.000064219275,0.0010775538,0.0001799673],"about_ca_topic_score_codex":0.00012092754,"about_ca_topic_score_gemma":0.00065880845,"teacher_disagreement_score":0.98832095,"about_ca_system_score_codex":0.000113829046,"about_ca_system_score_gemma":0.00003804488,"threshold_uncertainty_score":0.31489593},"labels":[],"label_agreement":null},{"id":"W2908611569","doi":"10.1109/iemcon.2018.8614992","title":"Fractional Frequency Reuse (FFR) Scheme for Inter-Cell Interference (ICI) Mitigation in Multi-Relay Multi-Cell OFDMA Systems","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Spectral efficiency; Interference (communication); Orthogonal frequency-division multiple access; Relay; Computer science; Quality of service; Orthogonal frequency-division multiplexing; Electronic engineering; Signal-to-noise ratio (imaging); Signal-to-interference-plus-noise ratio; Frequency allocation; Enhanced Data Rates for GSM Evolution; Cumulative distribution function; Computer network; Telecommunications; Mathematics; Engineering; Channel (broadcasting); Probability density function; Statistics; Physics; Power (physics)","score_opus":0.08380824810151506,"score_gpt":0.31981426344711555,"score_spread":0.2360060153456005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908611569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031334452,0.000590333,0.96404386,0.0009907621,0.0008022415,0.0005462082,0.000005013134,0.00015290671,0.0015342371],"genre_scores_gemma":[0.79469496,0.00014351848,0.20170547,0.00029668002,0.00008114046,0.00016611874,0.00001059606,0.000012695058,0.002888837],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834484,0.0001849667,0.0005228666,0.0004925057,0.00015459559,0.0003002418],"domain_scores_gemma":[0.9978614,0.00026633195,0.00019401909,0.0010280738,0.0005518986,0.00009831993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049601647,0.0002023908,0.00020694453,0.0002026254,0.00021689443,0.00022862943,0.0016757761,0.00011212791,0.0001034975],"category_scores_gemma":[0.00017153412,0.0001890323,0.00006976857,0.00043758453,0.000088708315,0.00074773416,0.00058052613,0.00026776944,0.00014612472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019365242,0.0074897595,0.056504555,0.0005721562,0.00017137204,0.00001642524,0.023244204,0.0018825826,0.6870244,0.13017748,0.03246496,0.060258444],"study_design_scores_gemma":[0.0015368097,0.00014030075,0.0011355222,0.00018544628,0.0000033141043,0.000002581665,0.00013340914,0.9809819,0.011775845,0.000053089316,0.0037723973,0.00027937142],"about_ca_topic_score_codex":0.00010899149,"about_ca_topic_score_gemma":0.00053777517,"teacher_disagreement_score":0.97909933,"about_ca_system_score_codex":0.00015644316,"about_ca_system_score_gemma":0.000105115876,"threshold_uncertainty_score":0.7708514},"labels":[],"label_agreement":null},{"id":"W2912975828","doi":"10.1007/978-3-642-10868-6_1","title":"Subspace Codes","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Decoding methods; Block code; Subspace topology; Linear code; Linear network coding; Coding (social sciences); Algorithm; Metric (unit); Theoretical computer science; Concatenated error correction code; Context (archaeology); Network packet; Mathematics; Artificial intelligence; Computer network","score_opus":0.032139246894722855,"score_gpt":0.2742617203431941,"score_spread":0.24212247344847126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912975828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015250608,0.0020037577,0.9726465,0.0029935616,0.0006817421,0.00024242306,0.0000011141434,0.0002205031,0.021195149],"genre_scores_gemma":[0.22359306,0.0025160399,0.7598849,0.0083594555,0.00076878007,0.000011943003,0.0000099840045,0.000054344182,0.004801508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971745,0.000056440807,0.00039856945,0.0011376691,0.00069459714,0.00053819775],"domain_scores_gemma":[0.9968878,0.00037743134,0.00020562806,0.0020723483,0.00029131275,0.00016546858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008216215,0.00044094483,0.00045179072,0.0006014963,0.0003722251,0.00064258784,0.004808441,0.00021960896,0.000035707275],"category_scores_gemma":[0.00007409246,0.00041165904,0.000111402056,0.000724937,0.00048214215,0.0005265733,0.0015281456,0.0008521261,0.00008191997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013862875,0.000014243685,0.000010778132,0.0000045788315,0.000003942072,0.000022524879,0.00038577395,0.004482829,0.00008704709,0.08087301,0.000070592585,0.9140433],"study_design_scores_gemma":[0.0003894297,0.0002518104,0.00036136172,0.0006686349,0.0000082002125,0.00008877421,1.2550132e-7,0.73758817,0.0015195555,0.21469983,0.043066565,0.0013575375],"about_ca_topic_score_codex":0.0000030556241,"about_ca_topic_score_gemma":0.00012642254,"teacher_disagreement_score":0.91268575,"about_ca_system_score_codex":0.00026117315,"about_ca_system_score_gemma":0.000417584,"threshold_uncertainty_score":0.9998335},"labels":[],"label_agreement":null},{"id":"W2913328761","doi":"10.1109/lcomm.2019.2895631","title":"Multiuser Diversity in Network-Coded Cooperation: Outage and Diversity Analysis","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rayleigh fading; Computer science; Relay; Independent and identically distributed random variables; Outage probability; Diversity (politics); Fading; Diversity gain; Function (biology); Cooperative diversity; Algorithm; Telecommunications; Statistics; Mathematics; Decoding methods; Random variable; Physics","score_opus":0.05467499295677989,"score_gpt":0.2726342791329736,"score_spread":0.21795928617619373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913328761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8263167,0.00069773156,0.15582839,0.0149637,0.00022529461,0.0004787614,0.0000047756384,0.00017478569,0.0013098585],"genre_scores_gemma":[0.9818355,0.00091650843,0.013647533,0.0034028403,0.000015442029,0.000011093037,0.000018825525,0.0000053551216,0.00014691797],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848694,0.00048724763,0.000256099,0.0003460217,0.00017825738,0.00024546764],"domain_scores_gemma":[0.9965913,0.00031574516,0.00010522301,0.0028042523,0.00010476627,0.00007867587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005824369,0.00015080525,0.00026022224,0.000265743,0.0011762207,0.00015216447,0.002894986,0.00005640719,0.000032363012],"category_scores_gemma":[0.000018957266,0.00016543469,0.00008491641,0.001695853,0.00013046616,0.00067695463,0.007528535,0.00032990938,0.00005321532],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013987228,0.00017123643,0.92986345,0.000008970257,0.00032610327,0.000004516521,0.009587921,0.030723264,0.0017393236,0.01908242,0.0024937885,0.0059850137],"study_design_scores_gemma":[0.0012853148,0.000028332786,0.3556516,0.000038893388,0.00010839345,0.00000283091,0.00009742157,0.63727355,0.0000654186,0.00015257185,0.0047342354,0.00056146167],"about_ca_topic_score_codex":0.00017326364,"about_ca_topic_score_gemma":0.001844532,"teacher_disagreement_score":0.6065503,"about_ca_system_score_codex":0.00009998387,"about_ca_system_score_gemma":0.000018201748,"threshold_uncertainty_score":0.93837804},"labels":[],"label_agreement":null},{"id":"W2914258091","doi":"10.1109/mwscas.2018.8623876","title":"Stochastic Computing based BCH Decoder for WBAN Systems","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"BCH code; Computer science; Decoding methods; Stochastic computing; Energy consumption; Forward error correction; Computer engineering; Algorithm; Engineering; Electrical engineering","score_opus":0.060983600905844794,"score_gpt":0.31838895719675375,"score_spread":0.25740535629090894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914258091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009866469,0.00013869772,0.9935873,0.0006711443,0.00047498598,0.00026246934,4.6809805e-7,0.00020586031,0.0036724044],"genre_scores_gemma":[0.9244113,0.000001351131,0.074252725,0.0007504223,0.00016060112,0.00001581446,0.0000018946344,0.0000064312153,0.00039943773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999234,0.00006807582,0.00017600076,0.00022100666,0.000099409175,0.00020146806],"domain_scores_gemma":[0.99870294,0.0003388122,0.0000525846,0.0005529529,0.00029113184,0.00006156326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038129263,0.00008593193,0.000108145316,0.00005905122,0.0003575096,0.00020784102,0.00073646393,0.00002744572,0.00002291905],"category_scores_gemma":[0.000058958205,0.00007447009,0.00003585888,0.00024184526,0.00003973441,0.00012642975,0.00019275352,0.000051627525,0.000053729134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019630066,0.00015118628,0.0002273731,0.000044929806,0.000047187317,8.787918e-7,0.0019998462,0.025867531,0.0013980129,0.7862378,0.025436781,0.15856887],"study_design_scores_gemma":[0.00027152666,0.000064989414,0.00010761722,0.000030733907,0.0000018641775,0.0000016861325,0.000013153786,0.9913063,0.00018653898,0.00011503604,0.0077920295,0.00010852533],"about_ca_topic_score_codex":0.0000040345762,"about_ca_topic_score_gemma":0.000022927163,"teacher_disagreement_score":0.9654388,"about_ca_system_score_codex":0.000030404028,"about_ca_system_score_gemma":0.00005444143,"threshold_uncertainty_score":0.3036802},"labels":[],"label_agreement":null},{"id":"W2915808263","doi":"10.1007/s11277-019-06181-9","title":"Training Power Allocation Based on MSE-Minimization for Multi-Relay Amplify-and-Forward Cooperation in Wireless Sensor Networks","year":2019,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relay; Wireless sensor network; Minification; Wireless; Computer network; Power (physics); Telecommunications; Real-time computing","score_opus":0.08157628639821406,"score_gpt":0.3177775368268485,"score_spread":0.23620125042863443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915808263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055936284,0.0003299853,0.9358193,0.005331811,0.00020658049,0.0013390833,0.000015278747,0.00019796549,0.00082370423],"genre_scores_gemma":[0.9543071,0.0005886715,0.042889915,0.0013514134,0.000026310614,0.00033452347,0.00027684294,0.000033729153,0.00019153138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788564,0.0005059971,0.00050480466,0.0005163001,0.0002325293,0.0003547374],"domain_scores_gemma":[0.9967995,0.0009522745,0.00020848373,0.0015805424,0.0003458174,0.00011337874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079077337,0.00026947487,0.0003246428,0.00027032298,0.00060535053,0.00025338613,0.001311469,0.00018200999,0.000022271774],"category_scores_gemma":[0.000091140864,0.00028713097,0.00008476952,0.00070952636,0.00012227295,0.00048521988,0.00030999808,0.0005031891,0.000021897746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022765277,0.0013524657,0.0066204057,0.000082342616,0.000104657745,0.000001526845,0.022738852,0.13705792,0.0052070706,0.6361466,0.00042722689,0.19003329],"study_design_scores_gemma":[0.0014069778,0.00011952477,0.0034748013,0.00015748337,0.000008443111,0.0000025409436,0.000423487,0.9915593,0.00005320279,0.00001902062,0.002444608,0.00033057708],"about_ca_topic_score_codex":0.0000152615,"about_ca_topic_score_gemma":0.0002779214,"teacher_disagreement_score":0.8983708,"about_ca_system_score_codex":0.00017205965,"about_ca_system_score_gemma":0.00017624052,"threshold_uncertainty_score":0.9999581},"labels":[],"label_agreement":null},{"id":"W2917123239","doi":"10.1109/glocom.2018.8647448","title":"Spatial Multiplexing and Antenna Selection in Relay-Assisted Transmissions with Heterogeneous Nodes","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Relay; Computer network; Relay channel; Computer science; MIMO; Spatial multiplexing; Multiplexing; Precoding; Decoding methods; Wireless; Channel (broadcasting); Antenna (radio); Electronic engineering; Telecommunications; Engineering","score_opus":0.032518497125857644,"score_gpt":0.26901646049499267,"score_spread":0.23649796336913503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917123239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17317475,0.000090587004,0.8250783,0.00062735454,0.000026246722,0.00009264194,1.6326543e-7,0.00010155811,0.00080839515],"genre_scores_gemma":[0.9534064,0.00009066728,0.046183225,0.00017609625,0.000021504055,0.000006760609,5.9248043e-7,0.0000046362466,0.000110144465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993706,0.00008594963,0.00012227934,0.00021007139,0.0000750117,0.00013612154],"domain_scores_gemma":[0.99962634,0.00005211235,0.000026201022,0.00016467065,0.00007679097,0.000053875137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011371169,0.00007878229,0.000083337516,0.00008280057,0.0002226227,0.00008068605,0.0002027052,0.000029069302,0.000026317055],"category_scores_gemma":[0.000012477822,0.000059738883,0.000011889299,0.00035870427,0.00005814122,0.0001789748,0.000077882214,0.000090678026,0.0000038923095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013322821,0.00027007502,0.043608833,0.00001398609,0.000040092258,0.000018007413,0.006248016,0.0004150627,0.12756985,0.0075673354,0.000088097215,0.8140274],"study_design_scores_gemma":[0.000555348,0.00016208166,0.050041918,0.000060688002,0.0000017827605,0.000060989852,0.000018935643,0.94401217,0.004156212,0.00003303911,0.00076010445,0.00013672144],"about_ca_topic_score_codex":0.000069560854,"about_ca_topic_score_gemma":0.003845374,"teacher_disagreement_score":0.94359714,"about_ca_system_score_codex":0.000021757258,"about_ca_system_score_gemma":0.000026121408,"threshold_uncertainty_score":0.24360809},"labels":[],"label_agreement":null},{"id":"W2920292360","doi":"10.1109/access.2019.2903139","title":"On Total Transmission Power Minimization Approach to Decentralized Beamforming in Single-Carrier Asynchronous Bidirectional Relay-Assisted Communication Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Asynchronous communication; Transceiver; Beamforming; Transmission (telecommunications); Channel (broadcasting); Computer network; Topology (electrical circuits); Power (physics); Telecommunications; Wireless; Engineering; Electrical engineering","score_opus":0.035083681698229396,"score_gpt":0.2835221478152622,"score_spread":0.2484384661170328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920292360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20933461,0.00029714347,0.78258204,0.00047814043,0.00041276577,0.00057005434,0.0000010118284,0.00013147383,0.0061927284],"genre_scores_gemma":[0.9763148,0.00016819019,0.022668317,0.00057903014,0.00002031651,0.000056657595,0.000030703573,0.00001861805,0.00014340223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982892,0.00031489955,0.0003908175,0.00042694784,0.00027850538,0.0002995841],"domain_scores_gemma":[0.99850315,0.00023220517,0.0001255508,0.0008865251,0.00012959466,0.00012296751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035998865,0.00018729,0.00022112126,0.00024766466,0.0002207884,0.0003296656,0.0012533448,0.00011873679,0.00006295101],"category_scores_gemma":[0.000033859244,0.00018368657,0.00006477316,0.0011860733,0.000023597118,0.0009042869,0.00022347021,0.00029147236,0.000018364874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022429414,0.0010350121,0.0027463727,0.000019690968,0.000039592305,0.0000017404843,0.0032322682,0.7918377,0.0036001587,0.010718238,0.0015879194,0.184957],"study_design_scores_gemma":[0.0014573442,0.00013748305,0.018178409,0.00025695478,0.000006178941,0.000014582744,0.000032986885,0.9740117,0.0012156408,0.00012633203,0.004117682,0.0004447086],"about_ca_topic_score_codex":0.0000149604675,"about_ca_topic_score_gemma":0.000018834038,"teacher_disagreement_score":0.7669802,"about_ca_system_score_codex":0.00024791592,"about_ca_system_score_gemma":0.000060067447,"threshold_uncertainty_score":0.74905205},"labels":[],"label_agreement":null},{"id":"W2922016977","doi":"10.1109/itw44776.2019.8988926","title":"An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tornado code; Online codes; Luby transform code; Erasure; Fountain code; Erasure code; Burst error; Computer science; Block code; Generalization; Code (set theory); Channel (broadcasting); Error detection and correction; Sliding window protocol; Algorithm; Concatenated error correction code; Discrete mathematics; Mathematics; Decoding methods; Telecommunications; Window (computing)","score_opus":0.038202685907307944,"score_gpt":0.28780885220169017,"score_spread":0.24960616629438223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922016977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19898924,0.00044490263,0.7990508,0.00021129055,0.00015879495,0.000451187,0.000009936758,0.00007706906,0.00060677354],"genre_scores_gemma":[0.7408767,0.00036750684,0.25855017,0.00004551254,0.000042653184,0.000043040374,0.000021703272,0.0000084383855,0.000044318553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999046,0.0000709932,0.00021572305,0.0004080673,0.00012171246,0.00013748466],"domain_scores_gemma":[0.9986273,0.00014544533,0.00017548267,0.00077211385,0.00022430584,0.000055359684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002158039,0.00017580332,0.00028943518,0.000104197374,0.00010375894,0.0001896064,0.000628641,0.00009515112,0.000006271255],"category_scores_gemma":[0.0000093316385,0.00014598719,0.000037652564,0.000089009896,0.00007545582,0.00027837537,0.00050154474,0.00019159896,3.4737658e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017293397,0.00026739197,0.005261893,0.0006256776,0.00035116763,0.0000026387452,0.0063975924,0.0478919,0.004884433,0.7043694,0.00023290487,0.22954203],"study_design_scores_gemma":[0.0006427917,0.0004485999,0.0012763096,0.0004631039,0.000026317457,0.000027144466,0.00049958937,0.9837419,0.010285382,0.0018113805,0.000302048,0.0004754525],"about_ca_topic_score_codex":0.000016228796,"about_ca_topic_score_gemma":0.000019265892,"teacher_disagreement_score":0.93584996,"about_ca_system_score_codex":0.000016265629,"about_ca_system_score_gemma":0.00010779744,"threshold_uncertainty_score":0.59531844},"labels":[],"label_agreement":null},{"id":"W29220803","doi":"10.1007/978-1-4939-0413-6_3","title":"Trust-Aware Cooperative Networking","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Trustworthiness; Throughput; Computer science; Selection (genetic algorithm); Transmission (telecommunications); Computer network; Scheme (mathematics); Power (physics); Energy (signal processing); Computer security; Telecommunications; Wireless; Artificial intelligence","score_opus":0.03798933769204161,"score_gpt":0.26269493248747994,"score_spread":0.22470559479543833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29220803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007089378,0.0011988195,0.7119551,0.00071809907,0.0022924405,0.0006196553,0.0000014464714,0.00033936213,0.28280422],"genre_scores_gemma":[0.36953557,0.012827465,0.3462959,0.011059468,0.0048615243,0.00029961969,0.000030705254,0.0003799663,0.25470978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577177,0.000080093814,0.0007644071,0.0016379881,0.0008862303,0.00085952866],"domain_scores_gemma":[0.9960832,0.00021355164,0.00035023858,0.0024853013,0.0005725999,0.00029507955],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012112345,0.00062684616,0.00064156845,0.0006953518,0.00067025353,0.001305868,0.006146809,0.0002415619,0.00027707504],"category_scores_gemma":[0.000025392717,0.00063082034,0.00014373845,0.00086872344,0.0008284592,0.0014227756,0.0048249,0.0011369059,0.0005128149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015777458,0.000022040846,0.000045039855,0.000011950938,0.000014115935,0.000036075093,0.0004693949,0.0015172199,0.000026780976,0.5936237,0.00080716977,0.40342492],"study_design_scores_gemma":[0.00039659947,0.00012671044,0.0004827329,0.00080125395,0.0000064713568,0.000037661157,0.0000021751835,0.78056574,0.00012175352,0.007826681,0.20835696,0.001275238],"about_ca_topic_score_codex":0.000011257149,"about_ca_topic_score_gemma":0.00004561891,"teacher_disagreement_score":0.77904856,"about_ca_system_score_codex":0.00049221097,"about_ca_system_score_gemma":0.0006679134,"threshold_uncertainty_score":0.9997309},"labels":[],"label_agreement":null},{"id":"W2922236580","doi":"10.14257/ijhit.2015.8.5.38","title":"Outage Probability Analysis of the VAF Relaying M2M Networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Hybrid Information Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Outage probability; Computer science; Computer network; Fading; Channel (broadcasting)","score_opus":0.025403095035552742,"score_gpt":0.2718582440124984,"score_spread":0.24645514897694568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922236580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11337832,0.00020251104,0.8773436,0.0069126105,0.00092262187,0.0000862047,0.0000029534017,0.000042681833,0.0011084833],"genre_scores_gemma":[0.9912617,0.00011181779,0.008232423,0.0003505006,0.000024655425,0.0000025131,0.0000032639277,0.0000016506933,0.0000114464165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985737,0.000077850644,0.0007732361,0.00005977728,0.00042147655,0.00009395381],"domain_scores_gemma":[0.99657464,0.0000671398,0.0009892352,0.000439663,0.0018904682,0.000038847007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088523515,0.000073399286,0.00018442202,0.0008035171,0.000054034866,0.00007875304,0.0024352965,0.000038011418,0.000010162251],"category_scores_gemma":[0.0006052183,0.000052822015,0.00014858395,0.0011646093,0.000096226075,0.0013001958,0.0006054684,0.00028622046,0.0000036836557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006369433,0.00016480405,0.038292896,0.0000064478913,0.0017311412,0.0000094662255,0.0018911556,0.30374944,0.000128531,0.34385598,0.004433052,0.3056734],"study_design_scores_gemma":[0.0010064772,0.00012992686,0.008728158,0.0000685362,0.00011603188,0.00028116212,0.00026800376,0.9434564,0.0035722258,0.012655498,0.029531436,0.00018611565],"about_ca_topic_score_codex":0.0000020648004,"about_ca_topic_score_gemma":0.000004147569,"teacher_disagreement_score":0.87788343,"about_ca_system_score_codex":0.00014310506,"about_ca_system_score_gemma":0.00013409393,"threshold_uncertainty_score":0.45254275},"labels":[],"label_agreement":null},{"id":"W2931875541","doi":"10.1049/iet-com.2018.5954","title":"Cross‐layer design of T‐ARQ and adaptive modulation and coding in a spectrum sharing with cooperative relaying system","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Link adaptation; Computer science; Automatic repeat request; Hybrid automatic repeat request; Coding (social sciences); Computer network; Telecommunications; Decoding methods; Mathematics; Fading; Telecommunications link; Statistics","score_opus":0.07459529037788769,"score_gpt":0.29432411544161596,"score_spread":0.21972882506372826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2931875541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2780311,0.0017646732,0.7151485,0.0008552133,0.000041462932,0.00085947226,0.0000026028076,0.00010671266,0.00319027],"genre_scores_gemma":[0.9530851,0.000823371,0.04594663,0.000030502662,0.0000043414384,0.000040614468,0.0000026850726,0.000009571111,0.000057170764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988791,0.00029322537,0.00029388635,0.00027395977,0.00011150142,0.00014834163],"domain_scores_gemma":[0.9978028,0.00045805494,0.00015226546,0.0013966304,0.0001455147,0.000044737593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058556965,0.00012360374,0.00021013296,0.0001496856,0.00028450138,0.00015420148,0.00086891826,0.00004606295,0.000003533414],"category_scores_gemma":[0.000026234738,0.00011522159,0.000014121028,0.0005250282,0.0001317936,0.00061918516,0.0009650119,0.00024155068,0.0000035689889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006482251,0.00013639849,0.09122891,0.00006425217,0.00007161745,0.0000018493857,0.013839647,0.04035953,0.0062026074,0.8412855,0.0000071674062,0.0067376504],"study_design_scores_gemma":[0.000546908,0.000101054655,0.042248145,0.00036181562,0.000004810282,0.000013404039,0.0004146015,0.9556302,0.0002840033,0.0002158289,0.000034561443,0.00014466772],"about_ca_topic_score_codex":0.000051142983,"about_ca_topic_score_gemma":0.00013375716,"teacher_disagreement_score":0.9152707,"about_ca_system_score_codex":0.000082663835,"about_ca_system_score_gemma":0.00004950691,"threshold_uncertainty_score":0.46986002},"labels":[],"label_agreement":null},{"id":"W2942331856","doi":"10.1109/tvt.2021.3136794","title":"Wireless Network Reliability Analysis for Arbitrary Network Topologies","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network topology; Wireless network; Linear network coding; Wireless; Computer science; Graph theory; Ergodic theory; Reliability (semiconductor); Wireless sensor network; Mathematics; Topology (electrical circuits); Computer network; Combinatorics; Telecommunications; Network packet","score_opus":0.02366132539990579,"score_gpt":0.26932733376095314,"score_spread":0.24566600836104735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942331856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014360828,0.0010258966,0.97472733,0.008161639,0.00052686123,0.00025487883,0.000005025281,0.0007516466,0.00018591376],"genre_scores_gemma":[0.8967132,0.0010316645,0.100989,0.0007422352,0.000057758614,0.0002271579,0.000007639529,0.000013197096,0.00021812881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815786,0.00020879887,0.00036390565,0.0006451509,0.00014610728,0.00047816278],"domain_scores_gemma":[0.9973919,0.00035429196,0.000094161325,0.0017844266,0.0003136436,0.00006159748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004000027,0.00020691282,0.00041617255,0.0002385545,0.0006912872,0.00008072634,0.0009978593,0.00030033613,0.000040710962],"category_scores_gemma":[0.000024555062,0.000209908,0.00034986908,0.0042888243,0.000181504,0.00016246167,0.00002796787,0.00051408267,0.000013190083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025710331,0.0003111172,0.000624467,0.000016240252,0.0008248648,0.000027432567,0.00008700417,0.74009126,0.0006252357,0.113879606,0.00092326215,0.14256383],"study_design_scores_gemma":[0.001017299,0.0003523356,0.0011320405,0.00008038023,0.00052699284,0.000051396553,0.00011987327,0.86479545,0.04376404,0.049183786,0.038031016,0.00094536884],"about_ca_topic_score_codex":0.0000026656573,"about_ca_topic_score_gemma":0.00014541538,"teacher_disagreement_score":0.8823524,"about_ca_system_score_codex":0.00008001527,"about_ca_system_score_gemma":0.000111841815,"threshold_uncertainty_score":0.85598004},"labels":[],"label_agreement":null},{"id":"W2944107031","doi":"10.1016/j.phycom.2019.100705","title":"On the performance of cognitive two-way relay networks with multi-user scheduling and shadowing","year":2019,"lang":"en","type":"article","venue":"Physical Communication","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Relay; Fading; Scheduling (production processes); Cognitive radio; Outage probability; Ergodic theory; Wireless; Computer network; Diversity gain; Telecommunications; Mathematical optimization; Channel (broadcasting); Mathematics","score_opus":0.02787491568401198,"score_gpt":0.2760612250773842,"score_spread":0.2481863093933722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944107031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94182587,0.00029815253,0.055844083,0.0006677205,0.000016579863,0.00026836907,3.0382228e-7,0.00004193677,0.0010370015],"genre_scores_gemma":[0.99439484,0.00033395216,0.0048723216,0.00029157897,0.000011987525,0.000026511178,0.00000468855,0.000008802427,0.000055303884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991091,0.00029657644,0.00014047061,0.00018253163,0.00014337387,0.00012794796],"domain_scores_gemma":[0.997262,0.0013699536,0.00012490731,0.0010580443,0.00015356386,0.00003152187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003562622,0.00011024127,0.00014609238,0.000030885196,0.00027093128,0.000067707515,0.00084650936,0.000021615773,0.000004564371],"category_scores_gemma":[0.000049409344,0.000073142946,0.000029137895,0.00032220894,0.000115656236,0.0003380669,0.00052206934,0.0003716977,0.000015696622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013201706,0.0005675591,0.011994998,0.000027269463,0.00010954256,2.641171e-7,0.008405645,0.075993605,0.0031181688,0.83106524,0.000023800643,0.06856187],"study_design_scores_gemma":[0.0005081242,0.00014306855,0.009932367,0.00036096817,0.0000076110937,8.920051e-7,0.0000827999,0.9876732,0.0010476601,0.00009271561,0.00003725055,0.00011333472],"about_ca_topic_score_codex":0.0000050899334,"about_ca_topic_score_gemma":0.00000811313,"teacher_disagreement_score":0.9116796,"about_ca_system_score_codex":0.00001711868,"about_ca_system_score_gemma":0.000015240778,"threshold_uncertainty_score":0.2982683},"labels":[],"label_agreement":null},{"id":"W2944780132","doi":"10.1109/tvt.2019.2915005","title":"Spectral Efficiency of Multipair Massive MIMO Two-Way Relaying With Imperfect CSI","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; State Key Laboratory of Integrated Services Networks; Queen's University; Queen's University Belfast; National Natural Science Foundation of China-Zhejiang Joint Fund for the Integration of Industrialization and Informatization; Leverhulme Trust","keywords":"Relay; MIMO; Spectral efficiency; Topology (electrical circuits); Computer science; Channel (broadcasting); Transmitter power output; Power (physics); Algorithm; Mathematics; Telecommunications; Physics; Combinatorics","score_opus":0.010669104688605982,"score_gpt":0.23868825535001842,"score_spread":0.22801915066141243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944780132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40382588,0.00013667875,0.5941489,0.00081741484,0.00014981396,0.00026274653,0.0000012465711,0.00028367346,0.00037370814],"genre_scores_gemma":[0.9848836,0.000121543235,0.014718705,0.00007749257,0.000006839818,0.000041587886,5.8546686e-7,0.000016103513,0.00013351366],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99866956,0.000101912905,0.0002666083,0.000440123,0.00020687697,0.0003149146],"domain_scores_gemma":[0.9983617,0.00011440619,0.000120665725,0.0011987435,0.00015567479,0.000048796857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018683591,0.00019649016,0.000278457,0.00048800133,0.00020692473,0.000028349777,0.00097283116,0.00014594893,0.000045017605],"category_scores_gemma":[0.000006886344,0.00016722525,0.00010622364,0.0013746844,0.00016942115,0.00019347561,0.000014389804,0.00056748,0.000081776656],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013055908,0.0011987292,0.0015994303,0.00006727398,0.00034671518,0.00007364178,0.0015629607,0.25990236,0.47784635,0.06004058,0.0000480624,0.19718334],"study_design_scores_gemma":[0.0021815277,0.0013208124,0.00028979432,0.0001915801,0.000035105157,0.00010457143,0.00019054039,0.33888364,0.65534145,0.00026289313,0.0007031801,0.0004949063],"about_ca_topic_score_codex":0.000007869949,"about_ca_topic_score_gemma":0.000037376485,"teacher_disagreement_score":0.5810578,"about_ca_system_score_codex":0.00007898874,"about_ca_system_score_gemma":0.000066965906,"threshold_uncertainty_score":0.6819248},"labels":[],"label_agreement":null},{"id":"W2947157180","doi":"10.1007/s11036-019-01266-y","title":"Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks","year":2019,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Medical Research Council; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; RSS; Path loss; Computer network; Overhead (engineering); Base station; Stochastic geometry; Relay; Topology (electrical circuits); Transmission (telecommunications); Wireless network; Wireless; Channel state information; Telecommunications; Mathematics; Statistics","score_opus":0.044128466907866565,"score_gpt":0.2932339009402891,"score_spread":0.24910543403242255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947157180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024260378,0.002858307,0.9900531,0.00013404197,0.00005531182,0.0038080458,0.000007377361,0.00014838816,0.0005093709],"genre_scores_gemma":[0.95946515,0.00069660146,0.03487211,0.00022851252,0.00012968214,0.004396133,0.00008947624,0.00002188084,0.00010047338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832386,0.0001617741,0.0004003101,0.0006131105,0.00012820397,0.00037274946],"domain_scores_gemma":[0.99673396,0.0006620825,0.00015749993,0.0019526667,0.0003382461,0.0001555512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005198135,0.0002252306,0.0003254589,0.00010194229,0.0008268672,0.00026604647,0.0013736017,0.00013075021,0.0000072639823],"category_scores_gemma":[0.000016382377,0.00021436007,0.00008790504,0.0013752653,0.0001993525,0.00027500975,0.00086168776,0.0003435011,0.0000037302896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005583518,0.00021592231,0.000192466,0.000012286277,0.000024779867,2.2181352e-8,0.0000506498,0.7914227,0.000039254603,0.16017579,0.00009426265,0.047766265],"study_design_scores_gemma":[0.00038191097,0.00006882024,0.00017919745,0.000016774253,0.000017430679,0.000005521085,0.000041174393,0.99275935,0.0000031788784,0.0003304607,0.0059436867,0.0002524825],"about_ca_topic_score_codex":0.0000044717353,"about_ca_topic_score_gemma":0.00000618338,"teacher_disagreement_score":0.9570391,"about_ca_system_score_codex":0.00008554725,"about_ca_system_score_gemma":0.0000673059,"threshold_uncertainty_score":0.874135},"labels":[],"label_agreement":null},{"id":"W2949198551","doi":"10.48550/arxiv.0904.0813","title":"Projective Space Codes for the Injection Metric","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear subspace; Subspace topology; Linear code; Finite field; Block code; Metric (unit); Mathematics; Dimension (graph theory); Projective test; Vector space; Discrete mathematics; Context (archaeology); Code (set theory); Computer science; Algorithm; Combinatorics; Pure mathematics; Decoding methods; Mathematical analysis; Set (abstract data type)","score_opus":0.1043246309334404,"score_gpt":0.3334386769356646,"score_spread":0.22911404600222418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949198551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02260525,0.004428819,0.9613222,0.006768585,0.0009781602,0.0013819591,0.0000039648353,0.0002833659,0.0022277306],"genre_scores_gemma":[0.98530865,0.0022904538,0.01032219,0.00063477,0.00028254895,0.00029989422,0.000010211421,0.000014165207,0.0008371365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986253,0.00022920474,0.00023263885,0.0005041489,0.00017464107,0.00023408067],"domain_scores_gemma":[0.9973739,0.00062971754,0.00021922975,0.0013626701,0.00037107532,0.00004345503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007324609,0.00022030663,0.00023184321,0.0001901547,0.00049382984,0.00023283916,0.0017618368,0.00013554729,0.000005870233],"category_scores_gemma":[0.00031468505,0.00016245841,0.00015189902,0.00081946905,0.00005192379,0.00017530318,0.0012934508,0.0005735567,0.000024869672],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087077125,0.00050732767,0.045587115,0.00014264474,0.0006292744,0.0000046857426,0.010382094,0.01803164,0.0007493442,0.14121264,0.027884267,0.7547819],"study_design_scores_gemma":[0.0011366813,0.0006341729,0.40437213,0.0004067177,0.00017076981,0.000023376844,0.00034033792,0.46610782,0.005016796,0.013073416,0.10719471,0.0015230771],"about_ca_topic_score_codex":0.00003130982,"about_ca_topic_score_gemma":0.0000836522,"teacher_disagreement_score":0.9627034,"about_ca_system_score_codex":0.00015298232,"about_ca_system_score_gemma":0.00017801368,"threshold_uncertainty_score":0.6624862},"labels":[],"label_agreement":null},{"id":"W2949262666","doi":"10.48550/arxiv.1202.3468","title":"Partially-blind Estimation of Reciprocal Channels for AF Two-Way Relay Networks Employing M-PSK Modulation","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Channel (broadcasting); Relay; Cramér–Rao bound; Reciprocal; Statistics; Signal-to-noise ratio (imaging); Mathematics; Upper and lower bounds; Unbiased Estimation; Modulation (music); Algorithm; Maximum likelihood; Variance (accounting); Computer science; Applied mathematics; Telecommunications; Physics; Mathematical analysis","score_opus":0.16156698050365606,"score_gpt":0.25549026582330925,"score_spread":0.09392328531965319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949262666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07998829,0.00025949642,0.9177346,0.000092931805,0.00085752545,0.00066215894,0.00000403619,0.00014627408,0.0002546469],"genre_scores_gemma":[0.9846063,0.00034333815,0.014426873,0.00004388738,0.00020538332,0.0000101332025,0.00007094141,0.000022158407,0.00027094534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820393,0.00026937452,0.00038991874,0.0006753243,0.000101590755,0.00035984788],"domain_scores_gemma":[0.9974446,0.00027486667,0.00052126346,0.0012331313,0.00038667387,0.00013943492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073554344,0.00027993845,0.00036903343,0.00022662507,0.0002903153,0.000106320316,0.001293526,0.00027147125,0.000013788685],"category_scores_gemma":[0.00008284406,0.0003298055,0.00020335063,0.00059033,0.00007909727,0.0006387073,0.0014025887,0.00044614362,0.00000999108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055147713,0.000060442188,0.00036791043,0.000032207587,0.0000458689,0.0000013983278,0.00040055986,0.9061405,0.000031472475,0.07930889,0.000067945024,0.0134876445],"study_design_scores_gemma":[0.00080167,0.00003962866,0.00055374,0.00016733336,0.000053629472,0.0000010260063,0.000011834325,0.99249554,0.00016891082,0.0051648645,0.00021771793,0.00032407866],"about_ca_topic_score_codex":0.000018181745,"about_ca_topic_score_gemma":0.000036032663,"teacher_disagreement_score":0.904618,"about_ca_system_score_codex":0.0001688151,"about_ca_system_score_gemma":0.00010193899,"threshold_uncertainty_score":0.9999154},"labels":[],"label_agreement":null},{"id":"W2949594003","doi":"10.48550/arxiv.1301.5973","title":"Non-Adaptive Distributed Compression in Networks","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Encoder; Packet forwarding; Network packet; Computer network; Distributed source coding; Coding (social sciences); Linear network coding; Node (physics); Distortion (music); Distributed computing; Algorithm; Decoding methods; Mathematics; Bandwidth (computing); Channel code; Engineering","score_opus":0.09107466718402324,"score_gpt":0.2058662925749397,"score_spread":0.11479162539091647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949594003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0631572,0.0002296791,0.9336354,0.00013745733,0.00037828242,0.0003980869,0.0000054317948,0.0001517759,0.0019066478],"genre_scores_gemma":[0.9970176,0.0013011779,0.0010915545,0.00010321832,0.000046556448,0.000003747121,0.000052195566,0.000011902681,0.00037204011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998269,0.00026012308,0.00023731837,0.00082110765,0.000064193344,0.0003482531],"domain_scores_gemma":[0.9977894,0.0001337496,0.00021802602,0.0015175339,0.0001956132,0.00014567561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021264958,0.00029198782,0.00034589524,0.00020118132,0.00017590092,0.0001516944,0.0025543752,0.00027364487,0.000044692402],"category_scores_gemma":[0.000014233987,0.0003229022,0.00012049173,0.0008511734,0.000089667206,0.00038812906,0.0048886733,0.0010086775,0.000066587716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016713631,0.000107325905,0.0028922886,0.0000104415585,0.000031084106,0.00006791784,0.00020891125,0.89429575,0.00001387301,0.09774953,0.0016938993,0.0029122762],"study_design_scores_gemma":[0.000402341,0.000023597411,0.008020139,0.00022229613,0.000008454957,8.7933006e-7,0.000027537528,0.9855287,0.000015983835,0.00497387,0.00043004035,0.00034616268],"about_ca_topic_score_codex":0.000095166215,"about_ca_topic_score_gemma":0.000115263916,"teacher_disagreement_score":0.9338604,"about_ca_system_score_codex":0.0002655579,"about_ca_system_score_gemma":0.000101531754,"threshold_uncertainty_score":0.9999223},"labels":[],"label_agreement":null},{"id":"W2949595888","doi":"10.48550/arxiv.1105.6288","title":"Analysis of Overlapped Chunked Codes with Small Chunks over Line Networks","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Network packet; Computer science; Line (geometry); Constant (computer programming); Convergence (economics); Transmission (telecommunications); Algorithm; Mathematics; Computer network; Telecommunications","score_opus":0.11786282847091997,"score_gpt":0.20733683602978628,"score_spread":0.08947400755886631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949595888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18383475,0.00021267438,0.81149423,0.000023466524,0.000109603236,0.00020593996,0.00000857863,0.00013663503,0.0039741453],"genre_scores_gemma":[0.9930273,0.0014081452,0.004549053,0.00009187203,0.00003344291,0.0000014795796,0.000055102522,0.000016491764,0.00081711105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808687,0.00026163668,0.0003288319,0.00091385824,0.00009060184,0.00031821063],"domain_scores_gemma":[0.9963034,0.00015810334,0.00053826574,0.0024738081,0.000372182,0.00015423633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034502178,0.00035313366,0.0007173126,0.0005756345,0.0001738117,0.00007975407,0.0026737482,0.0002610321,0.00011360958],"category_scores_gemma":[0.000017587312,0.00035196618,0.00034168974,0.0025914845,0.0001751216,0.0002041661,0.0027031843,0.00063653925,0.0000055930686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118355485,0.00023341416,0.014609475,0.0000327442,0.00254248,0.000042205596,0.00079998164,0.84416586,0.0000505811,0.13385929,0.00006522107,0.0034803767],"study_design_scores_gemma":[0.0004527457,0.000070000424,0.015010783,0.000103789425,0.0007982123,5.6252225e-7,0.000022493325,0.9821276,0.000062817286,0.00073552807,0.00018589955,0.0004295417],"about_ca_topic_score_codex":0.00009119337,"about_ca_topic_score_gemma":0.0013113198,"teacher_disagreement_score":0.80919254,"about_ca_system_score_codex":0.00010375382,"about_ca_system_score_gemma":0.00016508998,"threshold_uncertainty_score":0.99989325},"labels":[],"label_agreement":null},{"id":"W2949682505","doi":"10.48550/arxiv.1301.2180","title":"The Streaming-DMT of Fading Channels","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Fading; Computer science; Interleaving; Decoding methods; Algorithm; Encoder; Coherence time; MIMO; Channel (broadcasting); Transmission (telecommunications); Coding (social sciences); Coherence (philosophical gambling strategy); Mathematics; Computer network; Telecommunications","score_opus":0.1077615332940805,"score_gpt":0.2075596769775576,"score_spread":0.09979814368347709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949682505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.255335,0.000895594,0.7315258,0.00060915074,0.0011497766,0.00049443677,0.000003767393,0.00021219272,0.009774277],"genre_scores_gemma":[0.994408,0.0026807531,0.00050585764,0.00004141306,0.00004636362,0.0000015570963,0.0000033031083,0.000008653881,0.00230407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880844,0.00021508928,0.00019759324,0.00046706843,0.00007135601,0.00024042359],"domain_scores_gemma":[0.9973879,0.00030349582,0.00028384378,0.001674649,0.0002686968,0.000081402184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030295618,0.00018920287,0.000217279,0.00011224882,0.00035800107,0.0001687712,0.003175561,0.00011762853,0.000022320326],"category_scores_gemma":[0.000044804143,0.00016643679,0.00013924143,0.00045494348,0.00013959156,0.00023642946,0.0037187855,0.00043060892,0.000043009295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005488667,0.000047735975,0.00048382225,0.000027225064,0.00009755418,0.00001178103,0.00092395674,0.098906286,0.00010845072,0.88237804,0.000985107,0.016024578],"study_design_scores_gemma":[0.00020020772,0.000029718769,0.0005985987,0.00014340921,0.000019352932,0.0000013103022,0.00010568561,0.969844,0.00036679037,0.02452338,0.0038760258,0.00029156415],"about_ca_topic_score_codex":0.00003641075,"about_ca_topic_score_gemma":0.000028856239,"teacher_disagreement_score":0.87093765,"about_ca_system_score_codex":0.00008725583,"about_ca_system_score_gemma":0.000103281396,"threshold_uncertainty_score":0.6787095},"labels":[],"label_agreement":null},{"id":"W2949900601","doi":"10.48550/arxiv.1202.0343","title":"How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Lossless compression; Bernoulli's principle; Computer science; Coding (social sciences); Linear network coding; Poisson distribution; Line (geometry); Algorithm; Mathematics; Mathematical optimization; Data compression; Computer network; Statistics; Engineering","score_opus":0.1236487908683867,"score_gpt":0.2037680314800931,"score_spread":0.08011924061170639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949900601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15547094,0.00050290953,0.84028876,0.002054952,0.00054005533,0.0003249786,0.00001752858,0.00011279117,0.0006870833],"genre_scores_gemma":[0.9951344,0.0020143325,0.000893988,0.000212998,0.00014657852,0.000001482347,0.000014193236,0.000013599791,0.001568427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982385,0.00055117573,0.00019902794,0.00055082183,0.00009711579,0.00036337966],"domain_scores_gemma":[0.9966659,0.0003051497,0.00038677026,0.0021444499,0.0003428888,0.00015487491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048808812,0.00030269727,0.00036575037,0.000116268166,0.00032887197,0.00017909624,0.003151194,0.00020517576,0.000012105753],"category_scores_gemma":[0.000048954775,0.0002389141,0.0002081187,0.00063184486,0.00031953678,0.00027999002,0.0034873637,0.00084220106,0.0000061432784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008505168,0.00042500792,0.0064954953,0.000115253024,0.0005439401,0.000050509865,0.0053925933,0.45773682,0.00043640577,0.50755745,0.001979397,0.019182095],"study_design_scores_gemma":[0.00041751098,0.000060000057,0.0018227315,0.00017742564,0.00012155437,0.000008522467,0.00022681511,0.9897881,0.0006026087,0.003709163,0.0024490058,0.0006165252],"about_ca_topic_score_codex":0.00008096145,"about_ca_topic_score_gemma":0.0009228023,"teacher_disagreement_score":0.83966345,"about_ca_system_score_codex":0.00013240188,"about_ca_system_score_gemma":0.000116687275,"threshold_uncertainty_score":0.9742634},"labels":[],"label_agreement":null},{"id":"W2949909152","doi":"10.1109/tcomm.2019.2922255","title":"Dual-Band Fading Multiple Access Relay Channels","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Telecommunications link; Computer science; Channel (broadcasting); Fading; Transmission (telecommunications); Microwave; Microwave transmission; Antenna (radio); Telecommunications; Path loss; Transmitter power output; Electronic engineering; Power (physics); Computer network; Physics; Wireless; Engineering; Transmitter","score_opus":0.12645867850581136,"score_gpt":0.3469772734044358,"score_spread":0.22051859489862444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949909152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096413994,0.0013718201,0.97701097,0.008157967,0.0027262392,0.0010929628,0.00006409388,0.00068067986,0.007931131],"genre_scores_gemma":[0.9691169,0.012974122,0.014391237,0.0006191157,0.00006633208,0.00063680764,0.000056768542,0.000056480727,0.0020821816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968356,0.00077945733,0.00072552287,0.0008246707,0.0003946837,0.0004400714],"domain_scores_gemma":[0.9868629,0.0013566104,0.00037691844,0.010801684,0.0004186762,0.00018323556],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005829139,0.00049774547,0.00052239065,0.0005678937,0.0014161831,0.0010949901,0.0093709845,0.0003810056,0.00008037873],"category_scores_gemma":[0.000035033925,0.000545419,0.00035941962,0.0008967423,0.00018997511,0.00078590505,0.00050383504,0.0025583273,0.000341326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031316307,0.0015824904,0.0000941534,0.0001438353,0.0005538582,0.000005027294,0.006165737,0.8796561,0.0012100611,0.009769534,0.00604599,0.09474192],"study_design_scores_gemma":[0.00088400865,0.00008118214,0.00019363365,0.00074028876,0.00008587696,0.000018198105,0.000062520565,0.9553143,0.0067210486,0.001332601,0.033419434,0.0011469135],"about_ca_topic_score_codex":0.000061517516,"about_ca_topic_score_gemma":0.0004474073,"teacher_disagreement_score":0.9681528,"about_ca_system_score_codex":0.0002966856,"about_ca_system_score_gemma":0.00034730328,"threshold_uncertainty_score":0.99994195},"labels":[],"label_agreement":null},{"id":"W2950008640","doi":"10.48550/arxiv.1104.3165","title":"Dynamic Packet Scheduler Optimization in Wireless Relay Networks","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Computer science; Queue; Network packet; Relay; Computer network; Scheduling (production processes); Wireless network; Wireless; Overhead (engineering); Distributed computing; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.07609098518466612,"score_gpt":0.2025522077669647,"score_spread":0.12646122258229858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950008640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04495432,0.00023746009,0.9505934,0.000102158796,0.00044375737,0.0002698732,0.0000014623365,0.00020068853,0.0031968467],"genre_scores_gemma":[0.98497134,0.005127471,0.009052505,0.00011328118,0.000020308697,0.0000024441438,0.000035565175,0.00002027742,0.00065682345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808985,0.00038140648,0.00025797423,0.000878392,0.000059142545,0.00033326042],"domain_scores_gemma":[0.99771476,0.000084503816,0.00023880842,0.0016700419,0.00017424522,0.00011765778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036481544,0.00029038006,0.0003107289,0.00031415463,0.00015840308,0.00011734357,0.0022926023,0.00033855365,0.00006842661],"category_scores_gemma":[0.000019903924,0.0003505778,0.00011822575,0.0009810656,0.00009168713,0.0004311576,0.0028956241,0.00094404706,0.00003279758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109061375,0.00006321542,0.0011274233,0.000009424123,0.000021616032,0.00003890377,0.00018059132,0.8863513,0.0000024267752,0.11065386,0.00005359142,0.00148678],"study_design_scores_gemma":[0.00033898352,0.00001718405,0.0011459541,0.00015902963,0.000013596294,0.0000016540886,0.000018420273,0.9955423,0.000005792478,0.0023287777,0.000053408763,0.0003748951],"about_ca_topic_score_codex":0.000029239054,"about_ca_topic_score_gemma":0.00024911753,"teacher_disagreement_score":0.94154096,"about_ca_system_score_codex":0.00028868308,"about_ca_system_score_gemma":0.00013919579,"threshold_uncertainty_score":0.9998946},"labels":[],"label_agreement":null},{"id":"W2950145954","doi":"","title":"Lattice Sequential Decoder for Coded MIMO Channel: Performance and Complexity Analysis","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Computational complexity theory; Algorithm; Computer science; Lattice (music); MIMO; Channel (broadcasting); Mathematics; Coding (social sciences); Telecommunications; Statistics; Physics","score_opus":0.2481102086920672,"score_gpt":0.24430222303387764,"score_spread":0.003807985658189572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950145954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17823827,0.0001318144,0.8193885,0.00010002796,0.00019805526,0.00030903716,0.000016232209,0.00013616249,0.0014818701],"genre_scores_gemma":[0.98980933,0.0013340722,0.007851759,0.00014038042,0.00003875984,0.0000036576173,0.000042656695,0.00001140628,0.0007679599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998441,0.00017653286,0.00020153192,0.00083476905,0.00005827519,0.00028790976],"domain_scores_gemma":[0.9979692,0.000120224555,0.0002250618,0.0012328512,0.00030827365,0.00014439212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003648,0.0002583822,0.0003973796,0.00031033432,0.00040324026,0.00013477865,0.00154729,0.00016421064,0.00003726745],"category_scores_gemma":[0.000019227891,0.00029748524,0.00021581362,0.0007546039,0.0001773304,0.0003399814,0.0024299207,0.00034083187,0.000011309349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019643651,0.0003039047,0.008339618,0.00029837433,0.0025061043,0.000030625597,0.003438917,0.11971361,0.000052241074,0.85953397,0.00080546393,0.0047807395],"study_design_scores_gemma":[0.00040481437,0.000037568738,0.003520907,0.000032995067,0.00035728098,0.0000013272376,0.00002133531,0.9837075,0.000098367476,0.0109475,0.0005134191,0.00035699637],"about_ca_topic_score_codex":0.000048074085,"about_ca_topic_score_gemma":0.00036051494,"teacher_disagreement_score":0.8639939,"about_ca_system_score_codex":0.00008705203,"about_ca_system_score_gemma":0.0000886449,"threshold_uncertainty_score":0.9999477},"labels":[],"label_agreement":null},{"id":"W2950313419","doi":"","title":"Compute-and-Forward Protocol Design Based on Improved Sphere Decoding","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cholesky decomposition; Algorithm; Decoding methods; Computer science; Mathematical optimization; Mathematics","score_opus":0.11753731424432347,"score_gpt":0.2300341126308521,"score_spread":0.11249679838652864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950313419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008470255,0.000008989645,0.9823154,0.00021519218,0.00016965173,0.013740912,0.000001480411,0.0003120382,0.0023892717],"genre_scores_gemma":[0.95584047,0.00003843552,0.042421952,0.0006254776,0.00007012087,0.0005624089,0.0000055024334,0.000025611384,0.00041003778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976792,0.00060414127,0.00024238414,0.0010487069,0.00009141384,0.00033419853],"domain_scores_gemma":[0.9971368,0.00042048216,0.00028479533,0.0017609894,0.00019197367,0.00020501546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006038679,0.00037777366,0.00037634268,0.00019285035,0.000362475,0.00028597395,0.0021597343,0.00022973484,0.000037742124],"category_scores_gemma":[0.00005464006,0.00040550568,0.00014851401,0.00040983027,0.00009504598,0.00019873782,0.0023122572,0.0007032309,0.000041245192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012973181,0.00016773712,0.000527767,0.00014718037,0.00006792502,0.000044056604,0.00015869949,0.8539836,0.00008214624,0.10978726,0.0011633096,0.0337406],"study_design_scores_gemma":[0.0009267273,0.00014502919,0.00018714677,0.0002202605,0.000016538079,0.0000011162624,0.0000055511464,0.99158627,0.00014878974,0.0030990068,0.0032211428,0.00044242968],"about_ca_topic_score_codex":0.00001007819,"about_ca_topic_score_gemma":0.000018734265,"teacher_disagreement_score":0.9549934,"about_ca_system_score_codex":0.00018505151,"about_ca_system_score_gemma":0.00023686585,"threshold_uncertainty_score":0.99983966},"labels":[],"label_agreement":null},{"id":"W2950382491","doi":"10.48550/arxiv.1807.03422","title":"Capacity of Two-Way Channels with Symmetry Properties","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Channel (broadcasting); Symmetry (geometry); Ergodic theory; Coding (social sciences); Channel capacity; Ergodicity; Computer science; Mathematics; Topology (electrical circuits); Statistical physics; Physics; Telecommunications; Combinatorics; Statistics; Pure mathematics","score_opus":0.15452558868825159,"score_gpt":0.20382757640131838,"score_spread":0.04930198771306679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950382491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58897555,0.0001476715,0.40591356,0.000119202945,0.00030595512,0.00025308787,0.0000037429402,0.0001448127,0.004136432],"genre_scores_gemma":[0.9961046,0.000316169,0.002650153,0.00006918832,0.0000685779,0.0000013152285,0.0000030805977,0.000012374823,0.00077456783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985866,0.00023971534,0.00018082527,0.0006549905,0.00009776729,0.0002400949],"domain_scores_gemma":[0.99740744,0.00005367836,0.0002666175,0.0016742335,0.0004957626,0.00010227779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028047626,0.0002508054,0.00033040543,0.00020769992,0.00018463325,0.00008599838,0.002241757,0.00012147099,0.000025745134],"category_scores_gemma":[0.000023567287,0.0002256011,0.000102046586,0.0006663622,0.00033789873,0.00030673193,0.0024654781,0.00042184608,0.000028835095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012207472,0.00042187845,0.0073141987,0.00033194458,0.00047957795,0.00006876762,0.0037275967,0.096061476,0.0011802262,0.88580036,0.00077625306,0.0037156376],"study_design_scores_gemma":[0.0011748009,0.0003130552,0.0012621036,0.0010157732,0.00009070746,0.000010854955,0.00010151972,0.96617824,0.012003181,0.015863445,0.00096010225,0.0010262281],"about_ca_topic_score_codex":0.00006081816,"about_ca_topic_score_gemma":0.00008000351,"teacher_disagreement_score":0.8701168,"about_ca_system_score_codex":0.00010494194,"about_ca_system_score_gemma":0.00014998185,"threshold_uncertainty_score":0.9199746},"labels":[],"label_agreement":null},{"id":"W2950412691","doi":"10.48550/arxiv.1207.6667","title":"Relay Selection for OFDM Wireless Systems under Asymmetric Information: A Contract-Theory Based Approach","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Computer network; Heuristic; Knapsack problem; Wireless; Relay channel; Mathematical optimization; Contract theory; Subcarrier; Selection (genetic algorithm); Overhead (engineering); Orthogonal frequency-division multiplexing; Channel (broadcasting); Telecommunications; Mathematics; Algorithm","score_opus":0.09390661672228812,"score_gpt":0.20619712312320682,"score_spread":0.1122905064009187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950412691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058231894,0.00030041175,0.98800534,0.000070244016,0.0006668624,0.0008883271,0.000010437891,0.0002838383,0.00395134],"genre_scores_gemma":[0.99509096,0.00018014477,0.0036187095,0.00021694036,0.0001000481,0.000020309666,0.00008391402,0.000014452389,0.000674542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982551,0.00048597698,0.00031531666,0.0004779394,0.000112277994,0.0003534119],"domain_scores_gemma":[0.99731755,0.00049152656,0.0004438541,0.0010237019,0.0005649623,0.00015839661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010677435,0.00028774005,0.0003402889,0.00052986323,0.00038581615,0.0003137506,0.0014710302,0.00032433204,0.000009326597],"category_scores_gemma":[0.00005637255,0.00032118786,0.00018579226,0.0012676163,0.00006108691,0.0011254114,0.0006958028,0.000565351,0.000034993893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029054241,0.00007133718,0.00020695533,0.000083601764,0.000059378497,3.643832e-7,0.00013277166,0.39780533,0.0000045164934,0.59908813,0.00020929288,0.0023092479],"study_design_scores_gemma":[0.0007155735,0.000034015513,0.00036729084,0.00006718871,0.00006223795,0.0000034280072,0.00006669514,0.9940482,0.000027837747,0.00096165895,0.0032694307,0.00037646966],"about_ca_topic_score_codex":0.000024261657,"about_ca_topic_score_gemma":0.000007507166,"teacher_disagreement_score":0.98926777,"about_ca_system_score_codex":0.00042520196,"about_ca_system_score_gemma":0.00029431412,"threshold_uncertainty_score":0.999924},"labels":[],"label_agreement":null},{"id":"W2950444413","doi":"10.48550/arxiv.0903.2426","title":"Relay Selection and Power Allocation in Cooperative Cellular Networks","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Selection (genetic algorithm); Power (physics); Computer science; Computer network; Telecommunications; Operations research; Engineering; Artificial intelligence","score_opus":0.03669430018687385,"score_gpt":0.2698758269631759,"score_spread":0.23318152677630205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950444413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5656368,0.0036081844,0.42696142,0.0018756093,0.00037136913,0.00042437142,4.0497474e-7,0.00015641842,0.00096540834],"genre_scores_gemma":[0.99291134,0.0033830355,0.0026660506,0.00062522356,0.000088481866,0.000046143312,0.00002472212,0.000014156316,0.00024086995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981128,0.00043987017,0.00038251976,0.00065493264,0.00014549606,0.00026438225],"domain_scores_gemma":[0.99867535,0.000094754294,0.00017045253,0.0007455893,0.00023214825,0.000081738974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005806565,0.00026857405,0.00028669357,0.00016899299,0.00020449035,0.00020055797,0.00072832237,0.00026969865,0.000019624727],"category_scores_gemma":[0.00006349412,0.0002776752,0.000048913167,0.00055454223,0.00004295039,0.00030766727,0.0009430333,0.0010200107,0.000020234465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000709505,0.00070464663,0.25112286,0.00006773802,0.00018597693,0.000047228405,0.009911015,0.5741238,0.0088740215,0.061589215,0.0035665778,0.08973595],"study_design_scores_gemma":[0.00044739342,0.000121763274,0.18737093,0.00028719354,0.000011662047,0.000006766416,0.000029655701,0.80681914,0.0011792958,0.00030369946,0.0028335643,0.0005889573],"about_ca_topic_score_codex":0.000018839817,"about_ca_topic_score_gemma":0.00019580433,"teacher_disagreement_score":0.42727453,"about_ca_system_score_codex":0.00015401763,"about_ca_system_score_gemma":0.000115602415,"threshold_uncertainty_score":0.9999675},"labels":[],"label_agreement":null},{"id":"W2950648517","doi":"10.48550/arxiv.1203.1892","title":"Restricted Isometry Property in Quantized Network Coding of Sparse Messages","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Restricted isometry property; Linear network coding; Decoding methods; Gaussian; Coding (social sciences); Compressed sensing; Matrix (chemical analysis); Algorithm; Distributed source coding; Mathematics; Computer science; Property (philosophy); Theoretical computer science; Discrete mathematics; Combinatorics; Channel code; Physics; Statistics; Computer network","score_opus":0.16140896607884714,"score_gpt":0.229438336164274,"score_spread":0.06802937008542687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950648517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36503428,0.0026295308,0.6188102,0.00033215535,0.001084531,0.0009175334,0.0000071739755,0.0003539191,0.010830712],"genre_scores_gemma":[0.9906415,0.0053130365,0.0030374706,0.000052141277,0.000063898624,0.0000016858735,0.000010335988,0.000014757159,0.0008651915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978232,0.0006137605,0.0003775543,0.00065154064,0.000105001745,0.00042894107],"domain_scores_gemma":[0.9973728,0.00027058306,0.00040321774,0.0016212327,0.00020653114,0.00012565474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000609443,0.00027897794,0.00050865987,0.00040204302,0.00013929953,0.00006652395,0.0023905071,0.00024464726,0.000038732498],"category_scores_gemma":[0.00009750255,0.0002587476,0.00014638805,0.002181921,0.00011151274,0.00039256434,0.0035827968,0.0007658926,0.000018709992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017010071,0.0006411668,0.089720406,0.00027493582,0.00023974845,0.00014937264,0.0015340936,0.287391,0.0007939717,0.6075433,0.0026052352,0.0089366855],"study_design_scores_gemma":[0.0015297702,0.000057486457,0.037190706,0.0010613031,0.00007020154,0.0000037667903,0.00010090903,0.9507093,0.00030448384,0.005512144,0.002521594,0.0009383531],"about_ca_topic_score_codex":0.00009058992,"about_ca_topic_score_gemma":0.00012275751,"teacher_disagreement_score":0.6633183,"about_ca_system_score_codex":0.00016664696,"about_ca_system_score_gemma":0.0001841775,"threshold_uncertainty_score":0.99998647},"labels":[],"label_agreement":null},{"id":"W2950742089","doi":"10.48550/arxiv.0710.5194","title":"Rate-Constrained Wireless Networks with Fading Channels: Interference-Limited and Noise-Limited Regimes","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Australian Government","keywords":"Fading; Interference (communication); Wireless; Computer science; Noise (video); Wireless network; Computer network; Telecommunications; Channel (broadcasting); Artificial intelligence","score_opus":0.0671857399912797,"score_gpt":0.2772221780915112,"score_spread":0.21003643810023148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950742089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5402642,0.0015518998,0.4533205,0.0013335218,0.0007091623,0.00050188747,0.0000024065507,0.00045008102,0.0018663559],"genre_scores_gemma":[0.99114627,0.0033811035,0.0035754475,0.00094123353,0.00026885318,0.00007182335,0.000055085216,0.000047787024,0.00051238347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968845,0.00042549553,0.00061364257,0.0011698876,0.00023316781,0.0006733023],"domain_scores_gemma":[0.9964941,0.0005356488,0.00045656474,0.001789,0.00044882623,0.00027582713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009446037,0.0006295733,0.00067749206,0.00038723473,0.00043573396,0.000559628,0.0020304148,0.00039490257,0.000025704665],"category_scores_gemma":[0.00008882625,0.0005571038,0.00010965853,0.0008911214,0.00033929423,0.00038711843,0.0030147568,0.0015410156,0.00001691382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008763213,0.0009339714,0.37376162,0.0006790816,0.0023192582,0.0006230717,0.027445706,0.06014059,0.0045614475,0.042934567,0.004672286,0.48105207],"study_design_scores_gemma":[0.0017116949,0.00030077726,0.053934857,0.0028123613,0.00009392252,0.00007955975,0.0003239512,0.9349199,0.0016313024,0.00026374517,0.0019908028,0.001937138],"about_ca_topic_score_codex":0.000022708087,"about_ca_topic_score_gemma":0.000070655406,"teacher_disagreement_score":0.8747793,"about_ca_system_score_codex":0.0001122319,"about_ca_system_score_gemma":0.00017510563,"threshold_uncertainty_score":0.999688},"labels":[],"label_agreement":null},{"id":"W2950764461","doi":"10.48550/arxiv.0810.4366","title":"Resource Allocation and Relay Selection for Collaborative Communications","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Selection (genetic algorithm); Resource allocation; Computer science; Resource (disambiguation); Operations research; Telecommunications; Computer network; Artificial intelligence; Engineering","score_opus":0.11013275306416427,"score_gpt":0.3194014786671567,"score_spread":0.20926872560299242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950764461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20953222,0.010153132,0.73490435,0.034467366,0.0005280877,0.0028703285,0.00002761369,0.00079987274,0.006717045],"genre_scores_gemma":[0.9195258,0.017606778,0.06062263,0.00067392323,0.00011070219,0.00052681676,0.00014690535,0.000025273548,0.0007611648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983905,0.00038977663,0.00035887153,0.00052505196,0.00013641946,0.00019940278],"domain_scores_gemma":[0.99668473,0.00042431007,0.00029389048,0.0018681184,0.00064514787,0.000083809355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042356402,0.00022480349,0.0002537478,0.00013800416,0.0008620605,0.00015117164,0.0015943149,0.00020007766,0.000002647349],"category_scores_gemma":[0.00019107455,0.00024275719,0.00006372062,0.0005321005,0.00015647456,0.00024758198,0.0022441393,0.0005605346,0.0000132116],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017958511,0.001248609,0.17082635,0.00041547767,0.000978382,0.000003816403,0.053481665,0.015281004,0.008680985,0.41296092,0.09264355,0.24329968],"study_design_scores_gemma":[0.00088075094,0.0001814228,0.04179166,0.0002919136,0.000052984746,0.000020310392,0.00022470641,0.452342,0.0015274527,0.00084443606,0.5009678,0.00087459816],"about_ca_topic_score_codex":0.000012208053,"about_ca_topic_score_gemma":0.0001297727,"teacher_disagreement_score":0.7099936,"about_ca_system_score_codex":0.00013487709,"about_ca_system_score_gemma":0.00026105516,"threshold_uncertainty_score":0.9899351},"labels":[],"label_agreement":null},{"id":"W2950917396","doi":"10.48550/arxiv.0711.1565","title":"Channel Code Design with Causal Side Information at the Encoder","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Channel (broadcasting); Binary symmetric channel; Encoder; Interference (communication); Binary erasure channel; Code (set theory); Computer science; Hamming code; Binary number; Additive white Gaussian noise; Hamming distance; Algorithm; Linear code; Hamming(7,4); Binary code; Systematic code; Decoding methods; Mathematics; Telecommunications; Block code; Code rate; Channel capacity; Arithmetic","score_opus":0.1099628226472358,"score_gpt":0.2946685828778101,"score_spread":0.18470576023057433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950917396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03302933,0.0005808419,0.95849514,0.0031561116,0.00040038853,0.0005461007,0.0000035478638,0.00019860308,0.0035899652],"genre_scores_gemma":[0.9869188,0.0009951191,0.0076405955,0.0031115029,0.00013500811,0.00011438653,0.000045880784,0.000017427128,0.0010212925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843544,0.0002471462,0.00035784952,0.00031744773,0.00032626593,0.00031586975],"domain_scores_gemma":[0.9973738,0.00030482493,0.000286585,0.0016469558,0.00030040293,0.00008739168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000913862,0.00026390544,0.00020731098,0.00011095026,0.0004898943,0.00023412409,0.001777003,0.00014976316,0.000029733057],"category_scores_gemma":[0.000066944944,0.00017802419,0.00006095062,0.0003301331,0.000111312,0.00052763656,0.0026522174,0.0006688228,0.0002974663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005227284,0.00048910646,0.06197694,0.0003381897,0.0010454536,0.00010725721,0.081608616,0.55108887,0.0013495208,0.02818579,0.08236227,0.19092526],"study_design_scores_gemma":[0.0018831048,0.00037427712,0.14734244,0.0008503853,0.00010912653,0.00013563568,0.0003871161,0.6754384,0.01617956,0.0015840186,0.15318853,0.0025274046],"about_ca_topic_score_codex":0.000024882242,"about_ca_topic_score_gemma":0.00032023326,"teacher_disagreement_score":0.9538895,"about_ca_system_score_codex":0.0001752048,"about_ca_system_score_gemma":0.00017846422,"threshold_uncertainty_score":0.72596157},"labels":[],"label_agreement":null},{"id":"W2950930478","doi":"10.48550/arxiv.1504.02886","title":"Fundamental Relations Between Reactive and Proactive Relay-Selection Strategies","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Selection (genetic algorithm); Relay channel; Equivalence (formal languages); Computer science; Channel (broadcasting); Additive white Gaussian noise; Computer network; Topology (electrical circuits); Telecommunications; Mathematics; Artificial intelligence; Discrete mathematics; Power (physics)","score_opus":0.16216284456446015,"score_gpt":0.23643648146673876,"score_spread":0.07427363690227862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950930478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48840204,0.00022213552,0.49732053,0.000264342,0.00017606902,0.00045746053,0.000012942453,0.00028298082,0.0128615005],"genre_scores_gemma":[0.996474,0.00026245552,0.0020088225,0.000019009718,0.00006133916,0.0000028612687,0.000029626766,0.000011482262,0.00113036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984987,0.0003317366,0.00016363284,0.0007244976,0.00008003003,0.00020140552],"domain_scores_gemma":[0.9985595,0.00014846036,0.00022348901,0.0006154085,0.00030668871,0.00014649982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030678243,0.00023242412,0.00023823856,0.00021097057,0.0003549815,0.00026135464,0.0007398338,0.0002105662,0.000012084648],"category_scores_gemma":[0.000032314256,0.0002716424,0.00006807342,0.00054820406,0.00013385115,0.0010345876,0.0017039824,0.00079979445,0.000029889425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006260474,0.00018113878,0.04125661,0.000033380198,0.0005720682,0.000033563836,0.005914951,0.08568507,0.00014124821,0.8580888,0.0013308927,0.006699654],"study_design_scores_gemma":[0.0012149157,0.0002837408,0.070972376,0.00020482413,0.0002298843,0.000012905503,0.0020959498,0.8121061,0.00019391142,0.10861591,0.0028347766,0.0012347258],"about_ca_topic_score_codex":0.000059839014,"about_ca_topic_score_gemma":0.00010662629,"teacher_disagreement_score":0.7494729,"about_ca_system_score_codex":0.00048633557,"about_ca_system_score_gemma":0.00041732265,"threshold_uncertainty_score":0.9999736},"labels":[],"label_agreement":null},{"id":"W2951065246","doi":"10.48550/arxiv.cs/0703151","title":"Asymptotic Analysis of Amplify and Forward Relaying in a Parallel MIMO Relay Network","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"MIMO; Relay; Beamforming; Transmitter; Multiplexing; Topology (electrical circuits); Asymptotic analysis; Mathematics; Power (physics); Computer science; Telecommunications; Electronic engineering; Combinatorics; Physics; Mathematical analysis; Engineering; Channel (broadcasting)","score_opus":0.06912831777218892,"score_gpt":0.31298081034409475,"score_spread":0.24385249257190583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951065246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7031309,0.0054726005,0.28881726,0.0005511893,0.00025035653,0.00029261003,0.0000020098557,0.000085491345,0.0013975794],"genre_scores_gemma":[0.97271883,0.0043675974,0.022292553,0.00037034936,0.000059140195,0.000028122011,0.00002539367,0.00001535281,0.00012268394],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9976043,0.00030900957,0.0007574823,0.0006881767,0.0002386429,0.00040237597],"domain_scores_gemma":[0.9971738,0.0005365731,0.0004080343,0.0016248561,0.00014186735,0.000114875125],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014339658,0.00028134175,0.0007290091,0.00058623106,0.00014071126,0.000088882756,0.001333289,0.0002883024,0.000017960465],"category_scores_gemma":[0.00012846189,0.00028595238,0.00020108475,0.0020187832,0.0000928214,0.00015576786,0.00277209,0.000941924,0.00000894021],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013000649,0.00005441028,0.88060653,0.00003450162,0.00046937697,0.000011212719,0.0012985475,0.10315609,0.00002897988,0.0067433654,0.0001792215,0.0074047833],"study_design_scores_gemma":[0.00028448936,0.000028483431,0.77089095,0.00026683405,0.00019421276,0.0000018387068,0.00002792046,0.22632705,0.000011088938,0.0005044805,0.001110915,0.00035175725],"about_ca_topic_score_codex":0.00006287894,"about_ca_topic_score_gemma":0.00054969214,"teacher_disagreement_score":0.2695879,"about_ca_system_score_codex":0.00009565674,"about_ca_system_score_gemma":0.00008843774,"threshold_uncertainty_score":0.9999593},"labels":[],"label_agreement":null},{"id":"W2951360543","doi":"10.48550/arxiv.1403.5331","title":"Differential Amplify-and-Forward Relaying in Time-Varying Rayleigh Fading Channels","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Fading; Rayleigh fading; Maximal-ratio combining; Algorithm; Signal-to-noise ratio (imaging); Channel (broadcasting); Bit error rate; Mathematics; Computer science; Differential (mechanical device); Fading distribution; Statistics; Topology (electrical circuits); Electronic engineering; Telecommunications; Physics; Engineering; Combinatorics","score_opus":0.0761536528354059,"score_gpt":0.2103175274744501,"score_spread":0.1341638746390442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951360543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.428927,0.00011820211,0.56828195,0.0001377576,0.00041232308,0.00024141229,0.000001710778,0.00019182784,0.0016878059],"genre_scores_gemma":[0.99711204,0.0009907744,0.00083972636,0.00012156888,0.00009387311,0.0000022972415,0.000015877396,0.000020227253,0.00080364844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782985,0.00038804082,0.00028369713,0.0009897285,0.0001054389,0.00040326038],"domain_scores_gemma":[0.9980904,0.00026884794,0.00022402046,0.0011710676,0.00008434345,0.00016134462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039961154,0.00033770924,0.0004520252,0.0004245725,0.00031328047,0.0003238612,0.0021461884,0.0002779138,0.000057251407],"category_scores_gemma":[0.000050395764,0.0003965197,0.00012466096,0.0005132358,0.000084875086,0.00035330502,0.0053000683,0.00097642286,0.00006804443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011093653,0.00029771935,0.015735362,0.00027962294,0.00029525175,0.00028097432,0.0049441285,0.60758084,0.0017641822,0.34723714,0.0005502239,0.020923626],"study_design_scores_gemma":[0.0006241365,0.000023401,0.00072616216,0.00032816085,0.000023619155,0.000004011413,0.0000132064215,0.9916156,0.00014021841,0.0055177025,0.00046108608,0.0005226924],"about_ca_topic_score_codex":0.000027121461,"about_ca_topic_score_gemma":0.000012425337,"teacher_disagreement_score":0.56818503,"about_ca_system_score_codex":0.00019123124,"about_ca_system_score_gemma":0.00006409831,"threshold_uncertainty_score":0.99984866},"labels":[],"label_agreement":null},{"id":"W2951397817","doi":"10.1109/tvt.2019.2921814","title":"Auction-Based Relay Selection and Power Allocation in Green Relay-Assisted Cellular Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Relay; Selection (genetic algorithm); Computer science; Cellular radio; Computer network; Power (physics); Cellular network; Telecommunications; Engineering; Base station","score_opus":0.010562120509563271,"score_gpt":0.2241930083635374,"score_spread":0.21363088785397413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951397817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21354802,0.00020947079,0.7823327,0.0029324198,0.00026680005,0.00030092348,3.8684058e-7,0.00035276444,0.00005652715],"genre_scores_gemma":[0.9942281,0.00016283238,0.0050614877,0.00023030625,0.000008066663,0.00008073906,0.0000026762764,0.000016604145,0.00020917607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986511,0.00017154179,0.00029297004,0.00048149706,0.00014755884,0.00025535523],"domain_scores_gemma":[0.9989584,0.00008239049,0.000090149966,0.0006959397,0.00012523276,0.00004790041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028649002,0.0001795629,0.00019978269,0.0006874995,0.00022384322,0.00004916504,0.00042755762,0.00034161427,0.000038492235],"category_scores_gemma":[0.0000058632704,0.00019167944,0.000058053833,0.0017711187,0.00006656641,0.00023568103,0.000008749034,0.0006936604,0.00004483628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055456843,0.00039556093,0.0009745606,0.000016439699,0.000059598435,0.000010534737,0.00018348168,0.8226273,0.028693015,0.0067803864,0.000038017446,0.14016567],"study_design_scores_gemma":[0.00077022566,0.00022711647,0.0015303692,0.000061557825,0.000010450434,0.000024917084,0.000024932586,0.98059356,0.014954066,0.000088497356,0.0014751934,0.00023914038],"about_ca_topic_score_codex":0.000024614996,"about_ca_topic_score_gemma":0.00028630134,"teacher_disagreement_score":0.7806801,"about_ca_system_score_codex":0.00015708618,"about_ca_system_score_gemma":0.000055316184,"threshold_uncertainty_score":0.7816461},"labels":[],"label_agreement":null},{"id":"W2951491612","doi":"10.1109/twc.2019.2923200","title":"Robust Energy Efficiency Optimization for Amplify-and-Forward MIMO Relaying Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Royal Society","keywords":"MIMO; Beamforming; Channel state information; Relay; Computer science; Mathematical optimization; Optimization problem; Covariance matrix; Covariance; Control theory (sociology); Wireless; Mathematics; Algorithm; Telecommunications","score_opus":0.04935637207874298,"score_gpt":0.26652582197856345,"score_spread":0.21716944989982045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951491612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081015023,0.0010219597,0.9940505,0.0015005966,0.00048195088,0.0005732668,0.000016809152,0.0002932872,0.0012514525],"genre_scores_gemma":[0.9434949,0.005573405,0.049543075,0.00025917945,0.000015753292,0.00043830764,0.000022875087,0.00002881423,0.0006236684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837476,0.0002971179,0.0004379886,0.00041168253,0.00019598429,0.0002824716],"domain_scores_gemma":[0.9958134,0.00085060153,0.00016522233,0.0027833567,0.000273043,0.00011434086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038779434,0.00021425316,0.00026251815,0.0002599189,0.0011300879,0.0002937016,0.0019341273,0.00012607846,0.000018452629],"category_scores_gemma":[0.00000886272,0.00022449197,0.00010180125,0.0006805256,0.00010525504,0.00050788897,0.000044130316,0.0003215771,0.000023062363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011673066,0.00024287133,0.000012971748,0.000026141357,0.000047888985,1.1990757e-7,0.00055008434,0.7837446,0.00045722173,0.16061388,0.000096680575,0.05419591],"study_design_scores_gemma":[0.0005036378,0.00008799474,0.000010160358,0.00009672578,0.000019064397,0.000007552777,0.00011145914,0.9914948,0.00029309557,0.000053686297,0.007062192,0.00025966295],"about_ca_topic_score_codex":0.000036731322,"about_ca_topic_score_gemma":0.000056619327,"teacher_disagreement_score":0.9445075,"about_ca_system_score_codex":0.00010850151,"about_ca_system_score_gemma":0.00009401038,"threshold_uncertainty_score":0.91545165},"labels":[],"label_agreement":null},{"id":"W2951533955","doi":"10.48550/arxiv.1506.03792","title":"Convolutional Codes with Maximum Column Sum Rank for Network Streaming","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Column (typography); Hamming(7,4); Hamming distance; Diagonal; Rank (graph theory); Convolutional code; Code (set theory); Computer science; Mathematics; Linear code; Discrete mathematics; Algorithm; Block code; Combinatorics; Computer network","score_opus":0.11447251573888019,"score_gpt":0.21654148112520155,"score_spread":0.10206896538632136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951533955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02383268,0.0005019957,0.97145814,0.00026631216,0.00043886265,0.0005710202,0.000030165193,0.00024315089,0.0026576964],"genre_scores_gemma":[0.9836235,0.0004309646,0.013728138,0.00015246656,0.00017990156,0.000007882828,0.00009211396,0.00002022797,0.0017647772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982623,0.00020555749,0.0001979953,0.00081255956,0.00010863324,0.00041294427],"domain_scores_gemma":[0.99736524,0.000286096,0.0002509651,0.0011996813,0.000706334,0.00019169804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005102429,0.00029422835,0.00036376808,0.00011112897,0.0004260688,0.00018822582,0.0018976403,0.00018379222,0.000019367677],"category_scores_gemma":[0.000034873476,0.0003210733,0.00012944761,0.0005295307,0.00017166493,0.00029227248,0.0018461308,0.00043228825,0.000017465492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001313468,0.00009190772,0.0047328863,0.000050030343,0.00019545102,0.00003507339,0.00020714474,0.5494377,0.0000067993183,0.43520352,0.007970846,0.0019372893],"study_design_scores_gemma":[0.0013205287,0.00009327734,0.0011935931,0.00021875893,0.00006704057,0.0000054921675,0.000056602734,0.94755983,0.000009480857,0.03821015,0.01070757,0.00055764086],"about_ca_topic_score_codex":0.000027090335,"about_ca_topic_score_gemma":0.00028163005,"teacher_disagreement_score":0.9597908,"about_ca_system_score_codex":0.0002961715,"about_ca_system_score_gemma":0.00057417323,"threshold_uncertainty_score":0.9999241},"labels":[],"label_agreement":null},{"id":"W2951743996","doi":"10.48550/arxiv.1901.03274","title":"Towards an Algebraic Network Information Theory: Simultaneous Joint Typicality Decoding","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Code word; Computer science; Tuple; Conjunction (astronomy); List decoding; Theoretical computer science; Key (lock); Algorithm; Sequential decoding; Joint (building); Channel (broadcasting); Mathematics; Discrete mathematics; Concatenated error correction code; Computer network; Block code","score_opus":0.08486898712178347,"score_gpt":0.2168385050972367,"score_spread":0.13196951797545325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951743996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05687042,0.000120983634,0.93459517,0.00017546093,0.00079069496,0.0004156898,0.0000070209544,0.00040233636,0.0066222325],"genre_scores_gemma":[0.9938495,0.00065483653,0.0043394743,0.00063745596,0.000114099836,0.0000014336065,0.00006591837,0.00001339167,0.00032389074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769604,0.00073108514,0.0003557965,0.0006754793,0.00012515295,0.00041642864],"domain_scores_gemma":[0.9964697,0.00029224373,0.00037126205,0.002300416,0.00035892453,0.00020746763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010142716,0.0003377071,0.00039133363,0.00017652576,0.00035800823,0.00040253715,0.0025317068,0.0002979518,0.000090892456],"category_scores_gemma":[0.00018164664,0.00037210833,0.00018481346,0.00065559696,0.00008963049,0.0012773023,0.0036441654,0.0008245263,0.0002512502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022057227,0.000029761955,0.00020375809,0.000022802173,0.000037542715,0.000011453638,0.00042599224,0.46795794,0.0000029440848,0.5132011,0.00016341484,0.0179212],"study_design_scores_gemma":[0.00028034433,0.000051970106,0.00080598594,0.000092658185,0.000027601945,0.0000030506103,0.000052191644,0.9206484,0.00001938209,0.074832745,0.0027489327,0.00043676014],"about_ca_topic_score_codex":0.000019556617,"about_ca_topic_score_gemma":0.000039509,"teacher_disagreement_score":0.93697906,"about_ca_system_score_codex":0.00030083058,"about_ca_system_score_gemma":0.00030093238,"threshold_uncertainty_score":0.9998731},"labels":[],"label_agreement":null},{"id":"W2951783658","doi":"10.48550/arxiv.1403.5330","title":"Differential Dual-Hop Relaying over Time-Varying Rayleigh-Fading Channels","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Fading; Rayleigh fading; Bit error rate; Algorithm; Channel (broadcasting); Computer science; Channel state information; Hop (telecommunications); Fading distribution; Mathematics; Topology (electrical circuits); Electronic engineering; Telecommunications; Wireless; Engineering; Combinatorics","score_opus":0.07519936189444756,"score_gpt":0.2108123590917495,"score_spread":0.13561299719730194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951783658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30269912,0.0001114785,0.6903707,0.00015843536,0.0012385038,0.00028447135,0.0000032344956,0.0004661595,0.004667912],"genre_scores_gemma":[0.9947666,0.00062281697,0.0010556813,0.00019668804,0.0003031197,0.0000023050789,0.000028495315,0.000035727873,0.0029885597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721986,0.0004941993,0.00033452234,0.0012639703,0.00015537196,0.0005320698],"domain_scores_gemma":[0.99683815,0.00029682033,0.00037211285,0.0020740747,0.00019107833,0.00022776054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036858695,0.0004700734,0.00052462093,0.00038647978,0.0006281706,0.00042328608,0.0024856143,0.00033106466,0.0003059108],"category_scores_gemma":[0.000060328537,0.000550131,0.0003027978,0.0006496048,0.00010268209,0.00052365183,0.0064075203,0.0010491444,0.00028358953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080020574,0.00029139713,0.0016653095,0.00018864512,0.0005313754,0.00026534358,0.0028448696,0.69769466,0.0049915276,0.27915788,0.0039729984,0.008315963],"study_design_scores_gemma":[0.00061035744,0.000029523091,0.0002276668,0.00029451534,0.000052391453,0.0000042084744,0.000007831583,0.99260104,0.00050215353,0.0038072465,0.0011773758,0.00068570155],"about_ca_topic_score_codex":0.000016843831,"about_ca_topic_score_gemma":0.0000051715597,"teacher_disagreement_score":0.6920675,"about_ca_system_score_codex":0.00027140355,"about_ca_system_score_gemma":0.00011446875,"threshold_uncertainty_score":0.999695},"labels":[],"label_agreement":null},{"id":"W2951841685","doi":"10.48550/arxiv.1106.0488","title":"A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Decodes; Channel (broadcasting); Transmission (telecommunications); Computer network; Gaussian; Duplex (building); Scheme (mathematics); Encoding (memory); ENCODE; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics; Physics","score_opus":0.12918519756781802,"score_gpt":0.2148844736774495,"score_spread":0.08569927610963149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951841685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098852225,0.00025931554,0.88693744,0.0002371992,0.0003409528,0.00044934143,0.0000044851117,0.00042059983,0.012498423],"genre_scores_gemma":[0.98388386,0.0008963544,0.012911059,0.00021763715,0.00006430987,0.0000058505575,0.000018042032,0.000027499738,0.0019753631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976107,0.00034541867,0.00026520313,0.0012096477,0.000117489995,0.00045156694],"domain_scores_gemma":[0.99684036,0.00010409708,0.0002953957,0.0020729573,0.00044186992,0.00024532742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033163876,0.00043527965,0.00043977576,0.00022116813,0.0004978102,0.00023063603,0.0026956175,0.0002449611,0.00013162426],"category_scores_gemma":[0.000043355747,0.0004326495,0.00016028187,0.00082234666,0.00021165052,0.00061218854,0.0035372577,0.0009911542,0.00015584209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012098725,0.00018693676,0.0034160302,0.000037774735,0.00031375806,0.00027859124,0.0021655618,0.07077982,0.00008104411,0.91961175,0.0007553655,0.002252356],"study_design_scores_gemma":[0.0010039674,0.00017021262,0.0004595186,0.0002964644,0.000075091906,0.000014017875,0.00012547856,0.98722935,0.0005412555,0.002772669,0.0063160104,0.0009959651],"about_ca_topic_score_codex":0.000067509514,"about_ca_topic_score_gemma":0.00024612152,"teacher_disagreement_score":0.9168391,"about_ca_system_score_codex":0.00021242097,"about_ca_system_score_gemma":0.00041738743,"threshold_uncertainty_score":0.99981254},"labels":[],"label_agreement":null},{"id":"W2951925748","doi":"10.48550/arxiv.0709.0035","title":"On The Limitations of The Naive Lattice Decoding","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Lattice (music); List decoding; Mathematics; MIMO; Fading; Upper and lower bounds; Algorithm; Word error rate; Computer science; Discrete mathematics; Statistics; Block code; Concatenated error correction code; Speech recognition; Physics; Mathematical analysis","score_opus":0.2472405860620079,"score_gpt":0.3272618929972,"score_spread":0.08002130693519208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951925748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85332507,0.00095000135,0.091711394,0.020029046,0.0013821333,0.0006052154,0.0000036441677,0.00011794472,0.03187556],"genre_scores_gemma":[0.99406964,0.0011287425,0.0021386887,0.0021588365,0.000061218685,0.000025427833,0.0000018454359,0.000009384402,0.00040619422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986949,0.00032313596,0.00029085897,0.00028342224,0.0002336004,0.00017411429],"domain_scores_gemma":[0.99509275,0.0024124891,0.00026730236,0.0019507982,0.00024081171,0.00003582823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073993066,0.00015494176,0.00015136256,0.000066156215,0.000425786,0.0000803889,0.0028159237,0.00009166303,0.000016354943],"category_scores_gemma":[0.00077439647,0.00009406866,0.00014002576,0.0004331754,0.00011443228,0.00007745099,0.00252706,0.0007555434,0.000058316888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076819115,0.00015228882,0.025309747,0.000021583031,0.00013081226,0.0000022635684,0.007969331,0.0027425075,0.0006009974,0.91009265,0.003941327,0.04902878],"study_design_scores_gemma":[0.00072516943,0.00014823307,0.74653196,0.0019406273,0.0001319903,0.000010494402,0.0006992683,0.13822113,0.015281073,0.037127256,0.057823144,0.0013596613],"about_ca_topic_score_codex":0.0000067069973,"about_ca_topic_score_gemma":0.000058020967,"teacher_disagreement_score":0.8729654,"about_ca_system_score_codex":0.000059361333,"about_ca_system_score_gemma":0.000116389914,"threshold_uncertainty_score":0.52327335},"labels":[],"label_agreement":null},{"id":"W2951997147","doi":"10.48550/arxiv.0912.3981","title":"Multiplexing Gain of Amplify-Forward Relaying in Wireless Multi-Antenna Relay Networks","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Multiplexing; Telecommunications; Computer science; Wireless; Computer network; Antenna (radio); Electronic engineering; Engineering; Physics; Power (physics)","score_opus":0.09570127159404092,"score_gpt":0.3142915399370754,"score_spread":0.21859026834303452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951997147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3026878,0.002077607,0.69317573,0.00048315644,0.000628755,0.00044186952,0.0000027896886,0.00019181649,0.0003104867],"genre_scores_gemma":[0.9658088,0.0039789034,0.029400155,0.0004511716,0.000113180395,0.000052856816,0.000036978705,0.000035377612,0.00012255037],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964667,0.0006242517,0.001081333,0.00093842787,0.00029679874,0.0005924729],"domain_scores_gemma":[0.9963058,0.0004094606,0.0006285108,0.0022621602,0.00025104464,0.00014298757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013907665,0.00046593073,0.00076866354,0.0003415603,0.00021128474,0.00012668954,0.002841001,0.00047220686,0.000010727597],"category_scores_gemma":[0.00021780477,0.00048489915,0.00022964977,0.0007636868,0.00010891209,0.0003042195,0.0032332898,0.0020778275,0.000016807522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050753093,0.00059805386,0.5848886,0.00016275723,0.00014234109,0.00008794733,0.005093371,0.29835424,0.0052410755,0.0081374785,0.00033841914,0.096904986],"study_design_scores_gemma":[0.0006303678,0.000031426058,0.11133438,0.001086709,0.000009620546,0.000003549018,0.000046467376,0.88580084,0.00026700392,0.00007875388,0.00021427294,0.0004966244],"about_ca_topic_score_codex":0.00008487369,"about_ca_topic_score_gemma":0.00025603815,"teacher_disagreement_score":0.66377556,"about_ca_system_score_codex":0.00020341086,"about_ca_system_score_gemma":0.00014822112,"threshold_uncertainty_score":0.99976027},"labels":[],"label_agreement":null},{"id":"W2952079630","doi":"10.48550/arxiv.1610.06974","title":"Optimal Control for Network Coding Broadcast","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Multicast; Markov decision process; Network packet; Computer network; Coding (social sciences); Scheduling (production processes); Computational complexity theory; Distributed computing; Markov process; Algorithm; Mathematical optimization; Mathematics","score_opus":0.09647865135288608,"score_gpt":0.21654533891131675,"score_spread":0.12006668755843067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952079630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035279037,0.00036523948,0.99119526,0.0005702109,0.00079929765,0.0005553971,0.000020779418,0.00026969146,0.0026962096],"genre_scores_gemma":[0.9897908,0.0009537711,0.0067202575,0.0003081562,0.00035031556,0.000006637271,0.0000106511725,0.000020521436,0.0018389117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813145,0.00022213676,0.00023048671,0.0008734002,0.00006407806,0.00047847285],"domain_scores_gemma":[0.99730855,0.00048007257,0.00026511942,0.0014776948,0.00030566432,0.00016290462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046501192,0.00030026352,0.00037319312,0.00011718796,0.00043347199,0.00018537603,0.0025461821,0.0002113061,0.000033234366],"category_scores_gemma":[0.00005205552,0.00030375685,0.00026451616,0.00032928065,0.00009724496,0.0003083748,0.00208887,0.0003762902,0.000047341913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005345277,0.00003534032,0.0004100371,0.00002528581,0.00011709865,0.000021402046,0.0001047631,0.24432702,0.00004822632,0.74393135,0.00399123,0.0069348062],"study_design_scores_gemma":[0.0013231486,0.00005472988,0.00018057012,0.00022167996,0.000046457266,0.0000026218872,0.000009721499,0.961843,0.00003306995,0.017210472,0.01858006,0.0004944827],"about_ca_topic_score_codex":0.0000025625193,"about_ca_topic_score_gemma":0.000009089164,"teacher_disagreement_score":0.98626286,"about_ca_system_score_codex":0.00018691586,"about_ca_system_score_gemma":0.00017213079,"threshold_uncertainty_score":0.99994147},"labels":[],"label_agreement":null},{"id":"W2952171970","doi":"10.48550/arxiv.1401.3250","title":"Half-Duplex Relaying for the Multiuser Channel","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Duplex (building); Channel (broadcasting); Gaussian; Computer science; Coding (social sciences); Relay channel; Scheme (mathematics); Topology (electrical circuits); Algorithm; Computer network; Telecommunications; Mathematics; Physics; Statistics; Combinatorics; Mathematical analysis","score_opus":0.16266747863245007,"score_gpt":0.2247826410805566,"score_spread":0.062115162448106526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952171970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006842898,0.00037430812,0.9890262,0.0014210131,0.0007400933,0.0005404361,0.0000039650954,0.00019550309,0.0008555672],"genre_scores_gemma":[0.99323887,0.0012465768,0.0024648597,0.0005108565,0.00013981732,0.000008359235,0.0000115856055,0.000018398256,0.0023606992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998535,0.00019669268,0.00017772288,0.0007223729,0.00006464255,0.00030358293],"domain_scores_gemma":[0.99667627,0.00068223604,0.00021256536,0.002076734,0.0002588331,0.00009335528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005537613,0.00024934465,0.00024018905,0.0001169157,0.0006549888,0.00019335523,0.0034353503,0.00017277346,0.000014358417],"category_scores_gemma":[0.000095256975,0.00022067866,0.00022946176,0.00035082267,0.00009458329,0.00020573977,0.0031807737,0.000542263,0.000046965695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020344478,0.000051515286,0.00013756109,0.00004261974,0.00012270732,0.0000085572,0.00077067275,0.59623337,0.000027377842,0.39264232,0.0028200673,0.007122916],"study_design_scores_gemma":[0.00035662475,0.000019837109,0.00026191925,0.000065459324,0.00003422139,0.0000011649921,0.0000402687,0.97370756,0.000033785967,0.0047028083,0.020497357,0.00027897075],"about_ca_topic_score_codex":0.000028571716,"about_ca_topic_score_gemma":0.00008046664,"teacher_disagreement_score":0.98656136,"about_ca_system_score_codex":0.000110006105,"about_ca_system_score_gemma":0.000091762435,"threshold_uncertainty_score":0.89990145},"labels":[],"label_agreement":null},{"id":"W2952224281","doi":"10.48550/arxiv.cs/0512020","title":"A Practical Approach to Joint Network-Source Coding","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Joint (building); Computer science; Coding (social sciences); Linear network coding; Computer network; Mathematics; Engineering; Statistics; Structural engineering","score_opus":0.18979609156750704,"score_gpt":0.33751676368870986,"score_spread":0.14772067212120282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952224281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019954309,0.0005742111,0.94721335,0.011184147,0.00068149064,0.0006130083,0.0000010803764,0.00049487985,0.019283537],"genre_scores_gemma":[0.768401,0.000690796,0.22382687,0.0041598165,0.00118184,0.00016254101,0.000017854058,0.00003974782,0.0015195031],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689823,0.00045615592,0.0005805201,0.0010474094,0.00038146623,0.0006362218],"domain_scores_gemma":[0.996439,0.00022494189,0.00027218502,0.0024982311,0.00023121775,0.0003344657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001105858,0.0004098501,0.000507912,0.00014222928,0.00040509945,0.00043202145,0.0021296497,0.00026036566,0.00003960936],"category_scores_gemma":[0.00028716773,0.00040995944,0.00019286184,0.0005862297,0.000061531806,0.00028629584,0.007971882,0.0015445029,0.00042511226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006736128,0.0017377672,0.030545458,0.00025520477,0.0006028545,0.00005732859,0.0131037375,0.21556261,0.0014666729,0.230712,0.27711752,0.2287715],"study_design_scores_gemma":[0.00048156455,0.00008300906,0.033679947,0.000517883,0.000049695896,0.000070906615,0.000066541965,0.5722262,0.0003668219,0.00034623907,0.39060438,0.0015067814],"about_ca_topic_score_codex":0.000010179726,"about_ca_topic_score_gemma":0.000014329193,"teacher_disagreement_score":0.7484467,"about_ca_system_score_codex":0.00021419954,"about_ca_system_score_gemma":0.0002512109,"threshold_uncertainty_score":0.99983525},"labels":[],"label_agreement":null},{"id":"W2952423309","doi":"10.48550/arxiv.1110.4126","title":"Relay Selection and Performance Analysis in Multiple-User Networks","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Quadratic equation; Scheme (mathematics); Signal-to-noise ratio (imaging); Computer network; Mathematical optimization; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.087125536735113,"score_gpt":0.19265882751268973,"score_spread":0.10553329077757673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952423309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49937862,0.00016160622,0.4995939,0.000021730371,0.000086692264,0.00011177498,3.6450442e-7,0.00007905128,0.00056626945],"genre_scores_gemma":[0.9929563,0.0048602032,0.0014861998,0.00004893363,0.000021857202,0.0000014677726,0.000007700555,0.0000075740304,0.0006097925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986349,0.00022310276,0.00017879528,0.0006964657,0.000039283354,0.00022748423],"domain_scores_gemma":[0.99873954,0.00009384175,0.00015415809,0.0008121247,0.00011489981,0.00008541857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031617,0.00019907714,0.0002774988,0.00050088856,0.0001859007,0.00008134254,0.0009787459,0.00019680208,0.00002129575],"category_scores_gemma":[0.00001710271,0.0002309163,0.00010065586,0.001902659,0.00005339503,0.00035987826,0.001691346,0.0006546844,0.00000826679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017834709,0.00003564841,0.2527691,0.000008878115,0.00011374285,0.000007964104,0.00026307104,0.72853774,0.0000027536378,0.01564759,0.000023896666,0.0025717579],"study_design_scores_gemma":[0.0002148003,0.000021165177,0.11310528,0.000036548867,0.000068609814,8.964445e-7,0.0000081771195,0.8860008,0.000011053282,0.00018804411,0.00012187677,0.00022272169],"about_ca_topic_score_codex":0.00007918043,"about_ca_topic_score_gemma":0.001392202,"teacher_disagreement_score":0.4981077,"about_ca_system_score_codex":0.0001283345,"about_ca_system_score_gemma":0.00005026733,"threshold_uncertainty_score":0.9416493},"labels":[],"label_agreement":null},{"id":"W2952468857","doi":"10.48550/arxiv.0812.3890","title":"Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Selection (genetic algorithm); Computer science; Optimal allocation; Computer network; Mathematical optimization; Operations research; Mathematics; Artificial intelligence; Physics","score_opus":0.039098915757681346,"score_gpt":0.2742635277647624,"score_spread":0.23516461200708108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952468857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73219365,0.0022956652,0.26298428,0.0011409484,0.00021808397,0.0004697618,0.0000017197652,0.00015989224,0.0005359868],"genre_scores_gemma":[0.9713428,0.01711933,0.010520939,0.00039978584,0.00010616036,0.00009827759,0.000052025054,0.000021972348,0.00033873043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790275,0.00042559093,0.0004428176,0.0007657713,0.00015821114,0.0003048614],"domain_scores_gemma":[0.9986182,0.00018439334,0.00019497782,0.0006418481,0.00024217943,0.0001184447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053148816,0.0003214514,0.00038132773,0.00019376085,0.00034095004,0.00018450963,0.0006288375,0.00029785873,0.000015532061],"category_scores_gemma":[0.000090460315,0.00033395126,0.000050056886,0.000513141,0.0000982048,0.0003874102,0.0016201779,0.0010046194,0.00003124172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008080378,0.00023560938,0.21552369,0.00005452153,0.00017057225,0.000024621757,0.005816804,0.7216856,0.0006881434,0.0048096622,0.003819685,0.047090314],"study_design_scores_gemma":[0.00036254677,0.00006835436,0.07817239,0.00014073042,0.000010533568,0.000029451448,0.000013926244,0.9195431,0.00015798397,0.000033574863,0.0010999163,0.0003674975],"about_ca_topic_score_codex":0.000030370904,"about_ca_topic_score_gemma":0.00015371841,"teacher_disagreement_score":0.25246334,"about_ca_system_score_codex":0.00014648178,"about_ca_system_score_gemma":0.0001522444,"threshold_uncertainty_score":0.99991125},"labels":[],"label_agreement":null},{"id":"W2952482061","doi":"","title":"Broadcast Approaches to the Diamond Channel","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Rayleigh fading; Linear network coding; Channel (broadcasting); Throughput; Transmission (telecommunications); Decoding methods; Coding (social sciences); Broadcasting (networking); Code rate; Computer network; Algorithm; Topology (electrical circuits); Fading; Telecommunications; Wireless; Mathematics; Network packet","score_opus":0.34567652312232483,"score_gpt":0.2089332965081778,"score_spread":0.13674322661414703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952482061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017376859,0.00096804195,0.9674005,0.0028364055,0.00079551974,0.00051477214,0.0000067490655,0.00021486451,0.009886299],"genre_scores_gemma":[0.99547994,0.000653661,0.0009023986,0.0004249842,0.0001899858,0.0000046824866,0.000008624112,0.000013527926,0.0023222037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847263,0.00029082783,0.00014297152,0.0006542993,0.00007948266,0.00035980938],"domain_scores_gemma":[0.99721867,0.00011438292,0.00012576196,0.0022533066,0.00008383092,0.00020406244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043706186,0.00025466437,0.0002148943,0.0001379408,0.00038116483,0.00019147318,0.0038507753,0.00013770034,0.000025179987],"category_scores_gemma":[0.00002570774,0.00022186454,0.00014146771,0.0007163836,0.000074173826,0.00027267553,0.006484983,0.0005938143,0.00029729577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015172075,0.00016835277,0.0005729265,0.000030448784,0.00011781204,0.000020280826,0.0054927277,0.21204537,0.0000127288695,0.74882567,0.0049078665,0.027790662],"study_design_scores_gemma":[0.0002878986,0.000033122862,0.0026709144,0.00010121957,0.000054505555,0.000005528848,0.00020999728,0.9317302,0.000104033825,0.00765715,0.0563334,0.00081203086],"about_ca_topic_score_codex":0.000018341903,"about_ca_topic_score_gemma":0.000064071945,"teacher_disagreement_score":0.9781031,"about_ca_system_score_codex":0.00011942204,"about_ca_system_score_gemma":0.00008146827,"threshold_uncertainty_score":0.90473735},"labels":[],"label_agreement":null},{"id":"W2952538358","doi":"10.48550/arxiv.1403.8122","title":"Performance of Selection Combining for Differential Amplify-and-Forward Relaying Over Time-Varying Channels","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Maximal-ratio combining; Rayleigh fading; Fading; Bit error rate; Channel (broadcasting); Algorithm; Channel state information; Computer science; Signal-to-noise ratio (imaging); Selection (genetic algorithm); Differential (mechanical device); Modulation (music); Electronic engineering; Mathematics; Topology (electrical circuits); Statistics; Telecommunications; Physics; Engineering; Wireless; Acoustics; Artificial intelligence","score_opus":0.06599698756612102,"score_gpt":0.21376079768297032,"score_spread":0.1477638101168493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952538358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.526557,0.000029731053,0.47258088,0.000022471186,0.00023143791,0.00020268411,0.0000018961177,0.00007995302,0.00029394988],"genre_scores_gemma":[0.9972796,0.00047474957,0.0016371087,0.000040127485,0.00006770266,0.0000032100593,0.000018149334,0.00001557549,0.00046381867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872917,0.00014135899,0.00023246267,0.0005836914,0.00006965887,0.00024364899],"domain_scores_gemma":[0.9985965,0.00022643409,0.00032041222,0.0005878573,0.00018750461,0.000081313075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030997032,0.00022517638,0.0003518279,0.00021228238,0.00035136277,0.000095655276,0.00089497486,0.0001846808,0.000023146742],"category_scores_gemma":[0.000032085787,0.00026176602,0.000119275435,0.0002902799,0.000067627596,0.00029218034,0.0015926538,0.00040458437,0.0000060491493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036294988,0.00027020162,0.020109136,0.0009738538,0.0005558122,0.000004857484,0.0024791872,0.7073286,0.007179043,0.23437217,0.0006637859,0.0257004],"study_design_scores_gemma":[0.0005678119,0.00009711867,0.00090520096,0.00021801417,0.000042454394,0.0000015217671,0.0000047963094,0.9961615,0.0005393932,0.0009845482,0.00019934573,0.00027829056],"about_ca_topic_score_codex":0.000008107203,"about_ca_topic_score_gemma":0.0000022690647,"teacher_disagreement_score":0.47094375,"about_ca_system_score_codex":0.000086684406,"about_ca_system_score_gemma":0.00006178783,"threshold_uncertainty_score":0.99998343},"labels":[],"label_agreement":null},{"id":"W2952562462","doi":"10.48550/arxiv.1212.5288","title":"Quantized Network Coding for Correlated Sources","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Linear network coding; Computer science; Network packet; Decoding methods; Variable-length code; Lossless compression; Packet forwarding; Tunstall coding; Distributed source coding; Multiple description coding; Computer network; Quantization (signal processing); Coding (social sciences); Shannon–Fano coding; Context-adaptive binary arithmetic coding; Theoretical computer science; Algorithm; Mathematics; Data compression","score_opus":0.1540522124762287,"score_gpt":0.2245882364248845,"score_spread":0.07053602394865582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952562462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030479046,0.0010713453,0.96405405,0.00017844832,0.0013616579,0.00052022847,0.000005594222,0.0004152573,0.001914389],"genre_scores_gemma":[0.990865,0.0015452909,0.0057377084,0.00017255095,0.00022872571,0.0000041980074,0.00003562144,0.000022311484,0.0013886186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816555,0.00026661585,0.0002529575,0.00072831695,0.000066325054,0.0005202327],"domain_scores_gemma":[0.99739707,0.00044375262,0.00033405388,0.0013972728,0.00024898248,0.00017889631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005892072,0.00030896039,0.0003892827,0.00013376155,0.00053099927,0.00018851594,0.0023522838,0.0002796722,0.00003959014],"category_scores_gemma":[0.000055327866,0.00035395898,0.00025584182,0.0006244134,0.00008569821,0.0003326414,0.002750281,0.00058491813,0.000059046084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006957341,0.00007158167,0.002055899,0.00004484614,0.00015313372,0.000010018593,0.00054311444,0.1979086,0.00003534857,0.7938574,0.0026225476,0.0026279713],"study_design_scores_gemma":[0.00075292453,0.00003291366,0.0004946185,0.00017149313,0.00007629799,0.000002257398,0.00003077335,0.97652376,0.00003498474,0.010584019,0.010777265,0.000518715],"about_ca_topic_score_codex":0.000011245036,"about_ca_topic_score_gemma":0.000029572773,"teacher_disagreement_score":0.9603859,"about_ca_system_score_codex":0.00013813913,"about_ca_system_score_gemma":0.00012443241,"threshold_uncertainty_score":0.9998912},"labels":[],"label_agreement":null},{"id":"W2952617057","doi":"10.48550/arxiv.0807.0868","title":"On the Capacity of Pairwise Collaborative Networks","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Pairwise comparison; Computer science; Artificial intelligence","score_opus":0.09810518256184061,"score_gpt":0.2777147281296831,"score_spread":0.1796095455678425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952617057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8533458,0.0016033202,0.12895244,0.005744391,0.000995557,0.000756594,0.000010951022,0.00019007165,0.008400879],"genre_scores_gemma":[0.99225885,0.0050972793,0.0011874915,0.0010703846,0.00010377719,0.00007071575,0.000007230758,0.000013056454,0.00019119582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980399,0.0006581233,0.00036990398,0.00044817603,0.00025240768,0.00023149677],"domain_scores_gemma":[0.9961888,0.00073590863,0.00035904715,0.0021808697,0.00046579877,0.00006958377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049981015,0.0002614868,0.00033919295,0.00006932451,0.0003321317,0.00006423084,0.0023565795,0.00017215125,0.000033382577],"category_scores_gemma":[0.00022137257,0.00018918287,0.00013162525,0.00060896063,0.00023723225,0.0000988841,0.0020265738,0.0009795072,0.000038321516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001120457,0.0011849627,0.08413012,0.000113359805,0.00081972743,0.000046671717,0.027995912,0.14372241,0.00082036754,0.583366,0.12148001,0.03620842],"study_design_scores_gemma":[0.0012527092,0.00052636774,0.20788203,0.0015968031,0.00006728602,0.000015051072,0.00024610676,0.73518986,0.006913779,0.0083590755,0.03576237,0.0021885773],"about_ca_topic_score_codex":0.00001318188,"about_ca_topic_score_gemma":0.00003455843,"teacher_disagreement_score":0.59146744,"about_ca_system_score_codex":0.000077283104,"about_ca_system_score_gemma":0.00019822181,"threshold_uncertainty_score":0.77146536},"labels":[],"label_agreement":null},{"id":"W2952624017","doi":"10.48550/arxiv.1203.1643","title":"Coding Delay Analysis of Chunked Codes over Line Networks","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Linear network coding; Coding (social sciences); Probabilistic logic; Mathematics; Probabilistic analysis of algorithms; Bernoulli's principle; Computer science; Poisson distribution; Algorithm; Computer network; Statistics","score_opus":0.11062834122899605,"score_gpt":0.23128026672116475,"score_spread":0.1206519254921687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952624017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098184906,0.0006610805,0.8985106,0.000044179527,0.00028575535,0.00015034493,0.000009703833,0.00012763306,0.0020258026],"genre_scores_gemma":[0.99454635,0.0033110508,0.0013649114,0.00009980349,0.000069003334,8.420833e-7,0.00005541056,0.000011897277,0.00054073235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828565,0.00031844448,0.00032592134,0.00064145675,0.00009258793,0.0003359497],"domain_scores_gemma":[0.9969369,0.000280453,0.000449529,0.0018824608,0.00028956233,0.00016106026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005181944,0.0002796206,0.00060759205,0.0005588281,0.00018126816,0.000082858416,0.0022680527,0.00024371134,0.00012218376],"category_scores_gemma":[0.000032007283,0.00031434876,0.00040442648,0.0024925915,0.000117274096,0.00031677992,0.003327118,0.00057349575,0.000008487133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014174486,0.0000931779,0.008551097,0.000016365306,0.0010361501,0.000012850989,0.00030040095,0.81734926,0.00005558968,0.17075674,0.00013478982,0.0016794221],"study_design_scores_gemma":[0.00021175198,0.0000138564665,0.0067371875,0.00006273279,0.0006501894,5.0505656e-7,0.000013779585,0.99119294,0.000052256197,0.00043445948,0.00031390841,0.0003164323],"about_ca_topic_score_codex":0.000041894582,"about_ca_topic_score_gemma":0.00018351385,"teacher_disagreement_score":0.8971457,"about_ca_system_score_codex":0.00014494141,"about_ca_system_score_gemma":0.00008008254,"threshold_uncertainty_score":0.99993086},"labels":[],"label_agreement":null},{"id":"W2952695922","doi":"10.1109/tcomm.2019.2923226","title":"Cross-Layer Cloud Offloading With Quality of Service Guarantees in Fog-RANs","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Quality of service; Computer network; Linear network coding; Edge device; Radio access network; Microservices; Distributed computing; Base station; Operating system","score_opus":0.08604028554765403,"score_gpt":0.3519697267116657,"score_spread":0.2659294411640117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952695922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21471082,0.00033198405,0.77277905,0.0047021187,0.00022803748,0.00051664904,0.000017354463,0.0001642927,0.006549717],"genre_scores_gemma":[0.98555684,0.0006648989,0.012856558,0.0004831035,0.000006235373,0.00006926926,0.0000042045713,0.000015188762,0.0003437052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818754,0.0004767748,0.0005608937,0.00029799662,0.00025134714,0.00022546785],"domain_scores_gemma":[0.99477494,0.00075581146,0.000176586,0.0038932445,0.00034134492,0.000058090394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063284795,0.00017459525,0.00029357668,0.00024197025,0.00032224014,0.000091417685,0.0027791206,0.00007607794,0.000097436256],"category_scores_gemma":[0.000007924776,0.00016676453,0.00008854693,0.0015128538,0.00012509458,0.0005571905,0.000037413243,0.00050951785,0.000089511246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006956728,0.0076017953,0.02726629,0.00047388396,0.0006753383,0.0000036772074,0.042858012,0.28470626,0.12154455,0.3478447,0.00018321538,0.16614662],"study_design_scores_gemma":[0.010393235,0.0008875839,0.08949829,0.0018456903,0.00008179604,0.000038750874,0.0016547444,0.8059261,0.07012722,0.0022284458,0.01482641,0.0024917205],"about_ca_topic_score_codex":0.00023719577,"about_ca_topic_score_gemma":0.004694314,"teacher_disagreement_score":0.770846,"about_ca_system_score_codex":0.00008504518,"about_ca_system_score_gemma":0.00011987494,"threshold_uncertainty_score":0.680046},"labels":[],"label_agreement":null},{"id":"W2952936114","doi":"10.48550/arxiv.0805.2185","title":"Path Diversity over Packet Switched Networks: Performance Analysis and Rate Allocation","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Path (computing); Asymptotically optimal algorithm; Mathematics; Computer science; Erasure; Mathematical optimization; Heuristic","score_opus":0.05488806458339173,"score_gpt":0.2616174113285515,"score_spread":0.20672934674515975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952936114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81495833,0.0008364717,0.18306907,0.00037071676,0.00021618666,0.00016942894,0.0000017781512,0.00012849021,0.00024950338],"genre_scores_gemma":[0.97288215,0.024974298,0.0012492118,0.0005208885,0.00009326079,0.000017769353,0.000058919428,0.0000095266505,0.00019397923],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982803,0.00027714806,0.00030149575,0.0006691269,0.00020190123,0.00027002825],"domain_scores_gemma":[0.99781746,0.00011807852,0.00027323092,0.0014556663,0.00021464337,0.000120900615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005320013,0.00027624716,0.0003874813,0.00019930907,0.00071407773,0.00013837422,0.0012800498,0.00017421163,0.00002171311],"category_scores_gemma":[0.00003578939,0.000274769,0.00014391201,0.0009050107,0.000088727174,0.00038191502,0.006404239,0.000572828,0.000018589544],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008356242,0.000041662046,0.9780717,0.000020676589,0.0002993816,0.000004620338,0.0012903806,0.0073516285,0.000039147977,0.00018194222,0.0003814982,0.012309017],"study_design_scores_gemma":[0.00012909825,0.000014981591,0.6135634,0.000034402266,0.00007318948,9.3652665e-7,0.0000051873353,0.38564923,0.000039523118,0.000021215978,0.00025739847,0.00021140727],"about_ca_topic_score_codex":0.00004520233,"about_ca_topic_score_gemma":0.00008684144,"teacher_disagreement_score":0.3782976,"about_ca_system_score_codex":0.000094638046,"about_ca_system_score_gemma":0.000070365226,"threshold_uncertainty_score":0.99997044},"labels":[],"label_agreement":null},{"id":"W2953043238","doi":"10.48550/arxiv.0711.2712","title":"Parity Forwarding for Multiple-Relay Networks","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Decodes; Computer science; Computer network; Parity (physics); Topology (electrical circuits); Decoding methods; Telecommunications; Mathematics; Combinatorics; Physics","score_opus":0.11453567253617974,"score_gpt":0.330374554704695,"score_spread":0.21583888216851527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953043238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05423491,0.0025157614,0.93808985,0.0009618044,0.0018724581,0.00075946527,0.00000450859,0.00037372895,0.0011874867],"genre_scores_gemma":[0.960722,0.0014836632,0.035572655,0.0009614011,0.00059136306,0.00017546969,0.000055778313,0.000034080742,0.00040356722],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976559,0.00016403866,0.00055731705,0.00082445657,0.0002102277,0.0005880076],"domain_scores_gemma":[0.9962614,0.0008838358,0.00031256594,0.002022393,0.00034648622,0.00017330528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013325078,0.0003701602,0.00045348605,0.00014587832,0.00051048136,0.00024600016,0.0025510718,0.00039208398,0.000013678458],"category_scores_gemma":[0.0003175608,0.000375854,0.00032665877,0.00033830214,0.000071575196,0.00023834415,0.003831854,0.0010890774,0.00003325697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008236471,0.00037117474,0.5702103,0.0002188725,0.00047345908,0.000021279036,0.0020678197,0.09462276,0.00032357834,0.034417845,0.016695801,0.2804948],"study_design_scores_gemma":[0.00063001766,0.00004282705,0.05107231,0.00024375235,0.000029480518,0.000003552641,0.000015420996,0.8996983,0.00034417748,0.0005002583,0.046749085,0.000670789],"about_ca_topic_score_codex":0.000015639576,"about_ca_topic_score_gemma":0.00011659636,"teacher_disagreement_score":0.9064871,"about_ca_system_score_codex":0.00015632778,"about_ca_system_score_gemma":0.00011504688,"threshold_uncertainty_score":0.99986935},"labels":[],"label_agreement":null},{"id":"W2953169393","doi":"10.48550/arxiv.1009.5959","title":"On the Optimal Compressions in the Compress-and-Forward Relay Schemes","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Relay; Encoding (memory); Computer science; Joint (building); Block (permutation group theory); Sequential decoding; Process (computing); Algorithm; List decoding; Compression (physics); Theoretical computer science; Block code; Mathematics; Artificial intelligence; Engineering; Combinatorics; Concatenated error correction code; Power (physics)","score_opus":0.11422592828145017,"score_gpt":0.22686146002670382,"score_spread":0.11263553174525365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953169393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.760454,0.00032159337,0.22300266,0.0058183894,0.00040508804,0.00063607725,0.0000068018185,0.00014173116,0.009213679],"genre_scores_gemma":[0.99713296,0.00081617496,0.0009190712,0.000746462,0.000029559254,0.0000040139344,0.0000048006477,0.000007530312,0.00033942013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984359,0.0005515752,0.00015529495,0.0005389124,0.00009872572,0.0002196063],"domain_scores_gemma":[0.99677444,0.001001683,0.00013529864,0.001943081,0.00008146114,0.000064022985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054785574,0.00021728667,0.0001969367,0.000118675416,0.00050630455,0.00021912919,0.0037578791,0.00017194093,0.000038118593],"category_scores_gemma":[0.00007424248,0.000143485,0.00009785509,0.00041538093,0.000230323,0.0001485236,0.0034394609,0.0018568349,0.000027864424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010283678,0.00006878964,0.00035642803,0.000005357373,0.00002064153,0.000022054757,0.00090083136,0.049940612,0.000034066055,0.946715,0.0011052071,0.00082072295],"study_design_scores_gemma":[0.00032265778,0.000030253957,0.002792303,0.00015722492,0.000017551358,0.00000405692,0.00015838562,0.9725311,0.000059010374,0.0117967175,0.011838957,0.00029179233],"about_ca_topic_score_codex":0.000018836326,"about_ca_topic_score_gemma":0.00008082932,"teacher_disagreement_score":0.9349183,"about_ca_system_score_codex":0.00003706474,"about_ca_system_score_gemma":0.000068860136,"threshold_uncertainty_score":0.8067127},"labels":[],"label_agreement":null},{"id":"W2953306742","doi":"10.48550/arxiv.1208.3024","title":"Uplink Multicell Processing with Limited Backhaul via Per-Base-Station Successive Interference Cancellation","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Base station; Telecommunications link; Decodes; Computer science; Single antenna interference cancellation; Computer network; Relay; Real-time computing; Decoding methods; Telecommunications","score_opus":0.10714966045578583,"score_gpt":0.22275379971816545,"score_spread":0.11560413926237961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953306742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10164565,0.00037871758,0.8959454,0.00018791751,0.00022520065,0.00037434892,0.0000035249145,0.00022898264,0.0010102203],"genre_scores_gemma":[0.9903374,0.0004525423,0.008263036,0.00010359514,0.00007444336,0.000004253955,0.00007188432,0.000023259136,0.000669585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981236,0.00025930718,0.0002594345,0.00087796716,0.00011182112,0.000367886],"domain_scores_gemma":[0.9973778,0.00016649738,0.00045414112,0.0011201326,0.00070011825,0.00018127979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024569716,0.0003645158,0.00029694926,0.00025140488,0.00037195257,0.00026613675,0.0015673297,0.00020082726,0.000055513803],"category_scores_gemma":[0.00002559942,0.00037402066,0.00007996241,0.00073225715,0.00012807739,0.00093279703,0.0012501022,0.0007134234,0.000066194305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020492151,0.00037550583,0.006224978,0.00033896643,0.0001435014,0.00006229679,0.006296931,0.8931406,0.0014310394,0.027099114,0.0001107385,0.0645714],"study_design_scores_gemma":[0.0004640631,0.000046996316,0.0009923482,0.0003459752,0.000058794973,0.000002447856,0.00008733743,0.99638367,0.0005658231,0.0003882745,0.00016919065,0.00049509207],"about_ca_topic_score_codex":0.000079878984,"about_ca_topic_score_gemma":0.00039697785,"teacher_disagreement_score":0.8886918,"about_ca_system_score_codex":0.00036144763,"about_ca_system_score_gemma":0.00029761854,"threshold_uncertainty_score":0.9998712},"labels":[],"label_agreement":null},{"id":"W2954741611","doi":"10.1049/iet-com.2018.6230","title":"Analytical model for optimal data transmission policy in two‐way relay network coding under phase type arrivals","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; Computer science; Linear network coding; Coding (social sciences); Transmission (telecommunications); Computer network; Telecommunications; Statistics; Mathematics","score_opus":0.20633749223982026,"score_gpt":0.44492628306462834,"score_spread":0.23858879082480808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954741611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033395912,0.0012604117,0.9756119,0.015689492,0.0000730383,0.00059145666,0.000018196555,0.00012557095,0.0032903184],"genre_scores_gemma":[0.7635659,0.0022563958,0.23263712,0.00076218904,0.000049553357,0.000032970172,0.00018969465,0.000017956248,0.00048822805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982353,0.000327022,0.0004678044,0.0004257438,0.00016741182,0.0003767379],"domain_scores_gemma":[0.9926815,0.0007648186,0.000112394395,0.006154079,0.00015769278,0.00012949033],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010937208,0.00017063135,0.0002673633,0.00016670965,0.00040496278,0.00016513557,0.0060528484,0.00006765009,0.000024677938],"category_scores_gemma":[0.00009266322,0.00017132657,0.00006618226,0.001187976,0.00008923755,0.0006566742,0.0021462308,0.0004018746,0.0000393577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036496913,0.0003326064,0.0002059908,0.000009349837,0.00003405224,2.8081303e-7,0.0009949998,0.27725232,0.0005706569,0.6792447,0.003459481,0.03785905],"study_design_scores_gemma":[0.0012341426,0.000043115295,0.000100562116,0.00008141587,0.000011168932,0.000002424087,0.00002437008,0.9701188,0.000014970223,0.00237327,0.025796704,0.00019905037],"about_ca_topic_score_codex":0.000020326303,"about_ca_topic_score_gemma":0.000123039,"teacher_disagreement_score":0.7602263,"about_ca_system_score_codex":0.0001097317,"about_ca_system_score_gemma":0.00029615915,"threshold_uncertainty_score":0.99932486},"labels":[],"label_agreement":null},{"id":"W2955518840","doi":"10.1371/journal.pone.0218647","title":"An enhanced heuristic XoR network coding-based method for high quality video streaming over VANETs","year":2019,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Linear network coding; Network packet; Computer network; Coding (social sciences); Video quality; Scalable Video Coding; Inter frame; Real-time computing; Frame (networking); Reference frame; Algorithm","score_opus":0.0736676953688332,"score_gpt":0.3337807337613585,"score_spread":0.26011303839252525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955518840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13922475,0.00012707493,0.8589575,0.0004374033,0.00014500179,0.0005666996,0.000006656397,0.00020557082,0.00032929986],"genre_scores_gemma":[0.708829,0.000027764578,0.28999734,0.0007765328,0.0001165421,0.00006046066,0.000024666182,0.000014072851,0.00015366451],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799556,0.0004885059,0.00035552264,0.00049620337,0.0003021619,0.0003620489],"domain_scores_gemma":[0.9967271,0.0014388477,0.00018906835,0.0012917968,0.00023483335,0.00011836701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035436,0.0001777135,0.00036431567,0.00005566888,0.0002352704,0.0001709553,0.00098381,0.00006820191,0.000106878906],"category_scores_gemma":[0.0001776925,0.00018053329,0.000060707138,0.00034268067,0.000022314378,0.00031518628,0.00017544748,0.00017359875,0.00003704001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032239905,0.004063702,0.005682472,0.0005269454,0.00050326716,0.000003387301,0.0016219469,0.029031537,0.5260711,0.32219458,0.0014441812,0.10853453],"study_design_scores_gemma":[0.0012066184,0.00032726626,0.007600782,0.0002745163,0.000036351663,1.9263852e-7,0.000008340305,0.9406467,0.046964597,0.0022068704,0.00031625354,0.00041150584],"about_ca_topic_score_codex":0.000018040957,"about_ca_topic_score_gemma":0.00007004808,"teacher_disagreement_score":0.9116152,"about_ca_system_score_codex":0.000068655994,"about_ca_system_score_gemma":0.00007406698,"threshold_uncertainty_score":0.73619336},"labels":[],"label_agreement":null},{"id":"W2958223037","doi":"10.1109/icc.2019.8761980","title":"Performance Analysis of Massive MIMO Multi-Way Relays with Low-Resolution ADCs","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Quantization (signal processing); Computer science; Channel state information; Transmission (telecommunications); Bit error rate; Relay channel; Electronic engineering; Topology (electrical circuits); Converters; Channel (broadcasting); Algorithm; Wireless; Telecommunications; Electrical engineering; Engineering; Power (physics); Physics","score_opus":0.021986200463922457,"score_gpt":0.25004749727115433,"score_spread":0.22806129680723186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958223037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5143255,0.00012457072,0.47790292,0.000319286,0.000055785207,0.0001950767,8.257498e-7,0.00006763212,0.007008436],"genre_scores_gemma":[0.9665405,0.00022335946,0.031534337,0.00013425898,0.000004534967,0.00000860363,0.0000048473007,0.0000034034585,0.0015461601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925655,0.0000628394,0.0001762214,0.00021108854,0.00015951155,0.00013376515],"domain_scores_gemma":[0.99880236,0.00006430063,0.00010719835,0.0007872844,0.0001997564,0.000039112616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017731238,0.00008504421,0.00017886737,0.00019234682,0.00007550252,0.000030896514,0.0005879409,0.00003007872,0.00012678295],"category_scores_gemma":[0.000008535823,0.00006299423,0.00005763492,0.0014603896,0.000032952834,0.0004010466,0.00021429175,0.00008996478,0.000056656452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010728845,0.00061534124,0.35358799,0.0000875714,0.0016523706,0.0000038093629,0.005199734,0.3688403,0.015519623,0.13770759,0.00086934253,0.115809046],"study_design_scores_gemma":[0.00025566202,0.00006813798,0.08954095,0.000026319361,0.00003249383,4.2645215e-7,0.000026081489,0.9082454,0.0012063626,0.0000011864631,0.00050380157,0.00009321138],"about_ca_topic_score_codex":0.000007713997,"about_ca_topic_score_gemma":0.00007438569,"teacher_disagreement_score":0.53940505,"about_ca_system_score_codex":0.00003121961,"about_ca_system_score_gemma":0.000031826057,"threshold_uncertainty_score":0.256883},"labels":[],"label_agreement":null},{"id":"W2958650793","doi":"10.1109/icc.2019.8761879","title":"Generalized User-Relay Selection in Network-Coded Cooperation Systems","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Independent and identically distributed random variables; Scheduling (production processes); Outage probability; Selection (genetic algorithm); Fading; Signal-to-noise ratio (imaging); Monte Carlo method; Mathematical optimization; Computer network; Algorithm; Decoding methods; Telecommunications; Mathematics; Random variable; Statistics; Artificial intelligence","score_opus":0.04281592673020312,"score_gpt":0.2854726780662404,"score_spread":0.24265675133603726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958650793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01837801,0.0022599592,0.9699291,0.0008594035,0.0025500127,0.0012806241,0.0000013125572,0.0004299147,0.004311674],"genre_scores_gemma":[0.9551094,0.0026833066,0.03152477,0.0006344896,0.000417889,0.00027310077,0.000080202975,0.000033138243,0.009243655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712926,0.0008342857,0.00065584556,0.000739574,0.00026463607,0.00037637225],"domain_scores_gemma":[0.99814343,0.00011964295,0.00024586002,0.0010799296,0.00033817734,0.00007295407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009733573,0.00032430078,0.00048313953,0.00021427064,0.00016960445,0.00078996795,0.0014609166,0.0003444924,0.000054903223],"category_scores_gemma":[0.000035133115,0.0003109218,0.00009231681,0.00075408875,0.000018250876,0.0003600021,0.001710107,0.0008228087,0.00012326532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058343835,0.000032058404,0.0008199517,0.000023489692,0.000021054366,8.68806e-7,0.00017363216,0.8498584,0.0002309041,0.13852094,0.008710638,0.0016022181],"study_design_scores_gemma":[0.00046336406,0.00002620076,0.0007829896,0.00019867028,0.0000055831683,0.0000045463257,0.000004319767,0.9826458,0.000088683366,0.000102398844,0.015304736,0.00037267778],"about_ca_topic_score_codex":0.00020326703,"about_ca_topic_score_gemma":0.0009572207,"teacher_disagreement_score":0.9384043,"about_ca_system_score_codex":0.00030461553,"about_ca_system_score_gemma":0.00029833947,"threshold_uncertainty_score":0.9999343},"labels":[],"label_agreement":null},{"id":"W2958671212","doi":"10.1109/icc.2019.8761280","title":"Cooperation-Based Interference Mitigation in Heterogeneous Cloud Radio Access Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Macrocell; Computer science; Computer network; Cognitive radio; Cloud computing; Interference (communication); Small cell; Integer programming; Relay; Remote radio head; Distributed computing; Cellular network; Base station; Transmitter; Telecommunications; Wireless; Algorithm","score_opus":0.028028842493818387,"score_gpt":0.2818998307564242,"score_spread":0.25387098826260585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958671212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10048057,0.00019596897,0.89443153,0.001071263,0.0004901935,0.0003058422,2.4797882e-7,0.0001337607,0.0028906367],"genre_scores_gemma":[0.9955329,0.00010764362,0.0024152186,0.0015818432,0.000042103766,0.000026176804,0.000011018303,0.0000068764607,0.00027626756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989067,0.00019312419,0.0002704548,0.00031668067,0.000110786255,0.00020229466],"domain_scores_gemma":[0.99886394,0.00016863714,0.000061486695,0.00071013795,0.00013760186,0.000058200236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026331615,0.00012357588,0.0001444725,0.000110923866,0.000080622296,0.0004300355,0.0013058587,0.000055331733,0.00024378736],"category_scores_gemma":[0.000026162223,0.00011534088,0.000035947418,0.00061913155,0.000023531838,0.00062039174,0.00030417892,0.00017586087,0.00008597788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003301358,0.00020257039,0.04469608,0.000018279181,0.000020408432,0.000008968471,0.00060773373,0.72391903,0.0015976916,0.14144403,0.0017469224,0.08570527],"study_design_scores_gemma":[0.00038543672,0.000043327742,0.0023304059,0.000044106575,7.671886e-7,0.0000023608482,0.0000031180816,0.9944726,0.0018435661,0.000081105434,0.0006349746,0.00015821001],"about_ca_topic_score_codex":0.000012466573,"about_ca_topic_score_gemma":0.00026618963,"teacher_disagreement_score":0.89505225,"about_ca_system_score_codex":0.000076169,"about_ca_system_score_gemma":0.000078090445,"threshold_uncertainty_score":0.47034648},"labels":[],"label_agreement":null},{"id":"W2962734879","doi":"10.1049/iet-com.2014.0278","title":"Differential dual‐hop relaying under user mobility","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Hop (telecommunications); Computer network; Dual (grammatical number); Differential (mechanical device); Telecommunications; Physics","score_opus":0.064921736127841,"score_gpt":0.3127007859638327,"score_spread":0.24777904983599172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962734879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022436813,0.00043108972,0.9358408,0.0170564,0.000256592,0.0002491108,0.000002315809,0.00047021575,0.02325667],"genre_scores_gemma":[0.964223,0.0007471103,0.033468865,0.0009047559,0.000040491614,0.00006543172,0.000019642472,0.000011896629,0.00051879283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998229,0.0007494308,0.00032680345,0.00028002373,0.00018120786,0.00023348916],"domain_scores_gemma":[0.9929746,0.0006634843,0.00010940004,0.0059555015,0.00019262178,0.0001044145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038217395,0.00014619864,0.00016993583,0.00008085684,0.00088692625,0.00023464729,0.0033691386,0.00006708804,0.00009001248],"category_scores_gemma":[0.0001304834,0.00014384341,0.00008841162,0.00047482652,0.00017242938,0.0004099835,0.002684036,0.0003953499,0.00015406626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018930903,0.0002587183,0.0005812879,0.0000039454117,0.000026082571,8.9222084e-8,0.00090654264,0.00017204518,0.0027101384,0.96009386,0.0022026647,0.033042736],"study_design_scores_gemma":[0.0011878785,0.00010125925,0.053218078,0.000102515274,0.000036955455,0.000013878132,0.00019918561,0.509256,0.0011494724,0.023347318,0.4104825,0.0009049951],"about_ca_topic_score_codex":0.000014898797,"about_ca_topic_score_gemma":0.00015225977,"teacher_disagreement_score":0.9417862,"about_ca_system_score_codex":0.00006318513,"about_ca_system_score_gemma":0.000047628364,"threshold_uncertainty_score":0.6821609},"labels":[],"label_agreement":null},{"id":"W2962798347","doi":"10.1109/twc.2016.2573835","title":"Power Allocation for Multi-Pair Massive MIMO Two-Way AF Relaying With Linear Processing","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Spectral efficiency; Upper and lower bounds; Beamforming; Topology (electrical circuits); Fading; Mathematics; Transmission (telecommunications); Maximal-ratio combining; MIMO; Channel state information; Relay channel; Signal-to-noise ratio (imaging); Computer science; Control theory (sociology); Channel (broadcasting); Mathematical optimization; Telecommunications; Power (physics); Wireless","score_opus":0.06125042082493675,"score_gpt":0.3148754679688066,"score_spread":0.25362504714386985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962798347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00263037,0.00025048357,0.98325443,0.012160079,0.00013820257,0.0007121102,0.00001893411,0.00044309322,0.00039229332],"genre_scores_gemma":[0.7977875,0.0005615213,0.2000474,0.00030379565,0.000015556481,0.0006509662,0.000006189059,0.00003655717,0.0005905302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981932,0.00029671143,0.00044288466,0.00047400955,0.00023763758,0.0003555647],"domain_scores_gemma":[0.9953648,0.0006752663,0.00023587683,0.0029221317,0.0006625075,0.00013945728],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00038381317,0.0002753374,0.00024705956,0.0002441896,0.0016200223,0.00015172911,0.0023048639,0.00009638683,0.000019950816],"category_scores_gemma":[0.000019609895,0.00020967667,0.00012247055,0.00076723576,0.00025957503,0.00093490037,0.000036478963,0.00034907783,0.000047243448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011829779,0.0014908732,0.000094702176,0.000038048493,0.00018301298,0.0000015642872,0.00438034,0.0067544654,0.03061025,0.039955106,0.00024187447,0.91613144],"study_design_scores_gemma":[0.004706429,0.00041308228,0.00031850845,0.001016535,0.0000715661,0.000022332946,0.00036846974,0.9417789,0.037508015,0.00022732127,0.012538866,0.0010299813],"about_ca_topic_score_codex":0.000007807996,"about_ca_topic_score_gemma":0.0002629779,"teacher_disagreement_score":0.93502444,"about_ca_system_score_codex":0.0001960274,"about_ca_system_score_gemma":0.00019671043,"threshold_uncertainty_score":0.99967974},"labels":[],"label_agreement":null},{"id":"W2963067051","doi":"10.1109/comst.2014.2320096","title":"A Survey on Network Tomography With Network Coding","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Network tomography; Tomography; Computer science; Computed tomography; Network topology; Data mining; Coding (social sciences); Artificial intelligence; Topology (electrical circuits); Machine learning; Algorithm; Computer network; Mathematics; Medicine; Statistics","score_opus":0.07329320852071244,"score_gpt":0.30293298713805844,"score_spread":0.229639778617346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963067051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003496061,0.0016970336,0.9676107,0.0019373007,0.0038018336,0.0008957545,0.000021332862,0.00089784287,0.019642103],"genre_scores_gemma":[0.96888334,0.0015276743,0.027242567,0.0008377808,0.0009761525,0.00014055672,0.00011295642,0.000045895187,0.00023309015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9836954,0.013777309,0.00072892377,0.00060744997,0.00047932658,0.0007116006],"domain_scores_gemma":[0.9836123,0.0075505925,0.00042886825,0.007494354,0.0006910927,0.00022279136],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.016055312,0.00039529504,0.00059588865,0.00017077841,0.0016524285,0.00053721626,0.005924532,0.00014337928,0.000020917658],"category_scores_gemma":[0.00056762446,0.00035609113,0.00013263203,0.0028382072,0.00032834866,0.00044736473,0.0009929405,0.00059346686,0.00011768047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008316295,0.00067111,0.067066155,0.000017164335,0.00041001439,0.0000027061963,0.0010427217,0.030969743,0.0002726793,0.67522764,0.108782284,0.11545459],"study_design_scores_gemma":[0.0023345307,0.0008518076,0.51032305,0.00066426076,0.000060831233,0.00001076413,0.000017667267,0.06616319,0.00022426601,0.004596341,0.41262138,0.0021318966],"about_ca_topic_score_codex":0.00015619343,"about_ca_topic_score_gemma":0.0036360824,"teacher_disagreement_score":0.9653873,"about_ca_system_score_codex":0.00009129347,"about_ca_system_score_gemma":0.00018348251,"threshold_uncertainty_score":0.99988914},"labels":[],"label_agreement":null},{"id":"W2963163286","doi":"10.1109/tcomm.2018.2863377","title":"Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Low-density parity-check code; Algorithm; Binary number; Generator matrix; Logarithm; Mathematics; Upper and lower bounds; Encoder; Estimator; Decoding methods; Computer science; Arithmetic; Statistics","score_opus":0.10097820859671244,"score_gpt":0.3284064398404089,"score_spread":0.22742823124369646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963163286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014283865,0.0005209003,0.9808964,0.017255466,0.000091083195,0.0005597899,0.000019783945,0.0001425197,0.0003712209],"genre_scores_gemma":[0.8646034,0.0032879028,0.13056763,0.000655437,0.000016841339,0.00038092403,0.000003838135,0.000010958714,0.00047310148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988064,0.00036290847,0.00025286566,0.00026568325,0.00011839067,0.00019374909],"domain_scores_gemma":[0.99490297,0.0017441235,0.00008416338,0.0029158464,0.00028588154,0.00006700408],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00055519893,0.0001396327,0.00015449495,0.00023117791,0.0023169024,0.0001906678,0.0022419002,0.000057418096,0.000026051888],"category_scores_gemma":[0.0000074726872,0.00011229332,0.00011707982,0.0014184726,0.00047466735,0.00025548256,0.00004305354,0.00026118383,0.000022578244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001463606,0.0019420042,0.00015757351,0.000027514427,0.0038719145,0.0000010065618,0.0100201545,0.12829442,0.0038905684,0.19257198,0.0042368732,0.65483963],"study_design_scores_gemma":[0.00038406218,0.00018102622,0.00074483454,0.000019036177,0.00028625285,0.0000064621095,0.00008997744,0.9801654,0.0012948253,0.0020951824,0.014520994,0.00021194483],"about_ca_topic_score_codex":0.000015957132,"about_ca_topic_score_gemma":0.0011580786,"teacher_disagreement_score":0.8644605,"about_ca_system_score_codex":0.000054014065,"about_ca_system_score_gemma":0.000076731674,"threshold_uncertainty_score":0.99898195},"labels":[],"label_agreement":null},{"id":"W2963230393","doi":"10.1109/cns.2013.6682710","title":"Efficient codes for Limited View adversarial channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Code word; Decoding methods; Computer science; Code (set theory); Adversarial system; Adversary; Channel (broadcasting); List decoding; Construct (python library); Theoretical computer science; Bounded function; Algorithm; Mathematics; Computer network; Computer security; Artificial intelligence; Block code; Concatenated error correction code; Programming language","score_opus":0.04862369385681635,"score_gpt":0.2831540602000974,"score_spread":0.23453036634328106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963230393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004544789,0.00029501488,0.9845542,0.0045867683,0.00044232607,0.0005388864,4.725808e-7,0.000180792,0.004856775],"genre_scores_gemma":[0.9518521,0.00007544874,0.0451709,0.0014769424,0.00008992552,0.00015245214,0.0000031674226,0.0000051326374,0.0011739638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993774,0.000051907005,0.00013868156,0.00017768219,0.00008414146,0.00017014977],"domain_scores_gemma":[0.99909574,0.00017767852,0.000033627017,0.00044208497,0.00018905426,0.000061787614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017813517,0.00007682278,0.000100220226,0.000044202297,0.00016977846,0.00017115774,0.00064679,0.000025712405,0.00016712835],"category_scores_gemma":[0.00004898196,0.00006128397,0.00004863054,0.00023053901,0.000020082085,0.000104761515,0.00025696444,0.00004660814,0.00018499259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005435432,0.00014676501,0.000021566688,0.000013572022,0.000028046781,2.8381558e-7,0.001080981,0.004442665,0.0025955706,0.5378572,0.025473628,0.4283343],"study_design_scores_gemma":[0.00031673742,0.00004151272,0.0001225698,0.000013166766,0.0000017232786,8.2324675e-7,0.000013783596,0.94682956,0.0008403386,0.00049272145,0.05121997,0.00010711108],"about_ca_topic_score_codex":0.0000057903894,"about_ca_topic_score_gemma":0.0000046099276,"teacher_disagreement_score":0.9473073,"about_ca_system_score_codex":0.000018698258,"about_ca_system_score_gemma":0.000022466966,"threshold_uncertainty_score":0.24990878},"labels":[],"label_agreement":null},{"id":"W2963245750","doi":"10.1109/allerton.2018.8635644","title":"Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes","year":2018,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Decoding methods; Network packet; Computer science; Information-theoretic security; Theoretical computer science; Algorithm; Coding theory; Concatenated error correction code; Mathematics; Computer network; Cryptography; Block code","score_opus":0.05345262828339977,"score_gpt":0.3038770189518923,"score_spread":0.25042439066849254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963245750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03321464,0.00094013877,0.9541525,0.0006619376,0.00042715346,0.00020579195,5.043492e-7,0.000315324,0.010082001],"genre_scores_gemma":[0.7625567,0.0005117571,0.23551369,0.0007141873,0.00023770762,0.0000031421828,0.0000015645004,0.000008195723,0.0004530778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989822,0.00008282559,0.00021161124,0.0003138073,0.0001204098,0.00028913398],"domain_scores_gemma":[0.9989777,0.00010902815,0.00007265646,0.00055758643,0.00019094154,0.00009206782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004739289,0.000122041565,0.00017207005,0.000044844288,0.00062468834,0.00028329683,0.00051865756,0.00006468929,0.000055691642],"category_scores_gemma":[0.000042802654,0.000115362316,0.000026964497,0.00046282695,0.00011538238,0.00037517634,0.0007054617,0.00015521611,0.000018628994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001596102,0.00028159595,0.029417038,0.00007426023,0.00023509281,0.00003401606,0.011829651,0.0055435672,0.071629345,0.62472636,0.04819024,0.20787926],"study_design_scores_gemma":[0.0003513389,0.000058986225,0.0004753717,0.000073125164,0.0000049569026,0.000015056943,0.000024811377,0.98571056,0.0014632513,0.00049541646,0.01114159,0.00018554847],"about_ca_topic_score_codex":0.00003656105,"about_ca_topic_score_gemma":0.00018575478,"teacher_disagreement_score":0.980167,"about_ca_system_score_codex":0.000027986762,"about_ca_system_score_gemma":0.000035278954,"threshold_uncertainty_score":0.48046607},"labels":[],"label_agreement":null},{"id":"W2963333837","doi":"10.1109/twc.2014.2332166","title":"Fading Two-Way Relay Channels: Physical-Layer Versus Digital Network Coding","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear network coding; Computer science; Fading; Relay; Channel state information; Transmission (telecommunications); Physical layer; Code word; Channel (broadcasting); Computer network; Algorithm; Coding (social sciences); Energy (signal processing); Node (physics); Decoding methods; Network packet; Wireless; Telecommunications; Mathematics","score_opus":0.06250371100567122,"score_gpt":0.3020524200491395,"score_spread":0.2395487090434683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963333837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072118314,0.00013276964,0.9779121,0.0026778567,0.0010856172,0.0002845058,0.000007895614,0.0006271408,0.0100602275],"genre_scores_gemma":[0.99006945,0.00085115567,0.00797269,0.00030372434,0.00017514858,0.00017564755,0.000013112346,0.000041471292,0.00039758746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977293,0.0004940215,0.00043839848,0.00049818994,0.0003261528,0.00051390723],"domain_scores_gemma":[0.99333936,0.0018071725,0.00018214122,0.0042455764,0.00022091846,0.0002048029],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004454598,0.00032986136,0.000350722,0.00019580057,0.0020588234,0.00060082023,0.003604021,0.00008897856,0.000019592531],"category_scores_gemma":[0.000027298944,0.00034774712,0.00023040401,0.0012755384,0.0002250835,0.0010542867,0.00010334405,0.0008621932,0.00026764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047752575,0.0007713915,0.000016512757,0.000010840301,0.0001762694,0.0000010713871,0.002932841,0.17766476,0.0013933363,0.26845714,0.0006939397,0.54783416],"study_design_scores_gemma":[0.0011974166,0.00014631833,0.00002488953,0.00013579144,0.000031479733,0.0000059589684,0.000058569924,0.9797408,0.0017250722,0.0007086275,0.015727565,0.0004974938],"about_ca_topic_score_codex":0.00001102241,"about_ca_topic_score_gemma":0.00009317554,"teacher_disagreement_score":0.98285764,"about_ca_system_score_codex":0.00015821395,"about_ca_system_score_gemma":0.000056741825,"threshold_uncertainty_score":0.9998975},"labels":[],"label_agreement":null},{"id":"W2963368320","doi":"10.1109/tit.2017.2664811","title":"Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Notation; Mathematics; Discrete mathematics; Algorithm; Computer science; Arithmetic","score_opus":0.0322578583127779,"score_gpt":0.28179019127044364,"score_spread":0.24953233295766575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963368320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014764487,0.000011992937,0.9815516,0.0006067187,0.00026218357,0.00013457568,0.000013618573,0.000051585983,0.0026032631],"genre_scores_gemma":[0.99877757,0.000064568594,0.0004802409,0.00055664644,0.000006933981,0.000022843178,0.0000038204385,0.0000029423395,0.00008444298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990476,0.00016067,0.0003186876,0.00010246946,0.00024023229,0.00013036624],"domain_scores_gemma":[0.9976223,0.00052118703,0.0002988947,0.0013504084,0.00016220182,0.0000450205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089464686,0.00010293348,0.00014808009,0.00063204864,0.0010877221,0.00032515376,0.0011583297,0.000051525123,0.00015174657],"category_scores_gemma":[0.000069814014,0.00007541429,0.00014721425,0.00091610174,0.000110419984,0.0012323589,0.000013553398,0.00023524498,0.00009890046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007515458,0.0000835776,0.000018586612,0.000009162558,0.00035295569,2.1968913e-7,0.0022025895,0.0162136,0.00013214999,0.11250422,0.00016864354,0.86823916],"study_design_scores_gemma":[0.00053163734,0.00017839899,0.00667623,0.00003514815,0.00021940104,0.000003118562,0.00021111479,0.972695,0.01467709,0.0025738953,0.0018864847,0.00031247883],"about_ca_topic_score_codex":0.000008250617,"about_ca_topic_score_gemma":0.000020230862,"teacher_disagreement_score":0.9840131,"about_ca_system_score_codex":0.00005013366,"about_ca_system_score_gemma":0.000037177415,"threshold_uncertainty_score":0.8365989},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04484471352069685,"score_gpt":0.27558948873560074,"score_spread":0.23074477521490389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963415238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004952641,0.000528313,0.98940307,0.001698959,0.00032169407,0.0002952202,0.0000105422705,0.00028241388,0.0025071558],"genre_scores_gemma":[0.91785944,0.0037143738,0.077741176,0.00017673607,0.000016125028,0.0001288905,0.000009603924,0.000015592412,0.00033807172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829376,0.0004571157,0.0004191866,0.00037532742,0.00021091795,0.00024369615],"domain_scores_gemma":[0.99570805,0.0004110252,0.00017008436,0.0031199453,0.00046575567,0.0001251153],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004108372,0.00020352911,0.00024772488,0.0005332222,0.0018521344,0.00027573208,0.0016534635,0.00009776672,0.000046866724],"category_scores_gemma":[0.000016800937,0.00020910049,0.00011000244,0.0021326886,0.00030089068,0.00071882486,0.00005748813,0.0003781513,0.000057013873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048885293,0.0010194837,0.00095947797,0.000037886028,0.0014817845,0.0000016369241,0.009484978,0.84348524,0.0010643512,0.023393717,0.0007183082,0.11830426],"study_design_scores_gemma":[0.0002709609,0.0001050477,0.0009876445,0.00005649364,0.000116028,0.0000053745985,0.00019174452,0.9949922,0.0006713956,0.000011041836,0.002350537,0.00024154049],"about_ca_topic_score_codex":0.000029586401,"about_ca_topic_score_gemma":0.00020664812,"teacher_disagreement_score":0.91290677,"about_ca_system_score_codex":0.00010650068,"about_ca_system_score_gemma":0.00006654181,"threshold_uncertainty_score":0.99944735},"labels":[],"label_agreement":null},{"id":"W2963513015","doi":"10.1109/itwksps.2010.5503153","title":"Overlapped Chunked network coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Linear network coding; Decoding methods; Computer science; Encoding (memory); Coding (social sciences); Computational complexity theory; Context (archaeology); Redundancy (engineering); Theoretical computer science; Algorithm; Mathematics; Computer network; Artificial intelligence","score_opus":0.02486430189097878,"score_gpt":0.2684186635365173,"score_spread":0.2435543616455385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963513015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014385023,0.000063680534,0.8591687,0.0021163481,0.0009380034,0.000102592385,1.061923e-7,0.00042481243,0.12280074],"genre_scores_gemma":[0.8686985,0.00005687747,0.12901936,0.00093601533,0.00017387873,0.0000069222865,9.849258e-7,0.0000045117476,0.0011029798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931717,0.000040649753,0.00014171748,0.000183217,0.000105568375,0.00021170129],"domain_scores_gemma":[0.99895805,0.00009673531,0.000037693942,0.00076962734,0.0000619758,0.00007592941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033453884,0.000078714766,0.00008508829,0.000027824,0.00031047236,0.00016799645,0.0009784355,0.000038387272,0.00029018143],"category_scores_gemma":[0.00003587234,0.000069007314,0.000036176043,0.00037209268,0.000026041605,0.0002735921,0.0004533528,0.00024265944,0.00014346038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.5167833e-7,0.0000124295775,0.0004371428,6.5923126e-7,0.000004252546,6.223245e-7,0.00016261639,0.000021703268,0.013343424,0.9050848,0.005989244,0.07494238],"study_design_scores_gemma":[0.00056537066,0.000033313983,0.016905019,0.000020560086,0.0000035988976,0.000016380553,0.000017187685,0.5647097,0.002918491,0.007864746,0.40643933,0.00050628843],"about_ca_topic_score_codex":0.0000010851935,"about_ca_topic_score_gemma":0.00010995401,"teacher_disagreement_score":0.89722,"about_ca_system_score_codex":0.000007519738,"about_ca_system_score_gemma":0.000033964785,"threshold_uncertainty_score":0.3177283},"labels":[],"label_agreement":null},{"id":"W2963652650","doi":"","title":"On the Optimality of Successive Decoding in Compress-and-Forward Relay Schemes","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Relay; Encoding (memory); Computer science; Joint (building); Sequential decoding; Algorithm; List decoding; Process (computing); Block (permutation group theory); Theoretical computer science; Mathematics; Block code; Artificial intelligence; Combinatorics; Power (physics); Concatenated error correction code; Engineering","score_opus":0.07162757057344256,"score_gpt":0.2139959597698551,"score_spread":0.14236838919641254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963652650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91058016,0.000028789902,0.08521403,0.00043421262,0.000063581996,0.00008616307,6.47091e-7,0.000026872434,0.0035655138],"genre_scores_gemma":[0.9986293,0.00012447694,0.000996487,0.00011424737,0.0000060356488,4.006716e-7,3.9560035e-7,0.0000027201775,0.00012594202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993721,0.00012475243,0.00010673615,0.00023317194,0.00004189538,0.00012130287],"domain_scores_gemma":[0.9986206,0.00058779644,0.00008477604,0.00058984733,0.00007309292,0.000043846856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033065793,0.000079202335,0.000109374676,0.000081494705,0.00015035576,0.000034535537,0.00089960214,0.000041176903,0.000031482778],"category_scores_gemma":[0.000117464224,0.000065748136,0.00003509222,0.00046571097,0.00013634477,0.00025621193,0.0004689296,0.00029425073,0.000006386885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008789478,0.000029697696,0.007491012,0.0000025210832,0.000006910532,0.000005423538,0.00021402196,0.0029618058,0.0006736493,0.987504,0.000036180714,0.0010659862],"study_design_scores_gemma":[0.0005011874,0.000041173575,0.013186537,0.000050724924,0.0000062871713,0.0000015701834,0.000091043104,0.97432715,0.0025825598,0.0082287835,0.0008053062,0.0001777017],"about_ca_topic_score_codex":0.0000150425,"about_ca_topic_score_gemma":0.00012075548,"teacher_disagreement_score":0.9792752,"about_ca_system_score_codex":0.000017412176,"about_ca_system_score_gemma":0.000025718087,"threshold_uncertainty_score":0.2681131},"labels":[],"label_agreement":null},{"id":"W2963654161","doi":"10.1109/icc.2017.7997436","title":"A closed-form symbol error rate analysis for successive interference cancellation decoders","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Independent and identically distributed random variables; Interference (communication); Single antenna interference cancellation; Gaussian; Algorithm; Computer science; Decoding methods; Symbol (formal); Expression (computer science); Speech recognition; Mathematics; Random variable; Channel (broadcasting); Statistics; Telecommunications; Physics","score_opus":0.08145924821101806,"score_gpt":0.35252035437692053,"score_spread":0.27106110616590245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963654161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01704455,0.00006263949,0.9735172,0.0030431433,0.0001580007,0.00021708796,0.0000020660177,0.00007066623,0.005884639],"genre_scores_gemma":[0.9870927,0.00011308528,0.010495426,0.00031194068,0.000028659046,0.000051552648,0.0000069832518,0.0000042623788,0.0018954063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919176,0.000051340547,0.00019913435,0.0002913649,0.00008022477,0.00018620267],"domain_scores_gemma":[0.9980375,0.0001901254,0.00022063193,0.0012238001,0.00026156948,0.000066364024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003263205,0.00010859524,0.00017817212,0.00012091288,0.00081685313,0.0006013998,0.0016948894,0.00003549854,0.00006153505],"category_scores_gemma":[0.00014742035,0.00009288431,0.00011180467,0.00024202562,0.000052564854,0.0007007828,0.000396471,0.00007372485,0.000014066765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008434022,0.00013009265,0.04833341,0.000036272948,0.0010378098,0.0000037314708,0.0069566458,0.0049269437,0.0024399909,0.36274672,0.0040500243,0.56925404],"study_design_scores_gemma":[0.00030627186,0.000033537184,0.030319242,0.000015660396,0.000041326213,1.885057e-7,0.000053563836,0.9654615,0.0013693742,0.0011393942,0.0010881615,0.00017177041],"about_ca_topic_score_codex":0.00006815603,"about_ca_topic_score_gemma":0.004538205,"teacher_disagreement_score":0.9700481,"about_ca_system_score_codex":0.00005357758,"about_ca_system_score_gemma":0.000064493586,"threshold_uncertainty_score":0.6282656},"labels":[],"label_agreement":null},{"id":"W2963690625","doi":"10.1109/isit.2016.7541583","title":"An achievable rate region for the two-way multiple relay channel","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Relay; Computer science; Relay channel; Channel (broadcasting); Coding (social sciences); Algorithm; Decoding methods; Channel code; Theoretical computer science; Topology (electrical circuits); Computer network; Mathematics; Statistics; Combinatorics","score_opus":0.07086515015262111,"score_gpt":0.2980095458674674,"score_spread":0.2271443957148463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963690625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017100291,0.00016234287,0.9800281,0.016242497,0.00020815399,0.00026196058,4.2989222e-7,0.00015219618,0.0012342839],"genre_scores_gemma":[0.98472685,0.00043150617,0.0089853965,0.0012262741,0.0000915508,0.00007607019,8.55052e-7,0.000007384805,0.004454139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992544,0.0001449454,0.00012319749,0.00022373894,0.0000649675,0.00018872276],"domain_scores_gemma":[0.9979146,0.0008090181,0.00004811564,0.0010563643,0.00011690421,0.000054959848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054996734,0.000082820174,0.00007322294,0.000028974424,0.00043933003,0.000112436166,0.0011576228,0.000022895065,0.000014940464],"category_scores_gemma":[0.000090802256,0.000039489485,0.000042366984,0.00016715175,0.00003778456,0.00048388107,0.00020221512,0.000051414016,0.0000375034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006370723,0.000114204886,0.0003514811,0.0000035346375,0.000029811741,0.0000012257448,0.0013710003,0.000997711,0.017151847,0.43034357,0.018794555,0.53077734],"study_design_scores_gemma":[0.0011562546,0.00015823763,0.0010011499,0.000026498883,0.0000038289804,0.000004776643,0.000037696747,0.8863781,0.0061062262,0.0017006206,0.10323439,0.00019221686],"about_ca_topic_score_codex":0.00000672289,"about_ca_topic_score_gemma":0.00012610818,"teacher_disagreement_score":0.9830168,"about_ca_system_score_codex":0.000021876334,"about_ca_system_score_gemma":0.00002060743,"threshold_uncertainty_score":0.3379016},"labels":[],"label_agreement":null},{"id":"W2964049511","doi":"10.1109/isit.2016.7541620","title":"Adaptation is useless for two discrete additive-noise two-way channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Coding (social sciences); Channel (broadcasting); Encoder; Channel code; Adaptation (eye); Modulo; Noise (video); Channel capacity; Theoretical computer science; Decoding methods; Algorithm; Computer network; Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.06346953938546349,"score_gpt":0.31335482804951054,"score_spread":0.24988528866404705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964049511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016627875,0.000117895586,0.9885629,0.005850407,0.00025339422,0.00029156805,0.000014264018,0.00015812009,0.0030886736],"genre_scores_gemma":[0.96795905,0.00025331308,0.024894647,0.0011439912,0.00014740082,0.0001240655,0.0000073019123,0.000011133739,0.0054591144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990723,0.000093566654,0.00019007568,0.00027229608,0.00013753603,0.00023420855],"domain_scores_gemma":[0.9986357,0.0003720344,0.00007648195,0.0005880184,0.00024232856,0.00008543422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002548834,0.0001254532,0.00012786327,0.00006688944,0.00022359085,0.00013185733,0.0007315558,0.00002405078,0.00020659214],"category_scores_gemma":[0.000047794303,0.000082887964,0.00006948831,0.00022802263,0.000040523006,0.00067551236,0.00025127444,0.00004556732,0.00010780294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010977752,0.000023628765,0.000020816458,0.0000021094095,0.000017476797,3.318829e-7,0.0013860908,0.000057940633,0.0040480713,0.29736626,0.0072768093,0.6897895],"study_design_scores_gemma":[0.0037056191,0.00019544721,0.00038102266,0.00017929847,0.000013099237,0.0000049933897,0.00015987204,0.73308134,0.06655404,0.008446775,0.18657984,0.0006986275],"about_ca_topic_score_codex":0.000007634398,"about_ca_topic_score_gemma":0.00006174157,"teacher_disagreement_score":0.96629626,"about_ca_system_score_codex":0.000040902603,"about_ca_system_score_gemma":0.000038822778,"threshold_uncertainty_score":0.3380073},"labels":[],"label_agreement":null},{"id":"W2964297291","doi":"10.1109/tvt.2012.2204076","title":"Power Allocation and Pricing in Multiuser Relay Networks Using Stackelberg and Bargaining Games","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Stackelberg competition; Computer science; Computer network; Relay channel; Game theory; Mathematical optimization; Bargaining problem; Transmitter power output; Power (physics); Microeconomics; Economics; Mathematics; Transmitter","score_opus":0.02073356214646539,"score_gpt":0.2634734184447827,"score_spread":0.24273985629831735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964297291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3223079,0.0013949012,0.67550665,0.0004331276,0.000091847076,0.00011289935,1.577003e-7,0.00011330524,0.000039198632],"genre_scores_gemma":[0.97246045,0.0008767905,0.026453622,0.00015225618,0.000008437783,0.000021644611,3.1164657e-7,0.000011459035,0.000015057239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907625,0.00010356284,0.00020319308,0.0002547996,0.00007939834,0.00028280512],"domain_scores_gemma":[0.9993393,0.00009011793,0.000055481833,0.0004093692,0.00004861897,0.000057117362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032594748,0.00013318496,0.00015238448,0.00039699615,0.00023113414,0.000044048666,0.0002191416,0.00017779309,0.0000051217776],"category_scores_gemma":[0.000012038269,0.00013555886,0.000020811296,0.00070048537,0.000094900315,0.00041485432,0.000018552455,0.00042528322,0.0000021406238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034734036,0.0005897582,0.014227952,0.000023860865,0.00014342072,0.000018076966,0.0067930585,0.19705214,0.035856675,0.055234354,0.000023833096,0.69000214],"study_design_scores_gemma":[0.0005633278,0.00007158248,0.0026747636,0.00010915339,0.000011997635,0.00007128688,0.00023029091,0.98789996,0.00714512,0.00013178904,0.00081327953,0.00027742446],"about_ca_topic_score_codex":0.0000066820544,"about_ca_topic_score_gemma":0.000030366691,"teacher_disagreement_score":0.79084784,"about_ca_system_score_codex":0.00006463668,"about_ca_system_score_gemma":0.000015733496,"threshold_uncertainty_score":0.552793},"labels":[],"label_agreement":null},{"id":"W2964393088","doi":"10.22215/etd/2015-11138","title":"Enhancing Rates In Relay Channels","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Generalization; Relay; Computer science; Decoding methods; Channel (broadcasting); Constraint (computer-aided design); Coding (social sciences); Relay channel; Algorithm; Gaussian; Transmission (telecommunications); Theoretical computer science; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Statistics; Combinatorics","score_opus":0.045888354802582756,"score_gpt":0.3358886039801976,"score_spread":0.29000024917761485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964393088","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12205793,0.023304975,0.11081604,0.002865466,0.010507009,0.0016187147,0.0000016128226,0.0011869278,0.72764134],"genre_scores_gemma":[0.87375534,0.002531595,0.016041365,0.0005284679,0.00019231049,0.00011692043,0.00023533298,0.000036890768,0.10656176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989471,0.00011810668,0.0002828008,0.00029390884,0.00017624699,0.00018185616],"domain_scores_gemma":[0.99897933,0.000080120546,0.00009597909,0.00057468965,0.00020868788,0.00006116582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050000957,0.00015614057,0.00020673602,0.00020646266,0.00006848736,0.00016328976,0.0009915162,0.00012603476,0.000064587744],"category_scores_gemma":[0.0000905821,0.00014541205,0.000036708916,0.0005324946,0.000006140815,0.00027873568,0.00013841677,0.00030652768,0.00013535982],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053301785,0.00034876834,0.00033508294,0.00019264824,0.00008487618,0.000056369416,0.0603634,0.0012669329,0.011896618,0.34921572,0.048165333,0.528021],"study_design_scores_gemma":[0.0046022334,0.00058995653,0.008771043,0.0054593445,0.00004554617,0.000030547984,0.00791828,0.50190574,0.16693065,0.044212203,0.25277054,0.0067639397],"about_ca_topic_score_codex":0.000017193697,"about_ca_topic_score_gemma":0.0027367307,"teacher_disagreement_score":0.7516974,"about_ca_system_score_codex":0.00008021283,"about_ca_system_score_gemma":0.00019324238,"threshold_uncertainty_score":0.5929731},"labels":[],"label_agreement":null},{"id":"W2965986362","doi":"10.1109/lwc.2019.2932673","title":"Secrecy Outage Performance of Opportunistic Relay Selection With Limited CSI Feedback","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Hubei Key Laboratory of Intelligent Wireless Communications; China Scholarship Council; National Natural Science Foundation of China","keywords":"Secrecy; Relay; Computer science; Selection (genetic algorithm); Expression (computer science); Computer network; Signal-to-noise ratio (imaging); Outage probability; Topology (electrical circuits); Fading; Telecommunications; Mathematics; Computer security; Power (physics); Channel (broadcasting); Artificial intelligence; Physics","score_opus":0.03317512131693756,"score_gpt":0.24921568125484866,"score_spread":0.2160405599379111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965986362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8948127,0.00011232089,0.09727668,0.0053271097,0.00014675285,0.00038854798,0.000003300465,0.00019875928,0.001733805],"genre_scores_gemma":[0.9795773,0.0009020303,0.018039117,0.001042527,0.000017912085,0.00005029927,0.000030181645,0.000022202874,0.00031842658],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984183,0.0003322846,0.00041588262,0.00030567037,0.00026665197,0.00026124675],"domain_scores_gemma":[0.9957186,0.00029708704,0.00030744547,0.0033125712,0.0002796543,0.00008462393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000366117,0.0001989881,0.00027171834,0.00021175512,0.0003453688,0.00009979227,0.0029636344,0.000062280575,0.000025161362],"category_scores_gemma":[0.000012706768,0.00018795747,0.00006256921,0.0010763357,0.00019778096,0.00060974463,0.0004497747,0.00043243374,0.00008288306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019042262,0.0010803397,0.11735161,0.0002861081,0.00045628706,0.0000050354247,0.007131601,0.027567819,0.5376755,0.15213536,0.0029671108,0.1531528],"study_design_scores_gemma":[0.0010608642,0.00028456398,0.01695546,0.00038919656,0.000030296265,0.000038011745,0.00008765618,0.967079,0.00648365,0.000016030419,0.0069845915,0.00059069967],"about_ca_topic_score_codex":0.000014120323,"about_ca_topic_score_gemma":0.000046446406,"teacher_disagreement_score":0.9395112,"about_ca_system_score_codex":0.00009851827,"about_ca_system_score_gemma":0.000109722154,"threshold_uncertainty_score":0.76646835},"labels":[],"label_agreement":null},{"id":"W2967019764","doi":"10.1109/access.2019.2935692","title":"The Joint Impact of Fading Severity, Irregular Constellation, and Non-Gaussian Noise on Signal Space Diversity-Based Relaying Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Academy of Finland","keywords":"Fading; Computer science; Antenna diversity; Noise (video); Nakagami distribution; Gaussian noise; Signal-to-noise ratio (imaging); Rotation (mathematics); Algorithm; Gaussian; Telecommunications; Mathematics; Antenna (radio); Artificial intelligence; Decoding methods; Physics","score_opus":0.034988326584238734,"score_gpt":0.2880919820517055,"score_spread":0.25310365546746677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967019764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58704907,0.00019854662,0.40760812,0.0012307501,0.00031516625,0.00035355485,0.0000012283932,0.00005095465,0.0031925805],"genre_scores_gemma":[0.99924034,0.00012406631,0.0003353464,0.00022875526,0.00003206205,0.0000013580153,0.0000011933694,0.000006166782,0.000030700787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999023,0.00015235995,0.00018583145,0.00023131252,0.00021065268,0.00019682202],"domain_scores_gemma":[0.9986609,0.000374353,0.00017310443,0.0006048697,0.000113169495,0.000073597985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050716155,0.00012709072,0.00016708067,0.00008009115,0.0006275201,0.0003461173,0.0010382022,0.00004936612,0.000018278826],"category_scores_gemma":[0.000011075771,0.00009383221,0.000076311815,0.00037534174,0.00009001961,0.0004416881,0.0010574517,0.00019607163,0.000005351965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009442096,0.00008374196,0.33125913,0.00003346058,0.00011540158,0.0000065963523,0.0013074663,0.6159402,0.002467478,0.0073679215,0.0026065926,0.038717568],"study_design_scores_gemma":[0.00044881698,0.000081600985,0.07560315,0.000114251576,0.0000065108966,0.0000021435776,0.000016160071,0.9219085,0.0012651973,0.00026146937,0.00013486545,0.0001573188],"about_ca_topic_score_codex":0.00003337814,"about_ca_topic_score_gemma":0.000012917171,"teacher_disagreement_score":0.41219127,"about_ca_system_score_codex":0.00006389255,"about_ca_system_score_gemma":0.00006363127,"threshold_uncertainty_score":0.48264405},"labels":[],"label_agreement":null},{"id":"W2969357591","doi":"10.1145/3340242","title":"Scheduling for Optimal File-Transfer Delay using Chunked Random Linear Network Coding Broadcast","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Network packet; File transfer; Scheduling (production processes); Queue; Coding (social sciences); Decoding methods; Random access; Sliding window protocol; Computer network; Algorithm; Transfer (computing); Parallel computing; Mathematical optimization; Mathematics; Window (computing); Operating system","score_opus":0.09564641001174279,"score_gpt":0.32716681870277636,"score_spread":0.23152040869103357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969357591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41926023,0.00036440275,0.57925206,0.000031440144,0.00043838695,0.0005589204,0.000005415683,0.000057291356,0.000031853626],"genre_scores_gemma":[0.9083639,0.00022096882,0.091151595,0.00003681213,0.00013315375,0.0000357646,0.000016437347,0.000019306462,0.000022062368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977993,0.00030545949,0.0006691777,0.00040428853,0.00050695415,0.0003148421],"domain_scores_gemma":[0.9977003,0.00057479757,0.00015124219,0.0006834733,0.0008209428,0.000069263035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033305467,0.00021650398,0.00037902105,0.00017540727,0.00070569216,0.00013191215,0.0005309941,0.000102430684,0.000024444602],"category_scores_gemma":[0.00005253466,0.00021675989,0.00011122436,0.000394076,0.000027441323,0.00042031528,0.000029862576,0.00025474076,0.000005025935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057134093,0.000023568266,0.000039972503,0.000072286704,0.00004457928,3.2149636e-8,0.0008158856,0.9511515,0.00023796578,0.00020994789,0.0000034227355,0.04734374],"study_design_scores_gemma":[0.0020655396,0.00015124507,0.000027787557,0.00088249356,0.00005750419,0.00001157012,0.00010243062,0.9962549,0.0001456961,0.000019471649,0.00004654236,0.00023480102],"about_ca_topic_score_codex":0.000009447781,"about_ca_topic_score_gemma":0.0000013081262,"teacher_disagreement_score":0.48910367,"about_ca_system_score_codex":0.00008538344,"about_ca_system_score_gemma":0.00016075736,"threshold_uncertainty_score":0.88392115},"labels":[],"label_agreement":null},{"id":"W2970275451","doi":"10.1109/spawc.2019.8815515","title":"Perfect SI Cancellation Based on Mode-Switching for Differential Channel-Unaware TWRNs","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Single antenna interference cancellation; Computer science; Channel (broadcasting); Antenna (radio); Scheme (mathematics); Interference (communication); Electronic engineering; Block (permutation group theory); Mode (computer interface); Topology (electrical circuits); Computer network; Telecommunications; Mathematics; Electrical engineering; Engineering; Power (physics); Physics","score_opus":0.02873419257307861,"score_gpt":0.28247507522510346,"score_spread":0.2537408826520248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970275451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038770303,0.000021992313,0.9532016,0.0012800557,0.0003904221,0.00041081238,0.0000015520853,0.00014280544,0.005780464],"genre_scores_gemma":[0.99448866,0.000015264684,0.003746297,0.00072441425,0.000072991505,0.000035550405,0.000012899291,0.000009517824,0.0008944318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917656,0.00006827428,0.00013688904,0.00028615934,0.0001465123,0.0001856177],"domain_scores_gemma":[0.99900615,0.00021164058,0.00005231918,0.0005893758,0.00009109492,0.000049446746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013277621,0.000117360956,0.00012538816,0.0000778767,0.00019639402,0.00013182525,0.0005089212,0.000038648468,0.0001194877],"category_scores_gemma":[0.000016165386,0.00009986263,0.00007205582,0.00015673603,0.0000057140605,0.00018213142,0.00011742481,0.00010249681,0.00003868852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019887878,0.00043230437,0.0021730282,0.0001298815,0.00006194771,0.0000012326524,0.004307761,0.32308194,0.037957013,0.2630679,0.004164546,0.3644236],"study_design_scores_gemma":[0.0004992236,0.00010972709,0.0005430173,0.000035538887,0.000002133846,2.0385012e-7,0.000009631279,0.9945714,0.0019194857,0.0001856003,0.0019813746,0.0001426711],"about_ca_topic_score_codex":0.000008378859,"about_ca_topic_score_gemma":0.000056371573,"teacher_disagreement_score":0.95571834,"about_ca_system_score_codex":0.0000584348,"about_ca_system_score_gemma":0.00004788921,"threshold_uncertainty_score":0.40722796},"labels":[],"label_agreement":null},{"id":"W2970745594","doi":"10.1109/tit.2019.2937459","title":"Delay in Cooperative Communications: Achieving Higher Multiplexing Gain in Gaussian Interference Channels With Full-Duplex Transmitters","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplexing; Interference (communication); Computer science; Transmitter; Electronic engineering; Gaussian; Duplex (building); Telecommunications; Computer network; Physics; Channel (broadcasting); Engineering","score_opus":0.023909063175136695,"score_gpt":0.25656301582826224,"score_spread":0.23265395265312555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970745594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02585351,0.000071708564,0.9695643,0.0014141173,0.00025123908,0.0006288714,0.000006047762,0.00012257395,0.0020876047],"genre_scores_gemma":[0.99273336,0.00026112184,0.0055156634,0.0011408576,0.0000057916786,0.00018459934,0.000011678906,0.000011088746,0.00013585963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817175,0.00054428313,0.0005770873,0.00022563626,0.00019506314,0.00028617564],"domain_scores_gemma":[0.99812454,0.00046898,0.00014381351,0.0010744502,0.00012005162,0.00006815957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007993269,0.00022799651,0.000236217,0.0006191577,0.00022364053,0.00022493169,0.0012234342,0.00008630741,0.00012766385],"category_scores_gemma":[0.000008466786,0.00020366012,0.000053108794,0.0010699647,0.00010362002,0.0029917324,0.000017984166,0.00063946453,0.00012889226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031111977,0.00023009602,0.00012863119,0.000038747727,0.00004148245,0.0000018545744,0.029936597,0.76159525,0.000895281,0.06712502,0.000017061084,0.13967885],"study_design_scores_gemma":[0.0025327338,0.0003098241,0.0007316408,0.0007506741,0.000006099574,0.00001437949,0.0019333921,0.98986167,0.0019381209,0.00015979509,0.0012145905,0.0005470538],"about_ca_topic_score_codex":0.000018671964,"about_ca_topic_score_gemma":0.00029340247,"teacher_disagreement_score":0.96687984,"about_ca_system_score_codex":0.00022447102,"about_ca_system_score_gemma":0.000088562134,"threshold_uncertainty_score":0.83050185},"labels":[],"label_agreement":null},{"id":"W2972152665","doi":"","title":"Enhanced Broadcasting and Code Assignment in Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Mobile ad hoc network; Code (set theory); Broadcasting (networking); Computer network; Wireless ad hoc network; Telecommunications; Programming language; Wireless","score_opus":0.2739169322178341,"score_gpt":0.5153889488411946,"score_spread":0.24147201662336049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972152665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5988017,0.19520131,0.20179154,0.00019299542,0.00040325013,0.00062193576,0.0000035099656,0.00006925021,0.002914548],"genre_scores_gemma":[0.8076056,0.19008863,0.0017726911,0.00026294927,0.00004514391,0.000059631435,0.000001791101,0.000015310941,0.00014824074],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9976748,0.0004168817,0.00070487586,0.00044785923,0.00038967628,0.00036588116],"domain_scores_gemma":[0.99800783,0.00046101474,0.00047673893,0.0006669029,0.00019030175,0.00019722636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011383189,0.00023489317,0.0005069018,0.00038929723,0.00043330263,0.0008170704,0.0033431149,0.00007300428,0.0005913782],"category_scores_gemma":[0.00011783644,0.00022554546,0.000069920054,0.001191198,0.00012434719,0.0020862839,0.0025400333,0.00046297966,0.000004446136],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007241256,0.00033439693,0.10538404,0.00002384075,0.000071893606,0.00006337857,0.0020109545,0.01407082,0.043798424,0.0002836363,0.0071130223,0.82677317],"study_design_scores_gemma":[0.0023318753,0.000075277174,0.80466837,0.001494445,0.000025458383,0.00010781951,0.0001541821,0.11596662,0.022561561,0.0013849172,0.04983819,0.0013913],"about_ca_topic_score_codex":0.000012920565,"about_ca_topic_score_gemma":0.000085167,"teacher_disagreement_score":0.8253819,"about_ca_system_score_codex":0.00010620931,"about_ca_system_score_gemma":0.00009898141,"threshold_uncertainty_score":0.9197477},"labels":[],"label_agreement":null},{"id":"W2976522465","doi":"10.48550/arxiv.1410.5187","title":"On the Compound Broadcast Channel: Multiple Description Coding and\\n Interference Decoding","year":2014,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Decoding methods; Decodes; Encoder; Computer science; Coding (social sciences); Encoding (memory); Channel (broadcasting); List decoding; Algorithm; Theoretical computer science; Interference (communication); Computer network; Mathematics; Block code; Concatenated error correction code; Artificial intelligence; Statistics","score_opus":0.14913215739951957,"score_gpt":0.20458782681551052,"score_spread":0.05545566941599095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976522465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32241255,0.00015307713,0.6728798,0.0007286004,0.0004776159,0.00025082057,0.0000020322007,0.00009391903,0.0030015667],"genre_scores_gemma":[0.99591446,0.002336308,0.00016276565,0.0006578051,0.00008465776,0.0000012549182,0.0000021800086,0.000018389906,0.000822198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727297,0.0009404881,0.0002932986,0.0008935533,0.00010679913,0.0004928875],"domain_scores_gemma":[0.996495,0.0015716186,0.00025705725,0.0012222804,0.0002346566,0.0002193775],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009920772,0.000362225,0.00030271205,0.00020967895,0.0017582867,0.0005939469,0.0015601135,0.0001188822,0.00007370423],"category_scores_gemma":[0.0003541357,0.00033896082,0.00011606025,0.00095438806,0.00038695222,0.00080980576,0.0013443198,0.0006058982,0.00012825149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083534585,0.00012009583,0.0014654875,0.000021958267,0.00005398975,0.00001595677,0.0020761688,0.011531922,0.0006497542,0.95429975,0.00042345206,0.029257933],"study_design_scores_gemma":[0.00070029264,0.0002085444,0.0016250638,0.00035149185,0.000028795159,0.0000101711785,0.00030446728,0.98814243,0.00021113626,0.006981611,0.0010437275,0.00039224353],"about_ca_topic_score_codex":0.00002885121,"about_ca_topic_score_gemma":0.00014212735,"teacher_disagreement_score":0.97661054,"about_ca_system_score_codex":0.00018943285,"about_ca_system_score_gemma":0.000047172958,"threshold_uncertainty_score":0.99990624},"labels":[],"label_agreement":null},{"id":"W2982124863","doi":"10.1145/3343031.3350942","title":"Low-Latency Network-Adaptive Error Control for Interactive Streaming","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Packet loss; Network packet; Latency (audio); Linear network coding; Forward error correction; Network congestion; Real-time computing; Computer network; Error detection and correction; Algorithm; Decoding methods; Telecommunications","score_opus":0.02898520064087092,"score_gpt":0.2812018111678887,"score_spread":0.2522166105270178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982124863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037292333,0.0001378755,0.97086596,0.0007855774,0.0004795658,0.0006535179,0.0000017683914,0.00014821345,0.023198312],"genre_scores_gemma":[0.9627065,0.000033895118,0.032484394,0.0010185529,0.00008610327,0.000056672954,0.0000029332552,0.000009273792,0.0036016598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989828,0.00009685578,0.00021516986,0.00031469722,0.00010164449,0.0002888422],"domain_scores_gemma":[0.99846655,0.00057238457,0.00009738832,0.00057375047,0.0002267305,0.00006317004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026610325,0.00013417153,0.00019191393,0.00004615138,0.00015296649,0.00011002864,0.00076935,0.00004068578,0.00012452298],"category_scores_gemma":[0.000031947016,0.000114511684,0.00008550365,0.00022703124,0.00001884585,0.00055296806,0.00024251701,0.0001382401,0.0001326223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011483461,0.00016285515,0.0014094382,0.00001263666,0.00015474293,0.0000020121447,0.00163014,0.0072409334,0.0017274069,0.68264914,0.007769921,0.29712597],"study_design_scores_gemma":[0.0011851002,0.00022945917,0.0012076014,0.000067819885,0.000006016637,0.0000021949215,0.00011588247,0.98616654,0.00044951093,0.0015075182,0.008826968,0.0002353955],"about_ca_topic_score_codex":0.0000045874253,"about_ca_topic_score_gemma":0.000039710652,"teacher_disagreement_score":0.9789256,"about_ca_system_score_codex":0.000060792445,"about_ca_system_score_gemma":0.000055568937,"threshold_uncertainty_score":0.4669651},"labels":[],"label_agreement":null},{"id":"W2982307121","doi":"10.1109/wcnc.2019.8885457","title":"Joint ML Time and Frequency Synchronization for Distributed MIMO-Relay Beamforming","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Toronto; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Beamforming; Computer science; Relay; MIMO; Synchronization (alternating current); Node (physics); Carrier frequency offset; Initialization; Channel (broadcasting); Frequency offset; Electronic engineering; Computer network; Orthogonal frequency-division multiplexing; Telecommunications; Engineering; Power (physics)","score_opus":0.018626031215634522,"score_gpt":0.240944156563064,"score_spread":0.22231812534742948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982307121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014065409,0.0002831857,0.9818807,0.0011900945,0.00009632321,0.0003233906,0.000004293683,0.00012585596,0.0020307396],"genre_scores_gemma":[0.8967704,0.00012990016,0.10114491,0.0003739041,0.000031768024,0.000021487813,0.000069859656,0.000008662782,0.0014490949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939764,0.000030145147,0.00015789294,0.00020022505,0.000072122995,0.00014196392],"domain_scores_gemma":[0.99932253,0.00008673931,0.000050933366,0.00037947678,0.00011379187,0.000046503737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002017436,0.00007972467,0.00010443264,0.00004081409,0.00014598711,0.000116031,0.00028534877,0.000033715893,0.00009940884],"category_scores_gemma":[0.00004089137,0.000069389615,0.000026084263,0.00019836114,0.000015896465,0.00039370713,0.00020220812,0.000054242628,0.00007573802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009362123,0.00013472988,0.0034393985,0.00007191495,0.00007625303,0.0000011250264,0.0014505954,0.002254197,0.047687024,0.66629475,0.008649212,0.26993147],"study_design_scores_gemma":[0.0003925304,0.00007497618,0.0009283216,0.00003480719,0.0000034762245,0.000004431136,0.000009239854,0.9905453,0.0012513475,0.0007740341,0.005818907,0.0001626416],"about_ca_topic_score_codex":0.0000047836124,"about_ca_topic_score_gemma":0.000011975956,"teacher_disagreement_score":0.9882911,"about_ca_system_score_codex":0.00004136076,"about_ca_system_score_gemma":0.000032492895,"threshold_uncertainty_score":0.28296262},"labels":[],"label_agreement":null},{"id":"W2982373750","doi":"10.1109/wcnc.2019.8886089","title":"On the Physical Layer Security of Underlay Multihop Device-to-Device Relaying","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Underlay; Secrecy; Physical layer; Computer science; Computer network; Outage probability; Signal-to-noise ratio (imaging); Wireless; Computer security; Telecommunications; Fading; Channel (broadcasting)","score_opus":0.05635997692687867,"score_gpt":0.31255030679173745,"score_spread":0.2561903298648588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982373750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89641005,0.000049301765,0.032485254,0.008071784,0.00014647754,0.00036006395,4.621004e-7,0.000105565334,0.062371045],"genre_scores_gemma":[0.99431443,0.000014091346,0.0016688651,0.0034453452,0.000023115817,0.0000081521,3.594643e-7,0.000005445063,0.00052021415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910545,0.00017674563,0.00014229385,0.00022197411,0.0002038157,0.00014970754],"domain_scores_gemma":[0.99795866,0.0008372106,0.00005375366,0.000985,0.000115342955,0.00005004736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032560152,0.00009646418,0.00013245795,0.000040419636,0.00011486953,0.00005849981,0.0010847974,0.00002425789,0.00009425531],"category_scores_gemma":[0.00006615234,0.000061172315,0.000056766083,0.00046148355,0.000020053876,0.0001496283,0.0005327938,0.00018991617,0.0005036585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058924875,0.000112888905,0.0004416839,0.0000068838526,0.000015619178,3.2147477e-7,0.0038465622,0.0005948235,0.006117597,0.97775733,0.0018170759,0.009283337],"study_design_scores_gemma":[0.0006427625,0.00026388952,0.005188268,0.00017602199,0.000008057794,0.0000022045494,0.00045023163,0.9384306,0.023624284,0.0069401404,0.023815019,0.00045851732],"about_ca_topic_score_codex":0.000009408748,"about_ca_topic_score_gemma":0.000030885847,"teacher_disagreement_score":0.97081715,"about_ca_system_score_codex":0.000025622556,"about_ca_system_score_gemma":0.00002827099,"threshold_uncertainty_score":0.6473679},"labels":[],"label_agreement":null},{"id":"W2982559964","doi":"10.1109/lcomm.2019.2950193","title":"Generalized $M_{m,r}$ -Network: A Case for Fixed Message Dimensions","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Computer network; Combinatorics; Mathematics","score_opus":0.06178577956205216,"score_gpt":0.3082794003259665,"score_spread":0.24649362076391435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982559964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16073014,0.0032641944,0.7540643,0.07434941,0.0013945281,0.0023188854,0.000022293305,0.00075459166,0.0031016634],"genre_scores_gemma":[0.7826086,0.0008037672,0.206787,0.008825103,0.00007201103,0.00033894315,0.000037514135,0.000026466396,0.0005005657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981427,0.00048951386,0.0004181518,0.00037889034,0.00015112809,0.00041961033],"domain_scores_gemma":[0.992954,0.00091778586,0.0001750309,0.0056486554,0.00018860151,0.00011591436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006585359,0.00021113231,0.0002719534,0.0001237591,0.00095664227,0.00021047702,0.0033262281,0.00006707744,0.000036414116],"category_scores_gemma":[0.000046107976,0.00021466818,0.00016733063,0.0006542726,0.000113958784,0.0004267654,0.0010552229,0.0002977595,0.00013666129],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036836533,0.0004364207,0.0011355664,0.00004668936,0.0003432714,0.00005810628,0.003496663,0.01422116,0.09534414,0.5771568,0.27137965,0.03634469],"study_design_scores_gemma":[0.0022837026,0.00007900217,0.00025629302,0.000112318674,0.000049375558,0.00034406013,0.00006835013,0.55699795,0.0010759046,0.0010498385,0.43682685,0.0008563467],"about_ca_topic_score_codex":0.000017344166,"about_ca_topic_score_gemma":0.00012907301,"teacher_disagreement_score":0.6218785,"about_ca_system_score_codex":0.00008779478,"about_ca_system_score_gemma":0.00006005359,"threshold_uncertainty_score":0.8753914},"labels":[],"label_agreement":null},{"id":"W2990558126","doi":"10.1109/pimrc.2019.8904167","title":"Opportunistic Scheduling in Network-Coded Cooperative Systems","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Outage probability; Computer science; Scheduling (production processes); Exploit; Linear network coding; Diversity gain; Cooperative diversity; Coding (social sciences); Performance improvement; Coding gain; Computer network; Mathematical optimization; Decoding methods; Fading; Telecommunications; Engineering; Mathematics; Statistics; Computer security","score_opus":0.04669081549017187,"score_gpt":0.277720899853148,"score_spread":0.23103008436297615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990558126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03564735,0.0012724363,0.87622315,0.0010715,0.0010431558,0.00068510545,6.196783e-7,0.0002830819,0.08377358],"genre_scores_gemma":[0.9860164,0.00024175554,0.010023571,0.0005058333,0.00004754575,0.000022615115,0.000004278144,0.0000071968425,0.0031308143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879354,0.0002126682,0.00028419553,0.00029427544,0.00014074134,0.0002745722],"domain_scores_gemma":[0.99886614,0.00017997486,0.000060002894,0.00069876533,0.00012038671,0.000074731106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054835615,0.000120257704,0.00020368725,0.00007396599,0.00009635713,0.00022176113,0.000812694,0.00004518972,0.000105243395],"category_scores_gemma":[0.00003236219,0.00010600405,0.00002704761,0.0006186723,0.000019064179,0.0003654298,0.00037838434,0.00019271827,0.00029362686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029424,0.000027174501,0.002859961,0.0000066057974,0.000008287185,0.0000053722824,0.0002779842,0.09708919,0.00047784825,0.8949218,0.00047697456,0.003845886],"study_design_scores_gemma":[0.00032527177,0.00003383606,0.0007201627,0.00008221837,9.1847573e-7,0.0000050582094,0.00006645845,0.99336934,0.00003256736,0.00015012475,0.005044184,0.00016988114],"about_ca_topic_score_codex":0.000012614934,"about_ca_topic_score_gemma":0.000051590978,"teacher_disagreement_score":0.95036906,"about_ca_system_score_codex":0.000058648984,"about_ca_system_score_gemma":0.00009845542,"threshold_uncertainty_score":0.432272},"labels":[],"label_agreement":null},{"id":"W2991125814","doi":"10.48550/arxiv.1911.08449","title":"Packet Loss Recovery in Broadcast for Real-Time Applications in Dense Wireless Networks","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Network packet; Computer science; Encoder; Computer network; Broadcasting (networking); Real-time computing; Packet loss; Linear network coding; Coding (social sciences); Encoding (memory)","score_opus":0.06296995562061895,"score_gpt":0.21664279906172232,"score_spread":0.15367284344110338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991125814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19246684,0.00016906328,0.80417746,0.00012664523,0.00019912283,0.0012049052,0.0000147229075,0.00011861733,0.0015226009],"genre_scores_gemma":[0.99111646,0.005644448,0.0014724338,0.00007619744,0.00005227955,0.000023763125,0.0000859884,0.000022194927,0.0015062127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800456,0.00027155512,0.00031277823,0.000967936,0.00005449633,0.00038868087],"domain_scores_gemma":[0.99719775,0.00051951926,0.00023767818,0.001783373,0.00016585678,0.00009583305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046983315,0.00028605506,0.00042083385,0.0003742048,0.00012197914,0.00012092762,0.0021096307,0.00029942705,0.000014875215],"category_scores_gemma":[0.000020248322,0.000354488,0.00015721716,0.001060976,0.0000725796,0.00031112754,0.0019365215,0.00058203796,0.000045209017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006433711,0.0002127772,0.014936158,0.00006500216,0.00003981421,0.000036213696,0.00033077056,0.87487847,0.00003942687,0.10068577,0.00066138746,0.008049885],"study_design_scores_gemma":[0.0006675791,0.000030604522,0.0036677027,0.00019634716,0.000012503828,0.0000014046802,0.00003540997,0.98944265,0.000014713872,0.004386928,0.0011086101,0.00043556458],"about_ca_topic_score_codex":0.000073624054,"about_ca_topic_score_gemma":0.00042959335,"teacher_disagreement_score":0.80270505,"about_ca_system_score_codex":0.00040410977,"about_ca_system_score_gemma":0.00021462489,"threshold_uncertainty_score":0.9998907},"labels":[],"label_agreement":null},{"id":"W2991346935","doi":"10.1145/3345860.3361516","title":"Minkowski Distance Order Effect on the Optimization of Key Devices Positions in Large-Scale RF Mesh Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Computer science; Network packet; Routing (electronic design automation); Context (archaeology); Minkowski space; Euclidean distance; Computer network; Quality of service; Mesh networking; Routing protocol; Key (lock); Wireless; Mathematics; Telecommunications","score_opus":0.010887956672452261,"score_gpt":0.24980480529818275,"score_spread":0.23891684862573048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991346935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023199787,0.00016333562,0.9555088,0.0020949938,0.00011523599,0.00034789654,7.0024566e-7,0.00004484159,0.01852435],"genre_scores_gemma":[0.99059397,0.00013915154,0.008061769,0.0007567568,0.000011952521,0.000021810549,0.0000066163307,0.0000049296577,0.00040305883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991484,0.00022217479,0.0001780765,0.0001813049,0.00012253103,0.00014748883],"domain_scores_gemma":[0.9987141,0.00047120918,0.00006849304,0.0006273869,0.00009544239,0.00002336558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043998705,0.00008890981,0.00012498417,0.000049409762,0.000108199536,0.00006574131,0.00064395147,0.000035851186,0.00020534008],"category_scores_gemma":[0.00002378573,0.000058887064,0.00003332452,0.0007416102,0.000021698694,0.0002011919,0.00018581987,0.0001314249,0.000027593382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021379876,0.00018260916,0.01652872,0.000013396634,0.000017824543,5.6441195e-7,0.0011161587,0.4258394,0.00013177544,0.5494061,0.0007613352,0.0059807305],"study_design_scores_gemma":[0.00023556281,0.00007478994,0.004581419,0.00007549799,0.0000019675554,4.2404199e-7,0.000027195307,0.9939867,0.00020371446,0.00004172986,0.0006894785,0.00008151504],"about_ca_topic_score_codex":0.0000039832034,"about_ca_topic_score_gemma":0.0002578565,"teacher_disagreement_score":0.9673942,"about_ca_system_score_codex":0.000019488494,"about_ca_system_score_gemma":0.00001689292,"threshold_uncertainty_score":0.24013448},"labels":[],"label_agreement":null},{"id":"W2995177052","doi":"10.1109/lnet.2019.2959733","title":"Admission Control and Network Slicing for Multi-Numerology 5G Wireless Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de l'Enseignement Supérieur et de la Recherche","keywords":"Slicing; Computer science; Blocking (statistics); Computer network; Mobile broadband; Wireless network; Bandwidth (computing); Constraint (computer-aided design); Admission control; Latency (audio); Broadband networks; Wireless; Wireless broadband; Broadband; Distributed computing; Quality of service; Telecommunications; Engineering","score_opus":0.02945138797379666,"score_gpt":0.2698974765411785,"score_spread":0.24044608856738187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995177052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058430392,0.0016742268,0.9320153,0.003555887,0.0032618595,0.0007385138,5.5333095e-7,0.00023186789,0.00009139661],"genre_scores_gemma":[0.96794707,0.000550865,0.012771788,0.017118884,0.0013993861,0.000072443494,0.0000048812467,0.000036086196,0.000098572695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977201,0.00029235298,0.00040353526,0.0006425248,0.00015449943,0.0007869842],"domain_scores_gemma":[0.9980045,0.0007455663,0.00022701587,0.00077177637,0.00007955082,0.00017159173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008196963,0.00029658055,0.00044421974,0.00007902661,0.00048197317,0.00022382919,0.00088675536,0.00014699015,0.000006901713],"category_scores_gemma":[0.000013415769,0.00028867822,0.0001120744,0.0003840857,0.00006846041,0.00028015685,0.00017650316,0.00039513933,0.000009364273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002204738,0.000081915794,0.056363367,0.000052844844,0.00026107416,0.000015957494,0.0009513249,0.4424979,0.014907793,0.007511369,0.042221054,0.43491492],"study_design_scores_gemma":[0.0017830331,0.000077468394,0.002090995,0.00014987573,0.00001650387,0.00001275723,0.000004068818,0.9704451,0.000040868883,0.00004173264,0.024995595,0.0003420063],"about_ca_topic_score_codex":0.000005295837,"about_ca_topic_score_gemma":0.000024071913,"teacher_disagreement_score":0.9192435,"about_ca_system_score_codex":0.000055656627,"about_ca_system_score_gemma":0.000028137756,"threshold_uncertainty_score":0.99995655},"labels":[],"label_agreement":null},{"id":"W2996064532","doi":"10.1109/allerton.2019.8919741","title":"Flow Decomposition","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Encoding (memory); Algorithm; Computer science; Flow (mathematics); Set (abstract data type); Decomposition; Relay; Mathematics; Mathematical optimization; Theoretical computer science; Artificial intelligence","score_opus":0.021003807181272656,"score_gpt":0.283800083929493,"score_spread":0.26279627674822037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996064532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01228767,0.000079860394,0.84093153,0.0012078166,0.00017195294,0.00006346248,4.660658e-8,0.00014461469,0.14511304],"genre_scores_gemma":[0.9248017,0.000048136153,0.07274271,0.0008454851,0.000010500548,0.0000020461034,0.0000010592292,0.0000013617739,0.0015470096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971974,0.000027558353,0.000051515584,0.00008971487,0.000050988812,0.00006047241],"domain_scores_gemma":[0.99954367,0.000026236637,0.000010300144,0.00036851756,0.000030503252,0.000020795338],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007174895,0.000029834991,0.000034446413,0.000022210563,0.000040220595,0.00005795582,0.0003712292,0.000010172962,0.00030815564],"category_scores_gemma":[0.0000020658176,0.000025595022,0.00001567006,0.00012638795,0.0000034140464,0.00021218958,0.00015157976,0.00003558718,0.0010633859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.9165236e-7,0.000017329456,0.000438755,0.0000011024588,0.000003064791,3.039992e-7,0.000115344636,0.0003868412,0.00260934,0.78246486,0.0018328776,0.21212947],"study_design_scores_gemma":[0.00012345315,0.000019815981,0.0025809112,0.0000054192037,3.0067207e-7,0.000002788343,0.0000031890193,0.97250545,0.0016507591,0.0012023108,0.021836853,0.00006873974],"about_ca_topic_score_codex":3.0620745e-7,"about_ca_topic_score_gemma":0.0000015565961,"teacher_disagreement_score":0.9721186,"about_ca_system_score_codex":0.000010324655,"about_ca_system_score_gemma":0.000008460364,"threshold_uncertainty_score":0.9997144},"labels":[],"label_agreement":null},{"id":"W2996633715","doi":"10.1109/cwit.2019.8929904","title":"On Source-Channel Communication over Multiple-Access Interference Relay Channels with Phase Uncertainties","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Ergodic theory; Fading; Channel (broadcasting); Relay channel; Computer science; Interference (communication); Topology (electrical circuits); Gaussian; Co-channel interference; Phase (matter); Coding (social sciences); Computer network; Telecommunications; Electronic engineering; Mathematics; Physics; Engineering; Statistics; Combinatorics","score_opus":0.04904269659175513,"score_gpt":0.3114945316349073,"score_spread":0.26245183504315217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996633715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25472274,0.00018995513,0.73255336,0.0018484648,0.00022048094,0.00045206142,0.0000010342737,0.00031750512,0.0096943565],"genre_scores_gemma":[0.99294865,0.00022965635,0.0019310729,0.0012267907,0.00001581934,0.00004207833,0.000010019078,0.00001359224,0.0035823104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987692,0.0001981324,0.00022353255,0.00035924124,0.00021154122,0.00023835197],"domain_scores_gemma":[0.99742186,0.00047761586,0.00012608325,0.0017182596,0.00017687188,0.00007933573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027473108,0.00019047053,0.00018970533,0.00013329921,0.00023583486,0.00044686015,0.0023046136,0.00005023733,0.00022433873],"category_scores_gemma":[0.000048980626,0.00014351682,0.000042506257,0.0004371302,0.000071398186,0.0008660686,0.0009743247,0.00027438643,0.00014945047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000936868,0.002062351,0.0063667437,0.00007247819,0.0002703391,0.000007206584,0.0241431,0.1514526,0.0029212264,0.6222708,0.018510686,0.17098556],"study_design_scores_gemma":[0.0020522007,0.00052586634,0.0004646647,0.00024516048,0.000003958177,0.000004654031,0.00015979253,0.9877814,0.0019740576,0.00070538826,0.00570452,0.00037834633],"about_ca_topic_score_codex":0.000040987696,"about_ca_topic_score_gemma":0.0000964149,"teacher_disagreement_score":0.8363288,"about_ca_system_score_codex":0.000059480986,"about_ca_system_score_gemma":0.00004062407,"threshold_uncertainty_score":0.5852446},"labels":[],"label_agreement":null},{"id":"W2998361458","doi":"10.1007/978-3-030-37262-0_5","title":"Optimal Packet Size Analysis for Intra-flow Network Coding Enabled One Hop Wireless Multicast","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Multicast; Linear network coding; Computer network; Computer science; Source-specific multicast; Network packet; Wireless network; Pragmatic General Multicast; Distributed computing; Wireless; Telecommunications","score_opus":0.03158053139081438,"score_gpt":0.2490188249616317,"score_spread":0.21743829357081731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998361458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001727153,0.00043364987,0.9960064,0.0010954114,0.00046644083,0.00092083873,0.00006390357,0.00008081962,0.00075979443],"genre_scores_gemma":[0.038878225,0.0005449173,0.95984024,0.00028012623,0.00020073418,0.000046537174,0.000068839334,0.000021075335,0.00011927716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982652,0.000028815726,0.00080160383,0.00025601778,0.00027181138,0.0003765166],"domain_scores_gemma":[0.9963584,0.0014601236,0.0006184465,0.0011079548,0.00038556132,0.00006950389],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007566558,0.00035602978,0.0006876141,0.0002341081,0.0013491497,0.00043286837,0.0029676603,0.00023379386,0.0000023540751],"category_scores_gemma":[0.00011653999,0.00031139163,0.0004125442,0.00067405554,0.00032927946,0.0004237061,0.0013666415,0.00046659473,7.4705343e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029403643,0.000013748073,0.000005116361,0.00010470003,0.00035918693,2.624463e-8,0.000988062,0.88974446,0.0000111734225,0.09300321,0.000060883616,0.015706481],"study_design_scores_gemma":[0.00031975118,0.00006171072,0.00005362294,0.0002184154,0.00019240362,0.000002208606,0.0000034861334,0.9863595,0.000040826646,0.00027968283,0.012106086,0.00036230023],"about_ca_topic_score_codex":0.000006387971,"about_ca_topic_score_gemma":0.00009865027,"teacher_disagreement_score":0.09661504,"about_ca_system_score_codex":0.00009677922,"about_ca_system_score_gemma":0.00022857457,"threshold_uncertainty_score":0.99995095},"labels":[],"label_agreement":null},{"id":"W2999407989","doi":"10.1109/tsp.2020.2964250","title":"Nonsmooth Optimization Algorithms for Multicast Beamforming in Content-Centric Fog Radio Access Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Australian Research Council; Queen's University Belfast; Royal Academy of Engineering; National Science Foundation","keywords":"Computer science; Beamforming; Multicast; Radio access network; Optimization problem; Baseband; Computer network; Throughput; Algorithm; Wireless; Base station; Telecommunications","score_opus":0.1220341846486069,"score_gpt":0.31493294583087256,"score_spread":0.19289876118226568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999407989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020040588,0.00037479808,0.99707884,0.0014487824,0.0001438221,0.0005116766,0.0000028484267,0.0001708911,0.0000679402],"genre_scores_gemma":[0.8991467,0.00019986038,0.09947539,0.00094798615,0.00007647059,0.000105167135,0.000004238498,0.000021469334,0.000022729133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985623,0.00008560362,0.00040126735,0.00042607196,0.00018981642,0.0003349876],"domain_scores_gemma":[0.99912304,0.00020329379,0.00012939185,0.00020325246,0.00019631519,0.00014469831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023353932,0.00019348068,0.00022841655,0.00018402317,0.000501624,0.0004566055,0.00078923756,0.000079398036,0.000020619085],"category_scores_gemma":[0.000011887798,0.00019508808,0.00008550387,0.0012438964,0.000041006802,0.0013466025,0.0000120506475,0.00033539094,0.0000026579262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029278328,0.000068168956,0.000009861004,0.000016778395,0.000007039318,0.0000013376674,0.0004578277,0.6462979,0.00015004244,0.000036178266,0.000010733209,0.3529149],"study_design_scores_gemma":[0.0010855424,0.0000854945,0.000017353585,0.00012298088,0.000012345425,0.0000040121527,0.000058040034,0.99617684,0.0020088465,0.000009978346,0.00019610442,0.00022245853],"about_ca_topic_score_codex":0.000003395082,"about_ca_topic_score_gemma":0.000009815123,"teacher_disagreement_score":0.8989463,"about_ca_system_score_codex":0.000100099525,"about_ca_system_score_gemma":0.00010397975,"threshold_uncertainty_score":0.7955461},"labels":[],"label_agreement":null},{"id":"W3000245973","doi":"10.1109/tgcn.2020.2965116","title":"Interference Suppression and Energy Efficiency Improvement With Massive MIMO and Relay Selection in Cognitive Two-Way Relay Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Green Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Underlay; Relay channel; MIMO; Computer science; Transmitter power output; Interference (communication); Efficient energy use; Channel state information; Channel (broadcasting); Selection (genetic algorithm); Computer network; Power (physics); Signal-to-noise ratio (imaging); Wireless; Electronic engineering; Telecommunications; Electrical engineering; Transmitter; Engineering; Physics","score_opus":0.03568897199629755,"score_gpt":0.2650821189609802,"score_spread":0.22939314696468266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000245973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016374793,0.002916718,0.97717804,0.0028770755,0.00006433228,0.00022175493,0.0000023786822,0.00008906618,0.00027586136],"genre_scores_gemma":[0.97799283,0.016942365,0.004079915,0.00078362797,0.00003428875,0.00010006383,0.000004031816,0.000016072408,0.000046815665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845165,0.00033032082,0.0003325505,0.00049104815,0.00012798139,0.00026646152],"domain_scores_gemma":[0.99859715,0.0005168165,0.00014059816,0.0004785813,0.00010766558,0.00015918455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025423768,0.00023141789,0.00023433413,0.00014365271,0.000832416,0.00018435757,0.0004825697,0.00008258841,0.0000054962834],"category_scores_gemma":[0.0000018818303,0.00021023194,0.000028153134,0.0008072337,0.00021494395,0.00037103702,0.00010227627,0.00060700794,5.4007705e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000904511,0.00011343315,0.0005282294,0.0000090320855,0.00004090819,0.0000021851495,0.0021383418,0.004627242,0.00063355017,0.00068317825,0.000016624303,0.9911168],"study_design_scores_gemma":[0.0009395776,0.0005297556,0.00030603888,0.00039118307,0.000026958041,0.0000148799145,0.00014429212,0.9963589,0.00029111505,0.00003176825,0.0007054239,0.00026013216],"about_ca_topic_score_codex":0.00015685201,"about_ca_topic_score_gemma":0.0015906321,"teacher_disagreement_score":0.99173164,"about_ca_system_score_codex":0.000044142682,"about_ca_system_score_gemma":0.00003342581,"threshold_uncertainty_score":0.857301},"labels":[],"label_agreement":null},{"id":"W3000977365","doi":"10.1002/rsa.21085","title":"The rank of sparse random matrices","year":2022,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Random matrix; Mathematics; Rank (graph theory); Conjecture; Sparse matrix; Matrix (chemical analysis); Discrete mathematics; Combinatorics; Computer science; Physics","score_opus":0.017434872758805384,"score_gpt":0.25678329902424085,"score_spread":0.23934842626543545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000977365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14040896,0.18916437,0.64475995,0.013114345,0.0040498152,0.0024710938,0.0000597146,0.00039458214,0.005577142],"genre_scores_gemma":[0.9878436,0.0068039373,0.004859532,0.00017375236,0.00006697124,0.000037750247,0.000002753674,0.0000060239254,0.0002056803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989011,0.00031486526,0.00022668675,0.00017241602,0.00023405638,0.00015082308],"domain_scores_gemma":[0.99880654,0.000564932,0.00012369742,0.00041374573,0.000049570295,0.00004152448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006328754,0.00009645031,0.00019546143,0.000045754896,0.0010519973,0.000119011165,0.0008002389,0.000014848941,0.000044299668],"category_scores_gemma":[0.000037640424,0.00006137244,0.00006823846,0.00029198316,0.0000844792,0.00009279956,0.000621603,0.00016844456,4.33297e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033873878,0.00002236389,0.00011453499,0.000010354062,0.00007490824,0.000005110763,0.0016235743,0.0011951015,0.00053238386,0.09674904,0.0022046366,0.89712924],"study_design_scores_gemma":[0.034298297,0.0003170086,0.004336953,0.000025976358,0.000056785946,0.00019086793,0.0007243393,0.5078082,0.0017921308,0.041917525,0.40785527,0.00067666476],"about_ca_topic_score_codex":0.000009975665,"about_ca_topic_score_gemma":0.0000051415764,"teacher_disagreement_score":0.8964526,"about_ca_system_score_codex":0.000010307957,"about_ca_system_score_gemma":0.000027985028,"threshold_uncertainty_score":0.8091219},"labels":[],"label_agreement":null},{"id":"W3006937682","doi":"10.1109/tit.2020.2975162","title":"Sliding-Window Superposition Coding: Two-User Interference Channels","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Decoding methods; Single antenna interference cancellation; Coding (social sciences); Computer science; Dirty paper coding; Algorithm; Encoder; Channel (broadcasting); Interference (communication); Superposition principle; Mathematics; Theoretical computer science; Telecommunications; MIMO; Precoding; Statistics","score_opus":0.03212389064269327,"score_gpt":0.25489287824595375,"score_spread":0.22276898760326047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006937682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014219368,0.000020070836,0.99089664,0.002873388,0.0005871809,0.00023585615,0.000007216706,0.00039132993,0.0035663927],"genre_scores_gemma":[0.99243325,0.00013203047,0.002098044,0.0051200115,0.00004479257,0.0000568923,0.0000074084896,0.0000071502805,0.000100426885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885654,0.00020587545,0.000367476,0.00017015038,0.00020490783,0.00019505213],"domain_scores_gemma":[0.9989787,0.00018013072,0.00010354102,0.00041901617,0.00017594546,0.00014267632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034882277,0.00016529483,0.00014144262,0.00017457863,0.00042359595,0.00034015102,0.00075059966,0.000056369594,0.00021521849],"category_scores_gemma":[0.000020388481,0.00016303791,0.00008881489,0.00055004936,0.000038009115,0.0028719788,0.000012448016,0.0003287195,0.0006614798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001549507,0.000097468335,0.0000048410197,0.000036541882,0.00006568104,0.0000014042954,0.02397139,0.03682112,0.0037198856,0.6625412,0.00090120995,0.2716843],"study_design_scores_gemma":[0.002617242,0.00065060955,0.00006633236,0.00022863338,0.00003705608,0.000033116117,0.0011847626,0.80859846,0.16616772,0.0039550667,0.015463102,0.000997873],"about_ca_topic_score_codex":0.0000011587487,"about_ca_topic_score_gemma":0.0000012430693,"teacher_disagreement_score":0.9910113,"about_ca_system_score_codex":0.000065705055,"about_ca_system_score_gemma":0.000048249738,"threshold_uncertainty_score":0.85022044},"labels":[],"label_agreement":null},{"id":"W3013193461","doi":"10.1109/tit.2020.2983152","title":"Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Erasure; Convolutional code; Erasure code; Binary erasure channel; Algorithm; Computer science; Network packet; Channel (broadcasting); Code (set theory); Mathematics; Discrete mathematics; Channel capacity; Telecommunications; Computer network","score_opus":0.021994799599024367,"score_gpt":0.24223113768561425,"score_spread":0.22023633808658988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013193461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003955463,0.000046333505,0.99362487,0.0014015163,0.00010638611,0.0003387116,0.000013366255,0.00015058466,0.00036274907],"genre_scores_gemma":[0.9907162,0.00014191419,0.007614941,0.0013526158,0.000021448275,0.000097378776,0.0000054583866,0.0000054086117,0.000044600773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993642,0.00010414594,0.00019850464,0.000111603265,0.00009676897,0.00012478934],"domain_scores_gemma":[0.9991269,0.00039950208,0.00007488267,0.00018972099,0.00012795643,0.00008100059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034939163,0.00011353213,0.00012519183,0.000084020525,0.00039944856,0.00023182452,0.00024338132,0.000033794106,0.000017562868],"category_scores_gemma":[0.000016332095,0.00009368808,0.000036750753,0.00021219526,0.0000540272,0.0013477826,0.0000035375226,0.0001222816,0.000013364466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001608077,0.000075207325,0.000004173397,0.000096896016,0.00016387657,8.807708e-7,0.027924236,0.24400733,0.0007842802,0.10282792,0.00042510073,0.622082],"study_design_scores_gemma":[0.0047512846,0.00063880696,0.000042054042,0.00009005619,0.00003578161,0.000014251803,0.0012830129,0.9579283,0.025004204,0.0007479549,0.009043447,0.00042085897],"about_ca_topic_score_codex":7.1956964e-7,"about_ca_topic_score_gemma":0.0000020078542,"teacher_disagreement_score":0.9867608,"about_ca_system_score_codex":0.000015816242,"about_ca_system_score_gemma":0.000035802106,"threshold_uncertainty_score":0.3820489},"labels":[],"label_agreement":null},{"id":"W3013487134","doi":"10.1109/lcomm.2020.2982388","title":"Self-Coupling Data Transmission for Random Multiple Access Communications","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Network packet; Random access; Coupling (piping); Transmission (telecommunications); Bit error rate; Throughput; Single antenna interference cancellation; Computer network; Packet switching; Transmission delay; Electronic engineering; Channel (broadcasting); Telecommunications; Wireless; Engineering","score_opus":0.21913910819825577,"score_gpt":0.3663347960160265,"score_spread":0.1471956878177707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013487134","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036793796,0.0023750088,0.7975177,0.19786589,0.000088916095,0.0008719431,0.000031708423,0.0005623862,0.00031848525],"genre_scores_gemma":[0.4744241,0.008292628,0.50562227,0.010903724,0.00007846415,0.0002751034,0.00036227476,0.00003197507,0.000009482103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797434,0.00034798606,0.0005859973,0.0005509198,0.00021560169,0.00032514642],"domain_scores_gemma":[0.9849147,0.0020264662,0.00022730461,0.012391271,0.00022383385,0.00021643381],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007373845,0.00023804001,0.00030576368,0.00011109577,0.0014881251,0.0005456741,0.029938681,0.000071329116,0.000006767275],"category_scores_gemma":[0.00017785627,0.0002485932,0.00012207798,0.00088971376,0.00019126775,0.0016475999,0.0055383346,0.00047909925,0.00003303773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030322094,0.0023761112,0.0027835015,0.0004819024,0.0010663677,0.0000047949725,0.02774428,0.01287071,0.13959023,0.06264171,0.22987428,0.5202629],"study_design_scores_gemma":[0.0010477353,0.000013747742,0.000053301806,0.000030433808,0.000023826498,0.0000014525799,0.000020342586,0.66850626,0.00043458494,0.00004250054,0.32961786,0.00020796883],"about_ca_topic_score_codex":0.000009787513,"about_ca_topic_score_gemma":0.00004354474,"teacher_disagreement_score":0.65563554,"about_ca_system_score_codex":0.00006245602,"about_ca_system_score_gemma":0.00011460714,"threshold_uncertainty_score":0.9999966},"labels":[],"label_agreement":null},{"id":"W3013612420","doi":"10.1109/tcomm.2020.2982632","title":"Relaying Systems With Reciprocity Mismatch: Impact Analysis and Calibration","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Reciprocity (cultural anthropology); Codebook; Computer science; Calibration; Electronic engineering; Beamforming; Performance improvement; Algorithm; Engineering; Mathematics","score_opus":0.07006073793233017,"score_gpt":0.2958096614110718,"score_spread":0.22574892347874162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013612420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041943076,0.0004751538,0.986198,0.007922781,0.000034666875,0.00025755548,0.000012958793,0.00026318894,0.0006413645],"genre_scores_gemma":[0.97790384,0.0015980335,0.019907359,0.00041856934,0.00001005012,0.00008289684,0.000009864636,0.000011373398,0.000057988946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998699,0.0003837198,0.0002803912,0.00029851476,0.00017994066,0.00015840866],"domain_scores_gemma":[0.99740607,0.00033434408,0.00011662967,0.0018106803,0.00014667006,0.00018563788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002024665,0.00016155877,0.00023277289,0.00019313364,0.0008694321,0.00031384782,0.00117884,0.00005775574,0.000015713555],"category_scores_gemma":[0.000009208774,0.00013936832,0.00009994059,0.0021973366,0.00010174478,0.0005840176,0.000025081823,0.0003935431,0.000010920475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002509158,0.0014372084,0.004756736,0.00011228613,0.005530135,0.000009786623,0.0388872,0.68025273,0.00764309,0.046124104,0.0013107742,0.21368502],"study_design_scores_gemma":[0.00026976838,0.00013487869,0.0008657531,0.00002646971,0.00015011158,0.0000067104043,0.00014322842,0.9969918,0.00042417008,0.000027953687,0.00075248355,0.00020665048],"about_ca_topic_score_codex":0.00006887211,"about_ca_topic_score_gemma":0.00020588137,"teacher_disagreement_score":0.9737096,"about_ca_system_score_codex":0.00006353719,"about_ca_system_score_gemma":0.000072834984,"threshold_uncertainty_score":0.6687057},"labels":[],"label_agreement":null},{"id":"W3015181526","doi":"10.1109/ojvt.2020.2984753","title":"Regularized WDFDC Receivers for Selective Detect-and-Forward Multi-Relaying Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Open Journal of Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Fading; Computer science; Bit error rate; Phase-shift keying; Electronic engineering; Channel (broadcasting); Algorithm; Telecommunications; Engineering; Physics","score_opus":0.056384208393952855,"score_gpt":0.3024412352807906,"score_spread":0.24605702688683773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015181526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012201468,0.0025861908,0.97316295,0.010870467,0.00030523902,0.00063810067,0.0000011954235,0.000077101155,0.00015730136],"genre_scores_gemma":[0.82103443,0.00076015014,0.17761514,0.00042807235,0.000051847834,0.000031289932,2.8834344e-7,0.000014913946,0.000063888016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873364,0.00017983625,0.00045663927,0.0002640081,0.0001428126,0.0002230388],"domain_scores_gemma":[0.99835193,0.00012308887,0.0004588074,0.00035156234,0.000590589,0.00012400543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071342255,0.00014538648,0.00043671022,0.00021144142,0.0002733105,0.00023562716,0.0022643558,0.00016002014,0.0000025212491],"category_scores_gemma":[0.00034178767,0.00012873179,0.000090330854,0.0007356569,0.000088191315,0.0004814008,0.00050038134,0.00046742728,0.0000035617793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066873874,0.00023011764,0.00092220586,0.00015221865,0.0016939719,0.00031113887,0.0054557873,0.0072589763,0.40904802,0.065582365,0.02138963,0.4872868],"study_design_scores_gemma":[0.010882731,0.002743029,0.00019078892,0.0005096341,0.00016689184,0.0010907114,0.0011747353,0.7888248,0.09152938,0.0026738863,0.09931085,0.00090255373],"about_ca_topic_score_codex":0.0000020959383,"about_ca_topic_score_gemma":0.0000037110597,"teacher_disagreement_score":0.80883294,"about_ca_system_score_codex":0.00007229436,"about_ca_system_score_gemma":0.00012646882,"threshold_uncertainty_score":0.524953},"labels":[],"label_agreement":null},{"id":"W3015204137","doi":"10.1109/gciot47977.2019.9058393","title":"An ARQ-Based Cooperative Relaying Scheme for 5G IoT Slice","year":2019,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Selective Repeat ARQ; Automatic repeat request; Scheme (mathematics); Computer network; Hybrid automatic repeat request; Telecommunications link","score_opus":0.03980114662638066,"score_gpt":0.31066228854925837,"score_spread":0.2708611419228777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015204137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051088843,0.0001303052,0.9274782,0.0022968678,0.00022321535,0.0005658653,0.0000010694256,0.0002955082,0.017920151],"genre_scores_gemma":[0.86132324,0.000012627085,0.13436456,0.0028156117,0.00003546388,0.00004619788,0.000007058525,0.000009758915,0.0013854717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902815,0.00011210615,0.00017792667,0.00034444695,0.000122567,0.00021481274],"domain_scores_gemma":[0.99835634,0.00026147257,0.00005318148,0.00096512045,0.00027755334,0.000086302876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037616363,0.0001214561,0.00014061024,0.00006462876,0.00024532666,0.0002074466,0.0010114101,0.000045348315,0.00014988858],"category_scores_gemma":[0.00004432976,0.000106066705,0.000048844075,0.00034783446,0.000022043176,0.0003616695,0.00007903841,0.00012565129,0.00014605613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043182547,0.0002674109,0.002547691,0.000028624703,0.000036987218,0.0000011718407,0.0017455204,0.009643502,0.08231446,0.84264946,0.0044060983,0.056315906],"study_design_scores_gemma":[0.0006502981,0.00019362643,0.0003526695,0.000024172474,0.0000015384927,8.532362e-7,0.000056974608,0.9606747,0.013364443,0.00009297837,0.024377603,0.00021013661],"about_ca_topic_score_codex":0.000004138095,"about_ca_topic_score_gemma":0.000022019778,"teacher_disagreement_score":0.9510312,"about_ca_system_score_codex":0.00003986507,"about_ca_system_score_gemma":0.00010449623,"threshold_uncertainty_score":0.43252748},"labels":[],"label_agreement":null},{"id":"W3024336310","doi":"10.1002/9781119471509.w5gref191","title":"Network Coding for<scp>D2D</scp>","year":2020,"lang":"en","type":"other","venue":"Wiley 5G Ref","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Network packet; User equipment; Telecommunications link; Linear network coding; Computer network; Base station; Computer science; Cellular network; Relay; Coding (social sciences); Mathematics","score_opus":0.0440709056709836,"score_gpt":0.274308759870755,"score_spread":0.23023785419977139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024336310","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.4693853e-7,0.009690948,0.39286232,0.0010438636,0.0011734206,0.000479373,0.000011371988,0.00078696205,0.5939511],"genre_scores_gemma":[0.0014381629,0.01676585,0.09879023,0.008309954,0.00516816,0.00027011946,0.00015531406,0.0006491671,0.868453],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839765,0.00012938646,0.0002677141,0.00056204665,0.00021198961,0.00043118544],"domain_scores_gemma":[0.9980709,0.00034963532,0.00024991776,0.0011155155,0.00005414558,0.0001598866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002504928,0.00030778954,0.0004012193,0.000100864156,0.00021975361,0.00021921216,0.0019346975,0.00020923179,0.00011626073],"category_scores_gemma":[0.00012309391,0.0003015578,0.00013566119,0.0005355227,0.00004669833,0.000096250165,0.0005790534,0.00035107997,0.00026183884],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.6051493e-7,0.000010012236,0.000018845893,0.000025811058,0.000033541775,0.0000029383325,0.0001669906,0.000018867791,0.000021826958,0.050290085,0.9220401,0.027370436],"study_design_scores_gemma":[0.00021651768,0.00004262905,0.000012395724,0.0004542919,0.00001174359,0.000002653913,0.0000055351834,0.011863053,0.000017254522,0.0006477678,0.98658717,0.00013897895],"about_ca_topic_score_codex":0.000004370982,"about_ca_topic_score_gemma":0.000046581063,"teacher_disagreement_score":0.2940721,"about_ca_system_score_codex":0.00004984223,"about_ca_system_score_gemma":0.00009279417,"threshold_uncertainty_score":0.9999437},"labels":[],"label_agreement":null},{"id":"W3024890468","doi":"10.1109/isit44484.2020.9174218","title":"Staggered Diagonal Embedding Based Linear Field Size Streaming Codes","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field size; Diagonal; Erasure; Network packet; Code (set theory); Mathematics; Embedding; Discrete mathematics; Field (mathematics); Erasure code; Sliding window protocol; Combinatorics; Decoding methods; Algorithm; Computer science; Window (computing); Physics; Geometry; Computer network","score_opus":0.060725045770909376,"score_gpt":0.3261567361485676,"score_spread":0.26543169037765824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024890468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021039958,0.00035880198,0.9758442,0.014433343,0.00047305104,0.000267315,0.000009734772,0.0005614985,0.005948066],"genre_scores_gemma":[0.7443587,0.00029968703,0.25034717,0.004311886,0.00020657608,0.00004062726,0.000028576595,0.000017821683,0.0003889646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998083,0.0002380515,0.0003992771,0.00068408233,0.00031338673,0.0002822037],"domain_scores_gemma":[0.9964642,0.0017001438,0.00017781231,0.0013045351,0.0001830512,0.00017026042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029554596,0.00030539048,0.00037583016,0.00007433935,0.00022497453,0.0004618537,0.0022459377,0.00018148152,0.00041559903],"category_scores_gemma":[0.0005900341,0.0002958659,0.00017400473,0.0002795497,0.000030459723,0.00017533814,0.0036971464,0.00088328746,0.00004356416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012409654,0.00067209266,0.0028633438,0.0007286646,0.00060315325,0.0001822971,0.006782243,0.08070965,0.010854332,0.18656945,0.06201792,0.6478928],"study_design_scores_gemma":[0.00022739857,0.000043909047,0.00017617758,0.00018334239,0.000008889676,8.206356e-7,0.00002580615,0.98813593,0.0047991625,0.00085553905,0.0051589133,0.00038412903],"about_ca_topic_score_codex":0.000022962457,"about_ca_topic_score_gemma":0.000035996796,"teacher_disagreement_score":0.90742624,"about_ca_system_score_codex":0.00006759781,"about_ca_system_score_gemma":0.00032823012,"threshold_uncertainty_score":0.99994934},"labels":[],"label_agreement":null},{"id":"W3033527907","doi":"10.1016/j.comnet.2020.107350","title":"Power allocation and resource assignment for secure D2D communication underlaying cellular networks: A Tabu search approach","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Polytechnique Montréal","keywords":"Computer science; Eavesdropping; Tabu search; Cellular network; Power control; Mathematical optimization; Resource allocation; Distributed computing; Computational complexity theory; Computer network; Algorithm; Power (physics); Mathematics","score_opus":0.04357913623413174,"score_gpt":0.25308148273789105,"score_spread":0.20950234650375932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033527907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006911553,0.0047667413,0.9875597,0.005118005,0.00012673871,0.0007916851,8.312113e-7,0.00026356985,0.00068160804],"genre_scores_gemma":[0.8851705,0.0007266657,0.10986453,0.0036529845,0.0003473149,0.00008638595,0.00008667905,0.00003190363,0.000033028427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770314,0.0005191959,0.0004161772,0.00066442246,0.00024617734,0.0004508865],"domain_scores_gemma":[0.997901,0.00042586066,0.00015308986,0.0010747582,0.00018334806,0.0002618977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080913334,0.0002754491,0.0003062729,0.00006541007,0.0006647704,0.00056297996,0.0015451374,0.00015735083,0.000006794705],"category_scores_gemma":[0.000012508404,0.00028227194,0.000091967915,0.0005996688,0.000098641016,0.0003794054,0.0015119793,0.0005170944,0.0000032908108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049855822,0.00015768906,0.00025866443,0.000053980166,0.00012176203,0.0000024654119,0.0065682847,0.66472906,0.000114212606,0.09569401,0.02561467,0.20663534],"study_design_scores_gemma":[0.00058731565,0.00013266315,0.00016212257,0.00006049633,0.0000105111385,0.000004653197,0.00008865739,0.97885346,0.000022787108,0.00011569798,0.01965881,0.00030283284],"about_ca_topic_score_codex":0.0000013089251,"about_ca_topic_score_gemma":0.0000012293659,"teacher_disagreement_score":0.88447934,"about_ca_system_score_codex":0.00007577654,"about_ca_system_score_gemma":0.000041000407,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W3035441431","doi":"10.1109/isit44484.2020.9174225","title":"Streaming Erasure Codes over Multi-hop Relay Network","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Erasure; Computer science; Header; Upper and lower bounds; Network packet; Erasure code; Relay; Linear network coding; Computer network; Binary erasure channel; Topology (electrical circuits); Decoding methods; Algorithm; Channel (broadcasting); Mathematics; Channel capacity; Combinatorics","score_opus":0.08037223952893292,"score_gpt":0.3134102744640203,"score_spread":0.2330380349350874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035441431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011199461,0.003318792,0.9805806,0.003994771,0.0011646792,0.0003797434,0.0000045322217,0.0007947866,0.008642111],"genre_scores_gemma":[0.6538698,0.0033265578,0.3365833,0.0031158219,0.0005733323,0.00006218343,0.000049937767,0.000039630202,0.002379412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977375,0.00034007782,0.00043076402,0.0008227563,0.00029791138,0.0003709351],"domain_scores_gemma":[0.9973794,0.00024304689,0.00021112352,0.0018202186,0.00016629568,0.00017989601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041069728,0.00036288146,0.00043139138,0.000060816583,0.0003117486,0.00055292866,0.0027278583,0.00024295191,0.00015417859],"category_scores_gemma":[0.00009673844,0.00033740228,0.00017727131,0.0004342592,0.00004827182,0.00020711236,0.006876504,0.0011906155,0.000095945434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024378298,0.0003196675,0.006637346,0.0001524972,0.000567859,0.00007864225,0.0058424897,0.14103934,0.0010898326,0.3112585,0.17678571,0.35620373],"study_design_scores_gemma":[0.00033430185,0.00002383284,0.004751091,0.0002648489,0.000015650749,0.0000027241256,0.000016743592,0.9571312,0.00012667222,0.0011223331,0.03562082,0.0005897477],"about_ca_topic_score_codex":0.000022361004,"about_ca_topic_score_gemma":0.00023937265,"teacher_disagreement_score":0.8160919,"about_ca_system_score_codex":0.00008944538,"about_ca_system_score_gemma":0.00018270366,"threshold_uncertainty_score":0.9999078},"labels":[],"label_agreement":null},{"id":"W3037147215","doi":"10.48550/arxiv.2006.14913","title":"Two-Way Source-Channel Coding","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossy compression; Channel code; Computer science; Coding (social sciences); Exploit; Channel (broadcasting); Distributed source coding; Transmission (telecommunications); Algorithm; Decoding methods; Computer network; Mathematics; Telecommunications; Statistics","score_opus":0.1533065871776126,"score_gpt":0.21795425209788089,"score_spread":0.06464766492026827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037147215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010343421,0.00021763364,0.97641814,0.0010592171,0.00053073355,0.00023339184,0.000004142479,0.00055467366,0.010638636],"genre_scores_gemma":[0.9948756,0.0011584542,0.001693906,0.0005802941,0.00013904125,0.0000012320056,0.0000140778975,0.000021146036,0.0015162156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980434,0.00028525668,0.0002144543,0.0010279039,0.000094048824,0.00033492886],"domain_scores_gemma":[0.99760306,0.00015582387,0.00022302786,0.0015923864,0.00018094089,0.00024476892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024881554,0.0003204389,0.00034507393,0.00017964983,0.00035300758,0.00024150447,0.0032567708,0.00015860186,0.00004992116],"category_scores_gemma":[0.00005648303,0.00038817106,0.00021550397,0.000756886,0.000090430716,0.0003053435,0.0065451474,0.00088874495,0.0002303718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019064028,0.00007328121,0.0003039153,0.00005120724,0.00012597402,0.00016271086,0.001576721,0.22542569,0.0002012231,0.76472896,0.0021146128,0.0052166292],"study_design_scores_gemma":[0.00042462477,0.000026574786,0.00015967821,0.00010798608,0.00002795331,0.0000033921895,0.00008054226,0.9770753,0.00014301878,0.017149376,0.0043175006,0.00048407743],"about_ca_topic_score_codex":0.000025648747,"about_ca_topic_score_gemma":0.000038197933,"teacher_disagreement_score":0.98453224,"about_ca_system_score_codex":0.00017344432,"about_ca_system_score_gemma":0.00014010096,"threshold_uncertainty_score":0.999857},"labels":[],"label_agreement":null},{"id":"W3041773245","doi":"10.1109/tit.2020.3008973","title":"Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Research in Fundamental Sciences","keywords":"Low-density parity-check code; Fading; Decoding methods; Lattice (music); List decoding; Algorithm; Computer science; Binary number; Algebraic structure; Mathematics; Block code; Theoretical computer science; Topology (electrical circuits); Concatenated error correction code; Combinatorics; Arithmetic; Pure mathematics; Physics","score_opus":0.07568244227812168,"score_gpt":0.2984073980971861,"score_spread":0.2227249558190644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041773245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012008115,0.00003646552,0.99583805,0.0010717162,0.00079754787,0.0007179347,0.000018950226,0.00014542953,0.0001731259],"genre_scores_gemma":[0.774019,0.0004418651,0.22515751,0.00026170153,0.000024505252,0.00007454924,0.0000056715617,0.0000060234215,0.000009168069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987124,0.00028545482,0.0004439244,0.00021407013,0.00019816677,0.00014596625],"domain_scores_gemma":[0.99776655,0.001056501,0.00042186154,0.0003692865,0.0002985306,0.00008723766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009329693,0.00018742752,0.000253586,0.00027101932,0.0005958023,0.00020577769,0.0003726708,0.00016377665,0.000014629783],"category_scores_gemma":[0.00006461203,0.00019923362,0.00010131606,0.00021277595,0.000106767126,0.0013002981,0.00007903893,0.0004445922,0.0000075967546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085825863,0.00014232396,0.0000031679263,0.0007451197,0.0004670716,0.0000013410963,0.03901762,0.41064972,0.00096740824,0.20187183,0.00034737802,0.34492877],"study_design_scores_gemma":[0.00065167545,0.00017903573,0.0000046403284,0.00020775275,0.00008739496,0.000037460773,0.0004658033,0.974157,0.009216205,0.014352177,0.0003418431,0.00029900583],"about_ca_topic_score_codex":0.0000014045373,"about_ca_topic_score_gemma":8.3031176e-7,"teacher_disagreement_score":0.7728182,"about_ca_system_score_codex":0.000067646455,"about_ca_system_score_gemma":0.0001292491,"threshold_uncertainty_score":0.8124511},"labels":[],"label_agreement":null},{"id":"W3043302671","doi":"10.1109/sips50750.2020.9195254","title":"High-Throughput VLSI Architecture for GRAND","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Code word; Computer science; BCH code; Decoding methods; Code (set theory); Algorithm; Throughput; Code rate; Additive white Gaussian noise; Parallel computing; Channel (broadcasting); Telecommunications; Wireless","score_opus":0.06691802128240666,"score_gpt":0.3039410773495894,"score_spread":0.23702305606718277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043302671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012414237,0.00066912395,0.9558668,0.038403604,0.0007338458,0.0005867138,0.000010302483,0.00038590017,0.0032195344],"genre_scores_gemma":[0.25940585,0.00097507524,0.731932,0.0057230904,0.00048789874,0.00015907391,0.00009424501,0.00002823587,0.0011945402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986324,0.000104561055,0.00026267243,0.0006298575,0.00015651816,0.00021399422],"domain_scores_gemma":[0.99812293,0.0002005542,0.00010969123,0.001316783,0.00014478376,0.00010526098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017994319,0.00024047318,0.00032185207,0.000061000886,0.00018534361,0.00034408484,0.002335913,0.00013896739,0.000039079983],"category_scores_gemma":[0.000067996414,0.00020650477,0.00016830707,0.00018735028,0.000037187736,0.000077513774,0.003644788,0.0005493936,0.00002738698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015759448,0.00004769821,0.000008983837,0.00011807075,0.000093351715,0.0000029940636,0.001769947,0.003581164,0.0003452337,0.64280313,0.07337976,0.27783388],"study_design_scores_gemma":[0.0010844764,0.00014129916,0.00022038704,0.00017147721,0.000029599334,0.000006081878,0.000011045745,0.16472381,0.0028416575,0.26566833,0.56412196,0.0009798637],"about_ca_topic_score_codex":0.000007750143,"about_ca_topic_score_gemma":0.00006556194,"teacher_disagreement_score":0.4907422,"about_ca_system_score_codex":0.00003327127,"about_ca_system_score_gemma":0.00012489136,"threshold_uncertainty_score":0.84210205},"labels":[],"label_agreement":null},{"id":"W3046004170","doi":"10.1007/978-3-319-32903-1_241-1","title":"Joint Network Coding and Opportunistic Forwarding","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Joint (building); Computer science; Computer network; Coding (social sciences); Engineering; Sociology","score_opus":0.08426164366600418,"score_gpt":0.25934828280154776,"score_spread":0.17508663913554356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046004170","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.094737e-7,0.0009778927,0.2953177,0.00063953083,0.0003583964,0.00018516195,0.0000012005316,0.00013999561,0.7023795],"genre_scores_gemma":[0.010131275,0.010246078,0.017746469,0.0015086675,0.0002831775,0.000005511124,0.000019459074,0.00004397508,0.9600154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987066,0.000030432027,0.00034096403,0.0004626151,0.00019918226,0.00026022946],"domain_scores_gemma":[0.99840295,0.00018060154,0.000184833,0.0009943866,0.00010665136,0.00013057535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004299251,0.0002797778,0.00040180518,0.00009868384,0.00025819475,0.00027820043,0.00067623047,0.00015443732,0.0002963916],"category_scores_gemma":[0.000018576591,0.00026115758,0.00009678542,0.000047310936,0.000053656826,0.00019281176,0.0014098465,0.00038346136,0.00016219712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.257642e-7,0.0000014331367,0.0000043771684,0.000013502002,0.000026522092,0.0000050957615,0.00003715662,0.000014275088,0.000009612047,0.93809605,0.01021784,0.051573522],"study_design_scores_gemma":[0.00022709754,0.00006223386,0.000038864877,0.0005981654,0.000029025894,0.000041051073,0.0000043234722,0.09646024,0.0000050121143,0.032798935,0.8690415,0.0006935195],"about_ca_topic_score_codex":6.629569e-7,"about_ca_topic_score_gemma":0.000008787708,"teacher_disagreement_score":0.9052971,"about_ca_system_score_codex":0.00005774619,"about_ca_system_score_gemma":0.00011604335,"threshold_uncertainty_score":0.9999841},"labels":[],"label_agreement":null},{"id":"W3048915046","doi":"10.1109/access.2020.3015264","title":"Energy-Aware Cross-Layer Offloading in Fog-RANs Using Network Coded Device Cooperation","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Australian Government","keywords":"Computer science; Linear network coding; Computer network; Scheduling (production processes); User equipment; Coding (social sciences); Base station","score_opus":0.16209159717838806,"score_gpt":0.37486181177461914,"score_spread":0.21277021459623108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048915046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10668103,0.00045467363,0.8903078,0.0012128289,0.0004240616,0.00013662911,0.0000012776679,0.00014743979,0.0006342867],"genre_scores_gemma":[0.9910837,0.00019578428,0.003154479,0.0051699653,0.00032423885,0.000016976837,0.000006107402,0.000016674428,0.000032083914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984315,0.00022569128,0.00038324136,0.00042818775,0.00019190113,0.00033948928],"domain_scores_gemma":[0.9989338,0.00013085424,0.00011218341,0.00048576758,0.00021239708,0.00012499459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027130902,0.00017765419,0.0002251339,0.00006797294,0.00036361782,0.0009071254,0.0017002266,0.00006472867,0.000038295177],"category_scores_gemma":[0.000026414793,0.0001847747,0.000041267893,0.0015062189,0.00003560487,0.0017028064,0.0004811803,0.00022219296,0.0000144727055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010183962,0.0001876964,0.0411111,0.00006742533,0.000071844996,0.00006487379,0.0040766816,0.80755764,0.03691752,0.025949078,0.005984394,0.077909894],"study_design_scores_gemma":[0.00041739363,0.000029918554,0.00096021965,0.0000704403,0.000003999354,0.000002934179,0.0000061774435,0.98864543,0.006029749,0.00010905359,0.003477803,0.00024687033],"about_ca_topic_score_codex":0.0000694093,"about_ca_topic_score_gemma":0.00056103244,"teacher_disagreement_score":0.88715327,"about_ca_system_score_codex":0.00008243251,"about_ca_system_score_gemma":0.0001107248,"threshold_uncertainty_score":0.87474316},"labels":[],"label_agreement":null},{"id":"W3081228097","doi":"10.1109/isit44484.2020.9174439","title":"Multi-Cast Channels with Hierarchical Flow","year":2020,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Computer science; Encoding (memory); Coding (social sciences); Algorithm; Set (abstract data type); Theoretical computer science; Channel (broadcasting); Flow (mathematics); Linear network coding; Decomposition; Mathematics; Computer network; Artificial intelligence","score_opus":0.07768955645018435,"score_gpt":0.27603020348967244,"score_spread":0.1983406470394881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081228097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079897774,0.000073235205,0.97294647,0.022748223,0.00004574132,0.00007966099,2.3591326e-7,0.00020726217,0.0031001985],"genre_scores_gemma":[0.6784632,0.000047284353,0.31587455,0.00520373,0.00005755562,0.000007327715,0.0000011683345,0.000004509635,0.0003406875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999408,0.0000599714,0.00008659816,0.00020722001,0.000105991545,0.00013222793],"domain_scores_gemma":[0.9994286,0.00004107171,0.000016484904,0.0003227822,0.000052366864,0.0001387221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006396154,0.00007465544,0.00008320986,0.000019097977,0.00011206238,0.00011508095,0.00070245966,0.000017306504,0.000088136534],"category_scores_gemma":[0.00001982144,0.000053317064,0.00002048464,0.00034214766,0.000030686002,0.0001849411,0.0003565103,0.00013708038,0.00012612846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005485774,0.0003215404,0.000936075,0.000020777105,0.000078620316,0.00006410356,0.016510207,0.007768032,0.0053829593,0.22324404,0.016318109,0.7293007],"study_design_scores_gemma":[0.00032328782,0.00007796166,0.0002852358,0.0000063910416,8.097666e-7,0.000004362611,0.000011921294,0.97740096,0.00046085662,0.000019860578,0.021308426,0.00009993802],"about_ca_topic_score_codex":6.931142e-7,"about_ca_topic_score_gemma":0.000008333294,"teacher_disagreement_score":0.9696329,"about_ca_system_score_codex":0.000007005128,"about_ca_system_score_gemma":0.000028924196,"threshold_uncertainty_score":0.21742068},"labels":[],"label_agreement":null},{"id":"W3086678053","doi":"10.1109/cjece.2020.2991404","title":"Noncoherent Distributed Beamforming in Decentralized Two-Way Relay Networks","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Beamforming; Computer science; Relay; Overhead (engineering); Decoding methods; Channel state information; Channel (broadcasting); Base station; Bit error rate; Antenna (radio); Wireless sensor network; Computer network; Protocol (science); Electronic engineering; Real-time computing; Wireless; Telecommunications; Engineering; Power (physics)","score_opus":0.013296787184557202,"score_gpt":0.20361804358538366,"score_spread":0.19032125640082645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086678053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025613824,0.0030493233,0.96977496,0.0013146048,0.000160748,0.000055384804,4.1548427e-7,0.000017142082,0.000013576905],"genre_scores_gemma":[0.9846143,0.00028512187,0.014475724,0.00046373904,0.00015109747,0.0000011727279,0.0000012620533,0.000006471447,0.0000010960139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991015,0.000042529213,0.00032406885,0.0001288014,0.00008249759,0.00032056993],"domain_scores_gemma":[0.9990338,0.000104237704,0.00006812784,0.00010551231,0.00006292815,0.00062535924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014899924,0.00011350022,0.00021501094,0.00013935902,0.00006571826,0.0001385543,0.00047714403,0.00003762143,0.000004861073],"category_scores_gemma":[0.00004590622,0.000106302636,0.0000499608,0.0006503644,0.0000111819245,0.00021020162,0.000060428745,0.00041457627,6.6136903e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011469852,0.000019060888,0.0055130953,0.000010624363,0.000048078782,0.00026946494,0.00080931495,0.76869917,0.00015415343,0.018755222,0.0007998422,0.20491052],"study_design_scores_gemma":[0.000493359,0.000096212316,0.004380624,0.000050853818,0.0000031910276,0.000066699526,0.0000012302191,0.9861427,0.000029723165,0.000017440352,0.0085955085,0.00012246847],"about_ca_topic_score_codex":0.000042518812,"about_ca_topic_score_gemma":0.00028397204,"teacher_disagreement_score":0.95900047,"about_ca_system_score_codex":0.00010377128,"about_ca_system_score_gemma":0.0001365882,"threshold_uncertainty_score":0.4334896},"labels":[],"label_agreement":null},{"id":"W3088382980","doi":"10.1109/twc.2020.3024741","title":"Exploiting Diversity for Ultra-Reliable and Low-Latency Wireless Control","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canada Research Chairs; Nokia","keywords":"Computer science; Computer network; Wireless network; Wireless; Channel state information; Channel (broadcasting); Cooperative diversity; Latency (audio); Reliability (semiconductor); Spectral efficiency; Diversity gain; Transmission (telecommunications); Low latency (capital markets); Wireless sensor network; Distributed computing; Telecommunications; Fading","score_opus":0.05786902949113065,"score_gpt":0.267657473113518,"score_spread":0.20978844362238735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088382980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013176983,0.0002803017,0.9716973,0.01330433,0.000125566,0.00058200693,0.000036921097,0.00034860978,0.00044801307],"genre_scores_gemma":[0.9864968,0.0030399468,0.008235658,0.0019125723,0.000023348957,0.00020385227,0.0000070142714,0.000020151738,0.000060649327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861044,0.0001707852,0.00035085142,0.00039849995,0.00017974232,0.00028969036],"domain_scores_gemma":[0.9971467,0.00067822996,0.00012949541,0.0015699358,0.0002539904,0.00022162382],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00025430776,0.00021304643,0.00028026899,0.00009683858,0.0025521736,0.00016835265,0.0022655097,0.00008626987,0.000013651015],"category_scores_gemma":[0.000013166248,0.00023263339,0.00012498064,0.00054188527,0.00017748299,0.0005845658,0.00007118025,0.0004357679,0.000021986374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025836314,0.002037591,0.0010979056,0.0002750025,0.0006161081,0.000004938566,0.02874412,0.01614625,0.059784066,0.17444907,0.0018880981,0.7146985],"study_design_scores_gemma":[0.0021759304,0.00020025231,0.00020353848,0.00013306295,0.00006184382,0.0000053705094,0.0003473141,0.98403746,0.009775152,0.00038500977,0.0021543102,0.00052074646],"about_ca_topic_score_codex":0.000021375077,"about_ca_topic_score_gemma":0.00006408143,"teacher_disagreement_score":0.9733198,"about_ca_system_score_codex":0.000057091936,"about_ca_system_score_gemma":0.000065820925,"threshold_uncertainty_score":0.9987464},"labels":[],"label_agreement":null},{"id":"W3088521885","doi":"10.1186/s13638-020-01798-y","title":"Planning capacity for 5G and beyond wireless networks by discrete fireworks algorithm with ensemble of local search methods","year":2020,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Simon Fraser University","funders":"","keywords":"Computer science; RSS; Wireless network; Wireless; Local search (optimization); Algorithm; Heuristic; Wi-Fi; Artificial intelligence; Telecommunications","score_opus":0.07781382253293476,"score_gpt":0.33970850209163406,"score_spread":0.2618946795586993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088521885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054738363,0.014071714,0.97571117,0.00402922,0.00008768421,0.00026287042,0.000004021374,0.000050519477,0.00030894732],"genre_scores_gemma":[0.80502367,0.014659412,0.1793682,0.0007585999,0.00012469862,0.000020496525,0.00001045181,0.000026419926,0.00000808154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975367,0.0009294398,0.0005411768,0.00035665286,0.00023449879,0.00040150515],"domain_scores_gemma":[0.99646753,0.0017242035,0.00036530863,0.00086661306,0.0002527586,0.00032358718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013564548,0.00026802946,0.0004670275,0.00008708571,0.0012963295,0.00035690927,0.0014506953,0.00011221385,0.0000016838122],"category_scores_gemma":[0.00001344416,0.00022799536,0.00007630795,0.00059619435,0.0003959196,0.000369086,0.00054428075,0.001089219,2.1732193e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052061696,0.00004571164,0.0003722027,0.000016875712,0.00008453204,0.0000021172873,0.0019615777,0.0046190815,0.00030460334,0.0050855423,0.00030507377,0.9871506],"study_design_scores_gemma":[0.00071776484,0.0004330971,0.00013961141,0.00038345094,0.000024334722,0.00006146755,0.00027444228,0.9870681,0.0003710493,0.00016443289,0.010081339,0.00028087353],"about_ca_topic_score_codex":0.000004067266,"about_ca_topic_score_gemma":0.000006381698,"teacher_disagreement_score":0.98686975,"about_ca_system_score_codex":0.000042116484,"about_ca_system_score_gemma":0.000057035428,"threshold_uncertainty_score":0.997045},"labels":[],"label_agreement":null},{"id":"W3091783029","doi":"10.6180/jase.2016.19.2.12","title":"Performance Analysis of DF Relaying M2M Cooperative System","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Nakagami distribution; Fading; Moment-generating function; Relay; Power (physics); Computer science; Mathematics; Modulation (music); Algorithm; Moment (physics); Topology (electrical circuits); Probability density function; Statistics; Physics; Combinatorics; Decoding methods","score_opus":0.03197846226748885,"score_gpt":0.2601289437549432,"score_spread":0.22815048148745437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091783029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16487712,0.00016970516,0.79948777,0.0009251702,0.00010016867,0.00010287207,0.0000014521698,0.00017970368,0.034156017],"genre_scores_gemma":[0.9909557,0.00027039877,0.0075317984,0.00006969963,0.0000086041055,0.0000080786185,6.726383e-7,0.0000027708027,0.0011522588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919295,0.00011297945,0.00024393968,0.00018995302,0.00013589309,0.00012429958],"domain_scores_gemma":[0.9987592,0.00017186641,0.00008760817,0.00069698476,0.00024157646,0.000042760294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003208528,0.0000780826,0.00020086458,0.00019793588,0.00013265017,0.000031118234,0.00069702254,0.000024464023,0.00006790524],"category_scores_gemma":[0.00002594475,0.00004643329,0.00006816196,0.001437503,0.000039355265,0.00037647196,0.0002768207,0.00004124887,0.000037642727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011104021,0.00006011782,0.028521733,0.000024394909,0.0007671769,0.0000018943455,0.0017542941,0.0013120372,0.02221478,0.6713792,0.0009511631,0.2730021],"study_design_scores_gemma":[0.00033436227,0.0000743099,0.021223634,0.00014444014,0.00008470791,0.0000024346202,0.00010451542,0.96152467,0.013995028,0.0000041476283,0.0022915178,0.00021622235],"about_ca_topic_score_codex":0.0000029488215,"about_ca_topic_score_gemma":0.000016461046,"teacher_disagreement_score":0.96021265,"about_ca_system_score_codex":0.000053758136,"about_ca_system_score_gemma":0.000031664025,"threshold_uncertainty_score":0.18934946},"labels":[],"label_agreement":null},{"id":"W3093601243","doi":"","title":"QoS-Driven Node Cooperative Resource Allocation for Wireless Mesh Networks with Service Differentiation","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Quality of service; Computer science; Resource allocation; Wireless mesh network; Node (physics); Throughput; Network packet; Wireless network; Differentiated services; Provisioning; Resource management (computing); Distributed computing; Wireless; Telecommunications; Engineering","score_opus":0.02496329496541396,"score_gpt":0.2575997868926869,"score_spread":0.23263649192727295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093601243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007602486,0.000050592844,0.9786905,0.01081594,0.0000655614,0.00048881647,7.8206307e-7,0.00022897047,0.0020563214],"genre_scores_gemma":[0.9691866,0.0001048059,0.024384795,0.00559514,0.00011382343,0.00006320376,0.00006611855,0.000010423555,0.00047510752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887383,0.0001335455,0.00022316362,0.0003581888,0.00016879784,0.00024246203],"domain_scores_gemma":[0.9985204,0.00014555505,0.00010899701,0.00064113806,0.0005032546,0.00008065647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017881268,0.00017267963,0.0001747444,0.00006236599,0.0003883863,0.00024803457,0.00077203114,0.0000633319,0.000014536322],"category_scores_gemma":[0.0000124270255,0.00013755212,0.000034500794,0.0006210775,0.000019270688,0.0004598171,0.00010948685,0.00013518083,0.0000072036983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013012286,0.0003084463,0.0003881898,0.000014945199,0.00007919698,0.0000011485919,0.0033541736,0.060556456,0.0037815757,0.7630581,0.009416894,0.15891072],"study_design_scores_gemma":[0.00066247216,0.00016264242,0.0031828363,0.000046710662,0.000009788179,0.0000024930655,0.000051531853,0.9916793,0.0009919858,0.000074988144,0.002911933,0.0002232781],"about_ca_topic_score_codex":0.0000037189,"about_ca_topic_score_gemma":0.00020117822,"teacher_disagreement_score":0.9615841,"about_ca_system_score_codex":0.00005890083,"about_ca_system_score_gemma":0.00004798142,"threshold_uncertainty_score":0.56092125},"labels":[],"label_agreement":null},{"id":"W3098593194","doi":"","title":"1 Adaptive Mode Selection for Bidirectional Relay Networks – Fixed Rate Transmission","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Relay; Channel state information; Computer network; Transmitter; Node (physics); Throughput; Transmission (telecommunications); Fading; Relay channel; Linear network coding; Schedule; Channel (broadcasting); Wireless; Network packet; Telecommunications; Power (physics)","score_opus":0.051651339926838416,"score_gpt":0.3016310861846199,"score_spread":0.24997974625778152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098593194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008917843,0.0006022876,0.99052465,0.00273831,0.0009102843,0.0006514853,0.0000056101017,0.0004482593,0.004029909],"genre_scores_gemma":[0.5914931,0.0052844333,0.38137153,0.000989692,0.0010538574,0.0010189309,0.00009680115,0.00007172355,0.01861991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998168,0.00034203022,0.0003495197,0.00068768417,0.00015879197,0.00029395637],"domain_scores_gemma":[0.9982294,0.0004307901,0.00018024305,0.0006092226,0.00043646886,0.00011387818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005636606,0.00027999672,0.000275636,0.00014385325,0.00042166424,0.00017435545,0.0009564369,0.00029098007,0.000081552185],"category_scores_gemma":[0.000030654985,0.00021801618,0.00020543601,0.00026167626,0.00003335332,0.00025285987,0.0005954469,0.00047102815,0.000011614576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018541084,0.00013498016,0.000053875006,0.000030550887,0.00018936812,5.8898354e-7,0.00043900302,0.18901159,0.0022162362,0.16867733,0.04015416,0.59890693],"study_design_scores_gemma":[0.0003495053,0.00006332058,0.00010427553,0.00017010166,0.0000110144765,0.0000025866286,0.0000020188645,0.96412116,0.001132559,0.006940835,0.026787218,0.00031542912],"about_ca_topic_score_codex":0.00000911519,"about_ca_topic_score_gemma":0.000043161865,"teacher_disagreement_score":0.7751095,"about_ca_system_score_codex":0.0001794067,"about_ca_system_score_gemma":0.00022693689,"threshold_uncertainty_score":0.8890442},"labels":[],"label_agreement":null},{"id":"W3100195679","doi":"","title":"Quantized network coding for sparse messages","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Linear network coding; Decoding methods; Computer science; Network packet; Quantization (signal processing); Restricted isometry property; Algorithm; Data compression; Multiple description coding; Coding (social sciences); Coding tree unit; Minification; Distributed source coding; Redundancy (engineering); Theoretical computer science; Compressed sensing; Variable-length code; Computer network; Mathematics","score_opus":0.10172267045769173,"score_gpt":0.33254396708440453,"score_spread":0.2308212966267128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100195679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009227709,0.0015991195,0.97117805,0.0064162095,0.0014897401,0.00063786766,0.000004725923,0.00046100016,0.018120976],"genre_scores_gemma":[0.564759,0.007886824,0.41248742,0.0021192625,0.001273091,0.0005857378,0.00003516771,0.000056639645,0.010796825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819696,0.00019861932,0.00040419135,0.0006166266,0.00017373398,0.00040988598],"domain_scores_gemma":[0.9969553,0.0007114598,0.00022675055,0.0017538809,0.00025318668,0.000099441655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009260836,0.0002752094,0.0004025474,0.00007809036,0.00032455588,0.00040542084,0.0025369404,0.00017564432,0.000079180136],"category_scores_gemma":[0.00010815529,0.0002086361,0.00020642344,0.0001675147,0.000046056604,0.0001772417,0.0038504712,0.0002883266,0.000042448362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009483619,0.000019578938,0.00007221005,0.000029969466,0.00005681581,0.0000010101244,0.00012661083,0.00037426548,0.00016457553,0.88189006,0.061273552,0.05598185],"study_design_scores_gemma":[0.0017252613,0.000076210745,0.00049776514,0.0013196318,0.00004186078,0.000005591495,0.000014164694,0.49230212,0.0013708691,0.1757697,0.32539722,0.0014796105],"about_ca_topic_score_codex":0.0000015874866,"about_ca_topic_score_gemma":0.000023156568,"teacher_disagreement_score":0.7061204,"about_ca_system_score_codex":0.000060818926,"about_ca_system_score_gemma":0.00014425581,"threshold_uncertainty_score":0.85079336},"labels":[],"label_agreement":null},{"id":"W3101275356","doi":"","title":"0 Universal Secure Error-Correcting Schemes for Network Coding","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Coding (social sciences); Theoretical computer science; Cryptography; Computer network; Computer security; Mathematics; Statistics","score_opus":0.060881947434622115,"score_gpt":0.30984759137043333,"score_spread":0.24896564393581122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101275356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033960637,0.00081072934,0.97690064,0.003163335,0.0021415818,0.0004842768,0.000004124179,0.00051100925,0.01564473],"genre_scores_gemma":[0.7670911,0.0007288298,0.2240487,0.0009355766,0.001325208,0.00011969921,0.000026633938,0.000045342607,0.0056789205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825066,0.00014974574,0.00032261148,0.0006563591,0.00016949399,0.00045113027],"domain_scores_gemma":[0.9974825,0.00058739964,0.00025005307,0.0012542112,0.00031982787,0.00010600217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006265405,0.00029348367,0.00032981506,0.00009448412,0.0004998706,0.00032522492,0.002226954,0.00021494259,0.000063835236],"category_scores_gemma":[0.00011492422,0.0002465191,0.00019515745,0.0002380784,0.000044367167,0.00026808333,0.004125356,0.00048283162,0.000020639669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011883949,0.000023412904,0.00029624678,0.00005613422,0.000097098,0.0000023130035,0.0007717178,0.0010717978,0.00009767931,0.74227935,0.03855215,0.21674024],"study_design_scores_gemma":[0.0008479589,0.00006375343,0.00008329892,0.0013095349,0.000030632724,0.000011149624,0.00011761226,0.6523044,0.0009893435,0.030584093,0.3124797,0.0011785497],"about_ca_topic_score_codex":0.000002672486,"about_ca_topic_score_gemma":0.000036967984,"teacher_disagreement_score":0.76675147,"about_ca_system_score_codex":0.00015005855,"about_ca_system_score_gemma":0.00022332247,"threshold_uncertainty_score":0.9999987},"labels":[],"label_agreement":null},{"id":"W3101533992","doi":"","title":"Optimal Power Control for Analog Bidirectional Relaying with Long-Term Relay Power Constraint","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Channel state information; Computer science; Transmitter power output; Transmitter; Fading; Power control; Control theory (sociology); Transmission (telecommunications); Power (physics); Wireless; Relay channel; Electronic engineering; Channel (broadcasting); Computer network; Telecommunications; Engineering; Control (management)","score_opus":0.03026448847120797,"score_gpt":0.2859825190773462,"score_spread":0.2557180306061382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101533992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005068238,0.0006329908,0.97205,0.0038247274,0.00078602124,0.0008522722,0.00002872544,0.00034266204,0.016414331],"genre_scores_gemma":[0.93232095,0.00015470883,0.06414927,0.0007941586,0.000093696966,0.00015812961,0.000019404719,0.000029852114,0.0022798127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977782,0.00018319482,0.00045619733,0.0008472581,0.0003131277,0.0004220654],"domain_scores_gemma":[0.99700135,0.00057503773,0.00028935057,0.0013508694,0.00061665464,0.0001667109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065306894,0.00038490928,0.00044059544,0.00019766598,0.00034936453,0.00036218847,0.001439415,0.00023730418,0.0005518118],"category_scores_gemma":[0.00007884089,0.00026898348,0.00021742645,0.00017395537,0.00019545053,0.0002642946,0.0009996508,0.0005544488,0.000033413507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007458129,0.0007640806,0.020717988,0.00013753427,0.0026043023,0.00011974096,0.002700418,0.012946599,0.0016361597,0.8501379,0.01669666,0.09079279],"study_design_scores_gemma":[0.05208453,0.007065422,0.22307977,0.012189782,0.00094821356,0.0021372589,0.00045532975,0.544945,0.0036735453,0.013510828,0.11996541,0.01994493],"about_ca_topic_score_codex":0.0000015338314,"about_ca_topic_score_gemma":0.000017480463,"teacher_disagreement_score":0.9272527,"about_ca_system_score_codex":0.00017040776,"about_ca_system_score_gemma":0.0004295242,"threshold_uncertainty_score":0.9999762},"labels":[],"label_agreement":null},{"id":"W3102537939","doi":"10.48550/arxiv.1102.5364","title":"On Outage Probability and Diversity-Multiplexing Tradeoff in MIMO Relay Channels","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Relay; Rayleigh fading; MIMO; Nakagami distribution; Multiplexing; Topology (electrical circuits); Channel (broadcasting); Computer science; Additive white Gaussian noise; Fading distribution; Mathematics; Telecommunications; Physics; Combinatorics","score_opus":0.12608835264566257,"score_gpt":0.2798181070590271,"score_spread":0.15372975441336453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102537939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4942075,0.0012365251,0.43936348,0.005278138,0.001804259,0.002525587,0.0000095507685,0.000780721,0.054794244],"genre_scores_gemma":[0.98033583,0.00038197628,0.018462563,0.00033473113,0.000022515658,0.000026172618,0.000004412167,0.0000068663653,0.00042492073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983289,0.00030630187,0.0002677753,0.000701982,0.00016396931,0.00023105837],"domain_scores_gemma":[0.9983675,0.00020380941,0.000102616825,0.0011754326,0.000058282414,0.00009234946],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007233093,0.00022707008,0.00028582203,0.00016573898,0.00024502474,0.00015141143,0.0014764674,0.0001742237,0.000048092938],"category_scores_gemma":[0.00009403913,0.00021055453,0.0000655898,0.00018231838,0.000070214504,0.0001912412,0.009329971,0.0007742465,0.0000135656655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005854659,0.00072012044,0.015769526,0.00021695398,0.0000707504,0.000032092838,0.04897904,0.0071856044,0.00009381473,0.84459233,0.0010235166,0.08125771],"study_design_scores_gemma":[0.0022853694,0.00033290955,0.069999084,0.0013328459,0.000019962172,0.000009721843,0.00015866882,0.685058,0.0010238896,0.23499267,0.0025085653,0.0022783077],"about_ca_topic_score_codex":0.0000838049,"about_ca_topic_score_gemma":0.00026495507,"teacher_disagreement_score":0.6778724,"about_ca_system_score_codex":0.000098483666,"about_ca_system_score_gemma":0.000045181823,"threshold_uncertainty_score":0.9986824},"labels":[],"label_agreement":null},{"id":"W3104359459","doi":"","title":"1Asymptotic Capacity and Optimal Precoding in MIMO Multi-Hop Relay Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Precoding; Relay; MIMO; Zero-forcing precoding; Fading; Topology (electrical circuits); Mathematics; Mutual information; Relay channel; Singular value; Channel capacity; Channel state information; Computer science; Eigenvalues and eigenvectors; Channel (broadcasting); Mathematical optimization; Telecommunications; Statistics; Wireless; Power (physics); Combinatorics; Physics","score_opus":0.06467812725319336,"score_gpt":0.2797865075468076,"score_spread":0.21510838029361426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104359459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14937246,0.0011857634,0.8462374,0.00039157632,0.00022369369,0.00013624682,1.157242e-7,0.00010289519,0.0023498214],"genre_scores_gemma":[0.87581354,0.00048370412,0.123124376,0.00025720202,0.000043982964,0.0000105013705,5.587977e-7,0.0000051713637,0.00026096436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990386,0.00016227773,0.00019212515,0.00019745127,0.00007673322,0.0003328308],"domain_scores_gemma":[0.99922687,0.00016896054,0.000041339543,0.0004036242,0.000035662615,0.00012357155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000599334,0.00011071827,0.00012841522,0.0000757153,0.00014200933,0.000100412726,0.00041852944,0.000057003363,0.000025554551],"category_scores_gemma":[0.00005086408,0.00009992175,0.0000237179,0.00031813377,0.000041931693,0.000715206,0.0004715336,0.0002287603,0.00001454753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017216329,0.0007200278,0.2604941,0.00003054059,0.000055368688,0.0000052746645,0.017529774,0.02147773,0.0010515556,0.39671007,0.002013011,0.29989535],"study_design_scores_gemma":[0.00032204745,0.000014308863,0.05175765,0.000028420545,0.0000017484745,0.000009659074,0.00003233077,0.94638836,0.00011340527,0.000011795853,0.0011576695,0.000162598],"about_ca_topic_score_codex":0.000011432465,"about_ca_topic_score_gemma":0.00009122976,"teacher_disagreement_score":0.92491066,"about_ca_system_score_codex":0.00004331562,"about_ca_system_score_gemma":0.0000106586185,"threshold_uncertainty_score":0.4074691},"labels":[],"label_agreement":null},{"id":"W3105678206","doi":"","title":"Improved Capacity Scaling in Wireless Networks With Infrastructure","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Computer network; Telecommunications link; Base station; Throughput; Wireless network; Scaling; Wireless; Topology (electrical circuits); Telecommunications; Mathematics","score_opus":0.023500400435029694,"score_gpt":0.22614724276734682,"score_spread":0.20264684233231714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105678206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31096804,0.000055240787,0.6865179,0.00023737954,0.000049948172,0.00008387305,7.344711e-8,0.00009294721,0.0019946294],"genre_scores_gemma":[0.96454734,0.00021536491,0.03462937,0.0004719688,0.00002812253,0.000008048702,8.9321895e-7,0.0000049913147,0.00009388199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992753,0.00007149358,0.00014623193,0.00021330813,0.00009166575,0.00020194739],"domain_scores_gemma":[0.9992919,0.000052423155,0.000040462008,0.00048547945,0.000071183946,0.00005858089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012493263,0.000102529506,0.00012377741,0.000058155078,0.00017660529,0.00004992937,0.0006153729,0.00004635312,0.000018535426],"category_scores_gemma":[0.0000074748646,0.00007743039,0.0000185298,0.0005792435,0.0000648197,0.00028938008,0.00021129708,0.0002584017,0.0000020522712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008052235,0.00029506456,0.16626535,0.000022156648,0.00007228891,0.00009140346,0.011377707,0.10398534,0.006078552,0.23781253,0.0030043428,0.47091475],"study_design_scores_gemma":[0.0003433492,0.00002403864,0.033260137,0.000019076942,5.7687794e-7,0.000032857723,0.000013874442,0.9653453,0.00040568193,0.00005723735,0.00035152354,0.00014633621],"about_ca_topic_score_codex":0.000022692864,"about_ca_topic_score_gemma":0.00026087987,"teacher_disagreement_score":0.86135995,"about_ca_system_score_codex":0.000041055777,"about_ca_system_score_gemma":0.00004471962,"threshold_uncertainty_score":0.31575197},"labels":[],"label_agreement":null},{"id":"W3106348509","doi":"","title":"A Delay-Constrained Protocol with Adaptive Mode Selection for Bidirectional Relay Networks","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Computer network; Node (physics); Throughput; Transmission (telecommunications); Upper and lower bounds; Fading; Relay channel; Transmission delay; Queue; Markov chain; Network packet; Wireless; Channel (broadcasting); Telecommunications; Power (physics); Mathematics; Engineering","score_opus":0.045032265670976276,"score_gpt":0.31292929005032805,"score_spread":0.26789702437935176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106348509","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023830884,0.000015295604,0.9478081,0.0008754233,0.0001852713,0.043300755,0.000005996356,0.00044870746,0.007336644],"genre_scores_gemma":[0.12854785,0.000038433504,0.45521325,0.00044401438,0.0005734785,0.41084972,0.000024727038,0.000052166248,0.00425638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982223,0.00018679754,0.00033759556,0.00071799976,0.00021451343,0.00032082654],"domain_scores_gemma":[0.997992,0.00026255395,0.0002620896,0.0006931891,0.0006871903,0.000103018174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036018228,0.0003162475,0.00028363042,0.00014614245,0.00035833768,0.00021719019,0.00091241515,0.00023204612,0.00004981351],"category_scores_gemma":[0.000026428665,0.00021965045,0.000124075,0.00030413567,0.000078895275,0.00026082655,0.0007388403,0.0004837988,0.0000062118106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073018007,0.00027875023,0.0003654707,0.00006506437,0.0004684713,0.0000023961122,0.0004218148,0.12925276,0.00020133956,0.63903594,0.014121353,0.21505645],"study_design_scores_gemma":[0.00087970437,0.00024253706,0.000058111324,0.00024310908,0.0000107440255,0.000023147402,0.0000037938742,0.986157,0.00021155576,0.0034528126,0.008336599,0.00038090642],"about_ca_topic_score_codex":0.00001133014,"about_ca_topic_score_gemma":0.0002554181,"teacher_disagreement_score":0.8569042,"about_ca_system_score_codex":0.00020892153,"about_ca_system_score_gemma":0.00052439404,"threshold_uncertainty_score":0.89570856},"labels":[],"label_agreement":null},{"id":"W3111037536","doi":"10.22215/etd/2006-06704","title":"Multi-antenna and relaying techniques in wireless communication networks","year":2006,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage","funders":"","keywords":"Telecommunications; Computer science; Wireless","score_opus":0.027110676683117434,"score_gpt":0.2966294765971787,"score_spread":0.26951879991406125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111037536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031974692,0.013725504,0.91722125,0.0007292742,0.0004587207,0.0012612939,0.0000012635026,0.001042445,0.033585533],"genre_scores_gemma":[0.9003474,0.017068433,0.076763995,0.00020939164,0.000027940245,0.00013563725,0.00032482797,0.000030537867,0.0050918483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985966,0.0002469198,0.0004380316,0.00037751987,0.0001273407,0.0002135654],"domain_scores_gemma":[0.9984305,0.00014772697,0.00020344256,0.0010241591,0.0001523565,0.000041813317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004643168,0.00023362241,0.00028442958,0.00025148533,0.00023397064,0.00024054109,0.001162404,0.00025888486,0.0000057530274],"category_scores_gemma":[0.00002008419,0.00023440433,0.000044112363,0.00049723167,0.000033716075,0.00036136922,0.0003267127,0.00062854524,0.0000027385913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023468072,0.0003019471,0.005281737,0.00009570775,0.000034494627,0.000011009006,0.0027794633,0.00006305383,0.0046118144,0.10656456,0.0023357857,0.87789696],"study_design_scores_gemma":[0.00039862233,0.000026538939,0.033587012,0.0009282254,0.000009473282,0.0000045080683,0.00020443658,0.96157324,0.00080004154,0.00027993298,0.0015350041,0.0006529602],"about_ca_topic_score_codex":0.00015690732,"about_ca_topic_score_gemma":0.0064063165,"teacher_disagreement_score":0.9615102,"about_ca_system_score_codex":0.00007076719,"about_ca_system_score_gemma":0.00004276181,"threshold_uncertainty_score":0.95587313},"labels":[],"label_agreement":null},{"id":"W3119145343","doi":"10.1109/ojcs.2021.3049773","title":"Packet Loss Recovery in Broadcast for Real-Time Applications in Dense Wireless Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Open Journal of the Computer Society","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network packet; Computer science; Encoder; Computer network; Linear network coding; Broadcasting (networking); Coding (social sciences); Packet loss; Real-time computing; Random access; Wireless network; Wireless; Telecommunications","score_opus":0.03222322199473707,"score_gpt":0.2936490190687042,"score_spread":0.2614257970739672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119145343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05574296,0.0004506131,0.9390315,0.003493429,0.0006528845,0.00048007426,0.000002415171,0.000010712259,0.00013541998],"genre_scores_gemma":[0.6341963,0.008352286,0.35173845,0.003715792,0.00090144045,0.00009956113,0.000008099076,0.00004546358,0.0009426033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998459,0.0003737402,0.0005423816,0.0002318047,0.00015857235,0.00023449793],"domain_scores_gemma":[0.9980313,0.0004706183,0.0003388046,0.0007451794,0.00034506613,0.000068996786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012068707,0.00013234238,0.00032211072,0.0000347616,0.00021141586,0.0004309767,0.002946278,0.000073348725,0.0000058310293],"category_scores_gemma":[0.000012856563,0.00010540401,0.00027415674,0.0008332145,0.000048564973,0.0005363957,0.0011135727,0.00037682307,0.0000019732165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119195545,0.0015593847,0.013808958,0.00007474693,0.00042698949,0.00007812346,0.011870558,0.23568647,0.0038320208,0.013048134,0.18793404,0.5315614],"study_design_scores_gemma":[0.0026450998,0.000107211185,0.0107215,0.0005895005,0.00001817212,0.0001908296,0.00012026199,0.96621734,0.0010211081,0.0019033175,0.016055504,0.00041013598],"about_ca_topic_score_codex":0.0000053010244,"about_ca_topic_score_gemma":0.000050416544,"teacher_disagreement_score":0.7305309,"about_ca_system_score_codex":0.00016829792,"about_ca_system_score_gemma":0.00028091038,"threshold_uncertainty_score":0.5474967},"labels":[],"label_agreement":null},{"id":"W3120063243","doi":"10.1007/978-3-030-61303-7_7","title":"Nested Linear/Lattice Codes Revisited","year":2020,"lang":"en","type":"book-chapter","venue":"Mathematical engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematical proof; Computer science; Lattice (music); Theoretical computer science; Mathematics; Discrete mathematics; Physics","score_opus":0.04418405579860457,"score_gpt":0.2541419839945288,"score_spread":0.20995792819592424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120063243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013163442,0.0007953407,0.7809089,0.0007967637,0.000071149974,0.00019294365,0.000002561228,0.000589843,0.21664119],"genre_scores_gemma":[0.011141364,0.0018146584,0.78474694,0.0021422387,0.0010235668,0.00007068736,0.000084904015,0.00035914563,0.19861647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987453,0.000016105856,0.0004253237,0.00035040086,0.0002643724,0.00019845364],"domain_scores_gemma":[0.99838597,0.00037342036,0.00009543539,0.00087018637,0.00009974539,0.00017524588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001867037,0.00032079543,0.0004890994,0.00009790776,0.000067947345,0.00013197599,0.001020057,0.00016150456,0.00021098419],"category_scores_gemma":[0.00023555882,0.0003088487,0.00013199198,0.00012735423,0.000024308145,0.00013127188,0.00062117475,0.00056163996,0.0005926645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.384282e-7,0.0000062458203,6.4874605e-8,0.00015824643,0.000034912842,0.000015998177,0.00010856386,0.00025705763,0.00007860784,0.9957048,0.00037752397,0.0032573245],"study_design_scores_gemma":[0.00011132071,0.000024944326,0.0000017512364,0.00081105664,0.000027367081,0.000022281907,8.9357394e-7,0.84364516,0.000053311058,0.012454107,0.1424253,0.00042252714],"about_ca_topic_score_codex":5.5503758e-8,"about_ca_topic_score_gemma":1.0393546e-7,"teacher_disagreement_score":0.98325074,"about_ca_system_score_codex":0.0000491705,"about_ca_system_score_gemma":0.000028880972,"threshold_uncertainty_score":0.99993634},"labels":[],"label_agreement":null},{"id":"W3122894585","doi":"","title":"The Network Design Problem with Relays","year":2006,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Undirected graph; Vertex (graph theory); Graph; Combinatorics; Network planning and design; Set (abstract data type); Mathematics; Computer science; Discrete mathematics; Computer network","score_opus":0.01296444278327788,"score_gpt":0.22085922993750137,"score_spread":0.2078947871542235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122894585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029258258,0.009922395,0.9821011,0.004217397,0.000071476235,0.00017090645,2.2946708e-8,0.00006225651,0.0031618918],"genre_scores_gemma":[0.9292776,0.017995061,0.046932597,0.00025351704,0.0005616292,0.000037833386,6.973213e-7,0.000021726615,0.004919366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976301,0.00030019716,0.00020261311,0.00014530511,0.00020339822,0.0015183778],"domain_scores_gemma":[0.999112,0.0001838153,0.0001349255,0.0004080937,0.00012244811,0.000038679762],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025672668,0.00011020592,0.00008703055,0.000019841733,0.0013111276,0.00034141104,0.0011891474,0.000027143813,0.0000023086018],"category_scores_gemma":[0.000009182612,0.000064211345,0.000040207775,0.00044078313,0.00004917087,0.00025973484,0.00011464169,0.001181109,0.00001631517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001210291,0.000013015883,0.00015232895,2.239411e-7,0.0000242709,0.0000013888965,0.00003322904,0.013490617,0.00001916642,0.92152447,0.0018765456,0.06285261],"study_design_scores_gemma":[0.0006740615,0.0005289191,0.00050982856,0.000041235096,0.000013035629,0.00085812557,0.000066362816,0.035436604,0.000050011367,0.8779197,0.083609074,0.000293097],"about_ca_topic_score_codex":0.0000049647924,"about_ca_topic_score_gemma":0.0007769947,"teacher_disagreement_score":0.93516845,"about_ca_system_score_codex":0.00029853886,"about_ca_system_score_gemma":0.0010968717,"threshold_uncertainty_score":0.99998903},"labels":[],"label_agreement":null},{"id":"W3123270564","doi":"10.48550/arxiv.2101.07291","title":"Cross-Layer Network Codes for Content Delivery in Cache-Enabled D2D Networks","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Linear network coding; Cache; Scheduling (production processes); Coding (social sciences); Computer network; Distributed computing; Mathematical optimization; Mathematics","score_opus":0.18151931032901794,"score_gpt":0.2406456673730565,"score_spread":0.05912635704403857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123270564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2163661,0.0020215816,0.7791418,0.0001307067,0.00079717947,0.00058859907,0.000005334665,0.00015361141,0.0007951142],"genre_scores_gemma":[0.989207,0.004020749,0.0041212495,0.00046895095,0.00018048933,0.000013575128,0.00007408999,0.000026406975,0.001887453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716204,0.00043702245,0.0004202049,0.0012365241,0.000084973915,0.0006592134],"domain_scores_gemma":[0.99662596,0.0005063994,0.00029540944,0.0017667866,0.00062769646,0.00017775904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000773494,0.00040457293,0.00059262844,0.00017237087,0.00038467752,0.0005327616,0.002499775,0.00038928466,0.000049228354],"category_scores_gemma":[0.000057472218,0.00048429414,0.00032466793,0.0009614307,0.00012572948,0.0005003439,0.003944143,0.00089528377,0.000008211659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005802366,0.000083961924,0.016668811,0.00003505768,0.00010175723,0.00010656512,0.000205991,0.9348504,0.00002551032,0.045079127,0.0005361222,0.0022486497],"study_design_scores_gemma":[0.001038992,0.000034702836,0.0065407795,0.00028405845,0.00003348915,0.00000267135,0.00006857241,0.988753,0.000044404394,0.0015123714,0.0011416328,0.00054529845],"about_ca_topic_score_codex":0.00011757698,"about_ca_topic_score_gemma":0.0012102018,"teacher_disagreement_score":0.77502054,"about_ca_system_score_codex":0.00038470989,"about_ca_system_score_gemma":0.00031790676,"threshold_uncertainty_score":0.99976087},"labels":[],"label_agreement":null},{"id":"W3127164514","doi":"10.1109/jiot.2021.3056580","title":"Practical Network Coding Technologies and Softwarization in Wireless Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Shenzhen University; National Natural Science Foundation of China","keywords":"Linear network coding; Computer science; Computer network; Decoding methods; Network packet; Wireless network; Coding (social sciences); Wireless; Distributed computing; Exploit; Computational complexity theory; Telecommunications; Algorithm; Computer security","score_opus":0.03564095332228065,"score_gpt":0.29736143634282336,"score_spread":0.26172048302054274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127164514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02486102,0.0010313545,0.970505,0.002720919,0.0005285663,0.000039734434,4.4080245e-8,0.000069315734,0.00024402504],"genre_scores_gemma":[0.93547326,0.0033993465,0.0607339,0.0002658067,0.000058268284,0.0000017899725,4.7569358e-7,0.0000059112913,0.00006124107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889576,0.00018122942,0.00038020403,0.00017881325,0.00015781003,0.00020619253],"domain_scores_gemma":[0.9989736,0.000292468,0.00024379756,0.0002409284,0.00020749358,0.000041706153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007233567,0.00009797456,0.00019383301,0.00009449554,0.000091557195,0.00027658863,0.00049549685,0.00009179766,0.000008123118],"category_scores_gemma":[0.00025796477,0.00009311874,0.000039078448,0.000433184,0.00007115135,0.0007940278,0.0004449351,0.0006644798,9.0730185e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060576363,0.0002734329,0.0283529,0.00004594434,0.0001487836,0.0004670478,0.004887919,0.010352266,0.0069278567,0.26425952,0.012932612,0.6712912],"study_design_scores_gemma":[0.00041587537,0.000061185136,0.0010558208,0.00059951626,0.0000075027815,0.00094640563,0.00015259883,0.9843183,0.0072371312,0.0042325207,0.0007879541,0.00018517686],"about_ca_topic_score_codex":0.0000022147929,"about_ca_topic_score_gemma":0.000014366988,"teacher_disagreement_score":0.97396606,"about_ca_system_score_codex":0.000047579917,"about_ca_system_score_gemma":0.00007253404,"threshold_uncertainty_score":0.37972718},"labels":[],"label_agreement":null},{"id":"W3127366024","doi":"10.1016/j.aeue.2021.153642","title":"Error probability of cognitive-based two-way relaying communication systems with Nakagami-m fading","year":2021,"lang":"en","type":"article","venue":"AEU - International Journal of Electronics and Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Nakagami distribution; Cumulative distribution function; Moment-generating function; Fading; Cognitive radio; Underlay; Interference (communication); Path loss; Computer science; Secondary source; Constraint (computer-aided design); Signal-to-interference-plus-noise ratio; Topology (electrical circuits); Signal-to-noise ratio (imaging); Closed-form expression; Expression (computer science); Algorithm; Mathematics; Telecommunications; Channel (broadcasting); Probability distribution; Probability density function; Statistics; Power (physics); Wireless; Physics","score_opus":0.045357928034287565,"score_gpt":0.3151327844504723,"score_spread":0.26977485641618476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127366024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29669675,0.07749445,0.5947093,0.022013012,0.00037170236,0.0006051473,0.00003093842,0.000089860885,0.007988871],"genre_scores_gemma":[0.9667461,0.00756369,0.02539129,0.00018223243,0.000018627148,0.000016189986,0.000036782265,0.000010055259,0.000035013978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980023,0.0006318116,0.0006532414,0.00016361957,0.00038596345,0.00016310222],"domain_scores_gemma":[0.9942921,0.0010615007,0.0007326971,0.0011704222,0.0026686385,0.00007468196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009976212,0.0001321619,0.00025760007,0.00016823896,0.00029703954,0.00021661165,0.0022832484,0.000048048085,0.000008959059],"category_scores_gemma":[0.00027398614,0.00012037124,0.000079195306,0.00043062246,0.0001857662,0.0005140065,0.0006409337,0.0005474127,7.89372e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106215615,0.00090212387,0.0046567707,0.000025064792,0.0006220582,0.000010212552,0.0021368507,0.005212428,0.0028265289,0.9374363,0.0001091559,0.045956302],"study_design_scores_gemma":[0.010407266,0.0013876407,0.011194987,0.0050633354,0.0003699978,0.0015523693,0.0025541543,0.9037811,0.008678306,0.018147264,0.03555139,0.0013121822],"about_ca_topic_score_codex":0.0000138889245,"about_ca_topic_score_gemma":0.00015653769,"teacher_disagreement_score":0.91928905,"about_ca_system_score_codex":0.0001471228,"about_ca_system_score_gemma":0.0005727077,"threshold_uncertainty_score":0.49085966},"labels":[],"label_agreement":null},{"id":"W3129742632","doi":"10.1109/vtc2020-fall49728.2020.9348734","title":"Local-Search Based Detector for Decode-and-Forward Protocol Cooperative Systems","year":2020,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Detector; Decoding methods; Computer science; Algorithm; Metric (unit); Constellation; Antenna diversity; QAM; Antenna (radio); Bit error rate; Quadrature amplitude modulation; Telecommunications; Engineering","score_opus":0.08290642576082952,"score_gpt":0.3324194280747515,"score_spread":0.24951300231392198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129742632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007295847,0.000041110372,0.9633746,0.0037815662,0.00003183309,0.03156662,0.0000023549478,0.00017817828,0.0009507787],"genre_scores_gemma":[0.8741595,0.000008465359,0.04481334,0.0032855629,0.00006470704,0.07736033,0.0000030542587,0.000016904738,0.0002881026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988658,0.00018176467,0.00022988854,0.0003472487,0.00015693452,0.0002183969],"domain_scores_gemma":[0.99878585,0.00029897253,0.000038711827,0.00037095274,0.00030915817,0.00019635734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031861188,0.00013073224,0.00018118316,0.00004112464,0.00026263966,0.0002927879,0.0006790769,0.00004188893,0.0000382204],"category_scores_gemma":[0.000086574524,0.00010373195,0.000042598123,0.00035782135,0.0000589626,0.00022580153,0.00030332035,0.00012241829,0.000030052299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040941138,0.00024137102,0.00055324973,0.0006943192,0.00013140783,0.000009297298,0.004371637,0.039729096,0.009673819,0.5198599,0.022688685,0.40163782],"study_design_scores_gemma":[0.0008443109,0.0002740913,0.00003521037,0.000022608056,0.0000017552661,9.689636e-7,0.00005159785,0.9421927,0.0057747224,0.000013793592,0.050644595,0.00014369849],"about_ca_topic_score_codex":0.0000050650992,"about_ca_topic_score_gemma":0.000016565993,"teacher_disagreement_score":0.9185613,"about_ca_system_score_codex":0.000034901917,"about_ca_system_score_gemma":0.00014384766,"threshold_uncertainty_score":0.42300662},"labels":[],"label_agreement":null},{"id":"W3129849076","doi":"10.1109/globecom42002.2020.9348080","title":"NC-MAC: Network Coding-based Distributed MAC Protocol for Reliable Beacon Broadcasting in V2X","year":2020,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer network; Computer science; Broadcasting (networking); Linear network coding; Wireless ad hoc network; Coding (social sciences); Vehicular ad hoc network; Reliability (semiconductor); Protocol (science); Network topology; Telecommunications; Wireless","score_opus":0.08884529051639597,"score_gpt":0.32884801485471526,"score_spread":0.2400027243383193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129849076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059603848,0.000019874458,0.9525595,0.0069625466,0.00005793265,0.038216252,0.000003447009,0.00030201577,0.0018188774],"genre_scores_gemma":[0.45048565,0.000012114743,0.2832909,0.013715974,0.00054802885,0.25143987,0.00009755833,0.000059932387,0.00034996748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851406,0.00010773107,0.00040332266,0.00041422248,0.00015066087,0.00040998365],"domain_scores_gemma":[0.9987886,0.0003290596,0.0001232722,0.0004662493,0.00015280841,0.00013999481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045930644,0.00016982276,0.00022498934,0.000039897153,0.00025917837,0.00019875962,0.0009597764,0.000059184433,0.000071841634],"category_scores_gemma":[0.00019508917,0.00015955734,0.00006680952,0.0010027157,0.000027668364,0.00025186504,0.00037818248,0.00021753076,0.000017596352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006132668,0.00055917486,0.01781658,0.00050765753,0.00007493773,0.000028753175,0.0018297083,0.32211962,0.0026191187,0.21567397,0.28663468,0.15152252],"study_design_scores_gemma":[0.0014112836,0.00012267847,0.00026703754,0.00011205035,0.0000017501532,5.3955694e-7,0.000009700463,0.8736382,0.0009821459,0.00021042512,0.12305011,0.00019406684],"about_ca_topic_score_codex":0.0000073000915,"about_ca_topic_score_gemma":0.00004308711,"teacher_disagreement_score":0.66926855,"about_ca_system_score_codex":0.00006781111,"about_ca_system_score_gemma":0.0001233465,"threshold_uncertainty_score":0.6506559},"labels":[],"label_agreement":null},{"id":"W3130972810","doi":"10.1109/tnse.2021.3061537","title":"Delay Optimal Concurrent Transmissions With Raptor Codes in Dual Connectivity Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Raptor code; Network packet; Retransmission; Jitter; User equipment; Computer network; Real-time computing; Algorithm; Decoding methods; Block code; Linear code; Base station; Telecommunications","score_opus":0.01733029739127841,"score_gpt":0.2379729130105195,"score_spread":0.2206426156192411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130972810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049546257,0.00066359295,0.9486645,0.00038202447,0.00042388926,0.00011122356,0.0000010621069,0.00010825736,0.00009920244],"genre_scores_gemma":[0.9874115,0.0010261538,0.011332424,0.00012395701,0.00004057187,0.000031472835,5.3631845e-7,0.000008674578,0.000024703397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860185,0.000056697052,0.00018783828,0.00043837435,0.00027267684,0.0004425416],"domain_scores_gemma":[0.9990459,0.00022583603,0.000027085658,0.00036311903,0.00015112557,0.00018695406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005643886,0.00016949099,0.00018957802,0.0001353625,0.00048801844,0.00021464097,0.000288016,0.000047705777,0.000011587906],"category_scores_gemma":[0.000010095988,0.00015372076,0.000033236985,0.0020806068,0.00014355924,0.0005666019,0.00001226492,0.00039870842,0.0000012577792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005335827,0.00005076663,0.00002550752,0.0000038153053,0.000008514972,0.000021988506,0.0002722364,0.960295,0.0008808883,0.0024692197,0.000026365922,0.035940327],"study_design_scores_gemma":[0.00037971424,0.000073309006,0.00080538756,0.00014640823,0.0000061260043,0.00007882992,0.000029149769,0.9955954,0.001651666,0.0000047608,0.0010062652,0.00022300011],"about_ca_topic_score_codex":0.0000032589182,"about_ca_topic_score_gemma":0.000090633774,"teacher_disagreement_score":0.93786526,"about_ca_system_score_codex":0.00008797949,"about_ca_system_score_gemma":0.00024377453,"threshold_uncertainty_score":0.6268551},"labels":[],"label_agreement":null},{"id":"W3131067069","doi":"10.1109/vtc2020-fall49728.2020.9348831","title":"Network-Coded Cooperative MIMO with Outdated CSI and CCI","year":2020,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Relay; Computer science; Channel state information; Coding gain; Diversity gain; Coding (social sciences); Cooperative MIMO; Interference (communication); Antenna (radio); Linear network coding; Telecommunications; Algorithm; Channel (broadcasting); Electronic engineering; Decoding methods; Computer network; Mathematics; 3G MIMO; Wireless; Engineering; Statistics; Power (physics); Physics","score_opus":0.04580062361096774,"score_gpt":0.25307258786625636,"score_spread":0.20727196425528863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131067069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006789832,0.0006150235,0.9432399,0.028770627,0.000053265405,0.00027148364,5.593324e-7,0.000384962,0.019874306],"genre_scores_gemma":[0.95016605,0.00024567393,0.03772068,0.011243623,0.00006727298,0.000011499183,0.000004467661,0.0000081002445,0.00053265394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916154,0.00011681238,0.0001355455,0.00029650063,0.00010542193,0.00018415676],"domain_scores_gemma":[0.9992634,0.00007757611,0.000038071666,0.00033220687,0.00014197711,0.000146736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010499463,0.00012334842,0.00015009692,0.000016463757,0.00021784665,0.00020962844,0.00049800874,0.000026241238,0.00007998663],"category_scores_gemma":[0.000023734943,0.000089201756,0.000012799138,0.0005511619,0.000055960565,0.00033112295,0.00041942598,0.00014312756,0.00004657619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001246934,0.00010721844,0.004439202,0.000017270988,0.00014985213,0.000037162543,0.010613673,0.0059932955,0.0024673976,0.79025275,0.065443136,0.12035434],"study_design_scores_gemma":[0.0015704565,0.00051635026,0.0023510356,0.00004463804,0.000011431537,0.00001654971,0.00013628176,0.91894495,0.0014514944,0.00024952923,0.074166454,0.00054083666],"about_ca_topic_score_codex":0.0000028556449,"about_ca_topic_score_gemma":0.000049267124,"teacher_disagreement_score":0.9433762,"about_ca_system_score_codex":0.000008835511,"about_ca_system_score_gemma":0.00004236633,"threshold_uncertainty_score":0.36375418},"labels":[],"label_agreement":null},{"id":"W3132825138","doi":"10.1109/vtc2020-fall49728.2020.9348739","title":"Secrecy Rate Performance of Cache-enabled Millimeter Wave Cellular Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cache; Secrecy; Computer network; Cellular network; Extremely high frequency; Telecommunications; Computer security","score_opus":0.04806769181918107,"score_gpt":0.22907308855411754,"score_spread":0.18100539673493646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132825138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100568905,0.0005496742,0.8894845,0.0019411036,0.00010598398,0.00013542883,2.6449067e-7,0.00011390392,0.007100205],"genre_scores_gemma":[0.9869706,0.0006121865,0.0097749075,0.00206902,0.000058927333,0.0000057250886,0.000003522323,0.000007080829,0.00049800705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990535,0.00015472146,0.00025196924,0.00023360224,0.000108787826,0.00019745459],"domain_scores_gemma":[0.9990697,0.00009056577,0.000078275516,0.00052577996,0.00012539502,0.000110284294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027929875,0.00011530501,0.00017774059,0.00003206017,0.000108702385,0.00005785262,0.0007319015,0.000041539686,0.00017593692],"category_scores_gemma":[0.000022438831,0.00009746629,0.000058070735,0.0005361804,0.00003405404,0.00028697183,0.0004947736,0.00016744628,0.000034384422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002037008,0.0003606334,0.008700879,0.00023826442,0.0003687762,0.00004290603,0.013037097,0.04673755,0.16683507,0.28749818,0.019264529,0.45671242],"study_design_scores_gemma":[0.00022213055,0.0000916517,0.0005513216,0.000014166815,0.000003779699,8.507693e-7,0.000010915502,0.9669843,0.028755395,0.000035187928,0.0032004907,0.00012981531],"about_ca_topic_score_codex":0.000002059371,"about_ca_topic_score_gemma":0.000002120214,"teacher_disagreement_score":0.9202467,"about_ca_system_score_codex":0.0000126860195,"about_ca_system_score_gemma":0.0000321011,"threshold_uncertainty_score":0.397456},"labels":[],"label_agreement":null},{"id":"W3134972866","doi":"10.1049/cmu2.12151","title":"Analysis of spectral efficiency for OFDM cooperative cognitive networks with non‐linear relay","year":2021,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Relay; Subcarrier; Computer science; Spectral efficiency; Relay channel; Topology (electrical circuits); Telecommunications link; Amplifier; Interference (communication); Node (physics); Power (physics); Electronic engineering; Telecommunications; Channel (broadcasting); Mathematics; Physics; Engineering; Acoustics; Bandwidth (computing)","score_opus":0.041672125023223754,"score_gpt":0.3192907715405823,"score_spread":0.2776186465173585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134972866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008231335,0.0018678858,0.98301965,0.0019819245,0.000043554315,0.00035863946,0.000030019151,0.0000674415,0.0043995255],"genre_scores_gemma":[0.91469747,0.0018270336,0.08248492,0.0003357776,0.000017035592,0.00011718507,0.00021456824,0.000011390075,0.00029463618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852145,0.00034694312,0.0003982471,0.00033092065,0.00016539315,0.00023702874],"domain_scores_gemma":[0.99432564,0.0013248154,0.0002062683,0.0025795305,0.0014829141,0.000080847814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039315107,0.00015998645,0.00037978575,0.00019103475,0.00057121884,0.00008631207,0.0018389361,0.000060018527,0.00003217339],"category_scores_gemma":[0.00017325269,0.00014641443,0.00017464506,0.003690789,0.00026539815,0.00024204026,0.000749315,0.0002769469,0.0000043257296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001874433,0.003938494,0.012988972,0.000046335645,0.0076678786,0.000013104256,0.027324662,0.40484968,0.00345045,0.4821515,0.001858525,0.055522963],"study_design_scores_gemma":[0.00061048917,0.00014054908,0.004724208,0.000077639575,0.00036856334,0.0000036122567,0.00038988146,0.9908592,0.0010737736,0.000031977364,0.001507448,0.00021263768],"about_ca_topic_score_codex":0.0000086363225,"about_ca_topic_score_gemma":0.0007097358,"teacher_disagreement_score":0.9064661,"about_ca_system_score_codex":0.000042626307,"about_ca_system_score_gemma":0.00025539557,"threshold_uncertainty_score":0.59706074},"labels":[],"label_agreement":null},{"id":"W3134988443","doi":"10.1109/access.2022.3195056","title":"The Magic of Superposition: A Survey on Simultaneous Transmission Based Wireless Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Exploit; Wireless; Scalability; Transmission (telecommunications); Wireless network; Superposition principle; Computer network; Distributed computing; Computer engineering; Telecommunications; Computer security","score_opus":0.05669088850402987,"score_gpt":0.3084337902767692,"score_spread":0.25174290177273934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134988443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23608197,0.0019278356,0.75437814,0.002726818,0.0018307251,0.00085107854,0.00003728541,0.00019701684,0.0019691112],"genre_scores_gemma":[0.9993193,0.00012765807,0.0000592502,0.00026810286,0.000018832767,0.000034518194,0.000008461765,0.000006551012,0.00015732368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981826,0.00094085984,0.0002169679,0.0001892512,0.00033249907,0.00013781962],"domain_scores_gemma":[0.9976037,0.001453194,0.000085983505,0.0006776021,0.00013760914,0.000041883028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007653317,0.00008565436,0.00011889755,0.000053118816,0.0006885182,0.0002191882,0.0021697467,0.000016920714,0.00002340356],"category_scores_gemma":[0.000019326246,0.000063765954,0.000040873,0.0005980528,0.00003648012,0.0001370744,0.00019122951,0.0001787115,0.0000036983654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035347708,0.00063146494,0.0020119082,0.000059563303,0.00005530858,0.000049890077,0.0012778881,0.6568129,0.006934105,0.022598848,0.008271199,0.30094343],"study_design_scores_gemma":[0.00027712947,0.00011964508,0.0012867042,0.000032162137,0.0000023061616,0.0000037791613,0.000014132963,0.9876949,0.002001751,0.00003406625,0.008422186,0.00011121828],"about_ca_topic_score_codex":0.00007807525,"about_ca_topic_score_gemma":0.000034893823,"teacher_disagreement_score":0.76323736,"about_ca_system_score_codex":0.000058913316,"about_ca_system_score_gemma":0.000077010045,"threshold_uncertainty_score":0.52955955},"labels":[],"label_agreement":null},{"id":"W3136003668","doi":"10.1007/s11036-008-0132-7","title":"Cooperative Protocols Design for Wireless Ad-Hoc Networks with Multi-hop Routing","year":2009,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Medical Research Council","keywords":"Computer network; Computer science; Cooperative diversity; Wireless ad hoc network; Fading; Physical layer; Optimized Link State Routing Protocol; Diversity gain; Ad hoc wireless distribution service; Wireless network; Distributed computing; Routing protocol; MIMO; Wireless; Telecommunications; Routing (electronic design automation); Channel (broadcasting)","score_opus":0.04255504484579968,"score_gpt":0.31220632168398993,"score_spread":0.26965127683819023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136003668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011528709,0.0017240728,0.9802399,0.0003667563,0.000017932225,0.017191973,0.0000019086294,0.00022238574,0.00011976894],"genre_scores_gemma":[0.78640157,0.0022241971,0.107251674,0.0012389905,0.00027941342,0.102191664,0.000035653185,0.000035662826,0.00034116866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851364,0.000121154204,0.0003186402,0.0005454571,0.00010616241,0.00039492335],"domain_scores_gemma":[0.9983376,0.00031220357,0.00015920392,0.0007417141,0.0003012485,0.00014798471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040391597,0.0002440522,0.00026627912,0.000045242137,0.0009730172,0.00037232175,0.0006854231,0.00009788788,0.0000041783496],"category_scores_gemma":[0.000007045019,0.0002031996,0.000047378697,0.00064898585,0.000087817534,0.00027957183,0.00013430437,0.00024856077,0.000002186763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030247109,0.00017846613,0.00003794981,0.000004063717,0.000018202953,4.77043e-7,0.00015692366,0.4510162,0.0000942894,0.028523983,0.0006349338,0.5193043],"study_design_scores_gemma":[0.0008206822,0.00040329024,0.00023493907,0.00007672767,0.00000977256,0.000006005049,0.000042348132,0.95821357,0.00006827686,0.000092787996,0.039741755,0.0002898577],"about_ca_topic_score_codex":4.3055593e-7,"about_ca_topic_score_gemma":0.0000133400345,"teacher_disagreement_score":0.8729882,"about_ca_system_score_codex":0.000038803937,"about_ca_system_score_gemma":0.000058119578,"threshold_uncertainty_score":0.82862395},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04730526437810581,"score_gpt":0.28533616698059977,"score_spread":0.23803090260249396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144673228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007571395,0.00053958106,0.9816223,0.0011066186,0.00047971992,0.000121700425,7.3077494e-8,0.0002692193,0.008289399],"genre_scores_gemma":[0.9459288,0.0002543161,0.0527927,0.0003155378,0.00007048895,0.000014966155,0.000003624477,0.0000078644,0.0006116713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911416,0.000110352,0.000169772,0.00026025728,0.00015149011,0.00019394362],"domain_scores_gemma":[0.99914294,0.000104873354,0.00005926152,0.00035615038,0.00019795376,0.00013882508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005056123,0.00010664685,0.00009637472,0.00006426241,0.00018907672,0.00016148224,0.00039197307,0.00006403849,0.00001949345],"category_scores_gemma":[0.000092046525,0.000098682896,0.000022325807,0.0003870453,0.000027741562,0.00061158143,0.0003413876,0.00017872753,0.000032259788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019610628,0.00015050452,0.001406936,0.00000663927,0.00010757274,0.000002810348,0.004103253,0.10141253,0.0009852544,0.49777874,0.034752037,0.35909763],"study_design_scores_gemma":[0.0006567541,0.00018461599,0.00049853715,0.000007670268,0.0000048981933,0.000007555119,0.00009168699,0.97469455,0.00014012895,0.000056341807,0.023484116,0.00017313985],"about_ca_topic_score_codex":0.000012327357,"about_ca_topic_score_gemma":0.00004772357,"teacher_disagreement_score":0.9383574,"about_ca_system_score_codex":0.00008936803,"about_ca_system_score_gemma":0.0000685616,"threshold_uncertainty_score":0.40241715},"labels":[],"label_agreement":null},{"id":"W3149942371","doi":"","title":"Transmission scheme and performance analysis for decode-and-forward MIMO two-way relay systems","year":2009,"lang":"zh","type":"article","venue":"中国科学(F辑:信息科学)(英文版)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Channel state information; Transmission (telecommunications); MIMO; Computer science; Quantization (signal processing); Algorithm; Transmission system; Relay channel; Beamforming; Channel (broadcasting); Control theory (sociology); Mathematics; Topology (electrical circuits); Telecommunications; Wireless; Artificial intelligence","score_opus":0.03766323417019028,"score_gpt":0.29152480750889337,"score_spread":0.2538615733387031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149942371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27762976,0.06525695,0.6376319,0.011038189,0.00084027444,0.001950958,0.00003930685,0.00038347868,0.0052291956],"genre_scores_gemma":[0.96039385,0.019364895,0.017207203,0.00074557465,0.00022942515,0.00006667227,0.000039944316,0.000035163102,0.0019172644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590796,0.0003895989,0.0010603354,0.001226845,0.0005369532,0.00087829796],"domain_scores_gemma":[0.99653786,0.000426364,0.00040542593,0.0015450317,0.0004482909,0.0006369982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016284921,0.00063451903,0.0010222843,0.0005349438,0.00119012,0.00084326346,0.0012675995,0.00028479352,0.00006719733],"category_scores_gemma":[0.000098718105,0.00058716786,0.00035578923,0.0019238266,0.00018964449,0.00094730716,0.00035038873,0.000575669,0.00003277404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004124725,0.0005068479,0.014886802,0.00052042305,0.0011695484,0.00001726177,0.017663889,0.007069704,0.002880689,0.045130603,0.0025864684,0.9071553],"study_design_scores_gemma":[0.0017904211,0.00061112456,0.013696646,0.00050538534,0.00043506033,0.000029895275,0.000245752,0.944488,0.0003405583,0.00012744944,0.036919303,0.0008103919],"about_ca_topic_score_codex":0.000052505,"about_ca_topic_score_gemma":0.0000860397,"teacher_disagreement_score":0.9374183,"about_ca_system_score_codex":0.00013534114,"about_ca_system_score_gemma":0.00016292513,"threshold_uncertainty_score":0.999658},"labels":[],"label_agreement":null},{"id":"W3151659338","doi":"10.1109/twc.2010.091510.100125","title":"Cross-Layer Design for Multihop Wireless Relaying Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Channel state information; Computer network; Routing (electronic design automation); Fading; Wireless; Wireless network; Channel (broadcasting); Mathematical optimization; Distributed computing; Mathematics; Telecommunications","score_opus":0.08147284503244252,"score_gpt":0.3330124264827765,"score_spread":0.251539581450334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151659338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006755573,0.00017821789,0.9877699,0.0023013088,0.0010094647,0.00090043346,0.000014109436,0.0005658267,0.0005051924],"genre_scores_gemma":[0.8606101,0.001511872,0.1358965,0.0004639444,0.000052986343,0.0008752235,0.00001132962,0.000046558634,0.0005314623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977459,0.0003931877,0.0005946035,0.0005348503,0.00023717742,0.0004943137],"domain_scores_gemma":[0.9917803,0.0021323327,0.00020523006,0.0051445966,0.00052996515,0.00020761782],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00089766213,0.00032673552,0.0003112866,0.00024670232,0.0026980368,0.00049269217,0.004664313,0.0002492983,0.000047706297],"category_scores_gemma":[0.00002718248,0.00034577007,0.00023786168,0.00089672644,0.00034912655,0.00076841464,0.00006275691,0.0013720967,0.00005243481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007854634,0.0012529766,0.00009341769,0.000019244151,0.00016815627,0.0000014760209,0.0016980103,0.11726205,0.033649914,0.092404604,0.000689092,0.7526825],"study_design_scores_gemma":[0.0008319306,0.00007416326,0.00016340462,0.000048783706,0.00002304093,0.000011656857,0.000024805036,0.98116535,0.010371493,0.00023253003,0.00662336,0.00042949323],"about_ca_topic_score_codex":0.000016444212,"about_ca_topic_score_gemma":0.00033886347,"teacher_disagreement_score":0.8639033,"about_ca_system_score_codex":0.00008439492,"about_ca_system_score_gemma":0.0001500568,"threshold_uncertainty_score":0.99989945},"labels":[],"label_agreement":null},{"id":"W3159255481","doi":"10.1016/j.phycom.2021.101352","title":"Physical layer secrecy performance analysis of relay selection in a cooperative wireless network","year":2021,"lang":"en","type":"article","venue":"Physical Communication","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Secrecy; Relay; Computer science; Physical layer; Computer network; Selection (genetic algorithm); Wireless; Transmission (telecommunications); PHY; Secure transmission; Telecommunications; Computer security; Artificial intelligence","score_opus":0.03321907957227433,"score_gpt":0.3027233771348125,"score_spread":0.2695042975625382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159255481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95378363,0.00030321805,0.043207806,0.00059166213,0.000023254444,0.00012939367,0.0000013100097,0.00006592146,0.0018938079],"genre_scores_gemma":[0.99631536,0.000775389,0.0025636416,0.00012534924,0.000045438363,0.000047497335,0.000046022553,0.000008849757,0.00007247089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980417,0.0008695474,0.00031829416,0.00031359858,0.00023503606,0.00022180588],"domain_scores_gemma":[0.9977199,0.00050469843,0.0001686499,0.0010994206,0.00045434549,0.000052979118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034752765,0.00015180573,0.00043502095,0.00014078674,0.00023322762,0.00007232174,0.0009521542,0.00004577218,0.000011488539],"category_scores_gemma":[0.000054672222,0.00015290109,0.00014558417,0.0052904636,0.00008048134,0.00053040095,0.00063951797,0.000421232,0.000010619709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047826936,0.001983692,0.017306913,0.00002874774,0.00062724884,0.0000016023695,0.011951926,0.3726137,0.044418957,0.46397737,0.00019210702,0.08684992],"study_design_scores_gemma":[0.00022992752,0.000047644167,0.046762854,0.00005296263,0.00006743178,8.1452777e-7,0.00004187787,0.94286734,0.009063437,0.0004986048,0.00020732982,0.00015978841],"about_ca_topic_score_codex":0.00001799532,"about_ca_topic_score_gemma":0.0003834904,"teacher_disagreement_score":0.5702537,"about_ca_system_score_codex":0.00009848665,"about_ca_system_score_gemma":0.000101905855,"threshold_uncertainty_score":0.62351257},"labels":[],"label_agreement":null},{"id":"W3162124830","doi":"10.1109/tsp.2021.3078093","title":"Joint Power Allocation and Distributed Equalization Design for OFDM-Based Filter-and-Forward Two-Way Multi-Relay Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Ontario Tech University","funders":"","keywords":"Computer science; Subcarrier; Transceiver; Transmitter power output; Orthogonal frequency-division multiplexing; Equalization (audio); Gradient descent; Relay; Upper and lower bounds; Interference (communication); Channel (broadcasting); Power (physics); Electronic engineering; Mathematical optimization; Transmitter; Telecommunications; Mathematics; Wireless; Engineering; Artificial neural network","score_opus":0.07901189679679516,"score_gpt":0.3000180491362714,"score_spread":0.22100615233947624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162124830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054758316,0.0007688643,0.9972802,0.0008407098,0.000105246865,0.0003038541,0.000008298782,0.00013340997,0.000011847716],"genre_scores_gemma":[0.8959506,0.00010356507,0.103302754,0.0004623481,0.000017941074,0.00008399793,0.000017138285,0.00001597837,0.00004568362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986533,0.00024089526,0.00031777035,0.00041006185,0.00015516877,0.00022283198],"domain_scores_gemma":[0.9988273,0.00030085808,0.00011908312,0.0002566167,0.00039363987,0.000102532875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045147404,0.0001796359,0.000184626,0.00010005012,0.00071354513,0.00037417657,0.00017608001,0.00007935768,0.000018901937],"category_scores_gemma":[0.000017624077,0.00018093738,0.000056608544,0.0005006932,0.0000595551,0.00046358322,0.0000073827932,0.00019372437,0.0000013771183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037692127,0.00016221667,0.0000055594783,0.00003613959,0.000026061554,0.0000017487939,0.0005093022,0.7260354,0.009797286,0.00048538254,0.000039154344,0.26286405],"study_design_scores_gemma":[0.0009798802,0.00009043986,0.000071823975,0.00016290386,0.000026914466,0.0000074304853,0.000041455663,0.96450573,0.03368398,0.000079401245,0.00014095819,0.00020908262],"about_ca_topic_score_codex":0.0000012311205,"about_ca_topic_score_gemma":0.000013831245,"teacher_disagreement_score":0.895403,"about_ca_system_score_codex":0.00006253867,"about_ca_system_score_gemma":0.00013856156,"threshold_uncertainty_score":0.73784125},"labels":[],"label_agreement":null},{"id":"W3162584477","doi":"10.82308/41382","title":"Cooperative communication for relay and multiple access channels: Design, optimization and performance analysis","year":2015,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Relay; Computer network; Computer science; Telecommunications; Channel (broadcasting)","score_opus":0.09288077868245724,"score_gpt":0.2898652067419892,"score_spread":0.19698442805953192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162584477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67674226,0.003264688,0.31215513,0.00091086706,0.00037745904,0.0026481762,0.00009512877,0.00062173937,0.0031845793],"genre_scores_gemma":[0.90773207,0.0022585616,0.08935474,0.0003186907,0.00000876271,0.000118449796,0.000043321666,0.000020397303,0.00014498869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791086,0.00065314164,0.0003903088,0.00053861,0.00022368456,0.00028341837],"domain_scores_gemma":[0.9972707,0.0006146956,0.00021310015,0.0008922509,0.00076458,0.00024467596],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016832633,0.00025024917,0.00033015586,0.0002876028,0.0014031007,0.00043668156,0.0010511079,0.00011842991,0.0000061335727],"category_scores_gemma":[0.00064790325,0.00024664143,0.00005725456,0.0012700135,0.00010022047,0.0027601214,0.0010125659,0.00028918372,0.0000042989245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019975302,0.00022964737,0.0019547786,0.000052797222,0.00053768075,0.0000020846062,0.0003229009,0.6665874,0.0011399426,0.09617623,0.000029752011,0.232767],"study_design_scores_gemma":[0.0010917784,0.00018538994,0.00061009533,0.000044146364,0.00008796703,0.000006897505,0.000046420286,0.9895974,0.003951076,0.0007388524,0.0032810082,0.00035901126],"about_ca_topic_score_codex":0.000018377095,"about_ca_topic_score_gemma":0.000094938456,"teacher_disagreement_score":0.3230099,"about_ca_system_score_codex":0.00015729264,"about_ca_system_score_gemma":0.000030587184,"threshold_uncertainty_score":0.99999857},"labels":[],"label_agreement":null},{"id":"W3162659529","doi":"10.1109/tvt.2021.3077877","title":"NC–MAC: A Distributed MAC Protocol for Reliable Beacon Broadcasting in V2X","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer network; Computer science; Broadcasting (networking); Vehicular ad hoc network; Scalability; Wireless ad hoc network; Reliability (semiconductor); Vehicular communication systems; Mobile ad hoc network; Protocol (science); Linear network coding; Telecommunications; Wireless","score_opus":0.03633480859080925,"score_gpt":0.3098131682507191,"score_spread":0.27347835965990985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162659529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014230099,0.000048811587,0.97893625,0.0042410335,0.000114533395,0.014690676,0.000008424587,0.00042355392,0.00011369542],"genre_scores_gemma":[0.7255319,0.000060208957,0.07169937,0.0004808037,0.000026898555,0.20179297,0.000013259509,0.000036318317,0.00035828078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864167,0.000082856466,0.00033735673,0.0004702988,0.00012246166,0.00034535208],"domain_scores_gemma":[0.9986424,0.00010945864,0.00007832385,0.00088610064,0.00023680381,0.00004695686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022099708,0.00016688589,0.00022804005,0.00030562544,0.0003111315,0.00006960584,0.0006623215,0.00021533234,0.000029789611],"category_scores_gemma":[0.000037795588,0.00017777276,0.00009336474,0.001718034,0.00006730236,0.00017237228,0.000019559138,0.00050336076,0.000016834589],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012695482,0.0019708471,0.00024150664,0.00018163216,0.00018293213,0.00018927586,0.0005053353,0.064390376,0.07632129,0.044687714,0.0012999038,0.80990225],"study_design_scores_gemma":[0.003374854,0.0003205735,0.000076179385,0.00035458998,0.000016696695,0.00011685139,0.00010090899,0.48474562,0.4014502,0.0030042203,0.1059232,0.0005161207],"about_ca_topic_score_codex":0.000004576743,"about_ca_topic_score_gemma":0.000115568044,"teacher_disagreement_score":0.9072369,"about_ca_system_score_codex":0.00012943987,"about_ca_system_score_gemma":0.00013348913,"threshold_uncertainty_score":0.7249363},"labels":[],"label_agreement":null},{"id":"W3169848101","doi":"10.3390/electronics10121446","title":"Recent Advances in Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"article","venue":"Electronics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Mobile ad hoc network; Wireless ad hoc network; Computer network; Computer science; Vehicular ad hoc network; Ad hoc wireless distribution service; Adaptive quality of service multi-hop routing; Wireless network; Optimized Link State Routing Protocol; Distributed computing; Wireless; Telecommunications","score_opus":0.01586472429319777,"score_gpt":0.27947766451513106,"score_spread":0.26361294022193327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169848101","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016791243,0.93730104,0.057810012,0.00090856577,0.0001549918,0.00007490031,1.0583446e-7,0.00006241613,0.0020088379],"genre_scores_gemma":[0.018745512,0.97740465,0.0029222525,0.00055946124,0.000026118825,0.000033166973,0.000005434676,0.000005501808,0.00029788143],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907345,0.00013550573,0.0001529513,0.00023703904,0.00009848193,0.00030256296],"domain_scores_gemma":[0.9992118,0.00007330308,0.000036806214,0.0005403957,0.000097837066,0.00003988133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020133768,0.000080800935,0.00010775633,0.000033408873,0.000088507295,0.00007212325,0.00050775864,0.000035527337,0.000053705382],"category_scores_gemma":[0.000027933587,0.00008427184,0.000027028576,0.00081092486,0.00001335157,0.0002870512,0.000251663,0.00028074137,0.0000142866],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017492564,0.000035375153,0.000044016,8.7916453e-7,0.0000021636154,0.0000046682685,0.000114350114,0.0024213865,0.0000745705,0.00916182,0.00028132595,0.9878577],"study_design_scores_gemma":[0.00015901901,0.00004694074,0.000093469665,0.0000131492125,7.424266e-7,0.0000062884483,0.0000114276245,0.029928897,0.0004986083,0.00064456963,0.9684971,0.00009981005],"about_ca_topic_score_codex":8.032935e-9,"about_ca_topic_score_gemma":0.00033867123,"teacher_disagreement_score":0.98775786,"about_ca_system_score_codex":0.00012672413,"about_ca_system_score_gemma":0.00017613092,"threshold_uncertainty_score":0.34365058},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W3170235714","doi":"10.1016/j.comcom.2021.06.007","title":"Performance analysis of short-packet communications with incremental relaying","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Network packet; Block Error Rate; Transmission delay; Transmission (telecommunications); Overhead (engineering); Decoding methods; Bit error rate; Computer network; Error detection and correction; Latency (audio); Low latency (capital markets); Communications system; Reliability (semiconductor); Channel (broadcasting); Real-time computing; Algorithm; Telecommunications; Telecommunications link","score_opus":0.08210720691182105,"score_gpt":0.3100196420611545,"score_spread":0.22791243514933346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170235714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07970857,0.0041798213,0.891182,0.0065296297,0.000111955604,0.00033083567,0.000019076317,0.00033072257,0.017607378],"genre_scores_gemma":[0.69362485,0.004043929,0.30175793,0.0003024973,0.000009624941,0.00003441728,0.00016868723,0.000009434742,0.000048646074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998021,0.0005762975,0.0005541225,0.00033856777,0.00027570606,0.00023429208],"domain_scores_gemma":[0.98819333,0.00051275105,0.00018679498,0.010280485,0.0007249768,0.00010164356],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00042672644,0.00018753776,0.00039443158,0.00036778944,0.0007729885,0.00015764541,0.0061094016,0.000055505967,0.000025384506],"category_scores_gemma":[0.000018305565,0.00018641565,0.00015715133,0.004062468,0.00033779154,0.00055474625,0.00580424,0.00037242335,0.00001174182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018008668,0.0020378926,0.12927102,0.00005635278,0.004454793,0.000007887222,0.008705623,0.0059186458,0.005784155,0.33389932,0.001634995,0.5082113],"study_design_scores_gemma":[0.00023392914,0.00005935718,0.04362516,0.00008660715,0.00024758268,0.00001646666,0.000086454515,0.94613993,0.0007023699,0.000038383227,0.008499822,0.00026392523],"about_ca_topic_score_codex":0.000008362817,"about_ca_topic_score_gemma":0.00034199303,"teacher_disagreement_score":0.9402213,"about_ca_system_score_codex":0.000084088766,"about_ca_system_score_gemma":0.00018803972,"threshold_uncertainty_score":0.999268},"labels":[],"label_agreement":null},{"id":"W3174398650","doi":"10.1109/itw46852.2021.9457616","title":"Sliding-Window Gelfand–Pinsker Coding: General K-User Broadcast Channels","year":2021,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Research and Development","keywords":"Computer science; Linear network coding; Dirty paper coding; Decoding methods; Coding (social sciences); Computer network; Multiple description coding; MIMO; Encoder; Algorithm; Sliding window protocol; Theoretical computer science; Channel (broadcasting); Precoding; Mathematics; Window (computing); Network packet","score_opus":0.044299343267852946,"score_gpt":0.2804698484999831,"score_spread":0.23617050523213012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174398650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014846005,0.0017682643,0.90898347,0.013625111,0.001352977,0.00017613887,0.000001331192,0.00047502606,0.05877166],"genre_scores_gemma":[0.91847605,0.0014813228,0.038639314,0.0057464535,0.00028314983,0.000024714256,0.0000122864585,0.0000187593,0.03531795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985967,0.00016966948,0.00024584288,0.0004271922,0.00022513146,0.00033544615],"domain_scores_gemma":[0.9984451,0.00008383848,0.000054735465,0.0009944848,0.00027821807,0.00014360304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025035336,0.0001659041,0.00018940812,0.00007307337,0.00034642403,0.0004696568,0.0009289023,0.000061122526,0.00053070957],"category_scores_gemma":[0.000059298025,0.00015375462,0.000094946285,0.000643519,0.000024578614,0.00045751248,0.0009615362,0.00019302871,0.000206062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032021105,0.00011584251,0.0007247704,0.0000061963924,0.000041795316,0.000047568978,0.00091097713,0.00033347856,0.017326906,0.8994074,0.02445792,0.056623966],"study_design_scores_gemma":[0.0010784448,0.0000554631,0.0023831741,0.000059785532,0.000008835323,0.000117057585,0.00007731983,0.1668771,0.069671564,0.0008216562,0.75816226,0.0006873091],"about_ca_topic_score_codex":0.0000040204695,"about_ca_topic_score_gemma":0.000017660552,"teacher_disagreement_score":0.90363,"about_ca_system_score_codex":0.00004691192,"about_ca_system_score_gemma":0.000105031424,"threshold_uncertainty_score":0.6269931},"labels":[],"label_agreement":null},{"id":"W3175100006","doi":"10.1109/comst.2021.3091684","title":"A Comprehensive Survey on Coded Distributed Computing: Fundamentals, Challenges, and Networking Applications","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Singapore University of Technology and Design; Energy Market Authority of Singapore","keywords":"Computer science; Scalability; Distributed computing; Computation; Fault tolerance; Computer network; Coding (social sciences)","score_opus":0.18117526013968077,"score_gpt":0.3460314451071763,"score_spread":0.16485618496749554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175100006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007979111,0.11545726,0.85584974,0.0085229715,0.003790592,0.0020835393,0.00043102956,0.0011225417,0.0047632228],"genre_scores_gemma":[0.9227774,0.06683316,0.008336321,0.0004700442,0.0003386959,0.00014106737,0.0009676536,0.000033497814,0.00010214128],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9893082,0.00846666,0.00074703764,0.0007101334,0.00034149556,0.00042649315],"domain_scores_gemma":[0.98769814,0.005704559,0.00034787433,0.0049808896,0.0010578531,0.00021068745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035102612,0.00033902327,0.0005620536,0.00012335643,0.0012440702,0.00042705663,0.0026632054,0.00014318085,0.000009557151],"category_scores_gemma":[0.0002037255,0.0003776707,0.000095783565,0.0010967447,0.00032081048,0.00027197902,0.001941989,0.00049099524,0.000053108462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002652948,0.0016889432,0.003236068,0.00006381854,0.00046275003,0.000010999497,0.003177311,0.0005404539,0.0042978465,0.16744012,0.0072578727,0.81179726],"study_design_scores_gemma":[0.0017569083,0.00012254633,0.20722982,0.00026093336,0.00003943018,0.00003732035,0.0002557588,0.022749988,0.0008460699,0.0022294312,0.76329,0.0011817802],"about_ca_topic_score_codex":0.00006321146,"about_ca_topic_score_gemma":0.00086241,"teacher_disagreement_score":0.9147983,"about_ca_system_score_codex":0.00016226593,"about_ca_system_score_gemma":0.00021341351,"threshold_uncertainty_score":0.9998675},"labels":[],"label_agreement":null},{"id":"W3176534971","doi":"10.1109/access.2021.3090965","title":"cDERSA: Cognitive D2D Enabled Relay Selection Algorithm to Mitigate Blind-Spots in 5G Cellular Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Umm Al-Qura University","keywords":"Relay; Computer science; Cognitive radio; Computer network; Base station; Throughput; Cellular network; Selection algorithm; Blind spot; Wireless; Selection (genetic algorithm); Telecommunications; Artificial intelligence","score_opus":0.044190714143861,"score_gpt":0.315745996433372,"score_spread":0.271555282289511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176534971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08203483,0.0006903789,0.9137222,0.0010658845,0.00070916547,0.00030822473,0.0000012860594,0.0001231551,0.0013448509],"genre_scores_gemma":[0.99188316,0.0004067712,0.0050826618,0.0017042162,0.00018858677,0.0000828627,0.000015351508,0.000016456655,0.00061990536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998145,0.00039293637,0.00031456669,0.0005380275,0.00021372654,0.0003957673],"domain_scores_gemma":[0.99861753,0.0002383626,0.00008622851,0.00045421746,0.00045707394,0.00014656795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004215962,0.00017827768,0.00022529837,0.00018658348,0.00024925268,0.0005287399,0.0009851967,0.000101984406,0.000059761354],"category_scores_gemma":[0.00006771788,0.00019497839,0.000058397407,0.0025145093,0.000027650003,0.00084486866,0.00040870602,0.00039965785,0.00004940593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054203523,0.0003624475,0.0029866695,0.000017490933,0.00008466419,0.00028206513,0.0024640304,0.0557105,0.00554576,0.0012759931,0.0042097317,0.9270064],"study_design_scores_gemma":[0.0012545518,0.000046559526,0.004947645,0.00020543532,0.00001259145,0.000018032368,0.00006122344,0.9303287,0.059366103,0.00020318545,0.0031266015,0.00042934573],"about_ca_topic_score_codex":0.000035078265,"about_ca_topic_score_gemma":0.00043780505,"teacher_disagreement_score":0.9265771,"about_ca_system_score_codex":0.000102404454,"about_ca_system_score_gemma":0.0001413912,"threshold_uncertainty_score":0.7950988},"labels":[],"label_agreement":null},{"id":"W3183178228","doi":"10.1109/tvt.2021.3098275","title":"Transmission Schemes and Power Allocation for Multiuser Massive MIMO Relaying","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; Trường Đại Học Thủ Dầu Một; Department for the Economy; UK Research and Innovation","keywords":"Relay; Transmission (telecommunications); Overhead (engineering); Computer science; MIMO; Spectral efficiency; Computer network; Channel (broadcasting); Transmitter power output; Channel state information; Node (physics); Relay channel; Power (physics); Electronic engineering; Wireless; Telecommunications; Engineering; Transmitter","score_opus":0.020134155579788683,"score_gpt":0.26691562858030815,"score_spread":0.24678147300051947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183178228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018336624,0.0011058546,0.96785164,0.011983279,0.00014459332,0.00022882954,0.0000017320917,0.000285299,0.00006217012],"genre_scores_gemma":[0.9098193,0.0010065213,0.08852266,0.00031611434,0.000005354568,0.00011989744,0.0000021929384,0.000012331534,0.00019563189],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907386,0.000062658466,0.00018943568,0.00038758892,0.0000981033,0.00018835663],"domain_scores_gemma":[0.998999,0.000099745856,0.00004689117,0.00057077163,0.00023304322,0.00005052381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011971541,0.00013211185,0.0001495645,0.00021092851,0.0004043672,0.000055871413,0.00032093577,0.00019383844,0.000018909563],"category_scores_gemma":[0.000016169864,0.0001327923,0.00007035834,0.00057292875,0.000071993825,0.00019571489,0.000008121311,0.00028087216,0.000007745451],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019031671,0.0002463407,0.000016284233,0.000023664747,0.000089235335,0.000015104348,0.00052964303,0.0028953922,0.23439097,0.03976651,0.000106572086,0.72190124],"study_design_scores_gemma":[0.0012041095,0.00017438599,0.000046480716,0.0001218896,0.000030007466,0.00005805708,0.00017960594,0.20881756,0.7289334,0.0015835459,0.05850993,0.0003410482],"about_ca_topic_score_codex":5.869476e-7,"about_ca_topic_score_gemma":0.0000075242087,"teacher_disagreement_score":0.89148265,"about_ca_system_score_codex":0.00003976565,"about_ca_system_score_gemma":0.00006353989,"threshold_uncertainty_score":0.54151124},"labels":[],"label_agreement":null},{"id":"W3183286299","doi":"10.1109/tit.2021.3100781","title":"Two-Way Source-Channel Coding","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossy compression; Channel code; Computer science; Coding (social sciences); Channel (broadcasting); Distributed source coding; Exploit; Decoding methods; Algorithm; Source code; Theoretical computer science; Computer network; Mathematics; Statistics","score_opus":0.022539314999622067,"score_gpt":0.25231251251290154,"score_spread":0.2297731975132795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183286299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040076138,0.00005681452,0.9814476,0.00063919404,0.0006319789,0.00009066232,0.0000038587486,0.00027739833,0.016451726],"genre_scores_gemma":[0.9919742,0.0002849105,0.004147955,0.00232984,0.000024921304,0.000034150216,0.00000591849,0.000006371091,0.001191761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897265,0.00021851178,0.00030373465,0.00012854557,0.00019785143,0.00017872528],"domain_scores_gemma":[0.99873763,0.00024874182,0.00008545275,0.0006173917,0.00023178275,0.00007898616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046229674,0.00012107564,0.00011036129,0.00017345288,0.0005248795,0.00025952645,0.00043940038,0.00004644396,0.00024104833],"category_scores_gemma":[0.000018891795,0.00012369786,0.000089875255,0.00054440903,0.000037809943,0.0017268296,0.000009413628,0.00025539295,0.00049733545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018524492,0.00007748023,6.180939e-7,0.000012842836,0.000040993957,0.000001556351,0.006193768,0.05211335,0.00051892403,0.32661128,0.00045122448,0.61395943],"study_design_scores_gemma":[0.002668616,0.00013688693,0.00007327699,0.00021574499,0.00003722766,0.00015223118,0.002813407,0.73602134,0.17404473,0.017335616,0.06547175,0.0010291508],"about_ca_topic_score_codex":0.0000010903382,"about_ca_topic_score_gemma":0.0000059912095,"teacher_disagreement_score":0.9915734,"about_ca_system_score_codex":0.000064330365,"about_ca_system_score_gemma":0.00007433733,"threshold_uncertainty_score":0.6392407},"labels":[],"label_agreement":null},{"id":"W3188167219","doi":"10.1109/icc42927.2021.9500475","title":"Underlay Cognitive Network-Coded Cooperation over Nakagami-m Fading Channels","year":2021,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Fading; Linear network coding; Transmitter; Underlay; Cognitive radio; Computer science; Relay; Topology (electrical circuits); Computer network; Interference (communication); Telecommunications; Decoding methods; Signal-to-noise ratio (imaging); Mathematics; Power (physics); Channel (broadcasting); Wireless; Physics; Combinatorics","score_opus":0.04795897133878955,"score_gpt":0.2952322474164109,"score_spread":0.24727327607762137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188167219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008804585,0.00092448754,0.95886844,0.0016558496,0.0006004958,0.00015472526,7.8053904e-7,0.00025706124,0.028733542],"genre_scores_gemma":[0.9822497,0.0005514192,0.008367783,0.003798636,0.00021857668,0.000016734235,0.000021900447,0.000011334061,0.0047639105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986034,0.0002694594,0.0002407557,0.0003962043,0.00018276378,0.00030741742],"domain_scores_gemma":[0.9986398,0.00027760994,0.00006048156,0.0004977671,0.0004302181,0.00009412139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030000927,0.00015158008,0.00017229228,0.00004748316,0.0004274965,0.00044654752,0.0004464806,0.000061648425,0.0004896206],"category_scores_gemma":[0.00010012536,0.00014710838,0.00006205123,0.0008735203,0.000033548204,0.0006089775,0.00053609157,0.00018235036,0.00013979842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011058648,0.00015764675,0.0004081838,0.000009804343,0.00011325686,0.000047345686,0.0028827505,0.010866702,0.005017424,0.8622082,0.013762748,0.1045149],"study_design_scores_gemma":[0.0012867269,0.00007154012,0.0017696555,0.00018481618,0.000017656426,0.000041678948,0.00017741726,0.96251434,0.012771636,0.002347831,0.018164415,0.00065226614],"about_ca_topic_score_codex":0.0000026776686,"about_ca_topic_score_gemma":0.00008437036,"teacher_disagreement_score":0.9734451,"about_ca_system_score_codex":0.00005094336,"about_ca_system_score_gemma":0.00012618989,"threshold_uncertainty_score":0.5998906},"labels":[],"label_agreement":null},{"id":"W3189399213","doi":"10.1109/jsait.2021.3102853","title":"Sequential Gradient Coding for Packet-Loss Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Notation; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Arithmetic","score_opus":0.024068254098254048,"score_gpt":0.2722622865215812,"score_spread":0.24819403242332713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189399213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015758485,0.0001866742,0.9797641,0.0007066203,0.001311243,0.00017718514,0.0000026732712,0.000079617814,0.0020133937],"genre_scores_gemma":[0.9927566,0.0010557674,0.0038904527,0.0019059483,0.00023308973,0.000026921844,0.000027617652,0.000008349267,0.0000952379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982615,0.00045932754,0.00059060624,0.00012509373,0.00024304226,0.00032039743],"domain_scores_gemma":[0.99791616,0.00047788682,0.00029553633,0.000343211,0.00085145223,0.00011577125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013562344,0.00014686293,0.0001806087,0.00027034924,0.000430147,0.000504415,0.0005856784,0.00007965216,0.00004336553],"category_scores_gemma":[0.00039937824,0.00013730265,0.00008976788,0.000960119,0.00003097496,0.0015086572,0.000079229016,0.0005248928,0.000018685632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016345932,0.00011751724,0.0002236098,0.00001655118,0.00007056977,0.000022498341,0.0032796361,0.031438857,0.00030830686,0.7831456,0.004819007,0.17639439],"study_design_scores_gemma":[0.0049501145,0.00040460963,0.0038086234,0.0007218082,0.000027941884,0.0011996633,0.00047850228,0.8727567,0.012582971,0.0409057,0.061174497,0.0009888682],"about_ca_topic_score_codex":2.5863264e-7,"about_ca_topic_score_gemma":0.0000067830033,"teacher_disagreement_score":0.97699815,"about_ca_system_score_codex":0.00023020532,"about_ca_system_score_gemma":0.00023404972,"threshold_uncertainty_score":0.5599039},"labels":[],"label_agreement":null},{"id":"W3193529446","doi":"10.1109/jsait.2021.3104970","title":"Coded Sequential Matrix Multiplication for Straggler Mitigation","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Notation; Mathematics; Computer science; Arithmetic","score_opus":0.022187923574703377,"score_gpt":0.2947377955343279,"score_spread":0.2725498719596245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193529446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039010324,0.00010242889,0.95786566,0.00095525803,0.00056062115,0.00027768943,0.00000674406,0.000091722235,0.0011295852],"genre_scores_gemma":[0.98141354,0.0003177818,0.016785853,0.0010284042,0.00014596857,0.000051020263,0.00008499564,0.000008127119,0.00016430032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984286,0.00039303536,0.0005894301,0.00012386875,0.00025634526,0.00020870999],"domain_scores_gemma":[0.9976763,0.00036513832,0.0003359089,0.00033963975,0.0012006615,0.00008232393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009751496,0.00012553956,0.00014023515,0.00028138096,0.0003076207,0.00041203032,0.00045445593,0.00008390554,0.00004825911],"category_scores_gemma":[0.00047510787,0.00012291924,0.00006903205,0.0008110151,0.000022302664,0.0019296104,0.000040460553,0.00035161775,0.0000431819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030999977,0.00022547232,0.00017268458,0.000036466045,0.000078192934,0.0000057377374,0.005705968,0.01980561,0.01711701,0.68531907,0.004511812,0.266712],"study_design_scores_gemma":[0.0078269765,0.00038466495,0.011441082,0.00055628817,0.00003454004,0.0005835732,0.00072203774,0.7019239,0.16329958,0.066573925,0.045570225,0.0010832311],"about_ca_topic_score_codex":3.178863e-7,"about_ca_topic_score_gemma":0.0000063305324,"teacher_disagreement_score":0.9424032,"about_ca_system_score_codex":0.00020663207,"about_ca_system_score_gemma":0.00028953227,"threshold_uncertainty_score":0.5012501},"labels":[],"label_agreement":null},{"id":"W3194292052","doi":"10.1109/iwcmc51323.2021.9498812","title":"An Efficient Downlink-QoS Aware Scheduling Approach for Adopting Wyner-Ziv Code","year":2021,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computer network; Quality of service; Telecommunications link; Network packet; Scheduling (production processes); Coding (social sciences); Traffic classification; Real-time computing","score_opus":0.065558397922746,"score_gpt":0.316497234465339,"score_spread":0.250938836542593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194292052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007966577,0.00040638476,0.98723626,0.0006360166,0.00018869822,0.00021598964,0.0000026002522,0.0002767065,0.0030707854],"genre_scores_gemma":[0.4889337,0.000034628283,0.5101735,0.00048701957,0.0000963078,0.000032695265,0.00003260407,0.000008014351,0.00020149675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986266,0.00014180808,0.00026110362,0.00049515563,0.00017398044,0.00030133978],"domain_scores_gemma":[0.99820065,0.00016178445,0.00006780021,0.0010430656,0.00040247437,0.00012422133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052472384,0.00013992461,0.00016749077,0.00005577718,0.00049489154,0.0003567549,0.0009710061,0.00005793574,0.000026695],"category_scores_gemma":[0.000088644825,0.00012990426,0.000081577804,0.00049997756,0.000026083424,0.00021770647,0.0004458046,0.00017034734,0.000009409336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011684206,0.0008030581,0.00054553855,0.00007211474,0.000053311007,0.000007528884,0.0030662238,0.5373689,0.00931888,0.26925966,0.00060126366,0.17889184],"study_design_scores_gemma":[0.00031405277,0.000028972669,0.000103012404,0.000021043137,0.000004219342,0.0000052143355,0.00035789658,0.9913742,0.0031821732,0.000027778126,0.0043867454,0.00019467411],"about_ca_topic_score_codex":0.000001270133,"about_ca_topic_score_gemma":0.000013268298,"teacher_disagreement_score":0.48096713,"about_ca_system_score_codex":0.000045640663,"about_ca_system_score_gemma":0.00012540072,"threshold_uncertainty_score":0.5297342},"labels":[],"label_agreement":null},{"id":"W3194645875","doi":"10.1109/tit.2021.3104847","title":"Uplink-Downlink Duality Between Multiple-Access and Broadcast Channels With Compressing Relays","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Hong Kong Polytechnic University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Telecommunications link; Relay; Computer science; Duality (order theory); Beamforming; Channel (broadcasting); Computer network; Mathematical optimization; Mathematics; Power (physics); Telecommunications; Discrete mathematics","score_opus":0.0421963491770048,"score_gpt":0.28397457090203526,"score_spread":0.24177822172503047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194645875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009035875,0.00007371909,0.98808295,0.00068593264,0.00023048808,0.00020428578,0.000012481079,0.00018471241,0.0014895548],"genre_scores_gemma":[0.9923896,0.0002336552,0.0064865532,0.0006877667,0.000027488733,0.0000433494,0.000016772721,0.0000066233547,0.00010815653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988643,0.00024745578,0.0003426481,0.00018164935,0.00018682114,0.0001771268],"domain_scores_gemma":[0.998526,0.00043175477,0.00011363571,0.0005776992,0.00025257855,0.00009837901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044888747,0.00015117927,0.00016961723,0.00014254615,0.0006380094,0.00060747593,0.0004297296,0.00006800026,0.000041518135],"category_scores_gemma":[0.000015566786,0.00013657084,0.00004333595,0.00047503054,0.00009157486,0.002940784,0.000022103477,0.00032310843,0.000030566396],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006550726,0.00009033736,0.00017454242,0.000055567238,0.000096439595,0.000002842406,0.0070067015,0.040540077,0.00015784228,0.021992788,0.00008502589,0.9297323],"study_design_scores_gemma":[0.0057628243,0.00034878138,0.006300436,0.00083888764,0.00011945159,0.00023010607,0.0012596875,0.8633127,0.091880724,0.0060528796,0.02212939,0.001764082],"about_ca_topic_score_codex":0.0000031628656,"about_ca_topic_score_gemma":0.000007419133,"teacher_disagreement_score":0.98335373,"about_ca_system_score_codex":0.000041693347,"about_ca_system_score_gemma":0.0000744042,"threshold_uncertainty_score":0.5857904},"labels":[],"label_agreement":null},{"id":"W3196404297","doi":"10.1109/isit45174.2021.9518192","title":"Streaming Erasure Codes over Multi-Access Relay Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Computer network; Concatenation (mathematics); Node (physics); Erasure; Online codes; Latency (audio); Set (abstract data type); Erasure code; Decoding methods; Distributed computing; Algorithm; Block code; Telecommunications; Linear code; Mathematics","score_opus":0.06163306429325758,"score_gpt":0.32690387306284596,"score_spread":0.26527080876958836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196404297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065035853,0.0014722886,0.98373604,0.00088558724,0.00030453037,0.00006190649,4.0548102e-7,0.000206008,0.0068296646],"genre_scores_gemma":[0.9505415,0.0013223947,0.04269483,0.001586143,0.000064922264,0.000009347362,0.0000071425798,0.000008544753,0.0037652068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990182,0.00016322496,0.00017859983,0.0003011222,0.0001317647,0.00020707655],"domain_scores_gemma":[0.99874884,0.00015274572,0.000046802405,0.00081366865,0.00016158831,0.000076367076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019210554,0.00011061614,0.00013053339,0.00003365146,0.0002469467,0.00049564766,0.0009601065,0.00005211639,0.0002516343],"category_scores_gemma":[0.000052964417,0.000100299665,0.000051982508,0.0005681761,0.000024210747,0.0005738911,0.0010310473,0.00019688696,0.000016819939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064427295,0.00042610307,0.033310253,0.000016322689,0.00012951164,0.000112618756,0.0012506444,0.03257791,0.0041127293,0.32591823,0.02180189,0.58033735],"study_design_scores_gemma":[0.0003212846,0.000007935734,0.02172071,0.00003714129,0.0000032134417,0.000009464995,0.000019997562,0.96380293,0.001619481,0.000046742985,0.012213606,0.00019750907],"about_ca_topic_score_codex":0.000008072088,"about_ca_topic_score_gemma":0.00039029407,"teacher_disagreement_score":0.94403785,"about_ca_system_score_codex":0.000030395046,"about_ca_system_score_gemma":0.00006298713,"threshold_uncertainty_score":0.47795418},"labels":[],"label_agreement":null},{"id":"W3196469641","doi":"10.1109/isit45174.2021.9518259","title":"A Discretization Approach to Compute–Forward","year":2021,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computation; Decoding methods; Discretization; Gaussian; Code word; Lattice (music); Mathematics; Algorithm; Integer (computer science); Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.03761215477815599,"score_gpt":0.2724564763656427,"score_spread":0.2348443215874867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196469641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028260367,0.00009254837,0.8816221,0.0035138717,0.00007458521,0.00006318557,1.6022437e-7,0.00012627171,0.11422467],"genre_scores_gemma":[0.5003302,0.00007117519,0.49334365,0.0032909205,0.000036880843,0.000013123218,0.000010905557,0.00000426162,0.0028988502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993561,0.000082474806,0.00010877972,0.00022332731,0.00011625584,0.000113097914],"domain_scores_gemma":[0.99913543,0.00003134856,0.000015611542,0.0005845093,0.0001518937,0.00008121373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113838985,0.0000596643,0.000076176664,0.000037448066,0.00013633804,0.00018890921,0.0005306236,0.00001749187,0.000033024517],"category_scores_gemma":[0.00003067375,0.00005361469,0.000027630167,0.00073622976,0.000007914614,0.00017348124,0.00062440103,0.000054887354,0.00008613703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.786204e-7,0.00006131751,0.00008882119,0.000002154169,0.000005543101,9.736519e-7,0.00075332826,0.001083812,0.00046173588,0.91924304,0.008008965,0.07028983],"study_design_scores_gemma":[0.00020391977,0.000020929067,0.0021385027,0.000014490295,0.0000020885495,0.000017001745,0.00006886932,0.8531972,0.002637174,0.0010192269,0.14045174,0.00022883216],"about_ca_topic_score_codex":8.9970445e-7,"about_ca_topic_score_gemma":0.000007117989,"teacher_disagreement_score":0.9182238,"about_ca_system_score_codex":0.000019250565,"about_ca_system_score_gemma":0.00004395283,"threshold_uncertainty_score":0.21863437},"labels":[],"label_agreement":null},{"id":"W3198286429","doi":"10.1109/isit45174.2021.9518179","title":"Explicit Rate-Optimal Streaming Codes with Smaller Field Size","year":2021,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Code (set theory); Network packet; Field (mathematics); Decoding methods; Algorithm; Mathematics; Programming language; Computer network","score_opus":0.02947490748676253,"score_gpt":0.2613142048392815,"score_spread":0.23183929735251899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198286429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07420652,0.00037292877,0.866511,0.006628123,0.00008714544,0.000089185996,2.4366093e-7,0.00020287167,0.051901996],"genre_scores_gemma":[0.90053475,0.0002662148,0.09058017,0.0020820445,0.000029047556,0.000013641771,0.0000012791716,0.0000051534685,0.0064876955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999276,0.00010663091,0.00012796232,0.0002327246,0.000098901066,0.00015782323],"domain_scores_gemma":[0.99855775,0.0005946175,0.000031749423,0.0006028014,0.00015690216,0.000056172936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014164818,0.00009382642,0.00013577077,0.000018901514,0.00015835545,0.00020546601,0.000456825,0.000027063967,0.00050499267],"category_scores_gemma":[0.00008926027,0.0000709498,0.00003318469,0.0003038733,0.000011812158,0.00023601153,0.00036710003,0.00011528825,0.000028263205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006761814,0.00030829664,0.0035188629,0.000020649697,0.00018948181,0.00024472966,0.0039177067,0.0018310765,0.024616515,0.6809466,0.0129363425,0.27140212],"study_design_scores_gemma":[0.004580427,0.0007231615,0.014537502,0.00040976104,0.00004228088,0.0002696452,0.0024973748,0.4501657,0.4131694,0.0008949918,0.11061697,0.0020927638],"about_ca_topic_score_codex":0.000005029241,"about_ca_topic_score_gemma":0.000113716305,"teacher_disagreement_score":0.8263282,"about_ca_system_score_codex":0.000013070708,"about_ca_system_score_gemma":0.00007616311,"threshold_uncertainty_score":0.55293155},"labels":[],"label_agreement":null},{"id":"W3201900618","doi":"10.32920/ryerson.14657154.v1","title":"Improving the Energy Efficiency by Cooperative Transmission in Multi-Hop Wireless Ad-Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Exploit; Mobile ad hoc network; Quality of service; Network packet; Physical layer; Vehicular ad hoc network; Hop (telecommunications); Distributed computing; Wireless; Telecommunications","score_opus":0.029058863512355464,"score_gpt":0.2699700187757163,"score_spread":0.24091115526336085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201900618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031827912,0.034289263,0.9595761,0.0015056378,0.0004706125,0.00035393232,0.0000015220596,0.00017539835,0.00044474212],"genre_scores_gemma":[0.9473861,0.034912135,0.014742394,0.0014920075,0.000044808778,0.00017878792,0.00006133807,0.00003323816,0.00114919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653417,0.0009977575,0.00063176843,0.0010255901,0.00032199424,0.00048873015],"domain_scores_gemma":[0.9972155,0.0003874229,0.00020697122,0.0017296821,0.00032680022,0.00013363427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007598727,0.00044717616,0.00047205083,0.000111438785,0.0004733858,0.0008355622,0.0032599138,0.00031836564,0.00007102877],"category_scores_gemma":[0.00004071536,0.00032024542,0.00016089826,0.0009099125,0.000115558825,0.0002759924,0.0033227922,0.0013449537,0.000002571027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010139385,0.00032009563,0.000018913614,0.000019546353,0.000032810785,0.000013942672,0.004272588,0.0347299,0.0043436387,0.0049474114,0.0010223071,0.9502687],"study_design_scores_gemma":[0.00042784578,0.00003079657,0.000057415014,0.00024674553,0.0000065137397,0.0000033225015,0.00020654425,0.99294955,0.0019600114,0.000010691556,0.0036699304,0.0004306424],"about_ca_topic_score_codex":0.00013851124,"about_ca_topic_score_gemma":0.00085585954,"teacher_disagreement_score":0.95821965,"about_ca_system_score_codex":0.00016524085,"about_ca_system_score_gemma":0.0003859929,"threshold_uncertainty_score":0.99992496},"labels":[],"label_agreement":null},{"id":"W3202377376","doi":"10.1109/tit.2022.3197592","title":"A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"European Regional Development Fund; National Research Foundation of Korea; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Decoding methods; Discretization; Gaussian; Algorithm; Mathematics; Lattice (music); Discrete mathematics; Theoretical computer science; Computer science","score_opus":0.013801175014339485,"score_gpt":0.23428728378413494,"score_spread":0.22048610876979546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202377376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016385854,0.000009803011,0.9880997,0.0015449586,0.00059088995,0.00063449226,0.00008361128,0.00031304502,0.007084909],"genre_scores_gemma":[0.9689125,0.000012609255,0.023674669,0.0065378645,0.000023841838,0.00037866065,0.000079197955,0.0000111357585,0.00036956053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982709,0.00041341613,0.0004341108,0.00024199359,0.00041348563,0.00022603599],"domain_scores_gemma":[0.99858886,0.00017877933,0.000116030285,0.00080169423,0.00013711325,0.00017752527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059993326,0.00017805805,0.00018478613,0.00043015878,0.0010288605,0.00028026683,0.0011070485,0.000037886086,0.00014098475],"category_scores_gemma":[0.000014341486,0.0001829949,0.00008270343,0.0012236243,0.000025158864,0.0011054035,0.000054631153,0.00031850408,0.00022379452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015088699,0.00016012034,0.0000025212612,0.0000063550306,0.00005111373,3.8951654e-7,0.025232594,0.5976441,0.00022232071,0.14498493,0.0019060657,0.22963859],"study_design_scores_gemma":[0.0020404162,0.000734921,0.00037301713,0.00006696868,0.000042859276,0.000019050063,0.0031043335,0.807835,0.005988951,0.0062560253,0.17224409,0.0012943678],"about_ca_topic_score_codex":0.00001208474,"about_ca_topic_score_gemma":0.0000056129907,"teacher_disagreement_score":0.9672739,"about_ca_system_score_codex":0.00017838605,"about_ca_system_score_gemma":0.000068901216,"threshold_uncertainty_score":0.79132664},"labels":[],"label_agreement":null},{"id":"W3203778341","doi":"10.52953/nbqh9604","title":"On the evolution of infrastructure sharing in mobile networks: A survey","year":2020,"lang":"en","type":"article","venue":"ITU Journal on Future and Evolving Technologies","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scope (computer science); Relation (database); Key (lock); Virtualization; Context (archaeology); Shared resource; Telecommunications; Business; Computer security; Cloud computing; Geography","score_opus":0.023163260671146255,"score_gpt":0.2476785530381432,"score_spread":0.22451529236699697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203778341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77011615,0.037483852,0.1505499,0.039311644,0.0007239091,0.00046906294,0.0000027557935,0.00059828284,0.00074443454],"genre_scores_gemma":[0.99486333,0.0038624639,0.0009062882,0.00029765035,0.000057273734,0.000005128281,3.2312707e-7,0.0000041815906,0.0000033618187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992179,0.00011039818,0.00021475603,0.00017331226,0.0001335837,0.00015001865],"domain_scores_gemma":[0.9991368,0.00025815598,0.00013852102,0.00035675964,0.000083648796,0.000026084746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051513,0.000107937565,0.00015479696,0.000120749304,0.00020990851,0.00013425734,0.0011206195,0.000096217365,0.0000069040293],"category_scores_gemma":[0.00041086064,0.000067344474,0.000032683634,0.0007157228,0.000061024184,0.00019235138,0.00047639056,0.00078766875,0.0000011075875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013265102,0.00010304449,0.07119068,0.000027300768,0.00007860194,0.000029704714,0.0034959526,0.06024242,0.0009882372,0.4499368,0.025489192,0.38828543],"study_design_scores_gemma":[0.000967225,0.0013623028,0.24225329,0.00074657495,0.000009511672,0.0000662685,0.0044876793,0.7033969,0.0005653485,0.038987547,0.0065928525,0.00056450797],"about_ca_topic_score_codex":0.0000020937164,"about_ca_topic_score_gemma":0.000022513896,"teacher_disagreement_score":0.6431545,"about_ca_system_score_codex":0.000066660075,"about_ca_system_score_gemma":0.000027735467,"threshold_uncertainty_score":0.34220725},"labels":[],"label_agreement":null},{"id":"W3209008413","doi":"","title":"Evacuating from ℓp\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\ell _p$$\\end{document} Unit Disks in the Wireless Model - (Extended Abstract).","year":2021,"lang":"en","type":"article","venue":"Algorithmic Aspects of Wireless Sensor Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Physics; Unit (ring theory); Mathematics","score_opus":0.026568079110956298,"score_gpt":0.2810088585052077,"score_spread":0.25444077939425136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209008413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.525779,0.02950658,0.33445978,0.03381653,0.008534284,0.014308654,0.0016162754,0.0057605268,0.046218332],"genre_scores_gemma":[0.93933,0.021191297,0.02514429,0.0052573006,0.0022584107,0.00086588884,0.0015762448,0.0010293606,0.0033472052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96695745,0.005509798,0.0076288236,0.0069920733,0.0061385273,0.006773317],"domain_scores_gemma":[0.9704779,0.0069616255,0.004887015,0.012757723,0.002785276,0.0021304742],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0070104254,0.0052035865,0.0059570265,0.0018777307,0.0029682308,0.004060623,0.013264047,0.0024913247,0.0015906481],"category_scores_gemma":[0.0013050605,0.0050628493,0.002538438,0.007867672,0.0020292932,0.0064428174,0.0055916826,0.007420967,0.0007149044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002005347,0.014199593,0.0037757768,0.0022501217,0.009954889,0.014052495,0.06796477,0.09459809,0.06734224,0.3561646,0.04581431,0.32187778],"study_design_scores_gemma":[0.017874144,0.0012819708,0.011787329,0.0053353086,0.0016697546,0.00084743445,0.0107101165,0.8705695,0.025150716,0.031242667,0.012007384,0.011523627],"about_ca_topic_score_codex":0.001754138,"about_ca_topic_score_gemma":0.0057300073,"teacher_disagreement_score":0.7759715,"about_ca_system_score_codex":0.0021233282,"about_ca_system_score_gemma":0.0022710115,"threshold_uncertainty_score":0.99932206},"labels":[],"label_agreement":null},{"id":"W3214381038","doi":"10.1109/jsait.2021.3126687","title":"On Streaming Codes With Unequal Error Protection","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Network packet; Converse; Coding (social sciences); Packet loss; Forward error correction; Computer network; Algorithm; Theoretical computer science; Decoding methods; Mathematics","score_opus":0.02265578548945043,"score_gpt":0.25782235971382145,"score_spread":0.235166574224371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214381038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22177903,0.000053338143,0.76908785,0.0008224147,0.00038054716,0.00021453922,0.0000018759977,0.00013193914,0.007528437],"genre_scores_gemma":[0.99705976,0.00009189261,0.001805439,0.0008768193,0.000049974853,0.00001689445,0.0000068158965,0.000005784168,0.00008664509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984348,0.00054687576,0.00038096725,0.00010916739,0.0003331259,0.00019508667],"domain_scores_gemma":[0.9984812,0.00026582548,0.000256654,0.0003087659,0.0006137023,0.00007381383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073242723,0.00013308809,0.00013729445,0.0003319664,0.00032885978,0.0003527591,0.00035863105,0.00005592152,0.000046189016],"category_scores_gemma":[0.00033409832,0.000105963205,0.00003108556,0.0011423096,0.00002448019,0.0014523823,0.00003569615,0.00064567564,0.000047903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000501721,0.0002742052,0.0001438121,0.000019289162,0.00007166483,0.000040441973,0.0065638865,0.073921174,0.0013202666,0.47499207,0.00061658357,0.44153488],"study_design_scores_gemma":[0.012481634,0.0048438287,0.028427478,0.0047407397,0.00004910913,0.0026866274,0.00402864,0.73474026,0.119046904,0.06500158,0.021222455,0.0027307523],"about_ca_topic_score_codex":7.4179184e-7,"about_ca_topic_score_gemma":0.000017862896,"teacher_disagreement_score":0.7752807,"about_ca_system_score_codex":0.00019923842,"about_ca_system_score_gemma":0.00026025932,"threshold_uncertainty_score":0.4321054},"labels":[],"label_agreement":null},{"id":"W3215609878","doi":"10.1109//tcomm.2012.051012.100594","title":"Performance Analysis of Hop-by-Hop Beamforming for Dual-Hop MIMO AF Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hop (telecommunications); Relay; Beamforming; Moment-generating function; MIMO; Fading; Cumulative distribution function; Computer science; Bit error rate; Diversity gain; Array gain; Monte Carlo method; Probability density function; Electronic engineering; Control theory (sociology); Topology (electrical circuits); Algorithm; Telecommunications; Channel (broadcasting); Engineering; Mathematics; Antenna array; Statistics; Electrical engineering","score_opus":0.050222495464122385,"score_gpt":0.30027585539856294,"score_spread":0.25005335993444056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215609878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072539477,0.0015211455,0.9875236,0.0013849472,0.0003019044,0.00039740544,0.000041032876,0.00016032082,0.0014156748],"genre_scores_gemma":[0.9421089,0.0073061064,0.04941545,0.00025198332,0.00002549379,0.00029423714,0.000051096424,0.000021222604,0.0005254971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998212,0.00026943913,0.00061079295,0.0002641677,0.0002206401,0.00042299667],"domain_scores_gemma":[0.994577,0.0010619037,0.0002613546,0.0036334095,0.00030482613,0.00016151369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008137524,0.00022561439,0.00037446962,0.00047748932,0.001223021,0.00007589609,0.0021076258,0.00012244357,0.000043718523],"category_scores_gemma":[0.000017046406,0.00023454698,0.00032759443,0.0025364903,0.00017528012,0.0008765489,0.00005219972,0.0004558135,0.000014931588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009465564,0.0036384102,0.0012773366,0.00006385035,0.0031986444,1.8186108e-7,0.0114250695,0.53143966,0.007610806,0.022164876,0.0057395063,0.413347],"study_design_scores_gemma":[0.00037036347,0.00008677829,0.00043365936,0.000049261802,0.00038941164,0.000002606157,0.0001162412,0.9741441,0.002454912,0.000012280312,0.02163966,0.00030071568],"about_ca_topic_score_codex":0.000016476282,"about_ca_topic_score_gemma":0.00015008597,"teacher_disagreement_score":0.93810815,"about_ca_system_score_codex":0.00011346787,"about_ca_system_score_gemma":0.000056528435,"threshold_uncertainty_score":0.9564549},"labels":[],"label_agreement":null},{"id":"W333771347","doi":"10.5281/zenodo.42819","title":"A Network Shadow Fading Model For Autonomous Infrastructure Wireless Networks","year":2012,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fading; Computer science; Base station; Computer network; Channel (broadcasting); Wireless network; Shadow mapping; Shadow (psychology); Wireless; Stochastic geometry models of wireless networks; Software deployment; Radio resource management; Telecommunications; Artificial intelligence","score_opus":0.04923122209233672,"score_gpt":0.2584303691091832,"score_spread":0.2091991470168465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W333771347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093052885,0.00040712178,0.98445415,0.00065420824,0.00020795435,0.00044694424,0.000014572989,0.0008562143,0.012028319],"genre_scores_gemma":[0.98376435,0.00019493054,0.01375894,0.00063839514,0.00043396527,3.024764e-7,0.0002692267,0.0005133241,0.00042656815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982476,0.0002634436,0.0002651654,0.0003538891,0.00020288774,0.00066698587],"domain_scores_gemma":[0.9983776,0.000059670318,0.00012594707,0.00076934637,0.0004295063,0.00023793436],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009555222,0.00017280511,0.00017139727,0.000111441645,0.003061686,0.0009157748,0.0021716496,0.00008441085,0.00046641097],"category_scores_gemma":[0.00014499253,0.00018123849,0.0000652269,0.00066885946,0.00007780817,0.00073347404,0.0022129107,0.00032051405,0.00023667974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025784353,0.00007932311,0.000016769189,0.00002254137,0.000038769107,8.3260653e-7,0.0033108385,0.11643814,0.0003482149,0.2353546,0.2052393,0.43912488],"study_design_scores_gemma":[0.00023007336,0.00003851125,0.00014643786,0.000018974413,0.000005099516,0.000022204204,0.000023233102,0.701102,0.000014714904,0.0006199267,0.29761708,0.00016170785],"about_ca_topic_score_codex":8.78933e-7,"about_ca_topic_score_gemma":2.912686e-7,"teacher_disagreement_score":0.9828338,"about_ca_system_score_codex":0.00016664906,"about_ca_system_score_gemma":0.0000070431956,"threshold_uncertainty_score":0.9982362},"labels":[],"label_agreement":null},{"id":"W381399826","doi":"10.1007/s11277-015-2764-9","title":"Energy Efficient Relay Positioning and Power Allocation for Multi-Relay Symmetric Channel with Analog Network Coding","year":2015,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"National Natural Science Foundation of China","keywords":"Computer science; Relay; Linear network coding; Relay channel; Coding (social sciences); Power (physics); Energy (signal processing); Computer network; Channel code; Channel (broadcasting); Topology (electrical circuits); Telecommunications; Decoding methods; Electrical engineering; Mathematics","score_opus":0.07639609539584467,"score_gpt":0.29652252467672685,"score_spread":0.22012642928088216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W381399826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073679676,0.0053408993,0.98086596,0.0042006955,0.00011522121,0.00033017577,0.00000734081,0.00017771195,0.0015940373],"genre_scores_gemma":[0.910349,0.000882896,0.0878072,0.000471356,0.000040267038,0.00020541922,0.00007369559,0.000022208802,0.00014793611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983759,0.00032543458,0.00031217822,0.00038182418,0.0002587214,0.00034597042],"domain_scores_gemma":[0.9971668,0.0005015755,0.00020085213,0.0012657266,0.0006477762,0.00021727245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007910879,0.00021279302,0.00023358421,0.00021374958,0.0012367525,0.00025447138,0.0013648145,0.000085001,0.0000019975662],"category_scores_gemma":[0.00006597921,0.0002018452,0.00006056138,0.0012063804,0.00019764577,0.00030133073,0.0007498812,0.00026297808,0.0000044099947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058295853,0.00042633156,0.0005595224,0.000015624448,0.00014530096,0.0000017760632,0.010059327,0.023033164,0.00028843374,0.9443919,0.0013006763,0.019719621],"study_design_scores_gemma":[0.0008877327,0.00014567543,0.0008766565,0.0001228158,0.000022260532,0.00002555495,0.00055491395,0.99430466,0.000037875383,0.000117861084,0.002620424,0.00028358633],"about_ca_topic_score_codex":0.000037403635,"about_ca_topic_score_gemma":0.00023088467,"teacher_disagreement_score":0.97127146,"about_ca_system_score_codex":0.0001640373,"about_ca_system_score_gemma":0.00016167443,"threshold_uncertainty_score":0.95122254},"labels":[],"label_agreement":null},{"id":"W4200026263","doi":"10.1155/2021/3882100","title":"Power Allocation for 5G Mobile Multiuser Cooperative Networks","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mathematical optimization; Channel (broadcasting); Power (physics); Optimization problem; Channel allocation schemes; Cellular network; Algorithm; Computer network; Wireless; Telecommunications; Mathematics","score_opus":0.01655718208268485,"score_gpt":0.28874054864570264,"score_spread":0.2721833665630178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200026263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05028153,0.0020581805,0.9462543,0.00054941484,0.0005451552,0.00020046637,0.0000018213256,0.000022035436,0.000087092696],"genre_scores_gemma":[0.9408456,0.0016515445,0.057043638,0.00025031416,0.0000656737,0.000027199942,0.00002489137,0.000009021211,0.000082108425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990427,0.00006771444,0.0004553025,0.00014887942,0.0001589818,0.00012640253],"domain_scores_gemma":[0.9977434,0.00015998665,0.0002948589,0.0002290239,0.0015081076,0.00006456815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023444221,0.000098267046,0.0001771448,0.000059281647,0.00013088556,0.000059404898,0.00028189324,0.00004403455,0.000018923427],"category_scores_gemma":[0.000048274745,0.000092099704,0.000106763895,0.00035543295,0.00001785852,0.0009077576,0.0000042436754,0.00015509059,0.000001092405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006236046,0.00013634034,0.00012846733,0.000009536688,0.00004739341,0.0000112620655,0.0031150454,0.9132538,0.017947733,0.0140780285,0.0002454426,0.050964624],"study_design_scores_gemma":[0.02000696,0.0038063433,0.13720109,0.0014050596,0.00021171618,0.00016162053,0.005035657,0.3611333,0.2285576,0.0035396854,0.236749,0.0021919848],"about_ca_topic_score_codex":1.7245316e-7,"about_ca_topic_score_gemma":0.000026051637,"teacher_disagreement_score":0.8905641,"about_ca_system_score_codex":0.00004359334,"about_ca_system_score_gemma":0.00012115691,"threshold_uncertainty_score":0.3755717},"labels":[],"label_agreement":null},{"id":"W4200113404","doi":"10.18280/mmep.080602","title":"A Criterion for Determining the Optimal Position of the Demodulate-and-Forward (DMF) Relay","year":2021,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Relay; Demodulation; Relay channel; Computer science; Position (finance); Transmission (telecommunications); Channel (broadcasting); Control theory (sociology); Telecommunications; Artificial intelligence","score_opus":0.03443770764106503,"score_gpt":0.2370935287677446,"score_spread":0.20265582112667957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200113404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09431008,0.00037761824,0.90433204,0.0007613942,0.000036839927,0.00012019519,4.848748e-7,0.000029320774,0.00003199501],"genre_scores_gemma":[0.8151608,0.0001323682,0.1846024,0.000037939168,0.000010275514,0.000021904127,6.3406134e-7,0.000006569877,0.000027094133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999476,0.000025562465,0.00017981465,0.00012854626,0.0000767994,0.00011326806],"domain_scores_gemma":[0.99938256,0.0002236257,0.0000347106,0.00025954703,0.00007124392,0.00002833083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027320578,0.00007629012,0.00011159336,0.000016208242,0.00015326946,0.00008994034,0.00019038415,0.000032060198,7.534058e-7],"category_scores_gemma":[0.000053468357,0.000047838763,0.000040270195,0.00010215096,0.000024212508,0.000084998755,0.00018934371,0.0000983111,2.597231e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019217355,0.000025781861,0.000013723521,0.0002186512,0.000017651779,2.0597425e-7,0.0024562653,0.84225124,0.0017780279,0.14785467,0.000008296593,0.005373567],"study_design_scores_gemma":[0.00010917508,0.000016460246,0.00004678566,0.00022950047,0.000009547544,0.000011467528,0.000007949852,0.9951578,0.0005707482,0.0036299743,0.0001473446,0.00006328881],"about_ca_topic_score_codex":2.4339576e-7,"about_ca_topic_score_gemma":2.0113897e-7,"teacher_disagreement_score":0.72085077,"about_ca_system_score_codex":0.000007862587,"about_ca_system_score_gemma":0.000009719598,"threshold_uncertainty_score":0.19508082},"labels":[],"label_agreement":null},{"id":"W4200612671","doi":"10.1002/9781119794929.ch13","title":"Considering Double Primary Relay Strategy","year":2021,"lang":"en","type":"other","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Backup; Relay; Overcurrent; Computer science; Mathematical optimization; Protective relay; Reliability engineering; Engineering; Electrical engineering; Current (fluid); Mathematics; Power (physics); Physics","score_opus":0.07430307510664556,"score_gpt":0.29511384615092157,"score_spread":0.220810771044276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200612671","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010016024,0.009019839,0.08722071,0.00034462078,0.00024857093,0.0001019101,3.3595552e-7,0.0003786997,0.90268433],"genre_scores_gemma":[0.000275921,0.0036079395,0.042180393,0.00072926615,0.00010049416,0.000012805345,0.000018644996,0.00008242068,0.95299214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991642,0.00006605851,0.00014922873,0.00032707717,0.00013137248,0.00016202104],"domain_scores_gemma":[0.9987069,0.0000414918,0.000076926175,0.0010736755,0.00004177556,0.000059278056],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010195291,0.00015687122,0.00021033992,0.000094560135,0.00006460974,0.0001987109,0.0007906978,0.00011591889,0.005390828],"category_scores_gemma":[0.0000043464497,0.00014687936,0.000052365343,0.00024940033,0.000027769915,0.00006302258,0.00071256736,0.00022081957,0.0001110367],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8721804e-7,0.000022145876,0.000009995827,0.000027355634,0.000037308226,0.000021240447,0.00004663601,0.000024406663,0.00013397845,0.17314653,0.7947538,0.031775996],"study_design_scores_gemma":[0.00022176398,0.0000075961134,0.000020072013,0.00015435024,0.0000024156873,0.0000115335015,0.0000054418088,0.0011444759,0.00009692609,0.00004865728,0.9980698,0.0002169679],"about_ca_topic_score_codex":0.000020741154,"about_ca_topic_score_gemma":0.00026396033,"teacher_disagreement_score":0.20331599,"about_ca_system_score_codex":0.000033514683,"about_ca_system_score_gemma":0.00017870289,"threshold_uncertainty_score":0.9955184},"labels":[],"label_agreement":null},{"id":"W4205939983","doi":"10.1007/978-981-16-4963-9","title":"Federated Learning for Wireless Networks","year":2021,"lang":"en","type":"book","venue":"Wireless networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Federated Co-operatives (Canada); University of Waterloo","funders":"","keywords":"Computer science; Wireless network; Computer network; Wireless; Telecommunications","score_opus":0.027857823399666318,"score_gpt":0.26099276265952137,"score_spread":0.23313493925985507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205939983","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022145274,0.011086437,0.9327435,0.0004388204,0.0019887036,0.00084241224,0.000003206111,0.00072817545,0.052146584],"genre_scores_gemma":[0.10632405,0.030033277,0.0037186448,0.0023103862,0.004750872,0.00062879786,0.0021668912,0.0004163789,0.8496507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954748,0.0005396493,0.000964843,0.0014414213,0.0004553544,0.0011239224],"domain_scores_gemma":[0.99552536,0.0011329288,0.00069612404,0.0014020585,0.00091896584,0.0003245477],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00083417,0.0008973147,0.0012404231,0.00018803078,0.0014704473,0.0013743668,0.0023158465,0.0011201575,0.00009131867],"category_scores_gemma":[0.00005067972,0.0009786581,0.00051448186,0.00070953567,0.00015339095,0.00036885083,0.0015751545,0.0025449535,0.000026485672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034609784,0.00008292345,0.000024835877,0.000081077545,0.00032255557,0.00005541865,0.00018709566,0.090575844,0.000013558429,0.091506384,0.16626687,0.6508488],"study_design_scores_gemma":[0.0005633693,0.00007176611,0.000011725874,0.0007064392,0.00003942485,0.000017424138,0.000009950211,0.7496918,0.000008379273,0.00018890486,0.24785775,0.00083305244],"about_ca_topic_score_codex":0.000002875491,"about_ca_topic_score_gemma":0.00012510546,"teacher_disagreement_score":0.9290249,"about_ca_system_score_codex":0.00041447836,"about_ca_system_score_gemma":0.00075935124,"threshold_uncertainty_score":0.99982953},"labels":[],"label_agreement":null},{"id":"W4210345390","doi":"10.1017/cbo9780511667008","title":"Cooperative Cellular Wireless Networks","year":2011,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Wireless network; Computer network; Cellular network; Cellular communication; Radio resource management; Wireless; Standardization; Context (archaeology); Telecommunications","score_opus":0.034395788623399155,"score_gpt":0.20612562977155066,"score_spread":0.1717298411481515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210345390","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007563609,0.0006335831,0.30825078,0.0000127393405,0.00028942226,0.00032098024,0.000013679534,0.00026316976,0.6902081],"genre_scores_gemma":[0.0020201153,0.0012213456,0.0005652936,0.00019786038,0.00017266572,0.0000027873216,0.00006375491,0.000039893668,0.9957163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793965,0.00033996016,0.00026324997,0.00077008735,0.00025131437,0.0004357665],"domain_scores_gemma":[0.9970929,0.00012514419,0.0002817135,0.0018010188,0.00045059447,0.00024861415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020459692,0.00048553894,0.0005159642,0.0001845074,0.00053245545,0.0001781874,0.0033682757,0.00041269412,0.000009442846],"category_scores_gemma":[0.0000071196637,0.0005620483,0.00021581961,0.000063403095,0.00027571915,0.00029125914,0.0023671216,0.0009569752,0.000043236418],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013748553,0.00001805381,4.2123602e-7,0.000014760708,0.000092785514,0.00012750202,0.00016372804,0.000034888548,0.000029776762,0.8597995,0.13230139,0.007403461],"study_design_scores_gemma":[0.00042443862,0.00005866505,0.0000033672804,0.00017461846,0.00005696794,0.000007952359,0.000009609849,0.024470106,0.00046358883,0.00000871471,0.97365856,0.00066341244],"about_ca_topic_score_codex":0.000014252001,"about_ca_topic_score_gemma":0.000003301974,"teacher_disagreement_score":0.8597908,"about_ca_system_score_codex":0.00034681868,"about_ca_system_score_gemma":0.00043707195,"threshold_uncertainty_score":0.9996831},"labels":[],"label_agreement":null},{"id":"W4211163142","doi":"10.32920/ryerson.14658036","title":"Enhancing the Spatial Reusability Offered by Smart Beamforming Antennas in Multi-hop Wireless Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Beamforming; Computer science; Computer network; Smart antenna; Wireless; Wireless network; Directional antenna; Distributed computing; Telecommunications; Antenna (radio)","score_opus":0.04355865672811293,"score_gpt":0.28695841012458734,"score_spread":0.2433997533964744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211163142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06656257,0.0014113389,0.92816144,0.0018642837,0.0008846011,0.00056127756,0.0000017999852,0.00016094504,0.0003917299],"genre_scores_gemma":[0.97395635,0.0019345202,0.022763927,0.0007294429,0.00008271544,0.00011597937,0.000051947212,0.00002061817,0.00034452448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965141,0.00090065284,0.0008378565,0.0009403764,0.00030717897,0.00049987936],"domain_scores_gemma":[0.99591786,0.0005968271,0.00025836754,0.002834081,0.00028929504,0.000103557686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018001726,0.00038818337,0.00054261007,0.00008075206,0.00036754395,0.00068492896,0.0032178846,0.00029236524,0.00006111598],"category_scores_gemma":[0.00021862127,0.00030379553,0.00017978932,0.0005467876,0.000116795556,0.00028235995,0.007560772,0.0017047777,0.000004544984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052771473,0.0012717163,0.014109824,0.00023713292,0.00025063078,0.000042369586,0.017678617,0.016224457,0.016909258,0.005417961,0.0017262392,0.92607903],"study_design_scores_gemma":[0.0003196473,0.000013729261,0.004112408,0.00037019546,0.0000064512265,0.0000039290294,0.00022952576,0.991584,0.0022469517,0.000043598284,0.0006483169,0.00042122975],"about_ca_topic_score_codex":0.0010059109,"about_ca_topic_score_gemma":0.020298552,"teacher_disagreement_score":0.97535956,"about_ca_system_score_codex":0.00024357243,"about_ca_system_score_gemma":0.00027775217,"threshold_uncertainty_score":0.9999414},"labels":[],"label_agreement":null},{"id":"W4213239471","doi":"10.1109/tccn.2022.3152507","title":"A Potential Game Approach for Decentralized Resource Coordination in Coexisting IWNs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Key Research and Development Program of China; Liaoning Revitalization Talents Program; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Computer science; Distributed computing; Schedule; Shared resource; Potential game; Protocol (science); Convergence (economics); Resource management (computing); Resource (disambiguation); Game theory; Mathematical optimization; Computer network; Nash equilibrium","score_opus":0.06150801524795637,"score_gpt":0.30108969685423215,"score_spread":0.23958168160627577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213239471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013748775,0.0023519297,0.9926486,0.0015368055,0.0001460977,0.0007680136,0.000022468406,0.00012031628,0.0010308613],"genre_scores_gemma":[0.9787149,0.002085044,0.017437993,0.00045857704,0.000026583048,0.0010445256,0.00005824834,0.000020293504,0.00015384091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979726,0.0007579422,0.00037173342,0.0003940205,0.00018860529,0.00031510997],"domain_scores_gemma":[0.99794763,0.0009322351,0.00015153199,0.00074915343,0.00014593914,0.0000735264],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008486014,0.0001751579,0.00021254868,0.00028419006,0.0019630392,0.00015705224,0.0009993934,0.000046410838,0.0000128074225],"category_scores_gemma":[0.000011821649,0.00021001973,0.00009104309,0.0009770158,0.000119952754,0.0002220067,0.00009667967,0.00057936885,8.342034e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014964082,0.00079818605,0.00009548955,0.000018465817,0.00007188373,0.0000018812364,0.003005267,0.017576167,0.00035435954,0.0053787436,0.00018699984,0.97236294],"study_design_scores_gemma":[0.0016484895,0.00014356819,0.000105140316,0.000075612435,0.000028355264,0.000021646487,0.0007707642,0.9776084,0.00007699324,0.00032127398,0.018929834,0.00026992793],"about_ca_topic_score_codex":0.000010969635,"about_ca_topic_score_gemma":0.00005383442,"teacher_disagreement_score":0.97734004,"about_ca_system_score_codex":0.00013716856,"about_ca_system_score_gemma":0.00005635141,"threshold_uncertainty_score":0.99933624},"labels":[],"label_agreement":null},{"id":"W4214918574","doi":"10.1109/isit.1998.708599","title":"Low density MDS codes and factors of complete graphs","year":2002,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Mathematics; Tanner graph; Combinatorics; Discrete mathematics; Decoding methods; Code (set theory); Equivalence (formal languages); Factorization; Equivalence relation; Computer science; Block code; Linear code; Algorithm","score_opus":0.07521329272523344,"score_gpt":0.25836434890415383,"score_spread":0.18315105617892039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214918574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8339387,0.00042510565,0.15885974,0.00056752766,0.00006173379,0.00007529808,0.0000011870856,0.00009007121,0.0059806095],"genre_scores_gemma":[0.99401283,0.00051830424,0.0051427693,0.00015432373,0.0000024812632,5.9481954e-7,5.823814e-7,0.0000015358788,0.00016654612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995783,0.000054036544,0.000105605235,0.000110834546,0.00007334588,0.0000778716],"domain_scores_gemma":[0.99943244,0.000104744315,0.000033691973,0.0003262668,0.000061899846,0.000040976975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007919903,0.00005536344,0.00010173057,0.00004327264,0.000097152944,0.000035656827,0.00031549955,0.000012705842,0.00007218179],"category_scores_gemma":[0.000014303356,0.000044594537,0.000023337163,0.00018936108,0.000062495616,0.0001226604,0.00022988017,0.00004853958,0.0000053180643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002264749,0.00018531515,0.08124828,0.00002264988,0.000041311247,0.0000025227373,0.0039010611,0.000026214491,0.013822941,0.8151017,0.0050199623,0.08062579],"study_design_scores_gemma":[0.0006477794,0.00016922182,0.22024035,0.00005912874,0.000008121256,0.000013750744,0.00011995699,0.7404941,0.027896108,0.003738159,0.006143794,0.00046954863],"about_ca_topic_score_codex":0.000008452551,"about_ca_topic_score_gemma":0.000049760543,"teacher_disagreement_score":0.8113635,"about_ca_system_score_codex":0.000004356925,"about_ca_system_score_gemma":0.0000025625798,"threshold_uncertainty_score":0.18185124},"labels":[],"label_agreement":null},{"id":"W4220768623","doi":"10.18280/isi.270104","title":"A Comprehensive Review on Intrusion Detection and Prevention Schemes for Network Coding Enabled Mobile Small Cells","year":2022,"lang":"en","type":"review","venue":"Ingénierie des systèmes d information","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Denial-of-service attack; Computer science; Linear network coding; Computer network; Computer security; Network security; Intrusion detection system; Application layer DDoS attack; The Internet; Network packet","score_opus":0.07010668245716979,"score_gpt":0.3070627596377948,"score_spread":0.236956077180625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220768623","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000049748046,0.79160804,0.20437929,0.000008953803,0.00043688045,0.003118146,0.000009146511,0.00016759755,0.00026698667],"genre_scores_gemma":[0.000044858392,0.9900872,0.0065542758,0.00030677277,0.000100156976,0.0025865962,0.0002554438,0.00002345565,0.000041254334],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973759,0.0005677041,0.0011302354,0.00034341982,0.0002394412,0.000343296],"domain_scores_gemma":[0.9971979,0.0006388357,0.0011318461,0.00068697694,0.0002602973,0.00008413345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010295353,0.00041893657,0.0010031743,0.00029829916,0.0010567597,0.00040451143,0.0006971895,0.00016602532,0.000037377074],"category_scores_gemma":[0.00015663516,0.0003906399,0.0002923807,0.0009600009,0.000052951327,0.0012460708,0.0006674121,0.0004208319,0.000022331631],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059127733,0.000011312775,5.3262834e-8,0.026127487,0.000043941658,2.79585e-7,0.00025863206,0.0000671078,0.0000018807052,0.001506652,0.00034275372,0.971634],"study_design_scores_gemma":[0.00020831647,0.00028098113,5.7256585e-7,0.02589476,0.00011453265,0.000026610263,0.00003066717,0.0066974172,0.000012918079,0.00034868103,0.9660142,0.00037033137],"about_ca_topic_score_codex":0.0000020905236,"about_ca_topic_score_gemma":0.0000031467564,"teacher_disagreement_score":0.97126365,"about_ca_system_score_codex":0.0005051995,"about_ca_system_score_gemma":0.0001643199,"threshold_uncertainty_score":0.99985456},"labels":[],"label_agreement":null},{"id":"W4220781810","doi":"10.1155/2022/8889718","title":"Network Coding‐Based D2D Transmission for Public Safety Networks over LTE HetNets and 5G Networks","year":2022,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer network; Heterogeneous network; Linear network coding; Network packet; Overhead (engineering); Quality of service; LTE Advanced; Data transmission; Wireless network; Telecommunications; Wireless; Telecommunications link","score_opus":0.03804773873053598,"score_gpt":0.2826194914525259,"score_spread":0.24457175272198994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220781810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004469881,0.018456915,0.97290456,0.0023946746,0.00022069075,0.0009357943,0.0000060769753,0.00026496683,0.00034643526],"genre_scores_gemma":[0.9636211,0.006399049,0.028021364,0.0013125639,0.00010192904,0.00034946087,0.00011776321,0.000034222357,0.000042584907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722624,0.0008105476,0.00060616987,0.0005663031,0.00020623452,0.0005844987],"domain_scores_gemma":[0.9958542,0.0015192982,0.0002954032,0.0019414227,0.00017367139,0.00021601579],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016678898,0.000288002,0.0003897185,0.00012900618,0.005538544,0.0004336371,0.002152174,0.000090255184,0.000018256476],"category_scores_gemma":[0.000013450496,0.00031285486,0.000106132,0.0008752676,0.00020594966,0.00028149143,0.0026998122,0.00069133996,3.1261706e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021934233,0.00015963217,0.0011975326,0.000019634239,0.000036237165,8.028606e-7,0.0006489318,0.16491877,0.000044921624,0.072636686,0.0009709654,0.759344],"study_design_scores_gemma":[0.0008112766,0.00011359664,0.0007036964,0.0000704755,0.000013127387,0.000011591681,0.00006444822,0.851239,0.0000020692585,0.00017091705,0.14649002,0.00030977532],"about_ca_topic_score_codex":0.000010172829,"about_ca_topic_score_gemma":0.000022373126,"teacher_disagreement_score":0.9591512,"about_ca_system_score_codex":0.0001019049,"about_ca_system_score_gemma":0.00009708336,"threshold_uncertainty_score":0.99993235},"labels":[],"label_agreement":null},{"id":"W4220782304","doi":"10.1109/tvt.2022.3162018","title":"Partial Self-Concatenation Structure and Performance Analysis of Spinal Codes Over Rayleigh Fading Channel","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Concatenation (mathematics); Additive white Gaussian noise; Fading; Channel (broadcasting); Rayleigh fading; Algorithm; Notation; Mathematics; Computer science; Telecommunications; Arithmetic","score_opus":0.014395887326761695,"score_gpt":0.24563591972064533,"score_spread":0.23124003239388363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220782304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58792037,0.00016008645,0.41119647,0.00041030027,0.000087055094,0.00008145754,0.00000701915,0.00012950065,0.000007729083],"genre_scores_gemma":[0.99757403,0.00022794257,0.0020441464,0.00008201846,0.0000049850605,0.000046959914,0.0000034360698,0.0000056932818,0.000010777804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991013,0.0000915574,0.00020489296,0.00027134316,0.00017797807,0.00015293664],"domain_scores_gemma":[0.999338,0.00002581902,0.000088238136,0.00044647013,0.00007472022,0.000026782016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015677039,0.0001093837,0.00021042688,0.0008701328,0.00051403226,0.000019561772,0.0004428227,0.00007525129,0.00004549706],"category_scores_gemma":[0.0000024388314,0.0001123966,0.00006831529,0.0022472916,0.000072084,0.00015229602,0.000023372166,0.0003546724,6.7938686e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009513557,0.00044120173,0.0014219423,0.00003873844,0.0017142958,0.000011284824,0.0020983454,0.701673,0.041036233,0.021768091,0.000023096685,0.22967869],"study_design_scores_gemma":[0.0003011983,0.00029044173,0.0016170988,0.0000075268026,0.00015211043,0.00001642676,0.00005196907,0.94250387,0.054462194,0.00008643241,0.00037103554,0.00013971863],"about_ca_topic_score_codex":0.0000039761376,"about_ca_topic_score_gemma":0.000019895375,"teacher_disagreement_score":0.40965366,"about_ca_system_score_codex":0.00007274576,"about_ca_system_score_gemma":0.000028286668,"threshold_uncertainty_score":0.45834005},"labels":[],"label_agreement":null},{"id":"W4220888991","doi":"10.1002/9781119788829.ch3","title":"Rethinking D2D Interference: Beyond the Past","year":2022,"lang":"en","type":"other","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pfizer (Canada)","funders":"","keywords":"Interference (communication); Computer science; Coding (social sciences); Channel (broadcasting); Interference alignment; Field (mathematics); Matrix (chemical analysis); Rank (graph theory); Theoretical computer science; Algorithm; Mathematical optimization; Mathematics; Telecommunications; Statistics","score_opus":0.04542961713836097,"score_gpt":0.27822944869383626,"score_spread":0.2327998315554753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220888991","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.854811e-7,0.0017343753,0.07595313,0.0050349827,0.00055809243,0.0001476061,0.0000011686852,0.00038028334,0.91618955],"genre_scores_gemma":[0.0030621227,0.001394512,0.005028494,0.004454483,0.00023236882,0.000050055074,0.000012625847,0.000090595546,0.98567474],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895066,0.00025642954,0.00014022324,0.00028676545,0.00021008831,0.00015584855],"domain_scores_gemma":[0.9982361,0.00011829561,0.000112976864,0.0014757534,0.000025441432,0.000031419597],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000337994,0.00015221785,0.00013827192,0.00010561082,0.00029235796,0.00021664589,0.0033469682,0.00006334853,0.021200784],"category_scores_gemma":[0.000011100671,0.00009978036,0.000057967274,0.00037836115,0.000052606127,0.000056161734,0.002577101,0.00054551737,0.00015625134],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3986797e-7,0.0000069814155,0.000018967683,0.000002285206,0.000013960073,0.0000011639369,0.00074924,0.0000012233917,0.0000015931416,0.13159329,0.82631946,0.04129158],"study_design_scores_gemma":[0.00005155629,0.0000152387975,0.000012182154,0.000021815375,0.0000030013603,0.0000041275916,0.000031246756,0.0034378194,0.000001770667,0.0022623457,0.9940119,0.00014700482],"about_ca_topic_score_codex":0.0000127338335,"about_ca_topic_score_gemma":0.00022434688,"teacher_disagreement_score":0.16769241,"about_ca_system_score_codex":0.0000441897,"about_ca_system_score_gemma":0.000048117592,"threshold_uncertainty_score":0.97969395},"labels":[],"label_agreement":null},{"id":"W4225486508","doi":"10.1109/tcomm.2022.3168280","title":"Sparse and Low-Rank Optimization for Pliable Index Coding via Alternating Projection","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Coding (social sciences); Computer science; Mathematical optimization; Greedy algorithm; Algorithm; Convergence (economics); Sparse matrix; Theoretical computer science; Mathematics","score_opus":0.05500643778611547,"score_gpt":0.29587582894695347,"score_spread":0.240869391160838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225486508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008690834,0.00019134374,0.9945165,0.002474973,0.000327503,0.00068818557,0.000017519778,0.00024212635,0.0006727479],"genre_scores_gemma":[0.92299163,0.001076672,0.07413572,0.00033979688,0.000017277353,0.0011018637,0.000018443374,0.00002036082,0.00029825934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986503,0.00031142886,0.0003220523,0.00031190287,0.00019602357,0.00020825885],"domain_scores_gemma":[0.99764276,0.0004479938,0.00014915782,0.0015308663,0.0001626057,0.00006659916],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005214225,0.00014669837,0.00014652715,0.00027020517,0.0033500933,0.00017092853,0.001355372,0.00003827533,0.00005511351],"category_scores_gemma":[0.000013079653,0.00017625756,0.00007076702,0.0007410699,0.00007174883,0.00047938057,0.000080023376,0.00043702187,0.0000033753893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032261745,0.0005238536,0.000032084703,0.000020561953,0.00006084019,3.32837e-7,0.0018698775,0.8314203,0.00173397,0.011091142,0.00022366719,0.15299113],"study_design_scores_gemma":[0.0005493973,0.00010224291,0.000023204499,0.000024321327,0.0000139355125,0.000015145943,0.00013295465,0.99450094,0.0007734973,0.00031206897,0.003366623,0.00018566416],"about_ca_topic_score_codex":0.00003197439,"about_ca_topic_score_gemma":0.000078054996,"teacher_disagreement_score":0.92212254,"about_ca_system_score_codex":0.00018082521,"about_ca_system_score_gemma":0.00007737656,"threshold_uncertainty_score":0.9979474},"labels":[],"label_agreement":null},{"id":"W4225696646","doi":"10.1109/twc.2022.3162298","title":"Energy Efficient HARQ for Ultrareliability via Novel Outage Probability Bound and Geometric Programming","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China; Nokia","keywords":"Geometric programming; Computer science; Hybrid automatic repeat request; Mathematical optimization; Outage probability; Energy (signal processing); Upper and lower bounds; Algorithm; Mathematics; Fading; Decoding methods; Telecommunications; Statistics; Telecommunications link","score_opus":0.05035155440573184,"score_gpt":0.2801645203467161,"score_spread":0.22981296594098424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225696646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123758465,0.0004920895,0.98277783,0.0027618501,0.00024285677,0.0008759574,0.000072095514,0.00028671155,0.00011475291],"genre_scores_gemma":[0.9482135,0.00031096628,0.048699606,0.00026119172,0.000008898486,0.0023449834,0.000021559157,0.000020671318,0.00011858089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978966,0.00042129474,0.0004810599,0.00055007264,0.00030785232,0.00034311114],"domain_scores_gemma":[0.99503946,0.0011663536,0.00016037331,0.003237184,0.0002571271,0.00013952532],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009524665,0.00022250747,0.00025595794,0.00033735536,0.003530582,0.00021406138,0.0024021869,0.000055752127,0.000021614382],"category_scores_gemma":[0.000021576505,0.00024694458,0.00015392783,0.0017527149,0.00027924776,0.00022370955,0.00013613985,0.00052132324,0.0000019751214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041185573,0.004011601,0.00005548087,0.000041245195,0.000085864565,3.0906344e-7,0.0018480375,0.044642974,0.003180043,0.043507144,0.000070123184,0.902516],"study_design_scores_gemma":[0.0009576995,0.0002864418,0.00027751795,0.000020501542,0.00003502659,0.00002025066,0.00013695829,0.9604791,0.002003419,0.0007134588,0.03461255,0.00045708532],"about_ca_topic_score_codex":0.0000636972,"about_ca_topic_score_gemma":0.00021133426,"teacher_disagreement_score":0.9358377,"about_ca_system_score_codex":0.00031365873,"about_ca_system_score_gemma":0.00013650976,"threshold_uncertainty_score":0.9999983},"labels":[],"label_agreement":null},{"id":"W4225759418","doi":"10.1109/jstsp.2022.3156756","title":"Distributed Learning for Wireless Communications: Methods, Applications and Challenges","year":2022,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; Wireless network; Wireless; Distributed computing; Computer network; Distributed learning; Telecommunications","score_opus":0.09406988135292749,"score_gpt":0.35701659342915265,"score_spread":0.26294671207622516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225759418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013614949,0.029891508,0.96435666,0.004084034,0.00003674221,0.00016937536,8.304725e-7,0.00002595335,0.00007341954],"genre_scores_gemma":[0.82488215,0.008490477,0.16632487,0.000085040105,0.00008472875,0.00009889814,0.0000041054273,0.000008724379,0.00002102279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986546,0.00051847316,0.00040195393,0.00013495568,0.0001485064,0.00014149964],"domain_scores_gemma":[0.99840945,0.0004626051,0.00037021592,0.00022389491,0.00048889185,0.00004495577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012472261,0.000082570186,0.00018562893,0.00016818826,0.00066339073,0.00010008366,0.0010279322,0.000029237863,0.0000023042344],"category_scores_gemma":[0.00006247845,0.0000854211,0.000029787174,0.0007390545,0.00004617813,0.00028924333,0.0002728779,0.00059593807,6.97602e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010358996,0.00008849703,0.00015198789,0.000039228707,0.000013325376,8.209803e-7,0.0013677785,0.0014496814,0.0028563265,0.007568572,0.000023838535,0.9864296],"study_design_scores_gemma":[0.0011605562,0.0003676994,0.0010826851,0.00016194048,0.00002597835,0.00017826387,0.0011522917,0.81832474,0.0017659471,0.0106101995,0.16483782,0.00033187697],"about_ca_topic_score_codex":5.238495e-7,"about_ca_topic_score_gemma":0.00000431117,"teacher_disagreement_score":0.9860977,"about_ca_system_score_codex":0.000098570104,"about_ca_system_score_gemma":0.00017917139,"threshold_uncertainty_score":0.5102332},"labels":[],"label_agreement":null},{"id":"W4229609468","doi":"10.1109/glocom.2015.7417620","title":"Best-Relay Selection for Multi-Hop Vehicular Communication in Highways","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Computer science; Relay; Pairwise error probability; Hop (telecommunications); Transmission (telecommunications); Computer network; Underlay; Correctness; Telecommunications; Power (physics); Signal-to-noise ratio (imaging); Algorithm; Decoding methods","score_opus":0.2025807585261301,"score_gpt":0.3786076535594674,"score_spread":0.1760268950333373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229609468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012876023,0.007860089,0.95219946,0.015087569,0.0005975554,0.0018562691,0.00005539358,0.0008593704,0.008608254],"genre_scores_gemma":[0.78504443,0.002875757,0.21086338,0.0004120213,0.000028810873,0.00044297613,0.00011332866,0.000017779039,0.00020149189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660826,0.0011003423,0.0008142449,0.0005618805,0.00036427603,0.0005510101],"domain_scores_gemma":[0.9925963,0.0003214412,0.0003576696,0.0046649026,0.0017487502,0.0003109064],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001620499,0.00036711362,0.00044216603,0.00020243975,0.00067271315,0.00046244272,0.006588932,0.0002380874,0.000011487154],"category_scores_gemma":[0.00041542752,0.00040163664,0.00013464178,0.0015598607,0.0002750988,0.0011980849,0.0015481636,0.0005590752,0.00020192894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007436245,0.0022528386,0.011188733,0.000035845762,0.00012040428,0.0000015722374,0.0029358417,0.005978763,0.00076084526,0.8469716,0.04205223,0.08762697],"study_design_scores_gemma":[0.0020582387,0.00014060017,0.0013999054,0.00015358914,0.000023662855,0.000017406333,0.00032989838,0.93542945,0.00016697503,0.0029111241,0.05683345,0.00053570594],"about_ca_topic_score_codex":0.0004950171,"about_ca_topic_score_gemma":0.009436069,"teacher_disagreement_score":0.9294507,"about_ca_system_score_codex":0.00080068014,"about_ca_system_score_gemma":0.0007322694,"threshold_uncertainty_score":0.99984354},"labels":[],"label_agreement":null},{"id":"W4229715808","doi":"10.1002/wcm.525","title":"An efficient MAC protocol for cooperative diversity in mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Computer network; Cooperative diversity; Relay; Throughput; Fading; Blocking (statistics); Wireless ad hoc network; Mobile ad hoc network; Protocol (science); Diversity gain; Channel (broadcasting); Wireless; Telecommunications; Network packet","score_opus":0.05114150699580787,"score_gpt":0.3517409192006437,"score_spread":0.3005994122048358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229715808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075407624,0.002056586,0.8777766,0.00011527578,0.00006995491,0.04402756,0.000002997135,0.00020225735,0.0003411107],"genre_scores_gemma":[0.9416878,0.0006489804,0.031171601,0.00016725926,0.00002976856,0.026245596,0.00001735106,0.000015138041,0.000016472739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981802,0.00032022563,0.0004908491,0.00044657817,0.00014108924,0.00042101793],"domain_scores_gemma":[0.99668884,0.0007416643,0.00018867978,0.0019099507,0.00031948884,0.00015136787],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016617685,0.00021264807,0.00027380002,0.00017115352,0.0017843264,0.00020776982,0.002290812,0.00009331636,0.000003975797],"category_scores_gemma":[0.000016705197,0.00021576183,0.000057203593,0.0006887253,0.00019500632,0.00024983505,0.0034678695,0.00036588844,0.0000013585951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036096313,0.00062890095,0.0016921412,0.000021686641,0.000014109268,0.0000014345363,0.0068923556,0.03499764,0.00021691345,0.016355908,0.000045265577,0.9390975],"study_design_scores_gemma":[0.0011325789,0.00028878264,0.0020541723,0.00011488061,0.0000034340337,0.0000045611764,0.0005845011,0.97090983,0.000087207794,0.00003735249,0.024506459,0.00027622865],"about_ca_topic_score_codex":0.000007235867,"about_ca_topic_score_gemma":0.0002573726,"teacher_disagreement_score":0.9388213,"about_ca_system_score_codex":0.00011208571,"about_ca_system_score_gemma":0.00005733715,"threshold_uncertainty_score":0.99951524},"labels":[],"label_agreement":null},{"id":"W4229763820","doi":"10.1007/978-1-4614-6831-8_2","title":"Distributed Space-Time Coding","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pairwise error probability; Space–time code; Relay; Computer science; Linear network coding; Coding (social sciences); Algorithm; Computer network; Mathematics; Block code; Statistics; Decoding methods; Fading; Physics","score_opus":0.02770832178660212,"score_gpt":0.24844451538945764,"score_spread":0.2207361936028555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229763820","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073306925,0.00044382774,0.832507,0.0012903104,0.0010697905,0.00047030428,0.0000049720443,0.00039361898,0.16374683],"genre_scores_gemma":[0.11302045,0.0046787187,0.6946793,0.0036107039,0.001806276,0.00013252115,0.000060479586,0.00025330743,0.18175821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962197,0.000056724373,0.0006568266,0.0014108222,0.00087645394,0.00077945954],"domain_scores_gemma":[0.9961707,0.00022968324,0.00033788203,0.002535271,0.0004249146,0.0003015716],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012004804,0.00053314393,0.00059047627,0.0006831821,0.00049205084,0.0011756612,0.005976488,0.00020238556,0.00038456696],"category_scores_gemma":[0.000060360733,0.00055215886,0.00014259608,0.0007893511,0.0007058951,0.0012472746,0.004989057,0.000839623,0.0013350167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012776987,0.000024135792,0.00001761844,0.000014734336,0.000011439371,0.000031241947,0.0002212797,0.0006356289,0.00033373866,0.8337074,0.0017555418,0.16324598],"study_design_scores_gemma":[0.00041441768,0.0000992762,0.0009216961,0.00076425256,0.0000072947523,0.000041380885,7.2335826e-7,0.852601,0.00037741457,0.014434168,0.1290105,0.0013279103],"about_ca_topic_score_codex":0.00000843427,"about_ca_topic_score_gemma":0.000010610575,"teacher_disagreement_score":0.8519653,"about_ca_system_score_codex":0.000522501,"about_ca_system_score_gemma":0.0004603772,"threshold_uncertainty_score":0.99986124},"labels":[],"label_agreement":null},{"id":"W4230140870","doi":"10.36227/techrxiv.12107199.v2","title":"Improved S-AF and S-DF Relaying Schemes using Machine Learning based Power Allocation over Cascaded Rayleigh Fading Channels","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Lakehead University","funders":"Science Foundation Ireland","keywords":"Rayleigh fading; Fading; Relay; Computer science; Channel (broadcasting); Rayleigh scattering; Fading distribution; Algorithm; Signal-to-noise ratio (imaging); Transmission (telecommunications); Electronic engineering; Telecommunications; Power (physics); Topology (electrical circuits); Engineering; Physics; Electrical engineering","score_opus":0.04914946307317429,"score_gpt":0.2934036147132919,"score_spread":0.2442541516401176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230140870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17375153,0.0038704346,0.8197761,0.00084648497,0.0005998098,0.00037463196,9.980987e-7,0.00032082002,0.00045918007],"genre_scores_gemma":[0.9154394,0.0006658854,0.08277138,0.0006031508,0.00007132935,0.000029042261,0.00004807452,0.000036358553,0.00033532726],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973712,0.00046375944,0.00051505474,0.000966764,0.00029220362,0.00039104925],"domain_scores_gemma":[0.997811,0.00025772466,0.00034979515,0.0010994577,0.0003336643,0.00014833127],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008425349,0.00042536098,0.00046290597,0.00027643229,0.0006301249,0.0011735199,0.0009118327,0.00029129852,0.00014315735],"category_scores_gemma":[0.00023605986,0.0004319957,0.00014022202,0.00047051618,0.00005587702,0.0005573174,0.00343783,0.0012871834,0.0000021876192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010042687,0.00055436546,0.009918614,0.00089113164,0.0010008009,0.00011109758,0.023814633,0.26373208,0.57133996,0.028628387,0.00023368224,0.099674806],"study_design_scores_gemma":[0.00045906566,0.000022726823,0.00022866124,0.00038858136,0.00002006877,0.000010888931,0.00007355955,0.98733276,0.010084494,0.00004550059,0.00082523545,0.00050843175],"about_ca_topic_score_codex":0.00013412884,"about_ca_topic_score_gemma":0.000052113784,"teacher_disagreement_score":0.7416879,"about_ca_system_score_codex":0.0001973523,"about_ca_system_score_gemma":0.00026080248,"threshold_uncertainty_score":0.9998634},"labels":[],"label_agreement":null},{"id":"W4230287860","doi":"10.32920/14669103.v1","title":"Turbo codes for multi-hop wireless sensor networks with decode-and-forward mechanism","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Computer science; Retransmission; Computer network; Decoding methods; Network packet; Convolutional code; Wireless sensor network; Algorithm; Real-time computing","score_opus":0.055543959142769266,"score_gpt":0.2983510098685828,"score_spread":0.24280705072581354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230287860","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005989348,0.0012547633,0.98976415,0.0010539232,0.00041857891,0.00078363926,0.0000054876646,0.0003097353,0.0004203556],"genre_scores_gemma":[0.41535372,0.0031699147,0.57898295,0.0008668654,0.00009044668,0.00023826867,0.000039990005,0.000033250974,0.0012245877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978741,0.00020830505,0.0003732015,0.0009352413,0.00020723276,0.00040191103],"domain_scores_gemma":[0.9972494,0.00032223618,0.00020186293,0.0015019329,0.0005496471,0.0001749113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047525408,0.0004110837,0.0005636121,0.00009560407,0.00035068,0.0008217814,0.0013385018,0.000271234,0.000039272192],"category_scores_gemma":[0.000035147943,0.00033764075,0.00013917536,0.0002298838,0.000069425885,0.00019226944,0.0031105508,0.0006088048,0.000003074576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011817821,0.0005275705,0.00040765977,0.00046696328,0.0010851682,0.00006255474,0.005729768,0.05480991,0.0010610763,0.3792629,0.0024110465,0.5540572],"study_design_scores_gemma":[0.000521533,0.000052235377,0.00011784056,0.00025162485,0.000030513149,0.00001776006,0.00012346987,0.9959099,0.0014656486,0.00019822828,0.0007930294,0.00051821384],"about_ca_topic_score_codex":0.000018355657,"about_ca_topic_score_gemma":0.0006180113,"teacher_disagreement_score":0.9411,"about_ca_system_score_codex":0.00006476748,"about_ca_system_score_gemma":0.00018545317,"threshold_uncertainty_score":0.99990755},"labels":[],"label_agreement":null},{"id":"W4230290831","doi":"10.22215/etd/2010-09379","title":"Rateless coding for wireless relay networks","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"","keywords":"Relay; Computer science; Wireless; Coding (social sciences); Telecommunications; Computer network; Mathematics; Physics; Statistics; Power (physics)","score_opus":0.027645962280561053,"score_gpt":0.30044553736941126,"score_spread":0.2727995750888502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230290831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003919994,0.00057496846,0.96899074,0.0003351262,0.003466034,0.0006581392,0.0000018064771,0.00036241682,0.021690797],"genre_scores_gemma":[0.8500746,0.005438442,0.054126695,0.0009948028,0.00091323914,0.00066833367,0.0012629827,0.00012279462,0.0863981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985309,0.000076723685,0.00037953485,0.0005049439,0.00017069334,0.0003371749],"domain_scores_gemma":[0.99786454,0.00033674014,0.00023681117,0.0010325727,0.00042841068,0.000100929785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043753628,0.00028556827,0.00034410425,0.00012743655,0.0004853087,0.00040303796,0.0018834713,0.00041895936,0.00006401931],"category_scores_gemma":[0.0000456747,0.000268189,0.0001507379,0.00035963877,0.000020416192,0.0002696133,0.00015866986,0.0007445071,0.000019581617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024382189,0.000045563633,0.000011839834,0.00005198409,0.00004394736,0.0000018074404,0.0007767632,0.00016672476,0.0018825782,0.5589844,0.00967219,0.42833784],"study_design_scores_gemma":[0.0005550098,0.000057945323,0.00027397394,0.00022633164,0.000024126908,0.000004187288,0.00012765462,0.93904245,0.0046035564,0.00051711156,0.053754658,0.00081301364],"about_ca_topic_score_codex":0.0000035543574,"about_ca_topic_score_gemma":0.0009059389,"teacher_disagreement_score":0.93887573,"about_ca_system_score_codex":0.00003826277,"about_ca_system_score_gemma":0.00013394786,"threshold_uncertainty_score":0.99997705},"labels":[],"label_agreement":null},{"id":"W4230657296","doi":"10.1109/t-wc.2009.071411","title":"Cyclic space-frequency filtering for BICM-OFDM systems with multiple co-located or distributed transmit antennas","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Pairwise error probability; Transmit diversity; Algorithm; Transmission (telecommunications); Filter (signal processing); Fading; Antenna diversity; Antenna (radio); Control theory (sociology); Electronic engineering; Telecommunications; Decoding methods; Channel (broadcasting); Engineering","score_opus":0.05613286286400145,"score_gpt":0.2962758620921504,"score_spread":0.24014299922814894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230657296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003843091,0.00041012542,0.9879304,0.0053105117,0.00016039652,0.0011733695,0.00017565746,0.00066737237,0.0003290707],"genre_scores_gemma":[0.9695679,0.0018713691,0.02732441,0.00024151671,0.000020018231,0.0005850179,0.00009801053,0.000033075376,0.00025866943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997866,0.00034009633,0.0005731567,0.00048633385,0.00026374788,0.00047069768],"domain_scores_gemma":[0.994693,0.00086535176,0.00019568978,0.0036508897,0.00039802538,0.00019706775],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002988124,0.00035885038,0.00040996532,0.00027926723,0.0016120839,0.00034588156,0.0029888458,0.00012891456,0.000013338482],"category_scores_gemma":[0.000015818267,0.00030660597,0.00015016194,0.0013586215,0.00019138749,0.00062709185,0.000012401589,0.00052558316,0.000022168337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013631564,0.009007353,0.000473042,0.000319995,0.0010838642,0.00003618761,0.009955222,0.12493757,0.13248084,0.112213016,0.00223784,0.6058919],"study_design_scores_gemma":[0.00327966,0.0009528829,0.0012153183,0.0006310553,0.00009033592,0.00007906098,0.00029740384,0.9699696,0.01258533,0.00014608628,0.009743311,0.0010099766],"about_ca_topic_score_codex":0.000053867006,"about_ca_topic_score_gemma":0.0006430292,"teacher_disagreement_score":0.9657248,"about_ca_system_score_codex":0.0001808266,"about_ca_system_score_gemma":0.00017508223,"threshold_uncertainty_score":0.9999386},"labels":[],"label_agreement":null},{"id":"W4230883312","doi":"10.22215/etd/2007-08460","title":"Co-channel interference suppression in multihop relay networks","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Relay; Interference (communication); Channel (broadcasting); Telecommunications; Computer science; Physics; Power (physics)","score_opus":0.03863283873429084,"score_gpt":0.3466845214050099,"score_spread":0.30805168267071903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230883312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046765762,0.002151705,0.87819105,0.00019398064,0.0022019153,0.0005100185,0.0000010747085,0.00031571134,0.11175795],"genre_scores_gemma":[0.9715176,0.0033620978,0.0047711595,0.00034440414,0.000091529044,0.00004418657,0.0003344999,0.000027076472,0.019507438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817336,0.00018141973,0.0005177185,0.0005357294,0.00022686152,0.0003649115],"domain_scores_gemma":[0.9983283,0.00025726506,0.00018801366,0.00095161423,0.0001744894,0.00010028457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056783925,0.00029169148,0.00030880002,0.0003693863,0.00015315221,0.00017209037,0.00175275,0.0003562367,0.0001271766],"category_scores_gemma":[0.000066408415,0.00026581227,0.00007982587,0.00062143424,0.000022102391,0.00032903047,0.00018027861,0.00090274925,0.00006340722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003084823,0.0006788424,0.00075434876,0.00014415386,0.00007998874,0.00011040835,0.019639403,0.012784638,0.002142849,0.067126125,0.0441852,0.85204554],"study_design_scores_gemma":[0.000604822,0.000073711475,0.005697432,0.0010198719,0.000005269584,0.000004598389,0.00037605004,0.98409355,0.0027738533,0.00019462376,0.0044325516,0.000723686],"about_ca_topic_score_codex":0.000026506397,"about_ca_topic_score_gemma":0.0018123747,"teacher_disagreement_score":0.9713089,"about_ca_system_score_codex":0.0000969348,"about_ca_system_score_gemma":0.000075435375,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"id":"W4231227180","doi":"10.1201/9781315215969","title":"Cooperative Cognitive Radio Networks","year":2018,"lang":"en","type":"book","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cognitive radio; Cognition; Computer science; Computer network; Telecommunications; Psychology; Neuroscience; Wireless","score_opus":0.036736584643183995,"score_gpt":0.277043186027689,"score_spread":0.24030660138450502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231227180","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.748382e-7,0.0012143166,0.4733538,0.00017148266,0.0003564733,0.00023300292,0.0000023537593,0.00020919777,0.524459],"genre_scores_gemma":[0.0011960776,0.0029197591,0.0037386399,0.0021546562,0.0007643136,0.000039559407,0.00010001556,0.00003645093,0.9890505],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981337,0.00024671992,0.0003574239,0.0006605099,0.00025758677,0.00034402078],"domain_scores_gemma":[0.997283,0.00051874475,0.00018332149,0.001057384,0.0008036954,0.00015385592],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003639434,0.00040116592,0.00043106644,0.00013834014,0.00038861958,0.00036049553,0.0018425717,0.00029579736,0.0012119623],"category_scores_gemma":[0.00006945867,0.00035561412,0.00013288218,0.00028561382,0.00024578758,0.00033442743,0.0011840294,0.0006455247,0.00093299267],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043445452,0.00001943651,0.0000014012747,0.0000032648952,0.00008840128,0.000008118681,0.0002808191,0.000015892718,8.1882877e-7,0.32968953,0.6359266,0.033961356],"study_design_scores_gemma":[0.0005193162,0.00022901487,0.000025250038,0.000439979,0.000032805085,0.000023363236,0.0000111076215,0.12100245,0.000038563434,0.0019120311,0.87488085,0.000885276],"about_ca_topic_score_codex":7.034483e-7,"about_ca_topic_score_gemma":0.00004194232,"teacher_disagreement_score":0.46961516,"about_ca_system_score_codex":0.00017403762,"about_ca_system_score_gemma":0.0005207379,"threshold_uncertainty_score":0.9998896},"labels":[],"label_agreement":null},{"id":"W4231417998","doi":"10.1007/978-3-319-11701-0_1","title":"Introduction","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Multipath TCP; Computer science; Transport layer; Multipath propagation; Computer network; Protocol (science); Transmission (telecommunications); Stream Control Transmission Protocol; Telecommunications; Layer (electronics); Path (computing); Channel (broadcasting)","score_opus":0.025390735991337312,"score_gpt":0.2515380965193114,"score_spread":0.2261473605279741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231417998","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001933336,0.0002692979,0.8765247,0.0026095393,0.0023456004,0.00019043083,3.0699866e-7,0.00022362193,0.11781716],"genre_scores_gemma":[0.089829214,0.003900556,0.6450314,0.005685825,0.01131545,0.000059886563,0.000014136177,0.00017327582,0.24399024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970718,0.00004563269,0.0004911797,0.0012633726,0.0006668875,0.00046115185],"domain_scores_gemma":[0.9967816,0.00009257684,0.00023385894,0.0024482768,0.00028838168,0.00015531531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016247648,0.0003428116,0.0003751876,0.0006839752,0.00032117087,0.0005551905,0.00429318,0.00013558532,0.00011938782],"category_scores_gemma":[0.00004652682,0.00036141774,0.00009003479,0.00051383296,0.00052324607,0.00056500913,0.0027705997,0.0006537575,0.00032884345],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.4574476e-7,0.0000059109443,0.000004588429,0.000005760657,0.0000025477054,0.0000041694243,0.00009472622,0.00036221385,0.000041422616,0.6577414,0.000905912,0.34083065],"study_design_scores_gemma":[0.0002148109,0.00008881102,0.0003453376,0.00018345566,0.0000034335374,0.00003409701,2.3805808e-7,0.2641446,0.00023247776,0.015358213,0.71869177,0.000702753],"about_ca_topic_score_codex":0.0000023660823,"about_ca_topic_score_gemma":0.000020972071,"teacher_disagreement_score":0.7177859,"about_ca_system_score_codex":0.00032081833,"about_ca_system_score_gemma":0.00028625934,"threshold_uncertainty_score":0.9998838},"labels":[],"label_agreement":null},{"id":"W4231996376","doi":"10.2139/ssrn.3557599","title":"Improved S-AF and S-DF Relaying Schemes using Machine Learning based Power Allocation over Cascaded Rayleigh Fading Channels","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Lakehead University","funders":"Science Foundation Ireland","keywords":"Rayleigh fading; Fading; Computer science; Relay; Fading distribution; Channel (broadcasting); Rayleigh scattering; Electronic engineering; Signal-to-noise ratio (imaging); Transmission (telecommunications); Algorithm; Telecommunications; Power (physics); Topology (electrical circuits); Engineering; Electrical engineering; Physics","score_opus":0.027145412129027248,"score_gpt":0.26361486449982313,"score_spread":0.2364694523707959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231996376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20172223,0.0061089206,0.7882554,0.0035072302,0.000117433425,0.000127387,2.1067872e-7,0.000100487945,0.000060736013],"genre_scores_gemma":[0.99278855,0.002084618,0.0041312664,0.0007769509,0.00012510158,0.0000029291482,0.000002276862,0.000021994894,0.0000663009],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786055,0.00026610267,0.00031245113,0.00032057954,0.00021028453,0.0010300308],"domain_scores_gemma":[0.99918395,0.00009676788,0.00023114837,0.00021218673,0.0001246714,0.00015129235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011895542,0.00019322138,0.00020254926,0.00012075897,0.0007577602,0.00032063798,0.0005509938,0.00006992601,0.000020477702],"category_scores_gemma":[0.00018233455,0.00018507392,0.00007431481,0.00046974988,0.000031990126,0.0006747984,0.00024883682,0.0019062011,0.0000031042298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025628717,0.00017436685,0.008639998,0.00005855315,0.0006228056,0.000026739881,0.011701345,0.03824937,0.56891024,0.22191904,0.000066749766,0.14937449],"study_design_scores_gemma":[0.0008835107,0.00018569436,0.00007870759,0.000044204895,0.000013978536,0.00009262259,0.00014789858,0.9937277,0.0024241586,0.0008678999,0.0012915266,0.00024212926],"about_ca_topic_score_codex":0.000013773398,"about_ca_topic_score_gemma":0.000029548315,"teacher_disagreement_score":0.9554783,"about_ca_system_score_codex":0.0003752024,"about_ca_system_score_gemma":0.0006148871,"threshold_uncertainty_score":0.82816017},"labels":[],"label_agreement":null},{"id":"W4232155289","doi":"10.36227/techrxiv.12107199","title":"Improved S-AF and S-DF Relaying Schemes using Machine Learning based Power Allocation over Cascaded Rayleigh Fading Channels","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Lakehead University","funders":"Science Foundation Ireland","keywords":"Rayleigh fading; Fading; Relay; Computer science; Rayleigh scattering; Channel (broadcasting); Fading distribution; Electronic engineering; Telecommunications; Algorithm; Transmission (telecommunications); Power (physics); Topology (electrical circuits); Engineering; Electrical engineering; Physics","score_opus":0.06413020189952355,"score_gpt":0.29862880150191323,"score_spread":0.23449859960238967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232155289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048012838,0.002106341,0.9448664,0.0028511498,0.00052297843,0.00052180054,0.0000018642008,0.00051393954,0.0006026944],"genre_scores_gemma":[0.92462987,0.00041529202,0.07350509,0.0010611509,0.00009607631,0.000028338265,0.000035102094,0.000039851544,0.00018925697],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974845,0.0003787188,0.0005135615,0.0009693415,0.00028612048,0.00036775018],"domain_scores_gemma":[0.9981029,0.0002410485,0.00037062206,0.0008822133,0.00021335745,0.00018985369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065225933,0.00043704585,0.00046130677,0.00023994813,0.00058171764,0.00078211055,0.0010711751,0.00026163534,0.00008982378],"category_scores_gemma":[0.0002521736,0.00043603158,0.00012857419,0.00045396088,0.000057249366,0.00045169695,0.0034247309,0.0013793196,0.000005783098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020030036,0.00038580966,0.0074158013,0.0010257332,0.0009758524,0.00007955395,0.023898872,0.19375816,0.6096745,0.07315834,0.00067796494,0.08874911],"study_design_scores_gemma":[0.00049202424,0.0000366467,0.00016175135,0.00024320994,0.000020089348,0.000005640432,0.000030577106,0.9899292,0.006547293,0.00017901041,0.0018487042,0.0005058288],"about_ca_topic_score_codex":0.000092215254,"about_ca_topic_score_gemma":0.00001957511,"teacher_disagreement_score":0.876617,"about_ca_system_score_codex":0.00016899807,"about_ca_system_score_gemma":0.0001959459,"threshold_uncertainty_score":0.99980915},"labels":[],"label_agreement":null},{"id":"W4232680094","doi":"10.1109/hotmobile.2007.11","title":"Trade: Cooperation without Trust in 802.11 Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Negotiation; Nash equilibrium; Network packet; Game theory; Wireless network; Wireless; Computer network; Scheme (mathematics); Throughput; Computer security; Microeconomics; Telecommunications; Economics","score_opus":0.03303836967117973,"score_gpt":0.28953743398390613,"score_spread":0.2564990643127264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232680094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021373652,0.00020736255,0.9617399,0.0012851515,0.00017954972,0.00014981175,6.12149e-8,0.00014464292,0.0149198985],"genre_scores_gemma":[0.98296636,0.00019162455,0.014926876,0.0013536301,0.00006546895,0.000006041042,0.000003035527,0.000005831449,0.00048113638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990684,0.00008416563,0.00026625264,0.0002229325,0.0001092379,0.00024901307],"domain_scores_gemma":[0.9992785,0.00008811527,0.000037779453,0.00048573135,0.000038713475,0.00007114516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008041749,0.00010056803,0.000115469535,0.00010310968,0.00012126036,0.00012614774,0.0006042279,0.000058089958,0.00005484127],"category_scores_gemma":[0.000023865774,0.000090267815,0.000025459367,0.0007369609,0.000027509035,0.00038875663,0.00015015899,0.00016927777,0.000015467645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001327014,0.00015062882,0.051756874,0.0000023869206,0.0000071695026,0.000011516354,0.0014648492,0.0044474043,0.00068990013,0.5734498,0.0029290717,0.36507717],"study_design_scores_gemma":[0.0005772355,0.000037816928,0.07006214,0.000024002677,0.0000013663281,0.0000093764575,0.00004286923,0.9156539,0.00073806575,0.00008206418,0.012534731,0.00023647182],"about_ca_topic_score_codex":0.00001018033,"about_ca_topic_score_gemma":0.0013402903,"teacher_disagreement_score":0.96159273,"about_ca_system_score_codex":0.00005154601,"about_ca_system_score_gemma":0.000028587703,"threshold_uncertainty_score":0.36810145},"labels":[],"label_agreement":null},{"id":"W4232955590","doi":"10.1109/jsac.2012.120901","title":"Guest Editorial Theories and Methods for Advanced Wireless Relays — Issue I","year":2012,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Wireless; Telecommunications; Computer network","score_opus":0.028693618622169254,"score_gpt":0.38480298849992683,"score_spread":0.3561093698777576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232955590","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012290936,0.007218912,0.09089599,0.0015618674,0.89870036,0.00070062786,0.000026559159,0.0001302502,0.00075317535],"genre_scores_gemma":[0.0007286652,0.04313222,0.109497055,0.0000984425,0.84562373,0.00040054828,0.000127926,0.000065704306,0.00032568685],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994918,0.0025999914,0.0009633382,0.00044297348,0.00051413703,0.0005615607],"domain_scores_gemma":[0.9805124,0.01318992,0.0008028392,0.0029822509,0.0022521578,0.00026046892],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0034404418,0.00046767743,0.0007195478,0.00046471707,0.001318847,0.00060366315,0.005180944,0.0007264156,0.00000884346],"category_scores_gemma":[0.0035210364,0.0004450444,0.00013668678,0.0011093704,0.00023102804,0.0007806155,0.00083066,0.003895378,0.000009489919],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074925905,0.00024434127,0.00000848349,0.000019549396,0.0000803573,5.7658826e-7,0.0010949943,0.000019683339,0.0003511068,0.012446234,0.91867656,0.066983186],"study_design_scores_gemma":[0.0010585446,0.00019916853,0.000014527553,0.00042785096,0.00004050231,0.000013892453,0.000030995667,0.0019648147,0.00018160304,0.002370081,0.9932305,0.0004674838],"about_ca_topic_score_codex":0.0000046828845,"about_ca_topic_score_gemma":0.00010932843,"teacher_disagreement_score":0.074553974,"about_ca_system_score_codex":0.0003987723,"about_ca_system_score_gemma":0.0007484365,"threshold_uncertainty_score":0.9999813},"labels":[],"label_agreement":null},{"id":"W4233077163","doi":"10.36227/techrxiv.12107199.v1","title":"Improved S-AF and S-DF Relaying Schemes using Machine Learning based Power Allocation over Cascaded Rayleigh Fading Channels","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Rayleigh fading; Fading; Relay; Computer science; Rayleigh scattering; Channel (broadcasting); Telecommunications; Maximal-ratio combining; Algorithm; Transmission (telecommunications); Power (physics); Electronic engineering; Topology (electrical circuits); Mathematics; Engineering; Physics; Combinatorics","score_opus":0.06413020189952355,"score_gpt":0.29862880150191323,"score_spread":0.23449859960238967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233077163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048012838,0.002106341,0.9448664,0.0028511498,0.00052297843,0.00052180054,0.0000018642008,0.00051393954,0.0006026944],"genre_scores_gemma":[0.92462987,0.00041529202,0.07350509,0.0010611509,0.00009607631,0.000028338265,0.000035102094,0.000039851544,0.00018925697],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974845,0.0003787188,0.0005135615,0.0009693415,0.00028612048,0.00036775018],"domain_scores_gemma":[0.9981029,0.0002410485,0.00037062206,0.0008822133,0.00021335745,0.00018985369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065225933,0.00043704585,0.00046130677,0.00023994813,0.00058171764,0.00078211055,0.0010711751,0.00026163534,0.00008982378],"category_scores_gemma":[0.0002521736,0.00043603158,0.00012857419,0.00045396088,0.000057249366,0.00045169695,0.0034247309,0.0013793196,0.000005783098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020030036,0.00038580966,0.0074158013,0.0010257332,0.0009758524,0.00007955395,0.023898872,0.19375816,0.6096745,0.07315834,0.00067796494,0.08874911],"study_design_scores_gemma":[0.00049202424,0.0000366467,0.00016175135,0.00024320994,0.000020089348,0.000005640432,0.000030577106,0.9899292,0.006547293,0.00017901041,0.0018487042,0.0005058288],"about_ca_topic_score_codex":0.000092215254,"about_ca_topic_score_gemma":0.00001957511,"teacher_disagreement_score":0.876617,"about_ca_system_score_codex":0.00016899807,"about_ca_system_score_gemma":0.0001959459,"threshold_uncertainty_score":0.99980915},"labels":[],"label_agreement":null},{"id":"W4233970119","doi":"10.1109/wmcsa.2007.4389559","title":"Trade: Cooperation without Trust in 802.11 Networks","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Business","score_opus":0.02739938445735489,"score_gpt":0.2770628514116156,"score_spread":0.24966346695426067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233970119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2695202,0.0008149691,0.6977081,0.0032586788,0.00036577779,0.00049430726,2.0196711e-7,0.00043295283,0.027404828],"genre_scores_gemma":[0.9901361,0.00022065964,0.0085275965,0.00081141817,0.000116923315,0.000014744693,0.0000016767942,0.000009768717,0.00016110709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895585,0.000012646808,0.0002860131,0.00028562592,0.0001461646,0.00031368583],"domain_scores_gemma":[0.9995263,0.00003864809,0.00007126668,0.00018085797,0.000097582546,0.00008529493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092233595,0.0001269329,0.00013960381,0.0001391658,0.00015591769,0.00021645891,0.0006706132,0.00007304938,0.00001331328],"category_scores_gemma":[0.000056534453,0.00012354867,0.000027771535,0.0009587961,0.00003527928,0.0006846012,0.00017498872,0.00023566213,0.000009908148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034833476,0.00020765846,0.21152246,0.000019025521,0.000012608606,0.000007322737,0.00784884,0.0004396216,0.004580703,0.44538224,0.004600515,0.32534418],"study_design_scores_gemma":[0.0012063861,0.00010701167,0.13110238,0.00014371204,0.0000056368567,0.000035152985,0.000204475,0.8230286,0.0035803693,0.00038607794,0.03960917,0.0005910041],"about_ca_topic_score_codex":0.0000040247264,"about_ca_topic_score_gemma":0.00007758027,"teacher_disagreement_score":0.822589,"about_ca_system_score_codex":0.00007354135,"about_ca_system_score_gemma":0.000024111629,"threshold_uncertainty_score":0.50381684},"labels":[],"label_agreement":null},{"id":"W4235157584","doi":"10.4108/icst.qshine2008.3838","title":"Receiver Initiated MAC Design for Ad Hoc Networks Based on Multiuser Detection","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Code division multiple access; Multiuser detection; Computer science; Computer network; Network packet; Physical layer; Wireless ad hoc network; Code (set theory); Wireless; Division (mathematics); Telecommunications","score_opus":0.14282802651812657,"score_gpt":0.29603111617968547,"score_spread":0.1532030896615589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235157584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007870889,0.00020396497,0.996135,0.0003996143,0.00020949297,0.00037608208,3.516607e-7,0.00027045808,0.0016179725],"genre_scores_gemma":[0.9092831,0.00068984303,0.08737246,0.0019173686,0.00003647823,0.00008454761,0.0000043858295,0.0000109143175,0.0006009042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990575,0.00021101665,0.00016115993,0.00025970206,0.00011176039,0.0001989058],"domain_scores_gemma":[0.9986766,0.00049863604,0.000052685802,0.0005267502,0.00018032813,0.00006499866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002839955,0.000118193784,0.000106018575,0.00009162487,0.00042072393,0.00005339626,0.00046963632,0.00006482937,0.00004266791],"category_scores_gemma":[0.00006489825,0.0001048801,0.00005569045,0.00041659392,0.000030153471,0.00021285424,0.000070312206,0.00013163795,0.000029563203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031765384,0.0002969884,0.00013744076,0.0000059001477,0.000034276636,0.00000985428,0.0006266301,0.20350355,0.0018372984,0.0027921419,0.012957088,0.7774812],"study_design_scores_gemma":[0.00069095055,0.00020596886,0.0009820334,0.000014057261,0.0000021046906,0.000002756901,0.0000027378765,0.9804567,0.003678512,0.00003838738,0.013778049,0.00014775254],"about_ca_topic_score_codex":9.453141e-7,"about_ca_topic_score_gemma":0.000022350787,"teacher_disagreement_score":0.9087625,"about_ca_system_score_codex":0.000051627405,"about_ca_system_score_gemma":0.00003985484,"threshold_uncertainty_score":0.42768863},"labels":[],"label_agreement":null},{"id":"W4235530555","doi":"10.22215/etd/2013-09722","title":"Design and analysis of random linear network coding schemes : dense codes, chunked codes and overlapped chunked codes","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Mathematics; Coding (social sciences); Statistics","score_opus":0.03261230630722935,"score_gpt":0.2893537442863052,"score_spread":0.2567414379790759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235530555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13532743,0.009906026,0.8514616,0.00012855824,0.00021917978,0.0011340444,0.00001215503,0.0002398344,0.0015711625],"genre_scores_gemma":[0.7380766,0.024378764,0.23189914,0.00024019893,0.00010359809,0.00014941988,0.0007760053,0.000055413282,0.004320818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683225,0.00064992637,0.00090735935,0.00077748945,0.00039872742,0.0004342579],"domain_scores_gemma":[0.99596024,0.0015969764,0.00063829793,0.0010116453,0.00059797795,0.00019484859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012856217,0.0005187333,0.0014132219,0.00051037624,0.0005582321,0.00040954773,0.0009244952,0.00030945856,0.000118635835],"category_scores_gemma":[0.00019394372,0.0004652181,0.00019574442,0.0016795571,0.00014704211,0.00040675653,0.0003524031,0.0003841023,0.0000048956285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003947424,0.0010954492,0.013368157,0.0017772388,0.030186083,0.000039273036,0.04404668,0.028666237,0.12319789,0.2770313,0.019289637,0.4573546],"study_design_scores_gemma":[0.0016136834,0.00007944282,0.005416251,0.00031564423,0.0008741915,0.000002689987,0.00026324694,0.986715,0.002965257,0.0002619289,0.0008248423,0.0006678204],"about_ca_topic_score_codex":0.000045612625,"about_ca_topic_score_gemma":0.00051544636,"teacher_disagreement_score":0.95804876,"about_ca_system_score_codex":0.000041426807,"about_ca_system_score_gemma":0.0001585093,"threshold_uncertainty_score":0.99977994},"labels":[],"label_agreement":null},{"id":"W4235593492","doi":"10.22215/etd/2011-09077","title":"Adaptive random linear network coding with controlled forwarding for wireless broadcast","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Computer science; Computer network; Linear network coding; Telecommunications; Network packet","score_opus":0.03862058077807802,"score_gpt":0.27764984636815193,"score_spread":0.23902926559007392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235593492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055618817,0.0013892117,0.9539916,0.00006368886,0.00077095313,0.0022157754,0.000003207917,0.0002808108,0.040728558],"genre_scores_gemma":[0.7049796,0.0036455046,0.22978024,0.0007124741,0.0012692894,0.0025449877,0.0005371264,0.00019691553,0.056333866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977967,0.00019779528,0.0005759508,0.00063783955,0.00027366035,0.00051806396],"domain_scores_gemma":[0.9969539,0.0008266453,0.000517704,0.00081584626,0.00075496285,0.00013091326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074368756,0.0004674532,0.0010465863,0.00015201657,0.00068906555,0.00022715141,0.0013441361,0.00021938595,0.000051612886],"category_scores_gemma":[0.00005758148,0.00035552267,0.0003059086,0.0004618492,0.000035053145,0.00037536077,0.00013960747,0.00039345387,0.000016507354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015031159,0.00019794598,0.000062117535,0.00016097464,0.0015470688,0.000012225626,0.0061145816,0.0019903628,0.00024209158,0.61952436,0.0072228033,0.3478943],"study_design_scores_gemma":[0.026716067,0.0006487668,0.000066036635,0.0012543037,0.000264034,0.000009336658,0.0006377744,0.95647496,0.0008765884,0.001249424,0.010429878,0.0013728263],"about_ca_topic_score_codex":0.000011658194,"about_ca_topic_score_gemma":0.00045615868,"teacher_disagreement_score":0.9544846,"about_ca_system_score_codex":0.000059384325,"about_ca_system_score_gemma":0.0002358502,"threshold_uncertainty_score":0.9998897},"labels":[],"label_agreement":null},{"id":"W4237240213","doi":"10.1109/glocom.2014.7417073","title":"HePNC: A Cross-Layer Design for MIMO Networks with Asymmetric Two-Way Relay Channel","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Goodput; MIMO; Computer science; Linear network coding; Physical layer; Computer network; Multi-user MIMO; Relay; Channel state information; 3G MIMO; Automatic repeat request; Bottleneck; Topology (electrical circuits); Channel (broadcasting); Throughput; Telecommunications; Wireless; Telecommunications link; Hybrid automatic repeat request; Network packet; Engineering","score_opus":0.11292741998199156,"score_gpt":0.3525288146239141,"score_spread":0.23960139464192254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237240213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061624596,0.0018068769,0.976673,0.004328139,0.00042943025,0.0010641435,0.00002182906,0.0004265197,0.014633819],"genre_scores_gemma":[0.8335405,0.0013677591,0.16311467,0.0010144375,0.00010069272,0.00043057895,0.000050937113,0.000027906946,0.00035251913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961129,0.0011382283,0.00072911946,0.0007852183,0.00041085042,0.0008237219],"domain_scores_gemma":[0.99020475,0.0011556912,0.00045788052,0.006195032,0.0016230606,0.00036361333],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001900273,0.0005036815,0.00055662624,0.0001968653,0.00143191,0.0010285787,0.007821388,0.00020169443,0.000022549919],"category_scores_gemma":[0.00030641712,0.00046090232,0.00016760408,0.0021257994,0.0004495318,0.0009448647,0.0014315394,0.0005602192,0.00012562843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016424512,0.00075301284,0.0026154916,0.000029232628,0.00024372907,0.0000021379838,0.0005685036,0.067514315,0.00008858857,0.7154809,0.032278612,0.18026122],"study_design_scores_gemma":[0.0017053726,0.00030431396,0.0018822642,0.00011071056,0.000037296955,0.000028628616,0.000027614622,0.9563092,0.00009479486,0.0030861285,0.035750724,0.00066294294],"about_ca_topic_score_codex":0.00010532392,"about_ca_topic_score_gemma":0.0008148602,"teacher_disagreement_score":0.8887949,"about_ca_system_score_codex":0.00028896175,"about_ca_system_score_gemma":0.0003551469,"threshold_uncertainty_score":0.9998681},"labels":[],"label_agreement":null},{"id":"W4237254342","doi":"10.32920/ryerson.14652171.v1","title":"Cooperative Subcarrier and Power Allocation in OFDM Based Relaying Systems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Subcarrier; Computer science; Orthogonal frequency-division multiplexing; Resource allocation; Wireless; Relay; Orthogonal frequency-division multiple access; Computer network; Fading; WiMAX; Throughput; Channel (broadcasting); Power (physics); Telecommunications","score_opus":0.038977017698157215,"score_gpt":0.2803537858612732,"score_spread":0.24137676816311598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237254342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066138424,0.0075979107,0.9112661,0.0029874053,0.00089894334,0.0007363217,0.0000020521813,0.00018823931,0.010184627],"genre_scores_gemma":[0.98905975,0.00070451555,0.009113901,0.000559836,0.000019370838,0.00010261294,0.000029289025,0.0000117602995,0.00039898205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980234,0.000570118,0.00039494285,0.0006188416,0.00020257325,0.00019015736],"domain_scores_gemma":[0.9981221,0.00019602991,0.00012059568,0.0010921191,0.00038974156,0.00007943314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066670973,0.00022309994,0.00032076205,0.00017810152,0.00013267598,0.00081994926,0.00072515395,0.00017981918,0.000039444854],"category_scores_gemma":[0.00010873673,0.00021559009,0.00004275879,0.00043250146,0.000042623276,0.00029372153,0.0016278928,0.00058646535,0.0000046423997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045022905,0.000645295,0.018282607,0.00062295236,0.0002911237,0.00016951645,0.034709148,0.22202472,0.00629429,0.6699262,0.0038944504,0.043094672],"study_design_scores_gemma":[0.00037378422,0.000025113148,0.0036393537,0.0005564806,0.000004879522,0.0000052560754,0.0004402896,0.9927522,0.00036918177,0.000047381607,0.0013831501,0.0004029581],"about_ca_topic_score_codex":0.0000660141,"about_ca_topic_score_gemma":0.00022705457,"teacher_disagreement_score":0.9229213,"about_ca_system_score_codex":0.00013538767,"about_ca_system_score_gemma":0.0003655544,"threshold_uncertainty_score":0.87915087},"labels":[],"label_agreement":null},{"id":"W4239390621","doi":"10.4108/icst.qshine2008.3859","title":"Isolation Band based Frequency Reuse Scheme for IEEE 802.16j Wireless Relay Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"Beijing Jiaotong University; National Natural Science Foundation of China","keywords":"Relay; Computer science; Computer network; Base station; IEEE 802; Mobile station; Wireless; Reuse; Throughput; WiMAX; Isolation (microbiology); Scheme (mathematics); Telecommunications; Engineering","score_opus":0.054590866845703356,"score_gpt":0.273320334417739,"score_spread":0.21872946757203565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239390621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021980386,0.00025491876,0.97206897,0.0019860421,0.000311557,0.0002934096,7.048584e-7,0.0002476894,0.002856329],"genre_scores_gemma":[0.77815855,0.00033106157,0.21954301,0.0010699601,0.000108320164,0.000054067044,0.0000096103195,0.000011714794,0.0007137284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988547,0.000109815584,0.00028600704,0.00033642887,0.0001483962,0.000264631],"domain_scores_gemma":[0.99793476,0.00030177913,0.00009600937,0.0013189331,0.00025442668,0.000094110546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003380475,0.00014671612,0.00015870578,0.00007890407,0.00054177514,0.000088077446,0.0012247709,0.00008949491,0.000050117007],"category_scores_gemma":[0.00007448523,0.0001358289,0.00008019469,0.00047313824,0.000051983232,0.00048280385,0.0001252595,0.00017233707,0.000019419205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016955969,0.0009686578,0.042519335,0.000074564414,0.00018233668,0.000036502406,0.004137714,0.042151436,0.07000738,0.49243116,0.2609048,0.08641657],"study_design_scores_gemma":[0.00056387216,0.000063545245,0.0011051412,0.000024009618,0.000002620429,0.0000057846555,0.0000034013106,0.9927731,0.0019231585,0.00022342574,0.003104838,0.00020709203],"about_ca_topic_score_codex":0.000006459254,"about_ca_topic_score_gemma":0.000037147947,"teacher_disagreement_score":0.95062166,"about_ca_system_score_codex":0.000055747278,"about_ca_system_score_gemma":0.00010215073,"threshold_uncertainty_score":0.55389416},"labels":[],"label_agreement":null},{"id":"W4240810786","doi":"10.32920/14641158","title":"Estimation of Distribution Algorithm for Resource Allocation in Green Cooperative Cognitive Radio Sensor Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Throughput; Resource allocation; Heuristic; Mathematical optimization; Cognitive radio; Optimization problem; Power (physics); Computer network; Wireless; Algorithm; Mathematics; Telecommunications","score_opus":0.03512432149975918,"score_gpt":0.29547106259853056,"score_spread":0.2603467410987714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240810786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022340931,0.0007303565,0.99454,0.0008160727,0.0001710606,0.0011493199,0.000050575378,0.000082576815,0.00022595114],"genre_scores_gemma":[0.8252059,0.0007065881,0.16882291,0.00019690175,0.000098762495,0.00037711542,0.00427621,0.000019912997,0.0002956951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978005,0.00051632564,0.00062658126,0.0006079602,0.00021343866,0.0002351831],"domain_scores_gemma":[0.9974137,0.00064038986,0.00034593404,0.0006659248,0.00087156275,0.00006247089],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007353936,0.00026092198,0.0004463161,0.00012032666,0.00013682783,0.00018350332,0.0006567171,0.00025141035,0.000011197531],"category_scores_gemma":[0.0002262531,0.00027385415,0.00011965622,0.0006061206,0.000076773154,0.0002794404,0.00096066,0.0004653017,0.0000011793273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015026512,0.0001400999,0.000029032582,0.000045076213,0.000061008886,0.0000019650302,0.0014116036,0.110826,0.000028365484,0.0069189765,0.00025789684,0.88026494],"study_design_scores_gemma":[0.00059265713,0.000059478498,0.00078368955,0.0005000688,0.000020673295,0.0000031677025,0.00022783701,0.99583995,0.0013992413,0.00012043593,0.00017942525,0.00027335814],"about_ca_topic_score_codex":0.00006306005,"about_ca_topic_score_gemma":0.00015593624,"teacher_disagreement_score":0.885014,"about_ca_system_score_codex":0.00020506619,"about_ca_system_score_gemma":0.00024359641,"threshold_uncertainty_score":0.9999714},"labels":[],"label_agreement":null},{"id":"W4240904679","doi":"10.7287/peerj-cs.89v0.2/reviews/2","title":"Peer Review #2 of \"TCP adaptation with network coding and opportunistic data forwarding in multi-hop wireless networks (v0.2)\"","year":2016,"lang":"en","type":"peer-review","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer network; Hop (telecommunications); Computer science; Coding (social sciences); Wireless network; Wireless; Telecommunications; Mathematics","score_opus":0.21832418119109975,"score_gpt":0.36729681981783,"score_spread":0.14897263862673027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240904679","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.4827375e-7,0.22507668,0.7225079,0.04778625,0.000468954,0.0008995196,0.000043503045,0.000069972666,0.0031469848],"genre_scores_gemma":[0.00092660874,0.9077314,0.032763284,0.005410841,0.00020753476,0.00008985645,0.0013225076,0.000048802453,0.051499125],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99581975,0.00060095114,0.0011792958,0.0010012935,0.00089983304,0.0004988976],"domain_scores_gemma":[0.9935147,0.00078702066,0.0008956139,0.0029848116,0.0016421482,0.00017571023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0052566035,0.00049002253,0.0013426405,0.00014591581,0.00018543862,0.00012914077,0.0029726252,0.0001795081,0.0001115026],"category_scores_gemma":[0.0007173923,0.00035365674,0.00008334418,0.00097585237,0.0001262354,0.00065658364,0.0025702238,0.0006154261,0.0000052761307],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004726703,0.00002901965,0.000031172116,0.0049692844,0.000057796955,0.000009470249,0.00004517644,0.00010749977,6.954601e-7,0.0054090526,0.637861,0.35147512],"study_design_scores_gemma":[0.0003511112,0.00003392566,0.000030294865,0.117538996,0.000082383216,0.000016345622,0.00000690359,0.34852657,2.152121e-7,0.0000135639075,0.5329901,0.00040961112],"about_ca_topic_score_codex":0.00003625457,"about_ca_topic_score_gemma":0.000713436,"teacher_disagreement_score":0.6897446,"about_ca_system_score_codex":0.0000905818,"about_ca_system_score_gemma":0.0003749523,"threshold_uncertainty_score":0.9998915},"labels":[],"label_agreement":null},{"id":"W4241040395","doi":"10.1109/glocom.2014.7417825","title":"A Signal Space Diversity-Based Time Division Broadcast Protocol in Two-Way Relay Systems","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Carleton University","funders":"","keywords":"Relay; Computer science; Spectral efficiency; Constellation; Antenna diversity; Expression (computer science); Transmission (telecommunications); Topology (electrical circuits); Constellation diagram; Diversity gain; Signal-to-noise ratio (imaging); Algorithm; Decoding methods; Bit error rate; Telecommunications; Mathematics; Wireless; Fading; Physics; Beamforming","score_opus":0.06137932964296516,"score_gpt":0.3382538798012566,"score_spread":0.27687455015829143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241040395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026148877,0.00028300597,0.91847706,0.008006122,0.00031591684,0.020200314,0.000040565214,0.0006555901,0.049406536],"genre_scores_gemma":[0.97984546,0.000048373255,0.014349303,0.00039024363,0.000033397824,0.0050304667,0.000035102083,0.000014124958,0.00025353496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553484,0.0020683536,0.00067342824,0.0006208236,0.0005493052,0.00055322703],"domain_scores_gemma":[0.9934386,0.00046268996,0.00038202916,0.0047733104,0.00067242864,0.0002709296],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016049106,0.00038359006,0.0004786825,0.00020227548,0.001089827,0.000597902,0.007299024,0.00013187989,0.00008668449],"category_scores_gemma":[0.00012454446,0.00038926318,0.000121917576,0.0013713145,0.0002938414,0.0007661275,0.004211707,0.00058429857,0.0006553336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110396504,0.0019012499,0.034887265,0.0001067309,0.00008903249,0.000010373962,0.0013730197,0.021085037,0.0013948196,0.78448224,0.026656881,0.12790295],"study_design_scores_gemma":[0.0018107836,0.000120463395,0.0035738896,0.0003252468,0.0000097642815,0.0000071399395,0.00003535023,0.9374236,0.00005952388,0.0009890585,0.05513792,0.00050727173],"about_ca_topic_score_codex":0.00056588516,"about_ca_topic_score_gemma":0.00092727906,"teacher_disagreement_score":0.97723055,"about_ca_system_score_codex":0.00046384818,"about_ca_system_score_gemma":0.00033800988,"threshold_uncertainty_score":0.99985594},"labels":[],"label_agreement":null},{"id":"W4241284303","doi":"10.22215/etd/2010-09304","title":"Security enabled relay selection in cooperative communication networks","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Relay; Selection (genetic algorithm); Computer science; Telecommunications; Political science; Humanities; Physics; Art; Artificial intelligence; Power (physics)","score_opus":0.01409297368487195,"score_gpt":0.27973488723918294,"score_spread":0.265641913554311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241284303","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22759624,0.011780442,0.29655668,0.0037963174,0.004620479,0.005442729,0.0000060980046,0.0026520093,0.447549],"genre_scores_gemma":[0.977686,0.00606271,0.0049175736,0.00032186857,0.00008444768,0.00021063203,0.00050047284,0.000034671422,0.0101816105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764514,0.0006309823,0.00058434287,0.0005583084,0.00024280652,0.00033844495],"domain_scores_gemma":[0.99771863,0.00026583142,0.00029280144,0.0010790693,0.00055341143,0.00009027515],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008356082,0.0003449425,0.0003965168,0.00032106647,0.00045533848,0.0003712667,0.0018899115,0.00060677173,0.0002395009],"category_scores_gemma":[0.00012719445,0.0003454314,0.00008706625,0.001393754,0.000036234225,0.000683696,0.0002710031,0.0023185904,0.00004518836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016902042,0.0009263866,0.0011910148,0.00009696983,0.0001649341,0.000010047297,0.019764002,0.020153053,0.005195352,0.82541704,0.01787668,0.10903551],"study_design_scores_gemma":[0.0008322873,0.00008543048,0.0077195344,0.00031455467,0.000016899126,0.000008259045,0.00035842822,0.97170556,0.0018017127,0.0011129227,0.015125238,0.00091916905],"about_ca_topic_score_codex":0.000100439516,"about_ca_topic_score_gemma":0.0475737,"teacher_disagreement_score":0.9515525,"about_ca_system_score_codex":0.00016740212,"about_ca_system_score_gemma":0.00024000631,"threshold_uncertainty_score":0.9999831},"labels":[],"label_agreement":null},{"id":"W4241325718","doi":"10.22215/etd/2012-09755","title":"Scheduling algorithms for OFDMA relay enhanced cellular networks","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; University of Calgary; Library and Archives Canada","funders":"","keywords":"Relay; Computer science; Scheduling (production processes); Computer network; Algorithm; Mathematics; Mathematical optimization; Physics","score_opus":0.040338860457505565,"score_gpt":0.30665176076197126,"score_spread":0.2663129003044657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241325718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014252631,0.008722568,0.97881746,0.00018452405,0.002522752,0.00054155954,0.0000013466916,0.00026125237,0.0075232787],"genre_scores_gemma":[0.57019,0.006829258,0.35412845,0.00054565043,0.0016175163,0.0009301454,0.0011240211,0.000115349525,0.064519584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983647,0.00009179201,0.00041923742,0.00047593808,0.00020194869,0.00044638253],"domain_scores_gemma":[0.99806553,0.00021985873,0.0002634678,0.00092452974,0.0003942546,0.00013234756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045319606,0.0003104703,0.00034086168,0.0001245289,0.00039544638,0.00021267522,0.0014564098,0.0003201575,0.00013486043],"category_scores_gemma":[0.000045168952,0.0002954751,0.00018878377,0.0003870151,0.000014595127,0.00037938904,0.00016819364,0.00042459276,0.00003674355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026169702,0.00013452106,0.000010932688,0.00009241415,0.00014196371,8.0452986e-7,0.0020960849,0.00377053,0.016317222,0.109238386,0.0021754543,0.8659955],"study_design_scores_gemma":[0.00044005658,0.000049183167,0.00014831296,0.00026405754,0.00004726941,6.4078864e-7,0.00011891064,0.95092094,0.033964563,0.00024351873,0.013067023,0.0007355391],"about_ca_topic_score_codex":0.0000037895113,"about_ca_topic_score_gemma":0.00007076523,"teacher_disagreement_score":0.9471504,"about_ca_system_score_codex":0.00005711722,"about_ca_system_score_gemma":0.00009410728,"threshold_uncertainty_score":0.99994975},"labels":[],"label_agreement":null},{"id":"W4241379243","doi":"10.32920/ryerson.14658036.v1","title":"Enhancing the Spatial Reusability Offered by Smart Beamforming Antennas in Multi-hop Wireless Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Beamforming; Computer science; Computer network; Smart antenna; Wireless; Wireless network; Directional antenna; Distributed computing; Telecommunications; Antenna (radio)","score_opus":0.04355865672811293,"score_gpt":0.28695841012458734,"score_spread":0.2433997533964744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241379243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06656257,0.0014113389,0.92816144,0.0018642837,0.0008846011,0.00056127756,0.0000017999852,0.00016094504,0.0003917299],"genre_scores_gemma":[0.97395635,0.0019345202,0.022763927,0.0007294429,0.00008271544,0.00011597937,0.000051947212,0.00002061817,0.00034452448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965141,0.00090065284,0.0008378565,0.0009403764,0.00030717897,0.00049987936],"domain_scores_gemma":[0.99591786,0.0005968271,0.00025836754,0.002834081,0.00028929504,0.000103557686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018001726,0.00038818337,0.00054261007,0.00008075206,0.00036754395,0.00068492896,0.0032178846,0.00029236524,0.00006111598],"category_scores_gemma":[0.00021862127,0.00030379553,0.00017978932,0.0005467876,0.000116795556,0.00028235995,0.007560772,0.0017047777,0.000004544984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052771473,0.0012717163,0.014109824,0.00023713292,0.00025063078,0.000042369586,0.017678617,0.016224457,0.016909258,0.005417961,0.0017262392,0.92607903],"study_design_scores_gemma":[0.0003196473,0.000013729261,0.004112408,0.00037019546,0.0000064512265,0.0000039290294,0.00022952576,0.991584,0.0022469517,0.000043598284,0.0006483169,0.00042122975],"about_ca_topic_score_codex":0.0010059109,"about_ca_topic_score_gemma":0.020298552,"teacher_disagreement_score":0.97535956,"about_ca_system_score_codex":0.00024357243,"about_ca_system_score_gemma":0.00027775217,"threshold_uncertainty_score":0.9999414},"labels":[],"label_agreement":null},{"id":"W4241505304","doi":"10.5220/0006907902080217","title":"Multicasting in Tactical Networks: Forwarding Versus Network Coding","year":2018,"lang":"en","type":"article","venue":"Proceedings of the 15th International Joint Conference on e-Business and Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Multicast; Linear network coding; Coding (social sciences)","score_opus":0.08171999203139281,"score_gpt":0.3087357066808663,"score_spread":0.2270157146494735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241505304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35736024,0.0007977929,0.28287262,0.10561513,0.004755619,0.001808337,0.000011054663,0.00048799877,0.2462912],"genre_scores_gemma":[0.9790099,0.0010099694,0.019525757,0.00020992622,0.00014454089,0.000035785957,0.0000022143918,0.000009890637,0.000051965028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987382,0.00004258716,0.0004510778,0.00027934715,0.00023264193,0.0002561416],"domain_scores_gemma":[0.9977483,0.00029048737,0.00030871847,0.00043462098,0.0011606584,0.000057223013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005826208,0.00016096604,0.00021109213,0.00014814708,0.0004793637,0.00027373224,0.001879691,0.00006251902,0.000026891155],"category_scores_gemma":[0.0006793531,0.00013243452,0.000052967767,0.0008756076,0.00025705763,0.0005264779,0.0015305049,0.00035934825,0.0000041856592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004625562,0.00010591829,0.004270922,0.000009565715,0.000040785635,1.620479e-7,0.0005096653,0.00045991328,0.0008602491,0.9703007,0.00024235282,0.023153536],"study_design_scores_gemma":[0.0012230865,0.0000885278,0.08381329,0.0009295269,0.000016777381,0.000013411095,0.000244209,0.90634245,0.0006086312,0.004322154,0.002066386,0.00033154385],"about_ca_topic_score_codex":0.000018880964,"about_ca_topic_score_gemma":0.00007459583,"teacher_disagreement_score":0.9659785,"about_ca_system_score_codex":0.00007871466,"about_ca_system_score_gemma":0.00005775389,"threshold_uncertainty_score":0.5400523},"labels":[],"label_agreement":null},{"id":"W4241574228","doi":"10.32920/ryerson.14657154","title":"Improving the Energy Efficiency by Cooperative Transmission in Multi-Hop Wireless Ad-Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Wireless ad hoc network; Computer science; Computer network; Exploit; Quality of service; Mobile ad hoc network; Network packet; Physical layer; Distributed computing; Vehicular ad hoc network; Hop (telecommunications); Wireless; Telecommunications","score_opus":0.029058863512355464,"score_gpt":0.2699700187757163,"score_spread":0.24091115526336085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241574228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031827912,0.034289263,0.9595761,0.0015056378,0.0004706125,0.00035393232,0.0000015220596,0.00017539835,0.00044474212],"genre_scores_gemma":[0.9473861,0.034912135,0.014742394,0.0014920075,0.000044808778,0.00017878792,0.00006133807,0.00003323816,0.00114919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653417,0.0009977575,0.00063176843,0.0010255901,0.00032199424,0.00048873015],"domain_scores_gemma":[0.9972155,0.0003874229,0.00020697122,0.0017296821,0.00032680022,0.00013363427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007598727,0.00044717616,0.00047205083,0.000111438785,0.0004733858,0.0008355622,0.0032599138,0.00031836564,0.00007102877],"category_scores_gemma":[0.00004071536,0.00032024542,0.00016089826,0.0009099125,0.000115558825,0.0002759924,0.0033227922,0.0013449537,0.000002571027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010139385,0.00032009563,0.000018913614,0.000019546353,0.000032810785,0.000013942672,0.004272588,0.0347299,0.0043436387,0.0049474114,0.0010223071,0.9502687],"study_design_scores_gemma":[0.00042784578,0.00003079657,0.000057415014,0.00024674553,0.0000065137397,0.0000033225015,0.00020654425,0.99294955,0.0019600114,0.000010691556,0.0036699304,0.0004306424],"about_ca_topic_score_codex":0.00013851124,"about_ca_topic_score_gemma":0.00085585954,"teacher_disagreement_score":0.95821965,"about_ca_system_score_codex":0.00016524085,"about_ca_system_score_gemma":0.0003859929,"threshold_uncertainty_score":0.99992496},"labels":[],"label_agreement":null},{"id":"W4241593950","doi":"10.1109/tvt.2014.2323172","title":"An Energy-Efficient Uncoordinated Cooperative Scheme With Uncertain Relay Distribution Intensity","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Relay; Computer science; Fading; Cooperative diversity; Transmission (telecommunications); Efficient energy use; Energy consumption; Computer network; Wireless; Spectral efficiency; Rayleigh fading; Energy (signal processing); Wireless network; Mathematical optimization; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering; Mathematics; Electrical engineering","score_opus":0.012209536079089792,"score_gpt":0.23887097833974003,"score_spread":0.22666144226065024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241593950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068443716,0.00004540334,0.92766875,0.0026867213,0.0001645761,0.00014598161,0.000004987212,0.00074192317,0.00009794766],"genre_scores_gemma":[0.9907191,0.00005257934,0.008700986,0.00032595365,0.0000108038275,0.00007909665,0.000017757524,0.000014033926,0.000079682635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850494,0.00022819678,0.0002269619,0.00053826626,0.00019607847,0.0003055607],"domain_scores_gemma":[0.9980355,0.00005214454,0.00008249967,0.0012259287,0.00050864246,0.00009529313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027135338,0.00022759213,0.00024824316,0.0002454791,0.0006106823,0.00007768527,0.0008486495,0.00021120849,0.000013010803],"category_scores_gemma":[0.000015398806,0.00019167672,0.00005333099,0.0016474497,0.0002483947,0.0001832535,0.000012311481,0.00051824097,0.000023317045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011568543,0.0011359414,0.00006625857,0.000007203116,0.00014586662,0.00002840239,0.00030064778,0.4906168,0.0256556,0.29646772,0.0002285381,0.18523134],"study_design_scores_gemma":[0.00055303134,0.0006917316,0.000044880733,0.000043747932,0.000013231928,0.00005018092,0.000054497465,0.91113174,0.08192662,0.00019561224,0.0050122305,0.00028252188],"about_ca_topic_score_codex":0.00001680671,"about_ca_topic_score_gemma":0.00010914477,"teacher_disagreement_score":0.92227536,"about_ca_system_score_codex":0.00016556332,"about_ca_system_score_gemma":0.00006470767,"threshold_uncertainty_score":0.781635},"labels":[],"label_agreement":null},{"id":"W4241807736","doi":"10.32920/ryerson.14652171","title":"Cooperative Subcarrier and Power Allocation in OFDM Based Relaying Systems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Subcarrier; Computer science; Orthogonal frequency-division multiplexing; Resource allocation; Wireless; Relay; Orthogonal frequency-division multiple access; Computer network; Fading; WiMAX; Throughput; Channel (broadcasting); Power (physics); Telecommunications","score_opus":0.038977017698157215,"score_gpt":0.2803537858612732,"score_spread":0.24137676816311598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241807736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066138424,0.0075979107,0.9112661,0.0029874053,0.00089894334,0.0007363217,0.0000020521813,0.00018823931,0.010184627],"genre_scores_gemma":[0.98905975,0.00070451555,0.009113901,0.000559836,0.000019370838,0.00010261294,0.000029289025,0.0000117602995,0.00039898205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980234,0.000570118,0.00039494285,0.0006188416,0.00020257325,0.00019015736],"domain_scores_gemma":[0.9981221,0.00019602991,0.00012059568,0.0010921191,0.00038974156,0.00007943314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066670973,0.00022309994,0.00032076205,0.00017810152,0.00013267598,0.00081994926,0.00072515395,0.00017981918,0.000039444854],"category_scores_gemma":[0.00010873673,0.00021559009,0.00004275879,0.00043250146,0.000042623276,0.00029372153,0.0016278928,0.00058646535,0.0000046423997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045022905,0.000645295,0.018282607,0.00062295236,0.0002911237,0.00016951645,0.034709148,0.22202472,0.00629429,0.6699262,0.0038944504,0.043094672],"study_design_scores_gemma":[0.00037378422,0.000025113148,0.0036393537,0.0005564806,0.000004879522,0.0000052560754,0.0004402896,0.9927522,0.00036918177,0.000047381607,0.0013831501,0.0004029581],"about_ca_topic_score_codex":0.0000660141,"about_ca_topic_score_gemma":0.00022705457,"teacher_disagreement_score":0.9229213,"about_ca_system_score_codex":0.00013538767,"about_ca_system_score_gemma":0.0003655544,"threshold_uncertainty_score":0.87915087},"labels":[],"label_agreement":null},{"id":"W4242581272","doi":"10.1007/978-3-319-78262-1","title":"Encyclopedia of Wireless Networks","year":2020,"lang":"en","type":"book","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Encyclopedia; Computer science; Wireless; Wireless network; Computer network; World Wide Web; Telecommunications; Library science","score_opus":0.02547089163935694,"score_gpt":0.245765864896704,"score_spread":0.22029497325734704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242581272","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.5267937e-7,0.00077568245,0.38046178,0.00039147996,0.00017298137,0.000086634886,6.3564244e-7,0.00009123395,0.61801934],"genre_scores_gemma":[0.0012503136,0.018058117,0.007108777,0.0010355801,0.0002846156,0.000008922161,0.000027241957,0.000021981847,0.97220445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899817,0.00006501209,0.00032281695,0.00029380337,0.00018251291,0.00013767739],"domain_scores_gemma":[0.99855,0.00015337956,0.00018410748,0.0008919798,0.00013352915,0.000087004824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112546,0.00017992986,0.00033005,0.000056376237,0.000055339042,0.000043269,0.0018921187,0.00014327714,0.0001429986],"category_scores_gemma":[0.000011867652,0.00016614258,0.000105161496,0.00019162653,0.000049814225,0.00011095354,0.0010404682,0.00037284655,0.000057470006],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001010286,0.000008499656,0.0000034459433,0.000012876495,0.000021753696,0.0000027307722,0.00013335113,0.000041085244,0.000002159343,0.59256935,0.25047043,0.15673333],"study_design_scores_gemma":[0.00008968092,0.00003436505,0.000013549662,0.00008679437,0.0000071897675,0.0000014892407,0.000001258675,0.14862876,0.0000085596075,0.0012871884,0.84962213,0.00021904515],"about_ca_topic_score_codex":5.849315e-7,"about_ca_topic_score_gemma":0.000009527566,"teacher_disagreement_score":0.59915173,"about_ca_system_score_codex":0.000039582887,"about_ca_system_score_gemma":0.0002675203,"threshold_uncertainty_score":0.6775098},"labels":[],"label_agreement":null},{"id":"W4243244332","doi":"10.22215/etd/2016-11448","title":"Cross-Layer Resource Allocation and Scheduling in Bidirectional Cooperative Multichannel Relaying Networks","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Resource allocation; EnodeB; Relay; Optimization problem; Scheduling (production processes); Wireless network; Transmission (telecommunications); Wireless; Mathematical optimization; Distributed computing; User equipment; Base station; Power (physics); Telecommunications; Algorithm","score_opus":0.03388583741720554,"score_gpt":0.3149259071192212,"score_spread":0.28104006970201567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243244332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20932183,0.008772838,0.7297656,0.0019448941,0.0019251211,0.001239172,0.0000038046483,0.0005956478,0.04643111],"genre_scores_gemma":[0.9706185,0.0027693333,0.007550043,0.00032087511,0.00019142858,0.000115875126,0.00012891114,0.000035155146,0.018269865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980726,0.00024581532,0.0004850056,0.00066349184,0.00023083102,0.00030222794],"domain_scores_gemma":[0.99843013,0.0003951483,0.00019490739,0.0005135213,0.00037306928,0.00009324237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064559805,0.0002948906,0.0002860813,0.00029602664,0.0004847707,0.00040476222,0.00061018835,0.0002937537,0.00006302201],"category_scores_gemma":[0.00019279274,0.0002544003,0.000051538464,0.0005542334,0.00004916726,0.000606088,0.00021897975,0.000529804,0.000019836792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031796415,0.0003482988,0.008453029,0.00014093403,0.0002456903,0.0000241561,0.0152897425,0.062622964,0.010178385,0.24406585,0.0011077337,0.6572052],"study_design_scores_gemma":[0.0010258531,0.00004888369,0.01640025,0.00082357036,0.000009450704,0.000008632961,0.00031882216,0.9754721,0.001697576,0.00019719067,0.0032707097,0.00072694576],"about_ca_topic_score_codex":0.000020482119,"about_ca_topic_score_gemma":0.00051395834,"teacher_disagreement_score":0.9128491,"about_ca_system_score_codex":0.00013207331,"about_ca_system_score_gemma":0.0001208953,"threshold_uncertainty_score":0.9999908},"labels":[],"label_agreement":null},{"id":"W4243865180","doi":"10.1109/glocom.2015.7417306","title":"Relay Selection, Link Scheduling, and Rate Allocation in Dual-Hop Buffer-Aided Networks with Statistical Delay Constraints","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; McGill University","funders":"","keywords":"Relay; Computer science; Scheduling (production processes); Mathematical optimization; Resource allocation; Hop (telecommunications); Selection (genetic algorithm); Computer network; Fading; Relay channel; Wireless; Telecommunications; Mathematics; Channel (broadcasting); Power (physics)","score_opus":0.06811820725560093,"score_gpt":0.3225813429994276,"score_spread":0.2544631357438267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243865180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019170484,0.0016566232,0.9643394,0.00884908,0.00022582996,0.00062290934,0.000019581512,0.00028497717,0.0048311483],"genre_scores_gemma":[0.8849528,0.0018682895,0.112404905,0.00047304822,0.000041318028,0.00009854855,0.000079036596,0.000014603982,0.00006749214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964659,0.0013992871,0.00069517514,0.0006025096,0.0003229043,0.000514228],"domain_scores_gemma":[0.99537194,0.00046314564,0.00028742637,0.0021827985,0.0012743402,0.00042033516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001668091,0.0003596071,0.0004149329,0.00014090165,0.00046790153,0.00053361495,0.0017082243,0.0001983396,0.00003075307],"category_scores_gemma":[0.0003500956,0.00035026597,0.00003503201,0.001313565,0.0007748679,0.0008182228,0.00088968774,0.0007293546,0.0000595233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001191215,0.0004928086,0.016875288,0.000018876695,0.00013396858,0.00002406807,0.0016225437,0.024770675,0.00013359141,0.8283707,0.005703547,0.12173482],"study_design_scores_gemma":[0.0016422913,0.0002680087,0.008856436,0.00016374876,0.000027843593,0.00019369884,0.00023037357,0.9804071,0.00001894427,0.0027818915,0.004851465,0.00055816025],"about_ca_topic_score_codex":0.0002064898,"about_ca_topic_score_gemma":0.0040279496,"teacher_disagreement_score":0.95563644,"about_ca_system_score_codex":0.00038011983,"about_ca_system_score_gemma":0.0009086922,"threshold_uncertainty_score":0.9998949},"labels":[],"label_agreement":null},{"id":"W4244148785","doi":"10.1002/9780470986424.biblio","title":"Bibliography","year":2008,"lang":"en","type":"other","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Library science; Citation; Computer science","score_opus":0.03998476960955754,"score_gpt":0.27395852487070327,"score_spread":0.23397375526114572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244148785","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7702963e-8,0.003992006,0.21102853,0.00022718112,0.0001410494,0.000050212635,3.356868e-7,0.00060558936,0.7839551],"genre_scores_gemma":[0.000020936342,0.2555903,0.030564057,0.0005713436,0.000069886984,0.0000064103724,0.0000023099594,0.000058009024,0.71311677],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995252,0.00003550634,0.00006790921,0.00017612803,0.00009813413,0.00009712378],"domain_scores_gemma":[0.9990427,0.000014772864,0.00004270601,0.00084170396,0.00001815309,0.0000399853],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000031828644,0.0000980244,0.00010055498,0.0075578266,0.00004593244,0.000052370746,0.0010769839,0.00006744955,0.0016239358],"category_scores_gemma":[0.0000017473362,0.000082633036,0.000057961195,0.008804141,0.000027081094,0.000045703386,0.00029339618,0.00009287601,0.00047619446],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1691755e-8,0.0000069613616,0.000016990241,9.725915e-7,0.000008162649,0.000001404118,0.0000060866605,7.4494906e-8,0.0000011785523,0.018106133,0.9719381,0.009913911],"study_design_scores_gemma":[0.000042765205,0.0000050242174,0.000037827664,0.000019531137,5.974656e-7,0.0000034730433,2.6794993e-7,0.00039293268,0.0000049981627,0.000040120103,0.9993408,0.000111676585],"about_ca_topic_score_codex":0.000011265022,"about_ca_topic_score_gemma":0.000039743056,"teacher_disagreement_score":0.2515983,"about_ca_system_score_codex":0.0000012993956,"about_ca_system_score_gemma":0.000010850161,"threshold_uncertainty_score":0.99928874},"labels":[],"label_agreement":null},{"id":"W4244451663","doi":"10.4108/icst.qshine2008.3933","title":"Cooperative Protocols Design for Wireless Ad-hoc Networks with Multi-hop Routing","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Wireless ad hoc network; Fading; Computer science; Ad hoc wireless distribution service; Wireless; Hop (telecommunications); Mobile ad hoc network; Optimized Link State Routing Protocol; Diversity scheme; Cooperative diversity; Wireless network; MIMO; Distributed computing; Telecommunications; Channel (broadcasting)","score_opus":0.12741902920161716,"score_gpt":0.32627945984306234,"score_spread":0.19886043064144518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244451663","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004962431,0.00018849227,0.98742723,0.000406595,0.000038434802,0.010702403,4.502762e-7,0.00029177457,0.00044836567],"genre_scores_gemma":[0.3721295,0.0002840564,0.6124237,0.00084079296,0.000055715027,0.012358841,0.000003964588,0.000026829854,0.0018765932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985519,0.00023225382,0.0002733254,0.00041772416,0.00015510242,0.0003696691],"domain_scores_gemma":[0.9982247,0.00038639686,0.000109934124,0.0006888572,0.00048154112,0.000108585446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043029655,0.0002097437,0.00024169759,0.00005025966,0.00085660524,0.00016669632,0.0009720635,0.000061224775,0.000017206377],"category_scores_gemma":[0.000043356522,0.00015595721,0.000048465867,0.00052411016,0.000097869604,0.00047190255,0.00025628597,0.0001904572,0.000010771959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007824431,0.0014037058,0.0026659411,0.00004976253,0.00031702287,0.000067974666,0.018144486,0.22373997,0.0032970519,0.14308289,0.019349728,0.587099],"study_design_scores_gemma":[0.0014249106,0.00037410017,0.00026365145,0.00008038618,0.0000026104983,0.000021423812,0.000047331927,0.99021304,0.0016265322,0.000008900448,0.005647499,0.00028960846],"about_ca_topic_score_codex":0.0000010381289,"about_ca_topic_score_gemma":0.000040856474,"teacher_disagreement_score":0.76647305,"about_ca_system_score_codex":0.00005429449,"about_ca_system_score_gemma":0.00017048804,"threshold_uncertainty_score":0.6588402},"labels":[],"label_agreement":null},{"id":"W4244520450","doi":"10.1002/wcm.644","title":"Topological planning and design of UMTS mobile networks: a survey","year":2008,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"UMTS frequency bands; Computer science; Network planning and design; Cellular network; Core network; Point (geometry); Mobile telephony; Computer network; Customised Applications for Mobile networks Enhanced Logic; Architecture; Core (optical fiber); Open research; Topology (electrical circuits); Telecommunications; Distributed computing; Mobile radio; Mathematics; World Wide Web","score_opus":0.10799191610228054,"score_gpt":0.32310579042864,"score_spread":0.21511387432635948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244520450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2743966,0.01715951,0.70777035,0.000055841578,0.00004164515,0.00033081198,0.0000012613722,0.000093998526,0.00014996015],"genre_scores_gemma":[0.9488803,0.013183265,0.037756722,0.00007987333,0.0000149850575,0.000050855047,0.000009437375,0.000008849575,0.000015696003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981807,0.00080030115,0.00040162995,0.0002855293,0.00010644739,0.00022538753],"domain_scores_gemma":[0.9965138,0.0016658255,0.00019003077,0.0013527917,0.00018360364,0.00009394204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000936926,0.0001552715,0.00029963572,0.000088551176,0.0009256897,0.000069500005,0.0012723322,0.00007368175,0.0000025910979],"category_scores_gemma":[0.00004317261,0.00014833077,0.000031361968,0.00044396787,0.00043746844,0.00017580658,0.002231151,0.00027373078,7.9359893e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037529753,0.00066124595,0.103511594,0.00004561001,0.00012419168,0.000011770208,0.016389143,0.10043289,0.001422995,0.04017961,0.00042963735,0.73675376],"study_design_scores_gemma":[0.00026706385,0.00015191169,0.024744097,0.00008141164,0.000003835605,0.00005196839,0.00012808495,0.9734936,0.000046675377,0.000053820833,0.0007942029,0.00018332327],"about_ca_topic_score_codex":0.00002977158,"about_ca_topic_score_gemma":0.0000084758485,"teacher_disagreement_score":0.8730607,"about_ca_system_score_codex":0.00001714942,"about_ca_system_score_gemma":0.000046204757,"threshold_uncertainty_score":0.71197504},"labels":[],"label_agreement":null},{"id":"W4245025041","doi":"10.14209/sbrt.2013.173","title":"Esquemas de Multiplexação Cooperativos com Cluster de Relays para Dois Usuários","year":2013,"lang":"pt","type":"article","venue":"Anais de XXXI Simpósio Brasileiro de Telecomunicações","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Cluster (spacecraft); Computer network","score_opus":0.047217425647821616,"score_gpt":0.30274600253933515,"score_spread":0.25552857689151354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245025041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.792187,0.009423001,0.17370126,0.01684843,0.00044880333,0.0031324094,0.000046996152,0.0009781684,0.0032339583],"genre_scores_gemma":[0.9406974,0.009914931,0.02874481,0.0151809165,0.00031096005,0.00046207977,0.00005353338,0.00018646878,0.004448955],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98939943,0.0037282957,0.0016507995,0.0015072891,0.00067803706,0.0030361556],"domain_scores_gemma":[0.9894324,0.0029770387,0.00065907784,0.0045899595,0.0008168527,0.0015246661],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0022474553,0.0012566013,0.0013112789,0.0004964369,0.0019143578,0.0020603342,0.0062609767,0.00094286597,0.0019892862],"category_scores_gemma":[0.0014292981,0.0013041148,0.0005850288,0.0017880724,0.00064536,0.0017065916,0.0031465967,0.0024882727,0.001137637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024492777,0.0028447774,0.4388469,0.0003562923,0.0011226111,0.00030456367,0.0626422,0.012387011,0.035455056,0.008607348,0.28129825,0.15589008],"study_design_scores_gemma":[0.0023864983,0.00046405094,0.12511747,0.00050665723,0.00011897064,0.00032189986,0.0010247097,0.8324052,0.0042715683,0.00040443946,0.031261414,0.0017171381],"about_ca_topic_score_codex":0.0018266018,"about_ca_topic_score_gemma":0.004368976,"teacher_disagreement_score":0.8200182,"about_ca_system_score_codex":0.0015768793,"about_ca_system_score_gemma":0.0015691225,"threshold_uncertainty_score":0.999813},"labels":[],"label_agreement":null},{"id":"W4245779315","doi":"10.1002/ett.1385","title":"Improved OFDMA uplink transmission <i>via</i> cooperative relaying in the presence of frequency offsets—Part II: Outage information rate analysis","year":2009,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Alberta","funders":"","keywords":"Telecommunications link; Relay; Diversity gain; Computer science; Node (physics); Computer network; Orthogonal frequency-division multiplexing; Transmission (telecommunications); Interference (communication); Electronic engineering; Ergodic theory; Orthogonal frequency-division multiple access; Fading; Telecommunications; Engineering; Mathematics; Power (physics); Channel (broadcasting); Physics","score_opus":0.021225157682030916,"score_gpt":0.25620946153406804,"score_spread":0.2349843038520371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245779315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003868292,0.00041346808,0.97535557,0.012447105,0.000049732964,0.00050003856,0.000011669969,0.00012859494,0.007225533],"genre_scores_gemma":[0.97524923,0.0034867895,0.01980203,0.0012135562,0.000007940146,0.000052764102,0.000051050247,0.000008705681,0.00012790396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966092,0.0018440488,0.00084349595,0.0002580604,0.00020490811,0.00024025235],"domain_scores_gemma":[0.9966905,0.00046904953,0.0002907408,0.0021913338,0.00028678274,0.00007156479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015245924,0.00021403663,0.00026520813,0.00052106497,0.0011479702,0.0001570861,0.002684297,0.00005281341,0.000056356694],"category_scores_gemma":[0.000054896966,0.00017543648,0.00019724731,0.003338002,0.00009677294,0.0012667709,0.00004363089,0.0007227468,0.000019335032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004236575,0.0017032669,0.00011561361,0.000015182731,0.00026161177,0.0000021129065,0.032576542,0.038605716,0.00995318,0.01969751,0.00030457933,0.8967223],"study_design_scores_gemma":[0.0017595513,0.0008063189,0.026855392,0.0002693542,0.0003111059,0.000010016405,0.00071957003,0.944079,0.0047077173,0.00053538004,0.019074786,0.00087180984],"about_ca_topic_score_codex":0.000035412933,"about_ca_topic_score_gemma":0.000091309346,"teacher_disagreement_score":0.97138095,"about_ca_system_score_codex":0.00005603188,"about_ca_system_score_gemma":0.00006993844,"threshold_uncertainty_score":0.8829375},"labels":[],"label_agreement":null},{"id":"W4246489471","doi":"10.22215/etd/2007-06335","title":"Cooperative connectivity models and bounds for wireless relay networks","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Relay; Computer science; Wireless; Wireless network; Computer network; Telecommunications; Physics; Power (physics)","score_opus":0.04410923830125841,"score_gpt":0.32962255149382697,"score_spread":0.28551331319256856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246489471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074142586,0.0019908652,0.96864355,0.00017912591,0.00061459094,0.0006784527,0.0000029963533,0.00017983047,0.02029634],"genre_scores_gemma":[0.9609542,0.0038993312,0.01609225,0.0006491099,0.00016300137,0.00020320187,0.0003117476,0.00004417943,0.017682992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984345,0.00012192021,0.00034274333,0.0006004205,0.00016980756,0.00033061166],"domain_scores_gemma":[0.99782974,0.0006378942,0.0001734413,0.00064862386,0.00059126935,0.00011905063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006755116,0.00031528733,0.00039771275,0.00013996134,0.00059272844,0.00040319026,0.0007288564,0.0003141572,0.00001332917],"category_scores_gemma":[0.000044413788,0.00029390902,0.00008631786,0.00037432488,0.000049823066,0.00055716524,0.00016755892,0.0004230304,0.0000022937083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006221562,0.000059995204,0.000011317056,0.000034561377,0.00007165624,0.0000016467965,0.0019652992,0.0028788752,0.00009282715,0.8294385,0.0029471247,0.16243595],"study_design_scores_gemma":[0.0004238368,0.000094880284,0.00015105824,0.00009634988,0.000015705298,0.0000032761452,0.0001629414,0.99403226,0.0003498186,0.0016353604,0.0026131154,0.00042141977],"about_ca_topic_score_codex":0.000012017731,"about_ca_topic_score_gemma":0.0015197119,"teacher_disagreement_score":0.99115336,"about_ca_system_score_codex":0.00007092981,"about_ca_system_score_gemma":0.00014386271,"threshold_uncertainty_score":0.9999513},"labels":[],"label_agreement":null},{"id":"W4246494424","doi":"10.22215/etd/2011-09773","title":"Radio resource management in OFDMA-based cellular relay networks","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"","keywords":"Relay; Telecommunications; Computer science; Computer network; Political science; Physics; Power (physics)","score_opus":0.026171049105495267,"score_gpt":0.2515381121433788,"score_spread":0.2253670630378835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246494424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020618376,0.0073548094,0.5181365,0.00040322676,0.0010282943,0.00095787755,6.084041e-7,0.00044296254,0.4696139],"genre_scores_gemma":[0.48258013,0.013426843,0.09005847,0.003357257,0.0003504892,0.0009692822,0.0012644246,0.00020683047,0.4077863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982564,0.0002412406,0.00042332543,0.0005359306,0.0002293098,0.0003137909],"domain_scores_gemma":[0.99828094,0.00007353179,0.00017584386,0.0013174932,0.00007193742,0.00008024919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004353131,0.00027812758,0.00027878114,0.00034227388,0.00014158328,0.00012954694,0.0019481009,0.00020733543,0.00022434581],"category_scores_gemma":[0.0000065347895,0.00027314274,0.00010436656,0.0007613066,0.00001701069,0.00013297028,0.00020755843,0.00050714234,0.000046029138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088101755,0.00038405834,0.00028002876,0.0001404899,0.00013653965,0.0001125902,0.0022052054,0.012147029,0.00008246519,0.37539497,0.021067377,0.58796114],"study_design_scores_gemma":[0.0012221098,0.00006751103,0.00394345,0.0008313468,0.00004647782,8.923967e-7,0.00024228072,0.8495155,0.0011381176,0.0003516496,0.14148168,0.0011589939],"about_ca_topic_score_codex":0.000019873984,"about_ca_topic_score_gemma":0.000433279,"teacher_disagreement_score":0.8373685,"about_ca_system_score_codex":0.00007795665,"about_ca_system_score_gemma":0.00004935346,"threshold_uncertainty_score":0.9999721},"labels":[],"label_agreement":null},{"id":"W4247227500","doi":"10.1007/978-3-319-78262-1_1","title":"Interference Characterization for Cooperative Communications in Mobile Ad Hoc Networks","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mobile ad hoc network; Computer science; Computer network; Wireless ad hoc network; Interference (communication); Characterization (materials science); Telecommunications; Wireless; Materials science; Channel (broadcasting); Network packet; Nanotechnology","score_opus":0.07560099390979991,"score_gpt":0.2996749448716461,"score_spread":0.22407395096184618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247227500","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030644396,0.0067262794,0.89035726,0.0027871407,0.0002172122,0.0014406,0.000026981996,0.00021094452,0.09823051],"genre_scores_gemma":[0.0850004,0.3650338,0.07411645,0.0097149415,0.00038925794,0.002749523,0.0040318677,0.00023398643,0.45872977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984801,0.000096664255,0.00055973395,0.00053779705,0.000117732256,0.00020796222],"domain_scores_gemma":[0.9971549,0.00033473095,0.00024546016,0.0018010865,0.00036413124,0.00009967534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021866384,0.00032840698,0.00043316057,0.00015330444,0.00022661597,0.0002440247,0.0028362556,0.00021368025,0.00011917591],"category_scores_gemma":[0.00003431551,0.0003309986,0.00010717781,0.00018623302,0.00011046277,0.00038828922,0.001599228,0.0005977676,0.00006104533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012352593,0.000028130355,0.000002144486,0.000010070806,0.000025715266,8.79741e-7,0.00066295796,0.00006231293,0.00014909284,0.70690244,0.0007280098,0.29141593],"study_design_scores_gemma":[0.0003384471,0.00020393108,0.000023977449,0.0002506111,0.000009177384,0.0000018516959,0.000013928544,0.33174828,0.00002466436,0.0012351846,0.6657103,0.0004397065],"about_ca_topic_score_codex":2.4532594e-7,"about_ca_topic_score_gemma":0.00015869235,"teacher_disagreement_score":0.8162408,"about_ca_system_score_codex":0.00012658074,"about_ca_system_score_gemma":0.00013656552,"threshold_uncertainty_score":0.9999142},"labels":[],"label_agreement":null},{"id":"W4247346730","doi":"10.22215/etd/2005-08172","title":"Dynamic frequency hopping in cellular fixed relay networks","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"","keywords":"Relay; Telecommunications; Computer science; Physics; Quantum mechanics; Power (physics)","score_opus":0.015456319754973063,"score_gpt":0.26842634343739047,"score_spread":0.2529700236824174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247346730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029747136,0.021901442,0.6980873,0.0014785195,0.002865395,0.0010053895,0.0000012846715,0.0007891798,0.24412437],"genre_scores_gemma":[0.9274508,0.008018309,0.039399564,0.00048063125,0.000108325694,0.0000816878,0.00045704521,0.000045292825,0.023958357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817806,0.00019130026,0.00052186375,0.000533332,0.00021479555,0.0003606435],"domain_scores_gemma":[0.99840367,0.00011512081,0.00019183868,0.0010884514,0.00012399249,0.000076923774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003718188,0.0002944022,0.00032005308,0.00030615315,0.0001740714,0.00019979835,0.0016910394,0.00030127328,0.00018913572],"category_scores_gemma":[0.00003697334,0.0003016908,0.000104784085,0.00084333157,0.000014989977,0.00037534387,0.00016907508,0.00079317257,0.00007259936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022478009,0.0003143258,0.0007154365,0.000097350756,0.00010266711,0.00008391452,0.0059611085,0.01888407,0.0055152457,0.32070518,0.0032854571,0.6443128],"study_design_scores_gemma":[0.00032094642,0.000025425681,0.004021403,0.00037453638,0.000007719062,0.0000022539457,0.00012944375,0.99152386,0.0001391807,0.00031643928,0.0025248255,0.00061396573],"about_ca_topic_score_codex":0.00001915482,"about_ca_topic_score_gemma":0.006024544,"teacher_disagreement_score":0.9726398,"about_ca_system_score_codex":0.00020894692,"about_ca_system_score_gemma":0.0001334327,"threshold_uncertainty_score":0.9999435},"labels":[],"label_agreement":null},{"id":"W4248010148","doi":"10.1109/glocom.2014.7037459","title":"Achievable rates for the fading half-duplex single relay selection network using buffer-aided relaying","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Fading; Additive white Gaussian noise; Computer science; Computer network; Channel state information; Channel (broadcasting); Protocol (science); Buffer (optical fiber); Relay channel; Wireless; Telecommunications","score_opus":0.07779796268934176,"score_gpt":0.3135095121895407,"score_spread":0.23571154950019896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248010148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011351923,0.00056450884,0.98290783,0.0019195945,0.00045993025,0.00034612205,1.05588235e-7,0.00027073757,0.0021792206],"genre_scores_gemma":[0.83559066,0.00009285123,0.16229373,0.0007836161,0.0002622995,0.000033853514,0.0000020827883,0.000018709721,0.0009221803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985058,0.0002855084,0.00029694094,0.00034279306,0.00015225793,0.0004167326],"domain_scores_gemma":[0.9975282,0.0014523794,0.00013841303,0.0006268304,0.0001926479,0.000061548075],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014733938,0.0001675275,0.00017741599,0.000058653568,0.0017766821,0.00048244582,0.00087338034,0.000066351095,0.000027075532],"category_scores_gemma":[0.00024734312,0.00012368793,0.00008967676,0.0007321993,0.000042507883,0.0005301565,0.00034109395,0.00021389942,0.000012761847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025512098,0.000071341885,0.0011895192,0.000015928614,0.00007772786,2.9785426e-7,0.0008787711,0.5660711,0.034944467,0.30280387,0.006992827,0.08692861],"study_design_scores_gemma":[0.00024764842,0.00007218966,0.00014200053,0.000041896037,0.000013199843,0.000010539653,0.000023260502,0.9705925,0.0029449388,0.0007323451,0.025000697,0.00017876014],"about_ca_topic_score_codex":0.00002810402,"about_ca_topic_score_gemma":0.00008786659,"teacher_disagreement_score":0.8242388,"about_ca_system_score_codex":0.00010316693,"about_ca_system_score_gemma":0.00003946373,"threshold_uncertainty_score":0.99952286},"labels":[],"label_agreement":null},{"id":"W4248230856","doi":"10.1109/glocom.2014.7417463","title":"Distributed Space Time Coding for Bit-Interleaved Coded Modulation in Two-Way Relaying Communications","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rician fading; Computer science; Decoding methods; Algorithm; Rayleigh fading; Relay; Coding (social sciences); Bit error rate; Space–time code; Fading; Theoretical computer science; Mathematics; Statistics","score_opus":0.07768616555233726,"score_gpt":0.34999827078020956,"score_spread":0.2723121052278723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248230856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050851814,0.0006680293,0.95939666,0.020630024,0.00028825997,0.0011780327,0.00014253145,0.0005190448,0.012092208],"genre_scores_gemma":[0.9018745,0.0011199359,0.09557768,0.00040272635,0.000038207312,0.00030266188,0.0005103927,0.00002344107,0.00015047264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958514,0.0014673623,0.0010288089,0.00065799727,0.00033487243,0.0006595498],"domain_scores_gemma":[0.9887944,0.0012833652,0.00052919646,0.008128451,0.001022026,0.00024256643],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001809328,0.00043198455,0.00059629657,0.00022858298,0.0011782788,0.0006071002,0.008818971,0.00016002671,0.00002901191],"category_scores_gemma":[0.0006130003,0.0004850144,0.00018081172,0.0015609096,0.0004027663,0.0010501407,0.0025751684,0.0005926002,0.00019641824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003708144,0.00047846526,0.0026508388,0.000025061487,0.00006897045,5.101657e-7,0.0008296736,0.0019325179,0.003187999,0.9016177,0.0064662355,0.08270493],"study_design_scores_gemma":[0.0015039011,0.00006103303,0.0033177894,0.0002349455,0.000022192631,0.000008805623,0.00009804511,0.9599011,0.00012781308,0.01212583,0.022064585,0.0005339872],"about_ca_topic_score_codex":0.00020227265,"about_ca_topic_score_gemma":0.0035936367,"teacher_disagreement_score":0.95796853,"about_ca_system_score_codex":0.0006393897,"about_ca_system_score_gemma":0.00024897096,"threshold_uncertainty_score":0.99976015},"labels":[],"label_agreement":null},{"id":"W4248996116","doi":"10.1017/9781108989817.032","title":"Integrated Super-Sidelink and Access Link Communication","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Link (geometry); Computer science; Computer network","score_opus":0.06411227795971977,"score_gpt":0.2510649954418441,"score_spread":0.1869527174821243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248996116","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042610805,0.0033581136,0.034758247,0.00048942544,0.00010951668,0.00026816945,0.000025828247,0.00022540892,0.9607227],"genre_scores_gemma":[0.00233461,0.0134213315,0.0027419531,0.00036097088,0.000051535186,0.0000013776789,0.00013784606,0.000027631855,0.98092276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986331,0.00019115844,0.00024374844,0.00054172764,0.0001915392,0.00019875805],"domain_scores_gemma":[0.99706125,0.00017088884,0.0001833724,0.001842631,0.0005854358,0.00015644768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018759725,0.0003189318,0.0003646676,0.00017494104,0.00044849224,0.00045619972,0.0025557429,0.00028211524,0.0000103600205],"category_scores_gemma":[0.000022909853,0.0003737214,0.00011218351,0.00003605273,0.000220261,0.00042200965,0.0042334804,0.00078340346,0.00000738248],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065843687,0.0000050123144,0.0000020208672,0.000017535867,0.00005904814,0.000036423906,0.00008338718,0.0000031252875,0.000032700424,0.93930364,0.009795751,0.050654747],"study_design_scores_gemma":[0.0003443372,0.000018342309,0.000019897378,0.0003310606,0.000046152472,0.000018618131,0.000017398223,0.005705967,0.00016836006,0.000053340784,0.9928653,0.00041119097],"about_ca_topic_score_codex":0.000041295978,"about_ca_topic_score_gemma":0.000017605578,"teacher_disagreement_score":0.9830696,"about_ca_system_score_codex":0.00014879154,"about_ca_system_score_gemma":0.00020384518,"threshold_uncertainty_score":0.9998715},"labels":[],"label_agreement":null},{"id":"W4250606260","doi":"10.1007/978-3-319-78262-1_241","title":"Joint Network Coding and Opportunistic Forwarding","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Joint (building); Computer network; Coding (social sciences); Linear network coding; Engineering; Sociology; Structural engineering","score_opus":0.1049824813799768,"score_gpt":0.25940979986882945,"score_spread":0.15442731848885266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250606260","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3619717e-7,0.0008414273,0.37701786,0.0023939738,0.00018995651,0.00013217369,0.0000012682099,0.00019147074,0.61923176],"genre_scores_gemma":[0.037138328,0.025263889,0.084362976,0.009546538,0.0012340121,0.000023477935,0.00005899833,0.0001232889,0.8422485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873585,0.00003115466,0.0003472953,0.00047728623,0.00019327579,0.00021514129],"domain_scores_gemma":[0.9987329,0.00013705215,0.00016596043,0.0006653918,0.000085390515,0.00021329049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027729393,0.0002757453,0.00039210092,0.00006568044,0.00031406278,0.00028544918,0.00066600146,0.00012514318,0.00020036954],"category_scores_gemma":[0.000030541665,0.00026433464,0.000095180105,0.00006115151,0.000060235514,0.00016196173,0.0015571245,0.00042106397,0.00008290521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.448516e-7,0.0000011171364,0.0000014499329,0.000011820463,0.000027781813,0.000014530541,0.000054494732,0.0000066166917,0.000011501565,0.9330639,0.014229921,0.052576084],"study_design_scores_gemma":[0.0001797714,0.0000637851,0.000014355672,0.00038164394,0.000031048225,0.000034124,0.0000048365646,0.116341725,0.0000063911107,0.057849836,0.82447565,0.00061685557],"about_ca_topic_score_codex":4.5660295e-7,"about_ca_topic_score_gemma":0.0000058286696,"teacher_disagreement_score":0.8752141,"about_ca_system_score_codex":0.000045296747,"about_ca_system_score_gemma":0.00007727174,"threshold_uncertainty_score":0.99998087},"labels":[],"label_agreement":null},{"id":"W4250965695","doi":"10.22215/etd/2012-07059","title":"A game theoretic approach for security and Quality of Service (QoS) co-design in cooperative wireless communication networks","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"","keywords":"Quality of service; Computer science; Wireless; Telecommunications; Computer network","score_opus":0.07233767361051949,"score_gpt":0.3414981306221972,"score_spread":0.2691604570116777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250965695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020426646,0.0036849948,0.9632299,0.00015660709,0.00010905209,0.0019261762,0.000009225331,0.0000835219,0.010373857],"genre_scores_gemma":[0.9807012,0.0026056913,0.015001817,0.00022382766,0.00003207732,0.0003651631,0.00082953327,0.000023533865,0.00021713812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669063,0.0016588198,0.00073184527,0.0004261891,0.00020620196,0.00028630294],"domain_scores_gemma":[0.9962811,0.0012745197,0.00048901315,0.0012146602,0.00065568445,0.00008505365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026445857,0.0003081297,0.00062891084,0.00015057101,0.00017626405,0.00011918955,0.0014096665,0.00030063748,0.000015760961],"category_scores_gemma":[0.00007097554,0.00028801124,0.0000686555,0.0006301249,0.000092200775,0.00039646303,0.00022407806,0.0004818299,8.9273516e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019849358,0.00046521166,0.00052289956,0.0006783199,0.0000775692,8.069501e-8,0.026687093,0.002412843,0.00042279044,0.95839417,0.0001667144,0.009973799],"study_design_scores_gemma":[0.00093125727,0.000062433675,0.005216179,0.00025706665,0.000021619946,9.453664e-7,0.0013564458,0.9896618,0.00066040515,0.0012885621,0.00007335194,0.00046994994],"about_ca_topic_score_codex":0.00008870477,"about_ca_topic_score_gemma":0.0012572912,"teacher_disagreement_score":0.98724896,"about_ca_system_score_codex":0.0000644361,"about_ca_system_score_gemma":0.00013111706,"threshold_uncertainty_score":0.9999572},"labels":[],"label_agreement":null},{"id":"W4252419285","doi":"10.7287/peerj-cs.89v0.1/reviews/1","title":"Peer Review #1 of \"TCP adaptation with network coding and opportunistic data forwarding in multi-hop wireless networks (v0.1)\"","year":2016,"lang":"en","type":"peer-review","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer network; Hop (telecommunications); Computer science; Coding (social sciences); Wireless network; Adaptation (eye); Wireless; Telecommunications; Biology; Mathematics; Statistics; Neuroscience","score_opus":0.2182943503462419,"score_gpt":0.36706178080505486,"score_spread":0.14876743045881297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252419285","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.2614367e-7,0.22327046,0.72483516,0.04710443,0.00047288486,0.0008872921,0.00004384433,0.00006929565,0.0033163985],"genre_scores_gemma":[0.00093907566,0.903624,0.030643346,0.0052619185,0.00020659372,0.000088301334,0.001300809,0.000048562622,0.057887387],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958552,0.0005960491,0.0011784729,0.000991952,0.00088449894,0.00049380254],"domain_scores_gemma":[0.9934571,0.00078430737,0.00089044875,0.0029523277,0.0017426645,0.0001731665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0051799337,0.0004877784,0.0013414811,0.00014562294,0.00018126774,0.00012704734,0.0029723495,0.00017338501,0.00011290498],"category_scores_gemma":[0.0007957948,0.0003511357,0.0000843555,0.0009568521,0.000126943,0.0006339125,0.002568017,0.0006133882,0.0000052738073],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047339045,0.000028850533,0.000029631874,0.0049589593,0.00005797033,0.000009469349,0.000045039324,0.000090076064,7.0337614e-7,0.005353075,0.655896,0.3335255],"study_design_scores_gemma":[0.00034245965,0.000032777658,0.000026545624,0.1260842,0.0000788691,0.000016411717,0.0000074530203,0.34220815,2.1613519e-7,0.000012448584,0.530796,0.00039448633],"about_ca_topic_score_codex":0.00003714134,"about_ca_topic_score_gemma":0.00075563084,"teacher_disagreement_score":0.6941918,"about_ca_system_score_codex":0.000092863025,"about_ca_system_score_gemma":0.00036769247,"threshold_uncertainty_score":0.9998941},"labels":[],"label_agreement":null},{"id":"W4252502403","doi":"10.22215/etd/2012-09690","title":"Joint MAC scheduling and network coding : from wired networks to realistic wireless networks","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Computer network; Linear network coding; Scheduling (production processes); Wireless network; Wireless; Telecommunications; Engineering","score_opus":0.0364263123852633,"score_gpt":0.2780076065002471,"score_spread":0.24158129411498377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252502403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007531914,0.009179514,0.9697415,0.00041884405,0.0032303848,0.00068348995,0.0000038871276,0.000472139,0.00873829],"genre_scores_gemma":[0.95184726,0.0057189814,0.035876136,0.0012467504,0.00203703,0.00012763946,0.000822682,0.00009653627,0.0022269867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643385,0.0003610539,0.00085718033,0.000998613,0.00037552635,0.00097379705],"domain_scores_gemma":[0.9966837,0.0005273697,0.00041565948,0.0015014057,0.00030333555,0.0005685094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008393868,0.0006529402,0.000859764,0.00017965458,0.00080638827,0.0007771313,0.0014811676,0.0005004189,0.0001309942],"category_scores_gemma":[0.00007329094,0.0006567239,0.00014443517,0.0009680586,0.000042073527,0.0004288325,0.0008621962,0.000862227,0.000026373567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012691274,0.000119141376,0.0009211097,0.00008366904,0.00037859383,0.00002072733,0.0035198275,0.12948899,0.00044302517,0.28215364,0.016388014,0.56635636],"study_design_scores_gemma":[0.00030201187,0.00003878041,0.009445401,0.00091621873,0.00007166435,0.0000041600347,0.00012232614,0.9852313,0.00003479951,0.0006019539,0.0022999137,0.0009314947],"about_ca_topic_score_codex":0.0001489419,"about_ca_topic_score_gemma":0.0024292478,"teacher_disagreement_score":0.9443154,"about_ca_system_score_codex":0.00013549905,"about_ca_system_score_gemma":0.00009659546,"threshold_uncertainty_score":0.99958843},"labels":[],"label_agreement":null},{"id":"W4254417997","doi":"10.22215/etd/2009-06606","title":"Cooperative diversity relaying techniques in wireless communication networks","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Diversity (politics); Telecommunications; Wireless; Computer science; Wireless network; Political science; Computer network; Law","score_opus":0.02678911271917237,"score_gpt":0.2874479291014515,"score_spread":0.2606588163822791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254417997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04046099,0.0074317423,0.5020384,0.0024741555,0.00081038434,0.0026885783,0.0000027442347,0.0022690382,0.44182396],"genre_scores_gemma":[0.9720852,0.014009232,0.008516591,0.0006246702,0.000034509445,0.000054692362,0.00033283525,0.000018016572,0.0043242997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809206,0.00047108845,0.0004450875,0.0004671933,0.00024587626,0.00027872474],"domain_scores_gemma":[0.9978105,0.00017661857,0.0002434646,0.0013607175,0.0003409723,0.00006774437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006143359,0.00030336357,0.00038446672,0.00029500725,0.00077974674,0.00023948222,0.0026610792,0.0003363761,0.000029060913],"category_scores_gemma":[0.00003517909,0.00031233177,0.00008363908,0.00095428893,0.000033813034,0.000654196,0.0009941134,0.0009854606,0.000010045325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036620157,0.00020788425,0.000775138,0.000019518851,0.000034372122,0.000010666679,0.00529275,0.00024080924,0.00014708584,0.2461337,0.0040207743,0.7430807],"study_design_scores_gemma":[0.002425883,0.00057309755,0.08942048,0.0051683206,0.00009124837,0.000021107871,0.002923502,0.8630456,0.010940851,0.007720478,0.012221647,0.005447791],"about_ca_topic_score_codex":0.00010075414,"about_ca_topic_score_gemma":0.00549803,"teacher_disagreement_score":0.9316242,"about_ca_system_score_codex":0.00022102015,"about_ca_system_score_gemma":0.00009785104,"threshold_uncertainty_score":0.9999329},"labels":[],"label_agreement":null},{"id":"W4255201706","doi":"10.22215/etd/2005-08282","title":"Feasibility of providing ubiquitous high data rate coverage in cellular fixed relay networks","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Relay; Computer science; Telecommunications; Physics; Power (physics)","score_opus":0.06483064590717795,"score_gpt":0.31595371083805435,"score_spread":0.2511230649308764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255201706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28519198,0.010522073,0.6631725,0.0011375312,0.0034869607,0.0035191483,0.000045268225,0.00058940053,0.032335144],"genre_scores_gemma":[0.98475087,0.0026146953,0.006374777,0.00014996862,0.0001160967,0.00002342263,0.0015531064,0.00002454083,0.004392517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717474,0.00054757006,0.0007955276,0.00086170423,0.0002598169,0.0003606693],"domain_scores_gemma":[0.9955066,0.00034617307,0.0004273305,0.003442426,0.0002058251,0.000071633636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016704953,0.0003041059,0.0005052213,0.00018280424,0.00013289678,0.00014930361,0.00381335,0.00026816668,0.00008010044],"category_scores_gemma":[0.00018219727,0.00029624943,0.00006985759,0.00076009193,0.00002808872,0.0006913517,0.0009905217,0.0007060769,0.0000100408915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006224555,0.0021279764,0.008944448,0.00086653285,0.0003210064,0.00008863741,0.007514254,0.053594425,0.015082503,0.30680147,0.014577051,0.58945924],"study_design_scores_gemma":[0.0013486638,0.00009381479,0.015485239,0.00064327224,0.000034007757,0.0000018302245,0.00017863739,0.9734602,0.004296892,0.0005460855,0.00295114,0.0009602203],"about_ca_topic_score_codex":0.00009352822,"about_ca_topic_score_gemma":0.0042188005,"teacher_disagreement_score":0.9198658,"about_ca_system_score_codex":0.0001577795,"about_ca_system_score_gemma":0.0002995457,"threshold_uncertainty_score":0.999949},"labels":[],"label_agreement":null},{"id":"W4255237665","doi":"10.1109/glocom.2014.7417874","title":"Outage Analysis and Power Savings for Independent and Coherent Decode-Forward Relaying","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; National Science Foundation","keywords":"Relay; Rayleigh fading; Channel state information; Computer science; Transmission (telecommunications); Power (physics); Outage probability; Transmitter power output; Channel (broadcasting); Fading; Electronic engineering; Telecommunications; Topology (electrical circuits); Wireless; Electrical engineering; Engineering; Transmitter; Physics","score_opus":0.04587393007878394,"score_gpt":0.32479303406683196,"score_spread":0.27891910398804803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255237665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03651142,0.0018519749,0.9467144,0.006349536,0.00017357308,0.00056772033,0.00004193768,0.00020096885,0.007588486],"genre_scores_gemma":[0.9428583,0.002095867,0.054157212,0.00059776346,0.000014224017,0.000107440304,0.000032116317,0.0000096841595,0.00012740558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997848,0.00044370498,0.00051944377,0.0005537545,0.0002527931,0.0003823136],"domain_scores_gemma":[0.99543005,0.00048394836,0.00027690994,0.003017804,0.0005233434,0.00026792218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010849445,0.00028602112,0.00045414225,0.00017251661,0.0008340347,0.00065492006,0.0026954536,0.0001309195,0.000026467826],"category_scores_gemma":[0.00020427008,0.00028595608,0.00012682173,0.00082620257,0.00026691152,0.00055478927,0.0018349644,0.0002880011,0.000018653363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025739417,0.00024211495,0.053140525,0.000028649507,0.00054737297,6.4627943e-7,0.0017147167,0.00010391306,0.00038094362,0.72177374,0.0034074378,0.21863419],"study_design_scores_gemma":[0.0018736579,0.0002549295,0.09238088,0.00013226287,0.00042427194,0.000027787753,0.00041858773,0.7871066,0.00011070849,0.014906551,0.101191685,0.0011720934],"about_ca_topic_score_codex":0.00010078822,"about_ca_topic_score_gemma":0.0021568907,"teacher_disagreement_score":0.90634686,"about_ca_system_score_codex":0.00013470958,"about_ca_system_score_gemma":0.00010867884,"threshold_uncertainty_score":0.99995923},"labels":[],"label_agreement":null},{"id":"W4256585095","doi":"10.1109/infocom.2007.284","title":"Reliability Gain of Network Coding in Lossy Wireless Networks","year":2008,"lang":"en","type":"article","venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Defense Advanced Research Projects Agency","keywords":"Linear network coding; Computer science; Computer network; Lossy compression; Multicast; Network packet; Wireless network; Hybrid automatic repeat request; Automatic repeat request; Wireless; Telecommunications","score_opus":0.0744193789523344,"score_gpt":0.28634106221853967,"score_spread":0.21192168326620525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256585095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09789198,0.0010344676,0.86308295,0.011888566,0.0009789993,0.0022585597,0.000006795461,0.00064484717,0.022212863],"genre_scores_gemma":[0.96331346,0.006463241,0.028817687,0.0009931435,0.00014738458,0.00015714976,0.0000075791627,0.000022265922,0.000078086596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969498,0.0003634527,0.0010898892,0.00053783396,0.00044357928,0.0006154287],"domain_scores_gemma":[0.99422055,0.0009850923,0.00057825353,0.003136615,0.00093410705,0.00014536873],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015479296,0.0003845769,0.0005626071,0.00022197209,0.0011543011,0.0002178485,0.007816895,0.00016634115,0.000015410735],"category_scores_gemma":[0.0000780943,0.00032597905,0.00015525428,0.0019762889,0.0008397469,0.00073004194,0.002102883,0.0012202333,0.000023697385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058279755,0.0007883938,0.015502218,0.00004402644,0.00007398872,0.0000045091097,0.009117363,0.034196027,0.00027722208,0.8714247,0.015968412,0.052544884],"study_design_scores_gemma":[0.00053544407,0.00013072974,0.015396202,0.0003882028,0.000007119068,0.00003161617,0.000053632903,0.97775114,0.000116577015,0.002095881,0.0031081808,0.0003852729],"about_ca_topic_score_codex":0.00004453176,"about_ca_topic_score_gemma":0.00008166606,"teacher_disagreement_score":0.9435551,"about_ca_system_score_codex":0.0001473937,"about_ca_system_score_gemma":0.00023850442,"threshold_uncertainty_score":0.99991924},"labels":[],"label_agreement":null},{"id":"W4280557684","doi":"10.1109/wcnc51071.2022.9771640","title":"Joint Robust Relay Beamforming and Adaptive Channel Estimation using Cubature Kalman Filtering","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Wireless Communications and Networking Conference (WCNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Beamforming; Channel state information; Computer science; Cramér–Rao bound; Kalman filter; Upper and lower bounds; Control theory (sociology); Channel (broadcasting); Signal-to-noise ratio (imaging); Adaptive beamformer; Algorithm; Wireless; Estimation theory; Power (physics); Mathematics; Telecommunications; Artificial intelligence","score_opus":0.12398326307133445,"score_gpt":0.2820280490763301,"score_spread":0.15804478600499566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280557684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058432896,0.009628248,0.9269485,0.0023078274,0.0006518461,0.00060185074,0.000014466349,0.00029050076,0.0011238629],"genre_scores_gemma":[0.9448696,0.009490273,0.044989686,0.00026685078,0.00007100519,0.00014813602,0.00004231014,0.00002595333,0.00009622703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977274,0.0005882452,0.00047227996,0.0005189268,0.00029159646,0.0004015389],"domain_scores_gemma":[0.99734765,0.00026870536,0.00034543994,0.0017548604,0.00014509317,0.00013825709],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00089047075,0.00028590264,0.00034780632,0.00022524335,0.0034954064,0.00039162123,0.0016480993,0.00007930672,0.000021212461],"category_scores_gemma":[0.000011800295,0.00032150466,0.00006178575,0.00079949386,0.00021357929,0.0006135887,0.0037039334,0.0009627445,0.0000011362802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003575022,0.00024451368,0.0003213775,0.000052123858,0.00015251384,0.000013250496,0.015696146,0.08781179,0.005975209,0.111513734,0.00045877308,0.7777248],"study_design_scores_gemma":[0.000290253,0.00008810587,0.00014992456,0.0001783821,0.000021021444,0.000085920205,0.0007008798,0.9934768,0.000067788584,0.00071034755,0.003856672,0.0003739209],"about_ca_topic_score_codex":0.000051207287,"about_ca_topic_score_gemma":0.00011359595,"teacher_disagreement_score":0.905665,"about_ca_system_score_codex":0.00015800104,"about_ca_system_score_gemma":0.000116745556,"threshold_uncertainty_score":0.9999237},"labels":[],"label_agreement":null},{"id":"W4285147830","doi":"10.1109/tit.2022.3187669","title":"State-Dependent Symbol-Wise Decode and Forward Codes Over Multihop Relay Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Linear network coding; Computer science; Header; Network packet; Upper and lower bounds; Computer network; Telecommunications link; Mathematics","score_opus":0.01148312834417782,"score_gpt":0.24025608922336264,"score_spread":0.2287729608791848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285147830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010029818,0.00013721178,0.9877249,0.000237833,0.00054519996,0.00027381143,0.000025417594,0.00022161978,0.000804177],"genre_scores_gemma":[0.9956085,0.00065122015,0.0016718773,0.0014375492,0.000009710396,0.00016682163,0.000008692305,0.00000896187,0.0004366858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998616,0.00034980362,0.00037228,0.00016389426,0.0002856508,0.00021240844],"domain_scores_gemma":[0.9988172,0.00033079117,0.00013533265,0.0005370526,0.00008300925,0.00009661697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008723391,0.00015057919,0.00013734393,0.00023904092,0.0009242794,0.00020143526,0.0005304259,0.000038621623,0.00024982874],"category_scores_gemma":[0.000008469896,0.00015320179,0.00006505112,0.00037437753,0.00005413711,0.0014676735,0.00003250328,0.00045355072,0.000036586145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009204469,0.00007935632,0.000014183284,0.000007802001,0.000044693188,0.0000010495556,0.006690669,0.6447533,0.000041543364,0.021478,0.000417724,0.3263797],"study_design_scores_gemma":[0.0010535985,0.00014762853,0.00023070822,0.000018179975,0.000015012207,0.000026854805,0.0006417224,0.9849343,0.0009400085,0.0014804743,0.010183947,0.0003276139],"about_ca_topic_score_codex":0.0000052482255,"about_ca_topic_score_gemma":0.000018368171,"teacher_disagreement_score":0.98605305,"about_ca_system_score_codex":0.00013266127,"about_ca_system_score_gemma":0.000049532788,"threshold_uncertainty_score":0.7108903},"labels":[],"label_agreement":null},{"id":"W4285710519","doi":"10.36227/techrxiv.11515575.v1","title":"Enhanced Huffman Coded OFDM with \\\\Index Modulation","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"King Abdullah University of Science and Technology","keywords":"Huffman coding; Orthogonal frequency-division multiplexing; Computer science; Subcarrier; Block Error Rate; Algorithm; Channel state information; Transmission (telecommunications); Burstiness; Channel (broadcasting); Real-time computing; Telecommunications link; Data compression; Computer network; Telecommunications","score_opus":0.056139036557003946,"score_gpt":0.2904250622010499,"score_spread":0.23428602564404596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285710519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020387168,0.000102528815,0.9694942,0.004786491,0.00017535598,0.00034281268,0.0000011267643,0.00045680747,0.02260195],"genre_scores_gemma":[0.9532236,0.00019682058,0.044852875,0.00086208456,0.00007653456,0.0000506978,0.000027591037,0.000013838867,0.00069597777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985526,0.00013462485,0.00025558408,0.0006024858,0.00027841754,0.00017629606],"domain_scores_gemma":[0.9980728,0.000055911984,0.00016663023,0.0013716783,0.00022718614,0.0001057958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013826496,0.00023114764,0.00026299106,0.00007841629,0.00014211652,0.00030321247,0.0015940301,0.000113216636,0.00007537122],"category_scores_gemma":[0.000020889776,0.00019414863,0.000061625644,0.00033567287,0.000035803987,0.00019657507,0.002242633,0.00050722546,0.000055821194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057923586,0.00015860438,0.000352113,0.00008355833,0.00019562998,0.00001058941,0.004783129,0.10979644,0.0073536183,0.6445217,0.004098531,0.22858816],"study_design_scores_gemma":[0.00030048558,0.000047612182,0.003218478,0.00009069016,0.0000043475256,0.0000013676304,0.00001272196,0.9877586,0.0028392742,0.0037533245,0.0016189422,0.000354207],"about_ca_topic_score_codex":0.000010206868,"about_ca_topic_score_gemma":0.000118194286,"teacher_disagreement_score":0.95118487,"about_ca_system_score_codex":0.00006225138,"about_ca_system_score_gemma":0.0001488931,"threshold_uncertainty_score":0.79171515},"labels":[],"label_agreement":null},{"id":"W4286457470","doi":"10.18280/isi.270314","title":"Impact of Strategy Optimization on Game-Based CR-MAC Protocol Performance","year":2022,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Game theory; Computer network; Protocol (science); Quality of service; Wireless network; Interval (graph theory); Node (physics); Network performance; Wireless; Distributed computing; Mathematical optimization; Mathematics; Telecommunications; Engineering","score_opus":0.03156510630594158,"score_gpt":0.290782087252351,"score_spread":0.25921698094640944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286457470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09026498,0.000022923969,0.8806991,0.00006791804,0.00012612288,0.01714182,0.000017921526,0.00029977126,0.011359411],"genre_scores_gemma":[0.9849379,0.000009732738,0.003929603,0.00011315504,0.000011107436,0.010926573,0.000049354145,0.000006229842,0.000016360098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987003,0.00017884087,0.00048788788,0.000112446825,0.000333875,0.00018661073],"domain_scores_gemma":[0.9986897,0.00005734584,0.00040704038,0.0005113425,0.00028593064,0.00004864245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045784176,0.00013773375,0.0001484285,0.00028719837,0.00042259364,0.0001676709,0.00066968513,0.00003168139,0.00019046046],"category_scores_gemma":[0.00005194422,0.0001286524,0.00007892894,0.00084810035,0.00005097758,0.0019705936,0.00020404313,0.00017758577,0.000013003081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053637923,0.00005093088,0.00067393057,0.000046566067,0.000009114194,1.6996603e-7,0.0009844525,0.8537915,0.000043372744,0.0022255967,0.00013902674,0.14198172],"study_design_scores_gemma":[0.0006257349,0.00090956147,0.0074001215,0.00005222057,0.000001916466,0.000004789648,0.000046740388,0.989146,0.00055401743,0.00007243555,0.0010375853,0.00014887717],"about_ca_topic_score_codex":0.000010066573,"about_ca_topic_score_gemma":7.744377e-7,"teacher_disagreement_score":0.8946729,"about_ca_system_score_codex":0.0004351578,"about_ca_system_score_gemma":0.0002887952,"threshold_uncertainty_score":0.5246293},"labels":[],"label_agreement":null},{"id":"W4287094554","doi":"10.1049/cje.2020.00.049","title":"MSK‐PK: A Public‐Key Encryption Cryptosystem with Multiple Secret‐Keys","year":2022,"lang":"en","type":"article","venue":"Chinese Journal of Electronics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Computer network; Probabilistic encryption; Ciphertext; Attribute-based encryption; Public-key cryptography; Linear network coding; Cryptosystem; Computer security; Theoretical computer science; Network packet","score_opus":0.015461639099881097,"score_gpt":0.24051493060131296,"score_spread":0.22505329150143186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287094554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5421128,0.0110137975,0.4396544,0.0052161072,0.000430744,0.00023276829,0.0000017996072,0.00009055176,0.0012469966],"genre_scores_gemma":[0.99318945,0.0008287878,0.0054040547,0.00030526108,0.00013177149,0.00001406524,0.0000039375022,0.000015595037,0.00010707336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980163,0.00043345976,0.00045155516,0.00018813937,0.0005644554,0.00034607103],"domain_scores_gemma":[0.998147,0.0001866367,0.00051741896,0.000552082,0.00046038005,0.00013649666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011724569,0.0001777095,0.00028669083,0.00024531118,0.00058677193,0.00020751414,0.0016054292,0.00002989365,0.00007115773],"category_scores_gemma":[0.00014413301,0.00012661512,0.000120376135,0.0011726893,0.00002508255,0.0007340751,0.000452843,0.00082428334,0.000004319139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010018892,0.0026237972,0.09470755,0.00014409411,0.0013509433,0.00037745567,0.022130229,0.04972042,0.06355645,0.5167393,0.017394653,0.23025319],"study_design_scores_gemma":[0.0061917743,0.0046705054,0.008426931,0.00012612625,0.000053489384,0.003796636,0.00046377984,0.5346907,0.0009185175,0.0066552744,0.43289262,0.0011136619],"about_ca_topic_score_codex":9.995061e-7,"about_ca_topic_score_gemma":0.000065188986,"teacher_disagreement_score":0.51008403,"about_ca_system_score_codex":0.0003958464,"about_ca_system_score_gemma":0.0006074448,"threshold_uncertainty_score":0.5163215},"labels":[],"label_agreement":null},{"id":"W4287331457","doi":"10.48550/arxiv.2102.03405","title":"Throughput Maximization of Network-Coded and Multi-Level Cache-Enabled\\n Heterogeneous Network","year":2021,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"","keywords":"Computer science; Cache; Scheduling (production processes); Schedule; Linear network coding; Base station; Transmitter power output; Maximization; Computer network; Exploit; Edge device; Distributed computing; Transmitter; Mathematical optimization; Channel (broadcasting); Cloud computing","score_opus":0.17612150185945474,"score_gpt":0.22293717467142027,"score_spread":0.046815672811965525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287331457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09103668,0.006073536,0.90020466,0.00013101689,0.0010632458,0.00072892604,0.000014699823,0.0001258771,0.00062138983],"genre_scores_gemma":[0.92804664,0.03690238,0.032649778,0.00025901385,0.00024036676,0.0000031488532,0.00007820699,0.00005392601,0.0017665459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99420035,0.0014953227,0.00092366216,0.0021756452,0.00021243177,0.0009925661],"domain_scores_gemma":[0.9939563,0.00042576468,0.0011054005,0.0029507747,0.001172798,0.00038892508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097261806,0.0008326855,0.0011892568,0.00019187514,0.001004044,0.00042764694,0.0025804513,0.0006317111,0.00018274145],"category_scores_gemma":[0.000100943944,0.0010571044,0.00041569743,0.0023415638,0.0004965255,0.0007783031,0.007872607,0.0011069677,0.000016133436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069552465,0.00023723609,0.004665988,0.00012595353,0.00037303063,0.00015050001,0.0011483544,0.96015656,0.000056399767,0.023724638,0.00018334258,0.009108452],"study_design_scores_gemma":[0.0014583895,0.00010484489,0.0033279462,0.00075685815,0.00022714661,0.000034059467,0.00013721903,0.99059314,0.00015843267,0.0016610826,0.0005849276,0.00095594145],"about_ca_topic_score_codex":0.000106228275,"about_ca_topic_score_gemma":0.0008916277,"teacher_disagreement_score":0.86755484,"about_ca_system_score_codex":0.00029674766,"about_ca_system_score_gemma":0.0005400117,"threshold_uncertainty_score":0.99918795},"labels":[],"label_agreement":null},{"id":"W4287367045","doi":"10.48550/arxiv.2101.11762","title":"On the Performance of Large-Scale Wireless Networks in the Finite\\n Block-Length Regime","year":2021,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Linear network coding; Coding (social sciences); Computer science; Wireless network; Outage probability; Stochastic geometry; Code rate; Block code; Latency (audio); Upper and lower bounds; Algorithm; Wireless; Mathematical optimization; Mathematics; Applied mathematics; Theoretical computer science; Discrete mathematics; Decoding methods; Statistics; Fading; Telecommunications; Computer network","score_opus":0.06522235372999836,"score_gpt":0.20171703787817674,"score_spread":0.1364946841481784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287367045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91480005,0.00050014566,0.07890821,0.0011379867,0.0004844602,0.000627179,0.000004954162,0.000037867016,0.0034991167],"genre_scores_gemma":[0.981258,0.016821329,0.00007565302,0.0009075802,0.00007960676,0.0000048555703,0.000012456561,0.000020095895,0.0008204376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951439,0.002211331,0.0005640138,0.0011751185,0.00025347425,0.0006521712],"domain_scores_gemma":[0.99225503,0.0024361303,0.00059730775,0.0041665626,0.00043927133,0.00010570482],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022805436,0.00050942,0.0005844029,0.00021915711,0.0008604904,0.00025785892,0.006465641,0.00032735776,0.00013918141],"category_scores_gemma":[0.00009323567,0.0003991394,0.00034693017,0.0029571021,0.0004165521,0.00035305045,0.0038437324,0.002344823,0.00002712499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075436044,0.00048908574,0.002542942,0.00004388511,0.00007913163,0.000061481885,0.0061460813,0.84812534,0.000010738726,0.14032692,0.00023635074,0.0018626198],"study_design_scores_gemma":[0.0005667353,0.00013578944,0.0035722114,0.0007991985,0.000047365418,0.0000049593796,0.0015626061,0.9918052,0.00008519615,0.00025761322,0.0007383703,0.0004247754],"about_ca_topic_score_codex":0.000025404319,"about_ca_topic_score_gemma":0.00040797747,"teacher_disagreement_score":0.14367986,"about_ca_system_score_codex":0.00017327744,"about_ca_system_score_gemma":0.0003104213,"threshold_uncertainty_score":0.9999568},"labels":[],"label_agreement":null},{"id":"W4287725352","doi":"10.48550/arxiv.2007.05370","title":"Design and Practical Decoding of Full-Diversity Construction A Lattices\\n for Block-Fading Channels","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Fading; Decoding methods; Lattice (music); List decoding; Algorithm; Computer science; Binary number; Algebraic structure; Mathematics; Block code; Theoretical computer science; Topology (electrical circuits); Concatenated error correction code; Arithmetic; Combinatorics; Pure mathematics; Physics","score_opus":0.2421524679573243,"score_gpt":0.25746737686360777,"score_spread":0.015314908906283453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287725352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053481705,0.000074589865,0.94475913,0.00066175323,0.00029220604,0.00047405585,0.0000040970267,0.000103686114,0.00014876788],"genre_scores_gemma":[0.8824345,0.00068639487,0.11672553,0.00006773542,0.00004065194,0.0000013306558,0.000003489407,0.0000076199917,0.00003273745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985971,0.00026301047,0.00019430085,0.0006725804,0.00007107903,0.0002019617],"domain_scores_gemma":[0.998065,0.00065206195,0.00034187717,0.0005219885,0.00027738226,0.00014166627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004430024,0.00020036509,0.00032064805,0.00015719631,0.00043097913,0.000099737736,0.0007067217,0.00016688551,0.0000065035074],"category_scores_gemma":[0.0001542592,0.0002467463,0.00010431397,0.0003803171,0.00014332916,0.00039572862,0.0041062315,0.00037485058,0.000002956262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041564234,0.00015981494,0.0014655846,0.00042864363,0.0004809347,0.00011085736,0.0051035355,0.27231446,0.002129011,0.71029425,0.00062592153,0.0064713527],"study_design_scores_gemma":[0.00053039845,0.00009333542,0.00005423884,0.000106964755,0.00009027646,0.000019359473,0.0001098592,0.98663634,0.00044836837,0.011496474,0.00015864798,0.00025575198],"about_ca_topic_score_codex":0.000006313581,"about_ca_topic_score_gemma":0.000004701862,"teacher_disagreement_score":0.8289528,"about_ca_system_score_codex":0.00009136213,"about_ca_system_score_gemma":0.0001441738,"threshold_uncertainty_score":0.99999845},"labels":[],"label_agreement":null},{"id":"W4287725505","doi":"10.48550/arxiv.2007.04573","title":"Completion Time Minimization in Fog-RANs using D2D Communications and\\n Rate-Aware Network Coding","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"","keywords":"Computer science; Linear network coding; Scheduling (production processes); Exploit; Telecommunications link; Mathematical optimization; Minification; Radio access network; Computer network; Mathematics; Base station","score_opus":0.20034807823187697,"score_gpt":0.23689729271785323,"score_spread":0.036549214485976256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287725505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029649276,0.00037264905,0.9671838,0.0011808544,0.00016077932,0.00042976244,0.0000072678495,0.0002101237,0.00080546655],"genre_scores_gemma":[0.9872308,0.0037045653,0.008521574,0.00029748914,0.000051141305,0.0000018631744,0.000089142726,0.000018368648,0.00008504912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977985,0.00083515135,0.0003136271,0.0007111004,0.000065859706,0.00027575012],"domain_scores_gemma":[0.99754465,0.00030951732,0.00027051612,0.0015606238,0.00018707877,0.00012760227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004072489,0.0002647085,0.00037569486,0.00020033093,0.00046351564,0.00019712023,0.0020316339,0.0001863551,0.000019314835],"category_scores_gemma":[0.000026153015,0.00034888033,0.000086723245,0.0011590276,0.00014061038,0.00039473225,0.00436837,0.0006647002,0.000020659838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055368946,0.00016671854,0.012473961,0.000120220444,0.00012509649,0.00006197829,0.002322542,0.7144822,0.0006477105,0.26429504,0.0008475691,0.0044016256],"study_design_scores_gemma":[0.00038547238,0.000019310275,0.0018763617,0.00026460667,0.000029527113,0.0000021514209,0.000039399314,0.9921804,0.000008230607,0.004075164,0.0007865157,0.00033286185],"about_ca_topic_score_codex":0.000048707607,"about_ca_topic_score_gemma":0.00014731695,"teacher_disagreement_score":0.9586623,"about_ca_system_score_codex":0.0002482601,"about_ca_system_score_gemma":0.00014775441,"threshold_uncertainty_score":0.99989635},"labels":[],"label_agreement":null},{"id":"W4287870173","doi":"10.48550/arxiv.2002.02641","title":"Deterministic Leader Election in Anonymous Radio Networks","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Leader election; Node (physics); Computer science; Time complexity; Strongly connected component; Simple (philosophy); Graph; Discrete mathematics; Theoretical computer science; Topology (electrical circuits); Computer network; Combinatorics; Mathematics; Algorithm; Engineering","score_opus":0.1254631350919489,"score_gpt":0.21326976018395544,"score_spread":0.08780662509200654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287870173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019786954,0.00032331137,0.9756811,0.00046645355,0.00050937576,0.00026901937,0.0000010560901,0.0002564699,0.0027062427],"genre_scores_gemma":[0.9967969,0.0014128793,0.00073864486,0.00030681503,0.000103141,0.0000019101137,0.000011781624,0.000015129837,0.00061277015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982481,0.00032287536,0.00021942359,0.00084956933,0.000055497916,0.00030450465],"domain_scores_gemma":[0.9984597,0.00012557044,0.00016193656,0.0010318316,0.000090202244,0.00013077805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018836679,0.00025473232,0.00030436544,0.00021363409,0.00015348906,0.0001458036,0.0017957952,0.00022086543,0.00002636372],"category_scores_gemma":[0.000041211315,0.00031871238,0.00011935806,0.0010433719,0.00006870074,0.00023488539,0.0018060937,0.0009783811,0.000045120567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046956782,0.00012648673,0.0026432665,0.000047436057,0.00006361094,0.0005126642,0.00080946373,0.8480443,0.00008685483,0.13308708,0.0013503773,0.013181542],"study_design_scores_gemma":[0.00032080468,0.000040882027,0.002041724,0.00007228339,0.00001531293,0.000005589759,0.00001803507,0.99265295,0.000021766606,0.0035115394,0.00096568913,0.00033341543],"about_ca_topic_score_codex":0.000022908815,"about_ca_topic_score_gemma":0.00019968675,"teacher_disagreement_score":0.97700995,"about_ca_system_score_codex":0.00027038556,"about_ca_system_score_gemma":0.00016377943,"threshold_uncertainty_score":0.9999265},"labels":[],"label_agreement":null},{"id":"W4288639223","doi":"10.48550/arxiv.1901.03274","title":"Towards an Algebraic Network Information Theory: Simultaneous Joint\\n Typicality Decoding","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Code word; Computer science; Tuple; Conjunction (astronomy); Joint (building); Key (lock); List decoding; Theoretical computer science; Algorithm; Sequential decoding; Channel (broadcasting); Mathematics; Discrete mathematics; Concatenated error correction code; Computer network; Block code","score_opus":0.09256611397919928,"score_gpt":0.2193195523393387,"score_spread":0.12675343836013941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288639223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08155741,0.00027938932,0.9025463,0.00026268628,0.0019858426,0.0010476045,0.000020564199,0.00041411183,0.011886115],"genre_scores_gemma":[0.9903736,0.0037051004,0.0031940786,0.0010849632,0.0003056253,0.0000025336733,0.00013142369,0.000036905967,0.0011657814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935483,0.0024650446,0.0009856896,0.0016242984,0.00028880217,0.0010878739],"domain_scores_gemma":[0.9919036,0.00088559877,0.0010762075,0.0044634272,0.0010699384,0.00060123997],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027462787,0.0008819368,0.00096861756,0.0003852396,0.0012360668,0.0010563226,0.0048694983,0.00072186225,0.00062737596],"category_scores_gemma":[0.00051421457,0.0010407248,0.00048870465,0.0019781834,0.00037080253,0.0034272275,0.0064687897,0.0018908182,0.0011971468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115949464,0.000091552356,0.00040237283,0.000057487956,0.0001095299,0.000025841331,0.0011429879,0.5221476,0.0000053270037,0.43071824,0.00014951381,0.0450336],"study_design_scores_gemma":[0.00082025595,0.00019589465,0.0014671588,0.00031345748,0.00012476991,0.0000107543365,0.0002408982,0.93408877,0.00002690964,0.05418071,0.007412134,0.0011182937],"about_ca_topic_score_codex":0.000047588313,"about_ca_topic_score_gemma":0.00009386909,"teacher_disagreement_score":0.90881616,"about_ca_system_score_codex":0.00076456874,"about_ca_system_score_gemma":0.0008361751,"threshold_uncertainty_score":0.9999807},"labels":[],"label_agreement":null},{"id":"W4289713080","doi":"10.1109/isit50566.2022.9834362","title":"Coded Categorization in Massive Random Access","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Order (exchange); Base (topology); Combinatorics; Listing (finance); Set (abstract data type); Computer science; Code (set theory); Discrete mathematics; Algorithm; Information retrieval; Mathematics; Programming language","score_opus":0.01878982412312522,"score_gpt":0.2801590760765341,"score_spread":0.2613692519534089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289713080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024103792,0.00007395532,0.85543334,0.013463379,0.006130929,0.0011010849,0.00007636795,0.0003824823,0.09923464],"genre_scores_gemma":[0.9942429,0.00018186744,0.0001885435,0.0039133425,0.000076798686,0.00035655967,0.00024746155,0.000009276876,0.0007832551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977501,0.0005308652,0.00059521786,0.00022607147,0.00069907773,0.00019864144],"domain_scores_gemma":[0.9985667,0.00032658863,0.00034267554,0.00048993656,0.00021556822,0.000058530426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001256405,0.00016514274,0.00016033163,0.00047633002,0.0004523743,0.00047558825,0.0023542778,0.000040150284,0.0008956591],"category_scores_gemma":[0.00008650773,0.00017432199,0.000077139746,0.0008061388,0.000031160846,0.0030548712,0.0007781264,0.00038712862,0.0001363964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030584983,0.00012266038,0.0003248451,0.000005619241,0.000040672534,0.0000047445296,0.0043771733,0.19652307,0.0007989042,0.77603984,0.0042402195,0.017216379],"study_design_scores_gemma":[0.0049540508,0.00018488285,0.0015876326,0.000038486523,0.000008502234,0.000028344863,0.00063370966,0.8781642,0.0045960634,0.021103535,0.08807781,0.0006227939],"about_ca_topic_score_codex":0.000011103089,"about_ca_topic_score_gemma":0.000009381835,"teacher_disagreement_score":0.9701391,"about_ca_system_score_codex":0.00057046453,"about_ca_system_score_gemma":0.00008653143,"threshold_uncertainty_score":0.98068386},"labels":[],"label_agreement":null},{"id":"W4289828924","doi":"10.1109/med54222.2022.9837234","title":"Comparison of Cellular Network Controllers for Quadrotors Experiencing Time Delay","year":2022,"lang":"en","type":"article","venue":"2022 30th Mediterranean Conference on Control and Automation (MED)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Mitacs","keywords":"Estimator; Control theory (sociology); Backstepping; Controller (irrigation); Computer science; Nonlinear system; State (computer science); Mathematics; Control (management); Adaptive control; Algorithm; Artificial intelligence","score_opus":0.04974361633178897,"score_gpt":0.30422278715037276,"score_spread":0.2544791708185838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289828924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08371392,0.002425806,0.8978075,0.0079651205,0.001968096,0.0029378447,0.00006968658,0.00048591453,0.0026261515],"genre_scores_gemma":[0.99683756,0.0000530864,0.001417964,0.00060157,0.0001459538,0.0005987492,0.000054907385,0.000015206493,0.0002749854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974769,0.00054527324,0.0006696852,0.00043759868,0.0005148756,0.00035568263],"domain_scores_gemma":[0.9979749,0.00067493686,0.0004617785,0.0005414964,0.00020919672,0.00013770137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011125053,0.00023534945,0.00057234167,0.00016239149,0.00083426986,0.0001238179,0.00082773826,0.000056753,0.00046201845],"category_scores_gemma":[0.00011101955,0.00022921071,0.00011714873,0.000366941,0.00009451791,0.00029888278,0.00023261615,0.0002774276,0.000007221026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009694784,0.0008712945,0.0013123681,0.00014733065,0.00044580293,0.000017281953,0.046161238,0.038192973,0.08412478,0.26850978,0.036438443,0.52280927],"study_design_scores_gemma":[0.0025233913,0.00055339513,0.0002829497,0.000042254705,0.000019569767,0.000003330006,0.00054738653,0.98346096,0.00038626464,0.00038136402,0.011549238,0.0002498981],"about_ca_topic_score_codex":0.0000038118853,"about_ca_topic_score_gemma":0.000008314553,"teacher_disagreement_score":0.945268,"about_ca_system_score_codex":0.00007186892,"about_ca_system_score_gemma":0.00014526655,"threshold_uncertainty_score":0.9346941},"labels":[],"label_agreement":null},{"id":"W4293195439","doi":"10.1109/twc.2022.3175028","title":"An Error Propagation Free Decode and Forward Scheme for Channel-Unaware Two-Way Relay Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Block Error Rate; Computer science; Differential (mechanical device); Channel (broadcasting); Decoding methods; Algorithm; Block (permutation group theory); Signal-to-noise ratio (imaging); Signalling; Relay channel; Bit error rate; Topology (electrical circuits); Telecommunications; Mathematics; Telecommunications link","score_opus":0.0472089873927466,"score_gpt":0.30587109874796087,"score_spread":0.2586621113552143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293195439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005141384,0.00051035703,0.9860743,0.006346891,0.00031555674,0.0009632557,0.000074700365,0.00039275497,0.00018078681],"genre_scores_gemma":[0.94785523,0.00095471996,0.04795507,0.0006939179,0.000029728466,0.0022395235,0.00007120841,0.00003931251,0.00016130318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977955,0.0006441655,0.00044563937,0.00050384895,0.00026448144,0.0003463425],"domain_scores_gemma":[0.99446,0.00050738314,0.0001897349,0.0044103065,0.00025947145,0.0001731463],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00071709754,0.0002460912,0.00025167715,0.00025952564,0.004029877,0.00020934119,0.0036991455,0.00007244892,0.000028838509],"category_scores_gemma":[0.000012679542,0.00027934636,0.00012192949,0.000855999,0.00015968546,0.00070564606,0.0001433794,0.0007466802,0.0000039230044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000136795,0.0020832822,0.000062846964,0.000035624264,0.00020040857,0.0000016883214,0.0058562676,0.56858313,0.0032511586,0.11246392,0.0018414394,0.30548343],"study_design_scores_gemma":[0.0010107587,0.00026702406,0.00007098564,0.000028196617,0.000024434941,0.000015008923,0.0002269457,0.99221796,0.0006290426,0.00060658803,0.0045726215,0.00033041273],"about_ca_topic_score_codex":0.000027213946,"about_ca_topic_score_gemma":0.0007311292,"teacher_disagreement_score":0.94271386,"about_ca_system_score_codex":0.00018359665,"about_ca_system_score_gemma":0.00010600482,"threshold_uncertainty_score":0.99996585},"labels":[],"label_agreement":null},{"id":"W4296339049","doi":"10.1109/tvt.2022.3207410","title":"Joint Channel Estimation and Robust Beamforming Design for AF Relaying Using IMM Kalman Filters","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Channel state information; Relay; Kalman filter; Transmitter; Cramér–Rao bound; Computer science; Relay channel; Control theory (sociology); Transmission (telecommunications); Channel (broadcasting); Extended Kalman filter; Electronic engineering; Wireless; Algorithm; Engineering; Estimation theory; Telecommunications; Power (physics); Artificial intelligence","score_opus":0.07392030964891355,"score_gpt":0.26855831618448106,"score_spread":0.1946380065355675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296339049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017558103,0.000249056,0.9791385,0.0019897749,0.00024711862,0.0004841848,0.0000034261705,0.00032116208,0.000008661013],"genre_scores_gemma":[0.7502054,0.00007634457,0.24924906,0.00015363844,0.0000058528267,0.0002690163,0.0000016662366,0.000014255254,0.000024751971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893194,0.00010617798,0.00023598605,0.00034767907,0.00013217598,0.00024602993],"domain_scores_gemma":[0.99920416,0.00009105324,0.000097657394,0.0005042241,0.00006393987,0.00003894029],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042184757,0.00014275448,0.0001683759,0.00052564446,0.0015174681,0.00005419565,0.00044664377,0.00008493231,0.000008163377],"category_scores_gemma":[0.000012477394,0.000161334,0.000064525164,0.00070930395,0.0000681578,0.0002444735,0.000030049465,0.0003927043,0.0000015114701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008741468,0.00004872848,6.0952453e-7,0.0000070959704,0.000023994178,0.0000028022612,0.00029758978,0.9124955,0.011060552,0.0022962233,0.000018595405,0.07373958],"study_design_scores_gemma":[0.00037229605,0.0001992782,0.0000021765832,0.0000261006,0.00001796531,0.00010064885,0.00017140205,0.9730834,0.024536159,0.0010244544,0.00029479273,0.00017132938],"about_ca_topic_score_codex":0.0000036897143,"about_ca_topic_score_gemma":0.0000035162002,"teacher_disagreement_score":0.7326473,"about_ca_system_score_codex":0.00016834965,"about_ca_system_score_gemma":0.000046002464,"threshold_uncertainty_score":0.99978244},"labels":[],"label_agreement":null},{"id":"W4296715309","doi":"10.18280/mmep.090409","title":"Performance Evaluation of IPTV Zapping Time Reduction Using Edge Processing of Fog RAN","year":2022,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"IPTV; Computer network; Latency (audio); Computer science; Cloud computing; Radio access network; Enhanced Data Rates for GSM Evolution; Access network; Wireless; Internet Protocol; The Internet; Base station; Telecommunications; Operating system","score_opus":0.08430663718815468,"score_gpt":0.2630036600548468,"score_spread":0.17869702286669215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296715309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35527852,0.00042917582,0.643888,0.000020983221,0.000027513253,0.00012380588,2.0878038e-7,0.0000369584,0.00019480915],"genre_scores_gemma":[0.92807853,0.00004274728,0.07182279,0.0000014000738,0.000010851686,0.000023272061,9.0701434e-7,0.000008483959,0.000010986819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899435,0.000056562403,0.00031244714,0.00014722884,0.0003687582,0.000120675526],"domain_scores_gemma":[0.999423,0.00004270289,0.00010976067,0.00021465342,0.00018116951,0.000028673123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016224459,0.00008496683,0.00016913199,0.00010771603,0.00016130276,0.000025224806,0.000215362,0.000020559604,0.000011514419],"category_scores_gemma":[0.000028715884,0.000086973836,0.000026827014,0.00032065003,0.000020609115,0.00019234144,0.00017660737,0.00012713892,4.5400895e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013163817,0.000028490049,0.000002821688,0.00019448783,0.0000066215075,2.0388004e-8,0.0018549097,0.96846706,0.013124282,0.0019599877,8.477417e-7,0.014359172],"study_design_scores_gemma":[0.00015223796,0.000029661705,0.000006218203,0.0002763459,0.000016660742,0.000013021109,0.000024650362,0.9973228,0.0011484056,0.0009069782,0.000013109227,0.0000899136],"about_ca_topic_score_codex":0.0000011779393,"about_ca_topic_score_gemma":1.536507e-8,"teacher_disagreement_score":0.57280004,"about_ca_system_score_codex":0.000057604986,"about_ca_system_score_gemma":0.0000572221,"threshold_uncertainty_score":0.354669},"labels":[],"label_agreement":null},{"id":"W4297068022","doi":"10.48550/arxiv.1203.1892","title":"Restricted Isometry Property in Quantized Network Coding of Sparse\\n Messages","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Restricted isometry property; Linear network coding; Decoding methods; Gaussian; Coding (social sciences); Matrix (chemical analysis); Distributed source coding; Algorithm; Compressed sensing; Mathematics; Computer science; Property (philosophy); Discrete mathematics; Theoretical computer science; Combinatorics; Topology (electrical circuits); Channel code; Physics; Statistics; Computer network","score_opus":0.16203620344170888,"score_gpt":0.2290128523288883,"score_spread":0.06697664888717941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297068022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3249615,0.0028541107,0.6562865,0.00035903708,0.0011631789,0.00095080404,0.0000074950744,0.0003731185,0.013044262],"genre_scores_gemma":[0.9905956,0.0053486787,0.0029981248,0.000053410982,0.000067333385,0.0000017320107,0.00001079499,0.000015273085,0.0009090732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977765,0.0006162621,0.0003872192,0.0006684549,0.0001092035,0.00044235555],"domain_scores_gemma":[0.9973419,0.00027914092,0.00041346325,0.0016293257,0.00021036905,0.00012584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006176026,0.00028608076,0.0005247329,0.00040851798,0.00014392006,0.00006961739,0.0024633058,0.0002534392,0.00003962382],"category_scores_gemma":[0.00009616132,0.0002656964,0.00015035867,0.0022279068,0.00011296809,0.00039436357,0.0036298262,0.00078610354,0.000018703911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015379669,0.00058479124,0.08795505,0.00026950677,0.00023958285,0.00013101062,0.0014177995,0.267694,0.0007622361,0.62969315,0.0025930798,0.008506009],"study_design_scores_gemma":[0.0015658756,0.00006109974,0.04046738,0.0011279944,0.000073031675,0.000003980818,0.000104889834,0.9462767,0.000328152,0.006134897,0.0028572688,0.0009987103],"about_ca_topic_score_codex":0.0000921626,"about_ca_topic_score_gemma":0.00012235403,"teacher_disagreement_score":0.6785827,"about_ca_system_score_codex":0.00017302559,"about_ca_system_score_gemma":0.00018782174,"threshold_uncertainty_score":0.9999795},"labels":[],"label_agreement":null},{"id":"W4298170445","doi":"10.48550/arxiv.1102.3413","title":"The Capacity Region of p-Transmitter/q-Receiver Multiple-Access Channels\\n with Common Information","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transmitter; Fading; Channel state information; Rayleigh fading; Computer science; Dirty paper coding; Channel (broadcasting); Channel capacity; Gaussian; Throughput; Computer network; Decoding methods; Encoder; Topology (electrical circuits); Telecommunications; MIMO; Wireless; Precoding; Mathematics; Physics; Combinatorics","score_opus":0.1455893840947687,"score_gpt":0.2035888629210134,"score_spread":0.057999478826244705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298170445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25126973,0.00007024758,0.74398017,0.0002306283,0.00033446273,0.00042363003,0.000004051566,0.00012018758,0.0035669166],"genre_scores_gemma":[0.99768394,0.0016761152,0.00037018725,0.00010515768,0.000018565252,0.0000027884857,0.000010622782,0.0000071385184,0.00012545583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988421,0.00026269036,0.00024862678,0.00033262707,0.00009402357,0.00021990706],"domain_scores_gemma":[0.9973601,0.00018593416,0.00045842867,0.0015279548,0.00038878585,0.000078812714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002535303,0.00022661216,0.0002476205,0.00014923369,0.00037440646,0.0001930289,0.0031724633,0.0001398065,0.000005436613],"category_scores_gemma":[0.000018979334,0.00018208814,0.00010695333,0.00052279024,0.0002463075,0.0012560732,0.0015697987,0.0005080739,0.0000108193435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057464035,0.00032056592,0.033245176,0.0003436048,0.0005190103,0.00006289687,0.0135412095,0.18878144,0.000035852005,0.71861875,0.0018701215,0.042086743],"study_design_scores_gemma":[0.0014820489,0.00018382206,0.018194517,0.00055843795,0.00008900364,0.000016667349,0.00018099482,0.952925,0.0012296335,0.016063375,0.008152092,0.0009243604],"about_ca_topic_score_codex":0.00023541642,"about_ca_topic_score_gemma":0.00045207294,"teacher_disagreement_score":0.7641436,"about_ca_system_score_codex":0.000088175424,"about_ca_system_score_gemma":0.00009111451,"threshold_uncertainty_score":0.7425339},"labels":[],"label_agreement":null},{"id":"W4298733087","doi":"10.48550/arxiv.1202.3468","title":"Partially-blind Estimation of Reciprocal Channels for AF Two-Way Relay\\n Networks Employing M-PSK Modulation","year":2012,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Channel (broadcasting); Cramér–Rao bound; Statistics; Mathematics; Relay; Signal-to-noise ratio (imaging); Algorithm; Upper and lower bounds; Unbiased Estimation; Modulation (music); Variance (accounting); Reciprocal; Computer science; Telecommunications; Physics","score_opus":0.17927034516300683,"score_gpt":0.2581941074995253,"score_spread":0.07892376233651849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298733087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122469865,0.0005805137,0.8727808,0.00013657537,0.0019526023,0.0015784738,0.000010479503,0.00014330936,0.00034737136],"genre_scores_gemma":[0.98511124,0.0017469043,0.011698468,0.00006779787,0.00050150306,0.000018998422,0.00012759479,0.000055884226,0.000671583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955214,0.00080204086,0.0010404759,0.0015314627,0.00022404143,0.00088056305],"domain_scores_gemma":[0.9940825,0.00072736846,0.001436026,0.002283049,0.0010887571,0.0003822604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018469796,0.000686284,0.0008657578,0.00046657366,0.00091317913,0.0002535376,0.0023205343,0.0006084435,0.00007461781],"category_scores_gemma":[0.000211282,0.0008621454,0.0005156365,0.0015873509,0.00029288128,0.0015203593,0.0024510347,0.00096455385,0.000036116493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031251967,0.00021256869,0.0007084321,0.00008954713,0.00014333453,0.0000034750897,0.0012025473,0.87426305,0.000072749666,0.08499122,0.000057487494,0.03794308],"study_design_scores_gemma":[0.0022652156,0.00014701577,0.0010184621,0.00055186456,0.0002216464,0.000003523544,0.000052910305,0.9900545,0.00027416405,0.0041857697,0.0004247046,0.000800241],"about_ca_topic_score_codex":0.000044430766,"about_ca_topic_score_gemma":0.00008020231,"teacher_disagreement_score":0.8626414,"about_ca_system_score_codex":0.0004277445,"about_ca_system_score_gemma":0.00027387516,"threshold_uncertainty_score":0.9993829},"labels":[],"label_agreement":null},{"id":"W4298860136","doi":"10.48550/arxiv.1311.0843","title":"Resource Allocation for Network-Integrated Device-to-Device\\n Communications Using Smart Relays","year":2013,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; Computer science; Computer network; Resource allocation; Throughput; Quality of service; Cellular network; Spectral efficiency; Distributed computing; Power (physics); Wireless; Telecommunications","score_opus":0.22571173552473942,"score_gpt":0.25745996663924275,"score_spread":0.03174823111450334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298860136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03707055,0.0014021032,0.9495973,0.0021250963,0.00092596584,0.0044380664,0.000034217148,0.00037468938,0.004032022],"genre_scores_gemma":[0.9220351,0.0037748804,0.06819234,0.0015894187,0.00031861654,0.00006652646,0.00031041115,0.000102637256,0.003610098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99328905,0.0019757368,0.0011305468,0.00200494,0.00022040098,0.001379332],"domain_scores_gemma":[0.98634386,0.0014262298,0.0011200139,0.008066216,0.0022055716,0.0008381243],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002136777,0.000981639,0.0009879163,0.0005899475,0.0027616299,0.00076485035,0.009219919,0.00070123136,0.00011938979],"category_scores_gemma":[0.00032716594,0.0012326451,0.0005495663,0.0039507714,0.0004276595,0.00127026,0.009683123,0.0016830943,0.0003854771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010223558,0.00037572937,0.0018697828,0.00010348439,0.00037297796,0.0000044662324,0.001876653,0.66346675,0.00022778408,0.31466192,0.006077606,0.010860621],"study_design_scores_gemma":[0.0006649945,0.00010306474,0.0005525461,0.000835231,0.00023766169,0.000005983562,0.00037272798,0.8111581,0.00004131043,0.0016995695,0.18327844,0.0010503755],"about_ca_topic_score_codex":0.0003238784,"about_ca_topic_score_gemma":0.00065450295,"teacher_disagreement_score":0.8849645,"about_ca_system_score_codex":0.0013948351,"about_ca_system_score_gemma":0.00083891134,"threshold_uncertainty_score":0.99901235},"labels":[],"label_agreement":null},{"id":"W4299144567","doi":"","title":"1 On the Design of Turbo Packet Combining Schemes for Relay-Assisted Systems over Multi-Antenna Broadband Channels","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Broadband; Relay; Turbo code; Computer network; Turbo; Broadband networks; Electronic engineering; Network packet; Telecommunications; Decoding methods; Engineering; Physics; Power (physics)","score_opus":0.10581651644247536,"score_gpt":0.29699842751764566,"score_spread":0.1911819110751703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299144567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006086513,0.00021646102,0.99160105,0.0007012044,0.000360003,0.00048617797,8.6640046e-7,0.00008065725,0.00046705353],"genre_scores_gemma":[0.9827843,0.000049732113,0.015806263,0.00047117786,0.000026411904,0.00007268338,0.0000016876296,0.000009417716,0.0007783247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987811,0.00040075983,0.00026323707,0.00021977596,0.00015211978,0.0001830402],"domain_scores_gemma":[0.9969916,0.0018485043,0.00014594515,0.0007802555,0.00018943366,0.000044299042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011158236,0.00012544476,0.00019923707,0.00005741339,0.00024421889,0.00014478296,0.00086563587,0.00004618899,0.000013500266],"category_scores_gemma":[0.00031162906,0.00007812153,0.00006182374,0.00023949974,0.00004905629,0.0001329738,0.00018829435,0.00010908421,0.000008022716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045867862,0.00021980787,0.0002275405,0.000038083468,0.00008669881,3.7011884e-7,0.0013322546,0.0021884742,0.011261956,0.95306957,0.011735059,0.01979433],"study_design_scores_gemma":[0.00065709034,0.0001420372,0.00027059167,0.00012924647,0.000004411949,0.0000012331068,0.000038143164,0.9935862,0.0022032708,0.00021917353,0.0026289846,0.00011965524],"about_ca_topic_score_codex":0.000005239217,"about_ca_topic_score_gemma":0.000002713786,"teacher_disagreement_score":0.9913977,"about_ca_system_score_codex":0.000019032968,"about_ca_system_score_gemma":0.000023125634,"threshold_uncertainty_score":0.31857035},"labels":[],"label_agreement":null},{"id":"W4300077277","doi":"","title":"Theoretical Analysis of The r th Best Relay Selection for Amplify-and-Forward Systems","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Relay; Selection (genetic algorithm); Computer science; Artificial intelligence; Physics","score_opus":0.018681268224699874,"score_gpt":0.2521619076852073,"score_spread":0.23348063946050743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300077277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012468219,0.0014461786,0.96542346,0.01011916,0.00027978397,0.0006868157,0.00005419298,0.00011732317,0.009404883],"genre_scores_gemma":[0.9779922,0.0013513447,0.018401727,0.00006875532,0.000020615184,0.00015218007,0.000054905224,0.00002078829,0.0019375063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931553,0.0049485057,0.00059412466,0.0006735145,0.0003584927,0.00027006608],"domain_scores_gemma":[0.99132675,0.0028946993,0.00063010084,0.0027479294,0.0022869657,0.00011355546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005356673,0.00026097824,0.0004901201,0.00027511042,0.0005161407,0.00042117332,0.0025362126,0.00024498618,0.00003164771],"category_scores_gemma":[0.0012213589,0.00018910602,0.00033134315,0.0010136646,0.0004114444,0.00013508128,0.0027262287,0.0004428235,0.0000036780375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043072228,0.00010928075,0.0011927588,0.000046634046,0.00028390207,5.3442477e-8,0.0017277399,0.0003542403,0.00057909597,0.9803153,0.00018554775,0.015201138],"study_design_scores_gemma":[0.00044297217,0.0000014133267,0.0028552637,0.0015052725,0.00047695404,0.0000046686364,0.000051133353,0.96671104,0.006239489,0.013154936,0.008118031,0.0004388329],"about_ca_topic_score_codex":0.000089845445,"about_ca_topic_score_gemma":0.00041880418,"teacher_disagreement_score":0.96716034,"about_ca_system_score_codex":0.00010638125,"about_ca_system_score_gemma":0.00021295373,"threshold_uncertainty_score":0.77115196},"labels":[],"label_agreement":null},{"id":"W4300121267","doi":"","title":"1 Analysis of Packet Combining for Single Carrier Multi-Relay Broadband System","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Broadband; Computer science; Network packet; Broadband networks; Computer network; Telecommunications; Electronic engineering; Engineering; Physics","score_opus":0.05183371478505835,"score_gpt":0.2861657251395102,"score_spread":0.23433201035445186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300121267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010739745,0.000112659836,0.98519254,0.00015276793,0.00010120405,0.000115830204,0.0000023851426,0.00009077609,0.0034921009],"genre_scores_gemma":[0.95777696,0.000007021523,0.041744374,0.00010093573,0.00001056662,0.000013508717,0.0000063656644,0.0000043916784,0.00033589543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920166,0.00012712622,0.00024572638,0.00019289953,0.000100343015,0.00013225761],"domain_scores_gemma":[0.9986654,0.000315965,0.00010692048,0.0006541014,0.0002039019,0.00005372523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004863742,0.00007943321,0.00025092435,0.00015678648,0.00013309861,0.0000663309,0.0005607638,0.00003258152,0.000011169443],"category_scores_gemma":[0.00006666916,0.00006770265,0.00011937542,0.0007335519,0.00002714323,0.00012245859,0.00016933122,0.00004311018,0.000002281523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019442881,0.00033371468,0.014673408,0.000101557016,0.001397073,6.2783704e-7,0.005398885,0.010541812,0.020942524,0.82536316,0.0021577894,0.11907001],"study_design_scores_gemma":[0.00038573638,0.000053085,0.0009166594,0.000019345647,0.00007631474,5.122154e-7,0.00007319508,0.99246,0.002526515,0.000008904102,0.0033831713,0.00009653347],"about_ca_topic_score_codex":0.000008799163,"about_ca_topic_score_gemma":0.00008915002,"teacher_disagreement_score":0.9819182,"about_ca_system_score_codex":0.000029061906,"about_ca_system_score_gemma":0.000013952818,"threshold_uncertainty_score":0.27608338},"labels":[],"label_agreement":null},{"id":"W4300503753","doi":"10.48550/arxiv.1608.08142","title":"Maximizing Data Rate for Multiway Relay Channels with Pairwise\\n Transmission Strategy","year":2016,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pairwise comparison; Pairing; Relay; Computer science; Transmission (telecommunications); Pairwise error probability; Channel (broadcasting); Algorithm; Computer network; Telecommunications; Power (physics); Artificial intelligence","score_opus":0.25464991067522497,"score_gpt":0.24377938641469474,"score_spread":0.010870524260530229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300503753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007883751,0.0006830569,0.98579496,0.0013541741,0.0006732157,0.0017356403,0.00012056204,0.0002677454,0.0014868855],"genre_scores_gemma":[0.97379166,0.009410883,0.008055557,0.00016834062,0.00022656357,0.000009421769,0.00017691066,0.00007867386,0.008082001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937275,0.001063349,0.0006468786,0.003357944,0.00017973722,0.0010245838],"domain_scores_gemma":[0.99084955,0.00077428785,0.00074935635,0.006238299,0.0008184246,0.0005700832],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018163404,0.0009288326,0.00085755694,0.00037458804,0.0013505653,0.0005420491,0.008607949,0.00049243524,0.00016743876],"category_scores_gemma":[0.00007689409,0.00081901206,0.00028907263,0.0010846833,0.00040805075,0.0019807275,0.0049938275,0.0009843523,0.00007692597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018979803,0.0007558655,0.00037040317,0.0005516803,0.00092725485,0.00034442567,0.0022457137,0.5680464,0.0017230737,0.17806973,0.002400252,0.24266724],"study_design_scores_gemma":[0.003265869,0.0003649904,0.00015011437,0.0015342291,0.00019943806,0.000009458672,0.0001327324,0.96090657,0.00045948714,0.0034886154,0.028228905,0.0012595727],"about_ca_topic_score_codex":0.000021598727,"about_ca_topic_score_gemma":0.00006361808,"teacher_disagreement_score":0.9777394,"about_ca_system_score_codex":0.00031611035,"about_ca_system_score_gemma":0.00085037533,"threshold_uncertainty_score":0.9999495},"labels":[],"label_agreement":null},{"id":"W4300527060","doi":"10.48550/arxiv.1209.0491","title":"Coding Opportunity Densification Strategies for Instantly Decodable\\n Network Coding","year":2012,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Goodput; Linear network coding; Network packet; Erasure; Computer science; Coding (social sciences); Monotonic function; Backhaul (telecommunications); Theoretical computer science; Maximization; Mathematical optimization; Algorithm; Computer network; Mathematics; Throughput; Telecommunications; Base station; Wireless","score_opus":0.2549399284525203,"score_gpt":0.2520638010510898,"score_spread":0.002876127401430506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300527060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026444161,0.0010112543,0.9582102,0.00036813595,0.0023659999,0.001583523,0.000036095054,0.00037157256,0.009609083],"genre_scores_gemma":[0.9768336,0.013764523,0.006533458,0.00037818844,0.00065560505,0.000016249038,0.00013650263,0.00006906111,0.0016128442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941335,0.0010848375,0.0010036533,0.002001386,0.00022546484,0.0015511918],"domain_scores_gemma":[0.99181587,0.001209592,0.0013976805,0.0032188587,0.0014569318,0.0009010701],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002717342,0.0009669054,0.0010082803,0.00039045335,0.0027144295,0.0011431061,0.0041679116,0.0006868056,0.00022577832],"category_scores_gemma":[0.0002470699,0.0012356318,0.0005542044,0.0019303905,0.00043976834,0.0026403216,0.003685726,0.0014220835,0.000095658004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115570736,0.00018589749,0.0010314713,0.0001783269,0.00021951544,0.00002053487,0.0012495148,0.14765716,0.00021931218,0.83786756,0.0013029649,0.009952172],"study_design_scores_gemma":[0.0011208884,0.00010558583,0.001359989,0.00069197256,0.00031984315,0.000012947652,0.0011912894,0.94364685,0.000092102135,0.031375866,0.018558308,0.0015243703],"about_ca_topic_score_codex":0.000046633904,"about_ca_topic_score_gemma":0.00032162628,"teacher_disagreement_score":0.9516767,"about_ca_system_score_codex":0.00087119115,"about_ca_system_score_gemma":0.0017746653,"threshold_uncertainty_score":0.9998938},"labels":[],"label_agreement":null},{"id":"W4300645308","doi":"","title":"Relay ARQ strategies for single carrier MIMO broadband amplify-and-forward cooperative transmission","year":2010,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"MIMO; Computer science; Transmission (telecommunications); Relay; Broadband; Computer network; Hybrid automatic repeat request; 3G MIMO; Electronic engineering; Telecommunications; Channel (broadcasting); Engineering; Physics","score_opus":0.01845836898632658,"score_gpt":0.2445819588334898,"score_spread":0.22612358984716321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300645308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03899345,0.0008220719,0.9266783,0.009484774,0.00016105805,0.0004504015,0.000014857829,0.00022982029,0.023165245],"genre_scores_gemma":[0.8716881,0.00048656506,0.12494904,0.00022746569,0.000020728023,0.000076004886,0.000054717377,0.000023364715,0.0024739662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970254,0.0014816638,0.00036920048,0.0005703875,0.0002265332,0.0003268628],"domain_scores_gemma":[0.9952717,0.0014692347,0.00017064373,0.0013867492,0.0014753578,0.0002263464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025976489,0.00023801257,0.0002489929,0.000113619106,0.0008566009,0.0008572883,0.0012263494,0.0001518797,0.000067563706],"category_scores_gemma":[0.00050107815,0.00022471997,0.00009540983,0.0004308685,0.00025518483,0.0006603368,0.00037274763,0.00043760965,0.000008360369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011925121,0.00022586157,0.0001332109,0.000022950964,0.000029295727,0.0000010813025,0.01396827,0.00003516312,0.1413539,0.68901265,0.0009067668,0.15429892],"study_design_scores_gemma":[0.0028752384,0.000010084386,0.0016224755,0.0007053106,0.000051474784,0.000065798995,0.0007547721,0.2182828,0.27229887,0.012868773,0.48917103,0.0012933549],"about_ca_topic_score_codex":0.00006622142,"about_ca_topic_score_gemma":0.00097031874,"teacher_disagreement_score":0.8326947,"about_ca_system_score_codex":0.000032133587,"about_ca_system_score_gemma":0.00021419492,"threshold_uncertainty_score":0.9163814},"labels":[],"label_agreement":null},{"id":"W4301298344","doi":"10.48550/arxiv.1804.07254","title":"Performance Analysis of Massive MIMO Multi-Way Relay Networks with\\n Low-Resolution ADCs","year":2018,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Singular value decomposition; Quantization (signal processing); MIMO; Computer science; Gaussian; Relay; Algorithm; Topology (electrical circuits); Channel state information; Channel (broadcasting); Mathematics; Power (physics); Telecommunications; Wireless","score_opus":0.07414998553050355,"score_gpt":0.20721572553255033,"score_spread":0.1330657400020468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301298344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38824832,0.00030687737,0.6096503,0.00004782144,0.00035786143,0.0003972705,0.000011919242,0.000082747385,0.000896841],"genre_scores_gemma":[0.9807653,0.011805029,0.0052489447,0.00007974753,0.000103727194,0.0000033249555,0.000074822245,0.000034453908,0.0018846599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952047,0.0009001841,0.00080915715,0.0020190226,0.00026526427,0.0008016976],"domain_scores_gemma":[0.9920693,0.00031501622,0.0015260146,0.0038673829,0.0018615641,0.0003607253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091599126,0.00076958723,0.0011997549,0.0012045377,0.00092203665,0.00016924212,0.0039302926,0.00057796243,0.00028078174],"category_scores_gemma":[0.000056052126,0.00082850526,0.00064742344,0.0077392133,0.001055184,0.00086097507,0.0038582075,0.0012451392,0.000069571775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022836168,0.0003150271,0.025831422,0.000063183645,0.0020021352,0.00003426449,0.0008784415,0.9633058,0.000030047355,0.0050344295,0.00008657537,0.0021903694],"study_design_scores_gemma":[0.0010509929,0.00029612528,0.04690199,0.0006517554,0.0018386702,0.0000021849603,0.00009513145,0.9479149,0.000102245795,0.00001606975,0.00027943763,0.0008504818],"about_ca_topic_score_codex":0.000079808095,"about_ca_topic_score_gemma":0.00062741304,"teacher_disagreement_score":0.6044014,"about_ca_system_score_codex":0.0005306559,"about_ca_system_score_gemma":0.00037111744,"threshold_uncertainty_score":0.9994166},"labels":[],"label_agreement":null},{"id":"W4302443058","doi":"10.48550/arxiv.1406.3123","title":"Distributed Resource Allocation for Relay-Aided Device-to-Device\\n Communication: A Message Passing Approach","year":2014,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Relay; Computer science; Resource allocation; Node (physics); Computer network; Transmission (telecommunications); Wireless; Cellular network; Wireless network; Distributed computing; Power (physics); Telecommunications; Engineering","score_opus":0.1368283796933359,"score_gpt":0.23722220051581205,"score_spread":0.10039382082247617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302443058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015390352,0.0006831024,0.9705657,0.0032287894,0.00028286641,0.002581865,0.000055930723,0.00041901224,0.0067923926],"genre_scores_gemma":[0.94230276,0.0013827444,0.05243475,0.0010747975,0.0001404398,0.00005764902,0.0009404328,0.00008199511,0.0015844447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99235266,0.002523718,0.0011403156,0.0026607872,0.0003053523,0.001017173],"domain_scores_gemma":[0.9876011,0.0015154972,0.0013079094,0.007248082,0.0016287358,0.00069868565],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029345157,0.0009947775,0.0011345107,0.00055193226,0.0026629602,0.000990789,0.008301891,0.0007119997,0.00005430918],"category_scores_gemma":[0.00048766582,0.0012538551,0.0005762458,0.0030183743,0.000421596,0.0008762435,0.0074386634,0.0015762831,0.00013058787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002629674,0.0005659439,0.00041211108,0.00036169335,0.00037517247,0.000008639453,0.0029844958,0.6359619,0.0001469004,0.34394723,0.00460152,0.010371465],"study_design_scores_gemma":[0.0015672148,0.00012949662,0.0008805204,0.00081312866,0.00027143757,0.0000072811986,0.0006413491,0.9142928,0.000082029976,0.0028205705,0.07720427,0.0012898728],"about_ca_topic_score_codex":0.000052633943,"about_ca_topic_score_gemma":0.000119460674,"teacher_disagreement_score":0.92691237,"about_ca_system_score_codex":0.0010848499,"about_ca_system_score_gemma":0.000531455,"threshold_uncertainty_score":0.99899113},"labels":[],"label_agreement":null},{"id":"W4302607445","doi":"10.48550/arxiv.1512.05201","title":"Novel Outer Bounds and Capacity Results for the Interference Channel\\n with Conferencing Receivers","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interference (communication); Channel (broadcasting); Computer science; Channel capacity; Gaussian; SIGNAL (programming language); Topology (electrical circuits); Single antenna interference cancellation; Telecommunications; Mathematics; Physics; Combinatorics","score_opus":0.23783835746999246,"score_gpt":0.22599498041270144,"score_spread":0.011843377057291021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302607445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033110928,0.0001019859,0.962727,0.0008813016,0.00032167148,0.00045322024,0.000035796,0.00010446038,0.0022636158],"genre_scores_gemma":[0.9955055,0.00057553244,0.0028951755,0.00016137844,0.000047719885,0.0000041220956,0.000011659672,0.0000096885615,0.0007892134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986607,0.000104899875,0.00016658448,0.0007473919,0.00006926377,0.00025118524],"domain_scores_gemma":[0.9974667,0.00036676112,0.00022826158,0.0012352268,0.00057328364,0.00012976314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058917864,0.00025479431,0.00024811985,0.000107160624,0.00037988834,0.00029421676,0.0017910266,0.00013184176,0.0000017476902],"category_scores_gemma":[0.000086735934,0.00020103408,0.00006277425,0.00028500435,0.00024426414,0.00030636234,0.0020211416,0.0005128506,0.0000034040384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013574447,0.0003021303,0.0009936774,0.00021889014,0.0009327516,0.000055507393,0.026986003,0.18188381,0.00029899747,0.7669489,0.0068842606,0.0131376665],"study_design_scores_gemma":[0.001496962,0.0001515338,0.0005300775,0.00024008908,0.000061025294,0.000009831212,0.00035147025,0.98923856,0.00007279577,0.0050465926,0.0023714767,0.0004295675],"about_ca_topic_score_codex":0.0000976273,"about_ca_topic_score_gemma":0.000701892,"teacher_disagreement_score":0.9623946,"about_ca_system_score_codex":0.00016420588,"about_ca_system_score_gemma":0.00024376759,"threshold_uncertainty_score":0.8197932},"labels":[],"label_agreement":null},{"id":"W4312111060","doi":"","title":"Signal-level turbo packet combining for multi-rate relay-assisted systems over multi-antenna broadband channels","year":2010,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Broadband; Turbo; Relay; Electronic engineering; Broadband networks; Telecommunications; Engineering; Power (physics); Physics","score_opus":0.05795058160123634,"score_gpt":0.2736385317873179,"score_spread":0.21568795018608156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312111060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04551923,0.00074556825,0.94707155,0.0032950498,0.0009336714,0.00078284286,0.00003470856,0.0003960261,0.0012213425],"genre_scores_gemma":[0.83113265,0.00023512461,0.1606916,0.00022681316,0.00003278847,0.00016917876,0.00010208161,0.000042396543,0.007367371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99433196,0.003347235,0.00065957394,0.0007974504,0.0003156335,0.00054812955],"domain_scores_gemma":[0.99210304,0.0021600674,0.00048286119,0.0024665114,0.0025046752,0.00028282293],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006426835,0.00035599858,0.0004080681,0.0002179208,0.0010141546,0.0010439168,0.002420753,0.00020781062,0.00004919567],"category_scores_gemma":[0.0013520097,0.00035532046,0.00019565267,0.0007671186,0.00020748079,0.00058430893,0.0009044138,0.0006124953,0.00003940229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005168567,0.0027486656,0.004319831,0.00019686557,0.00028227738,0.000013452333,0.024852771,0.00024588488,0.3264898,0.47880277,0.004775329,0.15722065],"study_design_scores_gemma":[0.0023038187,0.0000017997078,0.008624704,0.00055253657,0.000019409375,0.000016241676,0.000082346654,0.9550457,0.018636268,0.00013634999,0.01404415,0.00053667976],"about_ca_topic_score_codex":0.00017915085,"about_ca_topic_score_gemma":0.0012696045,"teacher_disagreement_score":0.95479983,"about_ca_system_score_codex":0.000070506205,"about_ca_system_score_gemma":0.00017050919,"threshold_uncertainty_score":0.9999931},"labels":[],"label_agreement":null},{"id":"W4312825914","doi":"10.1007/978-3-031-06947-5_20","title":"Maximum Multipath Diversity in Coded Cooperative Relay Networks","year":2022,"lang":"en","type":"book-chapter","venue":"Signals and communication technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Computer science; Cooperative diversity; Decoding methods; Node (physics); Algorithm; Diversity gain; Coding (social sciences); Channel (broadcasting); Relay channel; Multipath propagation; Computer network; Theoretical computer science; Fading; Mathematics; Engineering","score_opus":0.03848897724243196,"score_gpt":0.25460817369184024,"score_spread":0.2161191964494083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312825914","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008035948,0.13276216,0.20444113,0.02778374,0.00044412853,0.0028825316,0.000051282757,0.0018828341,0.6289486],"genre_scores_gemma":[0.79819566,0.15179928,0.010894816,0.0020874233,0.000027565962,0.00024727252,0.00016902304,0.00007139643,0.036507536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982578,0.0002642167,0.00047561753,0.00054048846,0.00019598605,0.00026589617],"domain_scores_gemma":[0.9968404,0.00028907537,0.00034047425,0.0022693283,0.0001973624,0.00006336421],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00060769334,0.00032102223,0.0004876745,0.0005444151,0.0011354918,0.00008044744,0.0031687035,0.00043481987,0.0003688118],"category_scores_gemma":[0.000040429262,0.00035294113,0.00006991693,0.0003831119,0.00036044137,0.00024351875,0.011214725,0.0016783304,0.000015568217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009246546,0.000041893905,0.000109819804,0.0000044290114,0.00003690096,0.00000819229,0.0004972394,0.00064754137,0.000023532553,0.94050574,0.00055105536,0.057564404],"study_design_scores_gemma":[0.0023817352,0.00055357954,0.00031339942,0.00052494684,0.00005861018,0.0000720055,0.0003213568,0.15078712,0.000094794654,0.26720986,0.5757226,0.0019600352],"about_ca_topic_score_codex":0.000021679269,"about_ca_topic_score_gemma":0.0002753727,"teacher_disagreement_score":0.7973921,"about_ca_system_score_codex":0.00016880239,"about_ca_system_score_gemma":0.00007213477,"threshold_uncertainty_score":0.99989223},"labels":[],"label_agreement":null},{"id":"W4312853625","doi":"10.1109/lcomm.2022.3214146","title":"Joint Lifetime-Outage Optimization in Relay-Enabled IoT Networks—A Deep Reinforcement Learning Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Relay; Benchmark (surveying); Reinforcement learning; Maximization; Joint (building); Internet of Things; Scheme (mathematics); Base station; Selection (genetic algorithm); Optimization problem; Transmission (telecommunications); Computer network; Nonlinear programming; Mathematical optimization; Nonlinear system; Artificial intelligence; Telecommunications; Algorithm; Power (physics); Engineering","score_opus":0.03643706991205457,"score_gpt":0.251818523258253,"score_spread":0.2153814533461984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312853625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014636989,0.0009894379,0.9809642,0.012358137,0.00017339668,0.000513917,2.8497593e-7,0.00025835348,0.003278579],"genre_scores_gemma":[0.8766092,0.0011810634,0.11615629,0.0050149164,0.000035016397,0.0005754711,0.000105812665,0.000028551405,0.00029368632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656767,0.0016371618,0.0006393744,0.0004046592,0.00034737305,0.00040374417],"domain_scores_gemma":[0.99608517,0.00024725698,0.00029278174,0.0031981901,0.00008673224,0.000089854206],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014057118,0.00021520085,0.00025501504,0.0003853248,0.0017018346,0.00021451098,0.0038525003,0.000047428828,0.00007882014],"category_scores_gemma":[0.000060920425,0.00025567063,0.000097567725,0.0017148732,0.00010455097,0.00034127684,0.0026056,0.0012620926,0.000013775032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052043833,0.00010973096,0.00018405495,0.000003378301,0.000017884413,0.000001681453,0.001814221,0.989836,0.00040684204,0.0039169393,0.0011157003,0.0025884067],"study_design_scores_gemma":[0.00049874565,0.00003778087,0.00017312691,0.000017641123,0.0000066839793,0.000010480198,0.00017636812,0.9875128,0.000018906005,0.00001057483,0.011260209,0.00027666672],"about_ca_topic_score_codex":0.000028860028,"about_ca_topic_score_gemma":0.000019180501,"teacher_disagreement_score":0.8751455,"about_ca_system_score_codex":0.00046440208,"about_ca_system_score_gemma":0.0000627153,"threshold_uncertainty_score":0.99998957},"labels":[],"label_agreement":null},{"id":"W4312879764","doi":"10.1007/978-3-031-79980-8","title":"Performance Modeling, Loss Networks, and Statistical Multiplexing","year":2010,"lang":"en","type":"book","venue":"Synthesis lectures on learning, networks, and algorithms","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Statistical time division multiplexing; Computer science; Multiplexing; Computer network; Telecommunications","score_opus":0.015869161055448444,"score_gpt":0.23907494945705768,"score_spread":0.22320578840160923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312879764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026024977,0.011591512,0.9713047,0.00031742666,0.00079292146,0.0004659325,0.000008357776,0.00044713626,0.0148117235],"genre_scores_gemma":[0.6049652,0.20497556,0.061900534,0.0023144821,0.006909517,0.0003452898,0.0003509098,0.000575917,0.11766257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625826,0.00049795647,0.00062436715,0.0012949012,0.00047763027,0.00084690563],"domain_scores_gemma":[0.9960716,0.0020143476,0.0003732863,0.0009829142,0.0001781319,0.00037976474],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010289073,0.00084304455,0.0009130319,0.00025515075,0.0013391246,0.0007133487,0.0011242802,0.000793926,0.000087228196],"category_scores_gemma":[0.00034933604,0.0007627974,0.00013032542,0.00020631374,0.00039358632,0.00026188666,0.00078880094,0.003621448,0.000015052129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003091789,0.000035126784,0.0001093726,0.000049298174,0.00010102384,0.00002103911,0.00024103877,0.3544975,0.0000021746228,0.004616813,0.003266184,0.6370295],"study_design_scores_gemma":[0.00024764024,0.00015597358,0.00013602442,0.0005032964,0.000043344204,0.00004629073,0.0000053380527,0.9004931,0.00000481525,0.00032441344,0.09724492,0.0007948658],"about_ca_topic_score_codex":0.00000824534,"about_ca_topic_score_gemma":0.000041664447,"teacher_disagreement_score":0.9094042,"about_ca_system_score_codex":0.00009381708,"about_ca_system_score_gemma":0.00015771479,"threshold_uncertainty_score":0.999961},"labels":[],"label_agreement":null},{"id":"W4313643684","doi":"10.1109/icjece.2022.3210237","title":"On the Packet Decoding Delay of Linear Network Coded Wireless Broadcast Sur le délai de décodage des paquets de la diffusion sans fil codée par réseau linéaire","year":2023,"lang":"fr","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Network packet; Decoding methods; Throughput; Computer science; Algorithm; Linear network coding; Unicast; Mathematics; Computer network; Wireless; Telecommunications","score_opus":0.025723608235231035,"score_gpt":0.23077897198647918,"score_spread":0.20505536375124814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313643684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4448216,0.0060146907,0.5458218,0.0028083192,0.00035038628,0.000089262896,0.000004293827,0.000027689804,0.00006196099],"genre_scores_gemma":[0.98778576,0.0041481354,0.007036855,0.00041716103,0.00051555835,0.000002978797,0.0000018370565,0.000026102543,0.00006561176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979223,0.0004916569,0.00048491068,0.00019427204,0.00016831433,0.00073854777],"domain_scores_gemma":[0.99661285,0.0021023315,0.0001653013,0.00026214187,0.00021765508,0.0006396965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013208004,0.00023532043,0.00036541055,0.0002418452,0.0005498225,0.00024809592,0.00073345116,0.0001504061,0.000010657677],"category_scores_gemma":[0.0002385599,0.00020490405,0.0001444468,0.0012161994,0.00016268273,0.00018613918,0.00013262869,0.00083603774,0.0000020520351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031407682,0.00008227392,0.0043915324,0.000104439154,0.00019969245,0.0006369391,0.0048327586,0.51605386,0.001263051,0.08803556,0.016028933,0.36833954],"study_design_scores_gemma":[0.00039159926,0.00022502222,0.009630116,0.0008294164,0.000019666804,0.000310377,0.000012359427,0.97853017,0.0003390099,0.0007314311,0.008769665,0.00021115932],"about_ca_topic_score_codex":0.00045601962,"about_ca_topic_score_gemma":0.0009626155,"teacher_disagreement_score":0.54296416,"about_ca_system_score_codex":0.0002429557,"about_ca_system_score_gemma":0.0010628551,"threshold_uncertainty_score":0.8355745},"labels":[],"label_agreement":null},{"id":"W4315607646","doi":"10.18280/isi.270603","title":"Fairness Oriented H-NOMA Devices Association and Pairing in HCN Slicing Using Cooperation Games","year":2022,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Telecommunications link; Pairing; Latency (audio); Noma; Bargaining problem; Computer network; Base station; Association scheme; Partition (number theory); Distributed computing; Algorithm; Telecommunications; Mathematics","score_opus":0.022725635956427615,"score_gpt":0.24867799844375701,"score_spread":0.2259523624873294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315607646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75630325,0.0004058306,0.24164969,0.0001920216,0.00022424872,0.00027561872,0.0000028199463,0.00014230752,0.0008042416],"genre_scores_gemma":[0.9953905,0.000100844045,0.004027633,0.00033785342,0.00002135007,0.00006259061,0.000031140404,0.000006001936,0.00002209624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998515,0.0003110135,0.0005039566,0.00015643642,0.00028026823,0.00023333576],"domain_scores_gemma":[0.9990324,0.00012690575,0.0003356383,0.00024498327,0.00021819645,0.000041913623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011933395,0.00012797363,0.00016453842,0.00034367573,0.0008668419,0.0004259775,0.00031543704,0.00004436609,0.0000167196],"category_scores_gemma":[0.000208471,0.00014501328,0.000025323294,0.0010450014,0.00002393038,0.004167987,0.00049296516,0.00018599762,0.0000036696513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043169242,0.000100305275,0.16215184,0.0002308563,0.000066654924,0.0000056118765,0.08314056,0.083011344,0.0026199082,0.08898179,0.00029293986,0.579355],"study_design_scores_gemma":[0.0005509478,0.000055506618,0.029739046,0.00010548494,0.000005992518,0.000024437095,0.0018192516,0.9609099,0.0003717591,0.0003099907,0.005842646,0.00026502463],"about_ca_topic_score_codex":0.00006867788,"about_ca_topic_score_gemma":0.0001272282,"teacher_disagreement_score":0.8778986,"about_ca_system_score_codex":0.0010053127,"about_ca_system_score_gemma":0.00008871115,"threshold_uncertainty_score":0.6667135},"labels":[],"label_agreement":null},{"id":"W4315783857","doi":"10.1109/jsac.2023.3236003","title":"Federated Learning Over Fully-Decoupled RAN Architecture for Two-Tier Computing Acceleration","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Telecommunications link; Computer science; Computer network; Cloud computing; Power control; Radio access network; Base station; Wireless; Distributed computing; Wireless network; Power (physics); Telecommunications","score_opus":0.0624619047864794,"score_gpt":0.3465104434729623,"score_spread":0.2840485386864829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2080107,0.00066800864,0.7742526,0.012797972,0.000680205,0.00092259474,0.0000048639617,0.00084404286,0.0018190227],"genre_scores_gemma":[0.98410547,0.0011072733,0.013649796,0.00058918435,0.00017280795,0.00005904792,0.000075744436,0.00003313967,0.00020756069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971738,0.0010545125,0.0006777282,0.0003146788,0.00030701215,0.0004722599],"domain_scores_gemma":[0.99563473,0.002125413,0.00035776445,0.0010071403,0.000736027,0.0001389353],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013693905,0.00024091046,0.00030328202,0.0006830129,0.0022307287,0.00078174897,0.0021371178,0.00009947823,0.000018629216],"category_scores_gemma":[0.0007082127,0.00023676858,0.00011360583,0.0031318117,0.000060900173,0.00040600362,0.00038270926,0.0015828173,0.000028803806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019890603,0.00074864563,0.003916767,0.000028576074,0.00026656105,0.000017713824,0.009776037,0.29052854,0.0393229,0.022768192,0.014053708,0.61837345],"study_design_scores_gemma":[0.0018198596,0.00014301932,0.006764969,0.00020845338,0.000009363092,0.000041984375,0.00009940745,0.9752561,0.00061005336,0.0009014053,0.013824208,0.0003211826],"about_ca_topic_score_codex":0.000006274307,"about_ca_topic_score_gemma":0.0004268251,"teacher_disagreement_score":0.77609473,"about_ca_system_score_codex":0.00023082903,"about_ca_system_score_gemma":0.00025459004,"threshold_uncertainty_score":0.99906826},"labels":[],"label_agreement":null},{"id":"W4320031163","doi":"10.1109/milcom55135.2022.10017698","title":"Base Station Deployment Optimization in Federated Networks with Multi-Hop Communication","year":2022,"lang":"en","type":"article","venue":"MILCOM 2022 - 2022 IEEE Military Communications Conference (MILCOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Base station; Computer science; Software deployment; Optimization problem; Backhaul (telecommunications); Linear programming; Computer network; Wireless; Distributed computing; Mathematical optimization; Telecommunications; Algorithm","score_opus":0.058373052151689975,"score_gpt":0.28001479865165085,"score_spread":0.22164174649996088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320031163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017750943,0.0156124,0.94815713,0.013467457,0.00047182178,0.0023286806,0.000113756505,0.0007127025,0.0013851015],"genre_scores_gemma":[0.8597656,0.016433014,0.11828138,0.0011489819,0.000025041232,0.001961618,0.00190419,0.00007360228,0.000406568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915687,0.0046326895,0.0012606066,0.0009992166,0.00080854364,0.00073026394],"domain_scores_gemma":[0.99152195,0.00080036005,0.00042405314,0.0063811857,0.0006339479,0.00023851056],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002150347,0.00057934906,0.0006037444,0.00071647146,0.0035129716,0.00027978353,0.0068810093,0.0001291774,0.00077259546],"category_scores_gemma":[0.00009429223,0.00065217435,0.00013939437,0.0035772254,0.00036719898,0.001281188,0.0040936233,0.0019953016,0.000024256215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012959512,0.0014872546,0.002009653,0.000022000293,0.0001220705,0.000015439417,0.0058932663,0.9409244,0.0010395532,0.012528805,0.0034764295,0.03235152],"study_design_scores_gemma":[0.0019991358,0.0002584317,0.001651484,0.000092536706,0.000029350864,0.000024201774,0.0024326816,0.987331,0.00011776955,0.0001677248,0.005157317,0.0007384138],"about_ca_topic_score_codex":0.0008211346,"about_ca_topic_score_gemma":0.008903811,"teacher_disagreement_score":0.8420147,"about_ca_system_score_codex":0.00096737413,"about_ca_system_score_gemma":0.00054688274,"threshold_uncertainty_score":0.99959296},"labels":[],"label_agreement":null},{"id":"W4323338389","doi":"10.1109/access.2023.3253680","title":"SNR Threshold-Based Relay Association and Random Phase Rotation for Cooperative Communication","year":2023,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Institute for Information and Communications Technology Promotion; Defense Acquisition Program Administration; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Relay; Bit error rate; Computer science; Node (physics); Signal-to-noise ratio (imaging); Channel (broadcasting); Frame (networking); Communications system; Modulation (music); Code (set theory); Phase (matter); Rotation (mathematics); Electronic engineering; Topology (electrical circuits); Computer network; Telecommunications; Electrical engineering; Engineering; Artificial intelligence; Physics","score_opus":0.0777462485190374,"score_gpt":0.37870398334833005,"score_spread":0.30095773482929267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323338389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16142838,0.0004299673,0.82691145,0.008588205,0.00035758983,0.0011232876,0.000012948102,0.00043300135,0.00071516325],"genre_scores_gemma":[0.99484587,0.0007166765,0.0029009257,0.0007490687,0.000044476154,0.00033825063,0.00008713894,0.00001130552,0.00030627026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989121,0.00023353731,0.0002480182,0.0002464023,0.00017633675,0.00018362797],"domain_scores_gemma":[0.9977748,0.00104313,0.00018001774,0.0005494215,0.00040062188,0.000052049265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010553119,0.00011182825,0.00016099877,0.00013586276,0.0005536175,0.0005356751,0.000856124,0.00006521519,0.000007760128],"category_scores_gemma":[0.00026281353,0.000108927314,0.000041817282,0.0007713639,0.00002951869,0.0010071206,0.00017225515,0.0001295798,0.00001766751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000984773,0.0011929478,0.015104071,0.00020421355,0.00044540272,0.000008265502,0.016099649,0.095729254,0.034483217,0.13144535,0.1975706,0.5067322],"study_design_scores_gemma":[0.005069356,0.00007604943,0.0013455697,0.000046023917,0.000012862457,4.1443332e-7,0.000027175756,0.9792598,0.0074808667,0.0010848421,0.0054103476,0.00018668249],"about_ca_topic_score_codex":0.000005075555,"about_ca_topic_score_gemma":0.000061522864,"teacher_disagreement_score":0.88353056,"about_ca_system_score_codex":0.00009237358,"about_ca_system_score_gemma":0.000066188084,"threshold_uncertainty_score":0.5165527},"labels":[],"label_agreement":null},{"id":"W4323645584","doi":"10.1109/tit.2023.3254464","title":"Adaptive Relaying for Streaming Erasure Codes in a Three Node Relay Network","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Online codes; Relay; Erasure; Computer network; Node (physics); Erasure code; Fountain code; Decoding methods; Luby transform code; Tornado code; Block code; Telecommunications; Concatenated error correction code; Power (physics); Engineering","score_opus":0.035659493448446315,"score_gpt":0.2660728999179509,"score_spread":0.2304134064695046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323645584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023868016,0.000043824937,0.99425316,0.0004421651,0.00048637282,0.00041359497,0.000012089881,0.00037869785,0.0015833176],"genre_scores_gemma":[0.9858958,0.00019974243,0.012882508,0.00052992796,0.000029566847,0.00028309686,0.000011067444,0.0000103309485,0.00015792459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988404,0.00014975923,0.00039722704,0.00015215029,0.00017291089,0.00028757722],"domain_scores_gemma":[0.99840736,0.00085035776,0.00011521871,0.00045761277,0.00011835383,0.00005111348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012088575,0.00014174507,0.00015079073,0.0003426464,0.00053324003,0.00013032494,0.00048374583,0.000083729945,0.000017074743],"category_scores_gemma":[0.000028382805,0.00014184826,0.00008562611,0.0011894805,0.00003693662,0.0015551092,0.000008785656,0.00029503138,0.00012807445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007476835,0.000022801029,0.00001797742,0.000011467373,0.000025394475,5.122728e-7,0.0033135025,0.60134244,0.000029073659,0.11212116,0.000375016,0.28266588],"study_design_scores_gemma":[0.000787894,0.00008951163,0.0006524553,0.00016706974,0.000008502645,0.0000030740966,0.00048212378,0.98275405,0.0004707971,0.012421568,0.0019154102,0.000247532],"about_ca_topic_score_codex":0.0000034031634,"about_ca_topic_score_gemma":0.00009639983,"teacher_disagreement_score":0.983509,"about_ca_system_score_codex":0.000103319624,"about_ca_system_score_gemma":0.0000657606,"threshold_uncertainty_score":0.5784404},"labels":[],"label_agreement":null},{"id":"W4327796594","doi":"10.1109/tcomm.2023.3258487","title":"Deep Reinforcement Learning for Latency-Sensitive Communication With Adaptive Redundant Retransmissions","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Channel (broadcasting); Network packet; Estimator; Erasure; Reinforcement learning; Acknowledgement; Communication source; Binary erasure channel; Transmission (telecommunications); Upper and lower bounds; Computer network; Markov process; Latency (audio); Real-time computing; Artificial intelligence; Channel capacity; Telecommunications; Mathematics","score_opus":0.061484670496015435,"score_gpt":0.29618449034481087,"score_spread":0.23469981984879543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327796594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012210014,0.00025452324,0.9851785,0.008267961,0.00009590069,0.00087020843,0.000004346862,0.000819587,0.0043868963],"genre_scores_gemma":[0.91683686,0.008826034,0.07142583,0.00024747432,0.000010430228,0.00074797246,0.00006641449,0.00003571177,0.0018032743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795765,0.0005313478,0.00044447,0.00039049608,0.00028916003,0.00038684992],"domain_scores_gemma":[0.9943587,0.0013782572,0.00018201543,0.0033731533,0.0005516135,0.00015626692],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00061254273,0.00025639153,0.00025132412,0.000380871,0.0030469985,0.0001589845,0.0022932691,0.000101857855,0.000021491096],"category_scores_gemma":[0.000024843115,0.00024148106,0.00014955857,0.0018011344,0.00025213757,0.0005195284,0.00005431419,0.0007563529,0.00010871085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019336921,0.00050462363,0.000008546032,0.00002367416,0.00035762825,0.0000029980474,0.012497911,0.5907386,0.0018388566,0.10843681,0.0011362721,0.2842607],"study_design_scores_gemma":[0.0007337313,0.00037091676,0.00011614738,0.00018358315,0.000042316766,0.000009177333,0.0006359477,0.98493963,0.0022354354,0.00071152375,0.009682592,0.00033899795],"about_ca_topic_score_codex":0.00002008471,"about_ca_topic_score_gemma":0.0002988603,"teacher_disagreement_score":0.9167147,"about_ca_system_score_codex":0.00015955944,"about_ca_system_score_gemma":0.00015609265,"threshold_uncertainty_score":0.9982509},"labels":[],"label_agreement":null},{"id":"W4366717779","doi":"10.48550/arxiv.1007.1735","title":"Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and\\n Optimality","year":2010,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Erasure; Computer science; Erasure code; Binary erasure channel; Online codes; Computer network; Multicast; Channel (broadcasting); Network packet; Decoding methods; Telecommunications; Channel capacity; Block code; Concatenated error correction code","score_opus":0.10494387628807389,"score_gpt":0.22194540886598982,"score_spread":0.11700153257791593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366717779","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6014642,0.0002005839,0.39387336,0.00022899447,0.00074587925,0.00039298448,0.000041504078,0.00021138659,0.0028411276],"genre_scores_gemma":[0.985168,0.0066340896,0.006581168,0.000142975,0.00012342741,0.0000014538002,0.00002028397,0.00002346567,0.0013051289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564165,0.00096518203,0.00046714186,0.0019430273,0.00019173439,0.0007912475],"domain_scores_gemma":[0.99495244,0.0004999552,0.00057745754,0.0026172765,0.00070521614,0.00064767484],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009957419,0.00071123487,0.00076240336,0.00035939543,0.0054680835,0.00043750386,0.0032604034,0.000755129,0.00028920584],"category_scores_gemma":[0.00016324624,0.0009223657,0.00034784386,0.0011301811,0.0013686277,0.00097275333,0.021946693,0.0027619752,0.000044303884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002684548,0.0007578352,0.1289764,0.00027547454,0.0009718439,0.00043013558,0.014368838,0.1844127,0.0014611643,0.6358136,0.0003912739,0.031872284],"study_design_scores_gemma":[0.0012006232,0.00009880585,0.022416458,0.00027815174,0.00031459818,0.0000689386,0.00083956454,0.9637059,0.00028785705,0.008494425,0.0010900167,0.00120466],"about_ca_topic_score_codex":0.00024461487,"about_ca_topic_score_gemma":0.00085261546,"teacher_disagreement_score":0.7792932,"about_ca_system_score_codex":0.0004197901,"about_ca_system_score_gemma":0.0006213704,"threshold_uncertainty_score":0.9995387},"labels":[],"label_agreement":null},{"id":"W4366829792","doi":"10.1017/s096354832300010x","title":"Expected number of faces in a random embedding of any graph is at most linear","year":2023,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Embedding; Conjecture; Multigraph; Upper and lower bounds; Vertex (graph theory); Random regular graph; Discrete mathematics; Random graph; Graph embedding; Multiplicity (mathematics); Graph; 1-planar graph; Line graph; Computer science; Geometry","score_opus":0.04208248376731293,"score_gpt":0.31914944790481203,"score_spread":0.2770669641374991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366829792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9711897,0.00025903838,0.02663802,0.00027979413,0.00028473427,0.00039566428,0.0000021737578,0.00020634058,0.00074455974],"genre_scores_gemma":[0.99357194,0.00012525318,0.006194407,0.00003280816,0.000010417767,0.0000091954125,0.0000051696657,0.0000111827185,0.00003962816],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763656,0.00039829258,0.00081167754,0.0004544148,0.00035231837,0.00034675864],"domain_scores_gemma":[0.99728507,0.0008852487,0.00034175467,0.0009626697,0.00045281634,0.00007246906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015745315,0.00018545361,0.00048809848,0.00022568763,0.00019516985,0.0000325957,0.0011666539,0.00008618517,0.000014945803],"category_scores_gemma":[0.00050994894,0.00019247153,0.00011518585,0.004201904,0.000121736,0.00019202671,0.0017950836,0.00024312234,0.000011935755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010744051,0.0012687327,0.63790154,0.0007762903,0.0001266048,0.0000144410515,0.042258546,0.019170461,0.0063242675,0.2665857,0.00108134,0.024384635],"study_design_scores_gemma":[0.002653453,0.000072019066,0.023030248,0.0003348141,0.000007319368,0.0000051188094,0.00016779684,0.92300385,0.008998178,0.041115507,0.00023070535,0.00038100206],"about_ca_topic_score_codex":0.000021229293,"about_ca_topic_score_gemma":0.000012131031,"teacher_disagreement_score":0.9038334,"about_ca_system_score_codex":0.00013684426,"about_ca_system_score_gemma":0.000103083185,"threshold_uncertainty_score":0.7848761},"labels":[],"label_agreement":null},{"id":"W4382365133","doi":"10.1109/itw55543.2023.10161680","title":"Capacity Bounds for Broadcast Channels with Bidirectional Conferencing Decoders","year":2023,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Decoding methods; Telecommunications","score_opus":0.10643825332204854,"score_gpt":0.29547223984667265,"score_spread":0.1890339865246241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382365133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023526043,0.000029866778,0.96580976,0.0026722709,0.00027960457,0.0001724712,0.0000015208727,0.00048327557,0.0070251753],"genre_scores_gemma":[0.97488713,0.000075946155,0.022004819,0.0003888589,0.00005831928,0.00006693452,0.000007015596,0.000006652284,0.002504296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935114,0.000035336267,0.00010144778,0.00020468888,0.00011466644,0.00019272235],"domain_scores_gemma":[0.9992826,0.00016925317,0.000030839,0.00028976254,0.00017099646,0.00005656824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002639523,0.00008050267,0.00008799955,0.00009861565,0.00035622233,0.00018584318,0.00038314977,0.000023824534,0.00002679908],"category_scores_gemma":[0.000029920828,0.00006522244,0.00003122857,0.0005620888,0.000036574707,0.00024088525,0.0001247523,0.000066047585,0.000038018352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002831143,0.0000752225,0.0019666352,0.000026199052,0.00010420885,0.0000027432275,0.0043160766,0.0050477516,0.0024992672,0.74790484,0.03115575,0.20687298],"study_design_scores_gemma":[0.00055689894,0.00011025116,0.0021815714,0.00003058825,0.0000034813713,0.000011575811,0.00010130396,0.92666745,0.0034057575,0.0020989229,0.06458184,0.00025037248],"about_ca_topic_score_codex":0.000010623276,"about_ca_topic_score_gemma":0.00013500257,"teacher_disagreement_score":0.9513611,"about_ca_system_score_codex":0.000032471577,"about_ca_system_score_gemma":0.00007496115,"threshold_uncertainty_score":0.273981},"labels":[],"label_agreement":null},{"id":"W4385890146","doi":"10.4230/lipics.itcs.2025.67","title":"Connectivity Graph-Codes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Graph; Induced subgraph; Discrete mathematics; Vertex (graph theory)","score_opus":0.18039934963148035,"score_gpt":0.22612817097210705,"score_spread":0.045728821340626696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385890146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09989249,0.00016222695,0.8938631,0.0005603049,0.0007911322,0.00023945585,0.000009105656,0.0009605347,0.0035216396],"genre_scores_gemma":[0.99447936,0.002119687,0.0009208428,0.00012591112,0.00005044004,0.000001754839,0.000013230112,0.00001634883,0.002272449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982696,0.0003237607,0.00015266177,0.00089679664,0.00007246513,0.00028471078],"domain_scores_gemma":[0.9973192,0.00028874844,0.00015884415,0.001917186,0.00018923137,0.000126798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004024409,0.00024769202,0.0002868236,0.00027198766,0.0003012157,0.00017075194,0.0026466558,0.00018217224,0.000025033434],"category_scores_gemma":[0.00006890709,0.0002930414,0.00019786108,0.0010115553,0.00010755528,0.00028787728,0.0047428776,0.00063441007,0.00022896055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000896149,0.00008060521,0.0031027994,0.00003332711,0.000113489135,0.00012856595,0.00036092536,0.08356347,0.000055501157,0.907176,0.0023081393,0.0030681982],"study_design_scores_gemma":[0.0003818261,0.00003629892,0.007974725,0.00014034043,0.000034948058,0.000002744903,0.00005037614,0.83178544,0.00015472488,0.15624987,0.00250801,0.0006806918],"about_ca_topic_score_codex":0.000053731514,"about_ca_topic_score_gemma":0.00029327467,"teacher_disagreement_score":0.89458686,"about_ca_system_score_codex":0.00012600362,"about_ca_system_score_gemma":0.00013731979,"threshold_uncertainty_score":0.9999522},"labels":[],"label_agreement":null},{"id":"W4385950642","doi":"10.1007/978-3-031-31663-0_7","title":"A Survey of Recent GRAND Variants","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Phase-shift keying; MIMO; Jamming; Channel (broadcasting); Modulation (music); Wireless; Orthogonal frequency-division multiplexing; Computer network; Telecommunications; Bit error rate; Physics","score_opus":0.18344512057046755,"score_gpt":0.3124869347024154,"score_spread":0.12904181413194785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385950642","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.533953e-7,0.0005290669,0.054967165,0.00045900428,0.00037826525,0.0001412305,0.000010944266,0.00014084786,0.94337255],"genre_scores_gemma":[0.0020296092,0.026779052,0.0021517798,0.0002531969,0.000027054313,0.000004366696,0.00004842221,0.000028095012,0.9686784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990764,0.00007426286,0.00029068353,0.00025411957,0.0001960605,0.000108462984],"domain_scores_gemma":[0.9981657,0.00029093437,0.00013732669,0.00097644376,0.000380169,0.000049413222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064696895,0.00014106043,0.00025655137,0.000113972405,0.00005954612,0.000045474662,0.0010661061,0.00009790986,0.0005767078],"category_scores_gemma":[0.00006934052,0.00012525095,0.000048621787,0.0001456018,0.000036345755,0.000067376015,0.00071598723,0.00017506482,0.00022851425],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024001595,0.0000082061115,0.000012212025,0.000005818945,0.000044711014,0.0000024884187,0.000069721864,0.0000030457331,0.0000071505287,0.8020467,0.01192738,0.18587014],"study_design_scores_gemma":[0.0009959321,0.00020799351,0.019326752,0.0005392802,0.00003769348,0.000007911435,0.0000021594667,0.023198726,0.000111839116,0.04719805,0.90703726,0.0013363949],"about_ca_topic_score_codex":0.00001734358,"about_ca_topic_score_gemma":0.00074026285,"teacher_disagreement_score":0.8951099,"about_ca_system_score_codex":0.00001919535,"about_ca_system_score_gemma":0.000102608865,"threshold_uncertainty_score":0.63145465},"labels":[],"label_agreement":null},{"id":"W4386065955","doi":"10.1109/isit54713.2023.10206577","title":"Streaming Erasure Codes over Multicast Relayed Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer science; Erasure; Relay; Computer network; Online codes; Network packet; Decoding methods; Unicast; Erasure code; Linear network coding; Block code; Algorithm; Linear code","score_opus":0.04096255463784048,"score_gpt":0.2958280214176326,"score_spread":0.2548654667797921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386065955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032900598,0.00029908496,0.9459703,0.0022316421,0.00049098115,0.00018871739,9.039625e-7,0.0015353797,0.016382402],"genre_scores_gemma":[0.99024534,0.000581921,0.005729626,0.00048982457,0.000061231396,0.000011419102,0.0000067844653,0.000008432681,0.0028654141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909824,0.00010212385,0.00016281357,0.00024036034,0.00014516254,0.00025127843],"domain_scores_gemma":[0.99888957,0.00026570665,0.000035243494,0.0006713959,0.00006396619,0.00007414303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003195788,0.00010174491,0.00010974366,0.0000785611,0.00025445595,0.00017440575,0.00072569033,0.00004678545,0.00009097446],"category_scores_gemma":[0.00005119775,0.000088274406,0.000043920016,0.00093003514,0.000027836037,0.000268629,0.00057041866,0.00016526786,0.00016582086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007926522,0.00008336633,0.005491681,0.0000068636814,0.0000664971,0.000031365576,0.0016010846,0.01710329,0.0024248362,0.39120388,0.057499025,0.52448016],"study_design_scores_gemma":[0.00019279799,0.000014360493,0.014569402,0.000018106206,0.000001775239,0.0000019300958,0.000026890546,0.9773898,0.00012633274,0.00012197581,0.0074067228,0.0001298709],"about_ca_topic_score_codex":0.000006256306,"about_ca_topic_score_gemma":0.00008153587,"teacher_disagreement_score":0.96028656,"about_ca_system_score_codex":0.000023218381,"about_ca_system_score_gemma":0.000019660587,"threshold_uncertainty_score":0.35997257},"labels":[],"label_agreement":null},{"id":"W4386072000","doi":"10.1109/isit54713.2023.10206647","title":"A Framework for Information-Theoretic Converses","year":2023,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.04861803334299439,"score_gpt":0.3143726514531976,"score_spread":0.2657546181102032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386072000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026734333,0.000016948117,0.9851487,0.004364716,0.00018582417,0.00013383276,7.76713e-7,0.00041470697,0.009467147],"genre_scores_gemma":[0.77417105,0.00040227172,0.2202927,0.004028664,0.000040500687,0.00011039048,0.0000140018565,0.0000042277447,0.0009361698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963903,0.000019591513,0.00010112647,0.00006313215,0.000065276065,0.00011183616],"domain_scores_gemma":[0.99912065,0.00039692724,0.00002502707,0.0003375465,0.000088911605,0.00003094294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019108487,0.00004215976,0.000048105463,0.00007445141,0.00013825938,0.00013127635,0.0004887428,0.00002287301,0.00005523077],"category_scores_gemma":[0.00018964386,0.0000362674,0.000028202709,0.00051447714,0.00002147672,0.00044878921,0.00018271196,0.000043839147,0.00056622934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6986286e-7,0.0000018071037,0.000017736698,0.000003092008,0.0000022707923,5.447267e-8,0.0005572649,0.000024848694,0.000004047764,0.9578272,0.008233295,0.033327684],"study_design_scores_gemma":[0.00023041763,0.000036193967,0.00041900433,0.000021799808,0.0000017037839,0.0000011251187,0.00016974854,0.43531144,0.00042976858,0.20719719,0.35603672,0.00014486628],"about_ca_topic_score_codex":3.1794937e-7,"about_ca_topic_score_gemma":8.19557e-7,"teacher_disagreement_score":0.7739037,"about_ca_system_score_codex":0.000008558303,"about_ca_system_score_gemma":0.000023883531,"threshold_uncertainty_score":0.72779214},"labels":[],"label_agreement":null},{"id":"W4386075276","doi":"10.1109/isit54713.2023.10206601","title":"Coded Downlink Massive Random Access","year":2023,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Overhead (engineering); Coding (social sciences); Computer science; Independent and identically distributed random variables; Telecommunications link; Information retrieval; Computer network; Theoretical computer science; Random variable; Mathematics; Statistics; Programming language","score_opus":0.07683050920300423,"score_gpt":0.3399706379169419,"score_spread":0.26314012871393766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386075276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004168354,0.0001265905,0.91095513,0.019154374,0.0004093827,0.00023022425,7.974855e-7,0.0012249771,0.06373016],"genre_scores_gemma":[0.9839632,0.0010122467,0.0055675386,0.001919806,0.000060128816,0.000042037016,0.000008926508,0.000006366775,0.0074197743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932325,0.00009100588,0.00012537214,0.00018024647,0.0001201629,0.00015995986],"domain_scores_gemma":[0.9990403,0.00021056895,0.000031185373,0.00057673344,0.00008660724,0.00005459385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026120633,0.00006699079,0.00009420693,0.00008974545,0.00017710464,0.00028099812,0.0014688771,0.000023140554,0.00016251724],"category_scores_gemma":[0.000053156742,0.00005365939,0.000037883918,0.0009788697,0.000021288048,0.00041562418,0.0009947328,0.000083950734,0.00065001944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017491831,0.000043768694,0.00073368277,0.000007193402,0.00003829666,0.000021291296,0.0012636855,0.001585183,0.0019370425,0.5081142,0.16521925,0.3210189],"study_design_scores_gemma":[0.0016640938,0.000021748112,0.0048880624,0.000018121373,0.0000027780463,0.0000024843127,0.00003168377,0.8964783,0.0032850362,0.004338314,0.08901167,0.00025768662],"about_ca_topic_score_codex":0.0000024461378,"about_ca_topic_score_gemma":0.000018508565,"teacher_disagreement_score":0.9797948,"about_ca_system_score_codex":0.000013955433,"about_ca_system_score_gemma":0.000031631174,"threshold_uncertainty_score":0.83549017},"labels":[],"label_agreement":null},{"id":"W4386600139","doi":"10.1007/s11277-023-10615-w","title":"Energy Efficient Multi-Way Massive Mimo AF Relaying with Imperfect CSI and Optimal Power Allocation","year":2023,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Relay; MIMO; Channel state information; Transmitter power output; Maximal-ratio combining; Efficient energy use; Transmission (telecommunications); Channel (broadcasting); Mathematical optimization; Power (physics); Topology (electrical circuits); Telecommunications; Wireless; Fading; Mathematics; Electrical engineering; Transmitter; Physics","score_opus":0.03905770220564649,"score_gpt":0.2825661492631398,"score_spread":0.24350844705749328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386600139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46316418,0.004454819,0.5043221,0.02249228,0.00018341486,0.00056933035,0.000019224737,0.0011060584,0.003688549],"genre_scores_gemma":[0.9773022,0.0025295757,0.019182526,0.0003118331,0.000015389194,0.00015750887,0.000056309877,0.000024837864,0.0004198462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830884,0.0003837522,0.00027043314,0.00041808712,0.00028133695,0.0003375314],"domain_scores_gemma":[0.9971375,0.0004952073,0.00014036459,0.0017836845,0.00029771987,0.000145528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044914344,0.00022190495,0.00020796958,0.000230239,0.0012520404,0.0002452168,0.0017367399,0.00007776453,0.000012811582],"category_scores_gemma":[0.000037300615,0.00020326847,0.0000630261,0.0011972894,0.00029336076,0.00029677185,0.0014924457,0.00034651434,0.000038720158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000875694,0.0009720782,0.0024802804,0.00005010749,0.00039840204,0.000028856817,0.05762751,0.013241944,0.03207854,0.6967615,0.0024224222,0.19385082],"study_design_scores_gemma":[0.0005620764,0.00008068126,0.0050329412,0.00009406816,0.000013268116,0.000020978765,0.0010067581,0.98719496,0.0003486308,0.000020157577,0.005313715,0.00031177734],"about_ca_topic_score_codex":0.00003816242,"about_ca_topic_score_gemma":0.00016558748,"teacher_disagreement_score":0.973953,"about_ca_system_score_codex":0.00009895666,"about_ca_system_score_gemma":0.00011854568,"threshold_uncertainty_score":0.96298087},"labels":[],"label_agreement":null},{"id":"W4387269069","doi":"10.1109/meditcom58224.2023.10266603","title":"Detection Scheme for PNC-Based Cell-Free MIMO Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"MIMO; Computer science; Transmission (telecommunications); 3G MIMO; Wireless; Multi-user MIMO; Interference (communication); Coding (social sciences); Computer network; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.05600045027335773,"score_gpt":0.2798748970774391,"score_spread":0.2238744468040814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387269069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032801994,0.00015752812,0.9900338,0.0012538744,0.00045932498,0.00028375717,0.0000010949956,0.00065928226,0.0038711305],"genre_scores_gemma":[0.97188413,0.00005199526,0.024364006,0.00028591324,0.00007092255,0.00016078708,0.0000054241764,0.000009059046,0.0031677752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993469,0.000051620096,0.00013639101,0.000190413,0.00010822612,0.00016644066],"domain_scores_gemma":[0.99880075,0.00018598489,0.00003846779,0.00080858514,0.000120462995,0.000045733224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034870452,0.000071402246,0.0000789624,0.000103479295,0.00022505785,0.00015151121,0.0008402429,0.00003339061,0.0000079034],"category_scores_gemma":[0.0000553831,0.00006491394,0.000048212863,0.0006226003,0.000011030226,0.00014365041,0.00022920583,0.00005687526,0.00010889243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042868556,0.00024263265,0.00047779403,0.00030390586,0.000055044846,0.000006043958,0.00084066996,0.01323919,0.19237873,0.31230515,0.20156328,0.2785447],"study_design_scores_gemma":[0.00037580653,0.000039136237,0.00011629082,0.000011492868,0.0000011584543,4.477625e-7,0.000017831395,0.93111575,0.014192535,0.00013953313,0.05389606,0.000093943745],"about_ca_topic_score_codex":0.0000057746965,"about_ca_topic_score_gemma":0.000032108826,"teacher_disagreement_score":0.9686039,"about_ca_system_score_codex":0.000029703235,"about_ca_system_score_gemma":0.000032792464,"threshold_uncertainty_score":0.26471138},"labels":[],"label_agreement":null},{"id":"W4387623780","doi":"10.1109/tit.2023.3323839","title":"A Lego-Brick Approach to Coding for Network Communication","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variable-length code; Shannon–Fano coding; Tunstall coding; Linear network coding; Context-adaptive binary arithmetic coding; Coding tree unit; Theoretical computer science; Computer science; Coding (social sciences); Algorithm; Context-adaptive variable-length coding; Multiple description coding; Channel code; Huffman coding; Mathematics; Decoding methods; Computer network; Data compression; Statistics","score_opus":0.03895929421103779,"score_gpt":0.273654423902628,"score_spread":0.23469512969159023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387623780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013362391,0.000021664373,0.98696727,0.0010839383,0.00036460275,0.000645709,0.000009491325,0.0006242515,0.01014945],"genre_scores_gemma":[0.93974113,0.00033966458,0.055306423,0.0027808251,0.00004474848,0.00083600485,0.000046643087,0.00001444296,0.00089009025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988388,0.00019850548,0.00036678356,0.00014562791,0.00018070791,0.00026959312],"domain_scores_gemma":[0.998192,0.00054377166,0.00010154269,0.0008762241,0.00019371958,0.0000927449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001378846,0.00013381398,0.00013414398,0.0003242022,0.00089485716,0.00025629223,0.00093578047,0.000061614934,0.0000138482665],"category_scores_gemma":[0.000027686232,0.00013620108,0.00009322252,0.0014528056,0.00003185551,0.0014154703,0.000016421824,0.00018700928,0.00042392765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038674047,0.00003971092,6.06019e-7,0.000018479517,0.000026207861,3.2343344e-8,0.0047015334,0.23959865,0.000031512132,0.5223338,0.009704861,0.22350591],"study_design_scores_gemma":[0.0007280805,0.00010648736,0.00009336186,0.00008142076,0.000014435432,0.0000050930994,0.0005787109,0.90311706,0.0010812293,0.010852099,0.08295852,0.0003834915],"about_ca_topic_score_codex":0.0000011850346,"about_ca_topic_score_gemma":0.0000027099707,"teacher_disagreement_score":0.93960756,"about_ca_system_score_codex":0.0000767486,"about_ca_system_score_gemma":0.000044167973,"threshold_uncertainty_score":0.68826085},"labels":[],"label_agreement":null},{"id":"W4387883738","doi":"10.1109/iccworkshops57953.2023.10283722","title":"ARQ Assisted Short-Packet Communications with Rate Splitting Multiple Access","year":2023,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Block Error Rate; Hybrid automatic repeat request; Automatic repeat request; Computer science; Network packet; Go-Back-N ARQ; Throughput; Computer network; Selective Repeat ARQ; Rayleigh fading; Error detection and correction; Markov chain; Bit error rate; Real-time computing; Algorithm; Fading; Wireless; Channel (broadcasting); Telecommunications link; Telecommunications","score_opus":0.18596947625051144,"score_gpt":0.3674347513225894,"score_spread":0.18146527507207796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387883738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12029399,0.0002535978,0.8044472,0.022552557,0.00022456789,0.000712967,0.0000049247515,0.0031145148,0.048395693],"genre_scores_gemma":[0.96636087,0.00049527455,0.031069312,0.0006815704,0.000019530613,0.00006597827,0.000032228527,0.000012274234,0.001262988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879056,0.00027680985,0.0002400971,0.00028027827,0.0001518543,0.00026038082],"domain_scores_gemma":[0.9966233,0.0006597524,0.000059022615,0.0023863104,0.00019857523,0.00007306749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006757384,0.00012779674,0.0001411081,0.00013636929,0.0005998337,0.0005105017,0.0033077106,0.0000331287,0.000028367891],"category_scores_gemma":[0.00009182783,0.00010306457,0.000038697162,0.0018796743,0.00007985915,0.00070081756,0.0024090076,0.00019994698,0.00013456361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021846981,0.00027557582,0.057273757,0.000027670714,0.00014951442,0.000020496356,0.0022367889,0.0009049362,0.010505127,0.19672714,0.022203345,0.7096538],"study_design_scores_gemma":[0.00035275743,0.000029192684,0.09627326,0.000058546382,0.000005963516,0.000005025359,0.00009608533,0.87454313,0.0013079388,0.00026701254,0.026756678,0.0003043939],"about_ca_topic_score_codex":0.000010588533,"about_ca_topic_score_gemma":0.00043647602,"teacher_disagreement_score":0.8736382,"about_ca_system_score_codex":0.000032930297,"about_ca_system_score_gemma":0.00006428382,"threshold_uncertainty_score":0.61466044},"labels":[],"label_agreement":null},{"id":"W4391768909","doi":"10.1109/lcomm.2024.3365475","title":"A Secret Multiuser Transmission Scheme With Dual-Phase-Shifter Structure for mmWave Wireless Communication","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Wireless; Computer network; Scheme (mathematics); Dual (grammatical number); Phase shift module; Transmission (telecommunications); Telecommunications; Electronic engineering; Engineering; Mathematics; Microwave","score_opus":0.03949924641273332,"score_gpt":0.31371317827729617,"score_spread":0.27421393186456283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391768909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03286198,0.0040583136,0.90116817,0.059706356,0.00017648513,0.0009795426,0.000043146607,0.00065838033,0.00034762218],"genre_scores_gemma":[0.7593723,0.0014133087,0.23617029,0.0023596764,0.000047615136,0.00028549766,0.00019456491,0.000045245626,0.00011148628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802977,0.0004312199,0.00044557973,0.00048087732,0.00026204888,0.00035051926],"domain_scores_gemma":[0.9939995,0.0007581985,0.000119721706,0.004760946,0.00023037958,0.00013128475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043294686,0.00030647044,0.000265884,0.00025013468,0.00087732903,0.00062966376,0.0033831121,0.00011136006,0.000027630178],"category_scores_gemma":[0.000016444807,0.00026373798,0.0001315112,0.000891215,0.00028711415,0.00094871514,0.0004497854,0.0006369606,0.0000193531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013542635,0.00056777964,0.000118686214,0.0002572952,0.0005113995,0.000012993101,0.019295895,0.00061708427,0.34478006,0.17218779,0.03720119,0.4243144],"study_design_scores_gemma":[0.0016114,0.000115182265,0.00010058868,0.00060691155,0.000050571773,0.00004056946,0.00008370688,0.7159321,0.0059216986,0.00062480214,0.27429047,0.0006220438],"about_ca_topic_score_codex":0.000009783464,"about_ca_topic_score_gemma":0.000099484765,"teacher_disagreement_score":0.72651035,"about_ca_system_score_codex":0.00013166097,"about_ca_system_score_gemma":0.00012072214,"threshold_uncertainty_score":0.99998146},"labels":[],"label_agreement":null},{"id":"W4391936127","doi":"10.1109/lwc.2024.3367132","title":"Extremely Large-Scale Array System: Cooperative NFC or FFC?","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Relay; Correctness; Near and far field; Base station; Communications system; Near field communication; Rayleigh fading; Topology (electrical circuits); Channel (broadcasting); Telecommunications; Algorithm; Electrical engineering; Physics; Fading; Engineering; Ultra high frequency; Optics","score_opus":0.04981561741888009,"score_gpt":0.29605440713827846,"score_spread":0.2462387897193984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391936127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008684367,0.004019251,0.94239545,0.036024734,0.0011240368,0.0005664541,0.000026750213,0.0016115287,0.0055474583],"genre_scores_gemma":[0.9644948,0.0019840582,0.02933271,0.0028172557,0.00013451223,0.00029931875,0.000037731286,0.000044501616,0.000855079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972391,0.0008124874,0.00056598376,0.00057706796,0.0003302093,0.00047510955],"domain_scores_gemma":[0.9940749,0.0006988687,0.00011009922,0.0047355,0.00022487504,0.00015574996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007271626,0.00031995188,0.00033995457,0.0002833743,0.0011177104,0.00089981884,0.0051602605,0.00009340961,0.00004398918],"category_scores_gemma":[0.000024785817,0.0002746666,0.00014763183,0.0016699231,0.00024983872,0.0009661486,0.0008357812,0.0006852141,0.00046134807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045860328,0.0006742807,0.00022765274,0.0003575909,0.0005361933,0.00009779976,0.030703014,0.001229066,0.23639573,0.5108883,0.10347445,0.11537009],"study_design_scores_gemma":[0.0006139278,0.000067181056,0.00017350253,0.0010181258,0.00004935907,0.00011261119,0.0009863259,0.6656385,0.005723479,0.000040893978,0.32468286,0.0008931977],"about_ca_topic_score_codex":0.00001575904,"about_ca_topic_score_gemma":0.00034017878,"teacher_disagreement_score":0.9558105,"about_ca_system_score_codex":0.00029379674,"about_ca_system_score_gemma":0.0002056087,"threshold_uncertainty_score":0.99997056},"labels":[],"label_agreement":null},{"id":"W4392618403","doi":"10.2139/ssrn.4753878","title":"Providing Ancillary Services with Cellular Networks Leonardo Dias, Brigitte Jaumard, Lackis Eleftheriadis","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Telecommunications; Computer science","score_opus":0.010756812002527144,"score_gpt":0.23045218427285802,"score_spread":0.21969537227033087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392618403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07125284,0.24206123,0.67129385,0.009231674,0.0019438926,0.00090021855,0.0000072657085,0.000712319,0.0025967248],"genre_scores_gemma":[0.9178386,0.07719036,0.0016877772,0.0005448641,0.0011024352,0.000045231674,0.000029118126,0.00009443073,0.0014672016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948102,0.0003919888,0.0006244504,0.0009091459,0.0006065988,0.002657616],"domain_scores_gemma":[0.99744093,0.0000991728,0.00048322557,0.0014212321,0.00033913422,0.00021629804],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025631026,0.0006261751,0.0005844967,0.00026262397,0.000599525,0.0016145777,0.0034138588,0.00030098073,0.000017993112],"category_scores_gemma":[0.00001205645,0.0005161243,0.0002940872,0.0006267271,0.0000771108,0.00040479522,0.003143693,0.008120967,0.000048197482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104251696,0.00021302234,0.0015555794,0.0004687607,0.0026326817,0.00023699082,0.0036902383,0.039305,0.0003711419,0.41995075,0.0015072821,0.5299643],"study_design_scores_gemma":[0.0016836723,0.0009135168,0.00038078718,0.0040310468,0.00044251862,0.0020646437,0.0013821862,0.6437681,0.00038776264,0.26533893,0.07619994,0.003406895],"about_ca_topic_score_codex":0.00004430224,"about_ca_topic_score_gemma":0.0014766403,"teacher_disagreement_score":0.84658575,"about_ca_system_score_codex":0.0014627988,"about_ca_system_score_gemma":0.0039545773,"threshold_uncertainty_score":0.99972904},"labels":[],"label_agreement":null},{"id":"W4392667281","doi":"10.1109/tccn.2024.3375506","title":"SC-PNC: Semantic Communication-Empowered Physical-Layer Network Coding","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Linear network coding; Computer network; Scheduling (production processes); Relay; Wireless network; Decoding methods; Wireless; Physical layer; Bitwise operation; Distributed computing; Telecommunications","score_opus":0.059975085717857646,"score_gpt":0.3201266096715159,"score_spread":0.26015152395365826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392667281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021814269,0.02403546,0.9625677,0.0027668085,0.0006831931,0.0005267333,0.000013030317,0.00076958013,0.0064560575],"genre_scores_gemma":[0.9318599,0.060798,0.005836318,0.0007245739,0.00016993625,0.00022879499,0.000020145779,0.000048191403,0.00031415373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973388,0.0007537383,0.00049012114,0.0006252361,0.00027806615,0.0005140456],"domain_scores_gemma":[0.99431,0.002841712,0.00010723782,0.0022808914,0.00027848376,0.0001816366],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007647262,0.00038308173,0.0003724693,0.00027541578,0.0024057713,0.0009015339,0.0018378915,0.000116802046,0.00003249666],"category_scores_gemma":[0.000010724801,0.00038929028,0.00019938294,0.0016990606,0.0003958707,0.0007917836,0.00015430772,0.0011274808,0.00010301367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019209816,0.0002541153,0.000041419167,0.00004015651,0.00030019076,0.00000623616,0.0033481196,0.0010443723,0.00035865774,0.04293809,0.00061707327,0.95103234],"study_design_scores_gemma":[0.00046434873,0.00012204938,0.00013810178,0.002263968,0.00012826102,0.0000387813,0.00018388081,0.97035503,0.0004280545,0.0031726062,0.02208577,0.00061911996],"about_ca_topic_score_codex":0.000016015463,"about_ca_topic_score_gemma":0.0001698413,"teacher_disagreement_score":0.9693107,"about_ca_system_score_codex":0.000095411095,"about_ca_system_score_gemma":0.00010545883,"threshold_uncertainty_score":0.9998559},"labels":[],"label_agreement":null},{"id":"W4392870398","doi":"10.4103/crst.crst_190_22","title":"No more relay of the delay: Passing the baton to the digital technologies","year":2022,"lang":"en","type":"article","venue":"Cancer Research Statistics and Treatment","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Relay; Telecommunications; Computer science; Physics; Power (physics)","score_opus":0.08885525550882234,"score_gpt":0.38347644118396723,"score_spread":0.2946211856751449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392870398","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15221101,0.041900113,0.21132253,0.57515377,0.0015743318,0.006992087,0.0035120205,0.00034468927,0.006989442],"genre_scores_gemma":[0.9961018,0.0016336206,0.0009237898,0.00009211218,0.000011234239,0.00038829818,0.0000034079135,0.0000035727664,0.0008421545],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991057,0.0001684028,0.00009607035,0.00014775009,0.00031624822,0.00016580876],"domain_scores_gemma":[0.99871755,0.00045904444,0.000034208962,0.0006365226,0.00012937492,0.000023331211],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002937411,0.000061743725,0.00006631038,0.000032573163,0.0013348856,0.00017718454,0.0008488535,0.000008548281,0.000014793602],"category_scores_gemma":[0.000090182795,0.000026929742,0.000018386721,0.00040667076,0.00020667366,0.000035133715,0.0015401492,0.00019144239,0.0000028490936],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016387348,0.00006017617,0.0007110753,0.0000034203247,0.000047698046,0.0000051957004,0.0029610766,0.0011116584,0.000061025174,0.09622293,0.0156018855,0.8831975],"study_design_scores_gemma":[0.00040256613,0.000576234,0.0041371365,0.000034850113,0.000011685989,0.000009983124,0.0017091411,0.058866818,0.000524346,0.002791472,0.93079966,0.00013611559],"about_ca_topic_score_codex":0.000060472892,"about_ca_topic_score_gemma":0.00009105261,"teacher_disagreement_score":0.9151978,"about_ca_system_score_codex":0.00018806127,"about_ca_system_score_gemma":0.00014680056,"threshold_uncertainty_score":0.99996525},"labels":[],"label_agreement":null},{"id":"W4392939609","doi":"10.1109/jiot.2024.3378177","title":"Network Coding-Based Multipath Transmission for LEO Satellite Networks With Domain Cluster","year":2024,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer network; Retransmission; Linear network coding; Distributed computing; Network packet; Multiple description coding; Backup; Cluster analysis","score_opus":0.024850476061586715,"score_gpt":0.27300526490031474,"score_spread":0.24815478883872802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392939609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021428058,0.0045993584,0.9886975,0.0028323098,0.0010275572,0.00023126426,4.8288825e-7,0.00010940089,0.0003592637],"genre_scores_gemma":[0.81476104,0.0005715512,0.18262757,0.0013304481,0.00034412256,0.000013154358,0.000002402102,0.000027144984,0.00032254064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983808,0.00018581274,0.0005032148,0.00029218273,0.0002753169,0.00036268242],"domain_scores_gemma":[0.9986285,0.0004674125,0.00020324196,0.00033074903,0.00022216144,0.00014794337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013491552,0.00021037628,0.00026838208,0.00014015492,0.0001813442,0.0005758294,0.0011271889,0.000089395515,0.000022514578],"category_scores_gemma":[0.000013448223,0.00015269348,0.00018685595,0.0003412212,0.000071150636,0.00063517416,0.00007732865,0.0005961442,0.0000035244261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091279554,0.00020275849,0.00037984477,0.00024746463,0.0003669535,0.000107818836,0.011684955,0.22884496,0.0029630715,0.02552732,0.036664743,0.6920973],"study_design_scores_gemma":[0.00075305236,0.00034135647,0.00003511257,0.0017778735,0.000019638082,0.00012325788,0.000011717684,0.9432662,0.0011602615,0.0011818709,0.051123537,0.00020613428],"about_ca_topic_score_codex":0.00000258187,"about_ca_topic_score_gemma":0.0000057068933,"teacher_disagreement_score":0.81261826,"about_ca_system_score_codex":0.00007835476,"about_ca_system_score_gemma":0.00010741813,"threshold_uncertainty_score":0.62266594},"labels":[],"label_agreement":null},{"id":"W4393179376","doi":"10.1017/9781009283403.006","title":"Network Codes","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Content (measure theory); Computer network; Telecommunications; Database; Mathematics","score_opus":0.04185318931593756,"score_gpt":0.22379293475045534,"score_spread":0.18193974543451777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393179376","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011330916,0.0019842163,0.031904202,0.00012532785,0.0004556465,0.00020906555,0.00002243589,0.00047820067,0.9648198],"genre_scores_gemma":[0.0004017394,0.0012062073,0.0012155279,0.00023356361,0.00022734914,7.0981116e-7,0.00001757643,0.00003004855,0.99666727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876714,0.0000457711,0.00016800429,0.0005418347,0.00020597533,0.00027125544],"domain_scores_gemma":[0.9983046,0.000097436256,0.000112656235,0.0011990232,0.00015056464,0.00013571772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001420001,0.00031069515,0.0003081677,0.00012317103,0.00029518598,0.00021298077,0.001842198,0.00021589774,0.000006804424],"category_scores_gemma":[0.0000034259358,0.0003553201,0.00017473414,0.000024255969,0.00013612797,0.00013200067,0.002173453,0.0006129398,0.00013864024],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004364202,0.000002111501,1.3790226e-7,0.00001886354,0.000064526466,0.000114829636,0.00003253882,0.000022165998,0.000004767296,0.869903,0.12478393,0.0050487467],"study_design_scores_gemma":[0.000119693716,0.000022562263,0.0000014895554,0.00027150003,0.000054748085,0.000012423793,0.000002277812,0.0042501707,0.00001666538,0.0005438519,0.99433166,0.00037294385],"about_ca_topic_score_codex":0.0000048213597,"about_ca_topic_score_gemma":0.0000023435505,"teacher_disagreement_score":0.8695477,"about_ca_system_score_codex":0.00015352409,"about_ca_system_score_gemma":0.00010170995,"threshold_uncertainty_score":0.99988985},"labels":[],"label_agreement":null},{"id":"W4393185346","doi":"10.1109/access.2024.3381977","title":"Spectrally Efficient Frequency Reuse With Higher Order Sectorisation and Directional Relays in a Two-Hop Relay Network","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Hop (telecommunications); Computer network; Reuse; Telecommunications; Frequency reuse; Engineering; Base station; Physics","score_opus":0.030484700992179925,"score_gpt":0.3111430963377112,"score_spread":0.2806583953455313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393185346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5471158,0.007193113,0.42076966,0.0070197326,0.0034363423,0.0007271846,0.0000020903863,0.00070146844,0.013034613],"genre_scores_gemma":[0.9868505,0.00036803822,0.011870801,0.0002824631,0.00027995236,0.000055491328,0.0000024576966,0.000014300934,0.00027598345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988488,0.00013162203,0.00020275211,0.00039716248,0.00020012283,0.00021951854],"domain_scores_gemma":[0.999066,0.00019186751,0.000043510547,0.00055725215,0.00009224608,0.00004912788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035230658,0.00013442876,0.00012119571,0.00013011931,0.00015320297,0.0005349537,0.0007507627,0.00003657428,0.00004711337],"category_scores_gemma":[0.000020987736,0.000109971006,0.000019629204,0.0015426093,0.00004487299,0.00057799625,0.00023589321,0.00028738895,0.000013428537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012751642,0.00034845763,0.061492603,0.000111405,0.00019110009,0.00029253244,0.007292801,0.53616333,0.0032492895,0.3251044,0.02290444,0.042722113],"study_design_scores_gemma":[0.0016926094,0.00020977581,0.13250057,0.0010203328,0.000032144053,0.00010132311,0.000014829371,0.8271056,0.0009784413,0.010856995,0.024393763,0.0010936527],"about_ca_topic_score_codex":0.00006134144,"about_ca_topic_score_gemma":0.0005840515,"teacher_disagreement_score":0.4397347,"about_ca_system_score_codex":0.000114160524,"about_ca_system_score_gemma":0.000099555364,"threshold_uncertainty_score":0.5158571},"labels":[],"label_agreement":null},{"id":"W4396564070","doi":"10.1109/tcomm.2024.3392785","title":"Multiplexed Streaming Codes for Multi-Hop Multi-Link Communication Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Network packet; Computer network; Erasure; Multiplexing; Hop (telecommunications); Telecommunications","score_opus":0.11563991827086129,"score_gpt":0.35260650149080514,"score_spread":0.23696658321994385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396564070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007105817,0.00690423,0.98346317,0.006549296,0.0004783407,0.00096498424,0.00005817391,0.0011794156,0.00033131996],"genre_scores_gemma":[0.6260563,0.00996839,0.3618868,0.00028634278,0.00003120706,0.00078794785,0.000073892734,0.000043732918,0.00086537504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976228,0.0005749773,0.00064370886,0.0005456348,0.00019586108,0.00041701633],"domain_scores_gemma":[0.9922088,0.002015673,0.0001237441,0.00510169,0.00038953265,0.00016056056],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007595121,0.00034038845,0.00030741928,0.00037149515,0.0020427734,0.00064646336,0.004075236,0.0001823771,0.000027059576],"category_scores_gemma":[0.000043265165,0.00035536592,0.00029544355,0.0011382003,0.00026441703,0.00083516946,0.00008588286,0.0009173934,0.000076610566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023511133,0.00110237,0.000011336486,0.00005563683,0.00031582417,0.0000013992598,0.0036708151,0.04895478,0.0045631295,0.06279514,0.0012518242,0.87725425],"study_design_scores_gemma":[0.00072412315,0.00005734354,0.000077801975,0.0002231415,0.000047660862,0.0000074573272,0.00012235019,0.96902984,0.0012326306,0.00016182565,0.027945269,0.0003705431],"about_ca_topic_score_codex":0.00003558041,"about_ca_topic_score_gemma":0.0011817619,"teacher_disagreement_score":0.92007506,"about_ca_system_score_codex":0.00021218423,"about_ca_system_score_gemma":0.00013981623,"threshold_uncertainty_score":0.99988985},"labels":[],"label_agreement":null},{"id":"W4396595329","doi":"10.51219/jaimld/prashanth-kodurupati/42","title":"An Overview of Network Slow Bandwidth And Remediation Measures","year":2023,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Machine Learning and Data Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alpha Technologies (Canada)","funders":"","keywords":"Environmental remediation; Bandwidth (computing); Computer science; Computer network; Biology; Ecology; Contamination","score_opus":0.20767537539198863,"score_gpt":0.412111491888932,"score_spread":0.20443611649694335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396595329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15345772,0.013866801,0.8286707,0.0028905543,0.00072891294,0.0001417193,0.000005721943,0.00009096421,0.00014692351],"genre_scores_gemma":[0.965938,0.020483598,0.013398334,0.00005757477,0.00010637831,3.5562e-7,0.0000041333487,0.000003503844,0.000008160156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984302,0.00022759094,0.00045024866,0.0002596839,0.00044411063,0.00018820202],"domain_scores_gemma":[0.9984753,0.00026206597,0.00034624903,0.00047004825,0.0003143781,0.00013197129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062113847,0.000083400504,0.00017913769,0.00022931294,0.00044452996,0.00027668918,0.0014743491,0.000023677467,0.0000055320156],"category_scores_gemma":[0.0010977854,0.000067114546,0.000018116418,0.0015396494,0.000285361,0.0016142653,0.0007071294,0.00027233106,0.0000025928157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138333235,0.00002593926,0.005254345,0.000010260748,0.0000061032374,0.000003529003,0.0010960726,0.007992079,0.006468783,0.028475758,0.000074201125,0.9505791],"study_design_scores_gemma":[0.000028056917,0.00023109114,0.0048491633,0.00009220946,0.0000068219942,0.000024329007,0.0001476833,0.9873032,0.0011130791,0.0036919697,0.0024180033,0.00009439956],"about_ca_topic_score_codex":0.000013065187,"about_ca_topic_score_gemma":0.000038600174,"teacher_disagreement_score":0.9793111,"about_ca_system_score_codex":0.00001125244,"about_ca_system_score_gemma":0.00012413198,"threshold_uncertainty_score":0.341901},"labels":[],"label_agreement":null},{"id":"W4399042387","doi":"10.1007/978-3-031-58453-4","title":"Efficient Online Incentive Mechanism Designs for Wireless Communications","year":2024,"lang":"en","type":"book","venue":"SpringerBriefs in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mechanism (biology); Incentive; Wireless; Computer science; Mechanism design; Computer network; Telecommunications; Computer security; Internet privacy; Economics; Microeconomics","score_opus":0.07453871575807554,"score_gpt":0.3208018124846792,"score_spread":0.24626309672660368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399042387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001365661,0.0014829097,0.985399,0.0015639368,0.0021128329,0.0011430741,0.000028844686,0.0003775785,0.0077552577],"genre_scores_gemma":[0.06811779,0.0022228286,0.89911264,0.0019235393,0.0007554636,0.00037377173,0.00007436565,0.00013502686,0.027284563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961128,0.00014048115,0.00076255226,0.0014985615,0.0007341049,0.0007514945],"domain_scores_gemma":[0.9941625,0.0006283841,0.00028661115,0.004101667,0.0006092849,0.00021155685],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001989155,0.00049583137,0.00055422215,0.00094216375,0.00070326467,0.00092793035,0.0110101355,0.00019910533,0.000007384782],"category_scores_gemma":[0.000057581892,0.0005127909,0.0002012005,0.0016904996,0.00087781873,0.00030417796,0.009110392,0.0009798856,0.0000668911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027457625,0.00014723839,0.0000015893481,0.00006553767,0.00001969181,0.000009205382,0.0011640158,0.0012353044,0.00019212833,0.8678113,0.000899787,0.12845142],"study_design_scores_gemma":[0.00025639488,0.000090783884,0.000032317366,0.00085435703,0.000012913219,0.000008341379,0.000004058139,0.9480825,0.00019302295,0.025676254,0.02421968,0.00056939595],"about_ca_topic_score_codex":0.000005483581,"about_ca_topic_score_gemma":0.00010933246,"teacher_disagreement_score":0.9468472,"about_ca_system_score_codex":0.0011602315,"about_ca_system_score_gemma":0.0020604765,"threshold_uncertainty_score":0.9997324},"labels":[],"label_agreement":null},{"id":"W4399490788","doi":"10.1007/s10623-024-01439-1","title":"External codes for multiple unicast networks via interference alignment","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Division of Mathematical Sciences; European Commission; Koninklijke Nederlandse Akademie van Wetenschappen; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Clemson University","keywords":"Unicast; Finite field; Mathematics; Context (archaeology); Upper and lower bounds; Code (set theory); Interference (communication); Field (mathematics); Interference alignment; Theoretical computer science; Discrete mathematics; Computer science; Topology (electrical circuits); Combinatorics; Telecommunications; Multicast; Computer network; Pure mathematics; Mathematical analysis","score_opus":0.04815929764473289,"score_gpt":0.2870985302757326,"score_spread":0.23893923263099973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399490788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016989531,0.01177832,0.9851178,0.000390216,0.00026079913,0.00028662873,0.000006156969,0.0002090539,0.00025205794],"genre_scores_gemma":[0.9188469,0.0040139216,0.07660241,0.00030264346,0.00007561547,0.00011158143,0.0000073183646,0.000012903739,0.000026692642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988167,0.00011533324,0.00024182192,0.00042415745,0.00011562687,0.00028634194],"domain_scores_gemma":[0.99881643,0.00048189703,0.000043133357,0.00045521982,0.00008360475,0.00011969538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038292262,0.0001893729,0.00018610217,0.00015860343,0.0002858581,0.0006140369,0.00065848045,0.000058555554,0.000013566374],"category_scores_gemma":[0.000011863912,0.00016310596,0.00012929949,0.00048063204,0.000107538304,0.00027452083,0.00028026974,0.00015190874,0.0000034295722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003298797,0.00008194695,0.0011126833,0.000047970098,0.000116360854,0.000009153218,0.00087893195,0.00049092213,0.007193536,0.4443868,0.0020186293,0.54363006],"study_design_scores_gemma":[0.00030428087,0.00021983052,0.00071806426,0.00024212232,0.000019924968,0.000019247509,0.00004160417,0.9711636,0.0009089643,0.007946768,0.018113598,0.00030201633],"about_ca_topic_score_codex":0.000005437914,"about_ca_topic_score_gemma":0.000034075634,"teacher_disagreement_score":0.97067267,"about_ca_system_score_codex":0.000017742906,"about_ca_system_score_gemma":0.000021054575,"threshold_uncertainty_score":0.6651268},"labels":[],"label_agreement":null},{"id":"W4400021395","doi":"10.1109/tit.2024.3418471","title":"Bounds on the Minimum Field Size of Network MDS Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mathematics; Discrete mathematics","score_opus":0.017239924169623284,"score_gpt":0.2541513440171451,"score_spread":0.23691141984752184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400021395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011442226,0.00012388747,0.97645456,0.0030587406,0.0008980025,0.0001508377,0.0000052531313,0.00015630602,0.01800817],"genre_scores_gemma":[0.99541146,0.0003113072,0.000770681,0.0028628416,0.000034744837,0.00004137773,0.0000010696513,0.000004316547,0.0005622317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911517,0.00018767046,0.00029452686,0.00008758405,0.00018404154,0.00013100468],"domain_scores_gemma":[0.99667156,0.0026221317,0.0000594009,0.00053685834,0.000078626734,0.000031432883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007552331,0.00010177553,0.000093511146,0.00009338985,0.0003243317,0.00021736289,0.0005544645,0.00005163905,0.0002785747],"category_scores_gemma":[0.00003106083,0.00007187115,0.000093123745,0.00054333603,0.000059092767,0.00073996605,0.0000057579014,0.00027624972,0.00017612347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036824054,0.000027560916,4.9172434e-7,0.000022913631,0.000044723853,2.5435344e-7,0.0030367766,0.010726005,0.000060094095,0.7519156,0.0063731107,0.22775567],"study_design_scores_gemma":[0.00072224665,0.00097596087,0.00012504995,0.0010910237,0.000061403895,0.00002298537,0.0009878353,0.694593,0.054822057,0.07878714,0.16705431,0.0007569942],"about_ca_topic_score_codex":0.0000012918804,"about_ca_topic_score_gemma":0.000003106086,"teacher_disagreement_score":0.9942672,"about_ca_system_score_codex":0.000031076226,"about_ca_system_score_gemma":0.000060356488,"threshold_uncertainty_score":0.3050198},"labels":[],"label_agreement":null},{"id":"W4400276941","doi":"10.1109/wcnc57260.2024.10570903","title":"A Three-Party Repeated Coalition Formation Game for PLS in Wireless Communications with IRSs","year":2024,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wireless; Computer science; Computer network; Telecommunications","score_opus":0.07137575354327827,"score_gpt":0.31361069951396425,"score_spread":0.24223494597068598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400276941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051332833,0.00041221787,0.98511547,0.005574389,0.000050547667,0.00047065853,0.0000032040957,0.00031901785,0.0029212357],"genre_scores_gemma":[0.9715686,0.00036927924,0.027296217,0.00026578704,0.000013232732,0.0002484207,0.000061299244,0.000007835965,0.00016937136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992245,0.0000799053,0.00024488862,0.00019480073,0.00010372763,0.00015220213],"domain_scores_gemma":[0.99853575,0.0002516277,0.000040315947,0.0010012971,0.00013475628,0.000036238536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004179244,0.00009108714,0.00010546381,0.00013359071,0.00013742887,0.0002757895,0.0007771816,0.000035971574,0.000011677303],"category_scores_gemma":[0.000012270484,0.00007284787,0.00003146882,0.00070165115,0.000043075932,0.00089522975,0.00022881011,0.00013319693,0.000017679555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012086524,0.000058259207,0.00012567722,0.000034484994,0.000013595928,0.0000012073575,0.0015867563,0.00006485145,0.0007845699,0.905045,0.002022908,0.09025065],"study_design_scores_gemma":[0.00030282853,0.000056395147,0.00046020816,0.00017406879,0.0000038416456,0.000008956415,0.00005149648,0.98036146,0.0006542548,0.0031985906,0.014602572,0.00012533154],"about_ca_topic_score_codex":0.000018898074,"about_ca_topic_score_gemma":0.0024467828,"teacher_disagreement_score":0.9802966,"about_ca_system_score_codex":0.000085560794,"about_ca_system_score_gemma":0.00006385566,"threshold_uncertainty_score":0.297065},"labels":[],"label_agreement":null},{"id":"W4400489643","doi":"10.1109/cscwd61410.2024.10580467","title":"A Stackelberg Game-based Wireless Powered Federated Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stackelberg competition; Computer science; Wireless; Computer network; Telecommunications; Microeconomics","score_opus":0.028442959061045554,"score_gpt":0.28224568035265385,"score_spread":0.2538027212916083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400489643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009837287,0.0012570573,0.9596759,0.0038723573,0.0002825404,0.0001038531,2.8188154e-7,0.0012685269,0.023702186],"genre_scores_gemma":[0.9914531,0.00017317983,0.0035214706,0.00060607394,0.000027632967,0.000012094707,0.000005972276,0.000010918766,0.0041895593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990304,0.00017155005,0.00015985919,0.0002905472,0.00015078366,0.00019682093],"domain_scores_gemma":[0.9993011,0.00019142902,0.000020382085,0.00033470447,0.00008140727,0.00007098649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025526862,0.00011202646,0.000103618586,0.00010151811,0.0002008135,0.00088244193,0.0005037088,0.000037213584,0.00025390732],"category_scores_gemma":[0.000027014199,0.000096111,0.000051659423,0.0007494437,0.000024528441,0.00029292598,0.00020157274,0.0002588996,0.00024888958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083499945,0.00006985379,0.00019725444,0.000030314097,0.0000459982,0.00004763745,0.001154717,0.0013581926,0.00876249,0.36556518,0.006919789,0.6158402],"study_design_scores_gemma":[0.00013533632,0.000038145678,0.000101688645,0.000060959137,0.0000016876734,0.0000031595246,0.00001869132,0.8964342,0.0021711844,0.00011616534,0.100777134,0.0001416808],"about_ca_topic_score_codex":0.0000056089148,"about_ca_topic_score_gemma":0.000032371052,"teacher_disagreement_score":0.9816158,"about_ca_system_score_codex":0.000048491445,"about_ca_system_score_gemma":0.00014012656,"threshold_uncertainty_score":0.85094076},"labels":[],"label_agreement":null},{"id":"W4400727154","doi":"10.1109/iwcmc61514.2024.10592617","title":"Outage Probability in Network Coding Based Cooperative Wireless Networks over Nakagami-m Fading Channels","year":2024,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Nakagami distribution; Fading; Computer network; Computer science; Linear network coding; Outage probability; Wireless; Wireless network; Channel code; Coding (social sciences); Telecommunications; Channel (broadcasting); Decoding methods; Mathematics; Statistics","score_opus":0.03827022462682299,"score_gpt":0.28406660934104744,"score_spread":0.24579638471422444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400727154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015435637,0.0014356439,0.9742278,0.0015308879,0.0012025405,0.0005868274,0.0000011606245,0.00064654497,0.00493298],"genre_scores_gemma":[0.99281776,0.00025148797,0.0049171224,0.001134465,0.00024067865,0.000096459225,0.000008866668,0.000022799799,0.00051036343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742144,0.00048211636,0.00049172377,0.0007503102,0.00024553796,0.0006088721],"domain_scores_gemma":[0.9981502,0.00071704236,0.00005552764,0.0008258842,0.00011974828,0.0001315545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014247173,0.0002932343,0.00033646383,0.00016689814,0.00030801157,0.0008626486,0.0010576055,0.000120746554,0.0001719046],"category_scores_gemma":[0.000054960485,0.0002598833,0.00010585721,0.0020977824,0.00008465718,0.0008178202,0.00060285925,0.000590324,0.00003227044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013518578,0.00009383282,0.0016986842,0.000049579885,0.00003375523,0.00004885176,0.0015297759,0.5364949,0.0002046183,0.41013175,0.0032462578,0.04645444],"study_design_scores_gemma":[0.0002737506,0.000039074283,0.00073702575,0.00037673442,0.0000035842238,0.0000027478288,0.000015331883,0.9934941,0.00013959268,0.0007588127,0.0038287812,0.00033046096],"about_ca_topic_score_codex":0.000014656836,"about_ca_topic_score_gemma":0.00024767665,"teacher_disagreement_score":0.9773821,"about_ca_system_score_codex":0.000246631,"about_ca_system_score_gemma":0.00016218827,"threshold_uncertainty_score":0.99998534},"labels":[],"label_agreement":null},{"id":"W4400984810","doi":"10.3390/s24154818","title":"Q-RPL: Q-Learning-Based Routing Protocol for Advanced Metering Infrastructure in Smart Grids","year":2024,"lang":"en","type":"article","venue":"Sensors","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Routing protocol; Computer science; Computer network; Zone Routing Protocol; Reinforcement learning; Network packet; Smart grid; Distributed computing; IPv6; Enhanced Interior Gateway Routing Protocol; Link-state routing protocol; Engineering; The Internet; Machine learning","score_opus":0.0281007632149584,"score_gpt":0.3279905415279558,"score_spread":0.2998897783129974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400984810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03653562,0.000101450045,0.88797563,0.0025291822,0.0006151397,0.06853869,0.0000024234184,0.0012764515,0.002425413],"genre_scores_gemma":[0.9121637,0.000004812935,0.04783052,0.00022015678,0.00007963589,0.03934967,0.0000039962797,0.000027930011,0.00031958832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989856,0.00012401673,0.00022535546,0.00031162958,0.00011011475,0.00024326997],"domain_scores_gemma":[0.9992768,0.0002546348,0.000042903488,0.00032305476,0.000058204045,0.000044367964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034617042,0.00013068375,0.00013223504,0.00014399583,0.00014069185,0.00021411844,0.0004120906,0.000046188998,0.000015779284],"category_scores_gemma":[0.0001406404,0.000119230244,0.000061789964,0.0005501144,0.000020537575,0.00019262538,0.00015485955,0.0002890372,0.00000823005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067457375,0.000040436455,0.0013464534,0.00028741558,0.000026562571,0.000026927944,0.0031719534,0.484769,0.009760416,0.01948047,0.0006222198,0.48040068],"study_design_scores_gemma":[0.0004624495,0.00006501939,0.0005625992,0.00023981606,0.0000012413144,0.000002561828,0.000028430812,0.9090546,0.0018922666,0.00024881284,0.087291405,0.00015082867],"about_ca_topic_score_codex":0.00000195982,"about_ca_topic_score_gemma":0.000020754605,"teacher_disagreement_score":0.87562805,"about_ca_system_score_codex":0.0000791939,"about_ca_system_score_gemma":0.00007386915,"threshold_uncertainty_score":0.48620683},"labels":[],"label_agreement":null},{"id":"W4401454454","doi":"10.3390/network4030015","title":"Polar Codes with Differential Phase Shift Keying for Selective Detect-and-Forward Multi-Way Relaying Systems","year":2024,"lang":"en","type":"article","venue":"Network","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polar; Differential phase; Keying; Differential (mechanical device); Phase-shift keying; Computer science; Differential coding; Telecommunications; Physics; Decoding methods; Bit error rate","score_opus":0.03356678652516294,"score_gpt":0.2978364941712516,"score_spread":0.26426970764608865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401454454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006472103,0.0103072645,0.9810873,0.00024695773,0.0006547451,0.0005103721,0.0000058619858,0.00035999273,0.00035536737],"genre_scores_gemma":[0.97417635,0.0003739261,0.024602037,0.000083451596,0.00040751166,0.00012313134,0.000007084539,0.000025924108,0.00020056865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986399,0.00016082455,0.00022939524,0.00044072757,0.00015007432,0.00037908996],"domain_scores_gemma":[0.99887663,0.00048710345,0.0000630319,0.00037723797,0.000090765985,0.00010523944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036411313,0.00019779235,0.00024141287,0.00007738259,0.00058248354,0.00065970386,0.00043415037,0.00006983906,0.00000493292],"category_scores_gemma":[0.000024530471,0.00015871489,0.000060935883,0.00053058565,0.00004835582,0.0003193292,0.00021410077,0.00027875643,0.0000055382425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046039134,0.00025538405,0.0017235394,0.00045845684,0.0011691311,0.00006580718,0.01707728,0.016067002,0.0022330016,0.24716622,0.023114285,0.6902095],"study_design_scores_gemma":[0.0010103576,0.00025355944,0.00046315487,0.00048309093,0.000037604404,0.000017909719,0.00003124898,0.98187816,0.00016950298,0.00029179233,0.015067141,0.00029649923],"about_ca_topic_score_codex":0.00001038133,"about_ca_topic_score_gemma":0.00007055943,"teacher_disagreement_score":0.96770424,"about_ca_system_score_codex":0.00006651934,"about_ca_system_score_gemma":0.0000564457,"threshold_uncertainty_score":0.6472205},"labels":[],"label_agreement":null},{"id":"W4401537852","doi":"10.1109/infocomwkshps61880.2024.10620706","title":"Designing Robust 6G Networks with Bimodal Distribution for Decentralized Federated Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Queen's University","funders":"","keywords":"Computer science; Distribution (mathematics); Distributed computing; Mathematics","score_opus":0.03630327337538183,"score_gpt":0.2697545562353211,"score_spread":0.23345128285993924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401537852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084755826,0.0011876589,0.9955716,0.00085052167,0.00015661206,0.00024810407,6.867162e-7,0.0006611565,0.0004761043],"genre_scores_gemma":[0.9193199,0.00038882115,0.07950497,0.00010061313,0.000053802632,0.000053759417,0.00007460648,0.000013091102,0.0004904236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902916,0.00012475546,0.00016052816,0.00029875216,0.000104304105,0.00028252773],"domain_scores_gemma":[0.99927866,0.00028711546,0.000030862095,0.00019056202,0.00014130992,0.00007151493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003618795,0.00012612004,0.00011743117,0.0000384073,0.00052460656,0.00093315105,0.00031418112,0.000046585414,0.000027973241],"category_scores_gemma":[0.000036021487,0.00009707771,0.000044309745,0.0006155211,0.000025121275,0.00039004427,0.000112712216,0.00020661672,0.000007897212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007700744,0.000057892925,0.0007133619,0.000034404293,0.00013080453,0.000014412367,0.0005013113,0.43776014,0.0014362335,0.29552254,0.008080837,0.25567105],"study_design_scores_gemma":[0.0002898451,0.0000825711,0.00012046974,0.00008814466,0.0000076019505,0.00000841154,0.00002388185,0.98065174,0.0010630472,0.000044393662,0.017462613,0.00015727326],"about_ca_topic_score_codex":0.0000032036523,"about_ca_topic_score_gemma":0.000027285443,"teacher_disagreement_score":0.91847235,"about_ca_system_score_codex":0.00007238303,"about_ca_system_score_gemma":0.00007551932,"threshold_uncertainty_score":0.89983976},"labels":[],"label_agreement":null},{"id":"W4401749493","doi":"10.1109/jsyst.2024.3442958","title":"Caching for Doubly Selective Fading Channels via Model-Agnostic Meta-Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Fading; Reinforcement learning; Computer science; Computer network; Channel (broadcasting); Artificial intelligence","score_opus":0.08904519759395947,"score_gpt":0.31748598962725183,"score_spread":0.22844079203329237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401749493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056450226,0.004649303,0.9903106,0.00039986815,0.0026494067,0.00037218502,5.970158e-7,0.00018252557,0.00087099586],"genre_scores_gemma":[0.99551195,0.0003444263,0.0020883426,0.00008145608,0.00057715696,0.00011331847,0.0000013193512,0.000023672908,0.0012583674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819994,0.00027016737,0.000509015,0.00029609603,0.00033046195,0.0003942926],"domain_scores_gemma":[0.9986614,0.00042766548,0.00018072681,0.00026304423,0.00031816796,0.00014896874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017085827,0.00021475977,0.0003463881,0.00026992516,0.0009014331,0.0010173166,0.00072207954,0.000058490794,0.000006112783],"category_scores_gemma":[0.00007512186,0.0001710492,0.00025704392,0.00038935494,0.000015875885,0.0008793733,0.00011588888,0.00064305257,0.000020133348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035182693,0.0000065803833,0.0000020963648,0.00003857316,0.00044959993,0.00000927685,0.0023735838,0.98941076,0.0016234331,0.0014869188,0.001055203,0.0035404686],"study_design_scores_gemma":[0.0002122161,0.00009608379,6.919669e-7,0.0002251648,0.0001196155,0.0003000009,0.0000067483957,0.99282235,0.0005212146,0.00039715617,0.005097246,0.0002015412],"about_ca_topic_score_codex":0.000008494937,"about_ca_topic_score_gemma":0.000003453546,"teacher_disagreement_score":0.99494743,"about_ca_system_score_codex":0.00026305995,"about_ca_system_score_gemma":0.00016248375,"threshold_uncertainty_score":0.9810007},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4401942877","doi":"10.1109/jsait.2024.3451240","title":"Low-Complexity Coding Techniques for Cloud Radio Access Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Computer science; Coding (social sciences); Telecommunications; Operating system; Mathematics","score_opus":0.03720281742026299,"score_gpt":0.31269150711664156,"score_spread":0.2754886896963786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401942877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022349257,0.00027440453,0.99172956,0.0006775307,0.001447954,0.00034794287,0.0000032083162,0.0003849202,0.002899535],"genre_scores_gemma":[0.9910668,0.0013403415,0.005439368,0.0014525888,0.00054328627,0.00006451244,0.00001687677,0.000013928123,0.000062275925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983493,0.0003345557,0.0006326446,0.00014254283,0.00023336703,0.00030756785],"domain_scores_gemma":[0.99822545,0.0007252626,0.00020492243,0.00032924383,0.00041791936,0.000097223165],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020781353,0.00017603907,0.00019308373,0.0005898765,0.00038626674,0.0015710134,0.0012415816,0.00009683786,0.000035176283],"category_scores_gemma":[0.00023753151,0.00015240267,0.00008911881,0.0013017673,0.000050664643,0.003565227,0.00010756555,0.00074684975,0.000017277558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009261644,0.000040819898,0.00002254339,0.00004256376,0.000030610063,0.0000043731875,0.0013581073,0.0041901693,0.00009481985,0.6346492,0.010383521,0.34909067],"study_design_scores_gemma":[0.0006802445,0.00021648439,0.00066459714,0.0012490388,0.000011925484,0.00022271444,0.000060947816,0.88764834,0.0073407916,0.062688045,0.038696013,0.00052088464],"about_ca_topic_score_codex":5.344729e-7,"about_ca_topic_score_gemma":0.000003647241,"teacher_disagreement_score":0.9888319,"about_ca_system_score_codex":0.00029284327,"about_ca_system_score_gemma":0.00018075843,"threshold_uncertainty_score":0.99946547},"labels":[],"label_agreement":null},{"id":"W4403024499","doi":"10.1109/pacrim61180.2024.10690222","title":"A Deep Reinforcement Learning-Based Adaptive Transmission Design for Trustworthy URLLC Support in 5G and Beyond Wireless Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Trustworthiness; Reinforcement learning; Computer science; Wireless; Transmission (telecommunications); Distributed computing; Computer architecture; Computer network; Artificial intelligence; Telecommunications; Computer security","score_opus":0.040191157744921345,"score_gpt":0.27322345916365776,"score_spread":0.2330323014187364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403024499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022686154,0.0017168385,0.9946176,0.00074903923,0.00011581651,0.0006439186,1.5477347e-7,0.0001592005,0.0017705953],"genre_scores_gemma":[0.9848384,0.0003733068,0.013264311,0.00019252035,0.000018484117,0.00017248477,0.0000062488143,0.000011325505,0.0011228855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885666,0.00017633983,0.0002726294,0.00032564896,0.00014724761,0.0002214616],"domain_scores_gemma":[0.9991679,0.00040501615,0.000035052773,0.00023544085,0.00006935706,0.000087240034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007273935,0.0001376315,0.00017069165,0.00016046256,0.00015302295,0.00025472834,0.00031606643,0.000053188578,0.000026922258],"category_scores_gemma":[0.000010881288,0.00011494999,0.000043513828,0.00038407915,0.000028201383,0.0002678255,0.000056953173,0.00016682361,0.0000055526493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000820053,0.000043969496,0.000046955312,0.000110944835,0.000029493634,0.00001593531,0.0035282709,0.5143251,0.0004315222,0.13655694,0.0010121174,0.34381676],"study_design_scores_gemma":[0.00044970048,0.00033393982,0.000025126608,0.00011730745,0.00000542032,0.0000037065815,0.00010158758,0.9858357,0.0004571975,0.00009522022,0.012419446,0.00015568016],"about_ca_topic_score_codex":0.000009553733,"about_ca_topic_score_gemma":0.000020830283,"teacher_disagreement_score":0.9846116,"about_ca_system_score_codex":0.00006600386,"about_ca_system_score_gemma":0.00013306693,"threshold_uncertainty_score":0.46875244},"labels":[],"label_agreement":null},{"id":"W4403196427","doi":"10.1142/s0129626424500099","title":"On Broadcast Schemes of Knödel Graphs","year":2024,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Combinatorics; Discrete mathematics; Parallel computing","score_opus":0.030750054428905466,"score_gpt":0.28698438863705156,"score_spread":0.2562343342081461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403196427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036920615,0.008192533,0.9365404,0.015032823,0.00024437404,0.0001081512,6.686393e-7,0.00038114088,0.002579279],"genre_scores_gemma":[0.9679003,0.00019320795,0.029307613,0.0024234185,0.000026945654,0.000012637903,0.0000016969052,0.000010250106,0.00012397856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991293,0.000051979718,0.00019045355,0.00027034347,0.0001882375,0.00016970967],"domain_scores_gemma":[0.99940115,0.00009479193,0.00004883017,0.00036854466,0.00004594959,0.00004071582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018789283,0.00011500826,0.000118949676,0.00015716055,0.000127316,0.00023992293,0.00067222194,0.000026916647,0.000013685353],"category_scores_gemma":[0.00002072303,0.00009989563,0.000060714956,0.0005750093,0.00007374316,0.00035310886,0.00013447112,0.00021124813,0.000040461473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009748993,0.00007478103,0.00011444421,0.00021108217,0.000041245425,0.00001799092,0.0024244115,0.0015035517,0.029865388,0.2947522,0.015776625,0.6552085],"study_design_scores_gemma":[0.0006405024,0.00012955001,0.00069447386,0.0018316577,0.00002098744,0.000029058241,0.000039994142,0.9068265,0.006648755,0.009821103,0.07252769,0.0007897097],"about_ca_topic_score_codex":0.0000011392887,"about_ca_topic_score_gemma":4.6024113e-7,"teacher_disagreement_score":0.9309796,"about_ca_system_score_codex":0.000020249796,"about_ca_system_score_gemma":0.00005221708,"threshold_uncertainty_score":0.40736255},"labels":[],"label_agreement":null},{"id":"W4404788734","doi":"10.1109/tcomm.2024.3507640","title":"Cooperative Relaying for Connected Construction Equipment Networks With Hybrid Hierarchical Proximal Policy Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Beijing Jiaotong University","keywords":"Computer science; Computer network; Distributed computing","score_opus":0.034839173393217356,"score_gpt":0.29640736590646694,"score_spread":0.2615681925132496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404788734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012177976,0.0005660037,0.9834997,0.012565988,0.00031955488,0.0009915447,0.0000310601,0.000699994,0.0012043612],"genre_scores_gemma":[0.7453933,0.0020584308,0.2509921,0.0003728302,0.00006012939,0.00080257346,0.000055086937,0.00003301743,0.0002325897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823797,0.0003623393,0.00041161876,0.00046321086,0.0002011362,0.00032371312],"domain_scores_gemma":[0.9966884,0.00095894653,0.00008188901,0.0017525214,0.00038687224,0.0001313464],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00033170823,0.00025109053,0.00021861603,0.00040414807,0.0014879337,0.0005171109,0.0012685073,0.00008137571,0.000028517685],"category_scores_gemma":[0.000024550258,0.00022949789,0.00011125721,0.0014154026,0.00030138076,0.00067958777,0.000032965792,0.00065522396,0.00001240981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051023067,0.00021233014,0.0000015780644,0.000016274831,0.00014627508,0.0000015105512,0.0006744902,0.73896164,0.00019617668,0.15696381,0.00023866216,0.10253621],"study_design_scores_gemma":[0.0005140877,0.00027118888,0.0000052654777,0.00019198845,0.0000374388,0.00006228583,0.000058120117,0.99232954,0.000996333,0.0002936207,0.0049632136,0.00027689745],"about_ca_topic_score_codex":0.0000094550605,"about_ca_topic_score_gemma":0.00005423406,"teacher_disagreement_score":0.7452715,"about_ca_system_score_codex":0.00027953746,"about_ca_system_score_gemma":0.000432121,"threshold_uncertainty_score":0.999812},"labels":[],"label_agreement":null},{"id":"W4405178972","doi":"10.1109/lnet.2024.3514357","title":"Zero Trust Security Architecture for 6G Open Radio Access Networks (ORAN)","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec en Outaouais; Université du Québec à Montréal","funders":"","keywords":"Architecture; Zero (linguistics); Zero-knowledge proof; Computer science; Computer security; Computer network; Telecommunications; Cryptography; Geography","score_opus":0.05075982727646133,"score_gpt":0.3208102305122604,"score_spread":0.27005040323579904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405178972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002074002,0.003478309,0.97051895,0.015977507,0.0055749025,0.0008733023,0.0000033563977,0.00051866885,0.0009809998],"genre_scores_gemma":[0.97383577,0.0007446813,0.008311563,0.01386487,0.0027452328,0.00024658075,0.000020477464,0.00006069016,0.00017011802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765337,0.00026106977,0.00038878602,0.00080194056,0.00022600975,0.0006688129],"domain_scores_gemma":[0.99791473,0.0006585873,0.0001028041,0.0011119277,0.00006042705,0.00015154171],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009012527,0.00032629922,0.00034586238,0.00015180999,0.0005781034,0.003600716,0.004868065,0.00011414935,0.000014633432],"category_scores_gemma":[0.000015740663,0.00030658257,0.00019178039,0.0010826589,0.000091606984,0.00092498225,0.0011159219,0.0006574854,0.0000121743],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043380845,0.000036506135,0.0002626442,0.00006207148,0.00016153089,0.000045991605,0.0016006052,0.111008346,0.000436998,0.013207107,0.3742092,0.49892563],"study_design_scores_gemma":[0.00033880028,0.000029220504,0.00007127805,0.00027021117,0.000017648665,0.00002076409,0.000001946827,0.60962427,0.000100258454,0.0022895006,0.38686684,0.00036927304],"about_ca_topic_score_codex":0.000013691132,"about_ca_topic_score_gemma":0.00006407279,"teacher_disagreement_score":0.97176176,"about_ca_system_score_codex":0.00012072023,"about_ca_system_score_gemma":0.00007484459,"threshold_uncertainty_score":0.9999386},"labels":[],"label_agreement":null},{"id":"W4405231430","doi":"10.1109/tnet.2024.3511333","title":"Communication-Efficient Network Topology in Decentralized Learning: A Joint Design of Consensus Matrix and Resource Allocation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Toronto","funders":"","keywords":"Distributed computing; Network topology; Computer science; Topology (electrical circuits); Resource allocation; Joint (building); Matrix (chemical analysis); Resource (disambiguation); Computer network; Mathematical optimization; Mathematics; Engineering; Combinatorics","score_opus":0.04805965462570868,"score_gpt":0.29261058410770313,"score_spread":0.24455092948199444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405231430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045416723,0.010938606,0.98184043,0.0016339355,0.00034208148,0.00031751444,4.117849e-7,0.00017846221,0.0002069144],"genre_scores_gemma":[0.97473675,0.0051340535,0.01984666,0.0000796582,0.00003164342,0.000040495597,0.0000015616633,0.00001535727,0.00011381443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788624,0.0008964805,0.0004583591,0.00032004772,0.0001479524,0.0002909387],"domain_scores_gemma":[0.9981667,0.0010999814,0.00009740265,0.00051577727,0.00005783988,0.00006233248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010773673,0.00015409969,0.00023302619,0.00021870088,0.00030355068,0.000112232476,0.00037331603,0.00008933419,0.000014591555],"category_scores_gemma":[0.000010839808,0.00015993611,0.00005813868,0.0010010102,0.00012823773,0.00006482469,0.000018111223,0.0005072644,0.0000051275106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025313482,0.000053750668,0.000018844272,0.000013299019,0.000025917236,0.0000034921334,0.0013897015,0.910685,0.0003243751,0.0117973145,0.00014121909,0.07552178],"study_design_scores_gemma":[0.00032055908,0.00006679667,0.00008762871,0.00044974068,0.000013868493,0.000021551128,0.000071785544,0.9916987,0.00023690233,0.00039050874,0.006491407,0.00015056621],"about_ca_topic_score_codex":0.000014933357,"about_ca_topic_score_gemma":0.000057904705,"teacher_disagreement_score":0.97019506,"about_ca_system_score_codex":0.00009087776,"about_ca_system_score_gemma":0.00007501242,"threshold_uncertainty_score":0.6522006},"labels":[],"label_agreement":null},{"id":"W4405352452","doi":"10.1002/9781394227952.ch5","title":"Federated Learning for Wireless Communications","year":2024,"lang":"en","type":"other","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless; Computer science; Telecommunications; Computer network","score_opus":0.06814287658136012,"score_gpt":0.33067634911674715,"score_spread":0.26253347253538706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405352452","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.9324516e-8,0.004231537,0.43626398,0.0017171459,0.00016495126,0.00019631295,0.0000012575169,0.00088644575,0.55653834],"genre_scores_gemma":[0.0017667118,0.0041677267,0.029701697,0.00030286875,0.000081968166,0.0001328356,0.000045673314,0.00019873501,0.96360177],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992232,0.000108648805,0.00015488279,0.0002822023,0.000080432896,0.00015064939],"domain_scores_gemma":[0.9986816,0.000111335066,0.00007549743,0.0010172372,0.000069780544,0.000044528922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017163716,0.00015600608,0.00017688847,0.00015863482,0.00018611821,0.0003890759,0.0015712873,0.00011695767,0.00025650178],"category_scores_gemma":[0.00002149702,0.00014187007,0.000072795534,0.000321899,0.000042770334,0.000053358508,0.0009806032,0.00031602607,0.0006446066],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3594903e-7,0.0000116680385,7.502739e-7,0.000021079866,0.000033153385,2.382929e-7,0.00006211665,8.038822e-7,0.000019185867,0.1776971,0.7488251,0.07332858],"study_design_scores_gemma":[0.00007047424,0.000012821062,4.2220702e-7,0.00014703415,0.00000616946,0.0000011250736,0.000010019485,0.158676,0.0000122042,0.00025595177,0.8406536,0.00015416753],"about_ca_topic_score_codex":0.000010816813,"about_ca_topic_score_gemma":0.0003382038,"teacher_disagreement_score":0.40706345,"about_ca_system_score_codex":0.000028168995,"about_ca_system_score_gemma":0.00005864268,"threshold_uncertainty_score":0.8285329},"labels":[],"label_agreement":null},{"id":"W4405490917","doi":"10.1109/unet62310.2024.10794726","title":"Risk-Aware Grant-Free for B5G/6G Ultra-Reliable Low-Latency Communications","year":2024,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Latency (audio); Low latency (capital markets); Telecommunications; Computer network","score_opus":0.0482590934967592,"score_gpt":0.30268155721273116,"score_spread":0.25442246371597194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405490917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036518378,0.005373345,0.9572302,0.012470629,0.00053778075,0.00048159357,0.000026056028,0.0009199423,0.02259528],"genre_scores_gemma":[0.8765286,0.011411264,0.104828976,0.00078336906,0.00008921247,0.00022753228,0.000042176416,0.000028654631,0.006060182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878776,0.000112502814,0.00030774932,0.00035726003,0.00015172674,0.0002830227],"domain_scores_gemma":[0.9953751,0.00064870925,0.000053405387,0.0036086957,0.00021941289,0.000094708426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000533551,0.00015801133,0.00015709955,0.00012169379,0.0006635442,0.0004647816,0.0043056197,0.000062434934,0.000093743314],"category_scores_gemma":[0.00012315315,0.00013531646,0.00012940494,0.0007317835,0.00007777914,0.0005565161,0.00086655206,0.00028777553,0.00017948041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040488076,0.000121459154,0.00023181766,0.00005420382,0.0000645893,0.0000018719168,0.0012979596,0.00015405593,0.0007167868,0.7825924,0.09708116,0.117679596],"study_design_scores_gemma":[0.00038168454,0.000062683845,0.0002705885,0.00015071502,0.00002020686,0.000009035627,0.00005856842,0.739882,0.0010413193,0.01915328,0.23864871,0.0003212081],"about_ca_topic_score_codex":0.000035216097,"about_ca_topic_score_gemma":0.00019324201,"teacher_disagreement_score":0.8761634,"about_ca_system_score_codex":0.000052036583,"about_ca_system_score_gemma":0.000110259905,"threshold_uncertainty_score":0.8000985},"labels":[],"label_agreement":null},{"id":"W4407690561","doi":"10.1109/mecom61498.2024.10881038","title":"Layer-wise Federated Learning for Mobile Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Layer (electronics); Computer network; Mobile computing; Distributed computing","score_opus":0.04213555915112761,"score_gpt":0.30861309950841725,"score_spread":0.26647754035728966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407690561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071906444,0.0027772821,0.9870449,0.0008110158,0.00034879675,0.0002144931,1.2989666e-7,0.0007174827,0.0073668724],"genre_scores_gemma":[0.9839733,0.00063285726,0.007024396,0.0003577783,0.000101361984,0.00012308628,0.000006500413,0.000010202577,0.0077704974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993203,0.00006648475,0.0001312869,0.00023644899,0.000064597465,0.00018084038],"domain_scores_gemma":[0.9993485,0.00027375534,0.000014939019,0.00022947951,0.00008283815,0.00005048288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028039873,0.000084486455,0.00008367776,0.000050518884,0.00030870794,0.0006568201,0.00038773136,0.00003683699,0.00008104233],"category_scores_gemma":[0.000022189193,0.000071452065,0.000054164047,0.00041025554,0.000013215851,0.0002710276,0.00021023156,0.00017188043,0.00005538989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030449419,0.000022131113,0.00004202501,0.000012360161,0.000026456237,0.000003270866,0.00034962004,0.029617637,0.00076275406,0.20530756,0.023616651,0.7402365],"study_design_scores_gemma":[0.00006518335,0.000043170712,0.000016738219,0.000020761612,0.0000015802815,0.000002280606,0.000013047716,0.77299255,0.00027777083,0.00013326676,0.2263522,0.000081423575],"about_ca_topic_score_codex":0.0000013407499,"about_ca_topic_score_gemma":0.000012915114,"teacher_disagreement_score":0.98325425,"about_ca_system_score_codex":0.0000256143,"about_ca_system_score_gemma":0.00003864446,"threshold_uncertainty_score":0.6333731},"labels":[],"label_agreement":null},{"id":"W4408042918","doi":"10.1142/s0129626425500021","title":"Dimensional Broadcast Schemes for Generalized Knödel Graphs","year":2025,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics","score_opus":0.03188071808304565,"score_gpt":0.3001099265790213,"score_spread":0.26822920849597565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408042918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0107774995,0.0032004432,0.9589608,0.02586633,0.00020428863,0.00021819735,7.5700143e-7,0.00019732848,0.00057438697],"genre_scores_gemma":[0.5054751,0.0001581879,0.46271464,0.030271614,0.000064786145,0.00020285927,0.000017372175,0.00001601064,0.0010794373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989376,0.00006177987,0.00023588614,0.00035492005,0.00013893387,0.0002708773],"domain_scores_gemma":[0.99922585,0.00009696884,0.00008118659,0.00041235174,0.00013466662,0.000048961687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022619645,0.00015196949,0.00016735999,0.00014684169,0.00052506063,0.00026767884,0.00081593386,0.00003828886,0.000006435501],"category_scores_gemma":[0.00004173815,0.00014178529,0.00008624278,0.0004894496,0.00007371548,0.00034022095,0.00025473334,0.000121026416,0.0000072331204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006927716,0.00015125657,0.00058215915,0.00017427739,0.000097131,0.0000037920431,0.00078436115,0.0043720063,0.050029766,0.23631415,0.092387944,0.61503386],"study_design_scores_gemma":[0.00220627,0.000026518574,0.00066496624,0.00026417026,0.00002737657,0.0000058778255,0.00001232141,0.7465131,0.0020394383,0.006879242,0.2408248,0.0005358851],"about_ca_topic_score_codex":0.0000016190626,"about_ca_topic_score_gemma":0.0000017687518,"teacher_disagreement_score":0.7421411,"about_ca_system_score_codex":0.000033350956,"about_ca_system_score_gemma":0.00009355154,"threshold_uncertainty_score":0.57818365},"labels":[],"label_agreement":null},{"id":"W4408100251","doi":"10.1109/access.2025.3547326","title":"Omnidirectional Relay in Wireless Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Omnidirectional antenna; Wireless; Relay; Computer network; Wireless network; Telecommunications; Antenna (radio); Physics","score_opus":0.03473643427710262,"score_gpt":0.33136671577332877,"score_spread":0.29663028149622617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408100251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041073006,0.00067154027,0.93188137,0.0022932712,0.0015096193,0.00013072808,1.9922193e-7,0.00015290912,0.02228738],"genre_scores_gemma":[0.9966514,0.00061103207,0.00064696773,0.001190874,0.0000513908,0.000032342945,0.0000010875875,0.0000031915417,0.00081169757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923146,0.00011564714,0.0001793372,0.00022428282,0.00008794879,0.00016132309],"domain_scores_gemma":[0.99923503,0.00015925839,0.00003671977,0.0004699762,0.00007072587,0.000028258439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025511126,0.0000784168,0.00010516234,0.00015244841,0.0001373681,0.00023167169,0.001460156,0.00004785938,0.000016801845],"category_scores_gemma":[0.000016973845,0.00007837581,0.000029075673,0.001232539,0.000025828418,0.0005280687,0.00038288347,0.00021224566,0.000009320704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016258622,0.00018073255,0.0406095,0.000012067863,0.000031020965,0.000013504174,0.00023930607,0.03770155,0.0003829366,0.33001032,0.02820114,0.5626017],"study_design_scores_gemma":[0.00044188407,0.000007980837,0.07617706,0.00012165255,0.0000022627958,0.00000261014,0.0000040483137,0.90360165,0.0013514308,0.001712183,0.016378785,0.00019843975],"about_ca_topic_score_codex":0.000018076367,"about_ca_topic_score_gemma":0.0002069434,"teacher_disagreement_score":0.9555784,"about_ca_system_score_codex":0.000062217056,"about_ca_system_score_gemma":0.00006561335,"threshold_uncertainty_score":0.31960726},"labels":[],"label_agreement":null},{"id":"W4408100457","doi":"10.1109/ants63515.2024.10898644","title":"Adaptive Graph-Based Federated Multi-Agent DRL for 6G UAV Swarm Efficiency","year":2024,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Science and Technology Council","keywords":"Computer science; Swarm behaviour; Multi-agent system; Distributed computing; Computer network; Artificial intelligence","score_opus":0.08281823632621925,"score_gpt":0.3185871256975855,"score_spread":0.23576888937136625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408100457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059898634,0.0014726983,0.9917424,0.0022822144,0.0004828229,0.00042973057,0.000003160341,0.00061011955,0.002377866],"genre_scores_gemma":[0.91307825,0.00009333393,0.08392025,0.0009431744,0.000036647147,0.000108333596,0.000008037278,0.000013008525,0.0017989585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988432,0.000096333715,0.00022144648,0.00042242958,0.00015113251,0.000265453],"domain_scores_gemma":[0.9989156,0.00031829218,0.000029737921,0.00044145936,0.00020378677,0.00009112456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003515488,0.0001566229,0.00013273899,0.00015356376,0.00039855076,0.0004886378,0.0007003661,0.00004507807,0.000045617428],"category_scores_gemma":[0.000039195613,0.00012765889,0.00011845098,0.0008477217,0.000046406196,0.00021628449,0.00018755966,0.0001372022,0.00009056391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042162384,0.0007321516,0.000051942374,0.00007867667,0.00013513197,0.000024324776,0.0025669634,0.010769007,0.005813787,0.6066599,0.029263752,0.34386224],"study_design_scores_gemma":[0.00037098062,0.00011708397,0.00006504262,0.000052068088,0.0000051456186,0.0000013222036,0.000031051233,0.97421306,0.0058805197,0.00022189446,0.018854106,0.00018773899],"about_ca_topic_score_codex":0.000006522603,"about_ca_topic_score_gemma":0.0000632553,"teacher_disagreement_score":0.96344405,"about_ca_system_score_codex":0.0000633169,"about_ca_system_score_gemma":0.00016185334,"threshold_uncertainty_score":0.52057785},"labels":[],"label_agreement":null},{"id":"W4409121235","doi":"10.1090/proc/17139","title":"Spanning trees in pseudorandom graphs via sorting networks","year":2025,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Comisión Nacional de Investigación Científica y Tecnológica; European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Pseudorandom number generator; Spanning tree; Computer science; Sorting; Combinatorics; Mathematics; Algorithm","score_opus":0.017568794092700138,"score_gpt":0.277140470574157,"score_spread":0.2595716764814569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409121235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5769412,0.004020977,0.38156977,0.01566827,0.0004067591,0.0015891246,0.0000019462427,0.00025122636,0.019550698],"genre_scores_gemma":[0.9720289,0.001375212,0.024964135,0.0011874995,0.000044380005,0.000043379532,2.77476e-7,0.00001997202,0.00033624825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732566,0.00007823928,0.0010487434,0.0005177014,0.00041467318,0.00061497954],"domain_scores_gemma":[0.9973747,0.00069352455,0.0010013175,0.00049737847,0.0003383562,0.000094706564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016949475,0.00034927833,0.00090122246,0.00009318905,0.00046138206,0.000260503,0.0024467618,0.00009930747,0.000014943816],"category_scores_gemma":[0.0004877459,0.00026693995,0.0006378562,0.0039794,0.0010786994,0.00031158663,0.0019670322,0.00081675604,0.000004201031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014227562,0.0012987342,0.05724034,0.0011618673,0.000702372,0.0000010131416,0.02502778,0.0021205284,0.011848269,0.69856024,0.008326709,0.19356985],"study_design_scores_gemma":[0.00077507674,0.000062966305,0.0101629,0.0018251151,0.00008203915,0.000004128743,0.0019465811,0.92129105,0.0006994196,0.062640265,0.00016561331,0.0003448435],"about_ca_topic_score_codex":0.000023556237,"about_ca_topic_score_gemma":0.0000060262764,"teacher_disagreement_score":0.9191705,"about_ca_system_score_codex":0.00013646422,"about_ca_system_score_gemma":0.00008242911,"threshold_uncertainty_score":0.9999783},"labels":[],"label_agreement":null},{"id":"W4409156140","doi":"10.1109/ciss64860.2025.10944747","title":"Optimal Link Configuration for Covert Heterogeneous Wireless Networks with Power Constraints","year":2025,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Science Foundation","keywords":"Computer science; Computer network; Wireless network; Link (geometry); Wireless; Power (physics); Covert; Distributed computing; Radio networks; Telecommunications","score_opus":0.016987723632458356,"score_gpt":0.26599766326798024,"score_spread":0.2490099396355219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409156140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014370368,0.00018312868,0.9815662,0.0022965362,0.00017778907,0.00034845757,9.93262e-7,0.00013593835,0.013853924],"genre_scores_gemma":[0.9728533,0.000071121234,0.023786929,0.002064601,0.000023488921,0.00008237037,0.000008735496,0.000005286264,0.0011041769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992407,0.00005284617,0.00017909773,0.00025526597,0.000081022044,0.00019109211],"domain_scores_gemma":[0.9990204,0.0001837103,0.00005023152,0.00046382696,0.00023487811,0.000046948786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015461391,0.00011667226,0.00013636873,0.000052066578,0.00022362455,0.00020933004,0.0005252725,0.000055341505,0.00007023544],"category_scores_gemma":[0.0000127691055,0.00009511621,0.000041309486,0.00025801433,0.000087812856,0.00017526392,0.00012437251,0.000096832155,0.000005357748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005969644,0.000056620345,0.00013244303,0.0000075480125,0.00008581229,0.0000035252253,0.00017840907,0.038946662,0.00035365255,0.66838604,0.0044832584,0.28730634],"study_design_scores_gemma":[0.0007246043,0.00013302812,0.00014173475,0.00004938716,0.0000063131442,0.000009281978,0.000016383989,0.9811689,0.0023476656,0.00010598224,0.015124103,0.0001725809],"about_ca_topic_score_codex":9.25357e-7,"about_ca_topic_score_gemma":0.000017249944,"teacher_disagreement_score":0.97141623,"about_ca_system_score_codex":0.000032102158,"about_ca_system_score_gemma":0.00010350278,"threshold_uncertainty_score":0.38787264},"labels":[],"label_agreement":null},{"id":"W4411215599","doi":"10.1007/978-981-96-6468-9_24","title":"Network Coding Techniques for Efficient Wireless Multimedia Delivery","year":2025,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Concordia University","funders":"","keywords":"Multimedia; Computer science; Coding (social sciences); Wireless; Wireless network; Computer network; Telecommunications; Mathematics","score_opus":0.04550527261447342,"score_gpt":0.3026959437784698,"score_spread":0.2571906711639964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411215599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007490321,0.0010139011,0.8828248,0.001350012,0.00036244895,0.0008806781,0.0000117199,0.00019946518,0.11334951],"genre_scores_gemma":[0.03284025,0.022217497,0.9368595,0.0042573735,0.00014918322,0.00031924885,0.0001407919,0.000019825913,0.0031963259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981508,0.00005360973,0.00079193816,0.00035573443,0.0003194544,0.00032846394],"domain_scores_gemma":[0.9954054,0.0007877215,0.0003557838,0.002509838,0.0008451404,0.00009614452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016913204,0.00027036358,0.00033242532,0.00086637394,0.0010721404,0.00068100065,0.004623916,0.00015398284,0.0000036166944],"category_scores_gemma":[0.00006569663,0.00028288877,0.000070433896,0.0006707864,0.00066735543,0.0023447631,0.0043958584,0.0004566887,0.000010912151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017694153,0.000008396678,0.000004346822,0.000018438026,0.0000036189213,6.078739e-8,0.00040869313,0.00025235632,0.0000029438158,0.539113,0.0011115267,0.45907485],"study_design_scores_gemma":[0.00019224634,0.00002828668,0.0000655204,0.0004903066,0.000005277537,0.0000032253147,0.000005899502,0.80093884,0.000021302712,0.0026421924,0.19534086,0.000266047],"about_ca_topic_score_codex":0.0000026745106,"about_ca_topic_score_gemma":0.00001057927,"teacher_disagreement_score":0.8006865,"about_ca_system_score_codex":0.00022714915,"about_ca_system_score_gemma":0.00044303408,"threshold_uncertainty_score":0.99996233},"labels":[],"label_agreement":null},{"id":"W4411983370","doi":"10.1109/tcomm.2025.3585509","title":"Joint Optimization of 3-D Placement and Transmission Power for a Relay Based Covert Communication System","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Science Foundation of Chongqing; National Natural Science Foundation of China","keywords":"Joint (building); Relay; Computer science; Transmission (telecommunications); Power (physics); Electronic engineering; Communications system; Engineering; Computer network; Telecommunications; Physics","score_opus":0.034511773974405524,"score_gpt":0.28388432599865493,"score_spread":0.2493725520242494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411983370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013011027,0.0011542164,0.98996913,0.004757559,0.00009852212,0.0007990675,0.000017804441,0.00016801518,0.0029055746],"genre_scores_gemma":[0.7370858,0.0016462251,0.26055667,0.00020888195,0.00000121289,0.00031009133,0.000014594813,0.000008289428,0.00016820677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855244,0.00039203034,0.00051957724,0.00024624483,0.00014574309,0.00014397246],"domain_scores_gemma":[0.9959492,0.00074867165,0.00016619814,0.0027137636,0.00036062492,0.00006152867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000563115,0.00015867222,0.00024609917,0.000326806,0.00088408886,0.00008116677,0.0012851807,0.00009149536,0.000011549723],"category_scores_gemma":[0.000011559611,0.00016383578,0.000111536516,0.00066179177,0.00014069011,0.00024773122,0.000029258055,0.00023184826,0.0000016861363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013090593,0.0011669609,0.00000779149,0.0002250456,0.00018308569,1.1211819e-7,0.0026429787,0.79260933,0.0042836093,0.14063075,0.00093012594,0.05718933],"study_design_scores_gemma":[0.0010036434,0.000110364344,0.000033144875,0.00049562793,0.000044301985,0.0000012543793,0.00021657789,0.9852462,0.0073406687,0.000072266324,0.005285996,0.00014998719],"about_ca_topic_score_codex":0.0000078162875,"about_ca_topic_score_gemma":0.000018979286,"teacher_disagreement_score":0.7369557,"about_ca_system_score_codex":0.00013934863,"about_ca_system_score_gemma":0.00015058577,"threshold_uncertainty_score":0.6799786},"labels":[],"label_agreement":null},{"id":"W4412375035","doi":"10.1109/tmlcn.2025.3587205","title":"User Handover Aware Hierarchical Federated Learning for Open RAN-Based Next-Generation Mobile Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Machine Learning in Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; VMware","keywords":"Ran; Computer science; Handover; Computer network; C-RAN; World Wide Web; Distributed computing; Radio access network; Base station; Mobile station","score_opus":0.06692612547099684,"score_gpt":0.3285777956211661,"score_spread":0.26165167015016927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412375035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097123807,0.0042362055,0.9904874,0.0022428725,0.00033295757,0.0009941886,0.0000016916191,0.000225739,0.0005077344],"genre_scores_gemma":[0.97824174,0.006752319,0.0123128975,0.0008928223,0.00005303675,0.00082953426,0.000070039205,0.000029224682,0.00081837166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972154,0.0011987071,0.0005427274,0.0005301485,0.00013250641,0.00038050092],"domain_scores_gemma":[0.99655956,0.0019911684,0.00016227485,0.001037697,0.00016370673,0.000085579115],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011985571,0.00027921383,0.0003618836,0.00035036603,0.0030110513,0.0011240888,0.0016899541,0.00016227513,0.000018508352],"category_scores_gemma":[0.000026017151,0.00029396254,0.00010592307,0.0012367647,0.00011591825,0.00048153492,0.00012412287,0.0015407172,0.000002073938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051076568,0.00014272949,0.0005526529,0.000008430119,0.00003111287,4.1077612e-7,0.00017165962,0.56252795,0.00012554598,0.0013335112,0.00006650927,0.4349884],"study_design_scores_gemma":[0.0016063285,0.00016319467,0.00008475322,0.00023835879,0.000020154746,0.0000017493991,0.000040377923,0.9504201,0.00012160768,0.00007534276,0.04695777,0.00027028684],"about_ca_topic_score_codex":0.00006461798,"about_ca_topic_score_gemma":0.0012287092,"teacher_disagreement_score":0.97817445,"about_ca_system_score_codex":0.00012456096,"about_ca_system_score_gemma":0.00013942474,"threshold_uncertainty_score":0.99995124},"labels":[],"label_agreement":null},{"id":"W4412748092","doi":"10.1109/tit.2025.3594183","title":"Capacity Bounds for Broadcast Channels With Bidirectional Conferencing Decoders","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Decoding methods; Channel capacity; Telecommunications; Channel (broadcasting)","score_opus":0.026686109752182153,"score_gpt":0.25748268746460945,"score_spread":0.2307965777124273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412748092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013257064,0.000018873927,0.98949564,0.00070317887,0.0007075888,0.0003019641,0.000010885394,0.00020181392,0.007234356],"genre_scores_gemma":[0.98872507,0.000057896665,0.009001154,0.001299722,0.000013627191,0.00019225314,0.000005723748,0.0000040356026,0.00070051616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925256,0.00008675231,0.00024739662,0.0001236216,0.00013010552,0.00015956866],"domain_scores_gemma":[0.99892193,0.00031022693,0.000079941055,0.00034451546,0.000298147,0.000045216348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043210236,0.00012268519,0.00011227063,0.00032100218,0.0006894716,0.0002521681,0.00035139013,0.00005382498,0.00003312417],"category_scores_gemma":[0.000013005909,0.0001104086,0.000063355816,0.00047476962,0.00006841644,0.0013543277,0.0000033022375,0.00016902348,0.000024710596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014248007,0.000072883115,0.0000050208355,0.000035875724,0.000102347396,7.329534e-8,0.0032992545,0.045370866,0.00011003559,0.48893285,0.00059276016,0.46133554],"study_design_scores_gemma":[0.0036232313,0.00042714502,0.00022973976,0.00036991455,0.00006284289,0.000024564544,0.0009840454,0.8156387,0.060070314,0.025895108,0.09187543,0.0007989417],"about_ca_topic_score_codex":0.0000035565556,"about_ca_topic_score_gemma":0.00001801176,"teacher_disagreement_score":0.98739934,"about_ca_system_score_codex":0.00010699338,"about_ca_system_score_gemma":0.0001590946,"threshold_uncertainty_score":0.53029275},"labels":[],"label_agreement":null},{"id":"W4413156685","doi":"10.1109/twc.2025.3595700","title":"Improving Wireless Federated Learning via Joint Downlink-Uplink Beamforming Over Analog Transmission","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Ontario Tech University; Natural Sciences and Engineering Research Council of Canada; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Telecommunications link; Computer science; Beamforming; Joint (building); Wireless; Transmission (telecommunications); Computer network; Telecommunications; Engineering","score_opus":0.028093080595742823,"score_gpt":0.28074164400553375,"score_spread":0.2526485634097909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413156685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005495946,0.0005636941,0.9873766,0.0030366546,0.00030976528,0.00047035387,0.0000044370204,0.00073355733,0.002008996],"genre_scores_gemma":[0.97139204,0.0037793876,0.023049219,0.0006132161,0.000015879856,0.0001931215,0.00003062997,0.000031972577,0.0008945595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972577,0.0005785198,0.0008077423,0.00058151665,0.00029450541,0.00048002868],"domain_scores_gemma":[0.9960595,0.00053779205,0.00023987168,0.0026567422,0.00033122118,0.0001749105],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00061385694,0.00038325932,0.00042437811,0.00059668726,0.0036313916,0.00044054392,0.0025598935,0.00022050863,0.00004615258],"category_scores_gemma":[0.000012522498,0.0003969731,0.00023189951,0.0021703274,0.00020321387,0.0007884981,0.00009190618,0.0016169045,0.0000339413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000171652,0.0003998608,0.000022873992,0.000030174253,0.00009029538,0.0000012638669,0.0007216518,0.0071655004,0.045551784,0.0084424475,0.000058845482,0.93749815],"study_design_scores_gemma":[0.0007514323,0.000074196156,0.00015937215,0.00031503118,0.000044210767,0.000007201413,0.00008550472,0.9713601,0.021380473,0.00019226852,0.0052020727,0.0004281361],"about_ca_topic_score_codex":0.00013155298,"about_ca_topic_score_gemma":0.0003301412,"teacher_disagreement_score":0.96589607,"about_ca_system_score_codex":0.00028931952,"about_ca_system_score_gemma":0.00027448853,"threshold_uncertainty_score":0.9998482},"labels":[],"label_agreement":null},{"id":"W4413555983","doi":"10.1109/mcom.001.2400652","title":"Integrated Heterogeneous Service Provisioning: Unifying Beyond-Communication Capabilities with MDMA in 6G and Future Wireless Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computer network; Provisioning; Wireless; Wireless network; Telecommunications; Service set; Wi-Fi array","score_opus":0.0200182878857237,"score_gpt":0.2671730265701196,"score_spread":0.2471547386843959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413555983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3141721,0.073755234,0.41775778,0.14271367,0.0010171002,0.0041179713,0.000019241146,0.0018869967,0.04455993],"genre_scores_gemma":[0.95286477,0.014395879,0.030675564,0.0014170952,0.000030253133,0.00022231441,0.00006585102,0.000021547634,0.0003067279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977552,0.00079332246,0.0005450389,0.00042730517,0.0001585143,0.0003205988],"domain_scores_gemma":[0.99380934,0.0005774995,0.00018090672,0.0047866306,0.0005613437,0.00008430074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006230603,0.00029043495,0.0003380026,0.00036623428,0.0007425081,0.00036406488,0.0036048603,0.00013482725,0.000008101359],"category_scores_gemma":[0.00003275023,0.0002648263,0.000038587266,0.0025299587,0.0002750265,0.00062101614,0.00153979,0.0007719098,0.000007812097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012893036,0.00091955083,0.009145496,0.00017506453,0.00020028478,0.000008719646,0.008907624,0.014052427,0.0016455736,0.37614748,0.00170365,0.5869652],"study_design_scores_gemma":[0.0012652328,0.000086520056,0.0069235326,0.00064872345,0.000027613387,0.000036650774,0.00069376774,0.9197142,0.0002112783,0.0016867206,0.06815514,0.00055059517],"about_ca_topic_score_codex":0.00006913557,"about_ca_topic_score_gemma":0.0044626733,"teacher_disagreement_score":0.9056618,"about_ca_system_score_codex":0.00016850962,"about_ca_system_score_gemma":0.00019915913,"threshold_uncertainty_score":0.9999804},"labels":[],"label_agreement":null},{"id":"W4413721790","doi":"10.3390/info16090728","title":"On Information-Theoretic Scaling Laws for Wireless Networks","year":2025,"lang":"en","type":"article","venue":"Information","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scaling law; Wireless; Computer science; Wireless network; Law; Scaling; Theoretical computer science; Mathematics; Mathematical economics; Computer network; Political science; Telecommunications; Geometry","score_opus":0.011118458092443882,"score_gpt":0.25926324725690025,"score_spread":0.24814478916445637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413721790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014018711,0.00004254595,0.98077965,0.0016424024,0.00036023595,0.0003291643,0.0000017747759,0.00015284536,0.015289524],"genre_scores_gemma":[0.9901709,0.00017190917,0.0049081855,0.0045204107,0.000020796688,0.000095378506,0.000063793035,0.000001874612,0.000046777583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999298,0.00003400067,0.00034813394,0.000059153812,0.00011013943,0.00015062129],"domain_scores_gemma":[0.9989603,0.0002498671,0.00011937639,0.00039622557,0.00024400259,0.000030222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037817756,0.000088589535,0.0000896115,0.00019108092,0.00030860852,0.00040065998,0.00054583495,0.000055982473,0.000007008045],"category_scores_gemma":[0.00011152786,0.000083717554,0.000044213924,0.00043772988,0.000023554445,0.0028702903,0.00013308962,0.000108499094,0.00006177835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006859256,0.00000411495,0.0000067684377,0.00001161505,0.0000039893803,8.8019645e-9,0.00040739114,0.007007586,0.0000013437932,0.66334397,0.0035375503,0.3256688],"study_design_scores_gemma":[0.00037263954,0.000022299282,0.00018654265,0.000071196104,0.0000025182642,4.3662857e-7,0.00003695498,0.92217404,0.00014959411,0.0057405154,0.07115092,0.000092341885],"about_ca_topic_score_codex":0.0000010779023,"about_ca_topic_score_gemma":0.0000016170663,"teacher_disagreement_score":0.988769,"about_ca_system_score_codex":0.00006173241,"about_ca_system_score_gemma":0.000051095987,"threshold_uncertainty_score":0.38635734},"labels":[],"label_agreement":null},{"id":"W4413823310","doi":"10.1109/icccn65249.2025.11133903","title":"Pegasus: Efficient Asynchronous Three-Layer Federated Learning","year":2025,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Asynchronous communication; Asynchronous learning; Layer (electronics); Computer network; Mathematics education; Synchronous learning; Psychology; Materials science; Nanotechnology","score_opus":0.027871707272830254,"score_gpt":0.2827358667276342,"score_spread":0.2548641594548039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413823310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009667576,0.00054306193,0.86199915,0.0021430682,0.00019373275,0.00010838675,4.8191158e-8,0.00036120237,0.124983765],"genre_scores_gemma":[0.9878675,0.000070531554,0.0076547503,0.0007749738,0.000015682568,0.000012947398,0.0000014029672,0.000003920795,0.0035982935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999125,0.00011409534,0.00017464536,0.0002629695,0.00011683603,0.00020647938],"domain_scores_gemma":[0.9992177,0.00012550378,0.000035186767,0.00042705488,0.0001498961,0.000044696382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026849782,0.000105819956,0.00011441335,0.00010135248,0.00055613567,0.00033522033,0.0006662487,0.00003716101,0.00012391877],"category_scores_gemma":[0.00006055762,0.00009202387,0.00004131823,0.0007192913,0.000026648544,0.00009862239,0.0005584874,0.00021860738,0.00012318557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006057243,0.00012799453,0.0016998096,0.000007989442,0.000041298903,0.000004801835,0.00038956065,0.017712455,0.0024329175,0.5979891,0.003816068,0.37577197],"study_design_scores_gemma":[0.00028598323,0.000029364615,0.0027941081,0.00003298579,0.000002783236,0.0000021424512,0.000027605418,0.9653858,0.0016551854,0.00022024586,0.02942324,0.00014055653],"about_ca_topic_score_codex":0.000009217135,"about_ca_topic_score_gemma":0.0000918681,"teacher_disagreement_score":0.9781999,"about_ca_system_score_codex":0.000066652065,"about_ca_system_score_gemma":0.00013065973,"threshold_uncertainty_score":0.42774022},"labels":[],"label_agreement":null},{"id":"W4414405997","doi":"10.1109/iccworkshops67674.2025.11162488","title":"Federated Learning for Scalable Edge Caching in Dynamic D2D Communication Networks","year":2025,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Scalability; Cache; Enhanced Data Rates for GSM Evolution; Cluster analysis; Edge device; Energy consumption; User equipment; Efficient energy use; Graph","score_opus":0.020157368343806516,"score_gpt":0.2981290095069113,"score_spread":0.2779716411631048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414405997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004252043,0.0012368107,0.9783159,0.0027601807,0.00010404303,0.00027788288,7.193029e-8,0.00018346788,0.012869591],"genre_scores_gemma":[0.9811083,0.0009560154,0.01349148,0.0006252988,0.0000056889985,0.000067945766,0.00001695895,0.0000059523027,0.003722356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989528,0.00029014942,0.00025695527,0.00022438288,0.00005501712,0.00022066465],"domain_scores_gemma":[0.9988794,0.00045988854,0.00005621394,0.00045318482,0.0001228502,0.000028489983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007352606,0.00010008564,0.00014334435,0.00014570102,0.00061409286,0.00030539386,0.0007802871,0.000060309587,0.000009963888],"category_scores_gemma":[0.0000675556,0.00010138302,0.000036209116,0.0008051564,0.000023952938,0.00033067298,0.00038630335,0.0003281838,0.000004634904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019738602,0.0001243057,0.004026105,0.000021502887,0.000029324052,5.8246883e-7,0.00068217015,0.10999086,0.00067628996,0.19738217,0.0028666558,0.6841803],"study_design_scores_gemma":[0.00039893054,0.000013135384,0.0017777845,0.0000895637,0.0000017655309,4.401817e-7,0.000044198558,0.9904199,0.000064017266,0.0005606829,0.00652485,0.000104698054],"about_ca_topic_score_codex":0.00002638905,"about_ca_topic_score_gemma":0.0010468601,"teacher_disagreement_score":0.97685623,"about_ca_system_score_codex":0.00011865918,"about_ca_system_score_gemma":0.00005681838,"threshold_uncertainty_score":0.4723168},"labels":[],"label_agreement":null},{"id":"W4414538970","doi":"10.1109/tvt.2025.3614719","title":"Aerial 6D Movable Antenna-Enabled Cell-Free Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Convergence (economics); Telecommunications link; Position (finance); Scalability; Antenna (radio); Rotation (mathematics); Scheme (mathematics); Antenna array; Channel (broadcasting)","score_opus":0.011039791738758551,"score_gpt":0.23534278835405975,"score_spread":0.2243029966153012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414538970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004000361,0.00079249643,0.9846088,0.00634495,0.00107953,0.0002852252,0.0000022557238,0.0009155805,0.0019707533],"genre_scores_gemma":[0.9802207,0.0011208126,0.01575706,0.00084228546,0.000026622729,0.00014501033,0.0000016634284,0.000014659999,0.0018711949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985424,0.000119747696,0.00030840162,0.0004819643,0.00013926988,0.00040818832],"domain_scores_gemma":[0.99754727,0.00008807193,0.00006786983,0.0020749392,0.000168416,0.00005344121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022369986,0.00021634696,0.00026715285,0.00061327155,0.00057733536,0.0001087941,0.0021713674,0.00032352697,0.00004870564],"category_scores_gemma":[0.000013546536,0.00021866334,0.000121486024,0.0022729987,0.00013930305,0.00020410643,0.00004739265,0.0007025168,0.00005874031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017226962,0.002095639,0.000060773873,0.000073142095,0.0005162663,0.00017348098,0.0003294684,0.21932095,0.09238041,0.23993388,0.015683398,0.4292603],"study_design_scores_gemma":[0.0026608729,0.00023953675,0.000041622854,0.00013990562,0.000054610635,0.00003981909,0.00006144389,0.8523259,0.0964217,0.0049550105,0.042485986,0.00057357125],"about_ca_topic_score_codex":0.0000076914175,"about_ca_topic_score_gemma":0.000053802436,"teacher_disagreement_score":0.9762203,"about_ca_system_score_codex":0.000099378114,"about_ca_system_score_gemma":0.00009779961,"threshold_uncertainty_score":0.8916832},"labels":[],"label_agreement":null},{"id":"W4414539013","doi":"10.1109/icc52391.2025.11160724","title":"Decentralized Unlicensed Spectrum Management in Beyond 5G Heterogeneous Networks","year":2025,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université de Montréal","funders":"","keywords":"Heterogeneous network; Spectrum management; Hoarding (animal behavior); Base station; Spectrum (functional analysis); Resource management (computing); Cellular network","score_opus":0.0144425352503086,"score_gpt":0.2708831958019837,"score_spread":0.25644066055167514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414539013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002982499,0.0013683279,0.87886477,0.006541759,0.0003875731,0.00035971336,1.2393922e-7,0.00021292955,0.1092823],"genre_scores_gemma":[0.9790936,0.0044169165,0.010387639,0.003627103,0.0000110659275,0.00002663447,0.0000024616284,0.000004747759,0.0024298504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895805,0.00012314474,0.00023844527,0.00028840886,0.00009473029,0.00029719327],"domain_scores_gemma":[0.999093,0.00006446541,0.000030553845,0.00074253674,0.000022032604,0.00004740945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020456106,0.00011585593,0.00013667409,0.0001640511,0.000108038046,0.00014191575,0.0009552296,0.000036303212,0.00008586762],"category_scores_gemma":[0.0000042207316,0.00011044151,0.000045381767,0.0009544137,0.000021758005,0.00011610051,0.00045512358,0.000121444704,0.000020862259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000121595795,0.00009484087,0.0007109293,0.0000054076736,0.000043031214,0.00002744323,0.00011712658,0.0071565565,0.00003269286,0.85139465,0.0034855097,0.13691963],"study_design_scores_gemma":[0.0014379319,0.000022709955,0.005372366,0.000056817527,0.0000074264362,0.0000043857203,0.000020099049,0.9246119,0.0008639381,0.005954748,0.061370127,0.00027751492],"about_ca_topic_score_codex":0.000006575653,"about_ca_topic_score_gemma":0.00031520543,"teacher_disagreement_score":0.97611105,"about_ca_system_score_codex":0.000083801315,"about_ca_system_score_gemma":0.000018808929,"threshold_uncertainty_score":0.45036742},"labels":[],"label_agreement":null},{"id":"W4415367574","doi":"10.1109/isit63088.2025.11195654","title":"Modulo Quantization Coding for Gaussian Primitive Relay Channel With Perfectly Correlated Noises","year":2025,"lang":"","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantization (signal processing); Gaussian; Relay; Channel (broadcasting); Modulo; Coding (social sciences); Decoding methods","score_opus":0.03162035735356012,"score_gpt":0.2861603149214014,"score_spread":0.2545399575678413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415367574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026078657,0.0014165696,0.9596366,0.0065182163,0.0009599368,0.0016712062,0.0000074895993,0.0002646364,0.026917439],"genre_scores_gemma":[0.9703298,0.0027400774,0.013311075,0.0013697714,0.00006583702,0.00015885802,0.000037995633,0.000030692612,0.011955868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971375,0.0003662536,0.0006573991,0.0009531098,0.00027648694,0.0006092755],"domain_scores_gemma":[0.9966882,0.00066210335,0.00030383316,0.0011023905,0.0010924051,0.00015110885],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00066404056,0.00045980595,0.00049349427,0.00041012128,0.001575331,0.00066594366,0.0011586109,0.0002100159,0.00006075687],"category_scores_gemma":[0.00024485314,0.00040185338,0.00014301036,0.0022879178,0.00020896792,0.00082838733,0.00056802545,0.00042799432,0.000026573123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031455045,0.00046028406,0.0007175849,0.00018069662,0.0003879979,0.0000052788428,0.006068255,0.019101975,0.001541633,0.8643871,0.0038387214,0.10299595],"study_design_scores_gemma":[0.0018969408,0.00041765443,0.002919302,0.0012271849,0.000101504185,0.000006638954,0.00038685737,0.985446,0.0032393793,0.00023487721,0.0035862538,0.00053743273],"about_ca_topic_score_codex":0.000016334678,"about_ca_topic_score_gemma":0.00018526951,"teacher_disagreement_score":0.96772194,"about_ca_system_score_codex":0.00022467718,"about_ca_system_score_gemma":0.00053366943,"threshold_uncertainty_score":0.99984336},"labels":[],"label_agreement":null},{"id":"W46412094","doi":"","title":"Unified Performance Analysis of Two Hop Amplify and Forward Relaying","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Cumulative distribution function; Nakagami distribution; Moment-generating function; Probability density function; Computer science; Fading; Channel (broadcasting); Wireless; Monte Carlo method; Hop (telecommunications); Topology (electrical circuits); Noise (video); Signal-to-noise ratio (imaging); Telecommunications; Algorithm; Statistics; Electronic engineering; Mathematics; Engineering; Physics; Combinatorics; Artificial intelligence","score_opus":0.036911761227937954,"score_gpt":0.2983316099498651,"score_spread":0.26141984872192714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46412094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49651077,0.0003356335,0.48315626,0.0010152382,0.000025787622,0.000064649765,2.9537887e-7,0.00008044802,0.018810907],"genre_scores_gemma":[0.9798573,0.0007236827,0.018716887,0.00045312525,0.0000051355773,0.0000010260516,0.0000016918543,0.000001216945,0.00023991411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946046,0.00004183972,0.00016092078,0.00014490307,0.000091879956,0.00009997961],"domain_scores_gemma":[0.9993006,0.00006809847,0.0000550644,0.0004641596,0.00007139207,0.000040715233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023963468,0.000060426428,0.0001468784,0.00017976724,0.000108139255,0.00004949739,0.0003881253,0.000018349152,0.000019436802],"category_scores_gemma":[0.000012738111,0.00005129316,0.00003575867,0.0011280819,0.000021391279,0.00024210055,0.00013294884,0.00007380682,0.0000023345196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006091167,0.000045976776,0.0144525245,0.000004282906,0.00015611367,6.4720166e-7,0.0013660304,0.002737504,0.0033036782,0.4466176,0.00023363932,0.5310759],"study_design_scores_gemma":[0.00023471897,0.00006602808,0.08708971,0.000010961524,0.00005210982,0.0000012318457,0.00002252807,0.9100021,0.0010474231,0.00034213244,0.0010106425,0.000120417724],"about_ca_topic_score_codex":0.000003795147,"about_ca_topic_score_gemma":0.000017998302,"teacher_disagreement_score":0.9072646,"about_ca_system_score_codex":0.000009827554,"about_ca_system_score_gemma":0.000012252591,"threshold_uncertainty_score":0.20916742},"labels":[],"label_agreement":null},{"id":"W598280413","doi":"10.1142/7116","title":"Selected Topics in Information and Coding Theory","year":2010,"lang":"en","type":"book","venue":"Series on coding theory and cryptology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Coding (social sciences); Computer science; Sociology; Social science","score_opus":0.012937566568361411,"score_gpt":0.24173542475030435,"score_spread":0.22879785818194293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W598280413","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012659814,0.0054101706,0.24903707,0.0064531313,0.0028292944,0.0014391614,0.000026643505,0.00086693635,0.7212778],"genre_scores_gemma":[0.5005535,0.09097251,0.024375796,0.020461818,0.001550399,0.00037666367,0.00056389,0.00021733726,0.3609281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842006,0.0005954945,0.00034817262,0.0002906605,0.00009672528,0.00024889287],"domain_scores_gemma":[0.9982307,0.0009188422,0.00018273912,0.00048520742,0.000116822965,0.000065698376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012595663,0.00025514638,0.0003551518,0.00027928874,0.00032243461,0.00018261676,0.0005227166,0.00038595064,0.00005318533],"category_scores_gemma":[0.0003778853,0.00024495128,0.000028288785,0.00017309442,0.00029769022,0.0005940347,0.00047030806,0.00092168135,0.0000124178005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067973946,0.000007426232,0.00002259089,0.000033143133,0.000013981902,0.0000035478765,0.0014637795,0.0000010400504,0.000047727102,0.8997583,0.00039362223,0.09818691],"study_design_scores_gemma":[0.0005751618,0.00027278264,0.0005389078,0.0002833903,0.000016106973,0.00010550258,0.00012402554,0.0006117254,0.00021578034,0.6463809,0.3503437,0.0005320049],"about_ca_topic_score_codex":4.478482e-7,"about_ca_topic_score_gemma":0.000049709153,"teacher_disagreement_score":0.48789367,"about_ca_system_score_codex":0.00004917346,"about_ca_system_score_gemma":0.00015117611,"threshold_uncertainty_score":0.9988823},"labels":[],"label_agreement":null},{"id":"W62077061","doi":"","title":"Channel-relay price pair: towards arbitrating incentives in wireless ad hoc networks: Research Articles","year":2006,"lang":"en","type":"article","venue":"Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Relay; Wireless network; Node (physics); Bargaining problem; Game theory; Incentive; Wireless; Nash equilibrium; Channel (broadcasting); Pareto principle; Resource management (computing); Mathematical optimization; Telecommunications; Microeconomics; Economics; Engineering","score_opus":0.0657013673395086,"score_gpt":0.34151104043393943,"score_spread":0.27580967309443083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62077061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5558788,0.08041499,0.35438633,0.0029403132,0.00016151727,0.0009920179,0.0000015541783,0.00039556765,0.004828906],"genre_scores_gemma":[0.9707296,0.009413242,0.019499207,0.000109926186,0.00005577381,0.00010557607,0.0000116438405,0.000015515478,0.00005952973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717903,0.0010765719,0.0005506819,0.0004291719,0.00023504416,0.00052949355],"domain_scores_gemma":[0.996505,0.0010412788,0.00015049858,0.001882963,0.0003298757,0.00009035913],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002523313,0.00018201963,0.00024480931,0.000271017,0.0013250529,0.0004242192,0.0021735055,0.00008283662,0.0000032893504],"category_scores_gemma":[0.000065482986,0.00018759449,0.000052085074,0.0016504411,0.00032715674,0.0004011257,0.003504219,0.0007600598,0.000005522225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000807487,0.00044065397,0.0038390893,0.000028883425,0.000021064787,0.0000044894127,0.0068530417,0.007523376,0.0011982467,0.08174422,0.00036713158,0.89797175],"study_design_scores_gemma":[0.00037068882,0.00007149063,0.007693915,0.00025730545,0.0000024729886,0.0000074866216,0.0006450984,0.9817349,0.0001734394,0.0010547731,0.007747044,0.00024139778],"about_ca_topic_score_codex":0.000055569155,"about_ca_topic_score_gemma":0.00030773427,"teacher_disagreement_score":0.9742115,"about_ca_system_score_codex":0.0001128796,"about_ca_system_score_gemma":0.00009275944,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W644593901","doi":"10.1017/cbo9781139034357","title":"Network-aware Source Coding and Communication","year":2011,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Regina","funders":"","keywords":"Linear network coding; Multiple description coding; Computer science; Fidelity; Coding (social sciences); Distributed computing; Computer network; Information theory; Lossy compression; Shannon–Fano coding; Distributed source coding; Variable-length code; Theoretical computer science; Source code; Lossless compression; Decoding methods; Telecommunications; Algorithm; Artificial intelligence; Data compression; Network packet; Mathematics","score_opus":0.04459499555015852,"score_gpt":0.21486369401277516,"score_spread":0.17026869846261664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W644593901","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006659819,0.001412322,0.17139827,0.000048069785,0.000087591514,0.0002582283,0.0000073706383,0.0002615387,0.82651997],"genre_scores_gemma":[0.0017113619,0.0030029367,0.0019842165,0.00023355924,0.00007680231,0.0000017040568,0.000039582465,0.000026172684,0.9929237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985702,0.0003040852,0.000196907,0.00047048827,0.00016369259,0.00029463947],"domain_scores_gemma":[0.99749917,0.00018536442,0.00026782334,0.0016780134,0.00021128175,0.00015836826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002650412,0.00029845446,0.00033211143,0.00011736584,0.00069422764,0.00016646276,0.0022447254,0.00024826734,0.00000262619],"category_scores_gemma":[0.000008977451,0.00036598227,0.0000869792,0.00003804334,0.00023664623,0.00026020178,0.003325117,0.0006359981,0.000010490737],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082144825,0.0000061235373,0.0000030614312,0.000024086916,0.000039980747,0.000010097762,0.00024670488,0.000009500785,0.0000030292124,0.85203546,0.13375336,0.01386039],"study_design_scores_gemma":[0.0003041266,0.000025097703,0.00002479283,0.00029714414,0.000045492565,0.000014012025,0.000014542728,0.00610439,0.000017569553,0.00006581473,0.9926838,0.000403172],"about_ca_topic_score_codex":0.000019282745,"about_ca_topic_score_gemma":0.000004957995,"teacher_disagreement_score":0.85893047,"about_ca_system_score_codex":0.00018420197,"about_ca_system_score_gemma":0.00017012209,"threshold_uncertainty_score":0.99987924},"labels":[],"label_agreement":null},{"id":"W6986521396","doi":"","title":"Power-optimal MIMO two-way relay networks","year":2018,"lang":"en","type":"dissertation","venue":"e-scholar@UOIT (University of Ontario Institute of Technology)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Power (physics); Synchronism; Transmission (telecommunications); Context (archaeology); Node (physics); Frame (networking)","score_opus":0.014022833518282717,"score_gpt":0.23001585443955622,"score_spread":0.2159930209212735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986521396","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95532423,0.0011416152,0.013702999,0.00032566226,0.0017251575,0.00039034797,0.000008657449,0.000317956,0.027063353],"genre_scores_gemma":[0.12166749,0.00093910575,0.8606461,0.00006079657,0.000049239523,0.0000028012576,0.0002640031,0.000034855348,0.01633556],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99794424,0.000021650632,0.00044813004,0.00077699573,0.00038244226,0.00042656212],"domain_scores_gemma":[0.99626213,0.000004629604,0.00080258085,0.0020131376,0.00079810934,0.00011943156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005347772,0.0004234471,0.00074833387,0.00083942665,0.00091936253,0.00006803458,0.004690692,0.0008947282,0.00043230457],"category_scores_gemma":[0.000074054486,0.00054033636,0.0002993406,0.0014312525,0.00035223493,0.0014904737,0.0011441424,0.0022657262,0.000076446835],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005219112,0.00092675857,0.0005148265,0.00016633232,0.0013502134,0.00029007273,0.019725157,0.0020538263,0.0032166704,0.12045367,0.015623013,0.8351576],"study_design_scores_gemma":[0.0009647557,0.00029035675,0.0029801847,0.00040746375,0.00007857153,0.000015109849,0.00035192445,0.0017427581,0.0007046484,0.00022633016,0.9917111,0.000526815],"about_ca_topic_score_codex":0.0014661852,"about_ca_topic_score_gemma":0.053692594,"teacher_disagreement_score":0.97608805,"about_ca_system_score_codex":0.00057394605,"about_ca_system_score_gemma":0.00095276476,"threshold_uncertainty_score":0.99970484},"labels":[],"label_agreement":null},{"id":"W6999010694","doi":"","title":"Bit-interleaved coded modulation with iterative decoding (BICM-ID) using signal space diversity (SSD) over non-orthogonal amplify-and-forward (NAF) relay channels","year":2010,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Upper and lower bounds; Superposition principle; Modulation (music); Channel (broadcasting); Euclidean distance; Convergence (economics); Relay; Antenna diversity; Fading","score_opus":0.00917174315766363,"score_gpt":0.17807463901469525,"score_spread":0.1689028958570316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999010694","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06478979,0.0011510003,0.42177758,0.0036198506,0.0013281071,0.0016024474,0.0006013926,0.00017804986,0.5049518],"genre_scores_gemma":[0.9488527,0.00030456975,0.0172705,0.000726607,0.00013634271,0.0000065697714,0.000027011336,0.00008563428,0.032590043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977807,0.0001216493,0.00024400135,0.00046846122,0.0010784911,0.0003067074],"domain_scores_gemma":[0.998788,0.00019372316,0.0003621956,0.00039112903,0.0000027397975,0.00026223325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00002856948,0.00034257435,0.00038984226,0.00009205207,0.00048561895,0.000120071505,0.00055304175,0.0000869476,0.00010714978],"category_scores_gemma":[0.0000022477866,0.00031533313,0.000031353597,0.00015203662,0.0001233637,0.00050918263,0.001097476,0.00040570108,6.6788797e-9],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022592207,0.00035351972,0.08550893,0.0012881957,0.0027002213,0.00073224865,0.006954203,0.008057133,0.06642387,0.6371979,0.04334654,0.14517799],"study_design_scores_gemma":[0.0019884647,0.000253134,0.014443772,0.001743132,0.00009636869,0.000044020067,0.0005682641,0.90317005,0.008996691,0.0007953249,0.06620039,0.001700413],"about_ca_topic_score_codex":0.0016780909,"about_ca_topic_score_gemma":0.04859475,"teacher_disagreement_score":0.8951129,"about_ca_system_score_codex":0.000018478955,"about_ca_system_score_gemma":0.00072346,"threshold_uncertainty_score":0.99992985},"labels":[],"label_agreement":null},{"id":"W7017998474","doi":"","title":"Coding techniques for multicasting in wireless networks","year":2004,"lang":"en","type":"dissertation","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Wireless network; Wireless; Coding (social sciences); Linear network coding; Multicast; Wireless Application Protocol","score_opus":0.024520694542755753,"score_gpt":0.2957134372808379,"score_spread":0.27119274273808214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017998474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03795203,0.0046524527,0.9386086,0.004843474,0.002826904,0.003541615,0.000035277357,0.002451401,0.005088286],"genre_scores_gemma":[0.848371,0.001963393,0.14825444,0.00008189629,0.000086770524,0.00053005875,0.00018351145,0.00006376364,0.0004651191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972076,0.00005045965,0.00093522103,0.0008674146,0.00029017238,0.00064914743],"domain_scores_gemma":[0.99709886,0.00012259105,0.00076333515,0.0014620476,0.00047606425,0.00007707284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051179604,0.00055032555,0.0008926475,0.0015992157,0.00032784202,0.00011251108,0.0028355445,0.0011549849,0.000004104417],"category_scores_gemma":[0.00042361586,0.000601339,0.00021015739,0.0020413923,0.0002325206,0.00055552507,0.0004702399,0.0011952041,0.000002979191],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000605021,0.00031842568,0.00077099126,0.0004664142,0.00016533017,0.000039439477,0.001105604,0.0011042601,0.007539452,0.3466313,0.00052836357,0.6412699],"study_design_scores_gemma":[0.009415015,0.0014100457,0.002703649,0.02875753,0.0003949497,0.00010158352,0.0015053321,0.4905944,0.22925328,0.019166147,0.208846,0.007852079],"about_ca_topic_score_codex":0.000019154892,"about_ca_topic_score_gemma":0.0012781427,"teacher_disagreement_score":0.810419,"about_ca_system_score_codex":0.00037490143,"about_ca_system_score_gemma":0.0003814059,"threshold_uncertainty_score":0.9996438},"labels":[],"label_agreement":null},{"id":"W7022349022","doi":"","title":"Spanning","year":2019,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Craft; Studio; Statement (logic); Power (physics); Work (physics)","score_opus":0.12618261264305192,"score_gpt":0.32464288494826293,"score_spread":0.19846027230521102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022349022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96304494,0.00016896558,0.032577537,0.0005608516,0.00035545867,0.00020284003,0.0000012112532,0.00033912688,0.0027490521],"genre_scores_gemma":[0.9864415,0.00013638301,0.00054837984,0.0006499337,0.000040116476,5.725367e-7,0.000004490509,0.000016720238,0.012161921],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99836904,0.00027496633,0.00017769182,0.00051786826,0.00028105074,0.00037935676],"domain_scores_gemma":[0.9981887,0.00010553371,0.000120958124,0.0012519476,0.00015325834,0.00017963142],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034060044,0.00021047881,0.00022354373,0.00032635793,0.00025379783,0.00042577385,0.0023979072,0.000100317106,0.000057300647],"category_scores_gemma":[0.000018664809,0.00023812223,0.00010062731,0.0008004166,0.000043485117,0.0025801833,0.0013281939,0.00046159406,0.0014033833],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009986718,0.00003838534,0.9866269,0.0000107584765,0.000024798845,0.000045657187,0.00044955668,0.00006455359,0.0014497415,0.006648119,0.000001944404,0.0046295617],"study_design_scores_gemma":[0.0009145981,0.000100367055,0.9670995,0.00015410845,0.000012222879,0.000027086273,0.000078792575,0.000050859675,0.0016992169,0.00015356105,0.029204248,0.00050547154],"about_ca_topic_score_codex":3.9381214e-7,"about_ca_topic_score_gemma":0.000094728806,"teacher_disagreement_score":0.03202916,"about_ca_system_score_codex":0.00013326306,"about_ca_system_score_gemma":0.000078749894,"threshold_uncertainty_score":0.99937415},"labels":[],"label_agreement":null},{"id":"W7030327783","doi":"","title":"On Non-Binary Constellations for Channel Encoded Physical Layer Network Coding","year":2012,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Decodes; Decoding methods; Relay; Network packet; Relay channel; Binary number; Linear network coding; Channel (broadcasting); Physical layer; Transmission (telecommunications)","score_opus":0.030118144868031157,"score_gpt":0.2506845770313908,"score_spread":0.22056643216335964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030327783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9388487,0.0004790982,0.045158792,0.003018292,0.002111623,0.0016594123,0.000043474385,0.00029428245,0.008386361],"genre_scores_gemma":[0.8787399,0.00023357829,0.004846814,0.00006551436,0.00019921252,0.000003390726,0.000332408,0.000024227234,0.11555494],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988776,0.00009034583,0.00012585561,0.000356107,0.0002017888,0.00034831022],"domain_scores_gemma":[0.99846447,0.0003002585,0.00025781116,0.0006135473,0.0002531783,0.00011075699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019624204,0.00023826453,0.00038456818,0.00016864834,0.0006294375,0.000041805688,0.0009484061,0.00017004996,0.00004102133],"category_scores_gemma":[0.00001298201,0.00027544852,0.00021345678,0.00032660004,0.000058349324,0.00033171513,0.00018945041,0.0002669789,0.000046832993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073520205,0.0010639428,0.00027778943,0.0006906661,0.0007630621,0.000021552067,0.5645147,0.019335471,0.017688299,0.24409375,0.10776517,0.043050416],"study_design_scores_gemma":[0.0041701165,0.0011241745,0.007978985,0.0022088075,0.00048187602,0.0000055146593,0.03743774,0.923786,0.0050123236,0.006260648,0.008908449,0.0026253688],"about_ca_topic_score_codex":0.00020990279,"about_ca_topic_score_gemma":0.0018118771,"teacher_disagreement_score":0.90445054,"about_ca_system_score_codex":0.00007002842,"about_ca_system_score_gemma":0.0000842226,"threshold_uncertainty_score":0.9999698},"labels":[],"label_agreement":null},{"id":"W7036321014","doi":"","title":"Broadening the story: the beginnings of a peopleâs history of sport in Canada","year":2018,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Historiography; Mainstream; Narrative; Public history; Construct (python library); Oral history; Presentation (obstetrics)","score_opus":0.026232661950760166,"score_gpt":0.20615563019212668,"score_spread":0.17992296824136653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036321014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99338233,0.0008670988,0.0004257555,0.0027100658,0.00021546874,0.00014614966,0.0000021847716,0.000013003469,0.0022379165],"genre_scores_gemma":[0.9978206,0.00006675946,0.0006479716,0.00018439682,0.000019215067,3.3475644e-7,0.0000014394753,0.000006027001,0.0012532203],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99873114,0.00019977207,0.0002012026,0.00023135329,0.00042098935,0.00021555739],"domain_scores_gemma":[0.99811804,0.00017406805,0.00037508487,0.0009829942,0.00029115705,0.00005863849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010921955,0.00011855795,0.0002552838,0.00013790032,0.00029362843,0.000007987171,0.0025541324,0.000053010324,0.0001092005],"category_scores_gemma":[0.000057376434,0.00010302191,0.00008458083,0.0006546723,0.00052407174,0.00041337483,0.000828381,0.00042188528,0.000004456344],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002065476,0.00012442797,0.8601414,0.0000663042,0.00013699668,0.00002606847,0.082948655,0.00017040654,0.0075915204,0.02038286,0.010713836,0.017490957],"study_design_scores_gemma":[0.0006326611,0.00008157314,0.93839854,0.0001326496,0.000021397127,0.000008648868,0.0027701848,0.0021100792,0.0008298068,0.00007434762,0.054747682,0.0001924277],"about_ca_topic_score_codex":0.06155205,"about_ca_topic_score_gemma":0.5483279,"teacher_disagreement_score":0.48677585,"about_ca_system_score_codex":0.00073831616,"about_ca_system_score_gemma":0.0012815562,"threshold_uncertainty_score":0.94469714},"labels":[],"label_agreement":null},{"id":"W7067495487","doi":"","title":"Multi-way relaying systems based on network polar codes","year":2023,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noise (video); Encoding (memory); Key (lock); Polar; Transmission (telecommunications); Channel (broadcasting)","score_opus":0.04605498771216464,"score_gpt":0.2788272143806638,"score_spread":0.23277222666849917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067495487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45103547,0.021496775,0.00297785,0.00086695515,0.07746888,0.014751095,0.0026939525,0.023302022,0.405407],"genre_scores_gemma":[0.97108567,0.0015133725,0.009559687,0.0008480551,0.00019430558,0.0004277161,0.0011724392,0.00033250303,0.014866278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934189,0.001543003,0.001189511,0.0016244937,0.0011170802,0.0011070577],"domain_scores_gemma":[0.9941051,0.0012104659,0.00080474047,0.0027863316,0.0006724948,0.00042086537],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024458466,0.00097420963,0.0009791795,0.00062200037,0.0031031605,0.000639157,0.00341389,0.00079400814,0.000040876705],"category_scores_gemma":[0.0008408884,0.0010275712,0.0004291901,0.002223482,0.0000500975,0.00080006436,0.0005282578,0.0024698765,0.0010054825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002526865,0.0007170826,0.00017362797,0.00080883515,0.00057886523,0.00030513972,0.00009874747,0.064950466,0.011411902,0.6350412,0.0005341497,0.2851273],"study_design_scores_gemma":[0.0048226365,0.0008398051,0.0076073743,0.011605278,0.00034407963,0.000040311403,0.00059356686,0.61564,0.0063268845,0.0035863335,0.34138831,0.0072054416],"about_ca_topic_score_codex":0.00014017818,"about_ca_topic_score_gemma":0.0011848997,"teacher_disagreement_score":0.6314548,"about_ca_system_score_codex":0.0007765492,"about_ca_system_score_gemma":0.00014284991,"threshold_uncertainty_score":0.99983144},"labels":[],"label_agreement":null},{"id":"W7084614840","doi":"10.17605/osf.io/s36qm","title":"Replication of Cameron et al. [2019] at McGill University","year":2017,"lang":"en","type":"article","venue":"OSF Preprints (OSF Preprints)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Empathy; Replication (statistics); Trait; Cognition; Social cognitive theory","score_opus":0.03711329243018154,"score_gpt":0.29091823907122916,"score_spread":0.25380494664104764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084614840","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10454083,0.0000051443144,0.05028263,0.016205749,0.00029360934,0.0007263358,0.00003099851,0.00023701316,0.82767767],"genre_scores_gemma":[0.8258528,0.0013019067,0.0073184455,0.0007566667,0.000009091489,0.000011469701,0.000010146697,0.000013798521,0.16472565],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99745136,0.0005044413,0.00026517655,0.0013610647,0.00022554574,0.00019240082],"domain_scores_gemma":[0.9866245,0.00022417032,0.00045509933,0.012356825,0.00022936802,0.00011006078],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003224908,0.000140668,0.00020765413,0.00007794936,0.00073950086,0.00006687697,0.004014501,0.00006929808,0.015540669],"category_scores_gemma":[0.0012880812,0.00016522408,0.00010173562,0.00012055752,0.00013818864,0.0006560076,0.006741098,0.00022302193,0.09133267],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014187054,0.00055734173,0.027035331,0.00004259483,0.00018336228,0.000016040216,0.0022502593,0.0010098382,0.06779269,0.20900604,0.26825497,0.42370966],"study_design_scores_gemma":[0.0004845832,0.0000014975462,0.07847545,0.00005708231,0.000011907231,0.00001089676,0.0000160563,0.008504116,0.023931703,0.0008598858,0.88739383,0.0002529748],"about_ca_topic_score_codex":0.00016429248,"about_ca_topic_score_gemma":0.00017833384,"teacher_disagreement_score":0.721312,"about_ca_system_score_codex":0.00026292776,"about_ca_system_score_gemma":0.000069359856,"threshold_uncertainty_score":0.98535925},"labels":[],"label_agreement":null},{"id":"W7097125773","doi":"","title":"private communication","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Relay; Reliability (semiconductor); Diversity (politics); Telecommunications network; Communications system; Communications law","score_opus":0.04259137158450225,"score_gpt":0.28182749111177885,"score_spread":0.2392361195272766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097125773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023250848,0.00018539898,0.9425742,0.0156305,0.000032749373,0.000042402364,6.887924e-8,0.00020020432,0.03900942],"genre_scores_gemma":[0.9426163,0.0010837553,0.053333372,0.0006002274,0.000006841102,0.0000069688435,2.2437354e-7,0.0000020003138,0.0023503022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999623,0.000075638265,0.0000806404,0.00008828717,0.000056763663,0.00007567102],"domain_scores_gemma":[0.9988436,0.00009862612,0.000022925384,0.0009609709,0.000044975448,0.000028873397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016024028,0.000036529655,0.000036685546,0.000024600622,0.00009780321,0.000042800802,0.0010004303,0.0000121583735,0.00011151659],"category_scores_gemma":[0.000026824118,0.000021133632,0.000014998971,0.00013883182,0.000023669345,0.00033571737,0.00045462511,0.000025739711,0.00025212413],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.9757907e-7,0.0000054012594,0.00018146372,1.2837044e-7,0.0000012125574,5.6229005e-8,0.000037348113,1.8345195e-7,0.0026437223,0.73298985,0.0014040411,0.26273644],"study_design_scores_gemma":[0.0008260213,0.00004546279,0.018774154,0.00008509876,0.0000017807139,0.000008139092,0.00000715419,0.010518691,0.02424565,0.042968594,0.902152,0.00036723216],"about_ca_topic_score_codex":4.2539426e-7,"about_ca_topic_score_gemma":0.0000053407416,"teacher_disagreement_score":0.9402912,"about_ca_system_score_codex":0.000016481583,"about_ca_system_score_gemma":0.000009060756,"threshold_uncertainty_score":0.32406294},"labels":[],"label_agreement":null},{"id":"W7116909563","doi":"10.1109/tcomm.2025.3647766","title":"Cooperation-Based Federated Learning and Communication Optimization Under Intermittent Device Participation in Industrial IoT","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China; National Research Foundation","keywords":"Coordinate descent; Relay; Transmission (telecommunications); Convergence (economics); Optimization problem; Convex optimization; Block (permutation group theory); Relaxation (psychology); Selection (genetic algorithm); Rate of convergence","score_opus":0.08651429102178537,"score_gpt":0.3489656001974394,"score_spread":0.262451309175654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116909563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046923277,0.002544355,0.9664183,0.022065068,0.0004759308,0.0013325725,0.000012982703,0.00023751304,0.0022209117],"genre_scores_gemma":[0.97432727,0.010786113,0.011897801,0.0013726667,0.000016900403,0.0005804497,0.00009131816,0.00003858806,0.0008889067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929969,0.00394385,0.0014803247,0.00075552595,0.00032470102,0.0004987006],"domain_scores_gemma":[0.99360573,0.0021549163,0.00042500172,0.0027868883,0.00084760453,0.00017986418],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013806322,0.00052375544,0.0005395428,0.0010999071,0.0034765482,0.0010904387,0.0019335416,0.00044589298,0.00014396785],"category_scores_gemma":[0.00016717149,0.00063467567,0.00013583896,0.003613048,0.00054810103,0.00067950744,0.00012082863,0.0022820877,0.00002959282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008522651,0.0012741144,0.00026728556,0.000023841149,0.00009680176,4.6822822e-7,0.0009790616,0.79195786,0.00022830175,0.0063822707,0.00008498625,0.19861981],"study_design_scores_gemma":[0.0025648132,0.00016751785,0.00065015926,0.001101041,0.00011390662,0.0000017748205,0.00035324277,0.99078476,0.0010974802,0.0000985531,0.0025632016,0.0005035628],"about_ca_topic_score_codex":0.00015565063,"about_ca_topic_score_gemma":0.003553002,"teacher_disagreement_score":0.96963495,"about_ca_system_score_codex":0.00068896165,"about_ca_system_score_gemma":0.0008671777,"threshold_uncertainty_score":0.99994653},"labels":[],"label_agreement":null},{"id":"W7132917215","doi":"","title":"Bandwidth and routing optimization in a wireless cellular network with relays","year":2008,"lang":"","type":"dissertation","venue":"TSpace","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Orthogonal frequency-division multiplexing; Cellular network; Base station; Bandwidth (computing); Interoperability; Mobile telephony; Wireless; Wireless network; Optimization problem; Multiplexing","score_opus":0.024649995263934445,"score_gpt":0.28066806220242024,"score_spread":0.2560180669384858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132917215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21110125,0.009610563,0.76668304,0.00082050153,0.0005851576,0.0016239343,8.089055e-7,0.00016524836,0.009409494],"genre_scores_gemma":[0.94147146,0.02623505,0.028107319,0.00015623588,0.00018113738,0.00009584721,0.00014810325,0.00006998811,0.0035348902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966921,0.0005623116,0.00064850564,0.0009935471,0.00042706728,0.0006764685],"domain_scores_gemma":[0.9976088,0.00028446366,0.00058762095,0.0009874299,0.00034279906,0.00018892754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006353521,0.0005873848,0.0006704947,0.00024367632,0.00094755314,0.0003852204,0.00085198873,0.00034138293,0.000058783782],"category_scores_gemma":[0.00004966869,0.00059537374,0.00006646529,0.001954149,0.00013510569,0.00047441092,0.00033491696,0.0009773007,0.000009437414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033950008,0.00023687215,0.008124224,0.00017349474,0.00011605356,0.00016230742,0.10749035,0.8174208,0.0004729768,0.014502457,0.00041359206,0.05054742],"study_design_scores_gemma":[0.0010983009,0.00017954383,0.002136891,0.0017388135,0.00003257826,0.000031500695,0.0014805914,0.9917324,0.0002271622,0.000016791324,0.0005497316,0.00077567593],"about_ca_topic_score_codex":0.00009193293,"about_ca_topic_score_gemma":0.0007776568,"teacher_disagreement_score":0.7385757,"about_ca_system_score_codex":0.00015505344,"about_ca_system_score_gemma":0.0003657739,"threshold_uncertainty_score":0.99964976},"labels":[],"label_agreement":null},{"id":"W72831219","doi":"10.1016/j.phycom.2009.09.003","title":"Multi-user cooperation schemes with iterative decoding","year":2009,"lang":"en","type":"article","venue":"Physical Communication","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Relay; Bandwidth (computing); Transmission (telecommunications); Computer network; Telecommunications; Power (physics); Computer engineering","score_opus":0.04079098655625182,"score_gpt":0.31463915645428925,"score_spread":0.27384816989803745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72831219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05885526,0.0005643776,0.92950743,0.0065532676,0.000025907359,0.00034642548,8.039133e-7,0.00036820196,0.0037783156],"genre_scores_gemma":[0.8817542,0.00024316827,0.11692716,0.00077784917,0.00003080405,0.000029086537,0.000022069622,0.0000071039294,0.00020854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988888,0.00029926482,0.00018677826,0.0002660107,0.00017293125,0.000186232],"domain_scores_gemma":[0.99791396,0.00016047097,0.000106544576,0.0014404707,0.00030583597,0.000072739946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019728886,0.00016320792,0.00017195432,0.0000649164,0.0005314095,0.00031426674,0.0012601108,0.000032608925,0.000006806874],"category_scores_gemma":[0.00004899709,0.00013513032,0.00004385952,0.00056810933,0.00006301443,0.0011692627,0.00024536098,0.00027943426,0.000046427576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001829984,0.000542958,0.0001588034,0.0000029693852,0.000022772663,7.94336e-7,0.0040908325,0.00041906722,0.024456529,0.82235134,0.0003510318,0.14758457],"study_design_scores_gemma":[0.0014289813,0.00038749044,0.008507627,0.00015575187,0.00001748733,0.000007785308,0.00007879537,0.9455739,0.020290961,0.0025618416,0.020356955,0.000632426],"about_ca_topic_score_codex":0.0000019590864,"about_ca_topic_score_gemma":0.000019487705,"teacher_disagreement_score":0.94515485,"about_ca_system_score_codex":0.00006162733,"about_ca_system_score_gemma":0.000039968974,"threshold_uncertainty_score":0.5510455},"labels":[],"label_agreement":null},{"id":"W85932271","doi":"","title":"On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Minimum weight; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.021324565282180588,"score_gpt":0.2516983781995553,"score_spread":0.23037381291737474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85932271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99121714,0.00069306913,0.0004873738,0.0030715219,0.0016894592,0.00036417847,0.000006402276,0.000028983224,0.002441868],"genre_scores_gemma":[0.9991376,0.000118365984,0.00018717683,0.0004541785,0.0000055850824,0.000007971021,9.893065e-7,0.000008704735,0.000079426645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998204,0.0005664623,0.00038255673,0.00021754245,0.0004316328,0.0001977854],"domain_scores_gemma":[0.99567145,0.0017851753,0.00028009294,0.0020466058,0.000176127,0.00004055933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011508409,0.00014471654,0.00020870203,0.00004983001,0.00033542686,0.000032502412,0.002967402,0.000064173524,0.000036217752],"category_scores_gemma":[0.00026578194,0.00007225907,0.00018821348,0.0011045798,0.00033307922,0.00009162311,0.0007235267,0.00028631257,0.0000032520163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023904788,0.00013788992,0.002685587,0.000002990652,0.000032700857,5.054162e-7,0.0014055113,0.000018970299,0.0042836536,0.98767656,0.0022829142,0.0014487826],"study_design_scores_gemma":[0.0021807724,0.00026824736,0.08700092,0.00032139657,0.00004902409,0.0000019257614,0.00044615733,0.0064030914,0.113893084,0.7827651,0.006294396,0.00037586718],"about_ca_topic_score_codex":0.000024748977,"about_ca_topic_score_gemma":0.000038943163,"teacher_disagreement_score":0.20491147,"about_ca_system_score_codex":0.00003997716,"about_ca_system_score_gemma":0.00008436513,"threshold_uncertainty_score":0.55142206},"labels":[],"label_agreement":null},{"id":"W915682956","doi":"","title":"Fountain Codes over Wireless Mobile Relay Channels","year":2012,"lang":"en","type":"article","venue":"Wireless Communications and Networking Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Fountain code; Relay; Computer science; Fountain; Wireless; Computer network; Mobile radio; Relay channel; Telecommunications; Decoding methods; Block code; Concatenated error correction code; Geography; Physics","score_opus":0.06518522081976676,"score_gpt":0.30836632242369794,"score_spread":0.2431811016039312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W915682956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30155942,0.06390754,0.6072511,0.0038759436,0.0019813688,0.001409667,0.000009874492,0.0011078937,0.018897226],"genre_scores_gemma":[0.954398,0.038280476,0.006235803,0.0004102761,0.00018973347,0.00021311258,0.00002211934,0.000020478636,0.00023001568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805516,0.0004293606,0.00040631273,0.00033776925,0.00021096913,0.00056042545],"domain_scores_gemma":[0.9961584,0.0004767198,0.00020778897,0.0027353535,0.00019271261,0.00022899281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086125394,0.00026567883,0.0003210833,0.000115091156,0.0010696545,0.00043125608,0.0026006328,0.00011975405,0.000031045758],"category_scores_gemma":[0.00000763109,0.0002627513,0.00006464516,0.00061357045,0.0003097702,0.00081024854,0.0023830882,0.00047499515,0.00002411305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045551424,0.00017050472,0.007731318,0.000013022707,0.0000389817,5.657844e-7,0.003312259,0.0000242383,0.00073899794,0.44449148,0.0004246593,0.54304945],"study_design_scores_gemma":[0.00050577754,0.00008204754,0.0031190265,0.00032458393,0.000023131424,0.00002874295,0.00026031796,0.774881,0.00023622286,0.0009714457,0.21884091,0.00072676985],"about_ca_topic_score_codex":0.000028981396,"about_ca_topic_score_gemma":0.00008121204,"teacher_disagreement_score":0.7748568,"about_ca_system_score_codex":0.000060708928,"about_ca_system_score_gemma":0.00007087053,"threshold_uncertainty_score":0.9999825},"labels":[],"label_agreement":null},{"id":"W938248294","doi":"10.1017/cbo9781139084284.014","title":"Energy-efficient relaying for cooperative cellular wireless networks","year":2012,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Telecommunications; Cellular network; Mobile phone; Population; Internet access; The Internet; Business; Engineering; Computer science; World Wide Web","score_opus":0.0350588967562244,"score_gpt":0.21156965668036995,"score_spread":0.17651075992414555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W938248294","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008042139,0.0015103496,0.5255686,0.000023075589,0.00028037853,0.00031028915,0.000021432481,0.00014862063,0.4721292],"genre_scores_gemma":[0.025837261,0.0012734549,0.0012241927,0.00020814502,0.0002872747,0.000007894686,0.00007912546,0.000059365622,0.97102326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981476,0.00012845604,0.00029111406,0.0006824967,0.00024922687,0.0005011086],"domain_scores_gemma":[0.99738777,0.0002574564,0.0003145848,0.0012859337,0.0004932422,0.0002609865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027241206,0.0004809048,0.00048870855,0.0001814165,0.00078450824,0.0001583907,0.0018328113,0.00037736216,0.000004939517],"category_scores_gemma":[0.000006465261,0.0005542735,0.00027839106,0.0000328408,0.00018938346,0.00017570834,0.0014761703,0.0005258688,0.000007697609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024328485,0.00001766798,2.1876198e-7,0.000016287007,0.00009775152,0.000019033654,0.00011311009,0.0008278659,0.000085750195,0.96459675,0.009173001,0.025028232],"study_design_scores_gemma":[0.00045282178,0.0000420532,5.7624084e-7,0.00015075001,0.00007489803,0.0000049506884,0.000010565045,0.21613055,0.0004812188,0.000007690758,0.7820825,0.0005614054],"about_ca_topic_score_codex":0.000008293043,"about_ca_topic_score_gemma":0.0000018217318,"teacher_disagreement_score":0.96458906,"about_ca_system_score_codex":0.0002980265,"about_ca_system_score_gemma":0.00013333252,"threshold_uncertainty_score":0.9996909},"labels":[],"label_agreement":null},{"id":"W970503498","doi":"10.1007/978-3-319-04603-7_3","title":"Efficient Incentive Scheme","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Payment; Computer network; Node (physics); Scheme (mathematics); Receipt; Public-key cryptography; Network packet; Computer security; Key (lock); Protocol (science); Incentive; Encryption; World Wide Web; Mathematics; Engineering","score_opus":0.02779954367835332,"score_gpt":0.25916047696920685,"score_spread":0.23136093329085353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W970503498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022960115,0.00045694716,0.85027844,0.0004624669,0.0014358012,0.00031765635,9.1987306e-7,0.0002304546,0.14658768],"genre_scores_gemma":[0.3575968,0.0011297291,0.5905907,0.0038824517,0.0012274118,0.00005517658,0.0000066380726,0.00013254822,0.045378517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961945,0.000061333565,0.0006185286,0.0014717577,0.000978457,0.00067547045],"domain_scores_gemma":[0.99633664,0.00018195322,0.0003222991,0.002512403,0.000406629,0.00024010117],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017078008,0.0004708116,0.00050469715,0.0007603391,0.00044111002,0.00059504714,0.0058139586,0.00016799475,0.000065123524],"category_scores_gemma":[0.000052756932,0.00048679762,0.00013600804,0.0006816291,0.00083259057,0.00021907238,0.0053297696,0.00081339275,0.00030891155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014678284,0.000019899295,0.000023724817,0.000011152393,0.0000060917155,0.000014512899,0.00028552787,0.00206624,0.00006539953,0.81885946,0.00011059296,0.17853594],"study_design_scores_gemma":[0.00030835724,0.00007158507,0.00052955013,0.00049843435,0.000003089628,0.000012445982,5.1874565e-7,0.9275272,0.00015434947,0.0044270824,0.06571172,0.0007556671],"about_ca_topic_score_codex":0.000003951732,"about_ca_topic_score_gemma":0.000017784072,"teacher_disagreement_score":0.92546093,"about_ca_system_score_codex":0.00047891945,"about_ca_system_score_gemma":0.00046445508,"threshold_uncertainty_score":0.99975836},"labels":[],"label_agreement":null}]}